• Journal of KIISE
• /
• v.42 no.4
• /
• pp.522-529
• /
• 2015

Ever since the R-tree was proposed to index multi-dimensional data, many efforts have been made to improve its query performances. One common trend to improve query performance is to parallelize query processing with the use of multi-core architectures. To this end, a GPU-base R-tree has been recently proposed. However, even though a GPU-based R-tree can exhibit an improvement in query performance, it is limited in its ability to handle large volumes of data because GPUs have limited physical memory. To address this problem, we propose MGR-tree (Multi-GPU R-tree), which can manage large volumes of data by dividing nodes into multiple GPUs. Our experiments show that MGR-tree is up to 9.1 times faster than a sequential search on a GPU and up to 1.6 times faster than a conventional GPU-based R-tree.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06c
• /
• pp.156-159
• /
• 2010

vp tree는 기준점(vantage point)과의 거리를 기준으로 데이터베이스 내의 자료를 색인하는 자료구조이다. 멀티미디어 자료 검색에서 비슷한 정도는 객체간의 거리를 바탕으로 비교하고, vp tree 색인 구조는 이 과정을 내포하고 있기 때문에 최근 멀티미디어 검색 연구에서 많이 사용되고 있다. 검색 방법에는 query와 가장 가까운 대상을 찾는 Nearest Neighbor Search, 또는 query와 가까운 k등까지를 검색하는 k-Nearest Neighbor Search가 있다. 본 논문에서는 Content-based retrieval에서 최근 자주 사용되는 vp tree에서 효과적인 k-NNS 방법을 제안하고, 기존의 전형적인 k-NNS 방법과의 비교 실험 결과를 보인다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 1998.10a
• /
• pp.174-178
• /
• 1998

FASN GX는 광대역 서비스를 제공하기에 적합한 ATM-PON 시스템을 경제적인 구축의 방법으로 설정하였다. 현재, 다수의 통신 사업자들은 가입자망 구조로서 ATM-PON 시스템 구조를 채택하고 있는 실정이다. ATM-PON 시스템의 상향에서는 멀티플렉싱이 발생한다. 그러므로 멀티플렉싱의 효과적인 자원을 위해서 매체접근제어 프로토콜이 구비되어야 한다. 실제로, 충돌 해결을 위한 알고리즘으로서 tree 알고리즘을 제안하는 많은 MAC 프로토콜 제안서가 있다.[1,2,3,4] 이 tree 알고리즘은 안정되고, 예측 가능하고, 실행 가능한 주요 장점을 제공한다. 그러나 이 알고리즘은 시간에 민감한 높은 우선순위의 트래픽이 들어올 경우에는 성능이 좋지 못하다. 이 논문에서는 ATM 환경의 멀티레벨 서비스를 지원하는데 유용한 새로운 DQT(Double Queue Tree based)알고리즘을 제안한다. 그리고 알고리즘의 처리시간과 지연시간을 IEEE802.14에서 제안된 Tree 알고리즘과 비교하여 시뮬레이션 결과를 제시한다.

• Korean Journal of Oriental Medicine
• /
• v.14 no.3
• /
• pp.81-87
• /
• 2008

Sasanag Contitution Medicine(SCM) is the traditional medicine theory based on constitutional medicine in Korea. It is most import ant that a personal SCM type is determined accurately ahead of applying any Sasang treatments. For this, many researches have been studied to diagnose the SCM type using constitutional clinical data. The decision tree is a tree-structured data-mining methodology. Recently, in the Korean traditional medicine society, there have been several efforts to find diagnosing tools using the decision tree method. So, we developed a decision tree program based on web for analyzing constitutional clinical information. It can use various clinical data as input data, offer filtering function to select clinical data to be used. We can find useful factor to be influential on SCM types using this program.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.2
• /
• pp.57-68
• /
• 2004

We present a new parallel algorithm for extending the domain of a UOWHF. Our algorithm is based on non-complete l-ary tree and has the same optimal key length expansion as Shoup's which has the most efficient key length expansion known so far. Using the recent result [8], we can also prove that the key length expansion of this algorithm and Shoup's sequential algorithm are the minimum possible for any algorithms in a large class of "natural" domain extending algorithms. But its prallelizability performance is less efficient than complete tree based constructions. However if l is getting larger then the parallelizability of the construction is also getting near to that of complete tree based constructions.tructions.

