• Korean Management Science Review
• /
• v.12 no.3
• /
• pp.45-60
• /
• 1995

This study examines a normative model of project management systems, PPMS, to provide information for directing R&D activity in order to increase R&D productivity. The PPMS (Project Process Management System) is a disciplined and systematic framework to manage R&D projects effectively and efficiently under the assumption of a strategic decision making and long-range planning. The purpose of PPMS is to provide for the management of research organization at different levels an effective management tool; first, for the planning system which deals with rational selection and authorization of R&D projects, second, for the control system which concerns monitoring and controlling the execution of R&D projects, and finally, for the evaluation system which attains evaluation of the performance results of R&D projects and determination of the necessary follow-up. A view for the future development of project management within the context of a project-performing organization is also elaborated to exhibit the progress and phase description of the project management system.

• Proceedings of the SAREK Conference
• /
• 2007.11a
• /
• pp.29-33
• /
• 2007

In order to protect the environment from the refrigerant pollution, the $CO_2$ may be regarded as one of the most attractive alternative refrigerants for an automotive air-conditioning system. Control methods for a $CO_2$ system should be different because of $CO_2$'s unique properties as a refrigerant. Especially, the high-side pressure of a $CO_2$ system should be controlled for the effective operation of the system. In this study, the high-side pressure setpoint algorithm was developed by using a neural network and a Lagrange interpolation method. These methods were compared. Simulation results showed that a Lagrange interpolation method was more effective than a neural network in the respect of its easiness of programming and shorter execution time.

• Journal of the Korea Society for Simulation
• /
• v.11 no.3
• /
• pp.23-34
• /
• 2002

Dynamic storage allocation (DSA) is a field fairly well studied for a long time as a basic problem of system software area. Due to memory fragmentation problem of DSA and its unpredictable worst case execution time, real-time system designers have believed that DSA may not be promising for real-time application service. Recently, the need for an efficient DSA algorithm is widely discussed and the algorithm is considered to be very important in the real-time system. This paper proposes an efficient DSA algorithm called QSB (quick semi-buddy) which is designed to be suitable for real-time environment. QSB scheme effectively maintains free lists based on quick-fit approach to quickly accommodate small and frequent memory requests, and the other free lists devised with adaptation upon a typical binary buddy mechanism for bigger requests in harmony for the .improved performance. Comprehensive simulation results show that the proposed scheme outperforms QHF which is known to be effective in terms of memory fragmentation up to about 16%. Furthermore, the memory allocation failure ratio is significantly decreased and the worst case execution time is predictable.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.2
• /
• pp.73-83
• /
• 2011

In the manufacturing system, production-planning is very important in effective management for expensive production facilities and machineries. To enhance efficiency of Manufacturing Execution System(MES), a manufacturing system that reduces the difference between planning and execution, certain production-planning needs a dispatching rule that is properly designed for characteristic of work information and there should be a appropriate selection for the rule as well. Therefore, in this paper dispatching rule will be selected by several simulations based on characteristics of work information derived from process planning data. By constructing information that are from simulation into ontology, one of the knowledge-based-reasoning, production planning platform based on the selection of dispatching rule will be demonstrated. The platform has strength in its wider usage that is not limited to where it is applied. To demonstrate the platform, RacerPro and Prot$\acute{e}$g$\acute{e}$ are used in parts of ontology reasoning, and JAVA and FlexChart were applied for production-planning simulation.

• Journal of the Korea Convergence Society
• /
• v.12 no.10
• /
• pp.71-79
• /
• 2021

In the manufacturing industry, there is a transition to multi-item production for reinforcement of competitiveness. Therefore, the hybrid manufacturing technology is increasing. Especially, many efforts in production quality improvement are made through the adoption of the manufacturing execution system and ERP, so it is necessary to operate MES for prompt and effective management. MES should improve ineffective parts in production activities while managing all stages related to production of products. If there is change in the process, the changed items should be reflected to the system. However, most manufacturing execution systems are operated passively and repetitively by system administrators. This study presents a model that system administrators can comprehensively apply reference information about production related requirements on specific line's equipment to the same equipment of other lines. The flexible response for application to production lines is possible thanks to the division of blanket application and selective application of reference information through proposed model.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.510-513
• /
• 1988

