• Title/Summary/Keyword: graph configuration

Search Result 71, Processing Time 0.021 seconds

An Attack Graph Model for Dynamic Network Environment (동적 네트워크 환경에 적용 가능한 Attack Graph 모델 연구)

  • Moon, Joo Yeon;Kim, Taekyu;Kim, Insung;Kim, Huy Kang
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.28 no.2
    • /
    • pp.485-500
    • /
    • 2018
  • As the size of the system and network environment grows and the network structure and the system configuration change frequently, network administrators have difficulty managing the status manually and identifying real-time changes. In this paper, we suggest a system that scans dynamic network information in real time, scores vulnerability of network devices, generates all potential attack paths, and visualizes them using attack graph. We implemented the proposed algorithm based attack graph; and we demonstrated that it can be applicable in MTD concept based defense system by simulating on dynamic virtual network environment with SDN.

A heuristic path planning method for robot working in an indoor environment (실내에서 작업하는 로봇의 휴리스틱 작업경로계획)

  • Hyun, Woong-Keun
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.9 no.8
    • /
    • pp.907-914
    • /
    • 2014
  • A heuristic search algorithm is proposed to plan a collision free path for robots in an indoor environment. The proposed algorithm is to find a collision free path in the gridded configuration space by proposed heuristic graph search algorithm. The proposed algorithm largely consists of two parts : tunnel searching and path searching in the tunnel. The tunnel searching algorithm finds a thicker path from start grid to goal grid in grid configuration space. The tunnel is constructed with large grid defined as a connected several minimum size grids in grid-based configuration space. The path searching algorithm then searches a path in the tunnel with minimum grids. The computational time of the proposed algorithm is less than the other graph search algorithm and we analysis the time complexity. To show the validity of the proposed algorithm, some numerical examples are illustrated for robot.

A Study on the Hierarchy in Spatial Configuration of Geriatrics Hospital (노인전문병원 평면구조의 위계에 관한 연구)

  • Lee, Heang-Woo;Kim, Suk-Tae
    • Korean Institute of Interior Design Journal
    • /
    • v.18 no.5
    • /
    • pp.183-190
    • /
    • 2009
  • Increase in the elderly population has given rise to various social problems throughout Korean society, and what is more, although the greater demand of medical treatment, its development is still in its early stages. Given that Specialized Geriatrics Hospital has stood amid a range of spatial complication and it should faithfully reflect the needs of elderly population, we need a better understanding of Specialized Geriatrics Hospital. This study suggested the foundation to plan of Specialized Geriatrics Hospital through analyzing and evaluating spatial configuration of Specialized Geriatrics Hospital by "Space Syntax" and "J-Graph" The study focused on Specialized Geriatric Hospitals existing in Korea which owned more than 100 beds. The result of this study is summarized as follows; First, the rate of separated convex showed that the portions of the Treatment of outpatients and Supply have increased, but onthe other hand the portion of the The ward has been on the decrease. Second, in the case of Treatment of outpatients, it was structured Tree-shaped and the Tree-shaped could be separated with two types: waiting room and wailing room with lounge. in the case of The ward, it was structured Tree-shaped and also Ring-shaped. The more recently opened Geriatrics Hospital, the closer to Ring-shaped. Third, the access to the Ccentral treatment was low though the access to the core of the each floor was high. Fourth, in the progress of intelligibility, the fact that its value has decreased is becoming a serious problem of medical development for the elderly population finally, according to J-graph's analysis, the hallway made the spatial depth of rooms and public space more deepened. This caused by scattered arrangement of public spaces. As the only planning were considered in this study, It therefore needs more diversified approaches considering physical factors such like real distance and area.

