• Journal of Information Technology Applications and Management
• /
• v.12 no.1
• /
• pp.111-123
• /
• 2005

Many indexing methods were proposed so that process moving object efficiently. Among them, indexing methods like the 3D R-tree treat temporal and spatial domain as the same. Actually, however. both domain had better process separately because of difference in character and unit. Especially in this paper we deal with limited region such as indoor environment since spatial domain is limited but temporal domain is grown. In this paper we present a novel indexing structure, namely STS-tree(Separation of Time and Space tree). based on limited region. STS-tree is a hybrid tree structure which consists of R-tree and one-dimensional TB-tree. The R-tree component indexes static object and spatial information such as topography of the space. The TB-tree component indexes moving object and temporal information.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2001.11a
• /
• pp.270-273
• /
• 2001

Electrical tree is studied widely by manufacture state of insulating material fare and blazing fire diagnosis system of use in phenomenon of part discharge that happen for main cause of dielectric breakdown of equipment for electric power. Use process that draw tree pattern here measuring above zero to study special quality of this electricity tree, real-time processing by image processing is proposed because reproduction of tree blazing fire process drops and pattern of tree is difficult correct quantification of tree growth by existent visual observation by involution. This research presents general process that need in image processing of tree blazing fire, and that remove various noises that happen in above zero by measuring electrical tree dividing background and complete view in measured above zero taking advantage of specially proposed complete view object abstraction techniques effectively and quantification of tree becomes easy naturally, can apply to dielectric breakdown estimate because can chase growth process of tree.

• Journal of information and communication convergence engineering
• /
• v.21 no.1
• /
• pp.54-61
• /
• 2023

The family tree is one of the key elements of humanities classics research and is very important for accurately understanding people or families. In this paper, we introduce a method for automatically generating a family tree using information on interpersonal relationships (IIPR) from the Korean Classics Database (KCDB) and visualize interpersonal searches within a family tree using data-driven document JavaScript (d3.js). To date, researchers of humanities classics have wasted considerable time manually drawing family trees to understand people's influence relationships. An automatic family tree builder analyzes a database that visually expresses the desired family tree. Because a family tree contains a large amount of data, we analyze the performance and bottlenecks according to the amount of data for visualization and propose an optimal way to construct a family tree. To this end, we create an n-ary tree with fake data, visualize it, and analyze its performance using simulation results.

• Journal of applied mathematics & informatics
• /
• v.41 no.6
• /
• pp.1237-1256
• /
• 2023

The tree products of groups with amalgamation subgroups are generalizations of the free products of groups with amalgamation subgroup. The aim of this paper is to construct a tree called the standard tree where the tree products of groups with amalgamation subgroups act without inversions and then find the quotient of this action. Furthermore, we show that if the amalgamation subgroups are finite and the factor groups act on disjoint trees then there exists a tree called the fiber tree where the tree products of groups with amalgamation subgroups act without inversions and find the quotients of this action. If each factor is a tree products with amalgamation subgroups, we get a new fiber tree and the corresponding factors.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.1
• /
• pp.57-64
• /
• 2014

As Steiner minimum tree building belongs to NP-Complete problem domain, heuristics for the problem ask for immense amount execution time and computations in numerous inputs. In this paper, we propose an efficient mechanism of euclidean Steiner minimum tree construction for numerous inputs using combination of Delaunay triangulation and Prim's minimum spanning tree algorithm. Trees built by proposed mechanism are compared respectively with the Prim's minimum spanning tree and minimums spanning tree based Steiner minimum tree. For 30,000 input nodes, Steiner minimum tree by proposed mechanism shows about 2.1% tree length less and 138.2% execution time more than minimum spanning tree, and does about 0.013% tree length less and 18.9% execution time less than minimum spanning tree based Steiner minimum tree in experimental results. Therefore the proposed mechanism can work moderately well to many useful applications where execution time is not critical but reduction of tree length is a key factor.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.65-75
• /
• 2005

