• Journal of KIISE:Databases
• /
• v.30 no.6
• /
• pp.573-584
• /
• 2003

Recent massive data generation by genomics and proteomics requires bioinformatic tools to extract the biological meaning from the massive results. Here we introduce ROSPath, a database system to deal with information on reactive oxygen species (ROS)-mediated cell signaling pathways. It provides a structured repository for handling pathway related data and tools for querying, displaying, and analyzing pathways. ROSPath data model provides the extensibility for representing incomplete knowledge and the accessibility for linking the existing biochemical databases via the Internet. For flexibility and efficient retrieval, hierarchically structured data model is defined by using the object-oriented model. There are two major data types in ROSPath data model: ‘bio entity’ and ‘interaction’. Bio entity represents a single biochemical entity: a protein or protein state involved in ROS cell-signaling pathways. Interaction, characterized by a list of inputs and outputs, describes various types of relationship among bio entities. Typical interactions are protein state transitions, chemical reactions, and protein-protein interactions. A complex network can be constructed from ROSPath data model and thus provides a foundation for describing and analyzing various biochemical processes.

• Journal of the HCI Society of Korea
• /
• v.2 no.2
• /
• pp.35-43
• /
• 2007

This paper presents a system for image matching and recognition based on image feature detection and description techniques from artificial satellite photographs. We propose some kind of parameters from the varied environmental elements happen by image handling process. The essential point of this experiment is analyzes that affects match rate and recognition accuracy when to change of state of each parameter. The proposed system is basically inspired by Lowe's SIFT(Scale-Invariant Transform Feature) algorithm. The descriptors extracted from local affine invariant regions are saved into database, which are defined by k-means performed on the 128-dimensional descriptor vectors on an artificial satellite photographs from Google earth. And then, a label is attached to each cluster of the feature database and acts as guidance for an appeared building's information in the scene from camera. This experiment shows the various parameters and compares the affected results by changing parameters for the process of image matching and recognition. Finally, the implementation and the experimental results for several requests are shown.

• The Journal of Society for e-Business Studies
• /
• v.18 no.3
• /
• pp.93-105
• /
• 2013

Much Interest has focused on social network services such as Facebook and Twitter. Previous research conducted on social network often emphasized the architecture of the social network that is the existence of path between any objects on network and the centrality of the object in the network. However, studies on the semantic association in the network are rare. Studies on searching semantic associations between entities are necessary for future business enhancements. In this research, the ontology based social network analysis is performed. A new method to search and rank relation sequences that consist of several relations between entities is proposed. In addition, several heuristics to measure the strength of the relation sequences are proposed. To evaluate the proposed method, an experiment was performed. A group of social relationships among the university and organizations are constructed. Some social connections are searched using the proposed ranking method. The proposed method is expected to be used to search the association among entities in ontology based knowledge base.

• Journal of the Korean Society for Library and Information Science
• /
• v.40 no.2
• /
• pp.103-123
• /
• 2006

Assuming that the knowledge creation and retrieval functions could be the most important factors for a successful knowledge management(KM) especially during the promotion stage of KM, this study suggests an e-learning application as one of best methods for producing knowledge and also the integrated knowledge repository model in which learning, knowledge. and information objects can be semantically associated through topic map-based knowledge map. The traditional KM system provides a simple directory-based knowledge map. which can not provide the semantic links between topics or objects. The proposed model can be utilized as a solution to solve the above-mentioned disadvantages of the traditional models. In order to collect the basic data for the proposed model, first, case studies utilizing interviews and surveys were conducted targeting at three Korean insurance companies' knowledge managers(or e-learning managers) and librarians. Second, the related studies and other topic map-based pilot systems were investigated.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.4
• /
• pp.812-820
• /
• 2012

In this paper, multiple pedestrians tracking system using Histogram of Oriented Gradient and occlusion detection is proposed. The proposed system is applicable to Intelligent Surveillance System. First, we detect pedestrian in a image sequence using pedestrian's feature. To get pedestrian's feature, we make block-histogram using gradient's direction histogram based on HOG(Histogram of Oriented Gradient), after that a pedestrian region is classified by using Linear-SVM(Support Vector Machine) training. Next, moving objects are tracked by using position information of the classified pedestrians. And we create motion trajectory descriptor which is used for content based event retrieval. The experimental results show that the proposed method is more fast, accurate and effective than conventional methods.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.9
• /
• pp.2334-2344
• /
• 1998

