• Journal of Korean Academy of Nursing
• /
• v.33 no.8
• /
• pp.1153-1160
• /
• 2003

Purpose. 1) To identify the time taken from symptom onset to the arrival at the hospital (pre-hospital delay time) and time taken from the arrival at the hospital to the initiation of the major treatment (in-hospital delay time) 2) to examine whether rapid treatment results in lower mortality. 3) to examine whether the pre- and in-hospital delay time can independently predict in-hospital mortality. Methods. A retrospective study with 586 consecutive AMI patients was conducted. Results. Pre-hospital delay time was 5.25 (SD=10.36), and in-hospital delay time was 1.10 (SD=1.00) hours for the thrombolytic therapy and 50.24 (SD=121.18) hours for the percutaneous transluminal coronary angio-plasty (PTCA). In-hospital mortality was the highest when the patients were treated between 4 to 48 hours after symptom onset using PTCA (p=.02), and when treated between 30 minutes and one hour after hospital arrival using thrombolytics (p=.01). Using a hierarchical logistic regression model, the pre- and in-hospital delay times did not predict the in-hospital mortality. Conclusion. Pre- and in-hospital delay times need to be decreased to meet the desirable therapeutic time window. Thrombolytics should be given within 30 minutes after arrival at the hospital, and PTCA should be initiated within 4 hours after symptom onset to minimize in-hospital mortality of AMI patients.

• The Journal of the Acoustical Society of Korea
• /
• v.32 no.6
• /
• pp.525-531
• /
• 2013

In this paper, we propose to apply low delay algorithm using power complementary window to Integer Modified Discrete Cosine Transform (IntMDCT). Conventional transform, the Modified Discrete Cosine Transform (MDCT) usually produces floating point values for integer input values. This causes the expansion of the data. To refine on this, IntMDCT that produces integer values even for integer input values have emerged. However, IntMDCT has a problem of the algorithm delay, such as MDCT. Delay has became a key issue in environments for the purpose of real-time communications. In order to reduce the delay, the proposed algorithm was applied and the results of the performance evaluation show that delay of IntMDCT has reduced by halfexisting delay.

• The KIPS Transactions:PartC
• /
• v.14C no.7
• /
• pp.571-582
• /
• 2007

Vehicular ad-hoc networks is temporarily established through inter-vehicle communication without any additional infrastructure aids. It requires a immediate message propagation because it mainly deals with critical traffic information such as traffic accidents. The distance-based broadcast scheme is one of the representative broadcast schemes for vehicular ad-hoc network. In this scheme, a node to disseminate messages is selected based on a distance from a source node. However, a message propagation delay will be increased if the relay nodes are not placed at the border of transmission range of the source node. In particular, when the node density is low, the message propagation delay is getting longer. In this paper, we propose a time-window reservation based relay node selection scheme. A node receiving the alert message from the source node has its time-window and randomly selects its waiting time within the given time-window range. A proportional time period of the given time-window is reserved in order to reduce the message propagation delay. The experimental results show that the proposed scheme has shorter message propagation delay than the distance-based broadcast scheme irrespective of node density in VANET. In particular, when the node density is low, the proposed scheme shows about 26% shorter delay and about 46% better performance in terms of compound metric, which is a function of propagation latency and network traffic.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.3 s.345
• /
• pp.126-134
• /
• 2006

Traditional TCP implementations have the under-utilization problem in large bandwidth delay product networks especially during the startup phase. In this paper, we propose a delay-based congestion control(DCC) mechanism to solve the problem. DCC is subdivided into linear and exponential growth phases. When there is no queueing delay, the congestion window grows exponentially during the congestion avoidance period. Otherwise, it maintains linear increase of congestion window similar to the legacy TCP congestion avoidance algorithm. The exponential increase phase such as the slow-start period in the legacy TCP can cause serious performance degradation by packet losses in case the buffer size is insufficient for the bandwidth-delay product, even though there is sufficient bandwidth. Thus, the DCC uses the RTT(Round Trip Time) status and the estimated queue size to prevent packet losses due to excessive transmission during the exponential growth phase. The simulation results show that the DCC algorithm significantly improves the TCP startup time and the throughput performance of TCP in large bandwidth delay product networks.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.05a
• /
• pp.377-379
• /
• 2023

