• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2008년 추계학술대회논문집
• /
• pp.71-78
• /
• 2008

For analyses of multi-phase flows in a water-cooled nuclear power plant, a three-dimensional SIMPLE-algorithm based hydrodynamic solver CUPID-S has been developed. As governing equations, it adopts a two-fluid three-field model for the two-phase flows. The three fields represent a continuous liquid, a dispersed droplets, and a vapour field. The governing equations are discretized by a finite volume method on an unstructured grid to handle the geometrical complexity of the nuclear reactors. The phasic momentum equations are coupled and solved with a sparse block Gauss-Seidel matrix solver to increase a numerical stability. The pressure correction equation derived by summing the phasic volume fraction equations is applied on the unstructured mesh in the context of a cell-centered co-located scheme. This paper presents the numerical method and the preliminary results of the calculations.

• 대한기계학회논문집
• /
• 제19권1호
• /
• pp.99-110
• /
• 1995

An industrial robot needs a simple and robust control algorithm obtaining high precision control performance in spite of disturbance and parameter's change. In this paper, for solving this problem, a new sliding mode control algorithm is proposed and applied to the trajectory control of a SCARA type robot. The proposed algorithm has diminished the chattering occurring in sliding mode by setting a dead band along the switching line on the phase plane. It shows that we can easily obtain a simple switching control input satisfying sliding mode in spite of regarding nonlinear terms of a manipulator and servo system as disturbance. A guideline for selection of dead-band width is determined by optimal value of cost function presenting magnitudes of chattering and error. By this algorithm, we can expect the high performance of the trajectory tracking of an industrial robot which needs a robust and simple algorithm.

• 한국지능시스템학회논문지
• /
• 제19권3호
• /
• pp.432-436
• /
• 2009

We have developed a new optimization algorithm termed simple bacteria cooperative optimization (sBCO) based on bacteria behavior patterns [1]. In [1], we have introduced the algorithm with basic operations and showed its feasibility with some function optimization problems. Since the sBCO was the first version with only basic operations, its performance was not so good. In this paper, we adopt a new operation, rank replacement, to the sBCO for improving its performance and compare its results to those of the simple genetic algorithm (sGA) which has been well known and widely used as an optimization algorithm. It was found from the experiments with four function optimization problems that the sBCO with rank replacement was superior to the sGA. This shows that our algorithm can be a good optimization algorithm.

• Journal of information and communication convergence engineering
• /
• 제8권1호
• /
• pp.59-63
• /
• 2010

The shortest path between two points inside a simple polygon P is a minimum-length path among all paths connecting them which don't pass by the exterior of P. A linear time algorithm for computing the shortest path in a general simple polygon requires triangulating a given polygon as preprocessing. The linear time triangulating is known to very complex to understand and implement it. It is also inefficient in case that the input without very large size is given because its time complexity has a big constant factor. Two points of a polygon P are said to be L-visible from each other if they can be joined by a simple chain of at most two rectilinear line segments contained in P completely. An L-visible polygon P is a polygon such that there is a point from which every point of P is L-visible. We present the customized optimal shortest path algorithm for an L-visible polygon. Our algorithm doesn't require triangulating as preprocessing and consists of simple procedures such as construction of convex hulls and operations for convex polygons, so it is easy to implement and runs very fast in linear time.

• 로봇학회논문지
• /
• 제14권4호
• /
• pp.301-310
• /
• 2019

A new algorithm has been propose to detect the reflected light region as disturbances in a real-time vision system. There have been several attempts to detect existing reflected light region. The conventional mathematical approach requires a lot of complex processes so that it is not suitable for a real-time vision system. On the other hand, when a simple detection process has been applied, the reflected light region can not be detected accurately. Therefore, in order to detect reflected light region for a real-time vision system, the detection process requires a new algorithm that is as simple and accurate as possible. In order to extract the reflected light, the proposed algorithm has been adopted several filter equations and clustering processes in the HSI (Hue Saturation Intensity) color space. Also the proposed algorithm used the pre-defined reflected light data generated through the clustering processes to make the algorithm simple. To demonstrate the effectiveness of the proposed algorithm, several images with the reflected region have been used and the reflected regions are detected successfully.

• 한국경영과학회지
• /
• 제12권2호
• /
• pp.36-41
• /
• 1987

This paper presents a heuristic algorithm for solving the simple facility location problem. Its main procedure is essentially of 'add' type, which progressively selects facilities to open according to a certain criterion derived from the analysis of the linear programming dual. Computational experience with test problem from the literature is presented.

• International Journal of Aeronautical and Space Sciences
• /
• 제11권2호
• /
• pp.136-144
• /
• 2010

This paper presents an algorithm for planning waypoints for the operation of a surveillance mission using cooperative unmanned aerial vehicles (UAVs) in a given map. This algorithm is rather simple and intuitive; therefore, this algorithm is easily applied to actual scenarios as well as easily handled by operators. It is assumed that UAVs do not possess complete information about targets; therefore, kinematics, intelligence, and so forth of the targets are not considered when the algorithm is in operation. This assumption is reasonable since the algorithm is solely focused on a surveillance mission. Various parameters are introduced to make the algorithm flexible and adjustable. They are related to various cost functions, which is the main idea of this algorithm. These cost functions consist of certainty of map, waypoints of co-worker UAVs, their own current positions, and a level of interest. Each cost function is formed by simple and intuitive equations, and features are handled using the aforementioned parameters.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2009년도 추계학술대회
• /
• pp.510-513
• /
• 2009

In this paper, a novel speed control algorithm of DC motors is presented. The key contribution here is a simple speed controller only with speed feedback and without an inner current control loop. This is possible by adjusting the reference speed based on a certain rule. Therefore, the proposed speed controller here becomes simpler while maintaining the control performance. Moreover, with the proposed controller, the system response can be tuned with less complexity. This proposed control method is investigated both mathematically and experimentally.

• Steel and Composite Structures
• /
• 제25권4호
• /
• pp.473-484
• /
• 2017

In this study a seismic retrofit scheme for a building structure was presented using steel plate slit dampers. The energy dissipation capacity of the slit damper used in the retrofit was verified by cyclic loading test. Genetic algorithm was applied to find out the optimum locations of the slit dampers satisfying the target displacement. The seismic retrofit of the model structure using the slit dampers was compared with the retrofit with enlarging shear walls. A simple damper distribution method was proposed using the capacity spectrum method along with the damper distribution pattern proportional to the inter-story drifts. The validity of the simple story-wise damper distribution procedure was verified by comparing the results of genetic algorithm. It was observed that the capacity-spectrum method combined with the simple damper distribution pattern leaded to satisfactory story-wise distribution of dampers compatible with the optimum solution obtained from genetic algorithm.

• International journal of advanced smart convergence
• /
• 제9권3호
• /
• pp.85-96
• /
• 2020

It is important to extract salient object image and to solve the invariance problem for image recognition. In this paper we propose a new hybrid algorithm for invariance and improved classification performance in image recognition, whose algorithm is combined by FT(Frequency-tuned Salient Region Detection) algorithm, Guided filter, Zernike moments, and a simple artificial neural network (Multi-layer Perceptron). The conventional FT algorithm is used to extract initial salient object image, the guided filtering to preserve edge details, Zernike moments to solve invariance problem, and a classification to recognize the extracted image. For guided filtering, guided filter is used, and Multi-layer Perceptron which is a simple artificial neural networks is introduced for classification. Experimental results show that this algorithm can achieve a superior performance in the process of extracting salient object image and invariant moment feature. And the results show that the algorithm can also classifies the extracted object image with improved recognition rate.