• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6B
• /
• pp.1100-1105
• /
• 2000

The most widely used radar pulse compression technique is correlation processing using Barker code. This technique enhances detection sensitivity but, unfortunately, suffers from the addition of range sidelobes which sometimes will degrade the performance of radar systems. In this paper, our proposed optimal algorithm eliminates the sidelobes at the cost of additional processing and is evaluated in the presence of Doppler shift. We then propose optimal codes with regard to the proposed algorithm and the performance is compared against the traditional correlation processing with Barker codes. The proposed processing using optimal codes will be shown to be superior over the traditional processing in the presence of Doppler shift.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.358-358
• /
• 2000

An iterative learning control technique based on a linear quadratic optimal criterion is proposed for temperature uniformity control of a silicon wafer in rapid thermal processing.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.7
• /
• pp.465-472
• /
• 2004

Analog CPPN-based optimal road boundary detection algorithm for autonomous vehicle is proposed. The CPPN is a massively connected analog parallel array processor. In the paper, the dynamic programming which is an efficient algorithm to find the optimal path is implemented with the CPPN algorithm. If the image of road-boundary information is utilized as an inter-cell distance, and goals and start lines are positioned at the top and the bottom of the image, respectively, the optimal path finding algorithm can be exploited for optimal road boundary detection. By virtue of the parallel and analog processing of the CPPN and the optimal solution of the dynamic programming, the proposed road boundary detection algorithm is expected to have very high speed and robust processing if it is implemented into circuits. The proposed road boundary algorithm is described and simulation results are reported.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.41 no.1
• /
• pp.87-98
• /
• 2016

A single machine scheduling problem for jobs with stochastic processing time is considered in this study. Shortest processing time (SPT) sequencing according to the expected processing times of jobs is optimal for schedules with minimal expected mean flow time when all the jobs arrive to be scheduled and their expected processing times are known. However, SPT sequencing according to the expected processing time may not be optimal for the minimization of the mean flow time when the actual processing times of jobs are known. This study evaluates the complexity of SPT sequencing through a comparison of the mean flow times of schedules based on the expected processing times and actual processing times of randomly generated jobs. Evaluation results show that SPT sequencing according to the expected flow time exhibits chaotic variation to the optimal mean flow time. The relative deviation from the optimal mean flow time increases as the number of jobs, processing time, or coefficient of variation increases.

• IE interfaces
• /
• v.9 no.1
• /
• pp.13-24
• /
• 1996

Quality of injection molded parts is dependent on both mold design and processing conditions. From the mold design point of view, an optimal shrinkage should be used to compensate the shrinkage of molded parts. From the processing point of view, it is important to analyze the priority of processing conditions because a number processing conditions affect the quality of molded parts. Processing analysis employing the design of experiment was performed, and the shrinkage of molded part was considered as a characteristic parameter to improve the quality. As the result of the analysis of variance on SN ratio of a characteristic value, injection speed and bolding pressure were selected as two effective process parameters. Regression analysis on shrinkage and processing conditions was carried out, and an optimal processing condition was obtained by the response surface analysis. Shrinkage at the optimal condition could be used to reduce the number of try-cut at the step of mold making. The ranges of indirect control parameter, such as maximum cavity pressure or weight, measured at the optimal processing condition were used for monitoring the quality of molded parts in process.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.737-740
• /
• 1999

This paper deals with a real time optimization algorithm within real time for DRGS(Dynamic Route Guidance System) and evaluate the algorithm. A pre-developed system offers the optimal route in using only static traffic information. In using real-time traffic information, Dynamic route guidance algorithm is needed. The serious problem in implementing it is processing time increase as nodes increase and then the real time processing is impossible. Thus, in this paper we propose the optimal route algorithm with window mechanism for the real-time processing and then evaluate the algorithms.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.9
• /
• pp.2173-2184
• /
• 1997

Among spatial queries handled in spatial database systems, nearest neighbor queries to find the nearest spatial object from the given locaion occur frequently. The number of searched nodes in an index must be minimized in order to increase the performance of nearest neighbor queries. An Existing approach considered only the processing of an nearest neighbor query in a two-dimensional search space and could not optimize the number of searched nodes accurately. In this paper, we propose the optimal search distance and prove its properties. The proposed optimal search distance is the measurement of a new search distance for accurately selecting the nodes which will be searched in processing nearest neighbor queries. We present an algorithm for processing the nearest neighbor query by applying the optimal search distance to R-trees and prove that the result of query processing is correcter than the existing approach.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.1
• /
• pp.13-18
• /
• 2006

The purpose of this paper is to identify optimal designs of server port connections between two server system for 200-300 user group. Given 3 empirical models as user and port parallel server types under some conditions of 100 Mbps and optimal CPU temperature suggested by Lee and Kim(2005), our results are shown; port parallel model was optimal when traffic processing times measured, and 250 traffics was jumping point as a critical point in our cases.

• Journal of Advanced Marine Engineering and Technology
• /
• v.28 no.7
• /
• pp.1159-1164
• /
• 2004

There is an Overhead Hoist Transport(OHT) for delivering the wafer in semiconductor processing. The transfer system is consists of carrier vehicle. rail, and support. OHTCMS(OHT Control and Management System) has to take the feature, such as the optimal control and integration with several OHT. In this paper, ESRA(Efficiency of Shortest - Route Algorithms) is proposed which can be transported optimal route and be prevented collision using the Floyd-Warshall algorithms. The proposed algorithm is verified through consecutive simulation for a long time.

• Korean Journal of Fisheries and Aquatic Sciences
• /
• v.48 no.1
• /
• pp.36-43
• /
• 2015

We examined sensory characteristics to determine the optimal conditions for flounder Verasper moseri Jordan et Gilbert sikhe preparation, using response surface methodology. Our aim was to develop the optimum mixing rates and materials for producing highly palatable flounder sikhe. The optimal fermentation temperature, salt concentration, and fermentation period for preparing flounder sikhe of acceptable quality were $11.63^{\circ}C$, 4.66% and 9.12 days, respectively. The optimal percentages of red pepper powder, garlic, monosodium glutamate, ginger, radish and foxtail millet were 16.08%, 7.21%, 2.96%, 3.70%, 10.12% and 13.72% respectively.