• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.6
• /
• pp.323-329
• /
• 2010

The edit distance problem is finding the minimum number of edit operations to transform a string into another one. It is one of the important problems in algorithm research and there are some algorithms that compute an optimal edit distance for the one-dimensional languages such as the English alphabet. However, there are a few researches to find the edit distance for the more complicated language such as the Korean or Chinese alphabet. In this paper, we define the measure of the edit distance for the Korean alphabet with the phoneme classification system to improve the previous edit distance algorithm and present an algorithm for the edit distance problem for the Korean alphabet.

• Smart Structures and Systems
• /
• v.16 no.2
• /
• pp.243-262
• /
• 2015

Optimal sensor placement (OSP) is a critical issue in construction and implementation of a sophisticated structural health monitoring (SHM) system. The uncertainties in the identified structural parameters based on the measured data may dramatically reduce the reliability of the condition evaluation results. In this paper, the information entropy, which provides an uncertainty metric for the identified structural parameters, is adopted as the performance measure for a sensor configuration, and the OSP problem is formulated as the multi-objective optimization problem of extracting the Pareto optimal sensor configurations that simultaneously minimize the appropriately defined information entropy indices. The nondirective movement glowworm swarm optimization (NMGSO) algorithm (based on the basic glowworm swarm optimization (GSO) algorithm) is proposed for identifying the effective Pareto optimal sensor configurations. The one-dimensional binary coding system is introduced to code the glowworms instead of the real vector coding method. The Hamming distance is employed to describe the divergence of different glowworms. The luciferin level of the glowworm is defined as a function of the rank value (RV) and the crowding distance (CD), which are deduced by non-dominated sorting. In addition, nondirective movement is developed to relocate the glowworms. A numerical simulation of a long-span suspension bridge is performed to demonstrate the effectiveness of the NMGSO algorithm. The results indicate that the NMGSO algorithm is capable of capturing the Pareto optimal sensor configurations with high accuracy and efficiency.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.19-27
• /
• 2007

We have implemented a WWW homepage which finds an optimal route for users. There already exist many web sites which provide the optimal route when a start and a destination cities are given. However, none of them can find the optimal route when a number of cities to be visited. The problem of finding the optimal route starting at a given start city and visiting through all the given intermediate cities and finally returning to the start city is called Travelling Sales Person(TSP) problem. TSP is a well known exponential time complexity problem. We have implemented an artificial intelligent search algorithm for TSP on our homepage. The main feature of our algorithm is that the destination may not be the same as the start city whereas all of the existing heuristic algorithms for TSP assume that the start and the destination cities are the same. The web page asks a user to select all the cities he or she wants to visit(including start and destination city), then it finds a sequence of the cities such that the user would travel minimum distance if he or she visits the cities in the order of the sequence. This paper presents algorithms used in the homepage.

• 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 Society for Precision Engineering
• /
• v.14 no.7
• /
• pp.49-58
• /
• 1997

In process planning for pocket machining, the selection of tool size, tool path, overlap distance, and the calculation of machining time are very important factors to obtain the optimal process planning result. Among those factors, the tool size is the most important one because the others depend on tool size. And also, it is not easy to determine the optimal tool size even though the shape of pocket is simple. Therefore, the optimal selection of tool size is the most essential task in process planning for machining a pocket. This paper presents a method for selecting optimal toos in pocket machining. The branch and bound method is applied to select the optimal tools which minimize the machining time by using the range of feasible tools and the breadth-first search.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.6 no.2
• /
• pp.45-56
• /
• 2007

As function and scale of the transit center get larger, the efficient guidance system in the transit center is essential for transit users in order to find their efficient routes. Although there are several studies concerning optimal path for the road, but insufficient studies are executed about optimal path inside the building. Thus, this study is to develop the algorithm about optimal path for car owner from the basement parking lot to user's destination in the transfer station. Based on Dijkstra algorithm which calculate horizontal distance, several factors such as fatigue, freshness, preference, and required time in using moving devices are objectively computed through rank-sum and arithmetic-sum method. Moreover, optimal public transportation is provided for transferrer in the transfer station by Neuro-Fuzzy model which is reflected on people's tendency about public transportation mode choice. Lastly, some scenarios demonstrate the efficiency of optimal path algorithm for pedestrian in this study. As a result of verification the case through the model developed in this study is 75 % more effective in the scenario reflected on different vertical distance, and $24.5\;{\sim}\;107.7\;%$ more effective in the scenario considering different horizontal distance, respectively.

