• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1693-1702
• /
• 1999

This paper proposes the use of an adaptive Wiener filter for edge-preserving image filtering. Images are partitioned into a set of blocks of pixels which is divided into five subsets of blocks according to their edge contents and orientations. Each subset of blocks is used to define a covariance matrix, from which a Wiener filter is derived. Five covariance matrices and Wiener filters are thus obtained. An image-block classifier using the five sets of covariance matrices of the class is designed to classify each incoming block of pixels according to its edge content in the presence of noise. Experimental results are included to verify the usefulness of the proposed method.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.3
• /
• pp.1-13
• /
• 2008

Gestwicki et. al. proposed the technique that detects and predicts the structure of object diagrams from class diagrams to get the improved drawing of object graphs. Their approach finds two predictable structures - recursive clusters and leaf clusters from class diagrams. Their approach is not practical to be applied to real programs, because the starting point is class diagram. In this work, we improve and implement their technique to apply to Java classes. We obtain the structure and relationships of classes and clusters extracted from class files. This information can be provided and used as a template of object graphs for Java execution visualization tools like JIVE.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.5
• /
• pp.1257-1266
• /
• 1997

The concepts of class, inheritance and information hicing and so on provide the great strengthes of object-oriented languages, but they also introduce diffculties in porfram analysis and understanding. Particulary, it is move difficult to umderstand the dyamic aspects than the static ones of object-oriented programs. The dyamicaspects can be understood by recognizing the event's reciprocal action among the classes. In this paper, it will be supplied to the reprecentation of event abstraction which is useful for understanding the object-oriented programs.And the clustering concept with the events will be applied to abstract the events. By clustering the events, user can get the information about function of the classes and the reteival of the class library.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2350-2364
• /
• 1999

In this paper, we propose a method of class library repository design for provide reuser the object-oriented C++ class component. To class library design, we started by studying the characteristics of a reusable component. We formally defined the reusable component model using an entity relationship model. This formal definition has been directly used as the database schema for storing the reusable component in a repository. The reusable class library may be considered a knowledge base for software reuse. Thus, we used that Enumerative classification of breakdown of knowledge based. And another used classification is clustering of based on class similarity. The class similarity composes member function similarity and member data similarity. Finally, we have designed class library for hierarchical inheritance mechanism of object-oriented concept Generalization, Specialization and Aggregation.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.6
• /
• pp.247-252
• /
• 2015

As software has gotten bigger in magnitude and the complexity of software has been increased, the maintenance has gained in-creasing attention for its significant impact on the cost. Identifiers have an impact on more than 90 percent of the readability which accounts for a majority portion of the maintenance activities. For this reason, the existing works focus on domain-specific features based on identifiers. However, their approaches have a limitation when either a class name does not reflect the intention of its context or a class naming is incorrect. Therefore, this paper suggests a series of class name validation process by extracting properties of classes, building learning model by applying a decision tree technique of machine learning, and generating a validation report containing the list of recommendable postfixes of classes to be validated. To evaluate this, four open source projects are selected and indicators such as precision, recall, and ROC curve present the value of this work when it comes to five specific postfixes including functional information on class names.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.4
• /
• pp.788-797
• /
• 2003

Class library is one of the most crucial element of Java runtime environment in addition to Java virtual machine. In particular, embedded Java system depends heavily on the class library due to having a low bandwidth communication link and a small amount of memory which are a common restriction of embedded system. It is therefore quite necessary to find the characteristic of the class library for embedded Java system to build an efficient Java runtime environment. In this paper we have analyzed the characteristic of the class library for embedded system. The analysis includes sorts of classes in the library, typical size of the file which contains the class, and the composition of constant pool which is a major part of the file. We also have found typical number of field and method a class contains, the sizes of stack and local variable array each method requires, and the length of bytecode in the method. The result of this study can be used to estimate the startup time for class loading and the size of memory to create an instance of class which are a mandatory information to design an efficient embedded Java virtual machine.

• Journal of KIISE:Software and Applications
• /
• v.26 no.9
• /
• pp.1095-1104
• /
• 1999

