• Title/Summary/Keyword: Arrival Interval

Search Result 115, Processing Time 0.019 seconds

Impact of an Early Hospital Arrival on Treatment Outcomes in Acute Ischemic Stroke Patients (급성 뇌경색 환자의 증상 발현 후 응급실 도착까지의 시간이 치료 결과에 미치는 영향)

  • Kwon, Young-Dae;Yoon, Sung-Sang;Chang, Hye-Jung
    • Journal of Preventive Medicine and Public Health
    • /
    • v.40 no.2
    • /
    • pp.130-136
    • /
    • 2007
  • Objectives : Recent educational efforts have concentrated on patient's early hospital arrival after symptom onset. The purpose of this study was to evaluate the time interval between symptom onset and hospital arrival and to investigate its relation with clinical outcomes for patients with acute ischemic stroke. Methods : A prospective registry of patients with signs or symptoms of acute ischemic stroke, admitted to the OO Medical Center through emergency room, was established from September 2003 to December 2004. The interval between symptom onset and hospital arrival was recorded for each eligible patient and analyzed together with clinical characteristics, medication type, severity of neurologic deficits, and functional outcomes. Results : Based on the data of 256 patients, the median interval between symptom onset and hospital arrival was 13 hours, and 22% of patients were admitted to the hospital within 3 hours after symptom onset. Patients of not-mild initial severity and functional status showed significant differences between arrival hours of 0-3 and later than 3 in terms of their functional outcomes on discharge. Logistic regression models also showed that arrival within 3 hours was a significant factor influencing functional outcome (OR=5.6; 95% CI=2.1, 15.0), in addition to patient's initial severity, old age, cardioembolism subtype, and referral to another hospital. Conclusions : The time interval between symptom onset and hospital arrival significantly influenced treatment outcome for patients with acute ischemic stroke, even after controlling for other significant clinical characteristics. The findings provided initiatives for early hospital arrival of patients and improvement of emergency medical system.

Factors Delaying Hospital Arrival Time after Stroke (뇌졸중 환자들의 지연도착시간에 관한 요인들)

  • Song Yung Sun;Lee Su Young
    • Journal of Physiology & Pathology in Korean Medicine
    • /
    • v.16 no.5
    • /
    • pp.1075-1078
    • /
    • 2002
  • Objective: The management for the stroke should ,given as soon as possible to be effect. But Patients with stroke symptoms commonly delay many hours before seeking medical attention. We evaluated the factors which are related to the time of hospital arrival after acute stroke. Method: Data were obtained from 317 patients admitted to our hospital within 72 hours of stroke onset. We assessed demographic variables, stoke subtype. referral routes. history of previous stroke, level of consciousness, distance from the place where stroke occurred to hospital, and the time interval between onset of stroke and arrival at the hospital. Results: Mean patient age was 65.99±9.57 years. The mean time interval between onset of stroke and hospital arrival was 17.26±18.69 hours and 128 (40.38%) patients arrived within 6 hours. The patients whoes stoke subtype was infarction, who arrived our hospital by way of other hospital, who had no suffered from previous stroke and who showed no impairement of consciousness was arrived at the hospital late(p<0.05). Conclusion: The majority of patients arrive at the hospital after prolonged delays for multiple reasons, and patients with milder symptoms, for whom treatment might be more effective, were less likely to arrive in time for therapy. Our study suggest that effective education about stroke to the patients and public would be highly necessary.

Performance Analysis of Cal1 Arrival History-Based Location Update Algorithm (호도착기록에 기반한 위치갱신 알고리즘의 성능 분석)

  • Lee, Jong-Min;Kwon, Bo-seob;Maeng, Seung-Ryoul
    • The KIPS Transactions:PartA
    • /
    • v.10A no.4
    • /
    • pp.381-388
    • /
    • 2003
  • Location tracking is used to keep track of the location information of a mobile terminal in an idle state for a cail setup between mobile terminals. In this paper, we introduce a location update algorithm based on the call arrival history, which is appropriate for a variable call arrival rate over time. The location tracking strategy which uses the proposed algorithm can find changes in the call arrival rate by maintaining a call arrival history of a mobile terminal, from which a mobile terminal can calculate an appropriate timeout interval for a variable call arrival rate. We show that the proposed scheme is appropriate for a variable call arrival rate by presenting a simple analytical model and analytical results to investigate its performance for both a fixed and a variable call arrival rate.

