• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.280-282
• /
• 2005

A ribonucleic acid (RNA) is one of the two types of nucleic acids found in living organisms. An RNA molecule represents a long chain of monomers called nucleotides. The sequence of nucleotides of an RNA molecule constitutes its primary structure, and the pattern of pairing between nucleotides determines the secondary structure of an RNA. Non-coding RNA genes produce transcripts that exert their function without ever producing proteins. Predicting the secondary structure of non-coding RNAs is very important for understanding their functions. We focus on Nussinov's algorithm as useful techniques for predicting RNA secondary structures. We introduce a new traceback matrix and scoring table to improve above algorithm. And the improved algorithm provides better levels of performance than the originals.

• Convergence Security Journal
• /
• v.2 no.2
• /
• pp.209-216
• /
• 2002

This treatise deals with designing a database encryption model that interworks with Intranet within a system. Today attempts are being made to substitute legacy client/server computing environment with what interworks with web and database, and thus the question how the security for the database that interworks with Intranet can be secured is emerging as a matter of great importance. This treatise, therefore, offers an encryption model which offers how to create an encryption key using an ID and a password most widely used in Intranet access and by using this key, how to encipher information ill a DB table, providing a maintenance scheme for the Key as well.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.10a
• /
• pp.568-571
• /
• 2004

In this study, we propose an efficient expert system (ES) construction mechanism by using dynamic knowledge map (DKM) and database management systems (DBMS). Generally, traditional ES and ES developing tools has some limitations such as, 1) a lot of time to extend the knowledge base (KB), 2) too difficult to change the inference path, 3) inflexible use of inference functions and operators. First, to overcome these limitations, we use DKM in extracting the complex relationships and causal rules from human expert and other knowledge resources. Then, elation database (RDB) and its management systems will help to transform the relationships from diagram to relational table. Therefore, our mechanism can help the ES or KBS (Knowledge-Based Systems) developers in several ways efficiently. In the experiment section, we used medical data to show the efficiency of our mechanism. Experimental results with various disease show that the mechanism is superior in terms of extension ability and flexible inference.

• Asia pacific journal of information systems
• /
• v.6 no.1
• /
• pp.165-194
• /
• 1996

Data distribution is one of the most important steps in distributed database design. This paper proposes a methodology for distributing database by using a relational schema as an input. A design support system called DBDD (Database Distribution Design) is implemented within the framework of this methodology. The methodology consists of three phases such as (i) schema analysis, (ii) fragmentation, and (iii) allocation. In the schema analysis phase, all the table names are acquired from a global relational schema. In the fragmentation phase, fragments are generated according to transaction retrieval patterns. Furthermore, DBDD enhances the design quality by allocating fragments in a progressive manner. A real-life case is illustrated to demonstrate the practical usefulness of the DBDD.

• Proceedings of the KSRS Conference
• /
• 2008.10a
• /
• pp.398-401
• /
• 2008

With the advance of internet and computer processing technique, users can easily access and use the multimedia contents involving the various pictures, videos and audios information. And users request more convenient and accurate multimedia services. In these environments, it is difficulties to integrate and manage metadata standards because there are various standards in multimedia applications according to types of services and data formats individually. In this paper, we design and implement the multimedia metadata management system for integrating from heterogeneous sources. In our system, we managed heterogeneous metadata by integrating to unified schema using mapping table. Through proposed system, users can search multimedia data easily without considering variety of application services.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.3
• /
• pp.264-270
• /
• 2011

A new method for creating a logical data model is proposed. The logical data model developed by the method defines table, primary key, foreign key, and fields. The framework of the logical data model is constructed by modeling the relationships between events and their related entity types. The proposed method consists of a series of objective and quantitative decisions such as maximum cardinality of relationships and functional dependency between the primary key and attributes. Even beginners to database design can use the methology as long as they understand such basic concepts about relational databases as primary key, foreign key, relationship cardinality, parent-child relationship, and functional dependency. The simple and systematic approach minimizes decision errors made by a database designer. In practial database design the method creates a logical data model in Boyce-Codd normal form unless the user of the method makes a critical decision error, which is very unlikely.

• Journal of Intelligence and Information Systems
• /
• v.5 no.1
• /
• pp.13-34
• /
• 1999

Building a knowledge base effectively has been an important research area in the expert systems field. A variety of approaches have been studied including rules, semantic networks, and frames to represent the knowledge base for expert systems. As the size and complexity of the knowledge base get larger and more complicated, the integration of knowledge based with database technology cecomes more important to process the large amount of data. However, relational database management systems show many limitations in handing the complicated human knowledge due to its simple two dimensional table structure. In this paper, we propose Object-Oriented Knowledge Store (OOKS), a knowledge base model on the basis of a frame sturcture using an object-oriented database. In the proposed model, managing rules for inferencing and facts about objects in one uniform structure, knowledge and data can be tightly coupled and the performance of reasoning can be improved. For building a knowledge base, a knowledge script file representing rules and facts is used and the script file is transferred into a frame structure in database systems. Specifically, designing a frame structure in the database model as it is, it can facilitate management and utilization of knowledge in expert systems. To test the appropriateness of the proposed knowledge base model, a prototype system has been developed using a commercial ODBMS called ObjectStore and C++ programming language.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.1
• /
• pp.30-36
• /
• 2001

We present a new algorithm for mining association rules in the large database. Association rules are the relationships of items in the same transaction. These rules provide useful information for marketing. Since Apriori algorithm was introduced in 1994, many researchers have worked to improve Apriori algorithm. However, the drawback of Apriori-based algorithm is that it scans the transaction database repeatedly. The algorithm which we propose scans the database twice. The first scanning of the database collects frequent length l-itemsets. And then, the algorithm scans the database one more time to construct the data structure Common-Item Tree which stores the information about frequent itemsets. To find all frequent itemsets, the algorithm scans Common-Item Tree instead of the database. As scanning Common-Item Tree takes less time than scanning the database, the algorithm proposed is more efficient than Apriori-based algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.615-616
• /
• 2014

Currently, XML is a standard language used to exchange data. Most of the data in the file system is not stored in the database system. The data stored in an object-oriented database, the data can be represented by a hierarchical structure. However, in the case of a relational database table, each independently of the hierarchical structure data is present can not be expressed. In this paper, a hierarchical representation of data is difficult in traditional relational database without changing the data in the database, without having to build a new database, Define the structure of the existing data in the XML document for the automatic generation of a PL / SQL procedure is designed.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.180-182
• /
• 2005

Fingerprint-based identification is known to be used for a very long time. Owing to their uniqueness and immutability, fingerprints are today the most widely used biometric features. Therefore, recognition using fingerprints is one of the safest methods as a way of personal identification. But fingerprint identification system has a critical weakness. Since the fingerprint identification time dramatically increase when we compare the unknown fingerprint's minutiae with fingerprint database's minutiae. In this paper, a ridge orientation extraction method using Index table is proposed to solve the problem. The goal of fast direction image extraction is to reduce the identification time and to improve the clarity of ridge and valley structures of input fingerprint image.