• Journal of the Korean Society of Safety
• /
• v.32 no.3
• /
• pp.160-171
• /
• 2017

US national research laboratories developed the first Vital Area Identification (VAI) method for the physical protection of nuclear power plants that is based on Event Tree Analysis (ETA) and Fault Tree Analysis (FTA) techniques in 1970s. Then, Korea Atomic Energy Research Institute proposed advanced VAI method that takes advantage of fire and flooding Probabilistic Safety Assessment (PSA) results. In this study, in order to minimize the burden and difficulty of VAI, (1) a set of streamlined VAI rules were developed, and (2) this set of rules was applied to PSA fault tree and event tree at the initial stage of VAI process. This new rule-based VAI method is explained, and its efficiency and correctness are demonstrated throughout this paper. This new rule-based VAI method drastically reduces problem size by (1) performing PSA event tree simplification by applying VAI rules to the PSA event tree, (2) calculating preliminary prevention sets with event tree headings, (3) converting the shortest preliminary prevention set into a sabotage fault tree, and (4) performing usual VAI procedure. Since this new rule-based VAI method drastically reduces VAI problem size, it provides very quick and economical VAI procedure. In spite of an extremely reduced sabotage fault tree, this method generates identical vital areas to those by traditional VAI method. It is strongly recommended that this new rule-based VAI method be applied to the physical protection of nuclear power plants and other complex safety-critical systems such as chemical and military systems.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.2
• /
• pp.43-55
• /
• 2010

${\mu}TESLA$ broadcast authentication protocol have been developed by many researchers for providing authenticated broadcasting message between receiver and sender in sensor networks. Those cause authentication delay Tree-based ${\mu}TESLA$[3] solves the problem of authentication delay. But, it has new problems from Merkel hash tree certificate structure. Such as an increase in quantity of data transmission and computation according to the number of sender or parameter of ${\mu}TESLA$ chain. ${\mu}TPCT$-based ${\mu}TESLA$[4] has an advantages, such as a fixed computation cost by altered Low-level Merkel has tree to hash chain. However, it only use the sequential values of Hash chain to authenticate ${\mu}TESLA$ parameters. So, It can't ensure the success of authentication in lossy sensor network. This paper is to propose the improved method for Tree-based ${\mu}TESLA$ by using XOR-based chain. The proposed scheme provide advantages such as a fixed computation cost with ${\mu}$TPCT-based ${\mu}TESLA$ and a message loss-tolerant with Tree-based ${\mu}TESLA$.

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

• The Journal of the Korea Contents Association
• /
• v.5 no.2
• /
• pp.187-197
• /
• 2005

In this paper, we propose an extended TB-tree, called ETB-tree, which can improve the performance of an existing TB-tree proposed for indexing the trajectories of moving objects in Location-Based Service(LBS). The proposed ETB-tree directly accesses the preceding node by maintaining a direct table, called D-Table which contains the page number in disk and memory pointers pointing the leaf node with the first and last lines segment of moving objects. It can improve the insertion performance by quick searching the preceding node of a moving object and retrieval performance owing to accessing directly the corresponding trajectories In disk for the trajectory-based query. In addition, the ETB-tree provides consistency of a tree by reflecting a newly inserted line segment to the tree both in memory and disk. The experimental results show that the proposed indexing technique gains better performance than other traditional ones with respect to the insertion and retrieval of a trajectory query.

• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.95-104
• /
• 2022

A TPR-tree is a well-known indexing structure that is developed to answer queries about the current or future time locations of moving objects. For the purpose of space efficiency, the TPR-tree employs the notion of VBR (velocity bounding rectangle)so that a regionalrectangle presents varying positions of a group of moving objects. Since the rectangle computed from a VBR always encloses the possible maximum range of an indexed object group, a search process only has to follow VBR-based rectangles overlapped with a given query range, while searching toward candidate leaf nodes. Although the TPR-tree index shows up its space efficiency, it easily suffers from the problem of dead space that results from fast and constant expansions of VBR-based rectangles. Against this, the TPR-tree index is enforced to update leaf nodes for reducing dead spaces within them. Such an update-prone feature of the TPR-tree becomes more problematic when the tree is saved in flash storage. This is because flash storage has very expensive update costs. To solve this problem, we propose a new Bloom filter based caching scheme that is useful for reducing updates in a flash TPR-tree. Since the proposed scheme can efficiently control the frequency of updates on a leaf node, it can offer good performance for indexing moving objects in modern flash storage.