• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.52-54
• /
• 2001

공간 선택 질의에 사용되는 질의 윈도우로는 직사각형이 주로 사용된다. 하지만, 최근에는 GIS 등과 같은 응용 프로그램들이 성능 향상으로 인해 보다 다양한 종류의 응용이 등장하고 있으므로, 직사각형뿐만 아니라 임의의 다각형 형태의 질의 윈도우에도 적합한 정제 단계 수행 전략에 대해 고려해 볼 필요가 있다. 이러한 전략으로는 기존의 공간 조인에서와 같이 plane-sweep 알고리즘을 이용하는 방법이 일반적이다. 하지만, 공간 데이터와 질의 위도우의 특성을 관찰해보면, 일반적으로 질의 윈도우가 공간 데이터보다 훨씬 간단한 모양으로 구성되어 있음을 알 수 있으므로, 본 논문에서는 이러한 상황에 보다 적합한 정제 단계 수행 방법을 제시하고 있으며, 실험을 통하여 제시한 방법의 우수성을 입증하고 있다.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.366-371
• /
• 2008

In this paper, we suggest a haptic interface and a framework of interaction with haptic feedback based Windows graphical user interface (GUI) in a computing device with touch screen. The events that occur during a user interacts with Windows interfaces through a touch screen are filtered out by the Windows Interface Message Filter (WIMF) and converted into appropriate haptic feedback information by the Haptic Information Provider (HIP). The haptic information are conveyed to users through a stylus-like haptic interface interacting with a touch screen. Major Windows interaction schemes including button click, menu selection/pop-up, window selection/movement, icon selection/drag & drop and scroll have been implemented and user tests show the improved usability since the haptic feedback helps intuition and precise manipulation.

• Journal of KIISE:Databases
• /
• v.30 no.3
• /
• pp.286-295
• /
• 2003

The shape of query windows for spatial selection queries is a rectangle in many cases. However, it can be issued for spatial selection queries with not only rectangular query widow, but also polygonal query window. Moreover, as the applications like GIS can manage much more spatial data, they can support the more various applications. Therefore it is valuable for considering about the query processing method suitable for not only rectangle query window, but also general polygonal one. It is the general state-of-the-art approach to use the plane- sweep technique as the computation algorithm in the refinement step as the spatial join queries do. However, from the observation on the characteristics of spatial data and query windows, we can find in many cases that the shape of query window is much simpler than that of spatial data. From these observations, we suggest a new refinement process approach which is suitable for this situation. Our experiments show that, if the number of vertices composing the query window is less than about 20, the new approach we suggest is superior to the state-of-the-art approach by about 20% in general cases.

• Communications for Statistical Applications and Methods
• /
• v.16 no.4
• /
• pp.615-625
• /
• 2009

In this paper we describe Wilcoxon test and T-test that are well-known in two-sample location problem for detecting edges under different window configurations. The choice of window configurations is an important factor in determining the performance and the expense of edge detectors. Our edge detectors are based on testing the mean values of local neighborhoods obtained under the edge model using an edge-height parameter. We compare three window configurations based on statistical tests in terms of qualitative measures with the edge maps and objective, quantitative measures as well as CPU time for detecting edge.

• 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 the Institute of Electronics and Information Engineers
• /
• v.51 no.7
• /
• pp.201-208
• /
• 2014

The performance of a landmine detection system depends on consistent extractions of the features of landmines. Since landmines have diverse sizes, it is critical to select an appropriate window size to represent the landmine region consistently. Conventional detection systems are incapable of extracting consistent landmine features because they employ fixed window sizes. This paper proposes a window size selection method according to the size of a landmine. The proposed method selects an appropriate window size based on the type of a landmine estimated from the response signal of the system. Data on various types of soils and landmines were generated from a simulation program to evaluate the performance of the proposed method. The results verified that the proposed method, which employs an adaptive window size, yields a better landmine detection rate than the conventional methods, which employ fixed window sizes.

• KIPS Transactions on Software and Data Engineering
• /
• v.1 no.1
• /
• pp.55-68
• /
• 2012

