• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.39 no.6
• /
• pp.559-566
• /
• 2011

This paper presents the flow passage design for a window cooling device, which have a conical poppet valve and an emissive orifice. Computational flow analysis and experiment are conducted according to the poppet strokes. The results show satisfactory flow characteristics that pressure is reduced enough to endure material strength and the flow does not choked inside window. The correction factor of discharge coefficients is found between 2-dimensional analysis and experiments, which is applied to control coolant flow rates of the window cooling device.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4977-4996
• /
• 2016

The existence of excessively large and too filled network buffers, known as bufferbloat, has recently gained attention as a major performance problem for delay-sensitive applications. Researchers have made three types of suggestions to solve the bufferbloat problem. One is End to End (E2E) congestion control, second is deployment of Active Queue Management (AQM) techniques and third is the combination of above two. However, these solutions either seem impractical or could not obtain good bandwidth utilization. In this paper, we propose a Transmission Control Protocol（TCP）delayed window update mechanism which uses a congestion detection approach to predict the congestion level of networks. When detecting the network congestion is coming, a delayed window update control strategy is adopted to maintain good protocol performance. If the network is non-congested, the mechanism stops work and congestion window is updated based on the original protocol. The simulation experiments are conducted on both high bandwidth and long delay scenario and low bandwidth and short delay scenario. Experiment results show that TCP delayed window update mechanism can effectively improve the performance of the original protocol, decreasing packet losses and queuing delay while guaranteeing transmission efficiency of the whole network. In addition, it can perform good fairness and TCP friendliness.

• Journal of the Korean Mathematical Society
• /
• v.51 no.5
• /
• pp.897-918
• /
• 2014

This paper addresses multi-window Gabor frames with rational time-frequency product. Such issue was considered by Zibulski and Zeevi (Appl. Comput. Harmonic Anal. 4 (1997), 188-221) in terms of Zak transform matrix (so-called Zibuski-Zeevi matrix), and by many others. In this paper, we introduce of a new Zak transform matrix. It is different from Zibulski-Zeevi matrix, but more direct and convenient for our purpose. Using such Zak transform matrix we characterize rational time-frequency multi-window Gabor frames (Riesz bases and orthonormal bases), and Gabor duals for a Gabor frame. Some examples are also provided, which show that our Zak transform matrix method is efficient.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.3
• /
• pp.1227-1232
• /
• 2015

Several works help make sliding window object detection fast, nevertheless, computational demands remain prohibitive for numerous applications. This paper proposes a fast object detection method based on three strategies: cascade classifier, selective window search and fast feature extraction. Experimental results show that the proposed method outperforms the compared methods and achieves both high detection precision and low computation cost. Our approach runs at 17ms per frame on 640×480 images while attaining state-of-the-art accuracy.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2010.04a
• /
• pp.5-6
• /
• 2010

Needs for the methodology of segmentation of linear feature according to the shape characteristics of line feature are increasing in cartographic linear generalization. In this study, the line segmentation method using expansible moving window is presented. This method analyzes the generalization effect of line simplification algorithms depend on the line characters of linear feature and extracts the sections which show exclusively low positional error due to a specific algorithm. The description measurements of these segments are calculated and the target line data are segmented based on the measurements. For segmenting the linear feature to a homogeneous section, expansible moving window is applied. This segmentation method is expected to be used in the cartographic map generalization considering the shape characteristics of linear feature.

• Journal of Information Display
• /
• v.5 no.4
• /
• pp.31-37
• /
• 2004

In this paper, an effective method for reconstruction of stereoscopic image pair through the regularized adaptive disparity estimation is proposed. Although the conventional adaptive disparity window matching can sharply improve the PSNR of a reconstructed stereo image, but there still exist some problems of overlapping between the matching windows and disallocation of the matching windows, because the size of the matching window tend to changes adaptively in accordance with the magnitude of the feature values. In the proposed method, the problems relating to the conventional adaptive disparity estimation scheme can be solved and the predicted stereo image can be more effectively reconstructed by regularizing the extimated disparity vector with the neighboring disparity vectors. From the experimental results, it is found that the proposed algorithm show improvements the PSNR of the reconstructed right image by about 2.36${\sim}$2.76 dB, on average, compared with that of conventional algorithms.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.1
• /
• pp.112-119
• /
• 1990

Two adaptation procedures are proposed for image restoration, in which the window shapes of OS filters are changed according to the order statistics of signal. In the first procedure, the 2-dimensional window is the union of the 1-dimensional subwindows whose sizes are fixed. In the second procedure, the 2-dimensional window is the union of the 1-dimensional subwindows whose sizes are variable. Compared with existing procedures, our adaptation procedures using order statistics are computationally efficient. Simulation results show that the filters with adaptive window shapes have good performance for the preservation of edges and details of image, and the noise suppression.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.10 no.4
• /
• pp.73-79
• /
• 2000

We show how to reduce the number of multiplications required for an exponentiation by using a window method and a factor method. This method requires 599 multiplications for a 512-bit integer exponent while the window method with window size 5 requires 607 multiplications. This method requires fewest multiplications among practical exponentiation algo- rithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8A
• /
• pp.1218-1226
• /
• 1999

In decoding the turbo codes, the sliding window BCJR algorthm, derived from the BCJR algorithm, permits a continuous decoding of the coded sequence without requiring trellis fermination of the constituent codes and uses reduced memory span. However, the number of computation required is greater than that of BCJR algorithm and no study on the effect of the window length has been reported. In this paper, we propose an eddicient sliding window type scheme which maintains the advantages of the conventional sliding window algorithm, reduces its computational burdens, and improves is BER performance. A guideline is first presented to determine the proper window length and then a computationally efficient sliding window BCJR algorithm is obtained by allowing the window to be forwarded in multi-step. Simulation results show that the proposed scheme outperforms the conventional sliding window BCJR algorithm with reduced complexity. It gains 0.1dB SNR improvements over the conventional method for the constraint length 3 and BER $10^{-4}$

• Journal of Korea Port Economic Association
• /
• v.26 no.3
• /
• pp.165-174
• /
• 2010

DEA converts multiple inputs and outputs of a decision unit into a single measure of performance, generally mentioned as relative efficiency. DEA has been applied successfully as a performance evaluation tool in many fields including manufacturing, banks, pharmacies, and hospitals to name a few. This paper applies the input-oriented DEA model, DEA/Window analysis, and Malmquist indices to the 9 regions in Korea to measure the efficiency and productivity. The empirical results show the following findings. First, the super efficiency indicate that efficiency of Group 2 is greater than Group 1. Second, Malmquist indices show that productivity of Group 2 is less than Group 1. Third, DEA/Window of Group2 show that Chungnam is most stable, while Jeonnam is most unstable.