• Title/Summary/Keyword: mean time delay

Search Result 324, Processing Time 0.028 seconds

Time delay estimation between two receivers using basis pursuit denoising (Basis pursuit denoising을 사용한 두 수신기 간 시간 지연 추정 알고리즘)

  • Lim, Jun-Seok;Cheong, MyoungJun
    • The Journal of the Acoustical Society of Korea
    • /
    • v.36 no.4
    • /
    • pp.285-291
    • /
    • 2017
  • Many methods have been studied to estimate the time delay between incoming signals to two receivers. In the case of the method based on the channel estimation technique, the relative delay between the input signals of the two receivers is estimated as an impulse response of the channel between the two signals. In this case, the characteristic of the channel has sparsity. Most of the existing methods do not take advantage of the channel sparseness. In this paper, we propose a time delay estimation method using BPD (Basis Pursuit Denoising) optimization technique, which is one of the sparse signal optimization methods, in order to utilize the channel sparseness. Compared with the existing GCC (Generalized Cross Correlation) method, adaptive eigen decomposition method and RZA-LMS (Reweighted Zero-Attracting Least Mean Square), the proposed method shows that it can mitigate the threshold phenomenon even under a white Gaussian source, a colored signal source and oceanic mammal sound source.

Deadline-Aware Routing: Quality of Service Enhancement in Cyber-Physical Systems (사이버물리시스템 서비스 품질 향상을 위한 데드라인 인지 라우팅)

  • Son, Sunghwa;Jang, Byeong-Hoon;Park, Kyung-Joon
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.7 no.9
    • /
    • pp.227-234
    • /
    • 2018
  • Guaranteeing the end-to-end delay deadline is an important issue for quality of service (QoS) of delay sensitive systems, such as real-time system, networked control system (NCS), and cyber-physical system (CPS). Most routing algorithms typically use the mean end-to-end delay as a performance metric and select a routing path that minimizes it to improve average performance. However, minimum mean delay is an insufficient routing metric to reflect the characteristics of the unpredictable wireless channel condition because it only represents average value. In this paper, we proposes a deadline-aware routing algorithm that maximizes the probability of packet arrival within a pre-specified deadline for CPS by considering the delay distribution rather than the mean delay. The proposed routing algorithm constructs the end-to-end delay distribution in a given network topology under the assumption of the single hop delay follows an exponential distribution. The simulation results show that the proposed routing algorithm can enhance QoS and improve networked control performance in CPS by providing a routing path which maximizes the probability of meeting the deadline.

An Analysis of Ship Turnaround Time in the Port of Inchon (선박재항시간에 대한 분석연구 -인천항의 경우-)

  • Baik, In-Hum
    • Journal of Fisheries and Marine Sciences Education
    • /
    • v.10 no.1
    • /
    • pp.1-14
    • /
    • 1998
  • Transportation provides an infrastructure vital to economic growth, and it is also an integral part of production. As a port is regarded as the interface between the maritime transport and domestic transport sectors, it certainly play a key role in any economic development. Ship's delay caused by port congestion has recently has recently attracted attended with the analysis of overall operation in port. In order to analyse complicated port operation which contains large number of variable factors, queueing theory is needed to be adopted, which is applicable to a large scale transportation system in chiding ship's delay in Inchon port in relation to ship's delay problem. The overall findings are as follows ; 1. The stucture of queueing model in this port can be represented as a complex of multi-channel single-phase 2. Ship's arrival and service pattern were Poisson Input Erlangian Service. 3. The suitable formula to calculate the mean delay in this port, namely, $W_q={\frac{{\rho}}{{\lambda}(1-{\rho})}}{\frac{e{\small{N}}({\rho}{\cdot}N)}{D_{N-1}({\rho}{\cdot}N)}}$ Where, ${\lambda}$ : mean arrival rate ${\mu}$ : mean servicing rate N : number of servicing channel ${\rho}$ : utilization rate (l/Nm) $e{\small{N}}$ : the Poisson function $D_{(n-1)}$ : a function of the cumulative Poisson function 4. The utility rate is 95.0 percents in general piers, 75.39 percents in container piers, and watiting time 28.43 hours in general piers, 13.67 hours in container piers, and the length of queue is 6.17 ships in general piers, 0.93 ships in container piers, and the ship turnaround time is 107.03 hours in general piers, 51.93 hours in container piers.

  • PDF

