• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1458-1467
• /
• 1999

Existing index structures such as extendable hashing and B+-tree do not support partial string searches perfectly. The inverted file method and the signature file method that are used in the web retrieval engine also have problems that they do not provide partial string searches and suffer from serious retrieval performance degradation respectively. In this paper, we propose an efficient index method that supports partial string searches and achieves good retrieval performance. The proposed index method is based on the Inverted file structure. It constructs the index file with patterns that result from dividing terms by two syllables to support partial string searches. We analyze the characteristics of our proposed method through simulation experiments using wide range of parameter values. We analyze the derive analytic performance evaluation models of the existing inverted file method, signature file method and the proposed index method in terms of retrieval time and storage overhead. We show through performance comparison based on analytic models that the proposed method significantly improves retrieval performance over the existing method.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.710-720
• /
• 2004

As XML documents have much richer information than plain texts, we can perform very elaborated, fine-grained search which was difficult in past years. However, as the cost of finer grained element level search is very high, the processing overhead has become a new challenge. We propose an inverted index structure called PIX, which reduces the number of elements processed by partitioning elements according to their match potentiality. We choose a base level and partition elements according to whether they have possibility of having a common ancestor higher than the level. We also propose partition merging technique by which we can get same results as unpartitioned case. Our experimental results show that the index partitioning strategy can reduce processing time considerably.

• The KIPS Transactions:PartD
• /
• v.17D no.2
• /
• pp.103-110
• /
• 2010

Recently, many XML document management systems using the advantage of RDBMS have been actively developed for the storage, processing and retrieval of XML documents. However, fractional pattern-matching query such as the LIKE operations cannot take the advantage of the index of RDBMS because these operations have deteriorated retrieval performance through its inefficient comparison processing. The hierarchical XML storage technique which stores XML documents in RDBMS efficiently, and the path inverted index technique are proposed in this paper. It regards the element of an XML document as a keyword, and focuses on organizing a posting file with path identifiers and sequences to reduce the retrieval time of path based query. Through simulations, our methods have shown about 60% better performance than the conventional method using RDBMS in searching.

• Journal of KIISE:Databases
• /
• v.30 no.4
• /
• pp.420-428
• /
• 2003

XML is a data-oriented language to represent all types of documents including web documents. By means of the advent of XML-based document generation tools and grow of proprietary XML documents using those tools and translation from legacy data to XML documents at an accelerating pace, we have been gotten a large amount of differently-structured XML documents. Therefore, it is more and more important to retrieve the right documents from the document set. But, previous works on XML have mainly focused on the storage and retrieval methods for a large XML document or XML documents had a same DTD. And, researches that supported the structural difference did not efficiently process path queries on the document set. To resolve the problem, we suggested a new inverted index mechanism using RDBMS and proved it outperformed the previous works. And especially, as it showed the higher efficiency in indirect containment relationship, we argues that the index structure is fit for the differently-structured XML document set.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.12
• /
• pp.1210-1216
• /
• 2004

This paper deals with a human-like gait generation of a biped robot with a balancing weight of an inverted pendulum type by using genetic algorithm. The ZMP (Zero Moment Point) is the most important index in a biped robot's dynamic walking stability. To perform a stable walking of a biped robot, a balancing motion is required according to legs' trajectories and a desired ZMP trajectory. A dynamic equation of the balancing motion is nonlinear due to an inverted pendulum type's balancing weight. To solve the nonlinear equation by the FDM (Finite Difference Method), a linearized model of equation is proposed. And GA (Genetic Algorithm) is applied to optimize a human-like balancing motion of a biped robot. By genetic algorithm, the index of the balancing motion is efficiently optimized, and a dynamic walking stability is verified by the ZMP verification equation. These balancing motion are simulated and experimented with a real biped robot IWR-IV. This human-like gait generation will be applied to a humanoid robot, at future work.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.107.4-107
• /
• 2001