Appliciltion systems focusing class units, as component abstraction based on source code, has insufficient benefit of independency and reuse of elements. Only few effects are acquired, because it is only inclined implementation. We need design pattern to represent not only the problem abstraction but also information and relationship between system elements for generic solutions of specific domain Also, it is essential to software reverse engineering to catch the correct system through examming the cxisting system and utilizing the acquired knowledges as reusable resource. Namely, software reverse engineering for extracting the design pattern is very important because it improves the understand ability for system analysis and design through extracting the design structure of object-oriented system, and provides rich and high leIel reusabilitv through grasping the standard idioms and relationships between components. In this paper, we defined the extraction algorithm for design patterns with standardized, packaged and quantitative measlIIul thruugh applying reyerse engineering into existing ubject Olicnted system. And we designed the reengineering toul including reverse engineering for autumatic extractiun of design patterns ami reuse fur retrieval. editing and rebuilding oi design patterns. Also we applied the algorithms into Java applications.

• The KIPS Transactions:PartA
• /
• v.13A no.1 s.98
• /
• pp.87-94
• /
• 2006

Internet makes it possible to access anytime, anywhere learning and so many LMS(Learning Management Systems) serve web based learning. But LMS has not flexible and qualified metadata to offer customired teaming. So we need extensible and flexible techniques which make if possible to define and share advanced teaming metadata. This paper presents an approach for implementing advanced learning metadata in LMS using RDF and the Semantic Web language. So we will first sketch the learning scenario in Semantic Web environment and structure of metadata management. Next we suggest two types of RDF authoring tool and search RDF documents. Advanced metadata management techniques enables the organization of learning materials around small pieces of semantically annotated learning objects. With these metadata learner can customize learning courses, improve retrieval performances.

• Journal of Internet Computing and Services
• /
• v.5 no.4
• /
• pp.77-94
• /
• 2004

Recently, the needs of index structure which manages moving objects efficiently have been increased because of the rapid development of location-based techniques. Existing index structures frequently need updates because moving objects change continuatively their positions. That caused entire performance loss of the index structures. In this paper, we propose a new index structure called the TPKDB-tree that is a spatio-temporal index structure based on KDB-tree. Our technique optimizes update costs and reduces a search time for moving objects and reduces unnecessary updates by expressing moving objects as linear functions. Thus, the TPKDB-tree efficiently supports the searches of future positions of moving objects by considering the changes of moving objects included in the node as time-parameter. To maximize space utilization, we propose the new update and split methods. Finally, we perform various experiments to show that our approach outperforms others.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.227-237
• /
• 2000

A Web database System is a large-scaled multimedia application system that has multimedia processing facilities and cooperates with relational/Object-Oriented DBMS. Conventional hypertext modeling methods and DB gateway have limitations for Web database because of their restricted versatile presentation abilities and inefficient concurrency control caused by bottleneck in cooperation processing. Thus, we suggest a Dynamic Navigation Model & Virtual Graph Structure. The Dynamic Navigation Model supports implicit query processing and dynamic creation of navigation spaces, and introduce node-link creation rule considering navigation styles. We propose a mapping methodology between the suggested hypertext model and the relational data model, and suggest a dynamic allocation scheduling technique for query processing server based on weighted value. We show that the proposed technique enhances the retrieval performance of Web database systems in processing complex queries concurrently.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.916-931
• /
• 1999

Code reuse in software reuse has several limitations such as difficulties of understanding and retrieval of the reuse code written by other developers. To overcome these problems, it should be possible to reuse the analysis/design information than source code itself. In this paper, we present analogical matching techniques for the reuse of object models and patterns. We have suggested the design patterns as reusable components and the representation techniques to store them. The contents of the paper is as follows.1. analogical matching functions to retrieve analogous components from reusable libraries. 2. the representation of reusable components to be stored in the library in order to support the analogical matching. 3. the design library with more semantic informations about domains. 4. the analogical matching agent with a user-friendly interface that can retrieve the analogous components from the library based on analogical matching techniques.