Adaptive compensation method for real-time hybrid simulation of train-bridge coupling system

  • Zhou, Hui M.;Zhang, Bo;Shao, Xiao Y.;Tian, Ying P.;Guo, Wei;Gu, Quan;Wang, Tao
    • Structural Engineering and Mechanics
    • /
    • v.83 no.1
    • /
    • pp.93-108
    • /
    • 2022
  • Real-time hybrid simulation (RTHS) was applied to investigate the train-bridge interaction of a high-speed railway system, where the railway bridge was selected as the numerical substructure, and the train was physically tested. The interaction between the two substructures was reproduced by a servo-hydraulic shaking table. To accurately reproduce the high-frequency interaction responses ranging from 10-25Hz using the hydraulic shaking table with an inherent delay of 6-50ms, an adaptive time series (ATS) compensation algorithm combined with the linear quadratic Gaussian (LQG) was proposed and implemented in the RTHS. Testing cases considering different train speeds, track irregularities, bridge girder cross-sections, and track settlements featuring a wide range of frequency contents were conducted. The performance of the proposed ATS+LQG delay compensation method was compared to the ATS method and RTHS without any compensation in terms of residual time delays and root mean square errors between commands and responses. The effectiveness of the ATS+LQG method to compensate time delay in RTHS with high-frequency responses was demonstrated and the proposed ATS+LQG method outperformed the ATS method in yielding more accurate responses with less residual time delays.

Time Delay Estimation using Third-order Statistics and Subband Adaptive Filtering (3차 통계기법과 서브밴드 적응 필터링을 이용한 시간 지연 추정)

  • 박현석;남상원
    • Proceedings of the IEEK Conference
    • /
    • 2001.09a
    • /
    • pp.907-910
    • /
    • 2001
  • In this paper, we address a new time delay estimation method using third-order statistics and subband adaptive filtering to improve the accuracy of target detection for acoustic backscattered signals in a noise interference environment. Each reference and primary signals are decorrelated using the multiresolution analysis framework through a M-band discrete wavelet transform(M-DWT). Then noise effect can be reduced. Here, time delays are estimated iteratively in each subband using two different adaptation mechanisms that minimize the mean squared error (MSE) between the references and primary signal. More specifically, third-order cumulants and projection cross-correlation(PCC) criterion are utilized to achieve an effective SNR improvement for the time delay estimation.

  • PDF

QUEUEING ANALYSIS OF GATED POLLING SYSTEM FOR DYNAMIC BANDWIDTH ALLOCATION SCHEME IN AN EPON

  • Park, Chul-Geun;Kim, Ba-Ra;Han, Dong-Hwan
    • Journal of applied mathematics & informatics
    • /
    • v.16 no.1_2
    • /
    • pp.469-481
    • /
    • 2004
  • In this paper, we investigate the mean queue length and the mean packet delay of a dynamic bandwidth allocation(DBA) scheme in an Ethernet passive optical network(EPON). We focus on the interleaved polling system with a gated service discipline. We assume that input packets arrive at an optical network unit(ONU) according to Poisson process. We use a continuous time queueing model in order to find the queue length distribution of the gated interleaved polling system with the first stage input queue and the second stage transmission queue. We give some numerical results to investigate the mean queue lengths and mean packet delays for the symmetric polling system with statistically identical stations.

The Bus Arrival Time Prediction Using Bus Delay Time (버스지체시간을 활용한 버스도착시간 예측)

  • Lee, Seung-Hun;Mun, Byeong-Seop;Park, Beom-Jin
    • Journal of Korean Society of Transportation
    • /
    • v.28 no.1
    • /
    • pp.125-134
    • /
    • 2010
  • It is occurred bus arrival time errors when a bus arrives at a bus stop because of a variety of traffic condition such as traffic signal cycle, the time to get on and off a bus, a bus-only lane and so on. In this paper, bus delay time which is occurred as the result of traffic condition was estimated with Markov Chain process and bus arrival time at each bus stop was predicted with it. As the result of the study, it is confirmed to improve accuracy than the method of bus arrival time prediction with existing method (weighed moving average method) in case predicting bus arrival time using 7 by 7 and 9 by 9 matrixes.

