• Title/Summary/Keyword: Incremental Algorithm

Search Result 372, Processing Time 0.027 seconds

A Study on the Probabilistic Production Cost Calculation by the Developed EIGC Method. (확장된EIGC법에 의한 확업적 발전비 게산에 관한 연구)

  • 송길영;최재석;김용하
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.36 no.12
    • /
    • pp.839-847
    • /
    • 1987
  • The probabilistic production cost is calculated by the Expected Incremental Generation Cost Curve(EIGC) method based on the multi-state and multi-block operating conditions. For this, A new algorithm for determining production cost by the EIGC and the generation availability curve (GAC) had been developed in order to realize better economic olad dispatch and better reliability for power system operation. The simpler method for determining the EIGC and the GAC is proposed for convenience and saving in computation time.

  • PDF

Computing Rotational Swept Volumes of Polyhedral Objects (다면체의 회전 스웹터 볼륨 계산 방법)

  • 백낙훈;신성용
    • Korean Journal of Computational Design and Engineering
    • /
    • v.4 no.2
    • /
    • pp.162-171
    • /
    • 1999
  • Plane sweep plays an important role in computational geometry. This paper shows that an extension of topological plane sweep to three-dimensional space can calculate the volume swept by rotating a solid polyhedral object about a fixed axis. Analyzing the characteristics of rotational swept volumes, we present an incremental algorithm based on the three-dimensional topological sweep technique. Our solution shows the time bound of O(n²·2?+T?), where n is the number of vertices in the original object and T? is time for handling face cycles. Here, α(n) is the inverse of Ackermann's function.

  • PDF

Improved Thinning Algorithm using SOG with Incremental Ordering method (점증적 정돈기법의 SOG를 이용한 개선된 세선화 알고리즘)

  • 정선정;이찬희;정순호
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.04b
    • /
    • pp.334-336
    • /
    • 2001
  • 세선화 알고리즘의 간접 기법으로 제시된 자기구성 특징 그래프(Self-Organizing feature Graph : SOG) 기법은 안정된 세선화 결과를 가지는 장점이 있으나 학습 알고리즘에서 전체 노드를 재정돈하는 과정이 내포되어 있다. 본 본문에서는 학습 알고리즘의 재정돈 과정을 대신하는 점증적 정돈기법을 제안하고 이 기법을 세선화 알고리즘에 결합하여 실험하고 분석하였다. 제안된 알고리즘은 기존의 SO를 적용한 결과와 같은 우수한 세선화 결과를 얻으며 학습시간은 O((logM)$^3$)인 복잡도를 가진다.

  • PDF

Finite Difference Analysis of Safe Load and Critical Time in a Four-Parameter Viscoelastic Column

  • Shin, Jong-Gye;Lee, Jae-Yeul
    • Journal of Hydrospace Technology
    • /
    • v.2 no.2
    • /
    • pp.80-87
    • /
    • 1996
  • A creep-buckling analysis is studied for a simply-supported viscoelastic column. The fluid-type four-parameter model is employed because of its general applicability to creep materials. Using the imperfection-based incremental approach, a nonlinear load deflection equation is derived. Safe load and critical (or life) time which characterize the stability of the viscoelastic column are obtained mathematically and interpreted physically. A finite difference algorithm is applied to solve the second-order differential equation of the viscoelastic stress-strain relation. Numerical calculation has been made and discussed far a SUS316 stainless steel column.

  • PDF

A Study on the Optimized Algorithm for Incremental Attribute Propagation of Attribute Grammar (속성 문법의 점진적 속성 전파를 위한 최적화 알고리즘에 관한 연구)

  • 장재춘;안희학
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.04a
    • /
    • pp.46-48
    • /
    • 2001
  • 속성에 할당된 새로운 조건을 통해 평가를 수행할 때 이미 산출된 부분을 재사용하기 위해서는 새로운 평가방법이 필요하다. 이 논문에서는 평가된 속성 값의 전파를 고려한 최적화 알고리즘을 제안하는 기존 속성 트리의 서브 트리와 새로운 속성 트리의 서브 트리를 비교하여 전파되는 속성 값과 노드가 일치할 경우 기존 속성 트리의 서브 트리를 새로운 속성 트리에서 사용이 가능한 최적화된 알고리즘을 제안하고 평가하였다.

Design and implementation of web document clustering system using on incremental algorithm (점진적 알고리즘을 이용한 웹 문서 클러스터링 시스템의 설계 및 구현)

  • 황태호;손기락
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10a
    • /
    • pp.207-209
    • /
    • 1999
  • 클러스터 분석은 관측의 대상이 되는 집합에 맞는 분류 구조를 생성하는데 이용되는 통계학적인 기술이다. 정보검색 응용에서 전형적으로 발견되는 높은 차원을 가진 많은 데이터 집합을 클러스터하기 위하여, 많은 공간과 시간이 필요하다. SLINK 알고리즘은 O(n2)의 시간과 O(n)의 공간의 성능을 갖으며 점진성을 반영할 수 있는 알고리즘이다. SLINK알고리즘을 이용하여 검색 엔진의 검색결과에 온라인으로 클러스터 분류를 수행하는 시스템을 구현하였다. 구현된 시스템은 상대적으로 높은 정확도와 각 클러스터를 저장하고 표현하는데 있어서의 장점을 제공하며, 상대적으로 느린 수행 속도는 온라인으로 문서들이 다운로드 되는 속도가 느리므로 문제가 되지 않음을 알 수 있었다.

  • PDF

