• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.5
• /
• pp.1021-1030
• /
• 2021

This paper proposes S-CAFG(Stage-based Cyber Attack Flow Graph), a model for effectively describing training scenarios that simulate modern complex cyber attacks. On top of existing graph and tree models, we add a stage node to model more complex scenarios. In order to evaluate the proposed model, we create a complicated scenario and compare how the previous models and S-CAFG express the scenario. As a result, we confirm that S-CAFG can effectively describe various attack scenarios such as simultaneous attacks, additional attacks, and bypass path selection.

• The KIPS Transactions:PartD
• /
• v.8D no.3
• /
• pp.257-264
• /
• 2001

We developed a SIFG (Slice-based Information Graph), which modelled the information flow on program on the basis of the information flow of data tokens on data slices. Then we defied a SCM (Slice-based complexity measure), which measured the program complexity by measuring the complexity of information flow on SIFG. SCM satisfied the necessary properties for complexity measure proposed by Briand et al. SCM could measure not only the control and data flow on program but also the physical size of program unlike the existing measures.

• Korean Institute of Interior Design Journal
• /
• v.18 no.4
• /
• pp.97-104
• /
• 2009

This thesis analyzed arrangement and mixture method of function elements, which are getting more important in museum planning. It used quantitative method, Space Syntax and Visibility Graph Analysis tool to analyze five case museums. Through this analysis, advantages and disadvantages of two methods were derived and case museums' arrangement and mixture attributes were grasped. Results of the analysis were derived differently by two kinds of plan form which were room to room type and open type. Open typed museum recorded similar graphs of Integration, Visual Integration and Visual Connectivity. Since whole space structures were relatively simple and structure of exhibition halls were opened, the results of Space Syntax and Visibility Graph Analysis had similar graphs. Room to room typed museum showed differences in Integration, Visual Integration and Visual Connectivity. In the result, the most accessible space was lobby and Mediation Space became the center of visibility. Also, the exhibition hall, where the opening of room to room typed exhibition hall was penetrated visually, became a center of visibility. Lobby space, which was close to entrance, had the highest Visibility Connectivity. As Space Syntax could analyze the museum as whole space structure, Space Syntax showed strength in room to room typed museum analysis compared to open typed museum analysis which has relatively simple structure. Visibility Graph Analysis could expect the flow of exhibit distance including visibility analysis unlike the flow of exhibit distance with space arrangement. The exhibition hall, which secures the sight to penetration of an opening, couldn't be analyzed in existing Space Syntax. However, it became the biggest advantages in Visibility Graph Analysis of room to room typed museum. Visibility Graph Analysis derived detailed results in exhibit arrangement so it will be the useful method not only for architecture but also for planning of exhibit arrangement in open typed museum. Through this study, various possibilities on Quantitative Analysis Method of Museum Architecture could be verified. However, the analysis still has limitation of second dimension. Therefore, diverse and liberal following study will be expected to accomplish.

• Journal of applied mathematics & informatics
• /
• v.9 no.1
• /
• pp.77-86
• /
• 2002

Ford and Fulkerson have shown that a stationary maximal dynamic flow can be obtained by solving a transhipment problem associated with the static network and thereby finding the maximal temporally repeated dynamic flow. This flow is known to be an optical dynamic flow. This paper presents an algorithm for second best temporal1y repeated flows. A numerical example is presented.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.391-399
• /
• 2005

In this paper we present an algorithm based on network flow techniques which provides a solution for a combinatorial problem. Then, in order to provide all the solutions of this problem, we make use of an algorithm that given the bipartite graph $G=(V_1 {\cup}{V_2},\;E,\;{\omega})$ outputs the enumeration of all bipartite matchings of given cardinality v and cost c.

• 전기의세계
• /
• v.22 no.5
• /
• pp.12-18
• /
• 1973

This paper deals with Linear Programming by Signal Flow Graph technique which is different from that of Mason and Coates. The objective function is regarded as variable, and slack variable node, artificial variable node and objective function variable (constant) node are newly defined, which shows the process for optimization of solution very intuitively. Also methods for solving L.P. and examples with subject to Ax.leq.b, Ax=b and Ax.geq.b are presented.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.11a
• /
• pp.815-820
• /
• 2001

확장된 마크흐름선도(EMFG: Extended Mark Flow Graph)는 이산 시스템을 설계할 수 있는 강력한 도구일 뿐만 아니라 시스템을 직접적으로 구현하기 위한 적당한 표현이다. 본 논문에서는 EMFG의 동작 해석 알고리즘을 개선하여 시간 트랜지션이 존재하는 EMFG의 동작을 분석하고자 한다. 이를 통해 시스템의 분석 및 설계가 용이하며 컴퓨터를 이용한 자동화 시스템의 분석과 설계가 가능하다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 1998.04a
• /
• pp.423-431
• /
• 1998

이진값을 가지는 이진 시스템을 모델화하고 설계하여 구현할 수 있도록 Petri Net의 한 부류인 박스의 마크수가 최대 1인 안전(safe)한 확장된 마크흐름선도(EMFG : Extended Mark Flow Graph)를 재구성하였다. 레벨박스와 펄스박스 및 게이트박스를 하나의 박스로 통일하였으며, 보존아크를 제거하고 서로 상반되는 개념을 가지는 일반아크와 역아크만을 사용하였고, 특히 트랜지션의 출력아크로 새로이 역아크를 도입함으로써 EMFG의 표현을 명확하게 하였다. 또한 EMFG에서 자기루프를 정의하였다. 그리고 이진 시스템을 모델링한 EMFG를 실제회로로 구현하는 방법이 새로이 제시되었다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.1389-1392
• /
• 2000

본 논문은 프로시저 내에서 데이터 토큰들간의 정보흐름을 모델링 하기 위해서 정보 흐름 그래프(IFG : Information Flow Graph)라고 하는 프로그램 표현 도구를 개발하였다. IFG는 기존 제어 흐름 그래프와는 달리 프로그램 내에서 관심 있는 변수 값의 변화 과정을 쉽게 탐색할 수 있고, 정보 흐름의 미세 변화를 잘 표현할 수 있으므로, 프로그램에 대한 이해를 증진시킬 수 있다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.1
• /
• pp.183-191
• /
• 2001

We develop the new data s]ice representation, called the data value flow graph(VFG), for modeling the information flow oil data slices. Then we define a slice complexity measure by using the existing flow complexity measure in order to measure the complexity of the information flow on VFG. We show relation of the slice complexity on a slice with the slice complexity on a procedure. We also demonstrate the measurement scale factors through a set of atomic modifications and a concatenation operator on VFG.