• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2743-2746
• /
• 2003

In this paper, we propose a new weaving trajectory algorithm for the arc welding of a articulated manipulator. The algorithm uses the theory of Bezier spline. We make a comparison between the conventional algorithms using Catmull-Rom curve and the new algorithms using Bezier spline. The proposed algorithm has been evaluated based on the MATLAB environment in order to illustrate its good performance. The algorithm has been implemented on to the industrial manipulator of DR6 so as to show its real possibility. Through simulations and real implementations, the proposed algorithm can result in high-speed and flexible weaving trajectory planning and can reduce the processing time because it needs one-half calculation compared to the conventional algorithm using Catmull-Rom curve.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.3
• /
• pp.17-26
• /
• 1998

Shortest path problem in road network with turn penalties and prohibitions frequently arises from various transportation optimization models. In this paper, we propose a new algorithm for the shortest Path problem with turn prohibitions and delays. The proposed algorithm maintains distance labels of arcs, which is similar to labels of nodes of Dijkstra's algorithm. Fibonacci heap implementation of the proposed algorithm solves the problem in O(mn ＋ mlogm). We provide a new insight in transforming network with turn penalties and prohibitions into another network in which turn penalties and prohibitions are implicitly considered. The proposed algorithm is implemented using new data structure and compared with Ziliaskopoulos' algorithm. Computational results show that the proposed algorithm is very efficient.

• Communications of the Korean Mathematical Society
• /
• v.24 no.4
• /
• pp.501-508
• /
• 2009

This paper presents a new representation algorithm which computes the representation for elements of a free group generated by two linear fractional transformations and also the justification of the algorithm in order to show how it operates correctly and efficiently according to inputs.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.77-80
• /
• 2000

In this paper, we present a new automatic thresholding algorithm based on maximum entropy of two-dimensional pixel histogram. While most of the previous algorithms select thresholds depending only on the histogram of gray level itself in the image, the presented algorithm considers 2D relational histogram of gray levels of two adjacent pixels in the image. Thus, the new algorithm tends to leave salient edge features on the image after thresholding. The experimental results show the good performance of the presented algorithm.

• ETRI Journal
• /
• v.13 no.2
• /
• pp.34-41
• /
• 1991

In this paper, a new distributed parallel algorithm for pattern classification based upon Self-Organizing Neural Network(SONN)[10-12] is developed. This system works without any information about the number of clusters or cluster centers. The SONN model showed good performance for finding classification information, cluster centers, the number of salient clusters and membership information. It took a considerable amount of time in the sequential version if the input data set size is very large. Therefore, design of parallel algorithm is desirous. A new distributed parallel algorithm is developed and experimental results are presented.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.7
• /
• pp.92-100
• /
• 1998

In this paper, we suggest a new identification method for sugeno-type fuzzy model via new data clustering strategy. The suggested algorithm is much simpelr than the original identification strategy adopted in. The algorithm suggested in this paper is somewhat similar to that of [2] and [6], that is the algorithm suggested in this paper consists of two steps: coarse tuning and fine tuning. In this paper, double clustering strategy is proposed for coarse tunign. Finally, the resutls of computer simulation are given to demonstrate the validity of this algorithm.

• Proceedings of the KIPE Conference
• /
• 2001.07a
• /
• pp.172-176
• /
• 2001

In this paper, a new detection algorithm of faulted voltages under the unbalanced condition and a control algorithm of the instantaneous voltage sag corrector (IVSC) are proposed. To quantify the unbalance under fault conditions, the voltages are decomposed into two balanced three-phase systems using the symmetrical components of positive and negative sequence voltages, which is defined by magnitude factor (MF) and unbalance factor (UF). New control algorithm based on MF and UF values for instantaneous voltage compensation are proposed and verified through the PSCAD/EMTDC simulation and experimental results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.748-760
• /
• 1997

The handoff failure probability has to be enhanced efficiently to enhance the performance of PCS system. In this paper a new scheme called velocity adaptive handoff algorithm for reducing handoff failure probability and maintaining the carried traffic constantly in PCS systems, by assigning low handoff threshold value for high mobility calls, and assigning high handoff threshold value for low mobility calls, is presented. The performance of evaluation of this new scheme is carried out in terms of tranffic characteristics. Also velocity estimation algorithm for this new scheme is presented. According to the result, the handoff failure probability of velocity adaptive handoff algorithm is enhanced about 60%.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.2E
• /
• pp.27-31
• /
• 1997

This paper proposes a new rejection algorithm which distinguishes unregistered spoken words(or non-keywords) from registered vocabulary. Two kinds of garbage models are employed in this design ; the original garbage model and a new word garbage model. The original garbage model collects all non-keyword patterns where the new word garbage model collects patterns classified by recognizing each non-keyword pattern with registered vocabulary. These two types of garbage models work together to make a robust reject decision. The first stage of processing is the classification of an input pattern through the original garbage model. In the event that the first stage of processing is ambiguous, the new word dependent garbage model is used to classify thye input pattern as either a registered or non-registered word. This paper shows the efficiency of the new word dependent garbage model. A Dynamic Multisection method is used to test the performance of the algorithm. Results of this experiment show that the proposed algorithm performs at a higher level than that of the original garbage model.

• Structural Engineering and Mechanics
• /
• v.45 no.1
• /
• pp.111-127
• /
• 2013

In this paper, a new version of gravitational search algorithm based on opposition-based learning (OBGSA) is introduced and applied for optimum design of reinforced concrete retaining walls. The new algorithm employs the opposition-based learning concept to generate initial population and updating agents' position during the optimization process. This algorithm is applied to minimize three objective functions include weight, cost and $CO_2$ emissions of retaining structure subjected to geotechnical and structural requirements. The optimization problem involves five geometric variables and three variables for reinforcement setups. The performance comparison of the new OBGSA and classical GSA algorithms on a suite of five well-known benchmark functions illustrate a faster convergence speed and better search ability of OBGSA for numerical optimization. In addition, the reliability and efficiency of the proposed algorithm for optimization of retaining structures are investigated by considering two design examples of retaining walls. The numerical experiments demonstrate that the new algorithm has high viability, accuracy and stability and significantly outperforms the original algorithm and some other methods in the literature.