• 한국멀티미디어학회논문지
• /
• 제6권4호
• /
• pp.736-745
• /
• 2003

Traditional slicing techniques make slices through dependence graphs. They also improve the accuracy of slices. However, traditional slicing techniques require many vertices and edges in order to express a data communication link because they are based on static slicing techniques. Therefore the graph becomes very complicated, and size of the slices is larger. We propose the representation of a dynamic object-oriented program dependence graph so as to process the slicing of object-oriented programs that is composed of related programs in order to process certain jobs. We also propose an efficient slicing algorithm using the relations of relative tables in order to compute dynamic slices of object-oriented programs. Consequently, the efficiency of the proposed efficient dynamic object-oriented program dependence graph technique is also compared with the dependence graph techniques discussed previously As a result, this is certifying that an efficient dynamic object-oriented program dependence graph is more efficient in comparison with the traditional object-oriented dependence graphs and dynamic object-oriented program dependence graph.

• 한국산업정보학회:학술대회논문집
• /
• 한국산업정보학회 2008년도 추계 공동 국제학술대회
• /
• pp.651-655
• /
• 2008

Traditional slicing techniques make slices through dependence graphs. They also improve the accuracy of slices. However, traditional slicing techniques require many vertices and edges in order to express a data communication links. Therefore the graph becomes complicated, and size of the slices is larger. We propose the representation of a dynamic object-oriented program dependence graph so as to process the slicing of object-oriented programs that is composed of related programs in order to process certain jobs. The efficiency of the proposed efficient dynamic object-oriented program dependence graph technique is also compared with the dependence graph techniques discussed previously. As a result, this is certifying that an efficient dynamic object-oriented program dependence graph is more efficient in comparison with the traditional dynamic object-oriented program dependence graph.

• 한국멀티미디어학회논문지
• /
• 제7권10호
• /
• pp.1485-1495
• /
• 2004

본 논문에서는 효율적인 동적 객체지향 프로그램 슬라이싱을 구현하기 위한 개선된 동적 객체지향 프로그램 종속 그래프 기법 을 제안하였고, 이 그래프를 이용한 동적 객체지향 프로그램 슬라이싱 구현 단계를 제안하였다. 이 구현 단계는 프로그램 노드 분석 단계, 프로그램 실행이력 분석 단계, 동적 객체지향 프로그램 종속 그래프 작성 단계 그리고, 프로그램 슬라이스 작성 단계 등 모두 4단계로 구성되어 있다. 본 논문에서 제시한 기법이 정확함을 보이기 위해 본 논문에서 제시한 알고리즘을 실제 구현하였다. 구현 프로그램은FORTRAN과 VISUAL C++를 사용하였다. 그리고, 본 논문에서 제안한 동적 객체지향 프로그램 슬라이싱 기법이 기존의 객체지향 프로그램 슬라이싱 기법과 기존의 동적 객체지향 프로그램 슬라이싱 기법에 비해 효율적임을 보이기 위해 그래프의 복잡도를 측정하여 비교하였다. 그리고, 프로그램 슬라이스의 크기도 함께 측정하여 본 논문에서 제시한 기법이 효율적임을 증명하였다.

• International Journal of Computer Science & Network Security
• /
• 제24권5호
• /
• pp.33-39
• /
• 2024

In a previous study we proceeded to the remodularization architecture based on classes and packages using the Formal Concept Analysis (FCA)[13] [14] [30]. we then got two possible remodularized architectures and we explored the issue of redistributing classes of a package to other packages, we used an approach based on Oriented Graph to determine the packages that receive the redistributed classes and we evaluated the quality of a remodularized software architecture by metrics [31] [28] [29]. In this paper, we will address the issue of the efficiency of the Oriented Graph in the remodularization of software architectures compared to the Formal Concept Analysis FCA method. The formal method of FCA concept is not popularized among scientists as opposed to the use of the labeled directed graph. It is for this reason that our directed graph approach is more effective in its simplicity and popularity.

• 한국정보처리학회논문지
• /
• 제5권10호
• /
• pp.2567-2574
• /
• 1998

소프트웨어 공학 기법과 툴들은 제어 흐름 그래프, 프로그램 종속성 그래프, 시스템 종속성 그래프와 같은 프로그램의 그래픽한 표현에 의존한다. 본 논문은 기존의 객체지향 프로그램의 표현방법의 복잡하고 중복된 표현의 문제점을 개선하여 새로운 객체 지향 프로그램 종속성 그래프를 제안한다. 객체지향 프로그램 종속성 그래프는 클래스 종속성 그래프와 클래스 계층구조 그래프, 그리고 프로시듀어 종속성 그래프로 구성된다. 제안된 객체지향 프로그램 종속성 그래프는 기존의 방법에 비해 그 표현이 간결할 뿐만 아니라, 쉽게 확장이 가능하여 프로그램이 점진적으로 개발되는 경우에도 사용할 수 있다. 뿐만 아니라 프로그램에 대한 동적 정보를 제공할수 있도록 확장될 수 있다.

