This paper presents parallel signature design techniques that guarantee the aliasing probability to be less than 2/L, where L is the test length. Using y signature samples, a parallel signature analysis design is proposed that guarantees the aliasing probability to be less than (y/L). Inaccuracies and incompleteness in previously published bounds on the aliasing probability are discussed. Simpl...

We find an asymptotic expression for the first eigenvalue of the biharmonic operator on a long thin rectangle. This is done by finding lower and upper bounds which become increasingly accurate with increasing length. The lower bound is found by algebraic manipulation of the operator, and the upper bound is found by minimising the quadratic form for the operator over a test space consisting of s...

We consider astronomical and local bounds on time variation of fundamental constants to test some generic Kaluza-Klein-like models and some particular cases of Beckenstein theory. Bounds on the free parameters of the different theories are obtained. Furthermore, we find that none of the proposed models, is able to explain recent results (Webb et al 1999, 2000) claiming an observed variation of ...

In this paper, we present PICPA, the “Population and Interval Constraint Propagation Algorithm” which is able to produce high quality approximate solutions while giving guaranteed bounds for the Pareto optimal front. These bounds allow us to know whether the heuristic solutions are close to or far away from the optimal front. PICPA combines “Interval Constraint Propagation” (ICP) techniques [1,...

The objective of this paper is to present a study of the solvability, stability and optimal error bounds of certain mixed finite element formulations for acoustic fluids. An analytical proof of the stability and optimal error bounds of a set of three-field mixed finite element discretizations is given, and the interrelationship between the inf–sup condition, including the numerical inf–sup test...

The Multi-Processor Job Shop and Flow Shop scheduling problems are variants on the standard Job Shop and Flow Shop problems in which each machine has the capacity to process more than one job simultaneously. This class of problems has attracted the attention of researchers in recent years and several lower bounds has been proposed for a Branch-and-Bound solution method. But only a few attempts ...

Given an i.i.d. sample drawn from a density f on the real line, the problem of testing whether f is in a given class of densities is considered. Testing procedures constructed on the basis of minimizing the L1-distance between a kernel density estimate and any density in the hypothesized class are investigated. General non-asymptotic bounds are derived for the power of the test. It is shown tha...