• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.209-216
• /
• 2001

The effective way to apply incremental attribute grammar to a complex language process is the use of optimized algorithm. In optimized algorithm for incremental attribute grammar, the new input attribute tree should be exactly compared with the previous input attribute tree, in order to determine which subtrees from the old should be used in constructing the new one. In this paper the new optimized algorithm was reconstructed by analyzing the algorithm suggested by Carle and Pollock, and a generation process of new attribute tree d’copy was added. Through the performance evaluation for the suggested matching algorithm, the run time is approximately improved by 19.5%, compared to the result of existing algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.6
• /
• pp.1533-1545
• /
• 1996

In this paper, the design and implementation of echo canceller with new variable step size algorithm is discussed. The method used in the new algorithm is to periodically adopt the test function which helps an optimal coefficient tracking. This algorithm outperforms LMS and VS algorithms in convergence speed and steady state error. As the period of test function is decreased, the speed of convergence is improved, but the number of calculation is increased, then the trade off between these parameters must be considered. Simulation results show new algorithm outperforms LMS and VS algorithms in convergence rate. For the design of hardware, circuit is designed with VHDL, and synthesized with Act1 withc is a FPGA library of ActelTM in use of synovation of InterGraph$^{TM}$. Verification of the synthesized circuit is carried out with simulator DLAB. The circuit based on the algorithm which is suggested in this paper calculated 7 radix places of inary number. A simulation data for the verification is based on the data of algorithm simulation. When the same input data is applied to the both simulation, output results of circuit simulation had slight difference in compare with that of algorithm simulation. The number of used gate is about 5,500 and We have 5.53MHz in maximum frequency.y.

• Nuclear Engineering and Technology
• /
• v.53 no.7
• /
• pp.2348-2356
• /
• 2021

As a relatively new radiation imaging method, the cosmic-ray muon scattering imaging technology can be used to prevent nuclear smuggling and is of considerable significance to nuclear safety. Proposed in this paper is a new reconstruction algorithm based on density clustering, aiming to improve inspection quality with better performance. Firstly, this new algorithm is introduced in detail. Then in order to eliminate the inequity of the density threshold caused by the heterogeneity of the muon flux in different positions, a new flux correction method is proposed. Finally, three groups of simulation experiments are carried out with the help of Geant4 toolkit to optimize the algorithm parameters, verify the correction method and test the inspection quality under shielded condition, and compare this algorithm with another common inspection algorithm under different conditions. The results show that this algorithm can effectively identify and locate nuclear material with low misjudging and missing rates even when there is shielding and momentum precision is low, and the threshold correcting method is universally effective for density clustering algorithms.

• The Journal of Society for e-Business Studies
• /
• v.8 no.1
• /
• pp.113-119
• /
• 2003

This paper proposes a new multiplicative inverse algorithm for the Galois field GF (2/sup m/) whose elements are represented by optimal normal basis type Ⅱ. One advantage of the normal basis is that the squaring of an element is computed by a cyclic shift of the binary representation. A normal basis element is always possible to rewrite canonical basis form. The proposed algorithm combines normal basis and canonical basis. The new algorithm is more suitable for implementation than conventional algorithm.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.529-531
• /
• 2001

We present an expectation-maximization algorithm for principal component analysis via orthogonalization. The algorithm finds actual principal components, whereas previously proposed EM algorithms can only find principal subspace. New algorithm is simple and more efficient thant probabilistic PCA specially in noiseless cases. Conventional PCA needs computation of inverse of the covariance matrices, which makes the algorithm prohibitively expensive when the dimensions of data space is large. This EM algorithm is very powerful for high dimensional data when only a few principal components are needed.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.2
• /
• pp.407-410
• /
• 2010

This paper presents an advanced load allocation algorithm in Direct Load Control(DLC) system. It is important to aggregate a various demand side resource which is surely controllable at the peak power time for a successful DLC system. Previous load allocation algorithm appropriate for DLC system is based on interchanged information, but, this algorithm can not derive optimal solutions. In this paper, we develop the optimal algorithm and the new load allocation algorithm in polynomial time. The simulation results show that the proposed heuristic algorithm for DLC system is very effective.

• ETRI Journal
• /
• v.18 no.2
• /
• pp.53-60
• /
• 1996

Blind equalization is a technique for adaptive equalization of a communication channel without the aid of training sequences. This paper proposes a new blind equalization algorithm. The advantage of the new algorithm is that it has the lower residual error than the GA (proposed by Godard) and Sign_GA (proposed by Weerackody et al.). The superior performance of the proposed algorithm is illustrated for the 16-QAM signal constellation. A Rummler channel model is assumed as a transmission medium. The performance of the proposed algorithm is compared to the GA, Sign_GA and Stop & Go Algorithm (SGA). The simulation results demonstrate that an improvement in performance is achieved with the proposed equalization algorithm.

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

Adaptive algorithms are widely used for various applications. One challenging application is an echo canceller in the long distance telephony network. This paper proposes the new variable step-size algorithm for adaptive lattice structure for echo cancellation. The new algorithm is using power of the output signal and the error signal to controlled the step of adaptation process. By this technique, the proposed algorithm is an excellent and effective in good stability. Performance comparison of the proposed algorithm and the other algorithm is made through simulation results.

• Proceedings of the KIEE Conference
• /
• 2009.07a
• /
• pp.1827_1828
• /
• 2009

In this paper proposes a new algorithm for path planning using the ant colony optimization algorithm. The proposed algorithm is a new hybrid algorithm that composes of the features of the ant colony algorithm method and the Maklink graph method. At first, paths are produced for a mobile robot in a static environment, and then, the midpoints of each obstacles nodes are found using the Maklink graph method. Finally, the shortest path is selected by the ant colony optimization algorithm.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.1760-1763
• /
• 2003

In this paper, we propose a new weaving trajectory algorithm for the are 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 rising 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.