Position Measuring System Design using Time Difference of Arrival (송신 신호의 도달 시간차(TDOA)를 이용한 위치 측정 시스템의 구현)

  • Kim, Dong-Uk
    • Proceedings of the KIEE Conference
    • /
    • 2001.11c
    • /
    • pp.394-397
    • /
    • 2001
  • There are several methods of measuring position. For example GPS, AOA, TDOA and using radio camera. In this Paper I used TDOA method in position measuring system. TDOA method uses arrival time difference. In position measuring system, three transfers which is placed in different position transfer signal to receiver in fixed time interval and receiver records arrival time of signal. Because receiver knows idle signal's arrival time, receiver can calculate the difference of the signal's arrival time between idle and real. When we obtain time difference we can know the receiver position by Newton Raphson method.

  • PDF

A Study in Seismic Signal Analysis for the First Arrival Picking (초동발췌를 위한 탄성파 신호분석연구)

  • Lee, Doo-Sung
    • Geophysics and Geophysical Exploration
    • /
    • v.10 no.2
    • /
    • pp.131-137
    • /
    • 2007
  • With consideration of the first arrival picking methodology and inherent errors in picking process, I propose, from the computerization point of view, a practical algorithm for picking and error computation. The proposed picking procedure consists of 2-step; 1) picking the first coherent peak or trough events, 2) derive a line which approximates the record in the interval prior to the pick, and set the intercept time of the line as the first break. The length of fitting interval used in experiment, is few samples less than 1/4 width of the arriving wavelet. A quantitative measure of the error involved in first arrival picking is defined as the time length that needed to determine if an event is the first arrival or not. The time length is expressed as a function of frequency bandwidth of the signal and the S/N ratio. For 3 sets of cross-well seismic data, first breaks are picked twice, by manually, and by the proposed method. And at the same time, the error bound for each trace is computed. Experiment results show that good performance of the proposed picking method, and the usefulness of the quantitative error measure in pick-quality evaluation.

Cell Spacing using the Theoretical Inter-arrival Time Method in ATM Networks (ATM 망에서 논리적 출발시간을 사용한 셀 간격 제어)

  • 남재현
    • Journal of the Korea Society of Computer and Information
    • /
    • v.7 no.4
    • /
    • pp.174-181
    • /
    • 2002
  • In this Paper, we proposed the method for the TIT (Theoretical Inter-arrival Time) was suggested in which it saves the cells by using the data buffer in the system rather than by using one separately from the internal controller, and it also releases these cells saved. The method of TIT complements the defect of the accumulation of the delay in the method of RDT which considers the time of the cell that is discharged from the established cell interval controller. And, in order to apply the merit of RDT, the method of TIT sets its standards on the cells arrival time as it was in the method of RAT.

  • PDF