Moving-objects databases should efficiently support database queries that refer to the trajectories and positions of continuously moving objects. To improve the performance of these queries. an efficient indexing scheme for continuously moving objects is required. To my knowledge, range queries on current positions cannot be handled by the 3D R-tree and the TB-tree. In order to handle range queries on current and past positions. I modified the original 3D R-tree to keep the now tags. Most of spatio-temporal index structures suffer from the fact that they cannot efficiently process range queries past positions of moving objects. To address this issue. we propose an access method, called the Tagged Adaptive 3DR-tree (or just TA3DR-tree), which is based on the original 3D R-tree method. The results of our extensive experiments show that the Tagged Adaptive 3DR-tree outperforms the original 3D R-tree and the TB-tree typically by a big margin.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.4
• /
• pp.17-22
• /
• 2022

With the spread of web services, data types are becoming more diversified. In addition to the form of storing data such as images, videos, and texts, the number and form of properties and metadata expressing the data are different for each data. In order to efficiently process such unstructured data, a key-value store is widely used for state-of-the-art applications. LSM-Tree (Log Structured Merge Tree) is the core data structure of various commercial key-value stores. LSM-Tree is optimized to provide high performance for small writes by recording all write and delete operations in a log manner. However, there is a problem in that the delay time and processing speed of user requests are lowered as batches of deletion operations for expired data are inserted into the LSM-Tree as special key-value data. This paper presents a Filtered LSM-Tree (FLSM-Tree) that solves the above problem by separating the deleted key from the main tree structure while maintaining all the advantages of the existing LSM-Tree. The proposed method is implemented in LevelDB, a commercial key-value store and it shows that the read performance is improved by up to 47% in performance evaluation.

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.333-338
• /
• 2001

Fault tree is a widely used methodology for analyzing product reliability. The fault trees are usually constructed using the experiences of expert reliability engineers in top-down approaches and have different structures according to each expert's subjectivity. In this work it is tried to find a general method for the fault tree construction based on the function tree that is the result of product function deployment. Based on the function tree, the method has the advantage of resulting an objective fault tree since the faults are defined as the opposite concept of functions. The fault tree construction of this work consists of the following steps: 1) definition of product primary function with the viewpoints of product operation and configuration, 2) construction of functional relation chart using a grouping algorithm, 3) abstraction of functional block diagram according to operation sequences and configuration of a product, 4) construction of function tree for each viewpoint, and 5) construction of fault tree by matching the function tree and simplification of the result.

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

Water tree degradations have been considered as one of the most important causes of failure in underground distribution cables with polymeric insulation. Water tree growth is a preliminary step in the sequence of electrical tree initiation and electrical breakdown of the insulation. In this paper, needle electrode is made use of the etching methods and the pellet type specimen is made to observe the water tree in succession. In previous methods are able to observe the tree degradations without cutting and dyeing. The water tree image is recorded on VTR with CCD camera. The tree length of X, Y axis direction and aging area(treeing area) are calculated with image measurement. As a result of this study, water tree is observed by non-destructive method. Electrical tree is initiated from needle electrode tip only but water tree is initiated from total area of water electrode. Electrical tree owing to water treeing is initiated at low electric field and grown with discontinuously. Namely, water tree is shown up a different characteristics of tree growth.

• Journal of the Speleological Society of Korea
• /
• no.87
• /
• pp.1-7
• /
• 2008

Jeju-do is an oval-shape volcanic island spanning 73km east to west and 31km north to south. The 1,950meter high, Mt. Halla is the centerpiece of unique landscape of Jeju Island, Sloping gently downward toward the coastline. The most of lava tree-molds are appeared at the below of 300m on Mt. Halla. There are many lava tree-molds in Weullim-ri, Hallim-eup. Vertical tree-molds, recumbent tree-molds are distributed widely in Hallim-eup area. By the observation of shape and structure, lava tree-molds can be classified into, recumbent tree-molds and capture tree-molds, fragmental tree-molds, compounded tree-molds, vertical tree-molds.