• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2790-2796
• /
• 1999

In video-on-demand systems, the I.O bandwidth of video servers is the critical resource which contributes to increase in latency. Several approaches: bridging, piggybacking are used to reduce the I/O demand on the video server through sharing. Batching delays the requests for the different videos for a batching window so that more requests for the same video arriving during the current batching window may be served using the same stream. In this paper, we propose an adaptive reservation-based batching policy which dynamically reserves video server capacity for popoular videos according to video server loads. The performance of the proposed policy is evaluated through a simulation, and is compared with simple batching and static reservation-based batching policies. As the result, we know that the adaptive reservation-based batching policy more improves service ratio and average waiting time than simple batching and simple reservation-based batching policy more improves service ratio and average waiting time than simple batching and simple reservation-based batching polices.

• The KIPS Transactions:PartD
• /
• v.16D no.5
• /
• pp.673-682
• /
• 2009

XML data are widely used for data representation and exchange on the Web and the data type is an continuous stream in ubiquitous environment. Therefore there are some mining researches related to the extracting of frequent structures and the efficient query processing of XML stream data. In this paper, we propose a mining method to extract frequent structures of XML stream data in recent window based on the sliding window. XML stream data are modeled as a tree set, called XFP_tree and we quickly extract the frequent structures over recent XML data in the XFP_tree.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1482-1484
• /
• 2010

A new TCP protocol can succeed for large bandwidth delay product when it meets network bandwidth utilization efficiency and fair sharing. We introduce a novel congestion control algorithm which employs queueing delay information in order to calculate the amount of congestion window increment in increase phase, and reduces congestion window to optimal estimated bound as packet loss occurs. Combination of such methods guarantees that the proposal utilizes fully network bandwidth, recovers quickly from packet loss in wireless link, and preserves fairness for competing flows mixed short RTT and long RTT. Our simulations show that features of the proposed TCP meet the desired requirements.

• Journal of Information Processing Systems
• /
• v.2 no.2
• /
• pp.76-81
• /
• 2006

A PDA is used mainly for downloading data from a stationary server such as a desktop PC in an infrastructure network based on wireless LAN. Thus, the overall performance depends heavily on the performance of such downloading with PDA. Unfortunately, for a PDA the time taken to receive data from a PC is longer than the time taken to send it by 53%. Thus, we measured and analyzed all possible factors that could cause the receiving time of a PDA to be delayed with a test bed system. There are crucial factors: the TCP window size, file access time of a PDA, and the inter-packet delay that affects the receiving time of a PDA. The window size of a PDA during the downstream is reduced dramatically to 686 bytes from 32,581 bytes. In addition, because flash memory is embedded into a PDA, writing data into the flash memory takes twice as long as reading the data from it. To alleviate these, we propose three distinct remedies: First, in order to keep the window size at a sender constant, both the size of a socket send buffer for a desktop PC and the size of a socket receive buffer for a PDA should be increased. Second, to shorten its internal file access time, the size of an application buffer implemented in an application should be doubled. Finally, the inter-packet delay of a PDA and a desktop PC at the application layer should be adjusted asymmetrically to lower the traffic bottleneck between these heterogeneous terminals.

• Journal of KIISE:Databases
• /
• v.33 no.2
• /
• pp.163-174
• /
• 2006

In distributed wireless sensor network, it is difficult to transmit and analyze the entire stream data depending on limited networks, power and processor. Therefore it is suitable to use alternative stream data processing after classifying the continuous stream data. We propose a classification framework for continuous multivariate stream data. The proposed approach works in two steps. In the preprocessing step, it takes input as a sliding window of multivariate stream data and discretizes the data in the window into a string of symbols that characterize the signal changes. In the classification step, it uses a standard text classification algorithm to classify the discretized data in the window. We evaluated both supervised and unsupervised classification algorithms. For supervised, we tested Bayesian classifier and SVM, and for unsupervised, we tested Jaccard, TFIDF Jaro and Jaro Winkler. In our experiments, SVM and TFIDF outperformed other classification methods. In particular, we observed that classification accuracy is improved when the correlation of attributes is also considered along with the n-gram tokens of symbols.

• Electronics and Telecommunications Trends
• /
• v.8 no.2
• /
• pp.69-91
• /
• 1993

In the conventional speech processing, the technique of FFT(Fast Fourier Transform) is usually applied to the finite number of samples within the window of specified length using the fixed sampling rate. In this case, the temporal resolution is dependent upon the length of window while the spectral resolution is dependent upon the number of samples within the window. Thus, once the temporal resolution is determined the spectral resolution is also determined or vice versa. To resolve this type of dilemma, a new type of bank-filter similar to the characteristics of cochlear model needs to be considered. Furthermore, wide dynamic range of cochlea certainly helps the stable extraction of speech features. In the paper, the human auditory system will be briefly introduced and previous works on auditory preprocessors based on cochlear model will be reviewed. As a conclusion, the design considerations of auditory preprocessors based on cochlear model will be addressed.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.758-761
• /
• 2003

This paper introduces a method that can detect obstacles and corridor environments from the images captured by a CCD camera in an automobile or mobile robot is proposed. Processing the input dynamic images in real time requires high performance hardware as well as efficient software. In order to relieve these requirements for detecting the useful information from the images in real time, a "Moving Window" scheme is proposed. Therefore, detecting the useful information, it becomes possible to search the obstacles within the driving corridor of an automobile or mobile robot. The feasibility of the proposed algorithm is demonstrated through the simulated experiments of the corridor driving.

• The Journal of the Acoustical Society of Korea
• /
• v.9 no.2
• /
• pp.34-41
• /
• 1990

The energy parameter is widely used in pre-processing of speech signals, because it represent the phoneme characteristics of well But, the energy parameter is affected by the window length during the extracting. Thus, in this paper, the window length effects are studied in detail, and we proposed a new energy extraction algorithm that reduces the length effects. The energy contours with this algorithm are well representing for the characteristics of speech phonemes. And the computations to implement the algorithm are only required one subtraction, one addition, and two comparison aperation per speech sample.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.2
• /
• pp.7-12
• /
• 2009

In this paper, we discuss the problem of continuous k.nearest neighbors (CKNN) monitoring over distributed streams wavelet synopses, which also considered sliding window structure under stream based kNN query. We developed traditional skylines techniques and propose a new method which called DR.skylines to process CKNN queries as a bandwidth.efficient approach. It tries to process CKNN queries on synopses for optimized sliding window time and space computation.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.11
• /
• pp.2017-2020
• /
• 2011

Flicker, which is also known as voltage fluctuation, is an electromagnetic phenomenon generated by large scale nonlinear loads, such as arc furnaces and welding machines. Since a severe and continuous flicker can cause to some damages to electrically sensitive loads as well as human's visual irritations, it needs to be appropriately managed by being accurately measured, quantified and assessed. In Korea, an equivalent 10-Hz flicker index, shortly ${\Delta}V10$, is used to determine the permission limit of flicker. This paper presents an efficient calculation of the flicker index by using a half-cycle sliding window and a recursive method, showing a concrete calculating procedure of ${\Delta}V10$ from the viewpoint of signal processing.