• Title/Summary/Keyword: Dynamic Graph

Search Result 276, Processing Time 0.026 seconds

FAST BDD TRUNCATION METHOD FOR EFFICIENT TOP EVENT PROBABILITY CALCULATION

  • Jung, Woo-Sik;Han, Sang-Hoon;Yang, Joon-Eon
    • Nuclear Engineering and Technology
    • /
    • v.40 no.7
    • /
    • pp.571-580
    • /
    • 2008
  • A Binary Decision Diagram (BDD) is a graph-based data structure that calculates an exact top event probability (TEP). It has been a very difficult task to develop an efficient BDD algorithm that can solve a large problem since it is highly memory consuming. In order to solve a large reliability problem within limited computational resources, many attempts have been made, such as static and dynamic variable ordering schemes, to minimize BDD size. Additional effort was the development of a ZBDD (Zero-suppressed BDD) algorithm to calculate an approximate TEP. The present method is the first successful application of a BDD truncation. The new method is an efficient method to maintain a small BDD size by a BDD truncation during a BDD calculation. The benchmark tests demonstrate the efficiency of the developed method. The TEP rapidly converges to an exact value according to a lowered truncation limit.

An Efficient Representation of Edge Shapes in Topological Maps

  • Doh, Nakju Lett;Chung, Wan-Kyun
    • ETRI Journal
    • /
    • v.29 no.5
    • /
    • pp.655-666
    • /
    • 2007
  • There are nodes and edges in a topological map. Node data has been used as a main source of information for the localization of mobile robots. In contrast, edge data is regarded as a minor source of information, and it has been used in an intuitive and heuristic way. However, edge data also can be used as a good source of information and provide a way to use edge data efficiently. For that purpose, we define a data format which describes the shape of an edge. This format is called local generalized Voronoi graph's angle (LGA). However, the LGA is constituted of too many samples; therefore, real time localization cannot be performed. To reduce the number of samples, we propose a compression method which utilizes wavelet transformation. This method abstracts the LGA by key factors using far fewer samples than the LGA. Experiments show that the LGA accurately describes the shape of the edges and that the key factors preserve most information of the LGA while reducing the number of samples.

  • PDF

Program Similarity Analysis based on the Dynamic API Call Graph (동적 API 콜 그래프 기반 버스마킹 기법)

  • Ha, Jae-Jin;Chae, Dong-Kyu;Kim, Sang-Wook;Kim, Ye-Sol;Cho, SeongJae
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2014.11a
    • /
    • pp.437-438
    • /
    • 2014
  • 본 논문에서는 동적 API 콜 그래프를 기반으로 하는 버스마킹 기법을 제안한다. API 콜 그래프를 이용함으로써 기존 방법들에 비해 프로그램의 정보를 보다 많이 반영하였다. 상용 Windows 프로그램들을 대상으로 실험을 수행하였으며, 실제로 기존의 유사성 분석 기법들에 비해 신뢰성과 강인성 측면에서 모두 성능 향상을 보였다.

Efficient Dynamic System Dependence Graph (효율적인 동적 시스템 종속 그래프)

  • Park, Soon-Hyung;Park, Man-Gon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2000.04a
    • /
    • pp.729-734
    • /
    • 2000
  • 전통적인 기존의 슬라이싱 기법들은 종속 그래프를 통해 슬라이스를 산출하였고, 슬라이스의 정확성을 입증하였다. 그러나, 기존의 종속 그래프 기법은 정적 슬라이싱 기법을 바탕으로 하기 때문에 프로시져 간의 매개변수별 자료 전달 링크를 나타내기 위하여 많은 정점들과 간선들이 필요하다. 그래서 그래프가 매우 복잡하다. 본 논문에서는 어떤 작업을 처리하기 위해 관련된 여러 개의 프로그램으로 구성된 소프트웨어 시스템의 슬라이싱을 수행하기 위한 동적 시스템 종속 그래프의 표현법에 대해 제안하였다. 그리고, 본 논문에서 제안한 동적 시스템 종속 그래프 기법과 기존의 프로그램 종속 그래프 기법에 대한 복잡도 측정 공식을 제안하였으며, 동적 시스템 종속 그래프 기법이 기존의 기법에 비해 그래프의 복잡도가 작아 효율적임을 보였다.

  • PDF

