• Title/Summary/Keyword: 동적 그래프

Search Result 200, Processing Time 0.023 seconds

An Approximate Shortest Path Re-Computation Method for Digital Road Map Databases in Mobile Computing Environments (모바일 컴퓨팅 환경에서의 디지털 로드맵 데이타베이스를 위한 근접 최단 경로 재계산 방법)

  • 김재훈;정성원;박성용
    • Journal of KIISE:Databases
    • /
    • v.30 no.3
    • /
    • pp.296-309
    • /
    • 2003
  • One of commercial applications of mobile computing is ATIS(Advanced Traveler Information Systems) in ITS(Intelligent Transport Systems). In ATIS, a primary mobile computing task is to compute the shortest path from the current location to the destination. In this paper, we have studied the shortest path re-computation problem that arises in the DRGS(Dynamic Route Guidance System) in ATIS where the cost of topological digital road map is frequently updated as traffic condition changes dynamically. Previously suggested methods either re-compute the shortest path from scratch or re-compute the shortest path just between the two end nodes of the edge where the cost change occurs. However, these methods we trivial in that they do not intelligently utilize the previously computed shortest path information. In this paper, we propose an efficient approximate shortest path re-computation method based on the dynamic window scheme. The proposed method re-computes an approximate shortest path very quickly by utilizing the previously computed shortest path information. We first show the theoretical analysis of our methods and then present an in-depth experimental performance analysis by implementing it on grid graphs as well as a real digital road map.

