• Journal of KIISE
• /
• v.45 no.2
• /
• pp.187-194
• /
• 2018

Recently, Hypertext Transfer Protocol (HTTP) adaptive streaming service is attracting attention. The existing quality adaptive scheme of HTTP adaptive streaming service adjusts the video quality according to the network bandwidth or the client buffer size. However, the problem with the existing quality adaptive scheme is the QoE (Quality of Experience) degradation caused by the unnecessary quality change that occurs due to frequent bandwidth change or fixed buffer threshold. We propose a video quality maintenance scheme that improves average video quality and minimizes unnecessary quality change in order to improve the QoE of HTTP adaptive streaming service in the changing network environment. The proposed scheme maintains high quality for a long time by setting the quality maintenance duration to be long when buffer occupancy and video quality are high. The experimental results show that the proposed scheme improves QoE by improving the average video quality and minimizing the quality change.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.5
• /
• pp.115-122
• /
• 2011

Adaptive arrays suffer from severe performance degradation when there are errors in the steering vector. The DCRCB (doubly constrained robust Capon beamformer) overcomes such a problem, introducing a spherical uncertainty set of the steering vector together with a norm constraint. However, in the standard DCRCB, it is a difficult task to determine the bound for the uncertainty, the radius of the spherical set, such that a near best solution is obtained. A novel beamforming method is presented which has no difficulty of the uncertainty bound setting, employing a recursive search for the steering vector. Though the basic idea of recursive search has been known, the conventional recursive method needs to set a parameter for the termination of the search. The proposed method terminates it by using distances to the signal subspace, without the need for parameter setting. Simulation demonstrates that the proposed method has better performance than the conventional recursive method and than the non-recursive standard DCRCB, even the one with the optimum uncertainty bound.

• Journal of Biosystems Engineering
• /
• v.15 no.2
• /
• pp.110-122
• /
• 1990

This study was undertaken to develop the feed rate control system for the head feed thresher by making use of the microprocessor and to evaluate the response of the system to a various threshing conditions. The control unit was composed of one-board microcomputer. The speed of the wet-paddy feeding chain was controlled by dc moter with PI controller. It was used the adaptive control method to maintain the constant feed rate regardless of the fed rice varieties. The sliding type potentiometer was used as the feed rate sensor, which was attached on the sheaf-holding apparatus. The mathematical models of the system components were derived and computer simulation was developed for investigating the parameters affecting on control performance and for estimating the response of the system. A one-board microcomputer-based feed rate control system developed in this study was properly functioned and assessed as adequate for the feed rate control system of the head feed thresher. Based on the simulation for the bundle feed, it was anticipated that the lower setting value of the cylinder speed(RL) is to be set higher than the limiting operational speed. In addition, the higher setting value of the cylinder speed(RH) is to be set lower than the limiting cylinder speed for threshing. The computer simulation for the continuous spread feed showed that the lower the setting value of straw layer thickness(LL) was set, the shorter the correction time. However, if too low LL may be established, the feed rate could not reach to its desired rate.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.2
• /
• pp.284-292
• /
• 2003

In this paper, we carried out the numerical examination of the initial value setting-up method to extend the range of optimal step parameter in a adaptive system which is controlled by LMS algorithm. For initial value setting-up methods, the general method which select the initial value randomly and the other method which applies the approximate value obtained from the direct method to initial value, were used. And then, we compared to the ranges of step parameter setting, the convergence speeds of mean-square-error, and the stabilities during the convergence process when the initial values were applied to the optimal directivity synthesis problem. According to the numerical simulation results, the initial value setting-up method by means of the direct method provides wider range for the step parameter, more efficient capability for convergence and stability, and more error correction ability than the general method.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.159-162
• /
• 2005

