• The KIPS Transactions:PartD
• /
• v.8D no.6
• /
• pp.853-860
• /
• 2001

In the object-oriented software development, redesigning of classes and reorganizing of class hierarchy structures should be necessary to reduce many of the headaches of object-oriented software design and maintenance. To support this task, in this paper, we propose a theoretical foundation for class hierarchy reorganizations that is relatively complete, correct, formal and easy to understand and use. We introduce the flattened class hierarchy that characterizes the class hierarchy structures in object-oriented software evolution. And we also present an algorithm which transforms a given class hierarchy into the normalized form. The flattened class hierarchy helps us map the inheritance and aggregation paths in a class hierarchy to paths in an object hierarchy that is an instance of the class hierarchy. By applying the algorithm into a given class hierarchy, we can make a new, object-preserved, and flattened class hierarchy that is the cornerstone for reorganization of class hierarchy structure and plays an important role as a bridge on the incremental evolutionary changes and reuse of object-oriented software to reorganize class hierarchies.

• The KIPS Transactions:PartD
• /
• v.11D no.7 s.96
• /
• pp.1443-1450
• /
• 2004

The clustering characteristics for a number of classes, and defining the inheritance relations between the classes is a difficult and complex problem in an early stage of object oriented software development. We discuss a traditional iterative approach for the reuse of the existing classes in a library and an integrated approach to creating a number of new classes presented in this study. This paper formulates a character-istic clustering problem for zero-one integer programming and presents a network solution method with illustrative examples and the basic rules to define the inheritance relations between the classes. The network solution method for a characteristic clustering problem is based on a distance parameter between every pair of objects with characteristics. We apply the approach to a real problem taken from industry.

• Annual Conference of KIPS
• /
• 2004.11a
• /
• pp.275-278
• /
• 2004

객체지향 프로그램에 있어 클래스계층구조는 프로그램의 뼈대가 된다. 따라서 이러한 클래스계층구조를 얼마나 잘 만드느냐에 따라 프로그램의 품질이 좌우된다. 그러나 좋은 품질의 클래스계층구조를 구축하는 작업은 객체지향 초보자에게는 쉬운 일이 아니다. 본 논문에서는 FCA(Formal Concept Analysis)기법을 이용하여 클래스계층구조 설계 도구를 BlueJ 의 확장기능으로 구현하였다. 본 연구결과는 객체지향 프로그래밍 초보자들이 클래스계층구조를 보다 수월하게 설계함으로써 좀 더 좋은 프로그램을 작성 할 수 있는 지원도구로서 제공될 수 있다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.05c
• /
• pp.210-214
• /
• 2002

본 논문에서는 효율적인 이미지 분할을 위한 객체지향 모델링 방법을 제시한다. 이를 위하여 분할 객체와 자료구조를 제시하며 각각의 객체들을 위한 클래스 계층 구조를 나타낸다. 또한 객체의 부분에 대한 계층구조는 물론 객체의 기하학적인 표현을 위한 표현 클래스도 제시한다. 결론적으로 이미지 객체에 대한 시스템 독립적 이미지 분할을 위한 클래스 계층 구조를 객체지향 방법으로 제시하였다.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.5
• /
• pp.1185-1203
• /
• 1998

When the class is added of deleted in object-oriented system, restructuring of class hierarchy is needed which enables new relationship with classes. But existing system requires much additional analysis costs because it is difficult to know the meaning between parent class and child class. This paper presents the updates method based on semantic modification through new relationship classification method. This method measures the similarity of classes and based on it's relationship, this method restructures class hierarchy by classifying not-equality, part-of, equality, inclusion, subset relation. This method can minimize the probability of meaning error for classes when the class hierarchy is changed. Also this enhances the reusability and understandability through various graphic and text processing.

• The KIPS Transactions:PartD
• /
• v.10D no.5
• /
• pp.859-872
• /
• 2003

