• 정보보호학회논문지
• /
• 제28권2호
• /
• pp.485-500
• /
• 2018

시스템 및 네트워크 환경의 규모가 확대되고, 네트워크 구조 및 시스템 구성이 빈번하게 변화함에 따라 네트워크 관리자가 현황을 수동으로 관리하고 실시간 변동사항을 식별하는 데에 많은 어려움이 발생하고 있다. 본 논문에서는 동적인 네트워크 정보를 실시간으로 스캔하고, 사전에 수집한 취약점 정보를 바탕으로 네트워크 내 장치의 취약성 정도를 점수화하고 최종적으로 공격자의 입장에서 공격 가능한 모든 경로를 도출하여 네트워크 관리자에게 공격 가능성이 높은 경로 목록을 제공하는 알고리즘을 제안하였다. 또한 제안하는 알고리즘을 토대로 한 Attack Graph를 실제로 구현하였으며, Software Defined Networking (SDN) 환경이 포함된 동적으로 변화하는 가상 네트워크 환경을 구축한 후 시뮬레이션을 진행하여 Moving Target Defense (MTD) 개념이 반영된 시스템에도 적용이 가능함을 입증하였다.

• 한국전자통신학회논문지
• /
• 제9권8호
• /
• pp.907-914
• /
• 2014

본 논문에서는 실내 환경에서 작업하는 로봇의 무 충돌 경로계획을 위하여 휴리스틱 작업 경로계획 방법을 제안한다. 이 방법은 모양공간을 격자로 분할하여 작은 크기의 격자를 여러개 합한 큰 격자로 장애물 모양공간을 재구성 하여 시작점의 노드와 목표점의 노드간의 연결을 노드와 노드사이의 거리와 장애물의 확률적 분포 같은 지역적인 정보를 이용하여 통로를 만들고 그 공간에서 작은 격자의 모양공간에서 그래프 연결을 찾는 방법으로 경로 및 작업을 계획하는 방법이다. 이 방법은 전체 모양공간에 대한 그래프를 기억시킬 필요가 없어 모양공간 내에서 노드나 격자의 증가에 따른 기억용량의 증가가 크지 않으며 전체 그래프에 대한 탐색을 하지 않으므로 계산량이 많지 않다. 제안한 알고리즘의 평가를 위하여 이동 로봇이 격자화된 실내지형에 대하여 최단거리의 경로계획을 성공적으로 수행하였음을 확인하였다.

• 한국실내디자인학회논문집
• /
• 제18권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
• /
• 제29권4호
• /
• 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.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2005년도 추계학술대회논문집
• /
• 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.

• Smart Structures and Systems
• /
• 제3권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.

• 한국주거학회논문집
• /
• 제18권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.

• Smart Structures and Systems
• /
• 제14권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.

• Nuclear Engineering and Technology
• /
• 제54권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권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.