• Journal of the Korea Society of Computer and Information
• /
• v.4 no.4
• /
• pp.47-56
• /
• 1999

We design and implement an ORDBMS-based geographic information system for sightseeing information of Chungbuk to verify the performance and applicability of GEUS/XTM ORDBMS. We Acquire the positional coordinates of the boundaries of administrative districts , roads, and railroads, determine the various kinds of information such as the locations of sightseeing sites, lodgings, and so on, design an object-relational schema using OMT, and implement the geographic information system including a database system. Through the examination of selective accessibility on the sightseeing inform ation database by the various queries, we conclude that the ORDBMS is more applicable than other DBMSs in modeling, storing, referring, and managing of non-fixed complex data such as sightseeing information. Therefore, ORDBMSs provide efficient and extensible implementations of databases and information services from various sources for the increasing demand on geographic information service on internet.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.41-51
• /
• 2003

The spatiotemporal database concerns about the time-varying spatial attributes. One of the important research areas is related to the support of various location-based services in motile communication environments. It is known that database systems may be difficult to manage the accurate geometric locations of moving objects due to their continual changes of locations. However, this requirement is necessary in various spatiotemporal applications including mobile communications, traffic control and military command and control (C2) systems. In this paper we propose the $B^{st}$-tree that utilizes the concept of multi-version B-trees. It provides an indexing method (or the historical and future range query Processing on moving object's trajectories. Also we present a dynamic version management algorithm that determines the appropriate version evolution induced by the mobility patterns to keep the query performance. With experiments we .;hi)w that our indexing approach is a viable alternative in this area.

• Annual Conference on Human and Language Technology
• /
• 1989.10a
• /
• pp.50-53
• /
• 1989

한글 문서를 인식하기 위하여 문서 영상에서 문자와 그림을 분리 추출하기 위한 방법에 대하여 논하였다. 분리 추출 방법으로는 실시간으로 입력되는 영상 데이타로부터 문자와 그림 의 경계 위치를 알아내는 방법을 사용하였다. 한글, 영문, 한자, 기호 등의 문자와 그림이 혼합된 A4 크기의 문서 영상을 300 DPI의 해상도로 입력받아 실험하였다. 단 한번의 주사만으로 모든 문자와 그림이 정보 gm름의 순서에 따라 분리 추출되었다. 실험 결과 본 방법은 최소한의 시간과 최소한의 기억 용량으로 완벽한 분리 추출이 가능함을 보였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.109-112
• /
• 2000

이동 단말기 관리, 무인 항공 제어 시스템 둥의 시스템에서는 검색 대상의 정보(위치, 여러 가지 상태등)가 시시각각으로 빠르게 변화하므로 현재의 상태를 정확히 파악하기 위하여 많은 양의 자료 검색, 변경 요청이 빈번히 발생한다. 이와 같은 시스템에서의 상태 정보 검색은 자료의 효용성이 사라지기 전에 이루어져야 하므로 디스크 I/O가 많은 디스크 상주형 데이터베이스로는 한계점을 안고 있다. 또한 빠른 검색을 지원할 수 있는 주기억장치 상주형 데이터베이스로는 다량의 데이터를 저장해야 하는 어려움을 안고 있다. 본 논문에서는 위와 같은 실시간 검색 기능과 대용량 자료 저장의 2가지 요구 사항을 만족시키기 위한 내장형 주기억장치 저장 시스템을 개발하였다.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 1996.10a
• /
• pp.43-49
• /
• 1996

소음원의 특성을 규명하는 방법론들은 방위각 추정 방법론에 근간을 둔 소음원 위치 탐지 방법과 같이 소음원의 등가 단극음원 크기 및 위치들을 추정하는 기본적인 방법들로부터 보다 많은 계측기기 및 탐촉자와 함께 상당히 정교한 데이타 처리를 수행하여야 하는 인텐시티를 이용한 음장 맵핑(mapping) 홀로그라프를 이용한 관심음장 전체의 3차원 맵핑등 실로 다양하다 할 수 있다. 결국은 가장 많은 탐촉자를 사용하는 측정 시스템이 보다 많은 음장의 정보를 제공하므로서 가장 탁월한 방법론이라 결정할 수 있다. 이것은 특히 탐촉자 자체의 가격이 저렴해져 가는 추세인 점과 소형화하는 추세를 감안하여 봄과 동시에 공간상의 물리적인 의미 즉 파수영역에 대한 보다 폭 넓은 이해를 통한 시간, 공간, 주파수, 파수영역 즉 확대된 차원에서의 음장, 소음에 대한 이해를 갖을 수 있다는 면에서도 가치 있다고 할 수 있다.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.624-640
• /
• 2004

Recently, with the rapid development of location-based techniques, index structures to efficiently manage moving objects have been required. In this paper, we propose a new spatio-temporal index structure that supports a future position retrieval and minimizes a update cost. The proposed index structure combines an assistant index structure that directly accesses current positions of moving objects with KDB-tree that is a space partitioning access method. The internal node in our proposed index structure keeps time parameters in order to support the future position retrieval and to minimize a update cost. Moreover, we propose new update and split methods to maximize the space utilization and the search performance. We perform various experiments to show that our proposed index structure outperforms the existing index structure.

• Journal of KIISE:Software and Applications
• /
• v.36 no.1
• /
• pp.70-81
• /
• 2009

Ontology is an explicit specification of concepts and relationships between concepts in an interest domain. As considered as one of typical knowledge representation methods, ontology is applied to various studies such as information extraction, information integration, information sharing, or knowledge management. In IT based industries, ontology is applied to research on information integration and sharing in order to enhance interoperability between enterprises. In supply chains or logistics, several enterprises participate as business partners to plan movements of goods, and control goods and logistics flows. A number of researches on information integration and sharing for the effective and efficient management of logistics or supply chains have been addressed. In this paper, we address an ontology as a knowledge-base for semantic-based integration of logistics information distributed in the logistics flow. Especially, we focus on developing an ontology that enables to represent and translate semantic meaning of EPC data in the EPC Network applied logistics. We present a scenario for tracing products in logistics in order to show the value of our ontology.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.6
• /
• pp.549-558
• /
• 2001

It is important to reuse existing motion capture data for reduction of the animation producing cost as well as efficiency of producing process. Because its motion curve has no control point, however, it is difficult to modify the captured data interactively. The motion transition is a useful method to reuse the existing motion data. It generates a seamless intermediate motion with two short motion sequences. In this paper, Uniform Posture Map (UPM) algorithm is proposed to perform the motion transition. Since the UPM is organized through quantization of various postures with an unsupervised learning algorithm, it places the output neurons with similar posture in adjacent position. Using this property, an intermediate posture of two active postures is generated; the generating posture is used as a key-frame to make an interpolating motion. The UPM algorithm needs much less computational cost, in comparison with other motion transition algorithms. It provides a control parameter; an animator could control the motion simply by adjusting the parameter. These merits of the UPM make an animator to produce the animation interactively. The UPM algorithm prevents from generating an unreal posture in learning phase. It not only makes more realistic motion curves, but also contributes to making more natural motions. The motion transition algorithm proposed in this paper could be applied to the various fields such as real time 3D games, virtual reality applications, web 3D applications, and etc.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.6
• /
• pp.529-536
• /
• 2004

The main idea of this paper is to combine position information in sentence and query type classification to make the documents ranking to query more accessible. First, the use of conceptual graphs for the representation of document contents In information retrieval is discussed. The method is based on well-known strategies of text comparison, such as Dice Coefficient, with position-based weighted term. Second, we introduce a method for learning query type classification that improves the ability to retrieve answers to questions from Question Answering system. Proposed methods employ naive bayes classification in machine learning fields. And, we used a collection of approximately 30,000 question-answer pairs for training, obtained from Frequently Asked Question(FAQ) files on various subjects. The evaluation on a set of queries from international TREC-9 question answering track shows that the method with machine learning outperforms the underline other systems in TREC-9 (0.29 for mean reciprocal rank and 55.1% for precision).

• Annual Conference on Human and Language Technology
• /
• 1992.10a
• /
• pp.225-235
• /
• 1992

본 논문은 오프라인 필기체 한글 인식에 관한 연구로서, 입력 문자 영상에 대한 위치 정규화, 외곽선 추적 및 세선화의 전처리 과정을 거쳐 외곽선의 방향 성분 분포, 세선화한 결과의 방향 성분 분포, 구조적 특징점 분포 등의 특징을 추출한 다음, 획을 추출하여 획의 방향과 길이에 대한중점 분포 특징으로 정합하는 필기 한글의 인식을 위한 획 정합 방법을 제안하였다. 인식 시간의 단축을 위해 먼저 외곽선의 방향성분분포를 이용하여 대분류하였으며, 한글 사용 빈도수 상위 520자로 구성되는 필기 데이타에 대한 실험 결과, 평균 91%의 인식률과 평균 0.46초의 문자당 인식 시간을 보임으로써 제안된 획 정합 방법이 입력 문자의 잡영이나 획의 기울기에 대한 변형을 효과적으로 흡수할 수 있음을 알 수 있었다.