We associate a statistical vector to a trace and a geometrical embedding to a Markov Decision Process, based on a distance on words, and study basic Membership and Equivalence problems. The Membership problem for a trace w and a Markov Decision Process S decides if there exists a strategy on S which generates with high probability traces close to w. We prove that Membership of a trace is testab...

This paper proposes a consistent test for the goodness-of-fit of parametric regression models which overcomes two important problems of the existing tests, namely, the poor empirical power and size performance of the tests due to the curse of dimensionality and the choice of subjective parameters like bandwidths, kernels or integrating measures. We overcome these problems by using a residual ma...

In this paper we study U-statistics with side information incorporated using the method of empirical likelihood. Some basic properties of the proposed statistics are investigated. We find that by implementing the side information properly, the proposed U-statistics can have smaller asymptotic variance than the existing U-statistics in the literature. The proposed U-statistics can achieve asympt...

With the continuous increase of Internet link speed and the number of flows, flow statistics has become a challenging task due to the demanding requirements on both memory size and memory bandwidth. In this paper, we propose a DIScount COunting (DISCO) method, which is designed for both flow size and flow bytes counting. For each incoming packet, DISCO increases the corresponding counter assign...

In the case of two signals with independent pairs of observations (x n ,y n ) a statistic to estimate the variance of the histogram based mutual information estimator has been derived earlier. We present such a statistic for dependent pairs. To derive this statistic it is necessary to avail of a reliable statistic to estimate the variance of the sample mean in case of dependent observations. We...