• Title/Summary/Keyword: Oriented graph

Search Result 98, Processing Time 0.025 seconds

GROBNER-SHIRSHOV BASES FOR IRREDUCIBLE sp4-MODULES

  • Lee, Dong-Il
    • Journal of the Korean Mathematical Society
    • /
    • v.45 no.3
    • /
    • pp.711-725
    • /
    • 2008
  • We give an explicit construction of Grobner-Shirshov pairs and monomial bases for finite-dimensional irreducible representations of the simple Lie algebra $sp_4$. We also identify the monomial basis consisting of the reduced monomials with a set of semistandard tableaux of a given shape, on which we give a colored oriented graph structure.

THE GEODETIC NUMBER OF A GRAPH

  • Kim, Byung-Kee
    • Journal of applied mathematics & informatics
    • /
    • v.16 no.1_2
    • /
    • pp.525-532
    • /
    • 2004
  • For two vertices u and v of an oriented graph D, the set I(u, v) consists of all vertices lying on a u-v geodesic or v-u geodesic in D. If S is a set of vertices of D, then I(S) is the union of all sets 1(u, v) for vertices u and v in S. The geodetic number g(D) is the minimum cardinality among the subsets S of V(D) with I(S) = V(D). In this paper, we give a partial answer for the conjecture by G. Chartrand and P. Zhang and present some results on orient able geodetic number.

Change Impact Analysis for Object-Oriented softwares in the distributed environment (분산 객체지향 소프트웨어를 위한 수정 영향 분석)

  • Kim, Kyung-Hee;Park, Jai-Nyun;Yoon, Yong-Ik
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.5
    • /
    • pp.1280-1290
    • /
    • 1999
  • Applying the change impact analysis to the distributed environment is not straightforward since it is based on the centralized system environment. In this paper, we investigate the change impact analysis of object-oriented shoftwares in the distributed environment. We first, categories the types of changes common in object-oriented software into three sets: data, method, and class level changes. We, then, analyze the impact of each set of changes and represent it in the form of a DPDG. A DPDG is a graph showing relationship of object oriented softwares - with data elements. classes, design documents, servers - in the distributed environment. DPDG searches element of software to retest when the software is changed. Thus, DPDG saves effort of software to retest. In this paper, We propose the table of firewall for retest elements that be discovered by DPDG and implement the table of firewall. The table of firewall is used VIST that we design a software testing tool. The VIST utilizes the minimized firewall, then saves efforts and costs of retesting for distributed object-oriented software.

  • PDF

Introduction to S-PLUS and graphical comparison with SAS (S-PLUS의 소개 및 SAS 와의 그래픽 비교)

  • 김성수;한경수
    • The Korean Journal of Applied Statistics
    • /
    • v.6 no.1
    • /
    • pp.1-11
    • /
    • 1993
  • Statistical graphics have been important new tools for data analysis and many statistical softwares are exploiting graphical methods. Among these softwares available in personal computer at low cost, we intriduce S-PLUS(version 2.0). S-PLUS is an interactive graphical data analysis system and object-oriented programming language. SAS/GRAPH is another popular graphical system for displaying data in the form of color plots, charts, maps, and slides on screen and hardcopy devices. S-PLUS is compared to SAS/GRAPH(version 6.04) in viewpoints of statistical graphics.

  • PDF

Knowledge Conversion between Conceptual Graph Model and Resource Description Framework

  • Kim, Jin-Sung
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.1
    • /
    • pp.123-129
    • /
    • 2007
  • On the Semantic Web, the content of the documents must be explicitly represented through metadata in order to enable contents-based inference. In this study, we propose a mechanism to convert the Conceptual Graph (CG) into Resource Description Framework (RDF). Quite a large number or representation languages for representing knowledge on the Web have been established over the last decade. Most of these researches are focused on design of independent knowledge description. On the Semantic Web, however, a knowledge conversion mechanism will be needed to exchange the knowledge used in independent devices. In this study, the CG could give an entire conceptual view of knowledge and RDF can represent that knowledge on the Semantic Web. Then the CG-based object oriented PROLOG could support the natural inference based on that knowledge. Therefore, our proposed knowledge conversion mechanism will be used in the designing of Semantic Web-based knowledge representation and inference systems.