This paper describes an effective trunk loop signal processing method and analyzes execution time of program in the DTCP(Digital Trunk Circuit Processor) in the TDX-1A digital switching system. To predict a maximum trunk capacity, also analyzes to Z80A system clock(4Mbit/s, 2.5Mbit/s) and scanning period(8mS,5mS) respectively.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.6
• /
• pp.549-557
• /
• 2000

Distributed Memory Machine(DMM) is necessary for the effective computation of the data which is complicated and very large. Task scheduling is a method that reduces the communication time among tasks to reduce the total execution time of application program and is very important for the improvement of DMM. Task Duplicated based Scheduling(TDS) method improves execution time by reducing communication time of tasks. It uses clustering method which schedules tasks of the large communication time on the same processor. But there is a problem that cannot optimize communication time between task sending data and task receiving data. Hence, this paper proposes a new method which solves the above problem in TDS. Modified Task Duplicated based Scheduling(MTDS) method which can approximately optimize the communication time between task sending data and task receiving data by checking the optimal condition, resulted in the minimization of task execution time by reducing the communication time among tasks. Also system modeling shows that task execution time of MTDS is about 70% faster than that of TDS in the best case and the same as the result of TDS in the worst case. It proves that MTDS method is better than TDS method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.3
• /
• pp.127-137
• /
• 2010

As large-scale computational applications in various scientific domains have been utilized over many integrated sets of grid computing resources, the difficulty of their execution management and control has been increased. It is beneficial to refer job history generated from many application executions, in order to identify application‘s characteristics and to decide selection policies of grid resource meaningfully. In this paper, we apply a statistical technique, Plackett-Burman design with fold-over (PBDF), for analyzing grid environments and execution history of applications. PBDF design identifies main factors in grid environments and applications, ranks based on how much they affect to their execution time. The effective factors are used for selecting reference job profiles and then preferable resource based on the reference profiles is chosen. An application is performed on the selected resource and its execution result is added to job history. Factor's credit is adjusted according to the actual execution time. For a proof-of-concept, we analyzed job history from an aerospace research grid system to get characteristics of grid resource and applications. We built JARS algorithm and simulated the algorithm with the analyzed job history. The simulation result shows good reliability and considerable performance in grid environment with frequently crashed resources.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.1
• /
• pp.1196-1204
• /
• 2001

In this paper, a new architecture of operating software associated with the component-based method is proposed. The proposed architecture comprises 문 execution module and a decision-making module. In order to make effective development and maintenance, the execution module is divided into three components. The components are referred to as Symbol, Gateway, and Control, respectively: The symbol component is for the GUI environments and the standard interfaces; the gateway component is for the network communication and the structure of asynchronous processes; the control component is for the asynchronous processing and machine setting or operations. In order to verify the proposed architecture, and off-line version of operating software is made, and its steps are as follows; I) Make virtual execution modules for the manufacturing devices such as dual-arm robot, handling robot, CNC, and sensor; ii) Make decision-making module; iii) Integrate the modules and GUI using a well-known development tools such as Microsofts Visual Basic; iv) Execute the overall operating software to validate the proposed architecture. The proposed software architecture in this paper has the advantages such as independent development of each module, easy development of network communication, and distributed processing of resources, and so on.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.3
• /
• pp.576-599
• /
• 2013

Protocol reverse engineering is useful for many security applications, including intelligent fuzzing, intrusion detection and fingerprint generation. Since manual reverse engineering is a time-consuming and tedious process, a number of automatic techniques have been proposed. However, the accuracy of these techniques is limited due to the complexity of binary instructions, and the derived formats have missed constraints that are critical for security applications. In this paper, we propose a new approach for protocol format extraction. Our approach reasons about only the evaluation behavior of a program on the input message from concolic execution, and enables field identification and constraint inference with high accuracy. Moreover, it performs binary analysis with low complexity by reducing modern instruction sets to BIL, a small, well-specified and architecture-independent language. We have implemented our approach into a system called Icefex and evaluated it over real-world implementations of DNS, eDonkey, FTP, HTTP and McAfee ePO protocols. Experimental results show that our approach is more accurate and effective at extracting protocol formats than other approaches.