• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.815-820
• /
• 2000

Variable Reference Graph 는 C 언어로 작성된 프로그램으로부터 상호 절차적인 자료 흐름 분석 정보를 수평적 방향 그래프(directed graph)로 자동 생성해주는 역공학(reverse engineering) 도구들 중 하나이다. 본 논문에서는 판독성 있는 구조적 정보를 제공하기위한 그래픽 표현의 전략을 바탕으로 JAVA 로 구현된 그래픽 사용자 인터페이스(graphic user interface) 및 그래프 레이아웃 알고리즘(graph layout algorithm)을 기술한다. 이 알고리즘은 4 단계로 구성되어 있다: 정보 모형, 레벨 알고리즘, 순서 알고리즘, 위치 알고리즘. 각 단계별에서 수행되는 주요 알고리즘을 살펴 본다. 특히, 이 알고리즘들은 사이클(cycle) 및 비사이클(acyclic) 방향 그래프, 그리고 트리(tree)를 수평적 계층 구조를 생성하는데 사용될 수 있다. 본 논문에서 구현된 Variable Reference Graph 는 소프트웨어 재공학 도구를 개발하는 RESORT(RESearch on object-oriented SOftware Reengineering Technology) 과제에서 개발되었다.

• Journal of Korea Entertainment Industry Association
• /
• v.14 no.4
• /
• pp.349-354
• /
• 2020

This paper, firstly, propose a new Clustering scheme Based on Conceptual graphs (CBC) that can describe objects freely and can perform clustering efficiently. The conceptual clustering is one of machine learning technique. The similarity among the objects in conceptual clustering are decided on the bases of concept membership, unlike the general clustering scheme which decide the similarity without considering the context or environment of the objects. A new conceptual clustering scheme, CBC, which can perform efficient conceptual clustering by describing various objects freely with conceptual graphs is introduced in this paper.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.6
• /
• pp.91-98
• /
• 2009

In this paper, this model ensures confidentiality and integrity of mandatory access cotrol policy which based on fuzzy function with importance of information. And it solves authorization abuse problem through role graph creation algorithm and flowing policy that security grade is applied. Because this model composes role hierarchy which bind similar role concept to apply to commercial environment, it has expansile advantage by large scale security system as well as is easy that add new role.

• Review of KIISC
• /
• v.33 no.3
• /
• pp.59-71
• /
• 2023

현재 국내에서는 양자내성암호 자체 기술 확보를 위해 양자내성암호 공모전인 KpqC 공모전이 진행되고 있다. KpqC 공모전을 통해 제안된 암호 알고리즘은 총 16종으로 격자 기반-8종, 코드 기반-4종, 그래프 기반-1종, 다변수기반-1종, 아이소제니 기반-1종, 영지식 기반-1종과 같이 구성되어 있으며, 1라운드를 통해 안전성 및 효율성에 대한 평가가 수행되고 있다. 본 논문에서는 KpqC 공모전 1라운드 암호 중 그래프, 다변수, 영지식, 아이소제니 기반 암호 알고리즘를 소개하고 설계원리, 동작과정과 안전성 및 효율성에 대하여 살펴보고자 한다.

• Journal of the Society of Naval Architects of Korea
• /
• v.38 no.2
• /
• pp.79-86
• /
• 2001

This study shows an attempt to generate an assembly sequence and its model for a ship block assembly using the graph theory and graph algorithms. To generate the ship block assembly, we propose four levels of the ship block assembly model such as "geometry mode1", "relational model", "sequential mode1", and "hierarchical model". To obtain the relational model, we used surface and surface intersection algorithm. The sequential model that represents a possible assembly sequence is made by using several graph algorithms from the relational model. The hierarchical model will be constructed from the sequential model in order to represent the block assembly tree and so forth. The purpose of the hierarchical model is to define an assembly tree and to generate the Bill Of Material(BOM). Lastly, the validity of the method proposed in this study is examined with application to ship block assembly models of a single type and double type according to four models mentioned above.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.11a
• /
• pp.27-31
• /
• 2010