A Knowledge Graph of the Korean Financial Crisis of 1997: A Relationship-Oriented Approach to Digital Archives (1997 외환위기 지식그래프: 디지털 아카이브의 관계 중심적 접근)

  • Lee, Yu-kyeong;Kim, Haklae
    • Journal of Korean Society of Archives and Records Management
    • /
    • v.20 no.4
    • /
    • pp.1-17
    • /
    • 2020
  • Along with the development of information technology, the digitalization of archives has also been accelerating. However, digital archives have limitations in effectively searching, interlinking, and understanding records. In response to these issues, this study proposes a knowledge graph that represents comprehensive relationships among heterogeneous entities in digital archives. In this case, the knowledge graph organizes resources in the archives on the Korean financial crisis of 1997 by transforming them into named entities that can be discovered by machines. In particular, the study investigates and creates an overview of the characteristics of the archives on the Korean financial crisis as a digital archive. All resources on the archives are described as entities that have relationships with other entities using semantic vocabularies, such as Records in Contexts-Ontology (RiC-O). Moreover, the knowledge graph of the Korean Financial Crisis of 1997 is represented by resource description framework (RDF) vocabularies, a machine-readable format. Compared to conventional digital archives, the knowledge graph enables users to retrieve a specific entity with its semantic information and discover its relationships with other entities. As a result, the knowledge graph can be used for semantic search and various intelligent services.

Improved Dynamic Object-Oriented Dependence Graph (개선된 동적 객체지향 종속 그래프)

  • 박순형;박만곤
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2004.05a
    • /
    • pp.806-809
    • /
    • 2004
  • 동적 객체지향 프로그램 슬라이싱을 구현하기 위해서 프로그램 종속 그래프가 필요하다. 본 논문에서는 기존의 동적 객체지향 프로그램 종속 그래프 기법 보다 효율적인 동적 객체지향 프로그램 종속 그래프 기법을 제안하였다. 본 논문에서 제안한 기법이 기존에 비해 효율적임을 보이기 위해 그래프의 복잡도를 측정하여 비교하였다. 그리고 프로그램 슬라이스의 크기도 함께 측정하여 본 논문에서 제시한 기법이 효율적임을 증명하였다.

  • PDF

Comparison of TERGM and SAOM : Statistical analysis of student network data (TERGM과 SAOM 비교 : 학생 네트워크 데이터의 통계적 분석)

  • Yujin Han;Jaehee Kim
    • The Korean Journal of Applied Statistics
    • /
    • v.36 no.1
    • /
    • pp.1-19
    • /
    • 2023
  • The purpose of this study was to find out what attributes are valid for the edge between students through longitudinal network analysis, and the results of TERGM (temporal exponential random graph model) and SAOM (stochastic actor-oriented model) statistical models were compared. The TERGM model interprets the research results based on the edge formation of the entire network, and the SAOM model interprets the research results on the surrounding networks formed by specific actors. The TERGM model expressed the influence of a previous time through a time term, and the SAOM model considered temporal dependence by implementing a network that evolves by an actor's opportunity as a ratio function.

A Method of Object Identification from Procedural Programs (절차적 프로그램으로부터의 객체 추출 방법론)

  • Jin, Yun-Suk;Ma, Pyeong-Su;Sin, Gyu-Sang
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.10
    • /
    • pp.2693-2706
    • /
    • 1999
  • Reengineering to object-oriented system is needed to maintain the system and satisfy requirements of structure change. Target systems which should be reengineered to object-oriented system are difficult to change because these systems have no design document or their design document is inconsistent of source code. Using design document to identifying objects for these systems is improper. There are several researches which identify objects through procedural source code analysis. In this paper, we propose automatic object identification method based on clustering of VTFG(Variable-Type-Function Graph) which represents relations among variables, types, and functions. VTFG includes relations among variables, types, and functions that may be basis of objects, and weights of these relations. By clustering related variables, types, and functions using their weights, our method overcomes limit of existing researches which identify too big objects or objects excluding many functions. The method proposed in this paper minimizes user's interaction through automatic object identification and make it easy to reenginner procedural system to object-oriented system.

  • PDF

The class testing based on a dependence graph (종속성 그래프 기반 클래스 테스팅)

  • Im, Dong-Ju;Bae, Sang-Hyun
    • Journal of Internet Computing and Services
    • /
    • v.1 no.1
    • /
    • pp.105-113
    • /
    • 2000
  • The representation of a procedural program cannot be applied directly to object oriented program representation consisting of class, object, inheritance, and dynamic binding. Furthermore, preexisting program dependence represented the dependence among statements, but not among variables. That is, it could not solve the problem of which variables make an effect on given variables. Consequently, this study presents the method dependence model representing implementation level information including the dependence among variables in an object oriented program. I also propose implementation-based class testing technique based on the test adequacy criterion of an object-oriented program. Considering inter-data member dependences and a set of axioms for test data adequacy, it generates sequences of methods as test cases which satisfy a flow graph-based testing criterion. For a derived class testing, it considers inheritance relationship and the resuability of the testing information for its parent classes which verified the reduction of test cost through the experiment.

  • PDF