• 경영정보학연구
• /
• 제6권2호
• /
• pp.65-77
• /
• 2004

비즈니스 인텔리전스를 위한 통합 정보시스템의 운영을 위하여서는 무엇보다도 기업 내부와 외부에서 발생한 자료들을 상호 연계하여 통합 관리하여야 한다. 데이터의 통합관리를 위하여서는 기존의 데이터와 데이터들 사이의 일대일 매핑이 아니라 데이터의 생성부터 통합 저장까지의 변환 과정을 총괄적으로 표현하고 관리하여야 한다. 본 연구는 정보구조그래프를 확장함으로써 데이터의 변환구조들 뿐만이 아니라 세부 처리 단계들까지 통합 관리할 수 있는 방안을 제시하며, 이를 이용하여 비즈니스 인텔리전스와 같은 통합환경에서 데이터베이스의 품질 향상을 위한 활용방안을 제시한다.

• Journal of Electrical Engineering and Technology
• /
• 제9권4호
• /
• pp.1188-1195
• /
• 2014

This paper presents an analytical technique for reliability evaluation of electrical distribution network (EDN) containing distributed generation (DG). Based on hierarchical levels of circuit breaker controlling zones and feeder sections, a directed-relation-graph (DRG) for an END is formed to describe the hierarchical structure of the EDN. The reliability indices of EDN and load points can be evaluated directly using the formed DRG, and the reliability evaluation of an EDN containing DGs can also be done without re-forming the DRG. The proposed technique incorporates multi-state models of photovoltaic and diesel generations, as well as weather factors. The IEEE-RBTS Bus 6 EDN is used to validate the proposed technique; and a practical campus EDN containing DG was also analyzed using the proposed technique.

• 대한원격탐사학회지
• /
• 제22권6호
• /
• pp.601-612
• /
• 2006

본 연구는 방대한 크기 원격 탐사 영상 자료의 효율적인 분석을 위한 RAG (Region Adjancency Graph) 기반 영상 분할 기법을 제안하고 있다. 제안된 알고리즘은 계산의 효율성을 위하여 CN-chain 연결과 저장 기억의 효율성을 위하여 sliding 다중 창을 사용한다. RAG에 의한 지역 합병은 최선의 결합을 위한 edge을 발견과 합병에 따른 graph의 갱신의 과정이다. CN-chain 연결법은 가장 유사한 인접 지역의 연결을 형성하면서 최선의 edge를 발견하여 합병을 해 나가는 과정으로 영상 자료 크기의 증가에 따라 단지 증가 배수만큼만 분석 시간을 증가시킨다. 합병에 의해 변하는 RAG의 효율적인 갱신을 위하여 RNV(Regional Neighbor Vector)를 사용하였다. 방대한 크기 자료 분석은 막대한 기억 용량의 시스템을 필요로 한다. 제안된 수평적인 구조의 sliding 다중 창 작업은 필요한 기억 용량을 현저히 감소시켜 가능한 분석 자료의 크기를 증대시켰을 뿐 아니라 계산 시간의 감소를 초래하였다. 본 연구는 simulation 자료를 사용하여 광범위하게 제안된 알고리즘의 성능을 실험하였으며 실험 결과는 알고리즘의 효율성을 입증하였다.

• 한국멀티미디어학회논문지
• /
• 제19권12호
• /
• pp.2000-2013
• /
• 2016

The purpose of this study is to validate the validity of the methodology for analyzing the space with complex characteristics and to evaluate the existing spatial structure analysis theory. Seven example models are designed and analyzed data of spatial syntax analysis and visibility graph analysis. And analyzed the agent-based model using two analytical methods: the adjacent space and the whole spatial connection. The results of this study are as follows. Based on the analysis of the agent - based model for perfectly freewalking, the validity of the method is verified in terms of predictive ability and effectiveness. Agent-based models can be simulated considering various variables, so realistic predictions will be possible and a new biography of complex systems can be met.

• 한국지반공학회:학술대회논문집
• /
• 한국지반공학회 2005년도 춘계 학술발표회 논문집
• /
• pp.1490-1495
• /
• 2005

In this study, Model test of concrete frame structures with various shapes and locations are carried out by means of applying Peck's(1969) settlement method. The results of the model test indicated that important correlations existed between the behavior of frame structure and ground movement. Also, the damage level of frame structure closely influenced by the phase of excavation. Therefore, prediction of damage level at early phase of construction should be very precise. The damage level graph by Cording et al.(2001), the angular distortion provided gradually more serious damage to frame structures for the all cases. But the damage level graph by Burland(1997), was difficult to confirm because of very small amount of deflection ratio.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1996년도 춘계학술대회 논문집
• /
• pp.294-298
• /
• 1996

