• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• pp.134-137
• /
• 1998

In this paper, we propose a new consolidation algorithm for point-to-multipoint ABR flow control and compare the performance of the proposed algorithms with that of an existing consolidation algorithm. We first investigate problems of the existing algorithm in consolidating backward RM cells and propose two new consolidation algorithms to resolve these problems. Also, we investigate the performance of the proposed algorithms by simulation. As results, we show that the proposed algorithms exhibit a better performance than the existing algorithm in terms of ACR, queue length, utilization, and fairness.

• 한국통신학회논문지
• /
• 제21권6호
• /
• pp.1554-1566
• /
• 1996

In this paper, a new symbol timing algorithm for a magnetic recording system as HDD, is proposed. Above all, the Lorentzian channel model applied, the distortion and the attenuation problems of playback signals at high speed and storage density were considered. The structure and the operation of popular data detectors for HDD were understood, and the adopted symbol timing algorithm were profoundly analyzed. On the basis of these understanding and analysis, a new symbol timing algorithm for high density HDD was proposed, and the performance evaluation of this proposed algorithm was done.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2001년도 추계학술대회 학술발표 논문집
• /
• pp.229-232
• /
• 2001

Recently, several promising multiobjective evolutionary algorithms, e,g, SPEA, NSGA-ll, PESA, and SPEA2, have been developed. In this paper, we also propose a new multiobjective evolutionary algorithm that compares to them. In the algorithm proposed in this paper, we introduce a novel concept, "inherited age" and total algorithm is executed based on the inherited age concept. Also, we propose a new sharing algorithm, called objective classication sharing algorithm(OCSA) that can preserve the diversity of the population. We will show the superior performance of the proposed algorithm by comparing the proposed algorithm with other promising algorithms for the test functions.

• 제어로봇시스템학회논문지
• /
• 제10권7호
• /
• pp.634-642
• /
• 2004

Unlike actual vehicles, a vehicle driving simulator is limited in kinematic workspace and bounded on dynamic characteristics. So it is difficult to simulate dynamic motions of a multi-body vehicle model. In order to overcome these problems, a washout algorithm which controls the workspace of the simulator within the kinematic limitation is needed. However, a classical washout algorithm contains several problems such as generation of wrong sensation of motions by filters in tilt coordination, requirement of trial and error method in selecting the proper cut-off frequencies, difficulty in returning the simulator to its origin using only high pass filters and etc. This paper proposes a new tilt coordination method as an algorithm which gives more accurate sensations to drivers. In order to reduce time for returning the simulator to its origin, a new washout algorithm that the proposed algorithm selectively onset mode from high pass filters and return mode from error functions is proposed. As a result of this study, the results of the proposed algorithm are compared with the results of classical washout algorithm through the human perception models. Also, the performance of the suggested algorithm is evaluated by using human perception and sensibility of some drivers through experiments.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2008년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.77-78
• /
• 2008

This paper proposes a new algorithm for path planning and obstacles avoidance using the ant colony optimization algorithm and the particle swarm optimization. The proposed algorithm is a new hybrid algorithm that composes of the ant colony algorithm method and the particle swarm optimization method. At first, we produce paths of a mobile robot in the static environment. And then, we find midpoints of each path using the Maklink graph. Finally, the hybrid algorithm is adopted to get a shortest path. We prove the performance of the proposed algorithm is better than that of the path planning algorithm using the ant colony optimization only through simulation.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.311-312
• /
• 2007

This paper proposes a new algorithm for path planning and obstacles avoidance using the ant colony optimization algorithm. The proposed algorithm is a new hybrid algorithm that composes of the ant colony algorithm method and the Maklink graph method. At first, we produce the path of a mobile robot a the static environment. And then we find midpoints of each path using the Maklink graph. Finally the ant colony optimization algorithm is adopted to get a shortest path. In this paper, we prove the performance of the proposed algorithm is better than that of the Dijkstra algorithm through simulation.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(1)
• /
• pp.240-243
• /
• 2000

In this paper, new Multi-Modulus blind Equalizer Algorithms for QAM signal set is propsed and analyzed and its performance is evaluated. The MMA algorithm combines the benifits of RCA and CMA. A new Dual-mode blind Algorithms for QAM signal set is derived. The concept of this algorithms is based on the Dual-Mode algorithm and the MMA algorithm. In order to analyze and evaluate the performance of new MMA algorithms, computer simulation are performed for the nonsquare QAM signal constellations. Form the simulation results, we can verify that new MMA algorithms converges very fast comparing to conventional MMA algorithm.

• Journal of international Conference on Electrical Machines and Systems
• /
• 제3권4호
• /
• pp.465-471
• /
• 2014

This paper proposes a new switching algorithm for an active clamp snubber to improve the efficiency of a module integrated converter system. This system uses an active clamp method for the snubber circuit for the efficiency and reliability of the system. However, the active clamp snubber circuit has the disadvantage that system efficiency is decreased by switch operating time because of heat loss in resonance between the snubber capacitor and leakage inductance. To address this, this paper proposes a new switching algorithm. The proposed algorithm is a technique to reduce power consumption by reducing the resonance of the snubber switch operation time. Also, the snubber switch is operated at zero voltage switching by turning on the snubber switch before main switch turn-off. Simulation and experimental results are presented to show the validity of the proposed new active clamp control algorithm.

• Journal of information and communication convergence engineering
• /
• 제11권4호
• /
• pp.258-267
• /
• 2013

New incremental learning algorithm using extended data expression, based on probabilistic compounding, is presented in this paper. Incremental learning algorithm generates an ensemble of weak classifiers and compounds these classifiers to a strong classifier, using a weighted majority voting, to improve classification performance. We introduce new probabilistic weighted majority voting founded on extended data expression. In this case class distribution of the output is used to compound classifiers. UChoo, a decision tree classifier for extended data expression, is used as a base classifier, as it allows obtaining extended output expression that defines class distribution of the output. Extended data expression and UChoo classifier are powerful techniques in classification and rule refinement problem. In this paper extended data expression is applied to obtain probabilistic results with probabilistic majority voting. To show performance advantages, new algorithm is compared with Learn++, an incremental ensemble-based algorithm.

• 유체기계공업학회:학술대회논문집
• /
• 유체기계공업학회 2006년 제4회 한국유체공학학술대회 논문집
• /
• pp.383-386
• /
• 2006

In this study, we propose a new fast algorithm for calculating short range forces in molecular dynamics, This algorithm uses a new hierarchical tree data structure which has a high adaptiveness to the particle distribution. It can divide a parent cell into k daughter cells and the tree structure is independent of the coordinate system and particle distribution. We investigated the characteristics and the performance of the tree structure according to k. For parallel computation, we used orthogonal recursive bisection method for domain decomposition to distribute particles to each processor, and the numerical experiments were performed on a 32-node Linux cluster. We compared the performance of the oct-tree and developed new algorithm according to the particle distributions, problem sizes and the number of processors. The comparison was performed sing tree-independent method and the results are independent of computing platform, parallelization, or programming language. It was found that the new algorithm can reduce computing cost for a large problem which has a short search range compared to the computational domain. But there are only small differences in wall-clock time because the proposed algorithm requires much time to construct tree structure than the oct-tree and he performance gain is small compared to the time for single time step calculation.