• Proceedings of the KIPE Conference
• /
• 2014.07a
• /
• pp.213-214
• /
• 2014

This paper compares two instantaneous reactive power definitions in DFIG wind turbine with a back-to-back three-level neutral-point clamped voltage source converter under unbalanced grid conditions. In general, conventional definition of instantaneous reactive power is obtained by taking an imaginary component of complex power. The other definition of instantaneous reactive power can be developed based on a set of voltages lagging the grid input voltages by 90 degree. A complex quantity referred as a quadrature complex power is defined. Proposed definition of instantaneous reactive power is derived by taking a real component of quadrature complex power. The characteristics of two instantaneous reactive power definitions are compared using the ripple-free stator active power control algorithm in DFIG. Instantaneous reactive power definition based on quadrature complex power has a simpler current reference calculation control block. Ripple of instantaneous active and reactive power has the same magnitude unlike in conventional definition under grid unbalance. Comparison results of two instantaneous reactive power definitions are verified through simulation.

• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.2
• /
• pp.156-161
• /
• 1997

In this thesis, based on Genetic Algorithm, a new route search algorithm is presented to search an optimal route between the origin and the destination in intelligent route guidance systems in order to minimize the route traveling time. The proposed algorithm is effectively employed to complex road networks which have diverse turn constrains, time-delay constraints due to cross signals, and stochastic traffic volume. The algorithm is also shown to significantly promote search efficiency by changing the population size of path individuals that exist in each generation through the concept of age and lifetime to each path individual. A virtual road-traffic network with various turn constraints and traffic volume is simulated, where the suggested algorithm promptly produces not only an optimal route to minimize the route cost but also the estimated travel time for any pair of the origin and the destination, while effectively avoiding turn constraints and traffic jam.

• Journal of Computational Design and Engineering
• /
• v.3 no.1
• /
• pp.24-36
• /
• 2016

During the past decade, solving complex optimization problems with metaheuristic algorithms has received considerable attention among practitioners and researchers. Hence, many metaheuristic algorithms have been developed over the last years. Many of these algorithms are inspired by various phenomena of nature. In this paper, a new population based algorithm, the Lion Optimization Algorithm (LOA), is introduced. Special lifestyle of lions and their cooperation characteristics has been the basic motivation for development of this optimization algorithm. Some benchmark problems are selected from the literature, and the solution of the proposed algorithm has been compared with those of some well-known and newest meta-heuristics for these problems. The obtained results confirm the high performance of the proposed algorithm in comparison to the other algorithms used in this paper.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1385-1402
• /
• 2019

Quickly picking up some valuable information from massive manufacturing event stream usually faces with the problem of long detection time, high memory consumption and low detection efficiency due to its stream characteristics of large volume, high velocity, many variety and small value. Aiming to solve the problem above for the current complex event processing methods because of not sharing detection during the detecting process for massive manufacturing event streams, an efficient complex event processing method based on multipattern sharing is presented in this paper. The achievement of this paper lies that a multipattern sharing technology is successfully used to realize the quick detection of complex event for massive manufacturing event streams. Specially, in our scheme, we firstly use pattern sharing technology to merge all the same prefix, suffix, or subpattern that existed in single pattern complex event detection models into a multiple pattern complex event detection model, then we use the new detection model to realize the quick detection for complex events from massive manufacturing event streams, as a result, our scheme can effectively solve the problems above by reducing lots of redundant building, storing, searching and calculating operations with pattern sharing technology. At the end of this paper, we use some simulation experiments to prove that our proposed multiple pattern processing scheme outperforms some general processing methods in current as a whole.

• Proceedings of the IEEK Conference
• /
• 2000.06b
• /
• pp.262-265
• /
• 2000

This paper describes design of a (32, 28) Reed Solomon decoder for optical compact disk provides double error detecting and correcting capability. The most complex circuit in the RS decoder is part for solving the error location numbers from error location polynomial, and the circuit has great influence on overall decoder complexity. We use RAM based architecture with Euclid algorithm, Chien search algorithm and Forney algorithm. We have developed VHDL model and Performed logic synthesis using the SYNOPSYS CAD tool. Then, the RS decoder has been implemented with FPGA. The total umber of gate is about 11,000 gates and it operates at 20MHz.

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.4E
• /
• pp.103-107
• /
• 2004

In this Paper, we propose an algorithm called partitioned recursive least square (PRLS) that involves a procedure that partitions a large data matrix into small matrices, applies RLS scheme in each of the small sub matrices and assembles the whole size estimation vector by concatenation of the sub-vectors from RLS output of sub matrices. Thus, the algorithm should be less complex than the conventional RLS and maintain an almost compatible estimation performance.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.895-898
• /
• 1998

In this paper, we propose an efficient marker extraction algorithm for initial image segmentation in a bottom-up segmentation scheme. The proposed algorithm generates dense markers in visually complex areas and coarse markers in visually uniform areas. which conforms to the human perceptual system. Experimental results show that the proposed method achieves better subjective quality for fine initial image segmentation.

• Journal of Mechanical Science and Technology
• /
• v.15 no.5
• /
• pp.592-601
• /
• 2001

An automatic mesh generation scheme with unstructured quadrilateral elements on trimmed NURBS surfaces has been developed. In this paper NURBS surface geometries in the IGES format have been employed to represent geometric models. For unstructured mesh generation with quadrilateral elements, a domain decomposition algorithm employing loop operators has been modified. As for the surface meshing, an indirect 2D approach is proposed in which both quasi-expanded planes and projection planes are employed. Sampled meshes for complex models are presented to demonstrate the robustness of the algorithm.

• Proceedings of the KIEE Conference
• /
• 2009.07a
• /
• pp.4_5
• /
• 2009

A new protection coordination algorithm in Multi-Agent based distribution automation system is proposed in this paper. Distribution network protection coordination is acted by normal state distribution operation. But, in more and more complex distribution network structure, it has a big problem that central server processed all measurement data, coordination setting and controls for operation. So, a algorithm to change coordination setting is proposed automatically in terminal devices which Recloser and OCR to include Multi-Agent concepts in distribution network.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.93-98
• /
• 1991

An improved and flexible matrix algorithm for solving interlinked separation problems which is based on the homotopy continuation method has been developed. A flexible model of the interlinked stream in standardized matrix form and JACOBIAN generation I algorithm for homotopy continuation are suggested. Also DOF analysis is performed for easy-understanding of equation based simulation of complex column systems. The Algorithm is tested on several problems of interlinked separation processes and some of results are documented.