• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1758-1761
• /
• 1997

The problem of long range capacity expansion planing for chemical processing network under uncertain demand forecast secnarios is addressed. This optimization problem involves capactiy expansion timing and sizing of each chemical processing unit to maximize the expected net present value considering the deviation of net present values and the excess capacity over a given time horizon. A multiperiod mixed integer nonlinear programming optimization model that is both solution and modle robust for any realization of demand scenarios is developed using the two-stage stochastic programming algorithm. Two example problems are considered to illustrate the effectiveness of the model.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.5
• /
• pp.444-452
• /
• 2008

This paper presents an overall image processing approach of defect inspection of patterned TFT-LCD panels for the real manufacturing process. A prototype of AOI(Automatic Optical Inspection) system which is composed of air floating stage and multi line scan cameras is developed. Adjacent pattern comparison algorithm is enhanced and used for pattern elimination to extract defects in the patterned image of TFT-LCD panels. New region merging algorithm which is based on border expansion is proposed to identify defects from the pattern eliminated defect image. Experimental results show that a developed AOI system has acceptable performance and the proposed algorithm reduces environmental effects and processing time effectively for applying to the real manufacturing process.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.2
• /
• pp.238-245
• /
• 2011

We suggest a DES key expansion algorithm which is strong enough to overcome Differential Cryptanalysis(DC) and Linear Cryptanalysis(LC). Checking the weak points of DES, we found that the opened S box provide all information on the various kinds of attack. Using the key expansion we redesigned the S box which is not open to anybody who has no key. DC and LC can not be applied to the suggested algorithm without the redesigned S box information. With the computer experiments we show that the efficiency of this algorithm is almost the same as that of DES with respect to the crypto speed.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.25 no.10
• /
• pp.677-684
• /
• 2015

It is often necessary to predict the vibration patterns of the structures from the signals of finite number of vibration sensors. This study presents the optimal placement of vibration sensors by applying the genetic algorithm and the modal expansion method. The modal expansion method is used to estimate the vibration response of the whole structure. The genetic algorithm is used to estimate the optimal placement of vibration sensors. Optimal sensor placement can be obtained so that the fitness function is minimized in the genetic algorithm. This paper discusses the comparison of the performances of two types of fitness functions, modal assurance criteria(MAC) and condition number( CN). As a result, the estimation using MAC shows better performance than using CN.

• Proceedings of the SAREK Conference
• /
• 2005.11a
• /
• pp.469-473
• /
• 2005

Capacities of a tandom-type air-conditioner may be modulated by turning on/off multiple compressors and adjusting positions of a electronic expansion valve. In this study. control algorithms for compressors and a electronic expansion valve were developed by using fuzzy’ logics. There algorithms were implemented in a test lab and proved to be effective for the control of indoor air temperature and superheat temperature.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.5
• /
• pp.161-166
• /
• 2016

This paper suggests heuristic algorithm with O(m) linear time complexity for choice of expansion projects that can't be obtain the optimal solution using linear programming until now. This algorithm ascending sort of net profit for all projects. Then, we apply a simple method that deletes the project with minimum net profit until this result satisfies the carried over for n-years more than zero value. While this algorithm using simple rule, not the linear programing fails but the proposed algorithm can be get the optimal solution for experimental data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2619-2643
• /
• 2018

In this paper, a new clustering algorithm based on the connected region generation (CRG-clustering) is proposed. It is an effective and robust approach to clustering on the basis of the connectivity of the points and their neighbors. In the new algorithm, a connected region generating (CRG) algorithm is developed to obtain the connected regions and an isolated point set. Each connected region corresponds to a homogeneous cluster and this ensures the separability of an arbitrary data set theoretically. Then, a region expansion strategy and a consensus criterion are used to deal with the points in the isolated point set. Experimental results on the synthetic datasets and the real world datasets show that the proposed algorithm has high performance and is insensitive to noise.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.15 no.5
• /
• pp.382-388
• /
• 2003

Refrigerant flow rates of the multi-type air-conditioning system can be regulated by electronic expansion valves (EEV). The performance of the multi-type air-conditioning system may be improved by lowering the superheat at the compressor suction side. In this study, a superheat temperature setpoint reset algorithm was developed by using fuzzy logics, and a PI algorithm was applied to control the superheat temperature near setpoints. Experimental results showed energy savings and stable operations at a multi-type air-conditioning system. Therefore, the developed setpoint reset algorithm may be effectively used for the EEV superheat temperature control of the multi-type air-conditioning system.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.1
• /
• pp.71-79
• /
• 2010

This paper addresses capacity expansion planning model of distribution center under usability of public distribution center. For discrete and finite time periods, demands for distribution center increase dynamically. The capacity expansion planning is to determine the capacity expansion size of private distribution center and usage size of public distribution center for each period through the time periods. The capacity expansion of private distribution center or lease usage of public distribution center must be done to satisfy demand increase for distribution center. The costs are capacity expansion cost and excess capacity holding cost of private distribution center, lease usage cost of public distribution center. Capacity expansion planning of minimizing the total costs is mathematically modelled. The properties of optimal solution are characterized and a dynamic programming algorithm is developed. A numerical example is shown to explain the problem.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.2
• /
• pp.57-68
• /
• 2004

We present a new parallel algorithm for extending the domain of a UOWHF. Our algorithm is based on non-complete l-ary tree and has the same optimal key length expansion as Shoup's which has the most efficient key length expansion known so far. Using the recent result [8], we can also prove that the key length expansion of this algorithm and Shoup's sequential algorithm are the minimum possible for any algorithms in a large class of "natural" domain extending algorithms. But its prallelizability performance is less efficient than complete tree based constructions. However if l is getting larger then the parallelizability of the construction is also getting near to that of complete tree based constructions.tructions.