• 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.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.11a
• /
• pp.129-132
• /
• 2004

공간 색인구조는 공간 데이터를 효율적으로 관리하기 위한 도구로써, GIS와 같은 공간 데이터베이스의 성능을 결정하는 중요한 요소라 하겠다. 대부분의 응용분야에서 공간 데이터베이스는 보조기억장치에 저장된 방대한 양의 공간데이터 처리를 요구하므로 디스크 접근의 수를 줄이는 것이 전체 데이터베이스의 성능을 향상시키는데 중요한 요소이다. 이 논문에서는 SMR-tree라는 공간색인구조의 여러 응용분야에서 활용 가능성을 기존의 색인구조들과의 비교를 통해 확인한다. SMR-tree는 R-tree 계열의 구조로써 기존의 R-tree계열의 구조들과 동일한 노드의 형태를 가지고 있으나, 여러 개의 data space를 사용하여 data object를 배분함으로써 $R^{+}-tree$의 말단노드 내에 존재하는 잉여공간을 제거하면서 R-tree의 단점인 색인노드들 사이에 중첩을 허용치 않는다. SMR-tree의 성능은 여러 종류의 테스트 데이터(VLSI layout data, Tiger/Line file data)를 사용하여 R-tree, $R^{+}-tree,\;R^{\ast}-tree$와 비교된다. SMR-tree는 높은 공간 활용도와 다른 색인구조에 비해 빠른 질의 성능을 보임으로써 GIS와 같은 공간 데이터베이스를 위한 효율적인 색인구조로 사용이 될 것으로 기대된다.

• Journal of KIISE
• /
• v.41 no.10
• /
• pp.792-798
• /
• 2014

In spatial databases, R-tree is one of the most widely used indexing structures and many variants have been proposed for its performance improvement. Among these variants, Hilbert R-tree is a representative method using Hilbert curve to process large amounts of data without high cost split techniques to construct the R-tree. This Hilbert R-tree, however, is hardly applicable to large-scale applications in practice mainly due to high pre-processing costs and slow bulk-load time. To overcome the limitations of Hilbert R-tree, we propose a novel approach for parallelizing Hilbert mapping and thus accelerating bulk-loading of Hilbert R-tree on GPU memory. Hilbert R-tree based on GPU improves bulk-loading performance by applying the inversed-cell method and exploiting parallelism for packing the R-tree structure. Our experimental results show that the proposed scheme is up to 45 times faster compared to the traditional CPU-based bulk-loading schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.5
• /
• pp.527-547
• /
• 2009

Moving object management is widely used in traffic, logistic and data mining applications in ubiquitous environments. It is required to analyze spatio-temporal data and trajectories for moving object management. In this paper, we proposed a novel index structure for spatio-temporal aggregation of trajectory in a constrained network, named aCN-RB-tree. It manages aggregation values of trajectories using a constraint network-based index and it also supports direction of trajectory. An aCN-RB-tree consists of an aR-tree in its center and an extended B-tree. In this structure, an aR-tree is similar to a Min/Max R-tree, which stores the child nodes' max aggregation value in the parent node. Also, the proposed index structure is based on a constrained network structure such as a FNR-tree, so that it can decrease the dead space of index nodes. Each leaf node of an aR-tree has an extended B-tree which can store timestamp-based aggregation values. As it considers the direction of trajectory, the extended B-tree has a structure with direction. So this kind of aCN-RB-tree index can support efficient search for trajectory and traffic zone. The aCN-RB-tree can find a moving object trajectory in a given time interval efficiently. It can support traffic management systems and mining systems in ubiquitous environments.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.507-512
• /
• 2001

