• 제목/요약/키워드: Electrical tree

검색결과 589건 처리시간 0.025초

CV케이블의 부분방전 신호를 통한 열화과정의 정량적 진단 (Normalization Diagnosis of Aging Process on Partial Discharge Signals of CV Cable)

  • 소순열;임장섭;김진사;이준웅;김태성
    • 한국전기전자재료학회:학술대회논문집
    • /
    • 한국전기전자재료학회 1997년도 추계학술대회 논문집
    • /
    • pp.451-455
    • /
    • 1997
  • The partial discharge has been blown as the chief breakdown of power equipments. The analysis and the recognition is much difficult because the partial discharge signal is very small and has complex aging pattern. Recently, insulation aging diagnosis based on pattern of phase(Ф), partial discharge magnitude(q), number(n) has been very important. Owing to depreciate the reappearance of aging progress at the electrical tree pattern and to be difficult to analyze visually, the study on partial discharge pattern is suggested to normalizing analysis method of partial discharge signals. This parer is purposed on prediction of life-time measurement of cv-cable, on decision of risk degree with normalization and real-time measurement of partial discharge signals for aging diagnosis of cv-cable. As normalizing the aging signals of electrical tree in cv-cable, it is able to confirm risk degree of insulation material with the distribution of Ф-q-n and recognize the process of aging pattern using neural network.

  • PDF

신경회로망을 이용한 신호 자동식별기 구현 및 성능분석 (On the Performance Analysis of an Automatic Neural Network Signal Classifier)

  • 윤병수;양성철;남상원;오원천
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1994년도 추계학술대회 논문집 학회본부
    • /
    • pp.397-399
    • /
    • 1994
  • In this paper a feature-based automatic neural network signal classifier is presented, where five neural network algorithms such as MLP, RBF, LVQ2, MLP-Tree and LVQ-Tree are combined in parallel to classifiy various signals from their features, based on the majority vote method. To demonstrate the performance and applicability of the proposed signal classifier, some test results for the classification of synthetic waveforms and power disturbances are provided.

  • PDF

트리구조의 배전계통 데이타베이스 구성과 트리탐색기법 (The Construction of Tree-structured Database and Tree Search Strategies in Distribution Systems)

  • 김세호;류헌수;최병윤;조시형;문영현
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1992년도 하계학술대회 논문집 A
    • /
    • pp.172-175
    • /
    • 1992
  • This paper proposes the methods to construct the tree-structured database and analyze the distribution system network. In order to cope with an extensive amount of data and the frequent breaker switching operations in distribution systems, the database for system configuration is constructed using binary trees. Once the tree-structured database has been built, the system tracing of distribution network can be rapidly performed. This remarkably enhances the efficiency of data search and easily adapts to system changes due to switching operations. The computation method of fast power flow using tree search strategies is presented. The methods in the paper may be available in the field of distribution system operation.

  • PDF

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

  • 강희성;박병준
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2006년도 심포지엄 논문집 정보 및 제어부문
    • /
    • pp.3-5
    • /
    • 2006
  • 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.

  • PDF

해저케이블의 열화진단을 위한 트리잉의 화상처리 (Image Processing of Treeing for Diagnosis of Deterioration in Submarine Cable)

  • 이재봉;임장섭;박현빈;구할본;김태성;요시무라 노보루
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1994년도 하계학술대회 논문집 C
    • /
    • pp.1655-1657
    • /
    • 1994
  • To measure treeing, visual measurement with an optical microscope has been used to explain breakdown mechanism by treeing in materials. The conventional direct visual method of tree deterioration observation is difficult to measure in short time processing, and impossible to analyze the deteriorated area by treeing, direction of tree growth, tree patterns etc. In this paper, we have developed a tree-measuring system using image processing for the tree growth, the area of deterioration, and other progresses of treeing. As experimental result, image processing is an effective alternative to direct visual observation method.

  • PDF

GN이 도입된 에폭시 수지계의 트리 진전의 인가 전압 의존성 (Applied Voltage Dependence of Treeing Growth in GN Introduced Epoxy Resin System)

  • 안현수;심미자;김상욱
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1996년도 추계학술대회 논문집 학회본부
    • /
    • pp.212-214
    • /
    • 1996
  • The growth of tree is affected by voltage, frequency, temperature, mechanical stress, etc.. This paper describes the effect of applied voltage on the growth of tree in DGEBA/MDA/GN(10 phr) system. As applied voltage increased, the time to breakdown of the system reduced. As applied time increased, the tree length of X-axis increased with sigmoid shape, however, the tree length of Y-axis increased sharply at the initial step and then were nearly constant. The phenomena of tree were complicated more and more, as applied time increased.

  • PDF

