• Journal of the Korea Computer Industry Society
• /
• v.7 no.3
• /
• pp.227-236
• /
• 2006

Semantic Web is getting popular to next web environment. Additionally, ontology language research is also activating to represent semantic relation of resource in semantic web. Specially, Ontology language as RDF and DAML+OIL appear on start point of research. But Ontology Language limited to describing characters of resource and to making a clear definition of relation of resource. So W3C suggest OWL at the next standard language for describing resource. OWL supply the lack of representation for RDF and RDF Schema. In this paper, we make Ontology to implement Online Retrieval System using OWL and propose the structure of storing Ontology document at the RDB. The structure support characters of OWL that are equivalent relationship, heterogeneous relationship, inverse relationship, union relationship and one of relationship between classes or properties. In this paper, we classify the extended elements for OWL from RDF Schema. And we propose the method of storing OWL using RDB for interoperability with many applications based on RDB. Finally, implement the storage and retrieval system based on OWL to provide advanced search function.

• Journal of Korea Society of Industrial Information Systems
• /
• v.9 no.1
• /
• pp.36-42
• /
• 2004

In this paper, we compare the vector model performance with the probabilistic model of information system. We use LSI(Latent Semantic Indexing) model for vector model, while Condor information search system that is ready to sell on business is used as a probabilistic model. Each model produces the search results from the original queries and the queries extended by a dictionary definition. We compare those results between two models and find out the vector model is much better than the probabilistic model for the most queries.

• Spatial Information Research
• /
• v.8 no.1
• /
• pp.155-170
• /
• 2000

When we use R-Tree,a spatial index, to find objects matches some predicate, it often leads to an incorrect result of perform filtering step only with MBR. And , each candidates need to be inspected to conform if it really satisfies with given query, so called, 'refinement step'. In refinement step. we should perform disk I/O and expansive spatial operations which is the cause of increasing retrieval costs. Therefore, to minimize the number of candidate after filtering step, two-phase filtering methods were studied, but there was many problems such as inefficiency of filtering,maintenance of additional informations and reconstruction of data resulted from the loss of original information. So , in this paper, I propose an Extended R-Tree which provides ability to retrieve spatial objects only with some simple logical operations using Grid Table, truth table strong the information about the existence of spatial objects, in second filtering step. Consequently , this Extended R-Tree using Grid Filter has low cost of operation for filtering because of efficient second filtering step, and better filtering efficiency caused by high quality of approximation.

• Journal of Digital Convergence
• /
• v.11 no.12
• /
• pp.431-438
• /
• 2013

In this paper we proposed a intelligent recommendation processor that the type of auto parts failures that may occur in the checkout process is represented by association relationship and the relationship was implemented with ontology. For this purpose, we defined 10 kinds of failure types and their associated parts, and we designed to simulate the recommendation process of five views. For components to be checked with the type of fault, it was possible to be expansion recommendation to the intelligent by controlling the weight value according to the relationship on the components.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.04a
• /
• pp.506-511
• /
• 1996

The performance evaluation of flexible manufacturing systems or cells at the stages of design and planning is one of important issues in manufacturing. For that reason, Guo has presented an approachbased on moment generating function and generalized stochastic PetriNets for performance analysis. In this paper, Buo's approach is extended tothe cases of flexible manufacturing cell including one machining center with a local buffer, AS/RS(Automatic Storage and Retrieval System), set-up station and AGV(Automated Guided Vehicle). Then the performance measures from this approach is compared with simulation. The major advantage ofthis method over existing performance evaluation methods is the ability to compute analytic solutions for performance measures.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.3
• /
• pp.459-470
• /
• 2013

The discovery of nearest neighbors, without training in advance, has many applications, such as the formation of mosaic images, image matching, image retrieval and image stitching. When the quantity of data is huge and the number of dimensions is high, the efficient identification of a nearest neighbor (NN) is very important. This study proposes a variation of the KD-tree - the arbitrary KD-tree (KDA) - which is constructed without the need to evaluate variances. Multiple KDAs can be constructed efficiently and possess independent tree structures, when the amount of data is large. Upon testing, using extended synthetic databases and real-world SIFT data, this study concludes that the KDA method increases computational efficiency and produces satisfactory accuracy, when solving NN problems.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2006.05a
• /
• pp.241-248
• /
• 2006

Web is greatly contributing in providing a variety of information. Especially, as media for the purpose of development and education of human resources, the role of web is important. Furthermore, E-Learning through web plays an important role for each enterprise and an educational institution. Also, above all, fast and various searches are required in order to manage and search a great number of educational contents in web. Therefore, most of present information is composed in HTML, so there are lots of restrictions. As a solution to such restriction, XML a standard of Web document, and its various search functions is being extended and studied variously. This paper proposes a search system able to search XML in E-Learning or var ious contents of non-XML using mobile device PDA.

• ETRI Journal
• /
• v.32 no.3
• /
• pp.490-492
• /
• 2010

This letter proposes a robust feature extraction method using a spatially normalized mean for temporal ordinal measurement. Before computing a rank matrix from the mean values of non-overlapped blocks, each block mean is normalized so that it obeys the invariance property against linear additive and subtractive noise effects and is insensitive against multiplied and divided noise effects. Then, the temporal ordinal measures of spatially normalized mean values are computed for the feature matching. The performance of the proposed method showed about 95% accuracy in both precision and recall rates on various distortion environments, which represents the 2.7% higher performance on average compared to the temporal ordinal measurement.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.05a
• /
• pp.77-80
• /
• 2000

정보 검색은 사용자가 원하는 요구에 가장 적합한 정보를 검색할 수 있도록 되어야 한다. 질의어가 문서에 대하여 어느 정도의 유사성을 가지고 존재하느냐를 기준으로 문서를 순서화 한다. 실제 순서화된 문서들을 보면 질의어와는 다른 문서들이 순서화 되는 경우를 볼 수 있다 본 논문에서는 순서화 되는 문서들 중에서 그 문서들이 질의어와 어느 정도 가까운지를 확장 퍼지 개념 네트워크에 근거한 문서 검색을 위한 퍼지 순위 처리를 위한 방법을 제시한다 확장 퍼지 개념 네트워크에는 개념들 사이에 4가지의 퍼지 관계를 사용한다. 퍼지 양의 관계, 퍼지 음의 관계, 퍼지 일반화, 및 퍼지 세분화 등이 있다. 확장 퍼지 개념 네트워크는 관계 행렬과 관련 행렬로 모델화 한다.

• The Magazine of the IEIE
• /
• v.39 no.2
• /
• pp.45-54
• /
• 2012

Object detection is a fundamental task for many high-level computer vision applications such as image retrieval, scene understanding, activity recognition, visual surveillance and many others. Although object detection is one of the most popular problems in computer vision and various algorithms have been proposed thus far, it is also notoriously difficult, mainly due to lack of proper models for object representation, that handle large variations of object structure and appearance. In this article, we review a branch of object detection algorithms based on Support Vector Machines (SVMs), a well-known max-margin technique to minimize classification error. We introduce a few variations of SVMs-Structural SVMs and Latent SVMs-and discuss their applications to object detection and localization.