Graph-Based Service Scheduler for Dynamic User Requirements in Multi-Agent Environments (멀티 에이전트 환경에서 동적 요구를 위한 그래프 기반 서비스 스케줄러)

  • Sang-Min Lee;Chang-ho Lee;Jung-Min Park
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2024.05a
    • /
    • pp.869-870
    • /
    • 2024
  • 다양한 형태의 다수 에이전트가 서비스하는 환경에서 사용자가 요청하는 서비스 명령은 단순할수록 사용성이 좋다. 하나의 서비스는 다양한 로봇이 유기적으로 수행해야 하며, 사용자가 서비스 명령에 대해 요구사항을 추가하면 이를 다수 로봇이 적절하게 처리하는 방법이 필요하다. 본 논문에서는 사용자가 요청한 서비스에 대해 로봇의 동작은 노드로, 동작 간의 관계는 에지로 표현하고 이를 통해 스케줄링 하는 방법론을 제공한다. 실험 결과, 다수 로봇 환경에서 사용자의 요구사항을 동적으로 대응하며 효율적으로 서비스가 수행됨을 확인하였다.

A performance study and conceptual design on the ramp tabs of the thrust vector control (추력방향제어장치인 램 탭의 개념설계 및 성능 연구)

  • Kim, Kyoung-Rean;Ko, Jae-Myoung;Park, Soon-Jong;Park, Jong-Ho
    • Proceedings of the KSME Conference
    • /
    • 2007.05b
    • /
    • pp.3068-3073
    • /
    • 2007
  • Aerodynamic forces and moments have been used to control rocket propelled vehicles. If control is required at very low speed, Those systems only provide a limited capability because aerodynamic control force is proportional to the air density and low dynamic pressure. But thrust vector control(TVC) can overcome the disadvantages. TVC is the method which generates the side force and roll moment by controlling exhausted gas directly in a rocket nozzle. TVC is classified by mechanical and fluid dynamic methods. Mechanical methods can change the flow direction by several objects installed in a rocket nozzle exhaust such as tapered ramp tabs and jet vane. Fluid dynamic methods control the flight direction with the injection of secondary gaseous flows into the rocket nozzle. The tapered ramp tabs of mechanical methods are used in this paper. They installed at the rear in the rocket nozzle could be freely moved along axial and radial direction on the mounting ring to provide the mass flow rate which is injected from the rocket nozzle. In this paper, the conceptual design and the performance study on the tapered ramp tabs of the thurst vector control has been carried out using the supersonic cold flow system and shadow graph. Numerical simulation was also performed to study flow characteristics and interactions between ramp tabs. This paper provides to analyze the location of normal shock wave and distribution of surface pressure on the region enclosed by the tapered ramp tabs.

  • PDF

A Technique for Detecting Interaction-based Communities in Dynamic Networks (동적 네트워크에서 인터랙션 기반 커뮤니티 발견 기법)

  • Kim, Paul;Kim, Sangwook
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.8
    • /
    • pp.357-362
    • /
    • 2016
  • A social network or bio network is one of the complex networks that are formed by connecting specific relationships between interacting objects. Usually, these networks consist of community structures. Automatically detecting the structures is an important technique to understand and control the interaction objects. However, the topologies and structures of the networks change by interactions of the objects, with respect to time. Conventional techniques for finding the community structure have a high computational complexity. Additionally, the methods inefficiently deal with repeated computation concerning graph operation. In this paper, we propose an incremental technique for detecting interaction-based communities in dynamic networks. The proposed technique is able to efficiently find the communities, since there is an awareness of changed objects from the previous network, and it can incrementally reuse the previous community structure.