In this paper, the guaranteed stability margins of LQ optimal regulators for a performance index with cross-product terms are suggested in the discrete-time case. An example for the LQ optimal regulator of an inverted pendulum system is given to demonstrate the validity of the suggested stability margins.

• The KIPS Transactions:PartD
• /
• v.11D no.3
• /
• pp.509-518
• /
• 2004

Recently there has been some efforts to add XML full-text retrievals and XML updates into new standardization of XML queries. XML full-text retrievals plays an important role in XML query languages. of like tables in relational model an XML document has complex and unstructured natures. We believe that when we try to get some information from unstructured XML documents a full-text retrieval query is much more convenient approach than a regular structured query XML update is another core function that an XML query have to have. In this paper we propose an inverted index to support XML updates and XML full-text queries in relational environment. Performance comparisons exhibit that our approach maintains a comparable size of inverted indexes and it supports many full-text retrieval functions very well. It also shows very stable retrieval performance especially for large size of XML documents. Foremost our approach handles XML updates efficiently by removing cascading effects.

• Journal of the Korean Society for information Management
• /
• v.28 no.2
• /
• pp.177-193
• /
• 2011

This study constructed an ontology targeting journal articles and evaluated its performance. Also, the performance of a triple structure ontology was compared with the knowledge base of an inverted index file designed for a simple keyword search engine. The coverage was three years of articles published in the Journal of the Korean Society for Information Management from 2007 to 2009. Protege was used to construct an ontology, whilst utilizing an inverted index file to compare performance. The concept ontology was manually established, and the bibliography ontology was automatically constructed to produce an OWL concept ontology and an OWL bibliography ontology, respectively. This study compared the performance of the knowledge base of the ontology, using the Jena search engine with the performance of an inverted index file using the Lucene search engine. As a result, The Lucene showed higher precision rate, but Jena showed higher recall rate.

• Journal of KIISE
• /
• v.45 no.3
• /
• pp.294-302
• /
• 2018

With the emergence of the new service industry due to the development of information and communication technology, cyber space risks such as personal information infringement and industrial confidentiality leakage have diversified, and the security problem has emerged as a critical issue. In this paper, we propose a behavior-based anomaly detection method that is suitable for real-time and large-volume data analysis technology. We show that the proposed detection method is superior to existing signature security countermeasures that are based on large-capacity user log data according to in-company personal information abuse and internal information leakage. As the proposed behavior-based anomaly detection method requires a technique for processing large amounts of data, a real-time search engine is used, called Elasticsearch, which is based on an inverted index. In addition, statistical based frequency analysis and preprocessing were performed for data analysis, and the DBSCAN algorithm, which is a density based clustering method, was applied to classify abnormal data with an example for easy analysis through visualization. Unlike the existing anomaly detection system, the proposed behavior-based anomaly detection technique is promising as it enables anomaly detection analysis without the need to set the threshold value separately, and was proposed from a statistical perspective.

• Fashion & Textile Research Journal
• /
• v.14 no.2
• /
• pp.269-276
• /
• 2012

The aim of this study is to develop clothing size system according to each size interval for obese girls aged 10~12 by classifying the upper bodies. The criteria for subjects in this study were girls who had over 1.46 of the R$\ddot{o}$hrer Index. A total of 229 schoolgirls who met these criteria were enrolled. Results are as follows; 1st, 5 factors were extracted by factor analysis and 3 clusters were categorized by cluster analysis, cylinder-type, inverted triangle-type and inverted trapezoid-type. And 2nd, as a consequence of size system establishment, the basic body sizes and reference body sizes were different according to types even in commonly-appeared size names at sections of respective types. The research findings above suggest that it is necessary to figure out the obesity types according to height and bust girth sizes representing basic sizes and to design the patterns in consideration of the characteristics of obese body shapes. And it may be used as a basic data to decide the desirable output of production according to respective body types.