Feature-based similarity has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects. the performance of conventional multidimensional data structures tends to deteriorate as the number of dimensions of feature vectors increase. The $R^{*}-Tree$ is the most successful variant of the R-Tree. In this paper, we propose a SOM-based $R^{*}-Tree$ as a new indexing method for high-dimensional feature vectors. The SOM-based $R^{*}-Tree$ combines SOM and $R^{*}-Tree$ to achieve search performance more scalable to high-dimensionalties. Self-Organizingf Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two-dimensional space. The map is called a topological feature map, and preserves the mutual relationships (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. We experimentally compare the retrieval time cost of a SOM-based $R^{*}-Tree$ with of an SOM and $R^{*}-Tree$ using color feature vectors extracted from 40,000 images. The results show that the SOM-based $R^{*}-Tree$ outperform both the SOM and $R^{*}-Tree$ due to reduction of the number of nodes to build $R^{*}-Tree$ and retrieval time cost.

• Research in Plant Disease
• /
• v.23 no.3
• /
• pp.207-211
• /
• 2017

In December of 2016, 'The Forest Protection Act' was amended partly in The National Assembly and the socalled 'Tree Doctor Act' was promulgated. Tree Doctor Act will be enforced from June 28, 2018. Under the new Act, none other than 'Tree Hospital' can do disease and pest management work for trees in public living space. The only exclusive qualification for tree hospital is a 'Tree Doctor', the government registered license which is newly established by the Act. To become a tree doctor, he/she must complete the tree doctor training courses in the designated 'Tree Doctor Academy' and pass the qualification test. Currently, Korea Forest Service is drafting the enforcement ordinances and regulations for the implement of Tree Doctor Act. When taking into consideration that the most fundamental and important discipline of the plant and tree health care is the plant pathology, and that the tree health care is a promising business for young plant pathology people, Korean Society of Plant Pathology is ought to be actively involved in the preparation of the enforcement ordinances and regulations, and help the early establishment of the new tree health care system in living spaces of Korea.

• Journal of KIISE:Databases
• /
• v.35 no.3
• /
• pp.199-207
• /
• 2008

The FP-tree(Frequency Pattern Tree) mining association rules algorithm was proposed to improve mining performance by reducing DB scan overhead dramatically, and it is recognized that the performance of it is better than that of any other algorithms based on different approaches. But the FP-tree algorithm needs a few more memory because it has to store all transactions including frequent itemsets of the DB. This paper implements a FP-tree algorithm on a general purpose UNK system and compares it with the DHP(Direct Hashing and Pruning) algorithm which uses hash tree and direct hash table from the point of memory usage and execution time. The results show surprisingly that the FP-tree algorithm is poor than the DHP algorithm in some cases even if the system memory is sufficient for the FP-tree. The characteristics of the test data are as follows. The site of DB is look, the number of total items is $1K{\sim}7K$, avenrage length of transactions is $5{\sim}10$, avergage size of maximal frequent itemsets is $2{\sim}12$(these are typical attributes of data for large-scale convenience stores).

• Journal of Sasang Constitutional Medicine
• /
• v.15 no.1
• /
• pp.1-11
• /
• 2003

In Sasang Constitutional Medicine, pine trees have been used as medicines for Taeyangin and a pine-nuts tree for Taeumin. However, there has been some misunderstandings in interpretation as the Koreans referred to back(栢) as pine-nuts tree as well as cheukback(측백) tree. Also, we have disputed over how to translate songback(松栢). Regarding this dispute, 1 came to the following conclusion based on a research with exactitude. 1. Songja (松子), Songjain(松子仁), Songsil(松實) means Pinus Koraiensis(잣), not a pine .one. 2. Backja(栢子) is a fruit of Cheukback(측백) tree, not of a pinus koraiensis(잣). 3. Some part of 'yulsunjun(列仙傳)' quoted to explain pine-nuts in Bonchogangmok(本草綱目) was misrepresented. 4. In regard to the record that a court lady of Chin(秦) Dynasty lived for bundle of years, Galhong(葛洪) made a mistake by saying that she took pine needles and a Pinus Koraiensis in 'Pobakja(抱朴子)', while saying that she took pine needles and leaves of Cheukback(측백) tree in 'Joohoobigeupbang(　後備急方). Also He made a mistake by saying that took pine needles and leaves of cheukback(측백) tree in Bonchogangmok(本草綱目). 5. Songback(松栢), which was referred to in the Analects of Confucius(論語) and the historical annals(史記), should be understood as an old pine tree with a hard quality of the lumber and evergreen, .rather than 'a pine tree and a pine-nuts tree' or 'a pine tree and Cheukback(측백) tree'. 6. Although 'Songback(松栢) mentioned in a book on medicine were sometimes considered as 'a pine-nuts tree' and 'Cheukback(측백) tree' or 'a pine tree and .Cheukback(측백) tree,' it should be regarded as an old pine tree in most cases.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.3
• /
• pp.49-57
• /
• 2010

We extended a general attack tree to apply cyber attack model for network vulnerability analysis. We defined an extended cyber attack tree (E-CAT) which extends the general attack tree by associating each node of the tree with a transition of attack that could have contributed to the cyber attack. The E-CAT resolved the limitation that a general attack tree can not express complex and sophisticate attacks. Firstly, the Boolean expression can simply express attack scenario with symbols and codes. Secondary, An Attack Generation Probability is used to select attack method in an attack tree. A CONDITION-composition can express new and modified attack transition which a aeneral attack tree can not express. The E-CAT is possible to have attack's flexibility and improve attack success rate when it is applied to cyber attack model.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.1
• /
• pp.10-19
• /
• 2005

The minimum spanning tree (MST) problem is one of the traditional optimization problems. Unlike the MST, the degree constrained minimum spanning tree (DCMST) of a graph cannot, in general, be found using a polynomial time algorithm. So, finding the DCMST of a graph is a well-known NP-hard problem of importance in communications network design, road network design and other network-related problems. So, it seems to be natural to use evolutionary algorithms for solving DCMST. Especially, when applying an evolutionary algorithm to spanning tree problems, a representation and search operators should be considered simultaneously. This paper introduces a new tree representation scheme and a genetic operator for solving combinatorial tree problem using evolutionary algorithms. We performed empirical comparisons with other tree representations on several test instances and could confirm that the proposed method is superior to other tree representations. Even it is superior to edge set representation which is known as the best algorithm.