A Study on the Heuristic Search Algorithm on Graph (그라프에서의 휴리스틱 탐색에 관한 연구)

  • Kim, Myoung-Jae;Chung, Tae-Choong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.10
    • /
    • pp.2477-2484
    • /
    • 1997
  • Best-first heuristic search algorithm, such as $A^{\ast}$ algorithm, are one of the most important techniques used to solve many problems in artificial intelligence. A common feature of heuristic search is its high computational complexity, which prevents the search from being applied to problems is practical domains such as route-finding in road map with significantly many nodes. In this paper, several heuristic search algorithms are concerned. A new dynamic weighting heuristic method called the pat-sensitive heuristic is proposed. It is based on a dynamic weighting heuristic, which is used to improve search effort in practical domain such as admissible heuristic is not available or heuristic accuracy is poor. It's distinctive feature compared with other dynamic weighting heuristic algorithms is path-sensitive, which means that ${\omega}$(weight) is adjusted dynamically during search process in state-space search domain. For finding an optimal path, randomly scattered road-map is used as an application area.

  • PDF

Modeling, simulation and structural analysis of a fluid catalytic cracking (FCC) process

  • Kim, Sungho;Urm, Jaejung;Kim, Dae Shik;Lee, Kihong;Lee, Jong Min
    • Korean Journal of Chemical Engineering
    • /
    • v.35 no.12
    • /
    • pp.2327-2335
    • /
    • 2018
  • Fluid catalytic cracking (FCC) is an important chemical process that is widely used to produce valuable petrochemical products by cracking heavier components. However, many difficulties exist in modeling the FCC process due to its complexity. In this study, a dynamic process model of a FCC process is suggested and its structural observability is analyzed. In the process modeling, yield function for the kinetic model of the riser reactor was applied to explain the product distribution. Hydrodynamics, mass balance and energy balance equations of the riser reactor and the regenerator were used to complete the modeling. The process model was tested in steady-state simulation and dynamic simulation, which gives dynamic responses to the change of process variables. The result was compared with the measured data from operating plaint. In the structural analysis, the system was analyzed using the process model and the process design to identify the structural observability of the system. The reactor and regenerator unit in the system were divided into six nodes based on their functions and modeling relationship equations were built based on nodes and edges of the directed graph of the system. Output-set assignment algorithm was demonstrated on the occurrence matrix to find observable nodes and variables. Optimal locations for minimal addition of measurements could be found by completing the whole output-set assignment algorithm of the system. The result of this study can help predict the state more accurately and improve observability of a complex chemical process with minimal cost.

The Impact of the Regional Comprehensive Economic Partnership (RCEP) on Intra-Industry Trade: An Empirical Analysis Using a Panel Vector Autoregressive Model

  • Guofeng Zhao;Cheol-Ju Mun
    • Journal of Korea Trade
    • /
    • v.27 no.3
    • /
    • pp.103-118
    • /
    • 2023
  • Purpose - This study aims to examine the dynamic relationship between the variables impacted by the Regional Comprehensive Economic Partnership (RCEP) and the level of intra-industry trade among member states, with the ultimate objective of deducing the short- and long-term effects of RCEP on trade. Design/methodology - This study focuses on tariffs, GDP growth rates, and the proportion of regional FDI to total FDI as research variables, and employs a panel vector autoregression model and GMM-style estimator to investigate the dynamic relationship between RCEP and intra-industry trade among member countries. Findings - The study finds that the level of intra-industry trade between member states is positively impacted by both tariffs and intra-regional FDI. The impulse response graph shows that tariffs and FDI within the region can promote intra-industry trade among member countries, with a quick response. However, the contribution rates of tariffs and intra-regional FDI are not particularly high at approximately 1.5% and 1.4%, respectively. In contrast, the contribution rate of GDP growth can reach around 8.5%. This implies that the influence of economic growth rate on intra-regional trade in industries is not only long-term but also more powerful than that of tariffs and intra-regional FDI. Originality/value - The originality of this study lies in providing a new approach to investigating the potential impact of RCEP while avoiding the limitations associated with the GTAP model. Additionally, this study addresses existing gaps within the research, further contributing to the research merit of the study.