• 제목/요약/키워드: a simple algorithm

검색결과 3,590건 처리시간 0.034초

Design and Implementation of Instantaneous Power Estimation Algorithm for Unified Power Conditioner

  • S., Sindhu;M.R., Sindhu;Nambiar, T.N.P.
    • Journal of Power Electronics
    • /
    • 제19권3호
    • /
    • pp.815-826
    • /
    • 2019
  • This paper discusses a simple control approach for a Unified Power Conditioner (UPC) system to achieve power quality compensation at the point of common coupling in distribution systems. The proposed Instantaneous Power Estimation Algorithm (IPEA) for shunt and series active power filters uses a simple mathematical concept that reduces the complexity in the design of the controller. The performance of a UPC is verified with a system subjected to voltage distortions, sags/swells and unbalanced loads using MATLAB/SIMULINK. The simulation study shows that a UPC with the proposed control algorithm can effectively compensate for voltage and current harmonics, unbalance and reactive power. The control algorithm is experimentally implemented using dSPACE DS1104 and its effectiveness has been verified.

비 결정론적 최적화 기법을 이용한 선박의 CAE 모델링 자동화를 위한 지능형 에이전트 시스템의 개발 (Development of intelligent agent system for automated ship CAE modelling by non-deterministic optimized methods)

  • 배동명;김학수;신창혁;왕칭
    • 수산해양기술연구
    • /
    • 제44권1호
    • /
    • pp.57-67
    • /
    • 2008
  • Recently, Korean shipbuilding industry is keeping up the position of world wide No. 1 in world shipbuilding market share. It is caused by endless efforts to develope new technologies and methods and fast development of IT technologies in Korea, to raise up its productivities and efficiency in shipbuilding industry with many kinds of optimizing methods including genetic algorithm or artificial life algorithm... etc. In this paper, we have suggested the artificial life algorithm with relay search micro genetic algorithm. and we have improved a defect of simple genetic algorithm for its slow convergence speed and added a variety of solution candidates with applying relay search simple genetic algorithm. Finally, we have developed intelligent agent system for ship CAE modeling. We have tried to offer some conveniences a ship engineer for repeated ship CAE modeling by changing ship design repeatedly and to increase its accuracy of a ship model with it.

제산방법에 의한 Reed-Solomon 부호의 개선된 복호알고리듬 (Improved Decoding Algorithm on Reed-Solomon Codes using Division Method)

  • 정제홍;박진수
    • 전자공학회논문지A
    • /
    • 제30A권11호
    • /
    • pp.21-28
    • /
    • 1993
  • Decoding algorithm of noncyclic Reed-Solomon codes consists of four steps which are to compute syndromes, to find error-location polynomial, to decide error-location, and to solve error-values. There is a decoding method by which the computation of both error-location polynomial and error-evaluator polynimial can be avoided in conventional decoding methods using Euclid algorithm. The disadvantage of this method is that the same amount of computation is needed that is equivalent to solve the avoided polynomial. This paper considers the division method on polynomial on GF(2$^{m}$) systematically. And proposes a novel method to find error correcting polynomial by simple mathematical expression without the same amount of computation to find the two avoided polynomial. Especially. proposes the method which the amount of computation to find F (x) from the division M(x) by x, (x-1),....(x--${\alpha}^{n-2}$) respectively can be avoided. By applying the simple expression to decoding procedure on RS codes, propses a new decoding algorithm, and to show the validity of presented method, computer simulation is performed.

  • PDF

중성초지에서 탄산칼슘의 성질이 종이의 물성에 미치는 영향 (Effect of Calcium Carbonate on Properties of Paper in Alkali Paper Masking)

  • 신종순
    • 한국인쇄학회지
    • /
    • 제8권1호
    • /
    • pp.71-87
    • /
    • 1990
  • This paper presents a simple algorithm to obtain three dimensional information of an object. In the preprocessing of the stereo matching,feature point informations of stero image must be less sensitive to noise and well liked the correspondance problem. This paper described a simple technique of struture feature extraction of 3-D object and used edge-end point expanding method for unconnected line instade of Hough transform. The feature such as corner point and their angles are used for matching problem. The experimental results show that the described algorithm is a useful method for stereo correspondence problem.

  • PDF

측정치 융합기법을 이용한 다중표적 방위각 추적 알고리즘 (Multiple Target DOA Tracking Algorithm Using Measurement Fusion)

  • 신창홍;류창수;이균경
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
    • /
    • pp.493-496
    • /
    • 2003
  • Recently, Ryu et al. proposed a multiple target DOA tracking algorithm, which has good features that it has no data association problem and simple structure. But its performance is seriously degraded in the low signal-to-noise ratio. In this paper, a measurement fusion method is presented based on ML(Maximum Likelihood), and the new DOA tracking algorithm is proposed by incorporating the presented fusion method into Ryu's algorithm. The proposed algorithm has a better tracking performance than that of Ryu's algorithm, and it sustains the good features of Ryu's algorithm.

  • PDF

