• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.44 no.1
• /
• pp.21-24
• /
• 1995

The larger and the more complicated the system size and configuration grow, the more serious the system loss problem becomes. Exessive system loss causes severs system voltage depression, which even may result in system voltage collapse. This paper proposes an effective tool for minimizing the system power loss by optimal re-location of the static condenser based on the system loss sensitivity index .lambda.$_{Q}$. It is possible to determine the optimal location and amount of VAR investment for minimizing the system loss by priority of .lambda.$_{Q}$ index given for each bus. Several computational techniques for avoiding divergency of the load flow solution are proposed. The loss sensitivity index .lambda.$_{Q}$ uses information of normal power flow equations and their Jacobians. Two case studies proved the effectiveness of the algorithm proposed.posed.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.13 no.2
• /
• pp.94-103
• /
• 2004

The vision system model used for this study involves the six parameters that permits a kind of adaptability in that relationship between the camera space location of manipulable visual cues and the vector of robot joint coordinates is estimated in real time. Also this vision control method requires the number of cameras to transform 2-D camera plane from 3-D physical space, and be used irrespective of location of cameras, if visual cues are displayed in the same camera plane. Thus, this study is to investigate the optimal number of cameras used for the developed vision control system according to the change of the number of cameras. This study is processed in the two ways : a) effectiveness of vision system model b) optimal number of cameras. These results show the evidence of the adaptability of the developed vision control method using the optimal number of cameras.

• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• pp.16-18
• /
• 2004

The flexible AC transmissions system (FACTS) is the underpinning concept upon which are based promising means to avoid effectively power flow bottlenecks and ways to extend the loadability of existing power transmission networks. This paper proposes a method by which the optimal locations of the FACTS to be installed in power system under cost function. The optimal solution of this type of problem requires large scale nonlinear optimization techniques. We used Lagrange multipliers to solve a nonlinear equation with equality and ineaquality constraints. Case studies on the standard IEEE 14 bus system show that the method can be implemented successfully and that it is effective for determining the optimal location of the FACTS.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.7
• /
• pp.1309-1314
• /
• 2007

The assignment of cells to reporting or non-reporting cells is an NP-hard problem having an exponential complexity in the Reporting Cell Location Management (RCLM) system. Frequent location update may result in degradation of quality of service due to interference. Miss on the location of a mobile terminal will necessitate a search operation on the network when a call comes in. The number of reporting cells and which cell must be reporting cell should be determined to balance the registration (location update) and search (paging) operations to minimize the cost of RCLM system. T1is paper compares Max-Min ant system (MMAS), rank-based ant system (RAS) and hybrid method of MMAS and RAS that generally used to solve combinatorial optimization problems. Experimental results demonstrate that hybrid method of MMAS and RAS is an effective and competitive approach in fairly satisfactory results with respect to solution quality and execution time for the optimal design of location management system.

• Journal of Korean Society of Transportation
• /
• v.27 no.4
• /
• pp.103-113
• /
• 2009

Quick accident spot reaching of 119ERU is the most important role in decrease of accident depth. If 4 minutes of wounded person pass after cardiac arrest, brain damage is begun. and If 10 minutes of wounded person pass after cardiac arrest, possibility to die rises. Accordingly, when establish 119ERU, need to consider travel time to traffic accidents spot. This treatise groped a facility location problem using SCLM and minisum location problem mutually. And existent minisum location problem has a problem that maximum travel time exceed $\lambda$. ERU to need in present situation and also can reduce average travel time. so this treatise propose modified minisum location problem. In case applying modified minisum location theory, 119ERU can arrive all demand and that is optimized about demand and travel time. Can minimise figure of 119 first aids to need in present situation applying this way, and also can reduce average passing time. Finally, this way can minimise figure of 119ERU to need in present situation and also can reduce average travel time.

• Journal of KIISE:Software and Applications
• /
• v.31 no.7
• /
• pp.939-948
• /
• 2004