Random Early Detection (RED), one of the most well-known Active Queue Management (AQM), has been designed to substitute Tail Drop and is nowadays widely implemented in commercially available routers. RED algorithm provides high throughput and low delay as well as a solution of global synchronization. However RED is sensitive to parameters setting, so the performance of RED, significantly depends on the fixed parameters. To solve this problem, the Adaptive RED (ARED) algorithm is suggested by S. Floyd. But, ARED also uses fixed parameters like target-queue length; it is hard to respond to bursty traffic actively. In this paper, we proposed AQM algorithm based on the variation of current queue length in order to improve adaptability about burst traffic. We measured performance of proposed algorithm through a throughput, marking-drop rate and bias phenomenon. In experimentation, we raised a packet throughput as reduced packet drop rate, and we confirmed to reduce a bias phenomenon about bursty traffic.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.7
• /
• pp.1815-1830
• /
• 2012

Existing R-tree that is based on a variety of outdoor-based techniques to manage moving objects have been investigated. Due to the different characteristics of the indoor and outdoor, it is difficult to management of moving object using existed methods in indoor setting. We propose a new index structure called ACII(adaptive Cell-based index for Indoor moving objects) for Indoor moving objects. ACII is Cell-based access structure adopting an overlapping technique. The ACII refines cells adaptively to handle indoor regional data, which may change its locations over time. The ACII consumed at most 30% of the space required by R-tree based methods, and achieved higher query performance compared with r-tree based methods.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2254-2263
• /
• 2000

This paper proposes an efficient predictive image-compression technique based on vector quantization of blocks of pels. In the proposed method edge contents of blocks control the selection of predictors and block shapes as well. The maximum number of bits assigned to quantizers has been in creased to 3bits/pel from 1/5bits/pel, the setting employed by forerunners in predictive vector quantization of images. This increase prevents the saturation in SNR observed in their results in high bit rates. The variable block shape is instrumental in eh reconstruction of edges. The adaptive procedure is controlled by means of he standard deviation ofp rediction errors generated by a default predictor; the standard deviation address a decision table which can be set up beforehand. eh proposed method is characterized by overall improvements in image quality over A-VQ-PE and A-DCT VQ, both of which are known for their efficient use of vector quantizers.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.11
• /
• pp.1946-1958
• /
• 2011

Wireless Sensor Network (WSN) is made up of a number of sensor nodes and base stations. Traffic flow in WSN appears self-similar due to its data delivery process, and this impacts queue length greatly and makes queuing delay worse. Active queue management can be designed to improve QoS performance for WSN. In this paper, we propose self-similar traffic rate estimating algorithm named Power-Law Moving Averaging (PLMA) to regulate packet marking probability. This algorithm improves the availability of the rate estimation algorithm under the self-similar traffic condition. Then, we propose an adaptive Proportional Integral algorithm (SSPI) based on the estimation of the Self-Similar traffic rate by PLMA. Simulation results show that SSPI can achieve lower queue length jitter and smaller setting time than PI.

• Journal of Communications and Networks
• /
• v.16 no.3
• /
• pp.311-321
• /
• 2014

This paper focuses on contention-based medium access control (MAC) protocols used in wireless local area networks. We propose a novel MAC protocol called adaptive backoff tuning MAC (ABTMAC) based on IEEE 802.11 distributed coordination function (DCF). In our proposed MAC protocol, we utilize a fixed transmission attempt rate and each node dynamically adjusts its backoff window size considering the current network status. We determined the appropriate transmission attempt rate for both cases where the request-to-send/clear-to-send mechanism was and was not employed. Robustness against performance degradation caused by the difference between desired and actual values of the attempt rate parameter is considered when setting it. The performance of the protocol is evaluated analytically and through simulations. These results indicate that a wireless network utilizing ABTMAC performs better than one using IEEE 802.11 DCF.

• The Journal of the Korea Contents Association
• /
• v.2 no.4
• /
• pp.46-50
• /
• 2002

This paper suggests the adaptive binary method which applies advanced silt sum technique, so that threshold value can be changed heuristically according to the brightness of captured fingerprint image. Through this research, we tried to resolve threshold value setting issue by the local differences of brightness of fingerprint image in the binary image preprocessing. The experimental results show that our proposed preprocessing method demonstrates the better recognition accuracy and can be applied to minutiae extraction algorithm for fingerprint recognition system.