• Journal of information and communication convergence engineering
• /
• 제15권4호
• /
• pp.227-231
• /
• 2017

Recently, as the number of safety accidents caused by reagents increases, researches on a system that can reduce safety accidents are underway. Existing systems managed reagent cabinet through various sensors. On the other hand, there are disadvantages in that countermeasures against simultaneous danger situations are insufficient at multi-reagents cabinet. In order to solve this problem, this paper proposes a system to manage the reagents cabinet through danger priority. Danger priorities are selected through domestic chemical accident cases and the Chemical Safety Management Act. If a danger situation occurs in the reagent cabinet, make sure it is from a single or multiple reagent cabinets. For multiple reagent cabinets, compare the reagent cabinet priorities and run the device sequentially from the reagent cabinet with the highest priority. Thus, by operating the device according to the danger priority, the chain reaction can be prevented in advance and the reagent cabinet can be safely managed.

• 한국원자력학회:학술대회논문집
• /
• 한국원자력학회 1998년도 춘계학술발표회논문집(2)
• /
• pp.577-582
• /
• 1998

In nuclear power plant, it has been the important object to reduce the occupational radiation exposure (ORE). Recently, the optimization concept of management science has been studied to reduce the ORE in nuclear power plant. In optimization of the worker allocation, the collective dose, working time, individual dose, an total number of worker must be considered and their priority orders must be thought because the main constraint is necessary for determining the constraints variable of the radiological worker allocation problem. The ultimate object of this study s to look into the change of the optimal allocation of the radiological worker as priority order changes. In this study, the priority order is the characteristic of goal programming that is a kind of multi-objective linear programming. From a result of study using goal programming, the total number of worker and collective dose of worker have changed as the priority order has changed and the collective dose limit have played an important role in reducing the ORE.

• 한국IT서비스학회지
• /
• 제13권3호
• /
• pp.201-219
• /
• 2014

This paper considers service deployment and priority optimization for multiple service-oriented applications sharing reusable services, which are deployed as multiple instances in the cloud. In order to handle variations in the workloads of the multiple applications, service instances of the individual reusable services are dynamically provisioned in the cloud. Also service priorities for each application in a particular reusable service are dynamically adjusted. In this paper, we propose an analytic performance model, based on a queueing network model, to predict the expected sojourn times of multiple service-oriented applications, given the number of service instances and priority disciplines in individual reusable services. We also propose a simple heuristic algorithm to search an optimal number of service instances in the cloud and service priority disciplines for each application in individual reusable services. A numerical example is also presented to demonstrate the applicability of the proposed performance model and algorithm to the proposed optimal decision problem.

• International Journal of Automotive Technology
• /
• 제8권1호
• /
• pp.39-48
• /
• 2007

This paper addresses the problem of period and priority assignment in networked control systems (NCSs) using a fixed priority scheduler. The problem of assigning periods and priorities to tasks and messages is formulated as an optimization problem to allow for a systematic approach. The temporal characteristics of an NCS should be considered by defining an appropriate performance index (PI) which represents the temporal behavior of the NCS. In this study, the sum of the end-to-end response times required to process all I/Os with precedence relationships is defined as a PI. Constraints are derived from the task and message deadline requirements to guarantee schedulability. Genetic algorithms are used to solve this constrained optimization problem because the optimization formulation is discrete and nonlinear. By considering the effects of communication, an optimum set of periods and priorities can be holistically derived.

• 한국국방경영분석학회지
• /
• 제30권2호
• /
• pp.122-132
• /
• 2004

The aim of this paper is to show the process of R&D Project-Priority Ordering in the Defense Technology field. We propose specific methods (Delphi, Analytic Hierarchy Process (AHP), Scoring) to order the R&D Project-Priority. In general, to decide the priority of R&D projects most of researches depend on questionnaires which are surveyed by experts. However, it is criticized that this process cannot reflect the limitation of experience and knowledge of experts. In this process, we separate evaluators in two parts: the first is strategic experts, the second is technical experts. Evaluators can choose and evaluate the alternatives which they are familiar with, so we can obtain reliable results. Finally, based on our process of the R&D Project-Priority Ordering we formulate policy implications for managing the defense technology.

