• Title/Summary/Keyword: Possible running time simulation

Search Result 16, Processing Time 0.039 seconds

A Study on the Possible Running Time Estimation of Tilting Train on the Gyeongbu line (경부선 틸팅열차의 가능 운전시간 추정 연구)

  • Rho, Hag-Lae;Han, Seong-Ho
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.64 no.4
    • /
    • pp.199-206
    • /
    • 2015
  • A rising attention is paid to the railway system in many countries. KOREA is also of the opinion that the railway has to play a more important role in the near future to face up to the problems that increase gradually in the transport sector. To attract more traffic to the rail networks, it is important for rail modes to have running time competitiveness. Tilting trains, where it is possible to tilt the car-body towards the center of the curve, are a less expensive alternative to shorten travelling times on existing lines. Running time for tilting train is one of the most important factors, with which passenger demand forecasting or economic feasibility analysis will be done. This paper evaluates the speed limitation of tilting train around curves and also presents calculation process of its simulated possible running time. Then the adequacy of estimated time is verified with running time for Korean protype tilting train TTX (Tilting Train eXpress) by actual test run. As a case study, the estimated running time for the production version of tilting train and its time saving are presented compared with 2012's conventional Saemaul trains and non-tilting trains on the Gyeongbu line in the Korean rail network.

Devlopment HLA DEVS-Obj-C Environment for Distributed Simulation (분산 시뮬레이션을 위한 HLA DEVS-Obj-C 환경 구축)

  • 최두진;조대호
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2002.11a
    • /
    • pp.85-89
    • /
    • 2002
  • Development of distributed simulation environment must be required in order to simulate the distributed models regionally and inter-operate with running simulations individually, Simulation based on DEVS formalism is difficult to simulate the distributed models. DEVS formalism is modeling methodology. To specify model, this formalism separates behavior and structure, therefore it is able to design complex model easily. HLA is standard framework of distribute simulation environment, It is defined to facilitate the interoperability and the reusability. RTI (Run Time Infrastructure) is software that provides common service to simulation systems and implementation of the HLA Interface Specification. Method of implementation is that modules cooperating with RTI are added to simulator on DEVS simulation environment. On the DEVS simulation environment (DEVS-Obj -C) that already developed, Highest class of abstract simulator uses service that RTI provide, then This environment is able to change DEVS model into Federate and run distribute simulation that inter-operates with the RTI. Because this distributed simulation environment includes convenience of modeling that obtains through the DEVS formalism and accompanies HLA standard, this environment make it possible to simulate with_ complex systems and heterogeneous simulations

  • PDF

A Study on the Urban Heat Simulation Model Incorporating the Climate Changes (기후변화가 반영된 도시 열환경 시뮬레이션 모델의 연구)

  • Kang, Jonghwa;Kim, Wansoo;Yun, Jeongim;Lee, Joosung;Kim, Seogcheol
    • Journal of Korean Society for Atmospheric Environment
    • /
    • v.34 no.5
    • /
    • pp.697-707
    • /
    • 2018
  • A fast running model comprising the climate change effects is proposed for urban heat environment simulations so as to be used in urban heat island studies and/or the urban planning practices. By combining Hot City Model, a high resolution urban temperature prediction model utilizing the Lagrangian particle tracing technique, and the numerical weather simulation data which are constructed up to year of 2100 under the climate change scenarios, an efficient model is constructed for simulating the future urban heat environments. It is applicable to whole city as well as to a small block area of an urban region, with the computation time being relatively short, requiring the practically manageable amount of the computational resources. The heat environments of the entire metropolitan Seoul area in South Korea are investigated with the aid of the model for the present time and for the future. The results showed that the urban temperature gradually increase up to a significant level in the future. The possible effects of green roofs on the buildings are also studied, and we observe that green roofs don't lower the urban temperature efficiently while making the temperature fields become more homogeneous.

Design of Grid Workflow System Scheduler for Task Pipelining (작업 파이프라이닝을 위한 그리드 워크플로우 스케줄러 설계)

  • Lee, In-Seon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.7
    • /
    • pp.1-10
    • /
    • 2010
  • The power of computational Grid resources can be utilized on users desktop by employing workflow managers. It also helps scientists to conveniently put together and run their own scientific workflows. Generally, stage-in, process and stage-out are serially executed and workflow systems help automate this process. However, as the data size is exponentially increasing and more and more scientific workflows require multiple processing steps to obtain the desired output, we argue that the data movement will possess high portion of overall running time. In this paper, we improved staging time and design a new scheduler where the system can execute concurrently as many jobs as possible. Our simulation study shows that 10% to 40% improvement in running time can be achieved through our approach.

Low Power Time Synchronization for Wireless Sensor Networks Using Density-Driven Scheduling

  • Lim, HoChul;Kim, HyungWon
    • Journal of information and communication convergence engineering
    • /
    • v.16 no.2
    • /
    • pp.84-92
    • /
    • 2018
  • For large wireless sensor networks running on battery power, the time synchronization of all sensor nodes is becoming a crucial task for waking up sensor nodes with exact timing and controlling transmission and reception timing. However, as network size increases, this synchronization process tends to require long processing time consume significant power. Furthermore, a naïve synchronization scheduler may leave some nodes unsynchronized. This paper proposes a power-efficient scheduling algorithm for time synchronization utilizing the notion of density, which is defined by the number of neighboring nodes within wireless range. The proposed scheduling algorithm elects a sequence of minimal reference nodes that can complete the synchronization with the smallest possible number of hops and lowest possible power consumption. Additionally, it ensures coverage of all sensor nodes utilizing a two-pass synchronization scheduling process. We implemented the proposed synchronization algorithm in a network simulator. Extensive simulation results demonstrate that the proposed algorithm can reduce the power consumption required for the periodic synchronization process by up to 40% for large sensor networks compared to a simplistic multi-hop synchronization method.

