• Journal of Computing Science and Engineering
• /
• v.7 no.4
• /
• pp.220-230
• /
• 2013

In recent years, progress in hardware technology has resulted in the possibility of monitoring many events in real time. The volume of incoming data may be so large, that monitoring all individual data might be intractable. Revisiting any particular record can also be impossible in this environment. Therefore, many database schemes, such as aggregation, join, frequent pattern mining, and indexing, become more challenging in this context. This paper surveys the previous efforts to resolve these issues in processing data streams. The emphasis is on specifying and processing sliding window queries, which are supported in many stream processing engines. We also review the related work on stream query processing, including synopsis structures, plan sharing, operator scheduling, load shedding, and disorder control.

• Journal of Ocean Engineering and Technology
• /
• v.8 no.2
• /
• pp.166-172
• /
• 1994

This paper presents an image processing method for two dimensional position measurement of a floating structure. This method is based on image processing technique using concept of window and threshold processing to track the target object. The experimental results for position measurement of the target object in two dimensional water tank demonstrate the validity of this method.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.1175-1180
• /
• 1991

The purpose of this paper is to improve the matching accuracy in identifying corresponding points in the area-based matching for the processing of stereo vision. For the selection of window size, a new method is proposed based on frequency domain analysis. The effectiveness of the proposed method is confirmed through a series of experiments. To overcome disproportionate distortion in stereo image pair, a new matching method using the warped window is also proposed. In the algorithm, the window is warped according to imaging geometry. Experiments on a synthetic image show that the matching accuracy is improved by 14.1% and 4.2% over the rectangular window method and image warping method each.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1355-1358
• /
• 2004

This paper describes a modification to the SACK (Selective Acknowledgement) Transmission Control Protocol's (TCP), called SACK TCP with Probing Device, SACK works in conjunction with Probing Device, for improving SACK TCP performance when more than half a window of data lost that is typical in handoff as well as unreliable media. It shows that by slightly modifying the congestion control mechanism of the SACK TCP, it can be made to better performance to multiple packets lost from one window of data.

• Journal of Information Processing Systems
• /
• v.2 no.1
• /
• pp.34-38
• /
• 2006

In the wireless network, TCP performs poorly because it was originally designed for wired networks and does not take into consideration wireless characteristics such as mobility, high-loss probability, and hidden-terminal problems. In particular, in the wireless multi-hop networks, a large congestion window increases the probability of contention and packet losses, and TCP performance is degraded severely as a result. So, it is necessary to limit the TCP congestion window size in order keep the probability of contention loss in the system to a minimum. In this paper, we propose a new scheme for determining the maximum congestion window size based on the measured bandwidth and Round-Trip-Time (RTT). Using ns-2 simulation, we show that the proposed scheme reduces the probability of packet contention and improves TCP performance.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05b
• /
• pp.1189-1192
• /
• 2003

본 연구는 어떤 조직 내에서의 네트워크를 내부 네트워크와 외부 네트워크로 구분하고, 이들에 각각의 서버를 할당하여 분산된 서비스를 제공하는 환경을 대상으로 한다. 각 서버의 특성에 맞게 TCP Parameter 중의 하나인 Window Size를 설정하여 내부 네트워크의 성능 향상을 시도하였다. 외부 네트워크에서는 Window Size 가 큰 영향을 미치지 못하나 내부 네트워크에서는 Window Size 에 따라서 처리율(Throughput)이 크게 달라진다. 본 연구에서는 Window Size 의 조절을 통해서 내부 네트워크의 처리율(throughput) 변화를 NS-2 를 사용하여 시뮬레이션 해 보고 그 결과를 비교하여 내부 네트워크의 성능 향상을 확인하고자 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.187-189
• /
• 2014

패킷 네트워크에서 음성, 영상 트래픽이 IP, UDP, RTP 를 이용하여 전송 될 때 중복 헤더가 사용되어 통신의 비효율을 초래한다. 이를 방지 하기 위해 ROHC(Robust Header Compression)가 적용된다. 이는 인접 패킷 헤더 간의 차이 값이 규칙적으로 증가하는 영역은 그 차이 값만을 전송한다. 차이 값은 WLSB 인코딩 과정을 거쳐 전송이 되는데 인코팅 시 Sliding Window 값이 사용된다. Sliding Window 크기에 따라 헤더 압축률이 변하고 대역폭에도 영향을 미치게 된다. 본 논문에서는 효과적인 Sliding Window 값을 구하여 기존 ROHC 에 적용 하여 네트워크 통신의 효율성을 향상 시키고자 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.466-469
• /
• 2014

기존 Window8 Style 에 대한 디지털 포렌식 연구는 윈도우 기본 애플리케이션에 대해서만 진행되어 있는 상황이고, 다른 3rd party Style App 들에 대해서만 진행되어있는 상황이다. 본 논문에서는 Window8 Style UI 의 Instant Messengers 에 대해 디지털 포렌식 분석하고 이를 통해 범인의 행동 흐름 파악 및 증거확보 매커니즘을 제시하고자 한다. 본 논문은 기존의 Window8 의 접근방법을 토대로 하여, Style App 의 사용흔적이나 내용에 대해 확인하며, 시간정보, 이미지 등 각종 애플리케이션들을 다각적으로 분석한다. 본 논문에서 제안한 접근법은 개별 App 들에 대한 정보를 효율적이고 빠르게 분석하고 사건에 대한 정보를 제공함으로써 범죄수사과정에 도움이 될 것으로 기대된다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.973-976
• /
• 2009

Digital signal processing technique use to variety fields including communication. For these signal processing, FIR digital filter is representative. And for FIR digital filter designing, the window function is used to reduce the Gibbs phenomenon which occurs in the coefficient cutting process of the ideal filter. Therefore, in this paper to improve performance of digital filter, a high-order window function was applied. In this simulation, we compared a peak side-lobe and a transient characteristics with the existing window function.

• The Journal of the Korea Contents Association
• /
• v.8 no.4
• /
• pp.48-54
• /
• 2008

This paper analyzes cost tradeoffs between memory usage and computation for window-based operators in data stream environments. It identifies generic operator network constructs, and sets up a cost model for the estimation of the expected memory reduction and the computation overheads when window memory relocations are applied to each operator network construct. This cost model helps to identify the utility of window memory relocations. It also helps to apply window memory relocation to improve a query execution plan to save memory usage. The proposed approach contributes to expand the scope of query processing and optimization in data stream environments. It also provides a basis to develop a cost estimation model for the query optimization using window memory relocations.