This paper presents an attempt to find the physical structure of dynamic systems which achieves the behavior of a given system function. The scheme pursued by te paper would be regarded as synthesizing dynamic systems, and a method to synthesize them analytically is proposed by means of bond graph prototypes. The method proposed adopts several concepts used to synthesize networks in the electrical field, but yet demonstrates its own strengths such as the freedom from the causality assignment and determination of junction types. Also, it is shown that this method has further advantages in reticulating a given specification into feedforward and feedback expansions relative to electrical network synthesis and the method introduced by Redfield. The proposed method is examined through an example to trace the outline of the analytical synthesis of dynamic systems using bond graph prototypes.

• 한국경영과학회지
• /
• 제17권3호
• /
• pp.79-99
• /
• 1992

The DEVS (Discrete Event system Specification) formal model for discrete event simulation is a hierarchical, modular model. Because the DEVS formal model has a mathematical structure, it provides a theoretic background of discrete event simulation model. However, the DEVS formal model is difficult to understand because of its mathematical structure. Also, since the DEVS formal model is often constructed by heuristic, subjective method of model designer from the model, a systematic model built-in methodology does not exist. In this paper, we propose the model formalization methodology from an informal model to the DEVS formal model. For this formalization methodology, we introduce formal tools for model construction based on the DEVS ( from an informal model : Event Dependency Graph (EDG) for the event analysis and State Representation Graph(SRG) for the system state analysis.

• Journal of Information Processing Systems
• /
• 제19권1호
• /
• pp.130-138
• /
• 2023

The traffic flow in an urban area is affected by the date, weather, and regional traffic flow. The existing methods are weak to model the dynamic road network features, which results in inadequate long-term prediction performance. To solve the problems regarding insufficient capacity for dynamic modeling of road network structures and insufficient mining of dynamic spatio-temporal features. In this study, we propose a novel traffic flow prediction framework called shared spatio-temporal attention convolution optimization network (SSTACON). The shared spatio-temporal attention convolution layer shares a spatio-temporal attention structure, that is designed to extract dynamic spatio-temporal features from historical traffic conditions. Subsequently, the graph optimization module is used to model the dynamic road network structure. The experimental evaluation conducted on two datasets shows that the proposed method outperforms state-of-the-art methods at all time intervals.

• 대한기계학회논문집A
• /
• 제22권2호
• /
• pp.399-407
• /
• 1998

This paper deals with a method for finding the physical structure of dynamic systems which shows reasonable response to a given specifiation. The method uses only four basic models of bond graph prototypes which have been originally proposed by the authors as a general model for dynamic systems, and then makes its procedure highly physical in the sense that it can synthesize a dynamic system through the structural transformation directly on bond graph models without any mathematical manipulation. Also, it is shown that this method has further advantages in optimizing parameters for an existing system rather than developing design concepts for a new device, the latter being more suitable using the so-called analytical synthesis method introduced by Park and Redfield. One example serves to trace the outlines of the direct synthesis method proposed in this paper for dynamic systems in terms of bond graph prototypes.

• 한국정보과학회논문지:시스템및이론
• /
• 제26권8호
• /
• pp.999-1007
• /
• 1999

이 논문은 재귀원형군 G(2^m , 2^k )를 그래프 이론적 관점에서 고찰하고 정점이 서로소인 사이클과 그래프 invariant에 관한 위상 특성을 제시한다. 재귀원형군은 1 에서 제안된 다중 컴퓨터의 연결망 구조이다. 재귀원형군 {{{{G(2^m , 2^k )가 길이 사이클을 가질 필요 충분 조건을 구하고, 이 조건하에서 G(2^m , 2^k )는 가능한 최대 개수의 정점이 서로소이고 길이가l`인 사이클을 가짐을 보인다. 그리고 정점 및 에지 채색, 최대 클릭, 독립 집합 및 정점 커버에 대한 그래프 invariant를 분석한다.Abstract In this paper, we investigate recursive circulant G(2^m , 2^k ) from the graph theory point of view and present topological properties of G(2^m , 2^k ) concerned with vertex-disjoint cycles and graph invariants. Recursive circulant is an interconnection structure for multicomputer networks proposed in 1 . A necessary and sufficient condition for recursive circulant {{{{G(2^m , 2^k ) to have a cycle of lengthl` is derived. Under the condition, we show that G(2^m , 2^k ) has the maximum possible number of vertex-disjoint cycles of length l`. We analyze graph invariants on vertex and edge coloring, maximum clique, independent set and vertex cover.