• Journal of applied mathematics & informatics
• /
• 제23권1_2호
• /
• pp.257-268
• /
• 2007

An oriented graph is a digraph with no symmetric pairs of directed arcs and without loops. The score of a vertex $v_i$ in an oriented graph D is $a_{v_i}\;(or\;simply\;a_i)=n-1+d_{v_i}^+-d_{v_i}^-,\;where\; d_{v_i}^+\;and\;d_{v_i}^-$ are the outdegree and indegree, respectively, of $v_i$ and n is the number of vertices in D. In this paper, we give a new proof of Avery's theorem and obtain some stronger inequalities for scores in oriented graphs. We also characterize strongly transitive oriented graphs.

• 한국정보시스템학회지:정보시스템연구
• /
• 제5권
• /
• pp.149-173
• /
• 1996

This paper focus on the development of object-oriented model bases for Structured Modeling. For the model base organization, object modeling techniques and model typing concept which is similar to data typing concept are used. Structured modeling formalizes the notion of a definitional system as a way of dscribing models. From the object-oriented concept, a structured model can be represented as follows. Each group of similar elements(genus) is represented by a composite class. Other type of genera can be represented in a similar manner. This hierarchical class composition gives rise to an acyclic class-composition graph which corresponds with the genus graph of structured model. Nodes in this graph are instantiated to represent the elemental graph for a specific model. Taking this class composition process one step further, we aggregate the classes into higher-level composite classes which would correspond to the structured modeling notion of a module. Finally, the model itself is then represented by a composite class having attributes each of whose domain is a composite class representing one of the modules. The resulting class-composition graph represent the modular tree of the structured.

• 정보처리학회논문지D
• /
• 제9D권6호
• /
• pp.991-998
• /
• 2002

본 논문에서는 XML 데이터와 같은 비구조적인 데이터 처리와 추론을 필요로 하는 의미 웹(semantic web) 구축에 유리한 연역 객체 지향 데이터베이스(Deductive and Object-oriented Database) 언어구현을 통해 XML 데이터 처리에 대해 알아본다. 대량 문서 관리와 데이터 교환에 가장 유용한 마크업 언어로 알려진 XML을 이용하여 XML 데이터 모델을 연역객체지향 데이터베이스 모델로 바꾸는 방법에 대해 알아본 다음 이 연역객체 지향 데이터베이스를 다시 Connection Graph로 바꾸고 Connection Graph Resolution을 이용하여 어떻게 질의에 답할 수 있는지를 기술한다. 또한 데이터베이스 내의 계층 지식을 이용하여 효율적이면서도 같은 답을 주는 질의로 바꾸는 방법을 제시하고 이 방법이 효율적이며 논리적으로 타당하다는 점을 증명한다.

• Journal of Electrical Engineering and information Science
• /
• 제1권1호
• /
• pp.164-172
• /
• 1996

The partitioning of related objects should be performed before clustering for an efficient access in object-oriented databases. In this paper, a horizontal partition of related objects in object-oriented databases is presented. All subclass nodes in a class inheritance hierarchy of a schema graph are shrunk to a class node in the graph that is called condensed schema graph because the aggregation hierarchy has more influence on the partition than the class inheritance hierarchy. A set function and an accessibility function are defined to find a maximal subset of related objects among the set of objects in a class. A set function maps a subset of the domain class objects to a subset of the range class objects. An accessibility function maps a subset of the objects of a class into a subset of the objects of the same class through a composition of set functions. The algorithm derived in this paper is to find the related objects of a condensed schema graph using accessibility functions and set functions. The existence of a maximal subset of the related objects in a class is proved to show the validity of the partition algorithm using the accessibility function.

• 한국통계학회:학술대회논문집
• /
• 한국통계학회 2003년도 춘계 학술발표회 논문집
• /
• pp.85-90
• /
• 2003

In this paper we develop a method for finding optimal ordering of K statistical models. This is based on a dependent paired comparison experimental arrangement whose results can naturally be represented by a completely oriented graph (also so called tournament graph). Introducing preference probabilities, strong transitivity conditions, and an optimal criterion to the graph, we show that a Hamiltonian path obtained from row sum ranking is the optimal ordering. Necessary theories involved in the method and computation are provided. As an application of the method, generalized variances of K multivariate normal populations are compared by a Bayesian approach.