• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.1 s.307
• /
• pp.85-90
• /
• 2006

In this paper, we propose the content-based music information retrieval system with improved retrieval speed and stable performance while maintaining resonable retrieval accuracy In order to solve the in-stable system problem multi-feature clustering (MFC) is used to setup robust music DB. In addition, the music retrieval speed was improved by using the Superclass concept. Effectiveness of the system with SuperClass and without SuperClass is compared in terms of retrieval speed, accuracy and retrieval precision. It is demonstrated that the use of WC and Superclass substantially improves music retrieval speed up to $20\%\~40\%$ while maintaining almost equal retrieval accuracy.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.426-429
• /
• 1999

Many similar class components are stored in object-storage but the object-storage has needed the retrieval function of correct component for reuse. Accordingly this paper designed the class component retrieval viewer of the object-storage by using the improved spreading activation strategy. Object-storage has made up of information of inheritance relation, superclass, subclass, and we defined the queries about each class function. Also we specified connectionist relaxation of the each class and query, finally we gained retrieval result which showed highest activation value order of class component information including the query function.

• Annual Conference of KIPS
• /
• 2002.11c
• /
• pp.2031-2034
• /
• 2002

소프트웨어가 대형화되고 복잡해짐에 따라 개발 과정에서 많은 요구사항이 발생되고 변화가 일어난다. 이러한 상황에서 소프트웨어는 유연성을 지니고 요구사항을 충족시켜야 한다. 그러나 추후에 발생할 요구사항을 모두 예견하고 충족시키는 것은 불가능하다. 이를 위해 기존 소프트웨어를 재사용하고 유연성을 높일 수 있도록 소프트웨어의 리펙토링(refactoring)을 해주어야 한다. 리펙토링은 행동(behavior) 변화가 없이 보호하고 소프트웨어를 효율적이고 유지보수가 쉽도록 전환하는 과정이다. 리펙토링에서 추상 슈퍼클래스 (abstract superclass)의 생성과 디자인 패턴을 이용함으로써 소프트웨어의 재사용성을 높여주고 유연성을 제공해 줄 수 있다. 본 논문에서는 사례 연구로써 표준프로파일 제공시스템의 통합검색부분에 추상 슈퍼클래스의 추출 및 생성, 디자인 패턴, 기존 프로그램의 합성 등의 방법을 적용하여 리팩토링을 하도록 한다.

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.329-336
• /
• 1998

The class of doubly chordal graphs is a subclass of chordal graphs and a superclass of strongly chordal graphs which arise in so many application areas. Many optimization problems like domination and Steiner tree are NP-complete on chordal graps but can be solved in polynomial time on doubly chordal graphs. The central to designing efficient algorithms for doulby chordal graphs is the concept of (canonical)doubly perfect elimination orderings. We present linear time algorithms to compute a (canonical) double perfect elimination ordering of a doubly chordal graph.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.6 no.4
• /
• pp.37-50
• /
• 2003

In the paper, we describe the query extension techniques for spatiotemporal query functionalities on object-relational DBMS. The spatial objects in real world change the shapes over time. Spatiotemporal databases support to manage a temporal dimension as well as a spatial dimension for history of the objects. The proposed techniques can make conventional object-relational databases to support spatiotemporal databases system by the implementation and inheritance of abstract data types. We define and implement spatial and temporal classes as superclass. And, spatiotemporal classes inherits and extends the classes. The proposed extensions make it easy that conventional database systems not only are transformed into the spatiotemporal database systems, but also do not need to be changed to support spatiotemporal applications.

• Journal of Internet Computing and Services
• /
• v.19 no.5
• /
• pp.107-113
• /
• 2018

Object-oriented databases (OODBs) canbe used for many non-traditional database application areas such as computer-aided design, etc. Usually those application areas require advanced modeling power for expressing complicated relationships among data sets. OODBs have more distinguished features than the traditional relational database systems. One of the distinguished characteristics of OODBs is class hierarchy (also called inheritance hierarchy). A class hierarchy in an OODB means that a class can hand down the definitions of the class to the subclass of the class. In other words, a class is allowed to inherit the definitions of the class from the superclass. In this paper, we present performance evaluation metrics for class hierarchy in OODBs from a concurrency control perspective. The proposed performance metrics are developed to determine which concurrency control scheme in OODBs can be used for a given class hierarchy. In this study, in order to develop performance metrics, we use class hierarchy structure (both of single inheritance and multiple inheritance), and data access frequency for each class. The proposed performance metrics will be also used to compare performance evaluation for various concurrency control techniques.