Ship information system: overview and research trends

  • Liu, Sheng;Xing, Bowen;Li, Bing;Gu, Mingming
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.6 no.3
    • /
    • pp.670-684
    • /
    • 2014
  • Ship Information Systems (SISs) have been one of the main research focuses in ship design and become a multidisciplinary area. With these growing research trends, it is important to consolidate the latest knowledge and information to keep up with the research needs. In this paper, the SIS and its different forms are introduced and discussed. The beginning of this paper discusses the history and evolution of SIS. The next part of this paper focuses on different fields and research areas such as networking technology, information fusion, information decision, message display, ship control in real-time SISs. A Semi-Physical Simulation Platform (SPSIM) designed for SIS research and its running effect through a new Fuzzy-PID fusion algorithm are introduced in this paper then. A brief literature survey and possible future direction concerning each topic is included.

Performance Comparison of Particle Simulation Using GPU Between OpenGL and Unity (OpenGL과 Unity간의 GPU를 이용한 Particle Simulation의 성능 비교)

  • Kim, Min Sang;Sung, Nak-Jun;Choi, Yoo-Joo;Hong, Min
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.6 no.10
    • /
    • pp.479-486
    • /
    • 2017
  • Recently, GPGPU has been able to increase the degradation of computer performance, and it is now possible to run physically based real-time simulations on PCs that require high computational complexity. Physical calculations applied in physics simulation can be performed by parallel processing, and can be efficiently performed using parallel computation using Compute shader recently supported by OpenGL 4.3 and Unity 4.0. In this paper, we measure and compare the number of performance in real - time physics simulation in OpenGL running on various platforms and Unity, a content creation tool supporting various platforms. Particle simulation experiments show that particle simulation using Unity performs faster than 136.04%. It is expected that it will be able to select better development tools for future multi - platform support.

Resource Allocation for Device-to-Device Communications Reusing Uplink in Cellular Networks

  • Radwan, Amr
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.12
    • /
    • pp.1468-1474
    • /
    • 2015
  • Efficient spectrum sharing is an important issue in Device-to-Device (D2D) communications underlaying cellular networks as it can mitigate the interference to cellular users and improve the performance of the systems. In this paper, we formulate the radio resource allocation in D2D communications as a mixed nonlinear integer programing. We show the formulated problem is NP-hard and thus a polynomial time algorithm to solve is not possible. Since such a problem is very hard to obtain the optimal solution within a short running time, we instead propose a fast heuristic suboptimal algorithm to mitigate the interference caused to cellular users and improve the performance of the systems. Simulation results are provided to evaluate the performance of the proposed algorithm.

A Study on the Improvement of the Train Operation Speed for the New Metropolitan Railway (신설 광역철도 운전속도 향상방안 연구)

  • Gu, Bon-Roe;Jang, Seong-Yong
    • Proceedings of the KSR Conference
    • /
    • 2008.11b
    • /
    • pp.1-9
    • /
    • 2008
  • A wide metropolitan railway and a metropolitan railway in metropolitan area are transportation systems to cope with possible large demand and are under construction continually. A wide metropolitan railway and a metropolitan railway in metropolitan area are running with low speed because it is difficult to improve train speed according to short distances between stations and topography. There is a few study on improving commercial speed on the existing wide metropolitan railway and metropolitan railway in metropolitan area, but there is no study on a new wide metropolitan railway. This study present speed-up scheme of the Sosa-Wonsi line by enlarging the curve radius, reducing the horizontal steep gradient, reducing the stopping time, speeding up at underground section, and installing the PSD, etc. This scheme is evaluated using the simulation technique.

  • PDF

A Study on Improvement of Limit Speed for CBTC within Exsiting Urban Railroad Sectors (기존 도시철도 구간에서 CBTC를 위한 제한속도 향상에 관한 연구)

  • Ha, Kwan-Yong;Park, Jong-Hun;Lee, Jong-Kye;Sung, Ki-Chang;Kim, Gi-Chun
    • Proceedings of the KSR Conference
    • /
    • 2011.05a
    • /
    • pp.356-362
    • /
    • 2011
  • Usually urban railways are built under ground thus the necessary condition of urban railroad, a linear-shaped track, causes a difficulty in enhancement of speed limits of urban rail. Also the underground construction of city railroad produces speed limit values reduced according to a speed code array, in case of speed decision according to the conventional block section division, thus onventionally it could not but apply speed limit values lower than actual safety speeds. In this study, The above two facts induced the author to study on a method to enhance speed limit values for CBTC within existing urban railroad sectors. Since it is possible to exchange data continuously and to control speeds in case of railroads based on CBTC, the author applied result values of speed limits, which were gained based on a railroad condition, a linear track, to the CBTC system without correction of the result values and then the author compared and analyzed, through simulation, the running times and the efficiencies of running energies between railway stations, between the existing fixed-block system and the CBTC system. As a result simulation, the improvement of speed and the deceleration distance of reduction confirmed that it was effective to reduce the time to travel between stations. A fixed block the set of constraints on the speed limit, he way the operation is optimized based CBTC speed limit by suggesting ways to reset the scheduled speed measures to improve were extracted.

  • PDF