• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 1997.11a
• /
• 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.

• Proceedings of the KIEE Conference
• /
• 1994.11a
• /
• 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.

• Proceedings of the KIEE Conference
• /
• 1992.07a
• /
• 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.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• 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.

• Proceedings of the KIEE Conference
• /
• 1994.07b
• /
• 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.

• Proceedings of the KIEE Conference
• /
• 1996.11a
• /
• 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.

• Journal of Communications and Networks
• /
• v.4 no.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.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.14 no.1
• /
• pp.14-21
• /
• 2000

This paper presents the results of performance evaluation of silicone treatment technique which was developed for the insulation rehabilitation of water tree aged XLPE power cables. We treated the water tree aged 325 [$\textrm{mm}^2$] CN/CV cables with silicone, and then analyzed the degree of insulation rehabilitation as a function of time. AC breakdown test was conducted to evaluate insulation rehabilitation. The diagnosis test using relaxation current measurement and the characteristic analysis of insulation were also performed to estimate silicone treated cable. AC breakdown strength of silicone treated cable for one year was increased, resulting from the chemical reaction between silicone fluid and water. This experiment showed that the silicone treatment technique was effective for insulation rehabilitation of the water tree aged cables.

• Journal of Advanced Navigation Technology
• /
• v.16 no.2
• /
• pp.271-277
• /
• 2012

In this paper, we propose a dynamic tree formation protocol for multiple UAV which is gathering data or accomplishing a mission such as disaster monitoring, environment monitoring, and disaster relief. Especilly, we designed Hop-LQI Weight algorithm to form optimal tree in wireless dynamic environment applying situation of radio signal attenuation over distance and implemented our algorithm in MSP 430 K-mote sensor platform using TinyOS codes. We verified performance of our algorithm by comparing average link setup time by the number of nodes with minimum LQI, link cost calculation method in wireless communication.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.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.