A Polynomial-time Algorithm to Find Optimal Path Decompositions of Trees (트리의 최적 경로 분할을 위한 다항시간 알고리즘)

  • An, Hyung-Chan
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.5_6
    • /
    • pp.195-201
    • /
    • 2007
  • A minimum terminal path decomposition of a tree is defined as a partition of the tree into edge-disjoint terminal-to-terminal paths that minimizes the weight of the longest path. In this paper, we present an $O({\mid}V{\mid}^2$time algorithm to find a minimum terminal path decomposition of trees. The algorithm reduces the given optimization problem to the binary search using the corresponding decision problem, the problem to decide whether the cost of a minimum terminal path decomposition is at most l. This decision problem is solved by dynamic programing in a single traversal of the tree.

Object-oriented real-time system modeling considering predicatable timing constraints (시간 제약 분석이 가능한 객체 지향 실시간 시스템 모델링)

  • 김영란;권영희;홍성백;박용문;구연설
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.8
    • /
    • pp.1937-1947
    • /
    • 1996
  • In the case of developing the real-time system using object-oriented method, k the problem of the timing constraints is certainly considered. we propose the method of modeling the object-oriented real-time system using the OMT methodology and the SDL. And we also present the predictable time table that reflects the constraints of real-time system into dynamic model of OMTs and the predicatable time formula of the sequence, repeat, and parallel routine. The proposed method is applied to the estimate of the maximum process time of the ATMs(Automatic teller machines) and is used to specifying the functional specification for the user interface of the ATMs using the SDL syntax and the object interaction graph.

  • PDF

Hypertext Model Extension and Dynamic Server Allocation for Database Gateway in Web Database Systems (웹 데이타베이스에서 하이퍼텍스트 모델 확장 및 데이타베이스 게이트웨이의 동적 서버 할당)

  • Shin, Pan-Seop;Kim, Sung-Wan;Lim, Hae-Chull
    • Journal of KIISE:Databases
    • /
    • v.27 no.2
    • /
    • pp.227-237
    • /
    • 2000
  • A Web database System is a large-scaled multimedia application system that has multimedia processing facilities and cooperates with relational/Object-Oriented DBMS. Conventional hypertext modeling methods and DB gateway have limitations for Web database because of their restricted versatile presentation abilities and inefficient concurrency control caused by bottleneck in cooperation processing. Thus, we suggest a Dynamic Navigation Model & Virtual Graph Structure. The Dynamic Navigation Model supports implicit query processing and dynamic creation of navigation spaces, and introduce node-link creation rule considering navigation styles. We propose a mapping methodology between the suggested hypertext model and the relational data model, and suggest a dynamic allocation scheduling technique for query processing server based on weighted value. We show that the proposed technique enhances the retrieval performance of Web database systems in processing complex queries concurrently.

  • PDF

Shift-transient characteristics of an automatic transmission (자동변속기의 변속과도특성 해석)

  • Chang, Hyo-Whan;Jun, Yoon-Sik
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.22 no.3
    • /
    • pp.654-662
    • /
    • 1998
  • Shift quality of an automatic transmission in a vehicle is mainly affected by transient pressures in the hydraulic system during shifting. In this study, dynamic modelings of the hydraulic system and the power train of an automatic transmission are made systematically by a bond-graph method. The dynamic characteristics of the line pressures and clutch/brake pressures during shiftings are investigated by simulations and verified by experiments. The effects of clutch/brake pressures on the shift torque are also investigated through driving simulation.

Dynamically-Correct Automatic Transmission Modeling (동적 특성을 고려한 자동변속기의 모델링)

  • 김정호;조동일
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.5 no.5
    • /
    • pp.73-85
    • /
    • 1997
  • An automatic transmission is an important element of automotive power systems that allows a driving convenience. Compared to a manual transmission, however, it has a few problems in efficiency, shift feel, and maintenance. To improve these, it is imperative to understand the dynamics of automatic transmissions. This paper develops a dynamically-correct model of an automatic transmission, using the bond graph method. The bond graph method is ideally suited for modeling power systems, because the method is based on generalized power variables. The bond graph method is capable of providing correct dynamic constraints and kinematic constraints, as well as the governing differential equations of motion. The bond graph method is applied to 1-4 in-gear ranges, as well as various upshifts and downshifts of an automatic transmission, which allows an accurate simulation of an automatic transmission. Conventional automatic transmission models have no dynamic constraint, which do not allow correct simulation studies.

  • PDF

Multiple-Fault Diagnosis for Chemical Processes Based on Signed Digraph and Dynamic Partial Least Squares (부호유향그래프와 동적 부분최소자승법에 기반한 화학공정의 다중이상진단)

  • 이기백;신동일;윤인섭
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.9 no.2
    • /
    • pp.159-167
    • /
    • 2003
  • This study suggests the hybrid fault diagnosis method of signed digraph (SDG) and partial least squares (PLS). SDG offers a simple and graphical representation for the causal relationships between process variables. The proposed method is based on SDG to utilize the advantage that the model building needs less information than other methods and can be performed automatically. PLS model is built on local cause-effect relationships of each variable in SDG. In addition to the current values of cause variables, the past values of cause and effect variables are inputted to PLS model to represent the Process armies. The measured value and predicted one by dynamic PLS are compared to diagnose the fault. The diagnosis example of CSTR shows the proposed method improves diagnosis resolution and facilitates diagnosis of masked multiple-fault.

Index Graph : An IR Index Structure for Dynamic Document Database (인덱스 그래프 : 동적 문서 데이터베이스를 위한 IR 인덱스 구조)

  • 박병권
    • The Journal of Information Systems
    • /
    • v.10 no.1
    • /
    • pp.257-278
    • /
    • 2001
  • An IR(information retrieval) index for dynamic document databases where insertion, deletion, and update of documents happen frequently should be frequently updated. As the conventional structure of IR index is, however, focused on the information retrieval purpose, its structure is inefficient to handle dynamic update of it. In this paper, we propose a new structure for IR Index, we call it Index Graph, which is organized by connecting multiple indexes into a graph structure. By analysis and experiment, we prove the Index Graph is superior to the conventional structure of IR index in the performance of insertion, deletion, and update of documents as well as the performance of information retrieval.

  • PDF

Time-Dependence of the Rheological Properties of Concentrated PVA Solution in DMSO (고농도 폴리비닐 알코올/디메틸 설폭사이드 용액의 유변학적 특성의 시간의존성)

  • 김남희
    • The Korean Journal of Rheology
    • /
    • v.9 no.3
    • /
    • pp.118-123
    • /
    • 1997
  • 검화도와 분자량이 상이한 폴리비닐 알코올을 디멜틸 설폭사이드에 녹여 폴리비닐 알코올/디멜틸 설폭사이드 용액을 준비하고 동적 유변학적 특성에 대한 시간과 온도 의존성 을 고찰하였다. 고농도 폴리비닐 알코올 용액의 유변학적 특성은 시간 의존성을 보여주었다. 복합점도와 저장탄성률은 시간에 따라 증가하였다. 또한 저장 탄성률과 손실탄성률의 그래 프에서 저장탄성률은 신간에 따라 증가하였으나 기울기는 시간에 따라 증가하였다. 또한 저 장탄성률과 손실탄성률의 그래프에서 저장탄성률은 시간에따라 증가하였으나 기울기는 시간 에 따라 감소하였다. 유변학적 특성의 시간 의존성은 분자량이 높을수록, 측정온도가 높을수 록 더 두드러지게 나타났다.

  • PDF

The Study on the Tube Drawing Process with a Floating Plug (프로팅 프러그를 사용한 관재 인발가공에 관한 연구)

  • Choi, Jae-Chan;Jin, In-Tai
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.5 no.4
    • /
    • pp.24-31
    • /
    • 1988
  • The Upper Bound Solution has been used to investigate the effect of the various parameters on the floating-plug tube-drawing precess. A kinematically admissible velocity field considering the change of the tube thickness is proposed for the deformation process. Taking into account the position of the plug in the deforming region, shear energy at entrance and exit, friction energy on contact area, homogeneous energy are calculated. The theoretical values in proposed velocity field are good agreement with experimental values, It is investigated that the tube thickness in the deforming region is changed slightly toward minimization of deforming energy and then the drawing stress in lower than the crawing stress in the velocity field that the tube thickness is uniform.

  • PDF