• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.294-297
• /
• 2000

Among the multi-dimensional query types, ranking query is needed if we want the object one by one until we satisfy for the result. In multi-dimensional indexing structures like R-tree or its variants, not many methods are introduced in this area. In this paper, we introduce new ranking query processing algorithm which use the filtering mechanism in the R-tree variants.

• Journal of Intelligence and Information Systems
• /
• v.4 no.2
• /
• pp.117-128
• /
• 1998

CBR is a knowledge-based system that utilizes the previous knowledge or experience to solve the current problem. In previous CBR research, the emphases are mainly put on the development of more sophisticated indexing mechanism for past cases or the most similar case retrieving methodology out of a group of previous cases. In this paper, discussed is a CBR system that is able to take advantage of the case or knowledge that does not belong to the past in the telecommunications internetworking design area. And the architecture for such CBR system is proposed. Finally, the performance of the CBR system is shown through an ablation experiment.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.650-663
• /
• 2004

In molecular biology, DNA sequence searching is one of the most crucial operations. Since DNA databases contain a huge volume of sequences, a fast indexing mechanism is essential for efficient processing of DNA sequence searches. In this paper, we first identify the problems of the suffix tree in aspects of the storage overhead, search performance, and integration with DBMSs. Then, we propose a new index structure that solves those problems. The proposed index consists of two parts: the primary part represents the trie as bit strings without any pointers, and the secondary part helps fast accesses of the leaf nodes of the trio that need to be accessed for post processing. We also suggest an efficient algorithm based on that index for DNA sequence searching. To verify the superiority of the proposed approach, we conducted a performance evaluation via a series of experiments. The results revealed that the proposed approach, which requires smaller storage space, achieves 13 to 29 times performance improvement over the suffix tree.

• The KIPS Transactions:PartB
• /
• v.17B no.2
• /
• pp.163-168
• /
• 2010

A linguistic case-based fuzzy reasoning (LCBFR) based on standardized parametric membership functions (SPMF) is proposed. It provides an efficient mechanism for a fuzzy reasoning within linear time complexity. Thus, it can be used to improve the speed of fuzzy reasoning. In the process of LCBFR, linguistic case indexing and retrieval based on SPMF is suggested. It can be processed relatively fast compared to the previous linguistic approximation methods. From the engineering viewpoint, it may be a valuable advantage.

• Journal of information and communication convergence engineering
• /
• v.7 no.3
• /
• pp.275-280
• /
• 2009

While database(DB) and information retrieval(IR) have been developed independently, there have been emerging requirements that both data management and efficient text retrieval should be supported simultaneously in an information system such as health care, customer support, XML data management, and digital libraries. The great divide between DB and IR has caused different manners in index maintenance for newly arriving documents. While DB has extended its SQL layer to cope with text fields due to lack of intact mechanism to build IR-like index, IR usually treats a block of new documents as a logical unit of index maintenance since it has no concept of integrity constraint. However, In the DB-IR integrations, a transaction on adding or updating a document should include maintenance of the posting lists accompanied by the document. Although DB-IR integration has been budded in the research filed, the issue will remain difficult and rewarding areas for a while. One of the primary reasons is lack of efficient online transactional index maintenance. In this paper, performance of a few strategies for per-document basis transactional index maintenance - direct index update, pulsing auxiliary index and posting segmentation index - will be evaluated. The result shows that the pulsing auxiliary strategy and posting segmentation indexing scheme, can be a challenging candidates for text field indexing in DB-IR integration.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.5
• /
• pp.1130-1139
• /
• 1998

This paper presents an integrated solution for the content-based news video indexing and the retrieval. Currently, it is impossible to automatically index a general video, but we can index a specific structural video such as news videos. Our proposed model extracts automatically the key frames by using the structured knowledge of news and consists of the news item segmentation, caption recognition and search browser modules. We present above three modules in the following: the news event segmentation module recognizes an anchor-person shot based on face recognition, and then its news event are divided by the anchor-person's frame information. The caption recognition module detects the caption-frames with the caption characteristics, extracts their character region by the using split-merge method, and then recognizes characters with OCR software. Finally, the search browser module could make a various of searching mechanism possible.

• The KIPS Transactions:PartC
• /
• v.18C no.4
• /
• pp.255-264
• /
• 2011

TV-Anytime is an XML-based standard for description of PVR and digital broadcast services. It is referenced by many standards of digital broadcast service for their schemas and delivery protocols of contents guide. Although its readability and extensibility, TV-Anytime has a big problem which generates massive documents due to its text-based description method. Therefore, various encoding algorithms have been proposed to reduce the size of XML documents. This paper proposes efficient metadata encapsulation architecture based on the optimization information generated at server-side to minimize XML documents. Advanced indexing method is also proposed to reduce resources needed to encapsulate indices and to receive metadata with fast and explicit mechanism.

• Language and Information
• /
• v.6 no.2
• /
• pp.171-185
• /
• 2002

I claim that the asymmetry of locality effects in wh-questions involving Complex Noun Phrase Island in Korean follows from the proposal for the asymmetric mode of scope taking between way (why) and the other wh-words in Korean as laid out in Choi (2002). 1 will show that the present proposal is superio. to the LF pied-piping approach in Nishigauchi (1990) and WH-structure pied-piping in von Stechow(1996) in that it does not have the fatal problem of wrong semantics in Nishigauchi and Subjacency violation problem in von Stechow. The crossed reading in examples involving Wh-island has an interesting implication for the mechanism of unselective binding, suggesting that Heim's (1982) quantifier indexing mechanism, which requires the local unselective binding of the indefinite by the unselective binder, may be too strong.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.12
• /
• pp.1248-1255
• /
• 2011

In daily life, another major role of human hand is a communicative function using hand gestures besides grasp function. Therefore, if amputees can express their intention by the prosthetic hand, they can much actively participate in social activities. Thus, this paper propose myoelectric multi-function prosthetic hand which can express 6 useful hand gestures such as Rock, Scissors, Paper, Indexing, Ok and Thumb-up. It was designed as under-actuated structure to minimize volume and weight of the prosthetic hand. Moreover, in order to effectively control various hand gestures by only two EMG sensors, we propose a control strategy that the signal type are expanded as "Strong" and "Light", and hand gestures are hierarchically classified for the intuitive control. Finally, we prove the validity of the developed prosthetic hand with the experiment.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.4
• /
• pp.85-93
• /
• 2001

As progressing rapidly to the information society and increasing greatly the amount of information, many researchers have been made utilizing XML to store and retrieval the information effectively. But, many other existing method could not support various structured retrieval method for specific parent, children and sibling nodes. In this paper, we propose (1)an effective method of representation for structured information and of indexing mechanism using OETID(Ordered Element Type ID) for effective management and structured retrieval of the XML documents. Also it contains another proposal that is (2) a documents integration mechanism for retrieval result and storing technique to store structural information of the XML documents. With our methods, we could effectively represent structural information of XML documents, and could directly access the specific elements and process various queries by simple operations.