• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2007.02a
• /
• pp.48-52
• /
• 2007

As huge amount of literature including biological data is being generated after post genome era, it becomes difficult for researcher to find useful knowledge from the biological databases. Bio-text mining and related natural language processing technique are the key issues in the intelligent knowledge retrieval from the biological databases. We propose a bio-text mining technique for the biologists who find Knowledge from the huge literature. At first, web robot is used to extract and transform related literature from remote databases. To improve retrieval speed, we generate an inverted file for keywords in the literature. Then, text mining system is used for extracting given knowledge patterns and keywords. Finally, we construct a grid computing environment to guarantee processing speed in the text mining even for huge literature databases. In the real experiment for 10,000 bio-literatures, the system shows 95% precision and 98% recall.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2080-2089
• /
• 1997

Recent evolution in compute technology makesthe multimedia processing widely availiable. Conventional storage systems do not meet the requirements of multimedia data. Several approaches were suggested to improve disk storing methods for them. Bocheck proposed a disk partitioning technique for multiple steams assuming that all steams have same retrieval intervals with the same amount data for each access. While Bocheck's one provides a good method for same period, it does not consider the case of different periods of continous media streams. This paper proposes a new partitioning technique in which a fixed number of blocks are assigned for stresms with different retrieval periodicity. The analysis shows this problem is the same as the one scheduling the steams into a given sequence. The simulation was done to compare the proposed m-sequence merge method with the conventional Scan-EDF and Partitioning methods.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.12 no.2
• /
• pp.167-172
• /
• 2012

In biology the advent of the high-throughput technology for sequencing, probing, or screening has produced huge volume of data which could not be manually handled. Biologists have resorted to software tools in order to effectively handle them. This paper introduces a bioinformatics tool to help biologists find potentially interesting pathway maps from a transcriptome data set in which the expression levels of genes are described for both case and control samples. The tool accepts a transcriptome data set, and then selects and categorizes some of genes into four classes using a fuzzy filtering technique where classes are defined by membership functions. It collects and edits the pathway maps related to those selected genes without analyst' intervention. It invokes a sequence of web service functions from KEGG, which an online pathway database system, in order to retrieve related information, locate pathway maps, and manipulate them. It maintains all retrieved pathway maps in a local database and presents them to the analysts with graphical user interface. The tool has been successfully used in identifying target genes for further analysis in transcriptome study of human cytomegalovirous. The tool is very helpful in that it can considerably save analysts' time and efforts by collecting and presenting the pathway maps that contain some interesting genes, once a transcriptome data set is just given.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.7
• /
• pp.1311-1317
• /
• 2007

Recently, due to the popularity and explosive growth of the Internet, the information exchange is increasing so rapidly over the Internet. Also the XML is becoming a standard as well as a major tool of data exchange on the Internet and thus we propose the new indexing technique for evaluating a path-oriented query and design and implementation of Path-oriented Query Processing System to give useful for users. In proposed indexing technique, which combined a binary trio structure with a path signature file to improve performance of XML document retrieval.

• The Journal of Information Technology and Database
• /
• v.7 no.2
• /
• pp.17-32
• /
• 2000

As XML emerging as the Internet electronic document language standard of the next generation, the number of XML documents which contain vast amount of Information is increasing substantially through the transformation of existing documents to XML documents or the appearance of new XML documents. Consequently, XML document retrieval system becomes extremely essential for searching through a large quantity of XML documents that are storied in and managed by DBMS. In this paper we describe the design and implementation of BADA-IV/XML query processor that supports content-based, structure-based and attribute-based retrieval. We design XML query language based upon XQL (XML Query Language) of W3C and tightly-coupled with OQL (a query language for object-oriented database). XML document is stored and maintained in BADA-IV, which is an object-oriented database management system developed by ETRI (Electronics and Telecommunications Research Institute) The storage data model is based on DOM (Document Object Model), therefore the retrieval of XML documents is executed basically using DOM tree traversal. We improve the search performance using Node ID which represents node's hierarchy information in an XML document. Assuming that DOW tree is a complete k-ary tree, we show that Node ID technique is superior to DOM tree traversal from the viewpoint of node fetch counts.

• The KIPS Transactions:PartB
• /
• v.12B no.1 s.97
• /
• pp.31-38
• /
• 2005

This paper proposes an object-based image retrieval scheme using color adjacency and clustering method. Color adjacency features in boundary regions are utilized to extract candidate blocks of interest from image database and a clustering method is used to extract the regions of interest(ROI) from candidate blocks of interest. To measure the similarity between the query and database images, the histogram intersection technique is used. The color pair information used in the proposed method is robust against translation, rotation, and scaling. Consequently, experimental results have shown that the proposed scheme is superior to existing methods in terms of ANMRR.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.4
• /
• pp.29-34
• /
• 2000

This paper presents a new indexing technique, for the fast content-based image browsing and retrieval in a database. By applying the rosette pattern that has more sample lines in the vicinity of center than those m the outer parts, we can get global gray distribution features as well as local positional information. These features are transformed into histogram and used as database indices. From the simulation results, the proposed method clearly shows the validity and the efficiency in respect of memory space as well as a good retrieval performance.

• The Journal of Korean Association of Computer Education
• /
• v.5 no.4
• /
• pp.71-78
• /
• 2002

The mobile agent is receiving the attention as new technique to retrieve and to share the distributed contents on web-based educational systems. The retrieval using mobile agent uses the method that delivers the agent to accomplish a search in direct server in substitute for it is transmitted a many contents to accomplish an efficient search. This study proposed the model of retrieval system that shares and searches the distributed educational contents of the bulletin board and newsgroup by using the mobile agent. In order to evaluate the efficiencies of the system that is proposed, we did the comparison test on the search model of existing and proposing system. By a test result, we confirmed network traffics of proposed system are diminished. Moreover we gave proof the fact that the optimum search time of the mobile agent-based system is shortened.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.99-107
• /
• 2004

Education and training are expected to change dramatically due to the combined impact of the Internet, database, and multimedia technologies However, the distance learning is often impeded by the lack of effective tools and system to manage and retrieve the lecture contents effectively. This paper introduces a prototype system called COVA that enables remote users to access specific parts of interest by contents from a large lecture database. COVA includes several novel techniques to achieve the content-based lecture retrieval in distance teaming: (1) The XML-based semistructured model to represent lecture contents; (2) The technique to build structural summaries, i.e., schemas, of XML lecture databases; (3) Index structures to speed up the search to find appropriate lecture contents.

• The Journal of Korean Association of Computer Education
• /
• v.5 no.1
• /
• pp.99-108
• /
• 2002

As window programming and internet programming are more required, requirement of the training on the object-oriented programming and the object oriented software development are growing. But, it is not easy to learn new brand methodologies or techniques. In this paper, we tried to apply software reuse to object modeling education for effective learning of new programming and modeling method. In this paper, we present analogical matching techniques for the reuse of object models and patterns in object modeling education. Analogy-based matching is better than keyword-based retrieval for model reuse. Reuse can help to reduce the learning curve of object modeling. Also, by applying analogical reasoning, the performance of retrieval is better than keyword-based retrieval.