Four methods of range estimation for airborne ultrasonic systems|namely simple thresholding, curvetting, sliding-window, and correlation detection|are compared on the basis of bias, standard deviation, total error, robustness to noise, and the di culty of implementation. Whereas correlation detection is theoretically optimal, the other three methods can o er acceptable performance at much lower...

Data reduction is a basic step in a KDD process useful for delivering to successive stages more concise and meaningful data. When mining is applied to data streams, that are continuous data flows, the issue of suitably reducing them is highly interesting, in order to arrange effective approaches requiring multiple scans on data, that, in such a way, may be performed over one or more reduced sli...

data types Storage engine Query processor SQL Language Continuous time-based Sliding Window Queries Continuous Predicate-based Window Queries Moving Queries Stream data types Stream of Moving Objects/Queries Stream_Scan Operator W-Expire Operator Negative Tuples INSIDE Operator kNN Operator WINDOW window_clause kNN knn_clause PLACE NILE INSIDE inside_clause

We present new side-channel attacks on implementations of RSA and ElGamal encryption. The attacks can extract secret keys using a very low measurement bandwidth (a frequency band of less than 100 kHz, residing under 2 MHz) even when attacking multi-GHz CPUs. They targets implementation that use the popular sliding-window and fixed-window (m-ary) modular exponentiation. We demonstrate the attack...

A growing number of applications require support for processing data that is in the form of continuous stream, rather than finite stored data. In this paper we present a new approach for detecting temporal patterns with complex predicates over continuous data stream. Our algorithm efficiently scans the stream with a sliding window, and checks the data inside the window from right-to-left to see...

An innovative approach for extracting signatures from bank cheque images and other documents is proposed based on the integration of the crop method with the sliding window technique. The idea is to estimate the approximate area in which the signature lies using the sliding window technique. In this approach, a window of adaptable height and width is moved over the image; one pixel at a time an...

Data stream systems execute a dynamic workload of long-running and one-time queries, with the streaming inputs typically bounded by sliding windows. For efficiency, windows may be advanced periodically by replacing the oldest part of the window with a batch of newly arrived data. Existing work on stream processing assumes that a window cannot be advanced while it is being accessed by a query. I...

Ideal object detection result in an image is an optimal free shape sub-window that tightly covers the object of interest. However, the sub-windows considered in widely-used sliding window method are limited to rectangles. This paper proposed a new graph-theoretic method which allowed the detection sub-window to be any shape for object detection. Firstly, local features responses were calculated...

In this paper, we explore the design and effects of applying different sliding window methodologies to capture character co-occurrences within literature in order to build social networks. In particular, we focus our analysis on several works of 19th century fiction by Jane Austen and Charles Dickens. We define three different sliding window techniques that can be applied: collinear, coplanar, ...

The dynamic TCP acknowledgement problem formulated by Dooly et al. has been intensively studied in the area of competitive analysis. However, their framework does not consider the sliding window that restricts the maximum number of packets that the sender can inject into the network without an acknowledgement in TCP protocol. This paper proposes a new problem in which the sliding window is real...