• Title/Summary/Keyword: 지연시간 계산

Search Result 502, Processing Time 0.021 seconds

A Model for Analyzing Time-Varying Passengers' Crowdedness Degree of Subway Platforms Using Smart Card Data (스마트카드자료를 활용한 지하철 승강장 동적 혼잡도 분석모형)

  • Shin, Seongil;Lee, Sangjun;Lee, Changhun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.18 no.5
    • /
    • pp.49-63
    • /
    • 2019
  • Crowdedness management at subway platforms is essential to improve services, including the prevention of train delays and ensuring passenger safety. Establishing effective crowdedness mitigation measures for platforms requires accurate estimation of the congestion level. There are temporal and spatial constraints since crowdedness on subway platforms is assessed at certain locations every 1-2 years by hand counting. However, smart cards generate real-time big data 24 hours a day and could be used in estimating congestion. This study proposes a model based on data from transit cards to estimate crowdedness dynamically. Crowdedness was defined as demand, which can be translated into passengers dynamically moving along a subway network. The trajectory of an individual passenger can be identified through this model. Passenger flow that concentrates or disperses at a platform is also calculated every minute. Lastly, the platform congestion level is estimated based on effective waiting areas for each platform structure.

A method of determining pulse start points for reduction in computational amount of intercept array sonar (방수배열소나의 연산량 감소를 위한 펄스 시작점 산출 방법)

  • Do-Young Kim;Kee-Cheol Shin;Tae-Jin Jung;Min-Jeong Eom
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.25 no.1
    • /
    • pp.1-6
    • /
    • 2024
  • The main function of intercept array sonar is to detect pulses radiated from enemy surface ships, submarines, and torpedoes. When a pulse is detected, it is a high risk situation for the own ship, so it is very important to find the target's location for the ship's maneuverability and survival. The target's location is calculated by finding the starting point of the pulse received form each sensor and calculating the time delay between sensors. In order to find starting point, the envelope of the signal is calculated and differential filtering is performed. However, since intercept array sonar has a high sampling frequency of the signal, the number of samples to be processed is large, so this process has a problem with a large computational amount. In this paper, we propose a pulse starting point calculation method using decimation for reducing computational amount. Simulations were performed while changing the decimation factor, and it was confirmed that computational amount was reduced. The proposed method is expected to be effective in real-time processing system and have advantages in resource utilization.

Parallel Distributed Implementation of GHT on Ethernet Multicluster (이더넷 다중 클러스터에서 GHT의 병렬 분산 구현)

  • Kim, Yeong-Soo;Kim, Myung-Ho;Choi, Heung-Moon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.3
    • /
    • pp.96-106
    • /
    • 2009
  • Extending the scale of the distributed processing in a single Ethernet cluster is physically restricted by maximum ports per switch. This paper presents an implementation of MPI-based multicluster consisting of multiple Ethernet switches for extending the scale of distributed processing, and a asymptotical analysis for communication overhead through execution-time analysis model. To determine an optimum task partitioning, we analyzed the processing time for various partitioning schemes, and AAP(accumulator array partitioning) scheme was finally chosen to minimize the overall communication overhead. The scope of data partitioned in AAP was modified to fit for incremented nodes, and suitable load balancing algorithm was implemented. We tried to alleviate the communication overhead through exploiting the pipelined broadcast and flat-tree based result gathering, and overlapping of the communication and the computation time. We used the linear pipeline broadcast to reduce the communication overhead in intercluster which is interconnected by a single link. Experimental results shows nearly linear speedup by the proposed parallel distributed GHT implemented on MPI-based Ethernet multicluster with four 100Mbps Ethernet switches and up to 128 nodes of Pentium PC.

