• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.3
• /
• pp.183-191
• /
• 2006

As genetic research is getting more active, data construction of genes are needed in the field of biology. Therefore, Gene Ontology Consortium has constructed genetic information by OWL, which is Ontology description language published by W3C. However, previous browsers for Gene Ontology only support simple searching mechanisms based on keyword, tree, and graph, but it is not able to search high quality information considering various relationships. In this paper, we suggest browsing technique which integratesvarious searching methods to support researchers who are doing actually experiment in biology field. Also, instead of typing a query, we propose querv generation technique which constructs query while browsing and query translation technique which translate generated query into SeRQL query It is convenient for user and enables user to obtain high quality information. And by this GO Guide browser, it has been shown that the information of Gene Ontology could be used efficiently.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.641-649
• /
• 2004

The relationship between chemical structures and biological activities is researched briskly in the area of 'Medicinal Chemistry' At the base of these structure-based drug design tries, medicinal chemists search the existing drugs of similar chemical structure to target drug for the development of a new drug. Therefore, it is such necessary that an automatic system selects drug files that have a set of chemical moieties matching a user-defined query moiety. Substructure searching is the process of identifying a set of chemical moieties that match a specific query moiety. Testing for substructure searching was developed in the late 1950s. In graph theoretical terms, this problem corresponds to determining which graphs in a set are subgraph isomorphic to a specified query moiety. Testing for subgraph isomorphism has been proved, in the general case, to be an NP- complete problem. For the purpose of overcoming this difficulty, there were computational approaches. On the 1990s, a US patent has been granted on an atom-centered indexing scheme, used by the RS3 system; this has the virtue that the indexes generated can be searched by direct text comparison. This system is commercially used(http://www.acelrys.com/rs3). We define the RS3 system's drawback and present a new indexing scheme. The RS3 system treats substructure searching with substring matching by means of expressing chemical structure aspredefined strings. However, it has insufficient 'rerall' and 'precision‘ because it is impossible to index structures uniquely for same atom and same bond. To resolve this problem, we make the minimum-cost- spanning tree for one centered atom and describe a structure with paths per levels. Expressing 2D chemical structure into 1D a string has limit. Therefore, we break 2D chemical structure into 1D structure fragments. We present in this paper a new index technique to improve recall and precision surprisingly.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.2
• /
• pp.16-27
• /
• 2011

Embryo is a very early stage of the development of multicellular organism such as animals and plants. It is an important research target for studying ontogeny because the fundamental body system of multicellular organism is determined during an embryo state. Researchers in the developmental biology have a large volume of embryo image databases for studying embryos and they frequently search for an embryo image efficiently from those databases. Thus, it is crucial to organize databases for their efficient search. Hierarchical clustering methods have been widely used for database organization. However, most of previous algorithms tend to produce a highly skewed tree as a result of clustering because they do not simultaneously consider both the size of a cluster and the number of objects within the cluster. The skewed tree requires much time to be traversed in users' search process. In this paper, we propose a method that effectively organizes a large volume of embryo image data in a balanced tree structure. We first represent embryo image data as a similarity-based graph. Next, we identify clusters by performing a graph partitioning algorithm repeatedly. We check constantly the size of a cluster and the number of objects, and partition clusters whose size is too large or whose number of objects is too high, which prevents clusters from growing too large or having too many objects. We show the superiority of the proposed method by extensive experiments. Moreover, we implement the visualization tool to help users quickly and easily navigate the embryo image database.

• Journal of KIISE:Software and Applications
• /
• v.30 no.5_6
• /
• pp.497-502
• /
• 2003

Content-based video copy detection is a complementary approach to watermarking. As opposed to watermarking, which relies on inserting a distinct pattern into the video stream, video copy detection techniques match content-based signatures to detect copies of video. Existing typical content-based copy detection schemes have relied on image matching which is based on key frame detection. This paper proposes a motion directional histogram, which is quantized and accumulated the direction of motion, for video copy detection. The video clip is represented by a motion directional histogram as a 1-dimensional graph. This method is suitable for real time indexing and counting the TV CF verification that is high motion video clips.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06c
• /
• pp.154-158
• /
• 2008

시간이 지날수록 처리해야 하는 정보가 점점 늘어나고 있어서 각 분야에서는 온톨로지를 구축하여 그것을 기반으로 보다 정확한 결과를 얻으려는 시도를 하고 있다. 한의학 분야에서도 온톨로지를 이용한 약재 정보 관리를 시도하고 있다. 하지만 한의학 약재 온톨로지에서는 약재 사이의 연관성 파악이 중요하지만, 기존의 검색은 키워드 기반의 검색으로 약재 사이의 연관성을 확인하게 어려움이 있다. 온톨로지의 구조적 내용을 파악하기 위한 기존의 온톨로지 뷰어들이 존재하지만 약재 온톨로지가 가지는 계층구조 위주의 탐색이 어렵고, 다양한 속성이 속성에 관계없이 그래프 상에 고르게 분포하기 때문에 속성에 따른 약재의 구분이 어렵다는 문제점이 존재한다. 따라서 기존의 뷰어를 수정 및 보완하여 한의학 약재 온톨로지에서 계층구조 파악 및 속성 별 약재 분류를 파악할 수 있는 뷰어를 개발하였다. 이러한 뷰어시스템을 통해 향후 한의학 전반적인 분야의 자원을 단계별로 체계화하여 관리함으로써 사용자 중심의 통합되고 현대화된 전통 의학 정보의 서비스의 기초시스템으로 활용될 수 있을 것이다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.1
• /
• pp.109-116
• /
• 2021

Since RDF (Resource Description Framework) triples are modeled as graph, we cannot directly adopt existing solutions in relational databases and XML technology. In order to store, index, and query Linked Data more efficiently, we propose a convergence indexing method combined R*-tree and K-dimensional trees. This method uses a hybrid storage system based on HDD (Hard Disk Drive) and SSD (Solid State Drive) devices, and a separated filter and refinement index structure to filter unnecessary data and further refine the immediate result. We perform performance comparisons based on three standard join retrieval algorithms. The experimental results demonstrate that our method has achieved remarkable performance compared to other existing methods such as Quad and Darq.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.338-341
• /
• 2003

According to a long-term master plan for the implementing of MOMAF's marine environmental informatization, we have developed marine environment portal web site which consists of 7 main-menu and 39 sub-menu including various types of contents (text, image and multimedia) based on RDBMS. This portal site was opened in Oct., 2002 (http://www.meps.info). Also, for the national institutions' distributed DB which is archived and managed respectively the marine chemical data and biological data, the integrated retrieval system was developed. This system is meaningful for the making collaborative use of real data and could be applied for data mining, marine research, marine environmental GIS and making-decisions.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.6
• /
• pp.643-648
• /
• 2003

In order to provide efficient retrieving results for user query on the web environment, the various searching algorithms have developed and considered user's preference and convenience. However, the searching algorithms are developed on the horizontal and non hierarchical web environment in general and could not apply to the complex hierarchical and functional web environments such like the enterprise network. In this paper, we purpose the multi-agent based web mining system which can provide the efficient mining results to the user on the special web environment. For doing this, we suggest the network model with the hierarchical web environment and model the multi agent based web mining system which has four corporation agents and fourteen process modules. Then, we explain the detailed functions of each agent considered the hierarchical environment according to the module. Especially, we purpose the new merging agent and improved ranking algorithm by using the graph theory.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.36T no.4
• /
• pp.71-81
• /
• 1999

We propose a new CPLD(Complexity Programmable Logic Device) technology mapping algorithm improving run-time under time constraint. In our technology mapping algorithm, a given logic equation is constructed as the DAG(Directed Acyclic Graph) type, then the DAG is reconstructed by replicating the node that outdegree is more than or equal to 2. As a result, it makes delay time and the number of CLBs, run-time to be minimized. Also, after the number of multi-level is defined and cost of each nodes is calculated, the graph is partitioned in order to fit to k that is the number of OR term within CLB. The partitioned nodes are merged through collapsing and bin packing is performed in order to fit to the number of OR term within CLB(Configurable Logic Block). In the results of experiments to MCNC circuits for logic synthesis benchmark, we can shows that proposed technology mapping algorithm reduces run-time and the number of CLBs much more than the TEMPLA.

• Journal of Korea Multimedia Society
• /
• v.9 no.11
• /
• pp.1483-1495
• /
• 2006

The navigation mesh represents a terrain as a set of triangles on which characters may move around. The navigation mesh cab be generated automatically, and it is more flexible in representing 3D surface. The number of triangles to represent a terrain may vary according to the structure of the terrain. As characters are moving around on a navigation mesh, the path planning can be performed more easily by projecting the 3D surfaces into 2D space. However, when the terrain is represented with an elaborated mesh of large number of triangles to achieve more realistic movements, the path finding can be very inefficient because there are too many states(triangles) to be searched. In this paper, we propose an efficient method of path finding in 3D games where the terrain is represented by navigation meshes. Our method uses the visibility tests. When the graph-based search is applied to elaborated polygonal meshes for detailed terrain representation, the path finding can be very inefficient because there are too many states(polygons) to be searched. In our method, we reduce the search space by using visibility tests so that the search can be fast even on the detailed terrain with large number of polygons. First we find the visible vertices of the obstacles, and define the heuristic function as the distance to the goal through those vertices. By doing that, the number of states that the graph-based search visits can be substantially reduced compared to the plane search with straight-line distance heuristic.