• Title/Summary/Keyword: Dynamic Graph

Search Result 277, Processing Time 0.023 seconds

Stability Analysis of Tapered Thick Plate on Foundation (지반위에 놓인 변단면 후판의 안정해석)

  • Kim, Il-Jung;Oh, Soog-Kyong;Lee, Yong-Soo
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2006.11a
    • /
    • pp.819-822
    • /
    • 2006
  • This paper has the objects of deciding dynamic instability regions of thick plates on inhomogeneous Pasternak foundation by finite element method and providing kinematic design data for mats and slabs of building structures. In this paper, dynamic stability analysis of tapered opening thick plate is done by use of Serendipity finite element with 8 nodes considering shearing strain of plate. To verify this finite element method, buckling stress and natural frequencies of thick pate with or without in-plane stress are compared with existing solutions. The results are as follow that this finite element solutions with $4{\times}4$ meshes are shown the error of maximum 0.56% about existing solutions, and the larger foundation parameters, the farther dynamic instability regions are from vertical axis of graph presented relation of ${\beta}\;and\;\overline{\omega}/\omega$.

  • PDF

Formulating Analytical Solution of Network ODE Systems Based on Input Excitations

  • Bagchi, Susmit
    • Journal of Information Processing Systems
    • /
    • v.14 no.2
    • /
    • pp.455-468
    • /
    • 2018
  • The concepts of graph theory are applied to model and analyze dynamics of computer networks, biochemical networks and, semantics of social networks. The analysis of dynamics of complex networks is important in order to determine the stability and performance of networked systems. The analysis of non-stationary and nonlinear complex networks requires the applications of ordinary differential equations (ODE). However, the process of resolving input excitation to the dynamic non-stationary networks is difficult without involving external functions. This paper proposes an analytical formulation for generating solutions of nonlinear network ODE systems with functional decomposition. Furthermore, the input excitations are analytically resolved in linearized dynamic networks. The stability condition of dynamic networks is determined. The proposed analytical framework is generalized in nature and does not require any domain or range constraints.

Dynamic Stability Analysis of a Rotating Blade Considering Gravity Effect (중력의 영향이 고려된 회전 블레이드의 동적 안정성 해석)

  • Jung, Kang-Il;Yoo, Hong-Hee
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.20 no.11
    • /
    • pp.1052-1057
    • /
    • 2010
  • Dynamic stability of rotating blade considering gravity effect is investigated in this paper. Equations of motion for the beam is derived by employing hybrid deformation variable method and transformed into dimensionless form. The present modeling method is verified by RecurDyn. Stability diagrams are presented to show the influence of the configuration of the beam and angular velocity on the dynamic stability by applying Floquet's theory. Since the natural frequencies are varied when the blade has rotating motion, it is found that relatively large unstable regions exist approximately 1.1 times as high as the first bending natural frequency and half of the sum of first and second bending natural frequency.

Motion Planning of Autonomous Mobile Robot using Dynamic Programming (동적프로그래밍을 이용한 자율이동로봇의 동작계획)

  • Yoon, Hee-sang;Park, Tae-Hyoung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.16 no.1
    • /
    • pp.53-60
    • /
    • 2010
  • We propose a motion planning method for autonomous mobile robots. In order to minimize traveling time, a smooth path and a time optimal velocity profile should be generated under kinematic and dynamic constraints. In this paper, we develop an effective and practical method to generate a good solution with lower computation time. The initial path is obtained from voronoi diagram by Dijkstra's algorithm. Then the path is improved by changing the graph and path simultaneously. We apply the dynamic programming algorithm into the stage of improvement. Simulation results are presented to verify the performance of the proposed method.

Power Plant Fault Monitoring and Diagnosis based on Disturbance Interrelation Analysis Graph (교란들의 인과관계구현 데이터구조에 기초한 발전소의 고장감시 및 고장진단에 관한 연구)

  • Lee, Seung-Cheol;Lee, Sun-Gyo
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.51 no.9
    • /
    • pp.413-422
    • /
    • 2002
  • In a power plant, disturbance detection and diagnosis are massive and complex problems. Once a disturbance occurs, it can be either persistent, self cleared, cleared by the automatic controllers or propagated into another disturbance until it subsides in a new equilibrium or a stable state. In addition to the Physical complexity of the power plant structure itself, these dynamic behaviors of the disturbances further complicate the fault monitoring and diagnosis tasks. A data structure called a disturbance interrelation analysis graph(DIAG) is proposed in this paper, trying to capture, organize and better utilize the vast and interrelated knowledge required for power plant disturbance detection and diagnosis. The DIAG is a multi-layer directed AND/OR graph composed of 4 layers. Each layer includes vertices that represent components, disturbances, conditions and sensors respectively With the implementation of the DIAG, disturbances and their relationships can be conveniently represented and traced with modularized operations. All the cascaded disturbances following an initial triggering disturbance can be diagnosed in the context of that initial disturbance instead of diagnosing each of them as an individual disturbance. DIAG is applied to a typical cooling water system of a thermal power plant and its effectiveness is also demonstrated.