The Impact of Surgical Timing of Hip Fracture on Mortality: Do the Cause and Duration of Delay Matter?

  • Jaiben George;Vijay Sharma;Kamran Farooque;Samarth Mittal;Vivek Trikha;Rajesh Malhotra
    • Hip & pelvis
    • /
    • v.35 no.3
    • /
    • pp.206-215
    • /
    • 2023
  • Purpose: Delay in performance of hip fracture surgery can be caused by medical and/or administrative reasons. Although early surgery is recommended, it is unclear what constitutes a delayed surgery and whether the impact of delayed surgery can differ depending on the reason for the delay. Materials and Methods: A total of 269 consecutive hip fracture patients over 50 years of age who underwent surgery were prospectively enrolled. They were divided into two groups: early and delayed (time from reaching the hospital to surgery less than or more than 48 hours). Patients were also categorized as fit or unfit based on anesthetic fitness. One-year mortality was recorded, and regression analyses were performed to assess the impact of delay on mortality. Results: A total of 153 patients (56.9%) had delayed surgery with a mean time to surgery of 87±70 hours. A total of 115 patients (42.8%) were considered medically fit to undergo surgery. No difference in one-year mortality was observed between patients with early surgery and those with delayed surgery (P=0.854). However, when assessment of the time to surgery was performed in a continuous manner, mortality increased with prolonged time to surgery, particularly in unfit patients, and higher mortality was observed when the delay exceeded six days (fit: P=0.117; unfit: P=0.035). Conclusion: The effect of delay on mortality was predominantly observed in patients who were not considered medically fit, suggesting that surgical delays might have a greater impact on patients with medical reasons for delay.

Design of an Effecient Local Area Computer Communication Network Controller for Office Automation (Contention Resolution Algorithm Based on CSMA/CD) (사무자동화를 위한 근거리 컴퓨터 통신망 콘트롤러 개발에 관한 연구)

  • 이명수;강창언
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.11 no.2
    • /
    • pp.137-145
    • /
    • 1986
  • The contention resolution algorithm with the limited packet delay time as well stable distribution as the packet delay time is proposed and implementes for improving the mean packet delay time in the network employing CSMA/CD as the access method. The implementation of node controller is based on IEEE 802.2 standard logical link control(LLC) and IEEE 802.3 standard medium access control(MAC). Some portion of IEEE 802.3 Standard MAC, and the Binary Exponential Back-off(BEB) algorithm is replaced by the proposed algorithm. From the view of normalized mean packet transmission delay time, the controller implemented here can be applicable to the office-automation system, and the factory-and laboratory-automation environment where the limited time criterion is very significant.

  • PDF

Recursive Least Squares Run-to-Run Control with Time-Varying Metrology Delays

  • Fan, Shu-Kai;Chang, Yuan-Jung
    • Industrial Engineering and Management Systems
    • /
    • v.9 no.3
    • /
    • pp.262-274
    • /
    • 2010
  • This article investigates how to adaptively predict the time-varying metrology delay that could realistically occur in the semiconductor manufacturing practice. Metrology delays pose a great challenge for the existing run-to-run (R2R) controllers, driving the process output significantly away from target if not adequately predicted. First, the expected asymptotic double exponentially weighted moving average (DEWMA) control output, by using the EWMA and recursive least squares (RLS) prediction methods, is derived. It has been found that the relationships between the expected control output and target in both estimation methods are parallel, and six cases are addressed. Within the context of time-varying metrology delay, this paper presents a modified recursive least squares-linear trend (RLS-LT) controller, in combination with runs test. Simulated single input-single output (SISO) R2R processes subject to various time-varying metrology delay scenarios are used as a testbed to evaluate the proposed algorithms. The simulation results indicate that the modified RLS-LT controller can yield the process output more accurately on target with smaller mean squared error (MSE) than the original RLSLT controller that only deals with constant metrology delays.