We propose an approach to resolve the problem of varying window size selection for a wide class of linear and nonlinear lters. A window size of a lter is considered as a parameter of estimation and a number of estimates are calculated for a set of values of this parameter. Then, the intersection of con dence intervals (ICI) rule is used for selection of the estimate with the best window size. T...

We examined the effect of surrounding information on reading text that was scrolling from right to left inside a fixed window. In Experiment 1, participants adjusted the scrolling rate so that they could comfortably read the text scrolling in the window. Above or below the window, a character was flashed with a random stimulus onset asynchrony (SOA). The results showed that the comfortable scro...

We investigate the effectiveness of window-dressing as a potential strategy to be used by mutual fund managers to promote fund flows. Using a rank gap measure as a proxy for the likelihood that window-dressing has occurred, we find that fund investors as whole punish those managers who are suspected to have engaged in window-dressing. That is, we find a negative relation between the window-dres...

MOTIVATION Several measures of DNA sequence dissimilarity have been developed. The purpose of this paper is 3-fold. Firstly, we compare the performance of several word-based or alignment-based methods. Secondly, we give a general guideline for choosing the window size and determining the optimal word sizes for several word-based measures at different window sizes. Thirdly, we use a large-scale ...

1 . Introduction 2 . Iterative restoration algorithms 2. 1 . Adaptive regularized iterative algorithms 2.2. Application to adaptive image restoration 2.3. Combined iterative algorithms 2.4. Comparison based on the computational load 3. Computation o the weight matrices 3. 1 . Masking and noise visibility functions 3.2. Computation of the masking function 3.2. 1 . Weighted window 3.2.2. Fixed wi...

We present new algorithms for the sliding window Lempel-Ziv (LZ77) problem and the approximate rightmost LZ77 parsing problem. Our main result is a new and surprisingly simple algorithm that computes the sliding window LZ77 parse in O(w) space and either O(n) expected time or O(n log logw + z log log σ) deterministic time. Here, w is the window size, n is the size of the input string, z is the ...

Episode rules are patterns that can be extracted from a large event sequence, to suggest to experts possible dependencies among occurrences of event types. The corresponding mining approaches have been designed to find rules under a temporal constraint that specifies the maximum elapsed time between the first and the last event of the occurrences of the patterns (i.e., a window size constraint)...

We propose a method to enhance web browsing history records by considering browsing window attributes. The browsing window attributes means properties of web browser window such as size, location, z-order, activated status, etc. We often open multiple web documents for each window and browse the contents through handling these windows at the same time. Since a series of the window attributes de...