본 논문에서는 하이퍼그래프의 고유벡터를 척도로 하여 fMRI기반 Brain Network를 분석하여 중요한 허브노드를 찾는 방법론을 제시한다. 이 방법을 비디오게임을 수행하면서 촬영한 기능적 자기뇌영상(fMRI) 데이터인 PBAIC 2007 데이터셋에 대하여 그 유용성을 검증하였다. 이 데이터는 각 20분씩 세 세션을 촬영한 것이며 처음 두 세션에는 13가지의 감정 항목의 평가치가 각 스캔마다 주어진다. 한 피험자의 첫번째 세션 데이터로부터 13가지 감정 항목에 대하여 상관관계가 높은 각각의 복셀(voxel)들을 추출하였다. 이 13가지의 복셀들의 집합들을 각각 하이퍼에지로 보고 하이퍼그래프를 구성하였다. 하이퍼그래프로부 터 인접 행렬(adjacency matrix)를 구성한 후 고유치(eigenvalue)와 고유벡터(eigenvector)를 구하였다. 여기서 고유치가 가장 큰 고유벡터의 원소들은 각 복셀들의 중앙성(centrality), 즉 중요성을 나타내며 이로부터 감정과 관련된 중요한 허브 복셀들과 그들의 국소적 집합인 모듈을 찾았다. 모듈들은 감정 및 작업기억(working memory)과 관련된 뇌 영역들의 클러스터(cluster)로 추정된다.

• Journal of Korea Multimedia Society
• /
• v.17 no.1
• /
• pp.34-42
• /
• 2014

In this paper an embedding algorithm based on commute time is implemented by organizing patches according to the graph-based metric, and its performance is analyzed by comparing with the results of principal component analysis embedding. It is usual that the dimensionality reduction be done within some acceptable approximation error. However this paper shows the proposed manifold embedding method generates the intrinsic geometry corresponding to the signal despite severe approximation error, so that it can be applied to the areas such as pattern classification or machine learning.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2430-2441
• /
• 2000

A visual concurrent programming environment, called ESTGVP is designed and implemented, which is easy to understand, highly portable, and can represent parallel behaviors. For our purpose, a conventional state transition graph is extended so as to enable both of synchronous and asynchronous parallel operations. We call it extended state transition graph (ESTG). ESTGVP uses the ESTG and texts for programming, and makes it easy programming sequential and parallel behaviors. Also, it is easy to understand the control structure of a program because ESTGVP is a visual programming environment based on the graph. ESTGVP is written in Tel language and thus it is highly portable on various operating systems. It consists of three major components; edition, transformation and execution. If necessary, ESTG can be transformed into C or Tel language, and its execution is based on Tel.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.461-465
• /
• 2002

When general software system wants to need continuous Dept of Software Engineering by discovery of specification imperative sentence in some program, programmer analyzes program through practice orbit chase of program about value of input data. This paper that see therefore applies object intention program Slicing to existent program Slicing method, and express practice orbit of program in object intention subordination graph and show process that become Slicing. Proposed algorithm defenses crab extension is possible and can be used advantageously in case program is developed gradually as well as.

• Journal of the Korean School Mathematics Society
• /
• v.25 no.1
• /
• pp.79-104
• /
• 2022

It is very important to help students learn by examining how well students solve math problems. Therefore, in this study, four methods(error analysis by problem type, schematization analysis, area graph analysis, and broken line graph analysis) were constructed to analyze how the connectivity between concepts of middle school functions affects the problem solving results. The students' learning situation was visually expressed to enable intuitive understanding. This analysis method makes it easy to understand the evaluation results of students. It can help students learn by understanding their learning situation. It will be useful in mathematics teaching and learning as it can help students to monitor their own problems and make a self-directed learning plan.