Improving the performance of PV system using the N-IC MPPT methods (N-IC MPPT방법을 이용한 태양광 발전시스템의 성능개선)

  • Seo, Tae-Young;Ko, Jae-Sub;Kang, Sung-Min;Kim, Yu-Tak;Chung, Dong-Hwa
    • Proceedings of the KIEE Conference
    • /
    • 2015.07a
    • /
    • pp.958-959
    • /
    • 2015
  • This paper proposes adaptive incremental conductance(A-IC) algorithm for maximum power point tracking(MPPT) control of photovoltaic. Conventional Perturbation & Observation(PO) and IC MPPT control algorithm generally uses fixed step size. A small fixed step size will cause the tracking speed to decrease and tracking accuracy of the MPP will decrease due to large fixed step size. Therefore, this paper proposes N-IC MPPT algorithm that adjust automatically step size according to operating conditions. To improve tracking speed and accuracy, when operating point is far from maximum power point(MPP), step size uses maximum value and when operating point is near from MPP, step size uses variable step size that adjust according to slope of P-V curve. The validity of MPPT algorithm proposed in this paper prove through compare with conventional IC MPPT algorithm.

  • PDF

A Novel MPPT Control of PV MIC System Considering the Shaded Effect (그림자 영향을 고려한 PV MIC 시스템의 새로운 MPPT 제어)

  • Choi, Jung-Sik;Chung, Dong-Hwa
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.26 no.5
    • /
    • pp.21-33
    • /
    • 2012
  • This paper presents the new maximum power point tracking(MPPT) control of the photovoltaic(PV) module integrated converter(MIC) system considering the shadow influence. The output characteristics of the solar cell is a nonlinear and affected by a temperature, the solar radiation and influence of a shadow. Particularly, MIC system is very sensitive to the shadow influence because the capacity is very small. In order to increase an output and efficiency of the solar power generation, the maximum power point(MPP) obeying control are necessary. Conventional perturbation and observation(PO) and Incremental conductance(IC) are the method finding MPP by the continued self-excitation vibration. The MPPT control is unable to be performed by rapid output change affected by the shadow. To solve this problem, the new control algorithm of the multi-level in which the step value changes by output change is presented. In case there are the solar radiation, a temperature and shadow influence, the presented algorithm treats and compares the conventional control algorithm and output error. In addition, the validity of the algorithm is proved. through the output error response characteristics.

EM Algorithm with Initialization Based on Incremental ${\cal}k-means$ for GMM and Its Application to Speaker Identification (GMM을 위한 점진적 ${\cal}k-means$ 알고리즘에 의해 초기값을 갖는 EM알고리즘과 화자식별에의 적용)

  • Seo Changwoo;Hahn Hernsoo;Lee Kiyong;Lee Younjeong
    • The Journal of the Acoustical Society of Korea
    • /
    • v.24 no.3
    • /
    • pp.141-149
    • /
    • 2005
  • Tn general. Gaussian mixture model (GMM) is used to estimate the speaker model from the speech for speaker identification. The parameter estimates of the GMM are obtained by using the Expectation-Maximization (EM) algorithm for the maximum likelihood (ML) estimation. However the EM algorithm has such drawbacks that it depends heavily on the initialization and it needs the number of mixtures to be known. In this paper, to solve the above problems of the EM algorithm. we propose an EM algorithm with the initialization based on incremental ${\cal}k-means$ for GMM. The proposed method dynamically increases the number of mixtures one by one until finding the optimum number of mixtures. Whenever adding one mixture, we calculate the mutual relationship between it and one of other mixtures respectively. Finally. based on these mutual relationships. we can estimate the optimal number of mixtures which are statistically independent. The effectiveness of the proposed method is shown by the experiment for artificial data. Also. we performed the speaker identification by applying the proposed method comparing with other approaches.

An Efficient Candidate Pattern Tree Structure and Algorithm for Incremental Web Mining (점진적인 웹 마이닝을 위한 효율적인 후보패턴 저장 트리구조 및 알고리즘)

  • Kang, Hee-Seong;Park, Byung-Joon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.44 no.1
    • /
    • pp.71-79
    • /
    • 2007
  • Recent advances in the internet infrastructure have resulted in a large number of huge Web sites and portals worldwide. These Web sites are being visited by various types of users in many different ways. Among all the web page access sequences from different users, some of them occur so frequently that may need an attention from those who are interested. We call them frequent access patterns and access sequences that can be frequent the candidate patterns. Since these candidate patterns play an important role in the incremental Web mining, it is important to efficiently generate, add, delete, and search for them. This thesis presents a novel tree structure that can efficiently store the candidate patterns and a related set of algorithms for generating the tree structure, adding new patterns, deleting unnecessary patterns, and searching for the needed ones. The proposed tree structure has a kind of the 3 dimensional link structure and its nodes are layered.