• Journal of KIISE:Databases
• /
• v.33 no.5
• /
• pp.463-475
• /
• 2006

In applications such as a traffic management system, analysis using a spatial hierarchy of a spatial data warehouse and a simple aggregation is required. Over the past few years, several studies have been made on solution using a spatial index. Many studies have focused on using extended R-tree. But, because it just provides either the current aggregation or the total aggregation, decision support of traffic policy required historical analysis can not be provided. This paper proposes hybrid index based on extended aR-tree for the spatio-temporal aggregation. The proposed method supports a spatial hierarchy and the current aggregation by the R-tree. The sorted hash table using the time structure of the extended aR-tree provides a temporal hierarchy and a historical aggregation. Therefore, the proposed method supports an efficient decision support with spatio-temporal analysis and is Possible currently traffic analysis and determination of a traffic policy with historical analysis.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.17 no.2
• /
• pp.117-128
• /
• 1999

A Simple tree-structured line simplification method, which exactly follows the Douglas-Peucker algorithm, has a strength for its simplification index to be involved into the hierarchical data structures. However, the hierarchy of simplification index, which is the core in a simple tree method, may not be always guaranteed. It is validated that the local property of line features in such global approaches as Douglas-Peucker algorithm is apt to be neglected and the construction of hierarchy with no thought of locality may entangle the hierarchy. This study designed a new approach, CALS(Convex hull Applied Line Simplification), a) to search critical points of line feature with convex hull search technique, b) to construct the hierarchical data structure based on these critical points, c) to simplify the line feature using multiple trees. CALS improved the spatial accuracy as compared with a simple tree method. Especially CALS was excellent in case of line features having the great extent of sinuosity.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.4
• /
• pp.7-14
• /
• 2003

A number of embedded wavelet image coding methods have been proposed since the introduction of EZW(Embedded Zerotree Wavelet) algorithm. A common characteristic of these methods is that they use fundamental ideas found in the EZW algorithm. Especially, one of these methods is the SPIHT(Set Partitioning in Hierarchy Trees) algorithm, which became very popular since it was able to achieve equal or better performance than EZW without having to use an arithmetic encoder. In this paper We propose a recursive set partitioning in hierarchy trees(RSPIHT) algorithm for embedded image coding and evaluate it's effectiveness experimentally. The proposed RSPIHT algorithm takes the simple and regular form and the worst case time complexity of O(n). From the viewpoint of processing time, the RSPIHT algorithm takes about 16.4% improvement in average than the SPIHT algorithm at T-layer over 4 of experimental images. Also from the viewpoint of coding rate, the RSPIHT algorithm takes similar results at T-layer under 7 but the improved results at other T-layer of experimental images.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.6
• /
• pp.58-65
• /
• 1993

In this research, we developed a new algorithm for hierarchical placement of integrated circuits. For efficient placement of a large circuit, the given circuit is recursively partitioned to form a hierarchy tree and then simulated-annealing-based placement method is applied at each level of the hierarchy to find a near optimum solution. During the placemtnt, global optimization is performed at high levels of the hierarchy and local optimization is performed at low levels. When compared with conventional placement methods, the new hierarchical placement method produced favorable results.

• Journal of KIISE:Software and Applications
• /
• v.37 no.7
• /
• pp.548-557
• /
• 2010

In this paper, we propose a semi-automatic modeling approach of ontology to annotate VOD to realize the IPTV's intelligent searching. The ontology is made by combining partial tree that extracts hypernym, hyponym, and synonym of keywords related to a service domain from WordNet. Further, we add to the partial tree new keywords that are undefined in WordNet, such as foreign words and words written in Chinese characters. The ontology consists of two parts: generic hierarchy and specific hierarchy. The former is the semantic model of vocabularies such as keywords and contents of keywords. They are defined as classes including property restrictions in the ontology. The latter is generated using the reasoning technique by inferring contents of keywords based on the generic hierarchy. An annotation generates metadata (i.e., contents and genre) of VOD based on the specific hierarchy. The generic hierarchy can be applied to other domains, and the specific hierarchy helps modeling the ontology to fit the service domain. This approach is proved as good to generate metadata independent of any specific domain. As a result, the proposed method produced around 82% precision with 2,400 VOD annotation test data.

• Journal of Korea Multimedia Society
• /
• v.9 no.3
• /
• pp.265-278
• /
• 2006