Class hierarchies often constitute the backbone of object-oriented software. Their quality is therefore quite crucial. Building class hierarchies with good qualify is a very important and common tasks on the object oriented software development, but such hierarchies are not so easy to build. Moreover, the class hierarchy structure under construction is frequently restructured and refined until it becomes suitable for the requirement on the iterative and incremental development lifecycle. Therefore, there has been renewal of interest in all methodologies and tools to assist the object oriented developers in this task. In this paper, we define a set of quantitative metrics which provide a wav of capturing features of a rough estimation of complexity of class hierarchy structure. In addition to, we suggest a set of algorithms that transform a original class hierarchy structure into reorganized one based on the proposed metrics for class hierarchy structure. Furthermore, we also prove that each algorithm is "object-preserving". That is, we prove that the set of objects are never changed before and after applying the algorithm on a class hierarchy. The technique presented in this paper can be used as a guidelines of the construction, restructuring and refinement of class hierarchies. Moreover, the proposed set of algorithms based on metrics can be helpful for developers as an useful instrument for the object-oriented software development.velopment.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.511-513
• /
• 1998

본 연구에서는 Object Modeling Technique를 기반으로 C++ 원시코드로부터 클래스 계층구조의 정보를 추출하여 데이터베이스에 저장하고 계층구조를 이해하기 위한 클래스 계층구조를 디자인으로 도식화하여 이를 다시 디자인 상태에서 C++ 원시코드와 동적 연결이 가능한 역공학 도구를 제안한다. 본 연구는 C++ 원시코드와 클래스 계층 구조를 표현하는 디자인과 상호 동적 연결이 가능하므로 C++원시코드의 이해와 관리가 효율적이다.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.1
• /
• pp.86-96
• /
• 1998

The class hierarchy structure in an object-oriented design model is effective to the software reusabilily and lhe design of complex syslem. This paper suggests lhe objecl-orienled class hierarchy structure design melhod using lhe rapid prololyping lechniques. In this method, relationship recognition and similarity are estimated by the new class classification in object modeling level. Then lhe estimation of aUribute and method in class is needed. Each design module such as class hierarchy struclure which is generaled wilh inleractive and repealed work consisls of reference relationship, inheritance relationship and composite relationship. These information are slored in lhe table to maintenance lhe program and implementation, the class relationship is represented with graph and the node class is iconized. This method is effective in reslructuring of class hierarchy are reusing of design information, because of addition of new class and deletion with ease. The efficiency of syslem analysis, design and implementation is enhanced by converting into prololype system and real system.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.589-602
• /
• 1999

There are some advantages of developing applications based on the object oriented concepts. One os them is that it is possible to reuse the existing designs and products. This paper provides a formal method for the reorganization of class hierarchies for the object extension in the object oriented design phase. In this paper, we introduce classes, and edges to represent the inheritance and aggregation relationship between classes. Based on the graph, we define an order relation(called the object extension) between class hierarchy graphs. And also we present a set of five basic transformations preserving the object extension relation. The set is proven to be correct and complete. The results of this paper help form a theoretical basis for the extension and reorganization object-oriented application systems.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.352-354
• /
• 1999

본 논문에서는 객체지향 데이터베이스의 중포된 객체에 대한 질의처리를 효율적으로 지원하기 위한 다차원 중포 속성 색인기법을 제안한다. 중포된 객체에 대한 기존의 색인기법들은 일차원 색인구조를 이용함으로써 중포된 객체의 속성과 클래스 계층이 포함된 다양한 형태의 질의들에 대한 처리를 효율적으로 지원하지 못하는 문제점을 가지고 있다. 다차원 중포 속성 색인기법에서는 다차원 파일구조를 이용하여 중포 속성의 킷값 도메인과 함께 중포 속성을 표현하는 경로상의 모든 속성에 대해 각 속성이 정의된 클래스 계층마다 클래스 식별자 도메인을 할당함으로써, 다차원 도메인 공간상에서 색인 엔트리들의 클러스터링을 다른다. 따라서, 다차원 중포속성 색인기법에서는 기존의 색인기법에서 지원하기 어려운 질의의 대상 범위가 클래스 계층상의 임의의 클래스들로 제한되거나, 질의에 포함된 복합 속성들의 도메인이 클래스 계층상의 임의의 클래스들로 제한되는 경우에도 효율적으로 지원할 수 있다.