The problem of compact tables is to maximise the overlap when building a word that is to include permutations of every given words (all the words being the same length). This problem is shown to be NP-complete in the general case, and some specific restrictions are studied. 1. Presentation of the problem 1.1. Informal description and examples In several fields, it can be helpful to give a compa...

Adaptive Random Testing (ART) denotes a family of random testing methods that are designed to be more effective than Random Testing (RT). Mostly, these methods have been investigated using the mean F-measure, which denotes the random number of test cases necessary to detect the first failure. The two most important ART methods, namely Distance-Based ART (DART) and Restricted Random Testing (RRT...

It is well known that there are no perfectly good generators of random number sequences, implying the need of testing the randomness of the sequences produced by such generators. There are many tests for measuring the uniformity of random sequences, and here we propose a few new ones, designed by random walks. The experiments we have made show that our tests discover some discrepancies of rando...

We show that the new pseudo-random number function, introduced recently by M. Naor and O. Reingold, possesses one more attractive and useful property. Namely, it is proved that for almost all values of parameters it produces a uniformly distributed sequence. The proof is based on some recent bounds of character sums with exponential functions. ( 2001 Academic Press

This paper reports that in parallel Monte-Carlo simulations of the 2D Ising-Model, commonly used pseudo-random number generators (PRNG) lead to manifestly erroneous results. When parallel random number sequences for a parallel simulation are generated by a same PRNG with diffrent initial seeds, the sequences can be strongly correlated with each other if the seeds are selected

In this paper we show that reporting a single performance score is insufficient to compare non-deterministic approaches. We demonstrate for common sequence tagging tasks that the seed value for the random number generator can result in statistically significant (p < 10−4) differences for state-of-the-art systems. For two recent systems for NER, we observe an absolute difference of one percentag...