• Journal of the Korea Computer Graphics Society
• /
• v.4 no.2
• /
• pp.33-45
• /
• 1998

볼륨 가시화(volume visualization)는 3차원 볼륨 데이터로부터 의미 있는 가시적 정보를 추출하도록 도와주는 연구분야이다. 볼륨 렌더링(volume rendering)은 볼륨 데이터로부터 영상(image)을 얻는 기술을 말하는데, 이러한 렌더링 기법 중 물체공간(object space)에 기반한 스플래팅(splatting) 기법은 볼륨 데이터에 존재하는 응집성(coherence)의 이점을 이용할 수 있는 팔진트리(octree)나 피라미드(pyramid)와 같은 계층구조를 적용하기 쉽다. 본 논문에서는 볼륨 데이터에 팔진트리를 적용한 기존의 스플래팅 기법에 영상공간(image space)에서의 응집성의 이점을 이용하기 위한 계층구조로 4진트리(quadtree)와 범위트리(range tree)를 적용하는 새로운 스플래팅 기법을 제안한다. 이 기법은 볼륨 데이터내의 불투명한 복셀(voxel)들에 의해 가려지는 복셀들에 대한 방문을 가능한 한 피함으로써 전체적인 스플래팅의 속도를 향상시킨다. 이 기법은 잘 알려진 팔진트리, 4진트리 그리고 범위트리를 사용함으로써 그 구현이 쉽고, 추가적으로 많은 메모리를 사용하지 않으면서도 렌더링의 속도를 효율적으로 향상시킬 수 있는 기법이다.

• Genomics & Informatics
• /
• v.11 no.4
• /
• pp.282-288
• /
• 2013

The molecular vibration-activity relationship in the receptor-ligand interaction of adenosine receptors was investigated by structure similarity, molecular vibration, and hierarchical clustering in a dataset of 46 ligands of adenosine receptors. The resulting dendrogram was compared with those of another kind of fingerprint or descriptor. The dendrogram result produced by corralled intensity of molecular vibrational frequency outperformed four other analyses in the current study of adenosine receptor agonism and antagonism. The tree that was produced by clustering analysis of molecular vibration patterns showed its potential for the functional classification of adenosine receptor ligands.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.65-78
• /
• 2009

The most commonly adopted approach to find valuable information from tree data is to extract frequently occurring subtree patterns from them. Because mining frequent tree patterns has a wide range of applications such as xml mining, web usage mining, bioinformatics, and network multicast routing, many algorithms have been recently proposed to find the patterns. However, existing tree mining algorithms suffer from several serious pitfalls in finding frequent tree patterns from massive tree datasets. Some of the major problems are due to (1) modeling data as hierarchical tree structure, (2) the computationally high cost of the candidate maintenance, (3) the repetitious input dataset scans, and (4) the high memory dependency. These problems stem from that most of these algorithms are based on the well-known apriori algorithm and have used anti-monotone property for candidate generation and frequency counting in their algorithms. To solve the problems, we base a pattern-growth approach rather than the apriori approach, and choose to extract maximal frequent subtree patterns instead of frequent subtree patterns. The proposed method not only gets rid of the process for infrequent subtrees pruning, but also totally eliminates the problem of generating candidate subtrees. Hence, it significantly improves the whole mining process.

• Korean Institute of Interior Design Journal
• /
• v.20 no.3
• /
• pp.249-258
• /
• 2011

As the elderly population are rapidly growing, the elderly who needs special care and nursing homes for them are also growing. However, many nursing homes were planned without considering the hierarchial space organization such as division of housing unit and nursing unit based on the cognitive and behavioral characteristics of the elderly or accessibility and supportiveness of the staff. This study was to examine the hierarchial characteristics in space organization of nursing homes by using Space Syntax. The subjects were 8 nursing homes in Busan. First, spaces in nursing homes were divided into five areas based on the literature review. Then the hierarchy of space organization for the access layer and layers of living floors was grasped by using G-graph. The access layer has a tree-type hierarchical structure and high visuality. Also, average depth of the space was 5. Then the full integration was analyzed. Mobile area, such as elevator, hallways, or living rooms has a high accessibility and the middle corridor type has commonly been characterized. The nursing stations were analyzed through the control degree and it was low in three nursing homes such as B, C, and G. The low clarity was showed in B, D, and F. The low clarity means that it is relatively difficult to recognize the whole space organization of nursing home. Even though the hierarchy of their living floors was tree-type structure with a high visuality, they has a type of grouping spaces around hallways and spreading, or a ring type.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.9 s.339
• /
• pp.29-40
• /
• 2005

