Uniform bounds under increment conditions

We apply a majorizing measure theorem of Talagrand to obtain uniform bounds for sums of random variables satisfying increment conditions of the type considered in Gál-Koksma Theorems. We give some applications.

     

Conformal fields,restriction properties,degenerate representations and SLEChamps conformes,propriété de restriction,représentations dégénérées et SLE

We relate the Schramm–Loewner Evolution processes (SLE) to highest-weight representations of the Virasoro Algebra. The restriction properties of SLE that have been recently derived in [19] play a crucial role. In this setup, various considerations from conformal field theory can be interpreted and reformulated via SLE. This enables one to make a concrete link between the two-dimensional discrete critical systems from statistical physics and conformal field theory. To cite this article: R. Friedrich, W. Werner, C. R. Acad. Sci. Paris, Ser. I 335 (2002) 947–952.     

Pion correlations and resonance effects in \bar{p}p annihilation to 4\pi^0 at rest

We study correlations in the exclusive reaction at rest with complete reconstruction of the kinematics for each event. The inclusive distribution is fairly flat at small invariant mass of the pion pair while a small enhancement in the double differential distribution is observed for small invariant masses of both pion pairs. Dynamical models with resonances in the final state are shown to be consistent with the data while the stochastic HBT mechanism is not supported by the present findings. Received: 26 February 2002 / Revised version: 22 July 2002 / Published online: 30 August 2002     

Almost Sure Convergence and Square Functions of Averages Of Riemann Sums

Under a very moderate assumption on the Fourier coefficients of a periodic function, we show the convergence almost everywhere of the sequence of averages of its associated Riemann sums. The structure of the set of averages is analyzed by proving a spectral regularization type inequality, which allows to control the corresponding Littlewood-Paley square function.     

Implementation of an integrated glucose POCT system

In response to a change of the Belgian National Directives whereby hospital laboratories became responsible for all point-of-care testing (POCT) performed within hospital walls a standardized and automated POC glucose-testing system was implemented in our hospital. The system consists of 50 AccuCheck Inform instruments (Roche Diagnostics, Vilvoorde, Belgium), 50 docking stations, a DataCare Server, and connections to the medical laboratory information system (MOLIS, Sysmex, Barchon, Belgium) and to the hospital information system. Implementation involved many parties and extensive preparation and communication. Key issues were bar-coded patient and user identification, training, and responsibilities. One year after the hospital wide implementation of this system the quality of POC glucose testing has significantly increased, thereby improving patient safety. This study describes a stepwise change over involving the medical laboratory and with a focus on hands-on quality.Presented at the ninth conference on Quality in the Spotlight, 18–19 March 2004, Antwerp, Belgium.     

A modular integer GCD algorithm

This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors.