• Title/Summary/Keyword: Algorithm Ability

Search Result 1,189, Processing Time 0.026 seconds

Developed Ability of Zero-phase Overcurrent Relay by Changed setting point value (설정치 변경에 의한 영상과전류계전기의 성능개선)

  • Kim, N.H.;Yoon, D.S.;Chang, S.I.;Choi, J.H.
    • Proceedings of the KIEE Conference
    • /
    • 1998.11a
    • /
    • pp.220-222
    • /
    • 1998
  • This paper presents a method, which develops an ability of Zero-phase Overcurrent Relay. Zero-phase current is very useful factor of Fault decision in Protect Relaying system. Actually, the setting-point value of Designed Relay, using Zero-phase current, is fixed. So in the case of deciding fault, Fixed setting-point value is not suitable for changing Load. and cause errors in Distributions system. For solving this problem, This paper proposes the Changed setting point value Algorithm, which can be adaptive for changing Distributions system using Zero-phase current r.m.s. indexes. The results of simulation under Load changing and High impedance fault show that proposed algorithm is useful for changing Distributions system and decreasing errors.

  • PDF

Customer Clustering Method Using Repeated Small-sized Clustering to improve the Classifying Ability of Typical Daily Load Profile (일일 대표 부하패턴의 분별력을 높이기 위한 반복적인 소규모 군집화를 이용한 고객 군집화 방법)

  • Kim, Young-Il;Song, Jae-Ju;Oh, Do-Eun;Jung, Nam-Joon;Yang, Il-Kwon
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.11
    • /
    • pp.2269-2274
    • /
    • 2009
  • Customer clustering method is used to make a TDLP (typical daily load profile) to estimate the quater hourly load profile of non-AMR (Automatic Meter Reading) customer. In this paper, repeated small-sized clustering method is supposed to improve the classifying ability of TDLP. K-means algorithm is well-known clustering technology of data mining. To reduce the local maxima of k-means algorithm, proposed method clusters average load profiles to small-sized clusters and selects the highest error rated cluster and clusters this to small-sized clusters repeatedly to minimize the local maxima.

Development and Application of FAAP Learning Model for the Concrete Operational Period's Students (구체적 조작기 학생들을 위한 선 알고리즘 후 프로그래밍 학습 모형의 개발 및 적용)

  • Huh, Min;Jin, Young-Hak;Kim, Yung-Sik
    • The Journal of Korean Association of Computer Education
    • /
    • v.13 no.1
    • /
    • pp.27-36
    • /
    • 2010
  • Introducing algorithm and programming education to the middle school 'Information' curriculum is appropriate to develop higher thinking skills like problem solving ability and creativity that is the most important ability to the people living in the knowledge and information society. But to providing reduced algorithm and programming contents of higher education increase the cognitive burden on the students in the concrete operational period who is not yet reached to the formal operational period, and moreover transfering principles and strategies learned in the algorithm to the programming for the problem solving is difficult. For this study, student's developmental characteristics in the concrete operational period among cognitive developmental periods was considered, and FAAP(First-Algorithm After-Programming) learning model which can transfer algorithm to programming was developed, and finally the effectiveness of learning motivation and achievement to the concrete operational period's students was verified. Results of the tests showed that learning motivation and achievement of the concrete operational period's students that learned FAAP model were different significantly.

  • PDF

The Development of a Splatting Algorithm for Financial Visualization on Networked and Wireless Applications

  • Bhashyakarla Deepthi;Ou Kui;Jia, Khoo-Shih;Xiong Fei;Edmond C. Prakash;Edmund M-K. Lai
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.106.3-106
    • /
    • 2001
  • Financial institutions survive on the ability to collect and react to data. Today´s financial community is bombarded by massive amounts of information from real time data-feeds, risk management systems, and other intelligent sources. The large quantities of numerical data are virtually impossible to understand quickly. Humans have the ability to understand pictures instantaneously. Thus, by converting data into pictures, and using colour, size, shape, and pattern to define relationships, individuals can rapidly process complex Information.

  • PDF

An Intelligent Tracking Method for a Maneuvering Target

  • Lee, Bum-Jik;Joo, Young-Hoon;Park, Jin-Bae
    • International Journal of Control, Automation, and Systems
    • /
    • v.1 no.1
    • /
    • pp.93-100
    • /
    • 2003
  • Accuracy in maneuvering target tracking using multiple models relies upon the suit-ability of each target motion model to be used. To construct multiple models, the interacting multiple model (IMM) algorithm and the adaptive IMM (AIMM) algorithm require predefined sub-models and predetermined acceleration intervals, respectively, in consideration of the properties of maneuvers. To solve these problems, this paper proposes the GA-based IMM method as an intelligent tracking method for a maneuvering target. In the proposed method, the acceleration input is regarded as an additive process noise, a sub-model is represented as a fuzzy system to compute the time-varying variance of the overall process noise, and, to optimize the employed fuzzy system, the genetic algorithm (GA) is utilized. The simulation results show that the proposed method has a better tracking performance than the AIMM algorithm.

