• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.8
• /
• pp.1542-1550
• /
• 2015

Delayed ACK is an algorithm implemented to decrease the number of ACK transmissions by delaying an ACK transmission and by waiting for additional ACK instead of transmitting the ACK immediately. By using Delayed ACK in TCP, the congestion of network and the overhead of handling ACKs can be reduced. Waiting time of Delayed ACK is defined as the Delayed ACK timeout, and it is fixed in Window OS basically. However, the fixed value of Delayed ACK timeout is not suitable for dynamic network circumstance, and it may cause unnecessary delay. This paper proposes a regulating Delayed ACK timeout algorithm to reduce the aforementioned unnecessary delay caused by the lengthy default value of the Delayed ACK timeout. We confirm that TCP transmission performance in dynamic network circumstance can be improved using the proposed algorithm.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.39 no.9
• /
• pp.848-857
• /
• 2011

Vision-based collision avoidance system for air traffic management requires a excellent multiple target detection algorithm under low signal-to-noise ratio (SNR) levels. The track-before-detect (TBD) approaches have significant applications such as detection of small and dim targets from an image sequence. In this paper, two detection algorithms with the TBD approaches are proposed to satisfy the multiple target detection requirements. The first algorithm, based on a dynamic programming approach, is designed to classify multiple targets by using a k-means clustering algorithm. In the second approach, a hidden Markov model (HMM) is slightly modified for detecting multiple targets sequentially. Both of the proposed approaches are used in numerical simulations with variations in target appearance properties to provide satisfactory performance as multiple target detection methods.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2003.05a
• /
• pp.27-40
• /
• 2003

The purpose of this study is to understand what is ActiveX control and how to utilize it in developing dynamic web pages. For this purpose, some literature survey and experimental practices with PC were done to understand the differences among web programming technologies such as visual basic, java, XML web services. In order to scrutinize the functions of ActiveX controls and the comparison of their technology with currently introduced XML web service, a study on the history of Internet programming with a focused view on ActiveX control was also performed. With the knowledge of the fore mentioned, Actual design and building experiments of web pages using ActiveX control pad were implemented. The results show that Microsoft ActiveX controls, formerly known as OLE controls or OCX controls, developed to compete with java applet in internet battle fields, turn out to be useful in software reusability, cost-saving and time-saving etc. However, the use of ActiveX controls has been confined in window platform, Overall, this study was useful for understanding the usage of ActiveX controls in web pages.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.2
• /
• pp.108-118
• /
• 2003

The purpose of this study is to understand what is ActiveX control and how to utilize it in developing dynamic web pages. For this purpose, some literature survey and experimental practices with PC were done to understand the differences among web programming technologies such as visual basic, java, XML web services. In order to scrutinize the functions of ActiveX controls and the comparison of their technology with currently introduced XML web service, a study on the history of Internet programming with a focused view on ActiveX control was also performed. With the knowledge of the fore mentioned, Actual design and building experiments of web pages using ActiveX control pad were implemented. The results show that Microsoft ActiveX controls, formerly known as OLE controls or OCX controls, developed to compete with java applet in internet battle fields, turn out to be useful in software reusability, cost-saving and time-saving etc. However, the use of ActiveX controls has been confined in window platform, Overall, this study was useful for understanding the usage of ActiveX controls in web pages.

• Journal of the Korea Society for Simulation
• /
• v.22 no.1
• /
• pp.63-75
• /
• 2013

The School Bus Routing Problem(SBRP) seeks to plan an efficient schedule of a fleet of school buses that must pick up student from various bus stops and deliver them by satisfying various constraints; maximum capacity of the bus, maximum riding time of students, arrival time between a school's time window. By extending the existing SBRP, we consider a case study of SBRP with allowance of mixed-loading and dynamic arrivals reflecting the school bus operation of university in Korea. Our solution procedure is based on constructing the initial solution using sweep algorithm and then improving solution within the framework of the evolutionary approach known as efficient meta-heuristics. By comparing the various scenarios through the constraints relaxation for reflecting the real operational strategies, we assess the merit of our proposed procedure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8A
• /
• pp.613-619
• /
• 2003

Bluetooth is a communication technology enabling short-range devices to be wirelessly connected. A master and one or more slave devices are connected to form a piconet, and piconets are joined to form a scatternet. The units participating in two or more piconets in a scatternet, is called bridge or gateway nodes. In order to operate the scatternet efficiently, both piconet scheduling for the master and slaves of a piconet, and scatternet scheduling for the bridge nodes are playing important roles. In this paper, we propose a traffic-adaptive dynamic scatternet scheduling algorithm based on rendezvous points and rendezvous windows. The performance of the proposed algorithm is compared and analyzed with that of a static scheduling algorithm via simulations. Simulation results show that our algorithm can distribute wireless resources efficiently to bridge nodes depending on the traffic characteristics.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.12
• /
• pp.2146-2152
• /
• 2008