A Relative Nodal Displacement Method for Element Nonlinear Analysis (상대 절점 변위를 이용한 비선형 유한 요소 해석법)

  • Kim Wan Goo;Bae Dae sung
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.29 no.4 s.235
    • /
    • pp.534-539
    • /
    • 2005
  • Nodal displacements are referred to the initial configuration in the total Lagrangian formulation and to the last converged configuration in the updated Lagrangian furmulation. This research proposes a relative nodal displacement method to represent the position and orientation for a node in truss structures. Since the proposed method measures the relative nodal displacements relative to its adjacent nodal reference frame, they are still small for a truss structure undergoing large deformations for the small size elements. As a consequence, element formulations developed under the small deformation assumption are still valid for structures undergoing large deformations, which significantly simplifies the equations of equilibrium. A structural system is represented by a graph to systematically develop the governing equations of equilibrium for general systems. A node and an element are represented by a node and an edge in graph representation, respectively. Closed loops are opened to form a spanning tree by cutting edges. Two computational sequences are defined in the graph representation. One is the forward path sequence that is used to recover the Cartesian nodal displacements from relative nodal displacement sand traverses a graph from the base node towards the terminal nodes. The other is the backward path sequence that is used to recover the nodal forces in the relative coordinate system from the known nodal forces in the absolute coordinate system and traverses from the terminal nodes towards the base node. One open loop and one closed loop structure undergoing large deformations are analyzed to demonstrate the efficiency and validity of the proposed method.

A Relative for Finite Element Nonlinear Structural Analysis (상대절점좌표를 이용한 비선형 유한요소해석법)

  • Kang, Ki-Rang;Cho, Heui-Je;Bae, Dae-Sung
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2005.11a
    • /
    • pp.788-791
    • /
    • 2005
  • Nodal displacements are referred to the Initial configuration in the total Lagrangian formulation and to the last converged configuration in the updated Lagrangian formulation. This research proposes a relative nodal displacement method to represent the position and orientation for a node in truss structures. Since the proposed method measures the relative nodal displacements relative to its adjacent nodal reference frame, they are still small for a truss structure undergoing large deformations for the small size elements. As a consequence, element formulations developed under the small deformation assumption are still valid fer structures undergoing large deformations, which significantly simplifies the equations of equilibrium. A structural system is represented by a graph to systematically develop the governing equations of equilibrium for general systems. A node and an element are represented by a node and an edge in graph representation, respectively. Closed loops are opened to form a spanning tree by cutting edges. Two computational sequences are defined in the graph representation. One is the forward path sequence that is used to recover the Cartesian nodal displacements from relative nodal displacements and traverses a graph from the base node towards the terminal nodes. The other is the backward path sequence that is used to recover the nodal forces in the relative coordinate system from the known nodal forces in the absolute coordinate system and traverses from the terminal nodes towards the base node. One closed loop structure undergoing large deformations is analyzed to demonstrate the efficiency and validity of the proposed method.

  • PDF

A bond graph approach to energy efficiency analysis of a self-powered wireless pressure sensor

  • Cui, Yong;Gao, Robert X.;Yang, Dengfeng;Kazmer, David O.
    • Smart Structures and Systems
    • /
    • v.3 no.1
    • /
    • pp.1-22
    • /
    • 2007
  • The energy efficiency of a self-powered wireless sensing system for pressure monitoring in injection molding is analyzed using Bond graph models. The sensing system, located within the mold cavity, consists of an energy converter, an energy modulator, and a ultrasonic signal transmitter. Pressure variation in the mold cavity is extracted by the energy converter and transmitted through the mold steel to a signal receiver located outside of the mold, in the form of ultrasound pulse trains. Through Bond graph models, the energy efficiency of the sensing system is characterized as a function of the configuration of a piezoceramic stack within the energy converter, the pulsing cycle of the energy modulator, and the thicknesses of the various layers that make up the ultrasonic signal transmitter. The obtained energy models are subsequently utilized to identify the minimum level of signal intensity required to ensure successful detection of the ultrasound pulse trains by the signal receiver. The Bond graph models established have shown to be useful in optimizing the design of the various constituent components within the sensing system to achieve high energy conversion efficiency under a compact size, which are critical to successful embedment within the mold structure.

