• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.413-416
• /
• 2008

In the presence of multiple continuous queries, multi-query optimizing is a new challenge to process multiple stream data in real-time. So, in this paper, we proposed an approach to optimize multi-query of sliding window on network traffic data streams and do some comparisons to traditional queries without optimizing. We also detail some method of scheduling on different data streams, while different scheduling made different results. We test the results on variety of multi-query processing schedule, and proofed the proposed method is effectively optimized the data stream similar multi-queries.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.4
• /
• pp.148-154
• /
• 1999

TCP has improved by many papers which suggest the new algorithms and modify the previous algorithms. This paper compares Tahoe, Reno, New-Reno, Vegas, and SACK. The first version is Tahoe and is globally used. Reno has optimal performance during occurring one packet loss within a window of data, but can suffer from performance when multiple packets are dropped from a window of data. New-Reno avoids some of the performance problems of Reno TCP when multiple packets are dropped from a window of data. but is occurring the problem of the necessary retransmission. SACK resolves the all above problems and is used in bandwidth delay product environment. Vegas uses network bandwidth more efficiently and is a new implementation of TCP that achieves between 40 and 70 better throughput, with one-fifth to one-half the losses, as compared to the implementation of Reno TCP.

• Journal of Korean Academy of Nursing
• /
• v.46 no.4
• /
• pp.534-541
• /
• 2016

Purpose: The aim of this study was to identify the effect of an observation window (OW) at peripheral intravenous (IV) catheter sites on early detection of IV infiltration among hospitalized children. Methods: This was a retrospective observational study with history control group design. Participants were children who had IV infiltration after peripheral catheterization when hospitalized from January to May, 2014 and January to May, 2015 at a children's hospital located in Yangsan city, Korea. The 193 patients, who were hospitalized from January to May, 2014 formed the control group and did not have OW, and the 167 patients, who were hospitalized from January to May, 2015 formed the window group and had OW. Data were analyzed using ${\chi}^2$-test, independent samples t-test and multiple logistic regression. Results: First stage IV infiltration was 39.5% for the window group and 25.9% for the control group, which was significantly different (p=.007). The likelihood of $2^{nd}$ stage and above IV infiltration decreased by 44% in the window group, which was significantly different (p=.014). Conclusion: OW at the peripheral IV catheter site was found to be an effective measure in early recognition of IV infiltration. Considering the effect of OW, we recommend that nurses should make an OW with transparent dressing during stabilization of the IV catheter site in hospitalized children in clinical settings.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12A
• /
• pp.1229-1237
• /
• 2006

IEEE 802.11 has employed distributed coordination function (DCF) adopting carrier sense multiple access with collision avoidance (CSMA/CA). To effectively resolve collisions, DCF uses binary exponential backoff (BEB) algorithm with three parameters, i.e., backoff stage, backoff counter and contention window. If a collision occurs, stations involving in the collision increase their backoff stages by one and double their contention window sizes. However, DCF with BEB wastes wireless resource when there are many contending stations. Therefore, in this paper, to enhance the performance of wireless LAN, we propose binary negative-exponential backoff (BNEB) algorithm which maintains a maximum contention window size during collisions and reduces a contention window size to half after successful transmission of a frame without retransmissions. For IEEE 802.11, 802.11a and 802.11b standards, we also compare the performance of DCF with BEB to that with BNEB.

• Journal of electromagnetic engineering and science
• /
• v.9 no.3
• /
• pp.124-129
• /
• 2009

Although the maximum sum-rate capacity of multiple-input multiple output(MIMO) broadcast channels(BCs) can be achieved by dirty-paper coding(DPC), the results were obtained without fairness considerations in uncorrelated MIMO channels. In this paper, we propose new multiuser scheduling algorithms, which find a best user set for approaching the maximum sum-rate capacity while maintaining fairness among users. We analyze the performance of the proposed algorithms using zero-forcing dirty paper coding(ZF-DPC) in the correlated MIMO BCs for throughput and delay fairness, respectively. Numerical results demonstrate that a large time window can reduce the average throughput difference between users, but it increases head-of-line(HOL) delay jitters in the case of delay fairness.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.2
• /
• pp.51-76
• /
• 2009

In this paper, a new hybrid opto-digital multiple information hiding and real-time extracting system was suggested and implemented using a volume holographic optical correlator. The multiple information hiding system in which the multiple information can be hided in an arbitrary cover image was digitally implemented by using the combination of pseudo random sequence and Hadamard matrix. In addition, a real-time optical extraction system in which the hided multiple information in a cover image can be extracted in real-time was implemented by using a volume holographic optical correlator. In the VanderLugt-type holographic optical correlator used in this experiment, the multiful matched spatial filters corresponding each of the hided informations were recorded in a photorefractive crystal by using the moving window-based angular multiplexing scheme.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.1009-1012
• /
• 1999

An analytical performance model that can predict the performance of a superscalar processor employing multiple branch prediction is introduced. The model is based on the conditional independence probability and the basic block size of instructions, with the degree of multiple branch prediction, the fetch rate, and the window size of a superscalar architecture. Trace driven simulation is performed for the subset of SPEC integer benchmarks, and the measured IPCs are compared with the results derived from the model. As the result, our analytic model could predict the performance of the superscalar processor using multiple branch prediction within 6.6 percent on the average.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4C
• /
• pp.330-335
• /
• 2008

This paper proposes a packet detection algorithm for IEEE802.11n system. IEEE802.11n is a multiple input multiple output (MIMO) system and we have to consider several combining techniques which are used in multiple receive antenna system. In this paper, we propose a hybrid packet detection algorithm which combines double sliding window algorithm or delay and correlation algorithm, that is used in single input single output (SISO) system, and multiple receive antenna combining algorithms, and simulated their performances in Iin system environments and shows the results.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.3
• /
• pp.1051-1059
• /
• 2014

In this paper, we propose an intelligent situation recognition model by collecting and analyzing multiple sensor signals. Multiple sensor signals are collected for fixed time window. A training set of collected sensor data for each situation is provided to K2-learning algorithm to generate Bayesian networks representing causal relationship between sensors for the situation. Statistical characteristics of sensor values and topological characteristics of generated graphs are learned for each situation. A neural network is designed to classify the current situation based on the extracted features from collected multiple sensor values. The proposed method is implemented and tested with UCI machine learning repository data.

• 한국정보컨버전스학회:학술대회논문집
• /
• 2008.06a
• /
• pp.199-204
• /
• 2008

Sensor nodes have various energy and computational constraints because of their inexpensive nature and ad-hoc method of deployment. Considerable research has been focused at overcoming these deficiencies through faster media accessing, more energy efficient routing, localization algorithms and system design. Our research attempts to provide a method of improvement MAC performance in these issues. We show that traditional carrier-sense multiple access(CSMA) protocols like IEEE 802.11 do not handle the first constraint adequately, and do not take advantage of the second property, leading to degraded latency and throughput as the network scales in size, We present more efficient method of a medium access for real-time wireless sensor networks. Proposed MAC protocol is a randomized CSMA protocol, but unlike previous legacy protocols, does not use a time-varying contention window from which a node randomly picks a transmission slot. To reduce the latency for the delivery of event reports, it carefully decides a fixed-size contention window, non-uniform probability distribution of transmitting in each slot within the window. We show that it can offer up to several times latency reduction compared to legacy of IEEE 802.11 as the size of the sensor network scales up to 256 nodes using widely used simulator ns-2. We, finally show that proposed MAC scheme comes close to meeting bounds on the best latency achievable by a decentralized CSMA-based MAC protocol for real-time wireless sensor networks which is sensitive to latency.