In this paper, we propose a novel method to solve the problem of excessive segmentation out of the method of segmenting regions from an image using Homogeneity Threshold($H_T$). The algorithm of the previous image segmentation based on $H_T$ was carried out region growth by using only the center pixel of selected window. Therefore it was caused resulting in excessive segmented regions. However, before carrying region growth, the proposed method first of all finds out whether the selected window is homogeneity or not. Subsequently, if the selected window is homogeneity it carries out region growth using the total pixels of selected window. But if the selected window is not homogeneity, it carries out region growth using only the center pixel of selected window. So, the method can reduce remarkably the number of excessive segmented regions of image segmentation based on $H_T$. In order to show the validity of the proposed method, we carried out multiple experiments to compare the proposed method with previous method in same environment and conditions. As the results, the proposed method can reduce the number of segmented regions above 40% and doesn't make any difference in the quality of visual image when we compare with previous method. Especially, when we compare the image united with regions of descending order by size of segmented regions in experimentation with the previous method, even though the united image has regions more than 1,000, we can't recognize what the image means. However, in the proposed method, even though image is united by segmented regions less than 10, we can recognize what the image is. For these reason, we expect that the proposed method will be utilized in various fields, such as the extraction of objects, the retrieval of informations from the image, research for anatomy, biology, image visualization, and animation and so on.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.5
• /
• pp.365-369
• /
• 2009

Overlapping windows are generally used for queries to process continuous data streams. Nevertheless, existing approaches discussed join algorithms only for basic types of windows such as tumbling windows and tuple-driven windows. In this paper, we propose an efficient join algorithm for overlapping windows, which are considered as a more general type of windows. The proposed algorithm is based on an incremental window join. It focuses on producing join results continuously when the memory overflow frequently occurs. It consists of (1) a method to use both of the incremental and full joins selectively, (2) a victim selection algorithm to minimize latency of join processing and (3) an idle time professing algorithm. We show through our experiments that the selective use of incremental and full joins provides better performance than using one of them only.

• Proceedings of the Korean Society Of Semiconductor Equipment Technology
• /
• 2006.05a
• /
• pp.109-114
• /
• 2006

본 논문은 HSMS를 기반으로 하는 SECS 통신 프로토콜을 구현한다. HSMS는 TCP/IP를 이용한 이더넷 기반이기 때문에 많은 장점을 가지고 있는 윈도우 소켓을 사용한다. 윈도우 소켓은 높은 호환성을 가지며, 다양한 종류의 통신 규약을 지원한다. 윈도우소켓에서 제공하는 API 함수를 이용하여 쓰레드를 동기화 하고, 이벤트 기법을 사용하여 클라이언트 측과 서버 측의 독립적인 송수신을 가능하게 한다. 또한, 하나의 프로그램에서 서버 측과 클라이언트 측을 선택적으로 사용 가능하게 구현한다.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2013.08a
• /
• pp.311.1-311.1
• /
• 2013

건축물의 유리창을 통하여 유입되는 태양광을 조절하여 냉난방 부하를 절감하고자 사용하는 스마트 윈도우 필름(Electrochromic (EC), Polymer Dispersed Liquid Crystal (PDLC), Suspended Particle Display (SPD))의 방식이 있다. 이러한 스마트 윈도우 필름은 건물 외피에 적용할 때 여름철 태양으로부터 유입되는 열선 차폐만을 목적으로 유리를 완전히 불투명하게 가려버리는 것은 맑고 투명해야하는 창호의 기본적인 용도를 무시한 단편적 기술로서, 스마트 윈도우 필름을 작동하여 투명하게 할 경우 외부에서 열선이 유입되는 문제를 가지고 있다. 스마트 윈도우 필름을 만들 때 필수적으로 사용하는 전극필름으로 플렉서블 기판에 투명 전도막이 형성됨과 동시에 적외선만을 선택적으로 차단하는 기능을 가지는 필름을 제조하여 단열 성능 실험을 실시하였다. 아울러, 스마트 필름의 다양한 적용을 위한 발열 실험도 실시하였다.