Estimation of baroreflex sensitivity using pulse arrival time rather than systolic blood pressure measurement

  • Lee, Jong-Shill;Chee, Young-Joon
    • Journal of Biomedical Engineering Research
    • /
    • v.31 no.1
    • /
    • pp.14-19
    • /
    • 2010
  • Baroreflex sensitivity (BRS) is a parameter of the cardiovascular system that is reflected in changes in pulse interval (PD and systolic blood pressure (SBP). BRS contains information about how the autonomic nervous system regulates hemodynamic homeostasis. Normally the beat-to-beat SBP measurement and the pulse interval measured from the electrocardiogram (ECG) are required to estimate the BRS. We investigated the possibility of measuring BRS in the absence of a beat-to-beat SBP measurement device. Pulse arrival time (PAT), defined as the time between the R-peak of the ECG and a single characteristic point on the pulse wave recorded from any arterial location was measured by photoplethysmography. By comparing the BRS obtained from conventional measurements with our method during controlled breathing, we confirmed again that PAT and SBP are closely correlated, with a correlation coefficient of -0.82 to -0.95. The coherence between SBP and PI at a respiration frequency of 0.07-0.12 Hz was similar to the coherence between PAT and PI. Although the ranges and units of measurement are different (ms/mmHg vs. ms/ms) for BRS measured conventionally and by our method, the correlation is very strong. Following further investigation under various conditions, BRS can be reliably estimated without the inconvenient and expensive beat-to-beat SBP measurement.

Multi-Channel Speech Enhancement Algorithm Using DOA-based Learning Rate Control (DOA 기반 학습률 조절을 이용한 다채널 음성개선 알고리즘)

  • Kim, Su-Hwan;Lee, Young-Jae;Kim, Young-Il;Jeong, Sang-Bae
    • Phonetics and Speech Sciences
    • /
    • v.3 no.3
    • /
    • pp.91-98
    • /
    • 2011
  • In this paper, a multi-channel speech enhancement method using the linearly constrained minimum variance (LCMV) algorithm and a variable learning rate control is proposed. To control the learning rate for adaptive filters of the LCMV algorithm, the direction of arrival (DOA) is measured for each short-time input signal and the likelihood function of the target speech presence is estimated to control the filter learning rate. Using the likelihood measure, the learning rate is increased during the pure noise interval and decreased during the target speech interval. To optimize the parameter of the mapping function between the likelihood value and the corresponding learning rate, an exhaustive search is performed using the Bark's scale distortion (BSD) as the performance index. Experimental results show that the proposed algorithm outperforms the conventional LCMV with fixed learning rate in the BSD by around 1.5 dB.

  • PDF

Kirchhoff Prestack Depth Migration for the Complex Structure Using One-Way Wave Equation (일방향 파동방정식을 이용한 복잡한 구조의 키리히호프 중합전 심도구조보정)

  • Ko, Seung-Won;Yang, Seung-Jin
    • Geophysics and Geophysical Exploration
    • /
    • v.5 no.1
    • /
    • pp.18-22
    • /
    • 2002
  • As a single arrival traveltime, maximum energy arrival traveltime has been known as the most proper operator for Kirchhoff migration. In case of the model having the simple structure, both the first arrival traveltime and the maximum energy arrival traveltime can be used as the correct operators for Kirchhoff migration. However for some model having the complex and high velocity contrast structure, the migration using the first arrival traveltime can't give the correct depth section. That is, traveltime to be required in Kirchhoff migration is the maximum energy traveltime, but, needs considerably more calculation time than that of first arrival. In this paper, we propose the method for calculating the traveltime approximated to the maximum energy arrival using one-way wave equation. After defining the WAS(Wrap Around Suppression) factor to be used for calculating the first arrival traveltime using one-way wave equation as the function of lateral grid interval and depth and considering the delay time of source wavelet. we calculate the traveltime approximated to the maximum energy arrival. to verify the validity of this traveltime, we applied this to the migraion for simple structure and complex structure and compared the depth section with that obtained by using the first arrival traveltime.

An Optimal Solution Algorithm for Capacity Allocation Problem of Airport Arrival-Departure

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.10
    • /
    • pp.77-83
    • /
    • 2015
  • This paper suggests heuristic algorithm to obtain optimal solution of minimum number of delay aircraft in airport arrivals/departures problem. This problem can be solved only mathematical optimization method. The proposed algorithm selects the minimum delays capacity in various airport capacities for number of arrivals/departures aircraft in $i^{th}$ time interval (15 minutes). In details, we apply median selection method and left-right selection method. This algorithm can be get the optimal solution of minimum number of delay aircraft for sixes actual experimental data.