The spectrum of minimal defining sets of some Steiner systems

For a design D, define spec(D) = {\M\ \ M is a minimal defining set of D} to be the spectrum of minimal defining sets of D. In this note we give bounds on the size of an element in spec(D) when D is a Steiner system. We also show that the spectrum of minimal defining sets of the Steiner triple system given by the points and lines of PG(3,2) equals {16,17,18,19,20,21,22}, and point out some open questions concerning the Steiner triple systems associated with PG(n, 2) in general. (C) 2002 Elsevier Science B.V. All rights reserved.

Existence of multiple solutions for finite difference approximations to second-order boundary value problems

Error condition detected We consider discrete two-point boundary value problems of the form D-2 y(k+1) = f (kh, y(k), D y(k)), for k = 1,...,n - 1, (0,0) = G((y(0),y(n));(Dy-1,Dy-n)), where Dy-k = (y(k) - Yk-I)/h and h = 1/n. This arises as a finite difference approximation to y" = f(x,y,y'), x is an element of [0,1], (0,0) = G((y(0),y(1));(y'(0),y'(1))). We assume that f and G = (g(0), g(1)) are continuous and fully nonlinear, that there exist pairs of strict lower and strict upper solutions for the continuous problem, and that f and G satisfy additional assumptions that are known to yield a priori bounds on, and to guarantee the existence of solutions of the continuous problem. Under these assumptions we show that there are at least three distinct solutions of the discrete approximation which approximate solutions to the continuous problem as the grid size, h, goes to 0. (C) 2003 Elsevier Science Ltd. All rights reserved.

The tree cut and merge algorithm for estimation of network reliability

This article presents Monte Carlo techniques for estimating network reliability. For highly reliable networks, techniques based on graph evolution models provide very good performance. However, they are known to have significant simulation cost. An existing hybrid scheme (based on partitioning the time space) is available to speed up the simulations; however, there are difficulties with optimizing the important parameter associated with this scheme. To overcome these difficulties, a new hybrid scheme (based on partitioning the edge set) is proposed in this article. The proposed scheme shows orders of magnitude improvement of performance over the existing techniques in certain classes of network. It also provides reliability bounds with little overhead.

A review of drainage and spontaneous rupture in free standing thin films with tangentially immobile interfaces

A review of spontaneous rupture in thin films with tangentially immobile interfaces is presented that emphasizes the theoretical developments of film drainage and corrugation growth through the linearization of lubrication theory in a cylindrical geometry. Spontaneous rupture occurs when corrugations from adjacent interfaces become unstable and grow to a critical thickness. A corrugated interface is composed of a number of waveforms and each waveform becomes unstable at a unique transition thickness. The onset of instability occurs at the maximum transition thickness, and it is shown that only upper and lower bounds of this thickness can be predicted from linear stability analysis. The upper bound is equivalent to the Freakel criterion and is obtained from the zeroth order approximation of the H-3 term in the evolution equation. This criterion is determined solely by the film radius, interfacial tension and Hamaker constant. The lower bound is obtained from the first order approximation of the H-3 term in the evolution equation and is dependent on the film thinning velocity A semi-empirical equation, referred to as the MTR equation, is obtained by combining the drainage theory of Manev et al. [J. Dispersion Sci. Technol., 18 (1997) 769] and the experimental measurements of Radoev et al. [J. Colloid Interface Sci. 95 (1983) 254] and is shown to provide accurate predictions of film thinning velocity near the critical thickness of rupture. The MTR equation permits the prediction of the lower bound of the maximum transition thickness based entirely on film radius, Plateau border radius, interfacial tension, temperature and Hamaker constant. The MTR equation extrapolates to Reynolds equation under conditions when the Plateau border pressure is small, which provides a lower bound for the maximum transition thickness that is equivalent to the criterion of Gumerman and Homsy [Chem. Eng. Commun. 2 (1975) 27]. The relative accuracy of either bound is thought to be dependent on the amplitude of the hydrodynamic corrugations, and a semiempirical correlation is also obtained that permits the amplitude to be calculated as a function of the upper and lower bound of the maximum transition thickness. The relationship between the evolving theoretical developments is demonstrated by three film thickness master curves, which reduce to simple analytical expressions under limiting conditions when the drainage pressure drop is controlled by either the Plateau border capillary pressure or the van der Waals disjoining pressure. The master curves simplify solution of the various theoretical predictions enormously over the entire range of the linear approximation. Finally, it is shown that when the Frenkel criterion is used to assess film stability, recent studies reach conclusions that are contrary to the relevance of spontaneous rupture as a cell-opening mechanism in foams. (C) 2003 Elsevier Science B.V. All rights reserved.

Pseudo-randomness of round-off errors in discretized linear maps on the plane

We analyze the sequences of round-off errors of the orbits of a discretized planar rotation, from a probabilistic angle. It was shown [Bosio & Vivaldi, 2000] that for a dense set of parameters, the discretized map can be embedded into an expanding p-adic dynamical system, which serves as a source of deterministic randomness. For each parameter value, these systems can generate infinitely many distinct pseudo-random sequences over a finite alphabet, whose average period is conjectured to grow exponentially with the bit-length of the initial condition (the seed). We study some properties of these symbolic sequences, deriving a central limit theorem for the deviations between round-off and exact orbits, and obtain bounds concerning repetitions of words. We also explore some asymptotic problems computationally, verifying, among other things, that the occurrence of words of a given length is consistent with that of an abstract Bernoulli sequence.