• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.10a
• /
• pp.25-30
• /
• 1997

Genetic Algorithm(GA) is a parallel, global search technique modeled with the Darwinian principle of survival and reproduction of the fittest. Since Holland has proposed GA called the Simple GA, considerable research has focused of improving Simple GA performance. In this paper, I describe some methods of GA's modeling in different field.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.12
• /
• pp.2009-2018
• /
• 2001

This paper presents a region offsetting algorithm for tool-path generation. The proposed region offsetting algorithm is developed by expanding the 'PWID offset algorithm [Choi and Park, 1999]'designed to offset a simple polygon. The PWID offset algorithm has three important steps; 1) remove 'local invalid ranges'by invoking a PWID test, 2) construct a raw offset owe and 3) remove 'global invalid ranges'by finding self-intersections of the raw offset cure. To develop a region offsetting algorithm, we modified the PWID offset algorithm by expanding the concept of the 'global invalid range'in the third step. The time complexity of the proposed algorithm is approximately Ο(n), where n is the number of points, and it is free of numerical errors for practical purposes. The proposed algorithm has been implemented and tested with various real regions obtained by intersecting a sculptured surface with a plane.

• Proceedings of the Korean Society of Medical Physics Conference
• /
• 2006.08a
• /
• pp.95-95
• /
• 2006

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.11
• /
• pp.1022-1028
• /
• 2013

It is well knowns that based on the CSP (Common Spatial Pattern) algorithm, the linear projection of an EEG (Electroencephalography) signal can be made to spaces that optimize the discriminant between two patterns. Sharing disadvantages from linear time invariant systems, CSP suffers from the non-stationary nature of EEGs causing the performance of the classification in a BCI (Brain-Computer Interface) system to drop significantly when comparing the training data and test data. The author has suggested a simple idea based on the parallel model of CSP filters to improve the performance of BCI systems. The model was tested with a simple CSP algorithm (without any elaborate regularizing methods) and a perceptron learning algorithm as a classifier to determine the improvement of the system. The simulation showed that the parallel model could improve classification performance by over 10% compared to conventional CSP methods.

• Proceedings of the KSME Conference
• /
• 2001.11a
• /
• pp.533-538
• /
• 2001

This paper describes a combinational method to compute the global and local solutions of optimization problems. The present hybrid algorithm uses both a genetic algorithm and a local concentrate search algorithm (e. g simplex method). The hybrid algorithm is not only faster than the standard genetic algorithm but also supplies a more accurate solution. In addition, this algorithm can find the global and local optimum solutions. The present algorithm can be supplied to minimize the resonance response (Q factor) and to yield the critical speeds as far from the operating speed as possible. These factors play very important roles in designing a rotor-bearing system under the dynamic behavior constraint. In the present work, the shaft diameter, the bearing length, and clearance are used as the design variables.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.45.6-45
• /
• 2002

In this paper, a novel optimization algorithm which searches for the local minima of a given cost function is proposed using the familiar property of a binary string, and is applied to the parametric identification of a continuous-time state equation by the estimation of system parameters as well as initial state values. A simple electrical circuit severs as an example, whose precise identification results show the superiority of the proposed algorithm.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.1
• /
• pp.61-67
• /
• 1985

The new computer vision system which can reconstruct contours of parallel fault planes with horizon of 3-D curved objects has been developed. With the system, the shape of 3-D objects was measured by Simple Back-Projection algorithm which is a fundamental one in C.T.(Computed Tomography). And, the curvature in differential geometry characterizes any curve. Devising it, the method to represent each contour of 3-D curved objects with the system is described in this paper.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.26 no.11
• /
• pp.1521-1530
• /
• 2002

This article proposes a pressure based method for predicting flows at all speeds. The compressible SIMPLE algorithm is extended to unstructured grid framework. Convection terms are discretized using second-order scheme with deferred correction approach. Diffusion term discretization is based on structured grid analogy that can be easily adopted to hybrid unstructured grid solver. This method also uses node centered scheme with edge based data structure for memory and computing time efficiency of arbitrary grid types. Both incompressible and compressible benchmark problems are solved using the above methodology. The demonstration of this method is extended to slip flow problem that has low Reynolds number but compressibility effect. It is shown that the proposed method can improve efficiency in memory usage and computing time without losing any accuracy.

• International Journal of Advanced Culture Technology
• /
• v.4 no.2
• /
• pp.38-42
• /
• 2016

In the growing data saturated world, the question of "whether data can be used" has shifted to "can it be utilized effectively?" More data is being generated and utilized than ever before. As the collection of data increases, data mining techniques also must become more and more accurate. Thus, to ensure this data is effectively utilized, the analysis of the data must be efficient. Interpretation of results from the analysis of the data set presented, have their own on the basis it is possible to obtain the desired data. In the data mining method a decision tree, clustering, there is such a relationship has not yet been fully developed algorithm actually still impact of various factors. In this experiment, the classification method of data mining techniques is used with easy decision tree. Also, it is used special technology of one R and J48 classification technique in the decision tree. After selecting a rule that a small error in the "one rule" in one R classification, to create one of the rules of the prediction data, it is simple and accurate classification algorithm. To create a rule for the prediction, we make up a frequency table of each prediction of the goal. This is then displayed by creating rules with one R, state-of-the-art, classification algorithm while creating a simple rule to be interpreted by the researcher. While the following can be correctly classified the pattern specified in the classification J48, using the concept of a simple decision tree information theory for configuring information theory. To compare the one R algorithm, it can be analyzed error rate and accuracy. One R and J48 are generally frequently used two classifications${\ldots}$

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.11a
• /
• pp.883-886
• /
• 2004

Many of facial feature extracting applications and systems have been developed in the field of face recognition systems and its application, and most of them use the eyes as a key-feature of human face. In this paper we show a simple and fast eye detection algorithm for embedded systems. The eyes are very important facial features because of the attribution they have. For example, we know the darkest regions in a face are the pair of pupils, and the eyes are always a pair and parallel. Using such attributors, our algorithm works well under various light conditions, size of face in image, and various pose such as panning and tilting. The main keys to develop this algorithm are the eyes' attribution that we can usually contemplate and easily find when we think about what is the attribution that the eyes have. With some constraints of the eyes and knowledge of the anthropometric human face, we detect human eye in an image, and the experimental results demonstrate successful eye detection.