Simplified Approximation Method of the Multi-Compartments Model on the Migration of Contaminant through Unsaturated Zone (불포화대에서 오염물질 이동현상에 대한 다중구획 모델의 단순 근사방법)

  • Cheong, Jae-Hak
    • Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
    • /
    • v.5 no.1
    • /
    • pp.29-37
    • /
    • 2007
  • A conventional single compartment model cannot simulate reasonably the migration phenomenon of contaminants through unsaturated zone, due to the intrinsic unrealistic assumption of the compartment model that contaminants entering a compartment are immediately and uniformly mixed. Although, a multi-compartments model, in which even physically identical layer is divided into multiple compartments, may be used for explaining the retardation of contaminant mass flux along with increasing number of compartments, its numerical modeling is usually time-consuming and appropriate analytical solutions have not been reported yet. In order to improve the conventional compartment models on contaminant migration through unsaturated zone, a series of analytical solutions for multi-compartments model were derived and a generalized constraint under which the results from multi-compartments model can be simply approximated by single compartment model was proposed. The simplified approximation method was verified by a simple numerical analysis on the constraint under hypothetical conditions. It was also proved that the influent contaminant transfer rate from the bulk unsaturated zone can be generally represented into a time-dependent nominal transfer rate rather than a constant. In addition, the nominal transfer rate turned out to be very sensitive to the contaminant transfer rate between compartments in unsaturated zone, but to be almost insensitive to the transfer rate from contaminated zone. It is expected that the simplified approximation method developed in this study can be used for rapid and reasonable estimation of the migration phenomenon of contaminant through unsaturated zone, instead of time-consuming multi-compartments modeling.

  • PDF

Layer-separable PES Packetization and Processing Scheme for SVC-based Satellite Broadcasting Service (SVC 기반의 위성방송 서비스를 위한 계층 분리형 PES 패킷화 및 처리 기법)

  • Chi, Won-Sup;Seo, Kwang-Deok;Kim, Jin-Soo;Lee, In-Ki;Chang, Dae-Ig
    • Journal of Broadcast Engineering
    • /
    • v.14 no.5
    • /
    • pp.561-572
    • /
    • 2009
  • In this paper, we propose an efficient layer-separable PES packetization and processing scheme for DVB-S2 satellite broadcasting service based on SVC video. Unlike the conventional single layer-based video coding such as MPEG-2, MPEG-4 and H.264, SVC can combine numerous number of video layers, which are aggregated to a single bitstream. Therefore, it is necessary to devise a new PES packetization scheme that can efficiently separate multiple video layers of SVC. In order to combine the layered characteristics of the SVC video and the robust channel coding capability of LDPC (Low Density Parity Check) of DVB-S2 for unequal error protection, we propose an efficient PES packetization in the transmitter side and PES packet processing scheme in the receiver side of DVB-S2. We prove the effectiveness of the proposed scheme in terms of processing speed and time delay required for processing of the separated layers of SVC video in the satellite broadcasting service.

Performance Evaluation of Output Queueing ATM Switch with Finite Buffer Using Stochastic Activity Networks (SAN을 이용한 제한된 버퍼 크기를 갖는 출력큐잉 ATM 스위치 성능평가)

  • Jang, Kyung-Soo;Shin, Ho-Jin;Shin, Dong-Ryeol
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.8
    • /
    • pp.2484-2496
    • /
    • 2000
  • High speed switches have been developing to interconnect a large number of nodes. It is important to analyze the switch performance under various conditions to satisfy the requirements. Queueing analysis, in general, has the intrinsic problem of large state space dimension and complex computation. In fact, The petri net is a graphical and mathematical model. It is suitable for various applications, in particular, manufacturing systems. It can deal with parallelism, concurrence, deadlock avoidance, and asynchronism. Currently it has been applied to the performance of computer networks and protocol verifications. This paper presents a framework for modeling and analyzing ATM switch using stochastic activity networks (SANs). In this paper, we provide the ATM switch model using SANs to extend easily and an approximate analysis method to apply A TM switch models, which significantly reduce the complexity of the model solution. Cell arrival process in output-buffered Queueing A TM switch with finite buffer is modeled as Markov Modulated Poisson Process (MMPP), which is able to accurately represent real traffic and capture the characteristics of bursty traffic. We analyze the performance of the switch in terms of cell-loss ratio (CLR), mean Queue length and mean delay time. We show that the SAN model is very useful in A TM switch model in that the gates have the capability of implementing of scheduling algorithm.

  • PDF

Implementation of Stopping Criterion Algorithm using Variance Values of LLR in Turbo Code (터보부호에서 LLR 분산값을 이용한 반복중단 알고리즘 구현)

  • Jeong Dae-Ho;Kim Hwan-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.9 s.351
    • /
    • pp.149-157
    • /
    • 2006
  • Turbo code, a kind of error correction coding technique, has been used in the field of digital mobile communication system. As the number of iterations increases, it can achieves remarkable BER performance over AWGN channel environment. However, if the number of iterations is increased in the several channel environments, any further iteration results in very little improvement, and requires much delay and computation in proportion to the number of iterations. To solve this problems, it is necessary to device an efficient criterion to stop the iteration process and prevent unnecessary delay and computation. In this paper, it proposes an efficient and simple criterion for stopping the iteration process in turbo decoding. By using variance values of LLR in turbo decoder, the proposed algerian can largely reduce the average number of iterations without BER performance degradation in all SNR regions. As a result of simulation, the average number of iterations in the upper SNR region is reduced by about $34.66%{\sim}41.33%$ compared to method using variance values of extrinsic information. the average number of iterations in the lower SNR region is reduced by about $13.93%{\sim}14.45%$ compared to CE algorithm and about $13.23%{\sim}14.26%$ compared to SDR algorithm.

