• Proceedings of the KIEE Conference
• /
• 1998.07d
• /
• pp.1478-1480
• /
• 1998

Inception and propagation of electrical tree and properties of partial discharge(PD) pulses accompanying with tree in low density polyethylene were discussed. We observed the characteristics of process of electrical tree by using optical microscope and investigated the statistical characteristics of the PD pulses by analyzing PD quantities and distribution patterns. The PD pulses were analyzed by q-n, $\phi$-n and $\phi$-q distribution. The statistical operators used were skewness(s), kurtosis(k) and average phase angle. The skewness and average discharge phase angle of PD pulses increased as the Propagation of tree. The kurtosis was about 1.8 at the Inception of tree, but It increased as the propagation of tree.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 1998.06a
• /
• pp.219-222
• /
• 1998

In this study, The water tree characteristics were investigated when crosslinking coagent was added in XLPE/EnBA blends. When XLPE was blended with EnBA, there was a decrease of water tree length as an increase of nBA contents in XLPE/EnBA20 blends. The effect of crosslinking coagent. A was better than those of other crosslinking coagents B, C and D in water tree retardation. In case of XLPE/EnBA/Crosslinking coagent blends, water tree length was increased as the crosslinking coagents were increased from 0.2 to 2 phr in 2.0 phr DCP content. To clarify the effects of crosslinking coagent, the DCP contents were changed from 1.5 to 2.0 par in the same crosslinking coagent contents. Then, there was a decrease of water tree length as an increase of crosslinking coagent contents in 1.5 and 1.8 phr DCP contents.

• Textile Coloration and Finishing
• /
• v.16 no.5
• /
• pp.8-18
• /
• 2004

In order to study on the color change of silk dyed with natural colorant due to light fading, and find out the effect of combination dyeing, colorant extracts of safflower red, safflower yellow and amur cork tree were used, either singly or in combination. In combination dyeing, safflower yellow or amur cork tree dyeing process was added on the top of the silk fabric was dyed with safflower red. Color change and light fastness were investigated by $L^*,\; a^*,\; b^*$ H, V/C, and Color difference. Brightness of silk fabric dyed with safflower red and safflower yellow increased gradually with increasing the radiation time of UV light, but amur cork tree was decreased and turned to dull. Color difference of dyed with Amur cork tree showed higher than the others. Combination dyeing of safflower red and amur cork tree provided better light fastness than the one of safflower red and safflower yellow.

• ETRI Journal
• /
• v.43 no.6
• /
• pp.1024-1037
• /
• 2021

Mining high utility itemsets (HUIs) from transaction databases considers such factors as the unit profit and quantity of purchased items. Two-phase tree-based algorithms transform a database into compressed tree structures and generate candidate patterns through a recursive pattern-growth procedure. This procedure requires a lot of memory and time to construct conditional pattern trees. To address this issue, this study employs two compressed tree structures, namely, Utility Count Tree and String Utility Tree, to enumerate valid patterns and thus promote fast utility computation. Furthermore, the study presents an algorithm called single-phase utility computation (SPUC) that leverages these two tree structures to mine HUIs in a single phase by incorporating novel pruning strategies. Experiments conducted on both real and synthetic datasets demonstrate the superior performance of SPUC compared with IHUP, UP-Growth, and UP-Growth+algorithms.

• The KIPS Transactions:PartD
• /
• v.14D no.1 s.111
• /
• pp.21-34
• /
• 2007