An Analysis of the Apartment House Plans in Seoul by Means of a New Graph-theoretic Method (그래프 기법에 의한 서울시 아파트 평면분석에 관한 연구)

  • Seo, Kyung-Wook
    • Journal of the Korean housing association
    • /
    • v.18 no.2
    • /
    • pp.121-128
    • /
    • 2007
  • The investigation of the apartment housing as a dwelling type has become the most important and popular research subject to understand the housing culture in Korea. In their methods of typological analysis, it is found that most studies represent each unit plan as a simplified architectural drawing. This type of typology, however, has difficulties in processing a large scale of data set because each representation of a plan contain too many informations. To deal with this problem, this study suggests a new graph-theoretical method by which apartment plans can be represented in a more simple and effective way. This new method is also tested against the sample plans from Gangnam-gu area in Seoul to reveal the design logic hidden in plan configuration. Through a series of analyses, it is verified that there exist a design strategy that guides the particular pattern of zoning and allocation of each room in the plan.

Pose-graph optimized displacement estimation for structural displacement monitoring

  • Lee, Donghwa;Jeon, Haemin;Myung, Hyun
    • Smart Structures and Systems
    • /
    • v.14 no.5
    • /
    • pp.943-960
    • /
    • 2014
  • A visually servoed paired structured light system (ViSP) was recently proposed as a novel estimation method of the 6-DOF (Degree-Of-Freedom) relative displacement in civil structures. In order to apply the ViSP to massive structures, multiple ViSP modules should be installed in a cascaded manner. In this configuration, the estimation errors are propagated through the ViSP modules. In order to resolve this problem, a displacement estimation error back-propagation (DEEP) method was proposed. However, the DEEP method has some disadvantages: the displacement range of each ViSP module must be constrained and displacement errors are corrected sequentially, and thus the entire estimation errors are not considered concurrently. To address this problem, a pose-graph optimized displacement estimation (PODE) method is proposed in this paper. The PODE method is based on a graph-based optimization technique that considers entire errors at the same time. Moreover, this method does not require any constraints on the movement of the ViSP modules. Simulations and experiments are conducted to validate the performance of the proposed method. The results show that the PODE method reduces the propagation errors in comparison with a previous work.

Graph neural network based multiple accident diagnosis in nuclear power plants: Data optimization to represent the system configuration

  • Chae, Young Ho;Lee, Chanyoung;Han, Sang Min;Seong, Poong Hyun
    • Nuclear Engineering and Technology
    • /
    • v.54 no.8
    • /
    • pp.2859-2870
    • /
    • 2022
  • Because nuclear power plants (NPPs) are safety-critical infrastructure, it is essential to increase their safety and minimize risk. To reduce human error and support decision-making by operators, several artificial-intelligence-based diagnosis methods have been proposed. However, because of the nature of data-driven methods, conventional artificial intelligence requires large amount of measurement values to train and achieve enough diagnosis resolution. We propose a graph neural network (GNN) based accident diagnosis algorithm to achieve high diagnosis resolution with limited measurements. The proposed algorithm is trained with both the knowledge about physical correlation between components and measurement values. To validate the proposed methodology has a sufficiently high diagnostic resolution with limited measurement values, the diagnosis of multiple accidents was performed with limited measurement values and also, the performance was compared with convolution neural network (CNN). In case of the experiment that requires low diagnostic resolution, both CNN and GNN showed good results. However, for the tests that requires high diagnostic resolution, GNN greatly outperformed the CNN.

Packet Output and Input Configuration in a Multicasting Session Using Network Coding

  • Marquez, Jose;Gutierrez, Ismael;Valle, Sebastian;Falco, Melanis
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.2
    • /
    • pp.686-710
    • /
    • 2019
  • This work proposes a model to solve the problem of Network Coding over a one-session multicast network. The model is based on a system of restrictions that defines the packet flows received in the sink nodes as functions of the outgoing flows from the source node. A multicast network graph is used to derive a directed labeled line graph (DLLG). The successive powers of the DLLG adjacency matrix to the convergence in the null matrix permits the construction of the jump matrix Source-Sinks. In its reduced form, this shows the dependency of the incoming flows in the sink nodes as a function of the outgoing flows in the source node. The emerging packets for each outgoing link from the source node are marked with a tag that is a linear combination of variables that corresponds to powers of two. Restrictions are built based on the dependence of the outgoing and incoming flows and the packet tags as variables. The linear independence of the incoming flows to the sink nodes is mandatory. The method is novel because the solution is independent of the Galois field size where the packet contents are defined.