Efficient Implementations of a Delay-Constrained Least-Cost Multicast Algorithm

  • Feng, Gang;Makki, Kia;Pissinou, Niki
    • Journal of Communications and Networks
    • /
    • 제4권3호
    • /
    • pp.246-255
    • /
    • 2002
  • Constrained minimum Steiner tree (CMST) problem is a key issue in multicast routing with quality of service (QoS) support. Bounded shortest path algorithm (BSMA) has been recognized as one of the best algorithms for the CMST problem due to its excellent cost performance. This algorithm starts with a minimumdelay tree, and then iteratively uses a -shortest-path (KSP) algorithm to search for a better path to replace a “superedge” in the existing tree, and consequently reduces the cost of the tree. The major drawback of BSMA is its high time complexity because of the use of the KSP algorithm. For this reason, we investigate in this paper the possibility of more efficient implementations of BSMA by using different methods to locate the target path for replacing a superedge. Our experimental results indicate that our methods can significantly reduce the time complexity of BSMA without deteriorating the cost performance.

실리콘 처리에 의한 수트리 열화케이블의 절연회복 (Insulation rehabilitation of water tree aged cables by silicone treatment)

  • 김주용;송일근;한재홍;이동영;문재덕
    • 조명전기설비학회논문지
    • /
    • 제14권1호
    • /
    • pp.14-21
    • /
    • 2000
  • 본 논문은 수트리 열화된 가교폴리에틸렌(XLPE) 절연 지중케이블의 절연회복을 위해 개발된 실리콘 처리 기법의 현장적용 가능성을 검토하기 위해 수트리 열화된 325 $\textrm{mm}^2$ CN/CV 케이블을 수거하여 실리콘 처리하고, 시간의 경과에 따른 절연성능 향상도를 분석한 것이다. 시료 케이블의 절연회복을 평가하기 위해 교류절연파괴시험을 실시했다. 또 실리콘 처리케이블의 평가를 위해 진단시험 및 케이블 특성평가를 수행했다. 실리콘 처리후 1년 경과 시료 케이블올 분석한 결과, 실리콘액(silicone fluid)과 수분이 효과적으로 결합해 절연파괴강도가 상당히 증가한 것으로 나타났다. 실험결과를 종합해 볼 때 수트리로 열화된 케이블의 절연성능 향상에 실리콘 처리가 효과적인 것으로 나타났다.

  • PDF

재난 모니터링을 위한 편대비행 UAV 네트워크에서 동적 트리 형성 프로토콜 (Dynamic Tree Formation Protocol in UAV Formation Flying Network for Disaster Monitoring)

  • 박진희;김연주;정진욱
    • 한국항행학회논문지
    • /
    • 제16권2호
    • /
    • pp.271-277
    • /
    • 2012
  • 본 논문에서는 재난모니터링, 환경감시 및 재난구호 등의 정보 수집 및 정찰 등의 임무를 수행하는 다수의 UAV들로 구성된 편대비행 네트워크를 위해 동적 트리 형성 프로토콜을 제안하였다. 특히 무선 동적 환경에 적응한 최적의 트리를 구성하기 위한 링크 비용을 구하기 위해 거리에 따른 무선 신호 감쇄현상을 적용하여 Hop-LQI Weight 알고리즘을 고안하였으며 이를 MSP430 K-mote 센서 플랫폼에 TinyOS 코드를 구현하였다. 이를 무선 통신에서 링크 비용 산출 기법인 Minimum LQI 방법과 노드 수에 따른 평균 경로 설정시간을 비교를 통하여 성능을 검증하였다.

A New Link-Based Single Tree Building Algorithm for Shortest Path Searching in an Urban Road Transportation Network

  • Suhng, Byung Munn;Lee, Wangheon
    • Journal of Electrical Engineering and Technology
    • /
    • 제8권4호
    • /
    • pp.889-898
    • /
    • 2013
  • The shortest-path searching algorithm must not only find a global solution to the destination, but also solve a turn penalty problem (TPP) in an urban road transportation network (URTN). Although the Dijkstra algorithm (DA) as a representative node-based algorithm secures a global solution to the shortest path search (SPS) in the URTN by visiting all the possible paths to the destination, the DA does not solve the TPP and the slow execution speed problem (SEP) because it must search for the temporary minimum cost node. Potts and Oliver solved the TPP by modifying the visiting unit from a node to the link type of a tree-building algorithm like the DA. The Multi Tree Building Algorithm (MTBA), classified as a representative Link Based Algorithm (LBA), does not extricate the SEP because the MTBA must search many of the origin and destination links as well as the candidate links in order to find the SPS. In this paper, we propose a new Link-Based Single Tree Building Algorithm in order to reduce the SEP of the MTBA by applying the breaking rule to the LBA and also prove its usefulness by comparing the proposed with other algorithms such as the node-based DA and the link-based MTBA for the error rates and execution speeds.