Radix-4 Trellis Parallel Architecture and Trace Back Viterbi Decoder with Backward State Transition Control (Radix-4 트렐리스 병렬구조 및 역방향 상태천이의 제어에 의한 역추적 비터비 디코더)

  • 정차근
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.5
    • /
    • pp.397-409
    • /
    • 2003
  • This paper describes an implementation of radix-4 trellis parallel architecture and backward state transition control trace back Viterbi decoder, and presents the application results to high speed wireless LAN. The radix-4 parallelized architecture Vietrbi decoder can not only improve the throughput with simple structure, but also have small processing delay time and overhead circuit compared to M-step trellis architecture one. Based on these features, this paper addresses a novel Viterbi decoder which is composed of branch metric computation, architecture of ACS and trace back decoding by sequential control of backward state transition for the implementation of radix-4 trellis parallelized structure. With the proposed architecture, the decoding of variable code rate due to puncturing the base code can easily be implemented by the unified Viterbi decoder. Moreover, any additional circuit and/or peripheral control logic are not required in the proposed decoder architecture. The trace back decoding scheme with backward state transition control can carry out the sequential decoding according to ACS cycle clock without additional circuit for survivor memory control. In order to evaluate the usefulness, the proposed method is applied to channel CODEC of the IEEE 802.11a high speed wireless LAN, and HDL coding simulation results are presented.

K-connected, (K+1)-covered Fault-tolerant Topology Control Protocol for Wireless Sensor Network (무선 센서 망을 위한 K-연결 (K+1)-감지도 고장 감내 위상 제어 프로토콜)

  • Park, Jae-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.11B
    • /
    • pp.1133-1141
    • /
    • 2009
  • In this paper, we present a distributed fault-tolerant topology control protocol that configure a wireless sensor network to achieve k-connectivity and (k+1)-coverage. One fundamental issue in sensor networks is to maintain both sensing coverage and network connectivity in order to support different applications and environments, while some least active nodes are on duty. Topology control algorithms have been proposed to maintain network connectivity while improving energy efficiency and increasing network capacity. However, by reducing the number of links in the network, topology control algorithms actually decrease the degree of routing redundancy. Although the protocols for resolving such a problem while maintaining sensing coverage were proposed, they requires accurate location information to check the coverage, and most of active sensors in the constructed topology maintain 2k-connectivity when they keep k-coverage. We propose the fault-tolerant topology control protocol that is based on the theorem that k-connectivity implies (k+1)-coverage when the sensing range is at two times the transmission range. The proposed distributed algorithm does not need accurate location information, the complexity is O(1). We demonstrate the capability of the proposed protocol to provide guaranteed connectivity and coverage, through both geometric analysis and extensive simulation.

Velocity Model Building using Waveform Inversion from Single Channel Engineering Seismic Survey (탄성파 파형역산을 이용한 엔지니어링 목적의 단일채널 탄성파 탐사자료에서의 속도모델 도출)

  • Choi, Yeon Jin;Shin, Sung Ryul;Ha, Ji Ho;Chung, Woo Keen;Kim, Won Sik
    • Geophysics and Geophysical Exploration
    • /
    • v.17 no.4
    • /
    • pp.231-241
    • /
    • 2014
  • Recently, single channel seismic survey for engineering purpose have been used widely taking advantage of simple processing. However it is very difficult to obtain high fidelity subsurface image by single channel seismic due to insufficient fold coverage. Recently, seismic waveform inversion in multi channel seismic survey is utilized for accurate subsurface imaging even in complex terrains. In this paper, we propose the seismic waveform inversion algorithm for velocity model building using a single channel seismic data. We utilize the Gauss-Newton method and assume that subsurface model is 1-Dimensional. Seismic source estimation technique is used and offset effect is also corrected by removing delay time by offset. Proposed algorithm is verified by applying modified Marmousi2 model, and applied to field data set obtained in port of Busan.