• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.2
• /
• pp.178-194
• /
• 2009

Current group key agreement protocols(often tree-based) involve unnecessary delays because members with low-performance computer systems can join group key computation. These delays are caused by the computations needed to balance a key tree after membership changes. An alternate approach to group key generation that reduces delays is the dynamic prioritizing mechanism of filtering low performance members in group key generation. This paper presents an efficient tree-based group key agreement protocol and the results of its performance evaluation. The proposed approach to filtering of low performance members in group key generation is scalable and it requires less computational overhead than conventional tree-based protocols.

• The Korea Genome Conference
• /
• 2003.09a
• /
• pp.38.2-38.2
• /
• 2003

• 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.12 no.7
• /
• pp.3284-3306
• /
• 2018

This study proposes a method to develop an authoring system(GeoMaTree) for diverse trees that constitute a virtual landscape. The GeoMaTree system enables the simple, intuitive production of an efficient structure, and supports real-time processing. The core of the proposed system is a procedural modeling based on a mathematical model and an application that supports digital content creation on diverse platforms. The procedural modeling allows users to control the complex pattern of branch propagation through an intuitive process. The application is a multi-resolution 3D model that supports appropriate optimization for a tree structure. The application and a compatible function, with commercial tools for supporting the creation of realistic synthetic images and virtual landscapes, are implemented, and the proposed system is applied to a variety of 3D image content.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2004.03a
• /
• pp.11-16
• /
• 2004

최근 PDA와 같은 모바일 장치와 무선 인터넷의 사용이 확대되고, GPS의 개발로 인하여 위치 기반 서비스가 활발히 연구되고 있다. 그러나, 위치 기반 서비스의 중요한 요소인 이동 객체는 이동에 따른 갱신 비용이 높기 때문에 이전의 디스크 기반의 GIS에서 사용되던 인덱스를 이용하는 것은 효과적 이 지 못하다. 본 논문에서는 위치 기반 서비스를 위한 효과적인 현재 위치 데이타 처리를 위해 공간 해쉬 인덱스와 R-tree 인덱스를 결합한 형태인 HB(Hash Based)R-tree 인덱스를 개발하였다. HBR-tree 인덱스는 위치 기반 서비스에서 이동 객체의 위치 데이타가 빈번하게 갱신된다는 특징을 이용하여 갱신 작업은 HBR-tree 인덱스의 공간 해쉬 테이블 내에서 처리하고, 생성된 공간 해쉬 테이블을 이용하여 R-tree 인덱스를 구성함으로써 빠른 검색 질의 처리가 가능하고 갱신 비용을 줄일 수 있다는 장점이 있다.

• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.3
• /
• pp.8-16
• /
• 2022

In this paper, we propose a method of reconstructing the file system to obtain digital forensics information from the APFS file system when meta information that can know the structure of the file system is deleted due to partial damage to the disk. This method is to reconstruct the tree structure of the file system by only retrieving the B-tree node where file/directory information is stored. This method is not a method of constructing nodes based on structural information such as Container Superblock (NXSB) and Volume Checkpoint Superblock (APSB), and B-tree root and leaf node information. The entire disk cluster is traversed to find scattered B-tree leaf nodes and to gather all the information in the file system to build information. It is a method of reconstructing a tree structure of a file/directory based on refined essential data by removing duplicate data. We demonstrate that the proposed method is valid through the results of applying the proposed method by generating numbers of user files and directories.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.878-881
• /
• 2008

To index the object's trajectory is an important aspect in moving object database management. This paper implements an optimizing index structure named Rend 3D R-tree based on 3D R-Tree. This paper demonstrates the time period update method to reconstruct the MBR for the moving objects in order to decrease the dead space that is produced in the closed time dimension of the 3D R-tree, then a rend method is introduced for indexing both current data and history data. The result of experiments illustrates that given methods outperforms 3D R-Tree and LUR tree in query processes.

• Physical Therapy Korea
• /
• v.27 no.2
• /
• pp.140-148
• /
• 2020

Background: Scapular winging (SW) could be caused by tightness or weakness of the periscapular muscles. Although data mining techniques are useful in classifying or predicting risk of musculoskeletal disorder, predictive models for risk of musculoskeletal disorder using the results of clinical test or quantitative data are scarce. Objects: This study aimed to (1) investigate the difference between young women with and without SW, (2) establish a predictive model for presence of SW, and (3) determine the cutoff value of each variable for predicting the risk of SW using the decision tree method. Methods: Fifty young female subjects participated in this study. To classify the presence of SW as the outcome variable, scapular protractor strength, elbow flexor strength, shoulder internal rotation, and whether the scapula is in the dominant or nondominant side were determined. Results: The classification tree selected scapular protractor strength, shoulder internal rotation range of motion, and whether the scapula is in the dominant or nondominant side as predictor variables. The classification tree model correctly classified 78.79% (p = 0.02) of the training data set. The accuracy obtained by the classification tree on the test data set was 82.35% (p = 0.04). Conclusion: The classification tree showed acceptable accuracy (82.35%) and high specificity (95.65%) but low sensitivity (54.55%). Based on the predictive model in this study, we suggested that 20% of body weight in scapular protractor strength is a meaningful cutoff value for presence of SW.

• Journal of Fashion Business
• /
• v.5 no.3
• /
• pp.63-71
• /
• 2001

The symbol of the sacred tree represents the world tree. They were influenced by Tree worship in Northern mounted nomadic groups, and the first is quite obvious, that the sacred tree is a palm tree. The Assyrian sacred tree possesses characteristics, making the tree iconographic and rather artificial. The tree typically has a thin trunk arranged in two or three tiers. Each tier is separated by horizontal plates or bands. The top of the tree is crowned with a palmette form. Wavy streamers emanate from the tree abd terminate in palmettes in a criss cross fashion. The central trunk is topped with a palmette and surrounded the trunk with palmettes emphasizing a link to date trees. The number of branches on the tree is limited, and there are usually seven, fifteen or thirty branches. The connection of these numbers with those of the week, and of the lunar wax and wane is so obvious. The branches on the tree may have indeed represented a calender of some sort. Mainly based on the excavated tomb articles of the three kingdoms and referred to Chinese and Japanese ones, Sacred Tree pattern showed that was lightly influenced by the times and area, but was slowly changed and developed to different types through those each ages generally. The Sacred Tree type was three part in according to the wavy streamers emanate from the tree abd, Sacred tree type I, Sacred tree type II, Sacred tree type III[the Mountain(; 山)-typed piled up Sacred Tree].

• The KIPS Transactions:PartB
• /
• v.14B no.4
• /
• pp.263-272
• /
• 2007

This paper proposes a skeleton-based hierarchical shape description scheme, called a skeleton tree, for accurate shape-based image retrieval. A skeleton tree represents an object shape as a hierarchical tree where high-level nodes describe parts of coarse trunk regions and low-level nodes describe fine details of boundary regions. Each node refines the shape of its parent node. Most of the noise disturbances are limited to bottom level nodes and the boundary noise is reduced by decreasing weights on the bottom levels. The similarity of two skeleton trees is computed by considering the best match of a skeleton tree to a sub-tree of another skeleton tree. The proposed method uses a hybrid similarity measure by employing both Fourier descriptors and moment invariants in computing the similarity of two skeleton trees. Several experimental results are presented demonstrating the validity of the skeleton tree scheme for the shape description and indexing.