Computer plays an important role over our daily life and business. In term of data receiving process, mouse is one of the most important input devices that transfer data from user to computer. Eye tracking mouse is one of the implementations of eye tracking research area. It gives an alternative for user with disabilities who cannot control mouse by hand or leg such as the case of motion neuron...

We have developed a fast and robust algorithm for the extraction of 3-D seismic attributes. The algorithm is based on the recursive computation of the 3-D sliding-window Radon transform. Considerable gain in computational eeciency has been achieved with respect to existing algorithms. Field data results demonstrate the eeectiveness of the method for 3-D seismic interpretation.

Fast, eecient, and reliable algorithms for up-and downdating discrete least-squares approximations of a real-valued function given at arbitrary distinct nodes in 0; 2) by trigonometric polynomials are presented. A combination of the up-and downdating algorithms yields a sliding window scheme. The algorithms are based on schemes for the solution of (inverse) unitary eigenproblems and require onl...

A formal specification and proof of correctness is given of the sliding­ window protocol using the notation of Communicating Sequential Pro­ cesses. First the stop-and-wait protocol is defined; its correetne8S, that it forms a I-place buffer, is almost evident. Next the alternating-bit protocol is defined and described in terms of the stop-and-wait proto­ col, and its correctness deduced. Final...

A sliding window algorithm receives a stream of symbols and has to output at each time instant a certain value which only depends on the last $n$ symbols. If the algorithm is randomized, then at each time instant it produces an incorrect output with probability at most $\epsilon$, which is a constant error bound. This work proposes a more relaxed definition of correctness which is parameterized...

We present the first algorithms for processing graphs in the slidingwindow model. The sliding window model, introduced by Datar et al. (SICOMP 2002), has become a popular model for processing infinite data streams in small space when older data items (i.e., those that predate a sliding window containing the most recent data items) are considered “stale” and should implicitly be ignored. While p...

Knowing the file type associated with a sequence of bytes makes interpretation of those bytes far more meaningful. With the ever increasing number of file types in existence and the massive storage capacity of modern hardware, it is impractical to try interpreting a sequence of bytes as every known file type until one succeeds. Furthermore, some file types require specific header or footer info...

network utilization (the ratio of throughput to the capacity of the underlying network) is PKT SIZE RTT / C, where C is the network’s capacity, PKT SIZE is the size of a single packet, and RTT is the round-trip time for the path from the sender to the receiver. When we use the variable RTT , we mean the minimum round-trip time excluding queueing delays inflicted by transmissions between the sen...

Let f : R → [r] = {1, 2, . . . , r} be a measurable function, and let {Ui}i∈N be a sequence of i.i.d. random variables. Consider the random process Zi = f(Ui, ..., Ui+k−1). We show that for all q, there is a positive probability, uniform in f , that Z1 = Z2 = ... = Zq. A continuous counterpart is that if f : R → R, and Ui and Zi are as before, then there is a positive probability, uniform in f ...

Fast, eecient, and reliable algorithms for up-and downdating discrete least-squares approximations of a real-valued function given at arbitrary distinct nodes in 0; 2) by trigonometric polynomials are presented. A combination of the up-and downdating algorithms yields a sliding window scheme. The algorithms are based on schemes for the solution of (inverse) unitary eigenproblems and require onl...