• Journal of Positioning, Navigation, and Timing
• /
• v.2 no.1
• /
• pp.9-17
• /
• 2013

In this paper, a pseudorange correction regeneration algorithm was developed to improve the positioning accuracy of DGPS using multi-reference stations, and the optimal minimum number of reference sites was determined by trying out different numbers of reference. This research was conducted using from two to five sites, and positioning errors of less than 1 m were obtained when pseudorange corrections are collected from at least four reference stations and interpolated as the pseudorange correction at the rover. After determining the optimal minimum number of reference stations, the pseudorange correction regeneration algorithm developed was tested by comparison with the performance of other algorithms. Our approach was developed based on an exponential model. If pseudorange corrections are regenerated using an exponential model, the effect of a small difference in the baseline distance can be enlarged. Therefore, weights can be applied sensitively even when the baseline distance differs by a small amount. Also weights on the baseline distance were applied differently by assigning weights depending on the difference of the longest and shortest baselines. Through this method, the positioning accuracy improved by 19% compared to the result of previous studies.

• Transactions on Electrical and Electronic Materials
• /
• v.17 no.5
• /
• pp.289-292
• /
• 2016

This paper dealt with the optimal design of a follow current disconnector for DC arresters used in electric traction vehicles. The disconnector separates the ground lead from an arrester to prevent a line-to-ground fault of an aged arrester and should not affect the operation and function such as the reference and the clamping voltage of the connected arrester. The designed disconnector is composed of a resistor, a spark gap, and a cartridge. The results showed that the sparkover voltage increased with the gap distance whereas the reference voltage was almost the same as that without the disconnector. The sparkover voltage was 3.95 kV when the gap distance was 0.5 mm. Regardless of the gap distance, the reference and the clamping voltage of the assembled disconnector with an arrester were measured to be the same as those of the arrester alone.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.7
• /
• pp.599-604
• /
• 2013

Path planning of mobile robots has a purpose to design an optimal path from an initial position to a target point. Minimum driving time, minimum driving distance and minimum driving error might be considered in choosing the optimal path and are correlated to each other. In this paper, an efficient driving trajectory is planned in a real situation where a mobile robot follows a moving object. Position and distance of the moving object are obtained using a web camera, and the rotation angular and linear velocities are estimated using Kalman filters to predict the trajectory of the moving object. Finally, the mobile robot follows the moving object using a single curvature trajectory by estimating the trajectory of the moving object. Using the estimation by Kalman filters and the single curvature in the trajectory planning, the total tracking distance and time saved amounts to about 7%. The effectiveness of the proposed algorithm has been verified through real tracking experiments.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.22 no.9
• /
• pp.845-852
• /
• 2012

Recently, wireless power transfer technology is ready to be commercialized in consumer electronics. It draws attention from not only experts but also public because of its convenience and huge market. However, previous technologies such as magnetic resonance and induction coupling have limited applications because of its short transfer distance compared to device size and magnetic intensity limitation on the safety of body exposure. As an alternative, ultrasonic wireless power transfer technology is proposed. The ultrasonic wireless power transfer system is composed of transmitter which converts electrical energy to ultrasonic energy and receiver which converts the ultrasonic energy to the electrical energy again. This paper is focused on the development of high energy conversion efficiency of ultrasonic transmitter. Optimal transfer frequency is calculated based on the acoustic radiation and damping effect. The transmitter is designed through numerical analysis, and is manufactured to match the optimal transfer frequency with the size of 100 mm diameter, 12.2 mm thickness plate. The energy conversion efficiency of about 13.6 % at 2 m distance is obtained, experimentally. This result is quite high considered with the device size and the power transfering distance.