The critical probability for random Voronoi percolation in the plane is 1/2

We study percolation in the following random environment: let Z be a Poisson process of constant intensity on ℝ², and form the Voronoi tessellation of ℝ² with respect to Z. Colour each Voronoi cell black with probability p, independently of the other cells. We show that the critical probability is 1/2. More precisely, if p>1/2 then the union of the black cells contains an infinite component with probability 1, while if p<1/2 then the distribution of the size of the component of black cells containing a given point decays exponentially. These results are analogous to Kesten's results for bond percolation in ℤ². The result corresponding to Harris' Theorem for bond percolation in ℤ² is known: Zvavitch noted that one of the many proofs of this result can easily be adapted to the random Voronoi setting. For Kesten's results, none of the existing proofs seems to adapt. The methods used here also give a new and very simple proof of Kesten's Theorem for ℤ²; we hope they will be applicable in other contexts as well. Research supported in part by NSF grant ITR 0225610 and DARPA grant F33615-01-C-1900 Research partially undertaken during a visit to the Forschungsinstitut für Mathematik, ETH Zürich, Switzerland     

Use of the Apparent Content Curves for the spectrophotometric identification of substances: identification of amphetamines

The possibility of identification of substances which have similar spectral behaviour by means of Apparent Content Curves has been studied. This study is carried out with absorption, excitation and emission spectra of several amphetamines of widespread pharmaceutical use. Results obtained show that amphetamine, phenylpropanolamine, pseudoephedrine, phenylephrine, epinephrine, dopamine and methoxyamphetamine can be identified with a probability of >95%.     

Multiplicities of interpoint distances in finite planar sets

What is the maximum number of unit distances between the vertices of a convex n-gon in the plane? We review known partial results for this and other open questions on multiple occurrences of the same interpoint distance in finite planar subsets. Some new results are proved for small n. Challenging conjectures, both old and new, are highlighted.     

On top-down splaying

The splay tree is a self-adjusting binary search tree which has a good amortized performance. This paper studies some properties of top-down splay trees. Different ways to charge for the primitive operations of top-down splaying are discussed. We also give some empirical results concerning the behaviour of different top-down restructuring algorithms.This work was supported by the Academy of Finland.     

The influence of photodissociated N2O in pulsed-laser deposition of Y-Ba-Cu-O films

Pulsed-laser deposition of YBa₂Cu₃O₇ in N₂O permits lowering of the substrate temperature with respect to deposition in O₂ atmosphere. Additional photodissociation of N₂O near the substrate surface deteriorates the superconducting properties of deposited films.On leave from: Institute of Applied Physics of the Academy of Sciences of the USSR, SU-603600 Nishni Nowgorod, USSR     

Enhanced selectivity of the isolation of basic drugs from body fluids by means of extraction minicolumns and sophisticated elution schemes.

The paper presents results and experience obtained in the isolation of a number of basic polar/non-polar solutes (drugs, their metabolites and structural derivatives) from biological samples by using the separation minicolumns Separcol SI and Separcol SI C18 L/T. The aim was to provide insight into some simple procedures yielding optimal selectivity/specificity of the isolation of the studied solutes either by proper selection of the sorbent or by applying sophisticated elution schemes which use to advantage different properties of the eluents/solvents.     

Cross sections for multi-particle final states at a linear collider

In this paper total cross sections for signals and backgrounds of top- and Higgs-production channels in e ⁺ e^- collisions at a future linear collider are presented. All channels considered are characterized by the emergence of six-particle final states. The calculation takes into account the full set of tree-level amplitudes in each process. Two multi-purpose parton level generators, HELAC/PHEGAS and AMEGIC + + , are used, and their results are found to be in perfect agreement.Received: 26 November 2003, Revised: 15 January 2004, Published online: 3 March 2004     

Difference schemes on uniform grids performed by general discrete operators

Our aim is to set the foundations of a discrete vectorial calculus on uniform n-dimensional grids, that can be easily reformulated on general irregular grids. As a key tool we first introduce the notion of tangent space to any grid node. Then we define the concepts of vector field, field of matrices and inner products on the space of grid functions and on the space of vector fields, mimicking the continuous setting. This allows us to obtain the discrete analogous of the basic first order differential operators, gradient and divergence, whose composition define the fundamental second order difference operator. As an application, we show that all difference schemes, with constant coefficients, for first and second order differential operators with constant coefficients can be seen as difference operators of the form for suitable choices of q, and  . In addition, we characterize special properties of the difference scheme, such as consistency, symmetry and positivity in terms of q, and  .     

L'intégration graphique des équations différentielles ordinaires

In the period which precedes the appearance of computers, needs in calculation of the scientists and engineers led to an important development of graphic methods of integration. To contribute to the study of this little known phenomenon, the article presents techniques and instruments used for the graphic integration of ordinary differential equations, and looks for their historic origins by going back to the beginning of calculus: processes of geometric calculation by the polygonal method or the method of radius of curvature, use of tractional motion for the conception of integraphs, reduction to graphic quadratures in finite or infinite number.     

Functional Quantization and Small Ball Probabilities for Gaussian Processes

Quantization consists in studying the L ^r -error induced by the approximation of a random vector X by a vector (quantized version) taking a finite number n of values. We investigate this problem for Gaussian random vectors in an infinite dimensional Banach space and in particular, for Gaussian processes. A precise link proved by Fehringer⁽⁴⁾ and Dereich et al. ⁽³⁾ relates lower and upper bounds for small ball probabilities with upper and lower bounds for the quantization error, respectively. We establish a complete relationship by showing that the same holds for the direction from the quantization error to small ball probabilities. This allows us to compute the exact rate of convergence to zero of the minimal L ^r -quantization error from logarithmic small ball asymptotics and vice versa.