• Title/Summary/Keyword: software algorithms

Search Result 1,093, Processing Time 0.027 seconds

A Study on the Countermeasure Algorithm for Power System Disturbances in Large Scale Fuel Cell Generation System (대용량 연료전지시스템의 계통외란 방지알고리즘에 관한 연구)

  • Choi, Sung-sik;Kim, Byung-ki;Park, Jae-beom;Rho, Dae-seok
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.5
    • /
    • pp.711-717
    • /
    • 2016
  • Recently, fuel cell generation system with high energy efficiency and low CO2 emission is energetically interconnected with distribution power system. Especially, MCFC(molten carbonate fuel cell) operating at high temperature conditions is commercialized and installed as a form of large scale power generation system. However, it is reported that power system disturbances such as harmonic distortion, surge phenomenon, unbalance current, EMI(Electromagnetic Interference), EMC (Electromagnetic Compatibility) and so on, have caused several problems including malfunction of protection device and damage of control devices in the large scale FCGS(Fuel Cell Generation System). Under these circumstances, this paper proposes countermeasure algorithms to prevent power system disturbances based on the modelling of PSCAD/EMTDC and P-SIM software. From the simulation results, it is confirmed that proposed algorithms are useful method for the stable operation of a large scale FCGS.

A Complex Noise Suppression Algorithm for On-line Partial Discharge Diagnosis Systems (운전중 부분방전 진단시스템을 위한 복합 잡음제거 기법)

  • Yi, Sang-Hwa;Youn, Young-Woo;Choo, Young-Bae;Kang, Dong-Sik
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.2
    • /
    • pp.342-348
    • /
    • 2009
  • This paper introduces a novel denoising algorithm for the partial-discharge(PD) signals from power apparatuses. The developed algorithm includes three kinds of specific denoising sub-algorithms. The first sub-algorithm uses the fuzzy logic which classifies the noise types in the magnitude versus phase PD pattern. This sub-algorithm is especially effective in the rejection of the noise with high and constant magnitude. The second one is the method simply removing the pulses in the phase sections below the threshold count in the count versus phase pattern. This method is effective in removing the occasional high level noise pulses. The last denoising sub-algorithm uses the grouping characteristics of PD pulses in the 3D plot of the magnitude versus phase versus cycle. This special technique can remove the periodical noise pulses with varying magnitudes, which are very difficult to be removed by other denoising methods. Each of the sub-algorithm has different characteristic and shows different quality of the noise rejection. On that account, a parameter which numerically expresses the noise possessing degree of signal, is defined and evaluated. Using the parameter and above three sub-algorithms, an adaptive complex noise rejection algorithm for the on-line PD diagnosis system is developed. Proposed algorithm shows good performances in the various real PD signals measured from the power apparatuses in the Korean plants.

Survey on Quantitative Performance Evaluation Methods of Image Dehazing (안개 제거 기술의 정량적인 성능 평가 기법 조사)

  • Lee, Sungmin;Yu, Jae Taeg;Jung, Seung-Won;Ra, Sung Woong
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.4 no.12
    • /
    • pp.571-576
    • /
    • 2015
  • Image dehazing has been extensively studied, but the performance evaluation method for dehazing techniques has not attracted significant interest. This paper surveys many existing performance evaluation methods of image dehazing. In order to analyze the reliability of the evaluation methods, synthetic hazy images are first reconstructed using the ground-truth color and depth image pairs, and the dehazed images are then compared with the original haze-free images. Meanwhile we also evaluate dehazing algorithms not by the dehazed images' quality but by the performance of computer vision algorithms before/after applying image dehazing. All the aforementioned evaluation methods are analyzed and compared, and research direction for improving the existing methods is discussed.

Magnetic Flux Leakage (MFL) based Defect Characterization of Steam Generator Tubes using Artificial Neural Networks

  • Daniel, Jackson;Abudhahir, A.;Paulin, J. Janet
    • Journal of Magnetics
    • /
    • v.22 no.1
    • /
    • pp.34-42
    • /
    • 2017
  • Material defects in the Steam Generator Tubes (SGT) of sodium cooled fast breeder reactor (PFBR) can lead to leakage of water into sodium. The water and sodium reaction will lead to major accidents. Therefore, the examination of steam generator tubes for the early detection of defects is an important requirement for safety and economic considerations. In this work, the Magnetic Flux Leakage (MFL) based Non Destructive Testing (NDT) technique is used to perform the defect detection process. The rectangular notch defects on the outer surface of steam generator tubes are modeled using COMSOL multiphysics 4.3a software. The obtained MFL images are de-noised to improve the integrity of flaw related information. Grey Level Co-occurrence Matrix (GLCM) features are extracted from MFL images and taken as input parameter to train the neural network. A comparative study on characterization have been carried out using feed-forward back propagation (FFBP) and cascade-forward back propagation (CFBP) algorithms. The results of both algorithms are evaluated with Mean Square Error (MSE) as a prediction performance measure. The average percentage error for length, depth and width are also computed. The result shows that the feed-forward back propagation network model performs better in characterizing the defects.

A Dynamic Simulation of Distance Relay Using EMTP MODELS (EMTP MODELS를 이용한 거리 계전기 응동 시뮬레이션)

  • 허정용;김철환;여상민
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.52 no.1
    • /
    • pp.17-28
    • /
    • 2003
  • Digital technology has advanced very significantly over the years both in terms of software tools and hardware available. It is now applied extensively in many area of electrical engineering including protective relaying in power systems. Digital relays based on digital technology have many advantages over the traditional analog relays. The digital relay is able to do what is difficult or impossible in the analog relays. However, the complex algorithms associated with the digital relays are difficult to test and verify in real time on real power systems. Although non real-time simulators like PSCAD/EMTDC are employed to test the algorithms, such simulations have the disadvantage that they cannot test the relay dynamically. Hence, real-time simulators like RTDS are used, but the latter needs large space and it is very expensive. This paper uses EMTP MODELS to simulate the power system and the distance relay. The distance relay algorithm is constructed and the distance relay is interfaced with a test power system. The distance relays performance is then assessed interactively under various fault types, fault distances and fault inception angles. The test results show that we can simulate the distance relay effectively and we can examine the operation of the distance relay very closely including debugging by using EMTP MODELS.