궤적의 방향 변화 분석에 의한 제스처 인식 알고리듬 (Gesture Recognition Algorithm by Analyzing Direction Change of Trajectory)

  • 박장현;김민수
    • 한국정밀공학회지
    • /
    • 제22권4호
    • /
    • pp.121-127
    • /
    • 2005
  • There is a necessity for the communication between intelligent robots and human beings because of wide spread use of them. Gesture recognition is currently being studied in regards to better conversing. On the basis of previous research, however, the gesture recognition algorithms appear to require not only complicated algorisms but also separate training process for high recognition rates. This study suggests a gesture recognition algorithm based on computer vision system, which is relatively simple and more efficient in recognizing various human gestures. After tracing the hand gesture using a marker, direction changes of the gesture trajectory were analyzed to determine the simple gesture code that has minimal information to recognize. A map is developed to recognize the gestures that can be expressed with different gesture codes. Through the use of numerical and geometrical trajectory, the advantages and disadvantages of the suggested algorithm was determined.

단순한 휴리스틱을 사용하여 무리 짓기에서 이웃 에이전트 탐색방법의 성능 개선 (An Improvement of Finding Neighbors in Flocking Behaviors by Using a Simple Heuristic)

  • 장자순;이재문
    • 한국게임학회 논문지
    • /
    • 제11권5호
    • /
    • pp.23-30
    • /
    • 2011
  • 무리 짓기는 대규모 무리의 사실적인 시뮬레이션으로 게임이나 컴퓨터 그래픽에서 자주 사용된다. 이러한 대규모 무리의 실시간 시뮬레이션은 계산 집약적 작업이기 때문에 효율적인 알고리즘에 대한 많은 연구들이 있었다. 본 논문에서는 기존의 효율적인 무리 짓기 알고리즘이 불필요한 계산을 포함하고 있다는 사실은 실험적으로 찾아내고, 간단한 휴리스틱으로 이러한 단점을 개선하는 새로운 알고리즘을 제안한다. 제안된 방법의 성능을 평가하기 위하여 많은 실험을 수행하였다. 실험의 결과는 제안하는 알고리즘이 기존의 효율적인 알고리즘에 비하여 평균 약 21%정도 성능을 개선한다는 것을 보였다.

교대형 유전자 알고리즘을 이용한 보강설계의 최적화 (Application of Genetic Algorithm-Based Relay Search Method for Structure Design - Strengthening Problems)

  • 정승인;김남희;장승필
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2001년도 봄 학술발표회 논문집
    • /
    • pp.223-232
    • /
    • 2001
  • This paper describes Genetic Algorithm-Based Relay Search Method, RS-GA, which is developed in this study to search the multiple design variables in the design space. The RS-GA based on Simple-GA consists of some functions to search many variables from some wide variable space. It repeats a Simple-GA, that is the convergence process of the Simple-GA, which makes many time reiteration itself. From the results of the numerical studies, it was actually found that RS-GA can search all peak-variable from the 2D functions including 5 peaks. Finally, RS-GA applied for design-strengthening problems in composite plate girder bridges using the external prestressing technique is also verified.

  • PDF

A STRONGLY CONVERGENT PARALLEL PROJECTION ALGORITHM FOR CONVEX FEASIBILITY PROBLEM

  • Dang, Ya-Zheng;Gao, Yan
    • Journal of applied mathematics & informatics
    • /
    • 제30권1_2호
    • /
    • pp.93-100
    • /
    • 2012
  • In this paper, we present a strongly convergent parallel projection algorithm by introducing some parameter sequences for convex feasibility problem. To prove the strong convergence in a simple way, we transmit the parallel algorithm in the original space to an alternating one in a newly constructed product space. Thus, the strong convergence of the parallel projection algorithm is derived with the help of the alternating one under some parametric controlling conditions.

A RECURSIVE ALGORITHM TO INVERT MULTIBLOCK CIRCULANT MATRICES

  • Baker, J.;Hiergeist, F.;Trapp, G.
    • Kyungpook Mathematical Journal
    • /
    • 제28권1호
    • /
    • pp.45-50
    • /
    • 1988
  • Circulant and multiblock circulant matrices have many important applications, and therefore their inverses are of considerable interest. A simple recursive algorithm is presented to compute the inverse of a multiblock circulant matrix. The algorithm only uses complex variables, roots of unity and normal matrix/vector operations.

  • PDF