객체지향 시스템의 개발은 클래스를 통해서 이루어진다. 즉, 문제 영역에 존재하는 중요한 대상 또는 개념을 클래스로 모델링하고, 이로부터 생성된 객체들 사이의 메시지 교환을 통해서 시스템은 구축된다. 또한, 클래스는 정보 은닉을 제공함으로써, 객체지향 시스템의 재사용성과 유지보수성에 상당한 기여를 한다. 그러나, 설계 단계에서 실세계의 대상을 부적절하게 모델링하거나, 또는 유지보수 단계에서 클래스에 무분별한 변경을 가하는 경우 클래스의 품질은 악화될 수 있고, 이는 결국 시스템을 유지보수 하거나 확장하는데 상당한 장애를 초래한다.응집도는 모듈의 구성 요소들 사이의 연관성 정도를 나타내는 척도로서 전통적으로 모듈의 품질을 평가하기 위한 기준으로 사용되어 왔다. 이 논문에서는 클래스의 품질을 평가하는 방법으로서의 클래스 응집도를 제안한다. 즉, 클래스가 실세계의 대상을 적절하게 모델링한다면, 그 구성요소들 사이에 밀접한 관련이 있고 결국 높은 응집도를 가지게 될 것이다. 반대로 실세계의 대상에 대한 적절한 모델이 아니라면, 그 클래스의 구성 요소들 사이에는 밀접한 관련성이 없을 것이고 따라서 낮은 응집도를 보일 것이다.Abstract Object-oriented systems are developed by means of classes; that is, classes captures the essential entities or concepts in the problem domain, and the system is embodied by the interactions of objects instantiated from the classes. In addition to the basic units of object-oriented systems, classes serves as the units of encapsulation, which considerably promote the modifiability and the extensibility of them. However, improper modeling in the design phase or uncontrolled changes during the maintenance phase can degrade the quality of classes, which leads to systems cumbersome to maintain and extend.Cohesion refers to the degree of connectivity among the elements of a single module, and is being used as a factor which characterizes the quality of a module. In this paper, we propose a new cohesion metric for assessing the quality of classes. If a class captures properly the essential features of objects, the members of the class surely have strong relationship among them. On the contrary, the poor relationship among class members can indicate that the class is not a proper model of objects.

• 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.7 no.8
• /
• pp.2298-2309
• /
• 2000

This paper proposes the multidimensioa! nested attribute indexing techniques (MD- NAI) in object-oriented databases using a multidimensional index structure. Since most conventional indexing techniques for object oriented databases use a one-dimensional index stnlcture such as the B-tree, they do not often handle complex qUlTies involving both nested attributes and class hierarchies. We extend a tunable two dimensional class hierachy indexing technique(2D-CHI) for nested attributes. The 2D-CHI is an indexing scheme that deals with the problem of clustering ohjects in a two dimensional domain space that consists of a kev attribute dOI11'lin and a class idmtifier domain for a simple attribute in a class hierachy. In our extended scheme, we construct indexes using multidimensional file organizations that include one class identifier domain per class hierarchy on a path expression that defines the indexed nested attribute. This scheme efficiently suppoI1s queries that involve search conditions on the nested attribute represcnted by an extcnded path expression. An extended path expression is a one in which a class hierarchy can be substituted by an indivisual class or a subclass hierarchy in the class hierarchy.

• Journal of KIISE:Software and Applications
• /
• v.30 no.1_2
• /
• pp.73-80
• /
• 2003

The Java programming language is designed for developing effective applications in a heterogeneous network environment. Major problem in Java is its performance. many attractive features of Java make the development of software easy, but also make it expensive to support ; applications written in Java are often much slower than their counterparts written in C or C++. To use Java`s attractive features without the performance penalty, sophisticated optimizations and runtime systems are required. Optimising Java bytecode has several advantages. First, the bytecode is independent of any compiler that is used to generate it. Second, the bytecode optimization can be performed as a pre=pass to Just-In-Time(JIT) compilation. Many attractive features of Java make the development of software easy, but also make it expensive to support. The goal of this work is to develop automatic construction of code optimizer for Java bytecode. We`ve designed and implemented a Bytecode Optimizer that performs the peephole optimization, bytecode-specific optimization, and method-inlining techniques. Using the Classfile optimizer, we see up to 9% improvement in speed and about 20% size reduction in Java class files, when compared to average code using the interpreter alone.