Development of Clustering Algorithm and Tool for DNA Microarray Data (DNA 마이크로어레이 데이타의 클러스터링 알고리즘 및 도구 개발)

  • 여상수;김성권
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.10
    • /
    • pp.544-555
    • /
    • 2003
  • Since the result data from DNA microarray experiments contain a lot of gene expression information, adequate analysis methods are required. Hierarchical clustering is widely used for analysis of gene expression profiles. In this paper, we study leaf-ordering, which is a post-processing for the dendrograms output by hierarchical clusterings to improve the efficiency of DNA microarray data analysis. At first, we analyze existing leaf-ordering algorithms and then present new approaches for leaf-ordering. And we introduce a software HCLO(Hierarchical Clustering & Leaf-Ordering Tool) that is our implementation of hierarchical clustering, some of existing leaf-ordering algorithms and those presented in this paper.

Content-Based Video Retrieval Algorithms using Spatio-Temporal Information about Moving Objects (객체의 시공간적 움직임 정보를 이용한 내용 기반 비디오 검색 알고리즘)

  • Jeong, Jong-Myeon;Moon, Young-Shik
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.9
    • /
    • pp.631-644
    • /
    • 2002
  • In this paper efficient algorithms for content-based video retrieval using motion information are proposed, including temporal scale-invariant retrieval and temporal scale-absolute retrieval. In temporal scale-invariant video retrieval, the distance transformation is performed on each trail image in database. Then, from a given que교 trail the pixel values along the query trail are added in each distance image to compute the average distance between the trails of query image and database image, since the intensity of each pixel in distance image represents the distance from that pixel to the nearest edge pixel. For temporal scale-absolute retrieval, a new coding scheme referred to as Motion Retrieval Code is proposed. This code is designed to represent object motions in the human visual sense so that the retrieval performance can be improved. The proposed coding scheme can also achieve a fast matching, since the similarity between two motion vectors can be computed by simple bit operations. The efficiencies of the proposed methods are shown by experimental results.

Comparison of Parallelized Network Coding Performance (네트워크 코딩의 병렬처리 성능비교)

  • Choi, Seong-Min;Park, Joon-Sang;Ahn, Sang-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.19C no.4
    • /
    • pp.247-252
    • /
    • 2012
  • Network coding has been shown to improve various performance metrics in network systems. However, if network coding is implemented as software a huge time delay may be incurred at encoding/decoding stage so it is imperative for network coding to be parallelized to reduce time delay when encoding/decoding. In this paper, we compare the performance of parallelized decoders for random linear network coding (RLC) and pipeline network coding (PNC), a recent development in order to alleviate problems of RLC. We also compare multi-threaded algorithms on multi-core CPUs and massively parallelized algorithms on GPGPU for PNC/RLC.

Optimal Multicast Algorithm and Architecture-Dependent Tuning on the Parameterized Communication Model (변수화된 통신모델에서의 최적의 멀티캐스트 알고리즘 및 컴퓨터 구조에 따른 튜닝)

  • Lee, Ju-Yeong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.9
    • /
    • pp.2332-2342
    • /
    • 1999
  • Multicast is an important system-level one-to-many collective communication service. A key issue in designing software multicast algorithms is to consider the trade-off between performance and portability. Based on the LogP model, the proposed parameterized communication model can more accurately characterize the communication network of parallel platforms, Under the parameterized model, we propose an efficient architecture-independent method. OPT-tree algorithm, to construct optimal multicast trees and also investigate architecture-dependent tuning on performance of the multicast algorithm to achieve the truly optimal performance when implemented in real networks. Specifically, OPT-mesh which is the optimized version of the parameterized multicast algorithm for wormhole-switched mesh networks is developed and compared with two other well-known network-dependent algorithms.

  • PDF

An Explicit Column Generation Algorithm for the Profit Based Unit Commitment Problem in Electric Power Industry (전력산업에서의 Profit-Based Unit Commitment Problem 최적화를 위한 명시적 열생성 알고리즘)

  • Lee, Kyung-Sik;Song, Sang-Hwa
    • IE interfaces
    • /
    • v.20 no.2
    • /
    • pp.186-194
    • /
    • 2007
  • Recent deregulation of Korean electricity industry has made each power generation company pay more attention to maximizing its own profit instead of minimizing the overall system operation cost while guaranteeing system security. Electricity power generation problem is typically defined as the problem of determining both the on and off status and the power generation level of each generator under the given fuel constraints, which has been known as Profit-Based Unit Commitment (PBUC) problem. To solve the PBUC problem, the previous research mostly focused on devising Lagrangian Relaxation (LR) based heuristic algorithms due to the complexity of the problem and the nonlinearity of constraints and objectives. However, these heuristic approaches have been reported as less practical in real world applications since the computational run time is usually quite high and it may take a while to implement the devised heuristic algorithms as software applications. Especially when considering long-term planning problem which spans at least one year, the complexity becomes higher. Therefore, this paper proposes an explicit column generation algorithm using power generation patterns and the proposed algorithm is successfully applied to a Korean power generation company. The proposed scheme has a robust structure so that it is expected to extend general PBUC problems.