In this paper, we propose a Cluster-based Multicast Routing (CMR) suitable for mobile ad-hoc networks. The main features that our proposed method introduces are the following: a) mobility-based clustering and group based hierarchical structure in order to effectively support stability and scalability, b) group based mesh structure and forwarding tree concepts in order to support the robustness of the mesh topologies which provides limited redundancy and the efficiency of tree forwarding simultaneously, and c) combination of proactive and reactive concepts which provide low route acquisition delay and low overhead. The performance evaluation of the proposed protocol is achieved via modeling and simulation. The corresponding results demonstrate the Proposed multicast protocol's efficiency in terms of packet delivery ratio, scalability, control overhead, end-to-end delay, as a function of mobility, multicast group size, and number of senders.

• Journal of the Korean Society for information Management
• /
• v.24 no.2
• /
• pp.71-87
• /
• 2007

With the rapid change of the Web and E-transaction application, the search interface is providing more powerful search and visualization methods, while offering smoother integration of technology with task. Especially, visualization techniques for long menu-lists are applied in retrieval system with the goal of improving performance in user's ability to select one item from a long list. In order to review visualization techniques appropriate to the types of users and data set, this study compared the five visualization browsers such as the Tree-structured menu, the Table-of-contents menu, the Roll-over menu, the Click menu, and Fisheye menu. The result of general analyses shows that among the hierarchical methods, the experienced group prefers the Table-of-contents method menu, whereas the novice's group prefers the Tree-structure method menu. Among the linear methods, the two groups prefer the Roll-over menu. The Roll-over menu is most preferred among the five browsers by the two groups.

• The Journal of the Korea Contents Association
• /
• v.7 no.1
• /
• pp.21-31
• /
• 2007

The intellectual property system was very important to the past industrial society. It is so important to the 21C information age. It is a leading role to developing these information society. Not only the digital content control but the technology of software source code for the intellectual property is so much mean to international competition. On occurring disputation property, we have to prove the fact, there is a problem to discriminate the original source code. In this paper, we make a study of the digital licence prototype for discriminate the original source code. Reserved words of software source code by parsing express to XML file that have hierarchical structure. Then, we can express architecture of software source code by tree structure form instead of complex source code. And we make a study of the indexing and searching to search digital license.

• The Journal of the Korea Contents Association
• /
• v.8 no.1
• /
• pp.246-258
• /
• 2008

The software industry is so important to the 21C information society Not only the digital content control but the technology of software source code for the intellectual property is so much mean to international competition. On occurring disputation property of software source code, we have to prove the fact, there is a problem to discriminate the original software source code. In this paper, we make a study of the digital licence prototype for discriminate the original source code. Reserved words of software source code by parsing express to XML file that have hierarchical structure. Then, we can express node pattern and architecture pattern of software source code by tree structure form instead of complex software source code. And we make a simulation of discrimination possibility of digital license and propose CRYPTEX model.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1198-1206
• /
• 1996

This paper proposes the functionality of communication network management which operates in central control station of satellite communication network, which will be constructed to DAMA-SCPC ground station using KORE ASAT. And communication network configuration components are classified with hierarchical structure in order to efficiently maintain communication network operation management, and configuration components that are classified into graphic objects and this graphic objects are visualized with tree structure which can be handled uniformally and efficiently. In addition to that, this paper proposes expression method of graphic object to implement our real time communication network management system, and the real time communication net-work management composed as client-server system. The performance of the proposed algorithm is analyzed through the computer simulation.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.2
• /
• pp.16-27
• /
• 2011

Embryo is a very early stage of the development of multicellular organism such as animals and plants. It is an important research target for studying ontogeny because the fundamental body system of multicellular organism is determined during an embryo state. Researchers in the developmental biology have a large volume of embryo image databases for studying embryos and they frequently search for an embryo image efficiently from those databases. Thus, it is crucial to organize databases for their efficient search. Hierarchical clustering methods have been widely used for database organization. However, most of previous algorithms tend to produce a highly skewed tree as a result of clustering because they do not simultaneously consider both the size of a cluster and the number of objects within the cluster. The skewed tree requires much time to be traversed in users' search process. In this paper, we propose a method that effectively organizes a large volume of embryo image data in a balanced tree structure. We first represent embryo image data as a similarity-based graph. Next, we identify clusters by performing a graph partitioning algorithm repeatedly. We check constantly the size of a cluster and the number of objects, and partition clusters whose size is too large or whose number of objects is too high, which prevents clusters from growing too large or having too many objects. We show the superiority of the proposed method by extensive experiments. Moreover, we implement the visualization tool to help users quickly and easily navigate the embryo image database.