In this paper. we Propose a robust and fast image registration technique for motion correction in brain CT-CT angiography obtained from same patient to be taken at different time. First, the feature points of two images are respectively extracted by 3D edge detection technique, and they are converted to locally weighted 3D distance map in reference image. Second, we search the optimal location whore the cross-correlation of two edges is maximized while floating image is transformed rigidly to reference image. This optimal location is determined when the maximum value of cross-correlation does't change any more and iterates over constant number. Finally, two images are registered at optimal location by transforming floating image. In the experiment, we evaluate an accuracy and robustness using artificial image and give a visual inspection using clinical brain CT-CT angiography dataset. Our proposed method shows that two images can be registered at optimal location without converging at local maximum location robustly and rapidly by using locally weighted 3D distance map, even though we use a few number of feature points in those images.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.6
• /
• pp.785-791
• /
• 2021

In this paper, we propose a methodology for estimating the optimal traversable destination from the location-based information of the object recognized by the mobile robot to perform the object delivery service. The location estimation process is to apply the generalized Voronoi graph to the grid map to create an initial topology map composed of nodes and links, recognize objects and extract location data using RGB-D sensors, and collect the shape and distance information of obstacles. Then, by applying the hybrid approach that combines the center of gravity and thinning method, the optimal moving position for the service robot to perform the task of grabbing is estimated. And then, the optimal node information for the robot's work destination is updated by comparing the geometric distance between the estimated position and the existing node according to the node update rule.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.2
• /
• pp.46-53
• /
• 2016

In mobile communication systems, location management deals with the location determination of users in a network. One of the strategies used in location management is to partition the network into location areas. Each location area consists of a group of cells. The goal of location management is to partition the network into a number of location areas such that the total paging cost and handoff (or update) cost is a minimum. Finding the optimal number of location areas and the corresponding configuration of the partitioned network is a difficult combinatorial optimization problem. This cell grouping problem is to find a compromise between the location update and paging operations such that the cost of mobile terminal location tracking is a minimum in location area wireless network. In fact, this is shown to be an NP-complete problem in an earlier study. In this paper, artificial bee colony (ABC) is developed and proposed to obtain the best/optimal group of cells for location area planning for location management system. The performance of the artificial bee colony (ABC) is better than or similar to those of other population-based algorithms with the advantage of employing fewer control parameters. The important control parameter of ABC is only 'Limit' which is the number of trials after which a food source is assumed to be abandoned. Simulation results for 16, 36, and 64 cell grouping problems in wireless network show that the performance of our ABC is better than those alternatives such as ant colony optimization (ACO) and particle swarm optimization (PSO).

• Journal of the Korean Society of Combustion
• /
• v.13 no.4
• /
• pp.1-7
• /
• 2008

Strict pollutant regulations of NOx emission and increasing awareness of the environmental damage stimulated interest in research to obtain useful information regarding CO and NOx reductions at the same time. In this study, $CH_4$/air premixed flame was examined numerically to reduce CO and NOx emission level simultaneously in the post-flame region by the heat loss models in which radiative and combined conductive and convective heat losses were included. To reduce the NOx emission, first heat exchanger location was decided near the flame. After first heat exchanger was decided for the optimal NOx emission(about 30 ppm), in order to decide the optimal CO emission(about 30ppm), seocond heat exchanger location was tested and decided for several cases. Finally, the optimal location of heat exchanger for minimal CO and NOx emission simultaneously were determined and suggested.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.4
• /
• pp.847-856
• /
• 2013

This paper presents an AP placement technique considering indoor location-awareness and examines its performance. The proposed AP placement technique is addressed from three performance metrics: location-awareness and AP-based wireless network performance as well as its cost. The proposed AP placement technique consists of meta-heuristic algorithms that yield a near optimal AP configuration for given performance metrics, and deterministic algorithms that improve the fast convergence of the near optimal AP configuration. The performance of the AP placement technique presented in this paper is measured under the environments simulating indoor space, and numerical results obtained by experimental evaluation yield the fast convergence of a near-optimal solution to a given performance metric.