This paper presents a two-dimensional type inheritance hierarchy index(2D-THI) for XML databases. XML Schema is one of schema models for the XML documents supporting. The type inheritance. The conventional indexing techniques for XML databases can not support XML queries on type inheritance hierarchies. We construct a two-dimensional index structure using multidimensional file organizations for supporting type inheritance hierarchy in XML queries. This indexing technique deals with the problem of clustering index entries in the two-dimensional domain space that consists of a key element domain and a type identifier domain based on the user query pattern. This index enhances query performance by adjusting the degree of clustering between the two domains. For performance evaluation, we have compared our proposed 2D-THI with the conventional class hierarchy indexing techniques in object-oriented databases such as CH-index and CG-tree through the cost model. As the result of the performance evaluations, we have verified that our proposed two-dimensional type inheritance indexing technique can efficiently support the query Processing in XML databases according to the query types.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.5
• /
• pp.400-405
• /
• 2013

The purpose of this study is to develop a composite platform for knowledge extractions, visualizations, and inference. Generally, the big data sets were frequently used in the healthcare and medical area. To help the knowledge managers/users working in the field, this study is focused on knowledge management (KM) based on Data Mining (DM), Knowledge Distribution Map (KDM), Decision Tree (DT), RDBMS, and SQL-inference. The proposed mechanism is composed of five key processes. Firstly, in Knowledge Parsing, it extracts logical rules from a big data set by using DM technology. Then it transforms the rules into RDB tables. Secondly, through Knowledge Maintenance, it refines and manages the knowledge to be ready for the computing of knowledge distributions. Thirdly, in Knowledge Distribution process, we can see the knowledge distributions by using the DT mechanism.Fourthly, in Knowledge Hierarchy, the platform shows the hierarchy of the knowledge. Finally, in Inference, it deduce the conclusions by using the given facts and data.This approach presents the advantages of diversity in knowledge representations and inference to improve the quality of computer-based medical diagnosis.

• Journal of Environmental Science International
• /
• v.12 no.9
• /
• pp.897-903
• /
• 2003

This study focuses on importance level analysis of environmentally-friendly planning factors using Analytic Hierarchy Process(AMP). This study verify different planning principle makes comparison matrix by a relative comparison value, verified consistency after yield weight to analyze more objective importance for apartment complex estate environmentally-friendly planning factor. In order to decide importance of apartment complex estate environmentally-friendly planning factors multiplying weight of verified planning principle with weight of planning factors. The results are as follows; First, importance of preservation of green tract of lands, Preparation of Biotop, Tree planting of sites, Propriety of development density high except Circulation and practical use of water. Next, valued planning factors constituent appeared to Energy efficient building plan, Rubbish recycling, thermal utilization of solar energy, Artificial tree planting of buildings etc. importantly. Finally, plan constituent that importance is underrated most appeared by Practical use of building materials and equipment, Centralization of energy and resources, Preservation of corridor etc.

• Journal of the Korean Institute of Traditional Landscape Architecture
• /
• v.34 no.4
• /
• pp.51-56
• /
• 2016

Old-growth and giant tree is a nonrenewable resource with great value. The purpose of this study is to provide scientific and reasonable evaluations for the preservation and management of the old-growth and giant tree. Until now the research of old-growth and giant tree's value evaluation and authoritative index is so insufficient and imperfection. Combining with the particularity of the old-growth and giant tree, this study analyzed the main value factors of the old-growth and giant tree and objectively selected the evaluation indicators. According to the actual situation value appraisal model of the old-growth and giant tree was builded. The main value factors can be divided into economic value, cultural history, growing place, tree state, tree form, tree vigor, protection level, growth environment, tree species, tree canopy, and so on. The evaluate indicators can be selected and the indicators' weight can be calculate using analytic hierarchy process methods(AHP). Based on economic value and indicators' weight, tree's total value can be revealed. After calculation and analysis, Gyeongju Gyerim Zelkova serrata's value evaluation results is 491,503,300 won. The research results of this study can provide scientific basis and reference to the old-growth and giant trees' value appraisal and loss compensation, and arouse people's environmental awareness.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2298-2309
• /
• 2000

This paper proposes the multidimensioa! nested attribute indexing techniques (MD- NAI) in object-oriented databases using a multidimensional index structure. Since most conventional indexing techniques for object oriented databases use a one-dimensional index stnlcture such as the B-tree, they do not often handle complex qUlTies involving both nested attributes and class hierarchies. We extend a tunable two dimensional class hierachy indexing technique(2D-CHI) for nested attributes. The 2D-CHI is an indexing scheme that deals with the problem of clustering ohjects in a two dimensional domain space that consists of a kev attribute dOI11'lin and a class idmtifier domain for a simple attribute in a class hierachy. In our extended scheme, we construct indexes using multidimensional file organizations that include one class identifier domain per class hierarchy on a path expression that defines the indexed nested attribute. This scheme efficiently suppoI1s queries that involve search conditions on the nested attribute represcnted by an extcnded path expression. An extended path expression is a one in which a class hierarchy can be substituted by an indivisual class or a subclass hierarchy in the class hierarchy.