Optimal Capacitor Placement Considering Voltage-stability Margin with Hybrid Particle Swarm Optimization

  • Kim, Tae-Gyun;Lee, Byong-Jun;Song, Hwa-Chang
    • Journal of Electrical Engineering and Technology
    • /
    • v.6 no.6
    • /
    • pp.786-792
    • /
    • 2011
  • The present paper presents an optimal capacitor placement (OCP) algorithm for voltagestability enhancement. The OCP issue is represented using a mixed-integer problem and a highly nonlinear problem. The hybrid particle swarm optimization (HPSO) algorithm is proposed to solve the OCP problem. The HPSO algorithm combines the optimal power flow (OPF) with the primal-dual interior-point method (PDIPM) and ordinary PSO. It takes advantage of the global search ability of PSO and the very fast simulation running time of the OPF algorithm with PDIPM. In addition, OPF gives intelligence to PSO through the information provided by the dual variable of the OPF. Numerical results illustrate that the HPSO algorithm can improve the accuracy and reduce the simulation running time. Test results evaluated with the three-bus, New England 39-bus, and Korea Electric Power Corporation systems show the applicability of the proposed algorithm.

On Modification and Application of the Artificial Bee Colony Algorithm

  • Ye, Zhanxiang;Zhu, Min;Wang, Jin
    • Journal of Information Processing Systems
    • /
    • v.14 no.2
    • /
    • pp.448-454
    • /
    • 2018
  • Artificial bee colony (ABC) algorithm has attracted significant interests recently for solving the multivariate optimization problem. However, it still faces insufficiency of slow convergence speed and poor local search ability. Therefore, in this paper, a modified ABC algorithm with bees' number reallocation and new search equation is proposed to tackle this drawback. In particular, to enhance solution accuracy, more bees in the population are assigned to execute local searches around food sources. Moreover, elite vectors are adopted to guide the bees, with which the algorithm could converge to the potential global optimal position rapidly. A series of classical benchmark functions for frequency-modulated sound waves are adopted to validate the performance of the modified ABC algorithm. Experimental results are provided to show the significant performance improvement of our proposed algorithm over the traditional version.

Hybrid Genetic Algorithm Reinforced by Fuzzy Logic Controller (퍼지로직제어에 의해 강화된 혼합유전 알고리듬)

  • Yun, Young-Su
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.28 no.1
    • /
    • pp.76-86
    • /
    • 2002
  • In this paper, we suggest a hybrid genetic algorithm reinforced by a fuzzy logic controller (flc-HGA) to overcome weaknesses of conventional genetic algorithms: the problem of parameter fine-tuning, the lack of local search ability, and the convergence speed in searching process. In the proposed flc-HGA, a fuzzy logic controller is used to adaptively regulate the fine-tuning structure of genetic algorithm (GA) parameters and a local search technique is applied to find a better solution in GA loop. In numerical examples, we apply the proposed algorithm to a simple test problem and two complex combinatorial optimization problems. Experiment results show that the proposed algorithm outperforms conventional GAs and heuristics.

Fuzzy Combined Polynomial Neural Networks (퍼지 결합 다항식 뉴럴 네트워크)

  • Roh, Seok-Beom;Oh, Sung-Kwun;Ahn, Tae-Chon
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.7
    • /
    • pp.1315-1320
    • /
    • 2007
  • In this paper, we introduce a new fuzzy model called fuzzy combined polynomial neural networks, which are based on the representative fuzzy model named polynomial fuzzy model. In the design procedure of the proposed fuzzy model, the coefficients on consequent parts are estimated by using not general least square estimation algorithm that is a sort of global learning algorithm but weighted least square estimation algorithm, a sort of local learning algorithm. We are able to adopt various type of structures as the consequent part of fuzzy model when using a local learning algorithm. Among various structures, we select Polynomial Neural Networks which have nonlinear characteristic and the final result of which is a complex mathematical polynomial. The approximation ability of the proposed model can be improved using Polynomial Neural Networks as the consequent part.

Harmony Search Algorithm for Optimal Placement Problem of Distributed Generations (분산전원 최적설치를 위한 Harmony Search 알고리즘 응용)

  • Rhee, Sang-Bong;Kim, Kyu-Ho
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.59 no.5
    • /
    • pp.866-870
    • /
    • 2010
  • This paper presents a application of Harmony Search (HS) algorithm for optimal placement of distributed generations(DGs) in distribution systems. In optimization procedure, the HS algorithm denotes the searching ability for the global optimal solution with simple coding of the iteration procedure, and shows the fast convergence characteristics for getting solutions. The HS algorithm is tested on 9 buses and 69 buses distribution systems, and the results prove its effectiveness to determine appropriate placement points of DGs and reducing amount of active power without the occurrence of any mis-determination in selection of its capacity.