• Title/Summary/Keyword: Real-time Distributed Simulation

Search Result 213, Processing Time 0.027 seconds

Development of Geometric Moments Based Ellipsoid Model for Extracting Spatio-Temporal Characteristics of Rainfall Field (강우장의 시공간적 특성 추출을 위한 기하학적 모멘트 기반 등가타원 모형 개발)

  • Kwon, Hyun-Han;So, Byung-Jin;Kim, Min-Ji;Pack, Se-Hoon
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.31 no.6B
    • /
    • pp.531-539
    • /
    • 2011
  • It has been widely acknowledged that climate system associated with extreme rainfall events was difficult to understand and extreme rainfall simulation in climate model was more difficult. This study developed a new model for extracting rainfall filed associated with extreme events as a way to characterize large scale climate system. Main interests are to derive location, size and direction of the rainfall field and this study developed an algorithm to extract the above characteristics from global climate data set. This study mainly utilized specific humidity and wind vectors driven by NCEP reanalysis data to define the rainfall field. Geometric first and second moments have been extensively employed in defining the rainfall field in selected zone, and an ellipsoid based model were finally introduced. The proposed geometric moments based ellipsoid model works equally well with regularly and irregularly distributed synthetic grid data. Finally, the proposed model was applied to space-time real rainfall filed. It was found that location, size and direction of the rainfall field was successfully extracted.

A Study on the Information Management System Support for the Intelligent Autonomous Navigation Systems (지능형 자율운항시스템 지원을 위한 정보 관리 시스템에 관한 연구)

  • Kim, Eun-Kyoung;Kim, Yong-Gi
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.25 no.3
    • /
    • pp.279-286
    • /
    • 2015
  • The rapid increase of the current marine accidents is mainly due to the human execution errors. In an effort to address this, various kinds of researches such as construction of the digital vessels and vessel information monitoring systems have been conducted. But for safe navigation of vessels, it lack on systems study which can efficiently store, utilize and manage the mass data accepted by the vessel. In this paper, we propose a VWS(Virtual World System) that is based on the architecture of intelligent systems RVC(Reactive Layer-Virtual World-Considerative Layer) model of intelligent autonomous navigation system. VWS is responsible to store all the necessary information for safe navigation of the vessel and the information services to the sub-system of intelligent autonomous navigation system. VWS uses topology database to express the specific problem area, and utilizes a scheduling to reflect the characteristics of the real-time processing environment. Also, Virtual World defines API for the system to reflect the characteristics of the distributed processing environment. As a case study, the VWS is applied to a intelligent ship autonomous navigation system, and simulation is done to prove the effectiveness of the proposed system.

Fast Join Mechanism that considers the switching of the tree in Overlay Multicast (오버레이 멀티캐스팅에서 트리의 스위칭을 고려한 빠른 멤버 가입 방안에 관한 연구)

  • Cho, Sung-Yean;Rho, Kyung-Taeg;Park, Myong-Soon
    • The KIPS Transactions:PartC
    • /
    • v.10C no.5
    • /
    • pp.625-634
    • /
    • 2003
  • More than a decade after its initial proposal, deployment of IP Multicast has been limited due to the problem of traffic control in multicast routing, multicast address allocation in global internet, reliable multicast transport techniques etc. Lately, according to increase of multicast application service such as internet broadcast, real time security information service etc., overlay multicast is developed as a new internet multicast technology. In this paper, we describe an overlay multicast protocol and propose fast join mechanism that considers switching of the tree. To find a potential parent, an existing search algorithm descends the tree from the root by one level at a time, and it causes long joining latency. Also, it is try to select the nearest node as a potential parent. However, it can't select the nearest node by the degree limit of the node. As a result, the generated tree has low efficiency. To reduce long joining latency and improve the efficiency of the tree, we propose searching two levels of the tree at a time. This method forwards joining request message to own children node. So, at ordinary times, there is no overhead to keep the tree. But the joining request came, the increasing number of searching messages will reduce a long joining latency. Also searching more nodes will be helpful to construct more efficient trees. In order to evaluate the performance of our fast join mechanism, we measure the metrics such as the search latency and the number of searched node and the number of switching by the number of members and degree limit. The simulation results show that the performance of our mechanism is superior to that of the existing mechanism.