We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. The correctness consists of showing that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given entirely on the basis of an axiomatic theory. 2000 Mathematics Subject Classification: 68N30 [Specification and verification]; 68Q85 [...

In PODS 2003, Babcock, Datar, Motwani and O’Callaghan [4] gave the first streaming solution for the k-median problem on sliding windows using O( k τ4W 2τ log2 W ) space, with a O(2O(1/τ)) approximation factor, where W is the window size and τ ∈ (0, 2 ) is a user-specified parameter. They left as an open question whether it is possible to improve this to polylogarithmic space. Despite much progr...

Estimating the transformation between two images from the same scene is a fundamental step for image registration, image stitching and 3D reconstruction. State-of-the-art methods are mainly based on sorted residual for generating hypotheses. This scheme has acquired encouraging results in many remote sensing applications. Unfortunately, mainstream residual based methods may fail in estimating t...

The performance of out-of-order processors increases with the instruction window size. In conventional processors, the effective instruction window cannot be larger than the issue buffer. Determining which instructions from the issue buffer can be launched to the execution units is a timecritical operation which complexity increases with the issue buffer size. We propose to relieve the issue st...

This article introduces a chemical kinetic model of the transcriptional elongation dynamics of RNA polymerase. The model's novel concept is a look-ahead feature, in which nucleotides bind reversibly to the DNA before being incorporated covalently into the nascent RNA chain. Analytical and computational methods for studying the behavior of the look-ahead model are introduced, and several approac...

6.1 Growing Window Averaging The first signal processing technique investigated was a simple extension of the Spectral Fit algorithm where the estimates for any given window size were the average of the estimates for smaller window sizes. In the algorithm, the averaging was restricted to window lengths greater than 2 mm. Furthermore, because scatterer size estimates of less than 1 μm were not p...

Imputation offers a promising way to infer the missing and/or untyped genotypes in genetic studies. In practice, however, many factors may affect the quality of imputation. In this study, we evaluated the influence of untyped rate, sizes of the study sample and the reference sample, window size, and reference choice (for admixed population), as the factors affecting the quality of imputation. T...

Design parameters interact in complex ways in modern processors, especially because out-of-order issue and decoupling buffers allow latencies to be overlapped. Tradeoffs among instruction-window size, branch-prediction accuracy, and instructionand datacache size can change as these parameters move through different domains. For example, modeling unrealistic caches can underor over-state the ben...

Today’s superscalar processors rename registers, bypass registers, checkpoint state so that they can recover from speculative execution, check for dependencies, allocate execution units, and access multi-ported register files. The circuits employed are complex and irregular, requiring much effort and ingenuity to implement well. Furthermore, the delays through many of the circuits grow quadrati...

Coseismic displacements play a key role in understanding earthquake dynamics. To derive displacement fields from optical and microwave remote sensing datasets, various methods are available. This study evaluated in detail the offset tracking technique on optical ASTER data for 2005 Kashmir earthquake. This technique required input parameters like resampling methods, correlator types, window siz...