Concept drift detection on data stream is the major issue to maintain the performance of the machine learning model. Since the online stream is to be a function of time, the classical statistic methods are hard to apply. In particular case of seasonal time series, a novel window strategy with Fourier analysis however, gives a chance to adapt the classical methods on the series. We explore the KS-test for an adaptation of the periodic time series and show that this strategy handles a complicate time series as an ordinary tabular dataset. We verify that the detection with the strategy takes the second place in time delay and shows the best performance in false alarm rate and detection accuracy comparing to that of arbitrary window sizes.

• The Korean Journal of Applied Statistics
• /
• v.26 no.2
• /
• pp.291-305
• /
• 2013

Collective traffic data (BPS, PPS etc.) for detection against the distributed denial of service attack on network is the time sequencing big data. The algorithm to detect the change point in the big data should be accurate and exceed in detection time and detection capability. In this work, the sliding window and discretization method is used to detect the change point in the big data, and propose five nonparametric test statistics using empirical distribution functions and ranks. With various distribution functions and their parameters, the detection time and capability including the detection delay time and the detection ratio for five test methods are explored and discussed via monte carlo simulation and illustrative examples.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.962-964
• /
• 1987

In this paper a virtual route pacing control mechanism is introduced to the flow control of M-hop virtual route in the packet data network. The results described in this paper show us a comparison of the relationship between the throughput and the time-delay with the variation of the parameter, the normalized applied load. for the fixed window size.

• Journal of IKEEE
• /
• v.9 no.2 s.17
• /
• pp.123-135
• /
• 2005

3GPP RLC protocol specification adopted a window-controlled selective-repeat ARQ scheme for provisioning reliable data transmission. Inevitably, the re-ordering issue arises in the 3GPP's ARQ since it belongs to the selective-repeat ARQ clan. A long re-ordering time results in the degradation of throughput and delay performance, and may invoke the overflow of the re-ordering buffer. Also, the re-ordering time must be regulated to meet the requirements of some services which are both loss-sensitive and delay-sensitive. In the 3GPP's ARQ, we may deflate the occupancy of the re-ordering buffer by reducing the window size and/or length of the status report period. Such a decrease, however, deteriorates the throughput and delay performance and encroaches the resource of the reverse channel. Aiming at reducing the occupancy at the re-ordering buffer while suppressing the degradation of throughput and delay performance, we propose threshold-dependent occupancy control schemes, identified as post-threshold and pre-threshold schemes, as supplements to the 3GPP's ARQ. For judging the effectiveness of the proposed schemes, we investigate peak occupancy, maximum throughput and average delay in the practical environment involving fading channels. From the simulation results, we observe that the proposed schemes invoke the performance trade-off between occupancy and throughput in general. Also, we reveal that the post-threshold scheme is able to improve the throughput and delay performance of the ordinary 3GPP's ARQ without inflating the occupancy of the re-ordering buffer.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.2
• /
• pp.99-123
• /
• 1997

Performance analysis of NTT/BT protocol is investigated, which is a GFC (Generic Flow Control) ptotocol in ATM (Asynchronous Transfer Mode ) network and is based on cyclic reset mechanism. THe mean cell delay time is proposed as a performance measure of NTT/BT protocol. The mean cell delay time is defined as the duration from the instant the cell arrives at the transmission buffer until the cell is fully transmitted. The process of cell transmission can be described as a single server queueing modle with two dependent services. By utilizing this model, mean cell delay time is obtained and sensitivity of the factors such as window size and reset period is also analysed.

• Journal of the Korea Computer Industry Society
• /
• v.7 no.5
• /
• pp.513-520
• /
• 2006

In this paper, we propose a novel real-time frame-layer rate control algorithm using sliding window method for low bit rate video coding. The proposed rate control method performs bit allocation at the frame level to minimize the average distortion over an entire sequence as well as variations in distortion between frames. A new frame-layer rate-distortion model is derived, and a non-iterative optimization method is used for low computational complexity. In order to reduce the quality fluctuation, we use a sliding window scheme which does not require the pre-analysis process. Therefore, the proposed algorithm does not produce time delay from encoding, and is suitable for real-time low-complexity video encoder. Experimental results indicate that the proposed control method provides better visual and PSNR performance than the existing TMN8 rate control method.