A Stability Analysis of the Magnetic Bearing System Subject to Sensor dislocation Error -Discussion on Nonlinear Magnetic Force Model- (센서의 설치 오차에 따른 자기베어링 지지 로터계의 안정도에 관한 연구 -비선형 자기력 모델에 대한 고찰-)

  • 정재일;김종원
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1996.11a
    • /
    • pp.799-805
    • /
    • 1996
  • In many cases, the magnetic farce model is linearized at the origin in designing the controller of a magnetic bearing system. However. this linear assumption is violated by the unmodeled nonlinear effect such as sensor dislocation and backup bearing dislocation. Therefore, a direct probe into the nonlinear magnetic force model in an active magnetic bearing system is necessary. To analyze the nonlinear magnetic force model of a magnetic bearing system, phase plot analysis which is to plot the numerical solution of the nonlinear equation in several initial points in the interested region is applied. Phase plot analysis is used to observe a nonlinear dynamic system qualitatively (not quantitatively). With this method, we can get much useful information of the nonlinear system. Among this information, a bifurcation graph that represents stability and locations of fixed points is essential. From the bifurcation graph, a stability criterion of magnetic bearing system is derived.

  • PDF

The Challenge of Managing Customer Networks under Change : Proving the Complexity of the Inverse Dominating Set Problem (소비자 네트워크의 변화 관리 문제 : 최소지배집합 역 문제의 계산 복잡성 증명)

  • Chung, Yerim;Park, Sunju;Chung, Seungwha
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.39 no.2
    • /
    • pp.131-140
    • /
    • 2014
  • Customer networks go through constant changes. They may expand or shrink once they are formed. In dynamic environments, it is a critical corporate challenge to identify and manage influential customer groups in a cost effective way. In this context, we apply inverse optimization theory to suggest an efficient method to manage customer networks. In this paper, we assume that there exists a subset of nodes that might have a large effect on the network and that the network can be modified via some strategic actions. Rather than making efforts to find influential nodes whenever the network changes, we focus on a subset of selective nodes and perturb as little as possible the interaction between nodes in order to make the selected nodes influential in the given network. We define the following problem based on the inverse optimization. Given a graph and a prescribed node subset, the objective is to modify the structure of the given graph so that the fixed subset of nodes becomes a minimum dominating set in the modified graph and the cost for modification is minimum under a fixed norm. We call this problem the inverse dominating set problem and investigate its computational complexity.

Graph based Binary Code Execution Path Exploration Platform for Dynamic Symbolic Execution (동적 기호 실행을 이용한 그래프 기반 바이너리 코드 실행 경로 탐색 플랫폼)

  • Kang, Byeongho;Im, Eul Gyu
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.24 no.3
    • /
    • pp.437-444
    • /
    • 2014
  • In this paper, we introduce a Graph based Binary Code Execution Path Exploration Platform. In the graph, a node is defined as a conditional branch instruction, and an edge is defined as the other instructions. We implemented prototype of the proposed method and works well on real binary code. Experimental results show proposed method correctly explores execution path of target binary code. We expect our method can help Software Assurance, Secure Programming, and Malware Analysis more correct and efficient.

A study on the Robust Control Cain Selection Scheme of a High-Speed/High-Accuracy position Control System using Taguchi Method (다꾸지 방법을 이용한 고속/정밀 위치제어시스템의 강인한 제어게인 선정에 관한 연구)

  • 신호준;채호철;윤석찬;장진희;한창수
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2002.04a
    • /
    • pp.521-527
    • /
    • 2002
  • This paper presents a dynamic modeling and a robust PID controller design process for the wire bonder head assembly. For the modeling elements, the system is divided into electrical system, magnetic system, and mechanical system. Each system is modeled by using the bond graph method. The PID controller is used for high speed/high accuracy position control of the wire bonder assembly. The Taguchi method is used to evaluate the more robust PID gain combinations than conventional one. This study makes use of an L18 array with three parameters varied on three levels. Computer simulations and experimental results show that the designed PID controller provides more improved signal to noise ratio and reduced sensitivity than the conventional PID controller.

  • PDF

Consensus of High-order Linear Systems with Directed Communication Topology Using LMI Approach (LMI 기법을 이용한 방향성 통신 토폴로지를 갖는 고차 선형시스템들의 상태일치)

  • Kim, Su-Bum;Choi, Hyoun-Chul;Lee, Sung-Hun;Kim, Kang-Seok;Joo, Seoung-Yul;Hong, Woo-Young
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.14 no.5
    • /
    • pp.941-947
    • /
    • 2011
  • This paper deals with the consensus problem for multi-agent linear dynamic systems with directed communication topology. All the agents are identical high-order linear systems and their state information is exchanged through a communication network with directed graph. It is shown that a consensus is achieved if there exists a feasible solution to a set of linear matrix inequalities obtained for a simultaneous stabilization problem for multiple systems. Examples are presented to show the effectiveness of the proposed method.