• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1920-1937
• /
• 2015

Network environment has been under constant threat from both malicious attackers and inherent vulnerabilities of network infrastructure. Existence of such threats calls for exhaustive vulnerability analyzing to guarantee a secure system. However, due to the diversity of security hazards, analysts have to select from massive alternative hardening strategies, which is laborious and time-consuming. In this paper, we develop an approach to seek for possible hardening strategies and prioritize them to help security analysts to handle the optimal ones. In particular, we apply a Risk Flow Attack Graph (RFAG) to represent network situation and attack scenarios, and analyze them to measure network risk. We also employ a multi-objective genetic algorithm to infer the priority of hardening strategies automatically. Finally, we present some numerical results to show the performance of prioritizing strategies by network risk and hardening cost and illustrate the application of optimal hardening strategy set in typical cases. Our novel approach provides a promising new direction for network and vulnerability analysis to take proper precautions to reduce network risk.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.10
• /
• pp.2567-2574
• /
• 1998

Many software engineering tools and techniques rely on fraphic representations of software, such as control flow graphs, program dependene graphs, or system dependence graphs. Existing graphic representations for object-oriented programs are compkicated, reduplicated. We thus propose a new graphic representation for object-oriented programs. Object-oriented Program Dependency Graph (OPDG). An OPDG consists of class dependence graph, class hierarchy graph and procedure dependence graph. Other features of OPDG are (1) the representation is compact; (2) the representation is easy to extend for the incremental development of a program; and (3) the repreesentation can be extended to provide dynamic information.

• International Journal of Computer Science & Network Security
• /
• v.23 no.7
• /
• pp.61-70
• /
• 2023

Image segmentation is a very crucial step in effective digital image processing. In the past decade, several research contributions were given related to this field. However, a general segmentation algorithm suitable for various applications is still challenging. Among several image segmentation approaches, graph-based approach has gained popularity due to its basic ability which reflects global image properties. This paper proposes a methodology to partition the image with its pixel, region and texture along with its intensity. To make segmentation faster in large images, it is processed in parallel among several CPUs. A way to achieve this is to split images into tiles that are independently processed. However, regions overlapping the tile border are split or lost when the minimum size requirements of the segmentation algorithm are not met. Here the contributions are made to segment the image on the basis of its pixel using min-cut/max-flow algorithm along with edge-based segmentation of the image. To segment on the basis of the region using a homogenous optimum cut algorithm with boundary segmentation. On the basis of texture, the object type using spectral partitioning technique is identified which also minimizes the graph cut value.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1013-1016
• /
• 1998

A method for generation of design verification tests from behavior-level VHDL program is presented. Behavioral VHDL programs contain multiple communicating processes, signal assignment statements. So for large, complex system, it is difficult problem to test or simulation. In this paper, we proposed a new hardware design verification method. For this method generates control flow graph(CFG.) and process modeling graph(PMG) in the given under the testing VHDL program. And this method proved very effective that all the assumed design errors could be detected.

• Journal of Advanced Marine Engineering and Technology
• /
• v.16 no.5
• /
• pp.77-84
• /
• 1992

In the most of acoustic system with low flow rate and low pressure level, one-dimensional, linear modeling techniques are used very well. At low frequency, the tube is modeled as inertia element and cavity as capacitance element, and to extend the range of frequency normal mode oscillators are represented. Bond graph modelling techniques are proposed to predict TL (Transmission Loss) and time response which is impossible by transfer matrix in muffler system. A simple acoustic filter which consists of several tubes and cawities is analyzed in both time and frequency domain.

• ETRI Journal
• /
• v.5 no.3
• /
• pp.16-25
• /
• 1983

Increasing importance is being attached to the idea of measuring software characteristics. This paper deals with following things. First, a relation of program and flow graph is discussed. It describes a theoretic complexity measure and illustrates how it can be used to manage and control program complexity. Second, cyclomatic complexity measure is discussed. The complexity is independent of physical size and depends only on the decision structure of a program. Third, consider a knot which defines crossing point and provide the ordering of the nodes to make the transition from a two dimensional graph to a one dimensional program. A program modules that can improve FORTRAN IV program text is tested by knot counting and its control complexity is improved.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.657-660
• /
• 2000

This paper proposes a Data-Flow-Graph (DFG) restructuring to reduce calculating errors in loop folding scheduling. The prime cause of calculating error is rounding errors due to the restriction of the operation digit of functional units. This rounding error is increased more by using multipliers than adders, so reducing the number of multiplications and putting off them as much as possible reduce rounding errors. The proposed approach reduces the number of multiplications by restructuring DFG in loop folding.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.267-270
• /
• 2001

A lot of efforts have been made to analyze the performance of the vehicle equipped with automatic transmission through simulation. It might be necessary to understand the different types of transmissions, i.e., different power flows, for different models. If there is a module that can be applied to different types of automatic transmission, it could be helpful to transmission-related engineers. This study has started up from this idea. The common bond graph has been obtained from several types of the automatic transmission. The overall generalized equations and kinematic constraint equations have been derived using virtual power sources on common bond graph. They are used to derive state equations and constraints. These equations have been applied as an application to the vehicle equipped with two simple planetary gear set type of Ravigneaux gear type automatic transmission. The state equation, kinematic constraints, and dynamic constraints have been derived in every gear and shift operation using overall generalized equations and kinematic constraint equations. Simulations for constraint speed running, standing-start running, rolling-start running, and LA-4 mode have been conducted to analyze the performance of the vehicle powertrain using GVPS(Generalized Vehicle Powertrain Simulation) program wit pull down menus.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.7
• /
• pp.1896-1907
• /
• 1998

확장된 마크흐름선도(EMFG: Extednded Mark Flow Graph)는 기존의 MFG를 개선한 그래프로서, 회로변수식에 의해 실제회로로 쉽게 구현가능하므로 이산제어시스템의 모델링과 설계 및 구현의 강력한 도구로 사용될 수 있다. 본 논문은 EMFG의 트랜지션들이 점화하는 과정 및 트랜지션들이 점화완료하였을 때 각 박스들의 마크수 변화를 부울함수식과 벡터를 사용하여 표현하였다. 또한 시스템의 상태변화를 쉽게 판단할 수 있게 하는 EMFG의 동작알고리듬을 제안하였으며, 제안된 알고리듬은 3-비트 증가계수기를 설계한 EMFG와 시간트랜지션이 포함된 가상의 EMFG에서 잘 수행되었다. EMFG의 동작이 부울함수로 해석가능해짐으로 인해 시스템의 분석 및 설계가 용이하며 컴퓨터를 이용한 자동화된 시스템의 분석과 설계가 가능하다.

• Proceedings of the KIEE Conference
• /
• 2002.07a
• /
• pp.422-424
• /
• 2002

Many methods about real power flow tracing have been suggested. Electric power industrials and organizations of the world use the method which is best suitable to themselves in practical aspects. In this paper we calculate the real power transfer between individual generators and loads referencing the method introduced by oversea's paper. It is considered to be significant to the wholesale competition market and transmission open access. Based on ac load flow solution and graph theory, the simulation on IEEE 30-bus system are carried out and the results are compared with that of oversea's paper. Also the simulation on the power system of Korea is carried out and the results are analyzed.