• 대한화학회지
• /
• 제38권6호
• /
• pp.418-426
• /
• 1994

미국 환경청이 지정한 129종의 priority polluatants 중 40종의 비휘발성 염기/중성 유기화합물을 대상물질로 선정하였다. 분석방법으로 초음파 추출법(sonication extraction)과 Soxhlet 추출법(Soxhlet extraction)을 이용하여 토양에 있는 유기물을 추출 및 농축하여 기체크로마토그래프/질량분석기-SIM(selected ion monitoring)법으로 검출하였다. 표준물질이 첨가된 토양시료에 두 추출법을 적용하여 회수율을 구하고 정확도, 정밀도 및 검출한계를 측정하여 미량 분석의 가능성을 조사하였다.

• 대한화학회지
• /
• 제38권3호
• /
• pp.246-253
• /
• 1994

미국 환경청이 지정한 129종의 priority pollutants 중 11종의 비휘발성 산성 유기화합물을 대상물질로 선정하여 토양시료 중의 극미량 분석방법을 연구하였다. 분석방법으로 기체크로토그래프/질량분석기- SIM(selected ion monitoring)법을 검출방법으로 정하고, 토양시료의 추출 및 농축방법으로 사용한 초음파 추출법(sonication extraction)과 Soxhlet(Soxhlet extraction)을 비교 연구하였다. 각 화합물의 회수율, 상대표준편차 및 method detection limit를 측정하여 EPA분석법을 대체할 수 있는지의 가능성을 조사하였다.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 1993년도 제3회 정기총회 및 추계학술발표회
• /
• pp.16-16
• /
• 1993

The efficient use of capital intensive FMS requires determination of effective dispatching priority with which the parts of the selected part types are to be inputed into the system. This paper presents a simulation-optimization approach to find an appropriate dispatching priority. The study is based on a detailed simulator for a module-type commercial FMS, Specifically, after presenting the basic configuration and fundamental control logic of the system together with its main characteristics as a special type of a job shop, an algorithm is presented which combines simulated annealing and simulation to explore a dispatching priority of operations that minimizes the total tardiness, Computational performance of the algorithm shows that good solutions can be obtained within a reasonable amount of computations. The paper also compares the performance of the "optimal" or near optimal dispatching priority generated by the proposed algorithm with those generated by standard dispatching rules such as SPT, EDD and SLACK.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.3-4
• /
• 2006

Fast IP address lookup in routers is essential to achieve packet forwarding in wire-speed. The longest prefix matching for IP address lookup is more complex than exact matching because of its dual dimensions, length and value. By thoroughly studying the current proposals for IP address lookup, we find out that the binary search could be a low-cost solution while providing high performance. Most of the existing binary search algorithms based on trie have simple data structures which can be easily implemented, but they have some problems because of empty internal nodes. The proposed algorithm is based on trie structure, but empty internal nodes are replaced by priority prefixes. The best-matching-prefix search in the proposed algorithm is more efficiently performed since search can be finished earlier when input is matched with a priority prefix. The performance evaluation results show that the constructed priority-trie has very good performance in the lookup speed and the scalability.

• 설비공학논문집
• /
• 제12권2호
• /
• pp.140-149
• /
• 2000

A comparative analysis was peformed on the operation cost at partial loads between ice storage systems with the two conventional control strategies, i.e., storage priority and chiller priority. The storage priority control is shown to be more economic for small cooling loads, while the chiller priority control is superior when the cooling load is as large as the design value. Based on this finding, a new control strategy is devised for an ice-storage system to minimize the operation cost at any cooling load. The new control strategy is found to be comparable to the chiller priority for large cooling loads, while it is more economic for small loads compared to the conventional control strategies. The practicality of the new control strategy is also confirmed through a performance test applying the new control strategy to an existing ice-storage system.