In In this paper, we proposed a new JPEG2000 codec using multiresolution-based rendering (MRBR) technique for video compression of 3-dimensional digital cinema. We introduced discrete wavelet transform (DWT) for stereoscopic image and stereo matching technique in the wavelet domain. The disparity was extracted using stereo matching and transmitted with the reference (left) image. Since the generated right image was degraded by the occlusion lesion, the residual image which is generated from difference between the original right image and the generated one was transmitted at the same tine. The disparity data was extracted using the dynamic programming method in the disparity domain. There is high correlation between the higher and lower subbands. Therefore we decreased the calculation amount and enhanced accuracy by restricting the search window and applying the disparity information generated from higher subband.

• Korean Journal of Remote Sensing
• /
• v.14 no.2
• /
• pp.175-195
• /
• 1998

Automatic lineament extraction algorithms had been developed by various researches for geological purpose using remotely sensed data. However, most of them are designed for a certain topographic model, for instance rugged mountainous region or flat basin. Most of common topographic characteristic in Korea is a mountainous region along with alluvial plain, and consequently it is difficult to apply previous algorithms directly to this area. A new algorithm of automatic lineament extraction from remotely sensed images is developed in this study specifically for geological applications. An algorithm, named as DSTA(Dynamic Segment Tracing Algorithm), is developed to produce binary image composed of linear component and non-linear component. The proposed algorithm effectively reduces the look direction bias associated with sun's azimuth angle and the noise in the low contrast region by utilizing a dynamic sub window. This algorithm can successfully accomodate lineaments in the alluvial plain as well as mountainous region. Two additional algorithms for estimating the individual lineament vector, named as ALEHHT(Automatic Lineament Extraction by Hierarchical Hough Transform) and ALEGHT(Automatic Lineament Extraction by Generalized Hough Transform) which are merging operation steps through the Hierarchical Hough transform and Generalized Hough transform respectively, are also developed to generate geological lineaments. The merging operation proposed in this study is consisted of three parameters: the angle between two lines($\delta$$\beta$), the perpendicular distance($(d_ij)$), and the distance between midpoints of lines(dn). The test result of the developed algorithm using Landsat TM image demonstrates that lineaments in alluvial plain as well as in rugged mountain is extremely well extracted. Even the lineaments parallel to sun's azimuth angle are also well detected by this approach. Further study is, however, required to accommodate the effect of quantization interval(droh) parameter in ALEGHT for optimization.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.11
• /
• pp.1074-1081
• /
• 2007

This paper presents a method for real-time face detection and tracking which combined Adaboost and Camshift algorithm. Adaboost algorithm is a method which selects an important feature called weak classifier among many possible image features by tuning weight of each feature from learning candidates. Even though excellent performance extracting the object, computing time of the algorithm is very high with window size of multi-scale to search image region. So direct application of the method is not easy for real-time tasks such as multi-task OS, robot, and mobile environment. But CAMshift method is an improvement of Mean-shift algorithm for the video streaming environment and track the interesting object at high speed based on hue value of the target region. The detection efficiency of the method is not good for environment of dynamic illumination. We propose a combined method of Adaboost and CAMshift to improve the computing speed with good face detection performance. The method was proved for real image sequences including single and more faces.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.5
• /
• pp.639-650
• /
• 2008

Electricity price forecasting has become an integral part of power system operation and control. In this paper, a wavelet transform (WT) based neural network (NN) model to forecast price profile in a deregulated electricity market has been presented. The historical price data has been decomposed into wavelet domain constitutive sub series using WT and then combined with the other time domain variables to form the set of input variables for the proposed forecasting model. The behavior of the wavelet domain constitutive series has been studied based on statistical analysis. It has been observed that forecasting accuracy can be improved by the use of WT in a forecasting model. Multi-scale analysis from one to seven levels of decomposition has been performed and the empirical evidence suggests that accuracy improvement is highest at third level of decomposition. Forecasting performance of the proposed model has been compared with (i) a heuristic technique, (ii) a simulation model used by Ontario's Independent Electricity System Operator (IESO), (iii) a Multiple Linear Regression (MLR) model, (iv) NN model, (v) Auto Regressive Integrated Moving Average (ARIMA) model, (vi) Dynamic Regression (DR) model, and (vii) Transfer Function (TF) model. Forecasting results show that the performance of the proposed WT based NN model is satisfactory and it can be used by the participants to respond properly as it predicts price before closing of window for submission of initial bids.