According to recent rapid price drop and capacity growth of main memory, the number of applications on main memory databases is dramatically increasing. Cache miss, which means a phenomenon that the data required by CPU is not resident in cache and is accessed from main memory, is one of the major causes of performance degradation of main memory databases. Several cache-conscious trees have been proposed for reducing cache miss and making the most use of cache in main memory databases. Since each cache-conscious tree has its own unique features, more than one cache-conscious tree can be used in a single application depending on the application's requirement. Moreover, if there is no existing cache-conscious tree that satisfies the application's requirement, we should implement a new cache-conscious tree only for the application's sake. In this paper, we propose the cache-conscious generalized search tree (CC-GiST). The CC-GiST is an extension of the disk-based generalized search tree (GiST) [HNP95] to be tache-conscious, and provides the entire common features and algorithms in the existing cache-conscious trees including pointer compression and key compression techniques. For implementing a cache-conscious tree based on the CC-GiST proposed in this paper, one should implement only a few functions specific to the cache-conscious tree. We show how to implement the most representative cache-conscious trees such as the CSB+-tree, the pkB-tree, and the CR-tree based on the CC-GiST. The CC-GiST eliminates the troublesomeness caused by managing mire than one cache-conscious tree in an application, and provides a framework for efficiently implementing arbitrary cache-conscious trees with new features.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4A
• /
• pp.358-364
• /
• 2007

RFID, Radio Frequency Identification, technology is a contactless automatic identification technology using radio frequency. For this RFID technology to be widely spread, the problem of multiple tag identification, which a reader identifies a multiple number of tags in a very short time, has to be solved. Up to the present, many anti-collision algorithms have been developed in order to solve this problem, and those can be largely divided into ALOHA based algorithm and tree based algorithm. In this paper, two new anti-collision algorithms combining the characteristics of these two categories are presented. And the performances of the two algorithms are compared and evaluated in comparison with those of typical anti-collision algorithms: 18000-6 Type A, Type B, Type C, and query tree algorithm.

• Spatial Information Research
• /
• v.6 no.2
• /
• pp.125-132
• /
• 1998

The I/O performance for spatial queries is extremely important since the handling of huge amount of multidimensional data is required in spatial databases for geographic information systems. Therefore, we describe representative spatial access methods handling complex spatial objects, z-transform B tree, KDB tree, R tree, MAX tree, to increase I/O performance. In addition, we measure the performance of spatial indexing schemes by testing against various realistic data and query sets. Results from the benchmark test indicates that MAX outperforms other indexing schemes on insertion, range query, spatial join. MAX tree is expected to use as index scheme organizing storage system of GIS in the future.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4B
• /
• pp.305-313
• /
• 2011

This paper presents a P2P (Peer-to-Peer) overlay multicast tree construction algorithm to support stable multimedia service over the Internet. While constructing a multicast tree, it takes into account not only the link delay, but also peer stability. Since peers actually show dynamic and unstable behavior over P2P-based network, it is essential to consider peer stability. Furthermore, the weighting factor between link delay and peer stability is adaptively controlled according to the characteristics of the multicast tree. Basically, Genetic algorithm is employed to obtain a near optimal solution with low computational complexity. Finally, simulation results are provided to show the performance of the proposed algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.108-110
• /
• 2019

A Database is a collection of data that does not have redundancy, and it is essential to easily use and share information in an information society where the amount of information is increasing. A typical structure of a Database is a relational database and a tree-structure Database. This research studies the programming language MUMPS, which is a tree structure database. This language constructs the database by storing arrays in a dynamic or B-Tree format. Unlike SQL, which must be used in languages such as Java and C #, MUMPS supports language and database independently and can manage data, so the data porting rate is high. In fact, in U.S. hospitals, the MUMPS-based platform has a high market share.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.11a
• /
• pp.448-452
• /
• 2004

Cache sensitive $B^+-trees$ with partial keys is cache sensitive tree using both key compression and pointer compression. Although conventional cache sensitive trees consider individuallykey compression and pointer compression, cache sensitive $B^+-trees$ with partial keys make more cache utilization by compressing both key and pointer. We implement bulkload and search algorithms of cache sensitive $B^+-trees$ with partial key. And out performance studies show that cache sensitive $B^+-trees$ with partial key is better than $B^+-trees$ and Simple Prefix $B^+-trees$.