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.     

Amplitude des oscillations d'ondes solitaires généralisées

Various physical systems of dispersive waves admit solutions in the form of generalized solitary waves. Such waves result from the resonance between a long localized wave and short periodic oscillations. Many estimates (rigorous and numerical) have been given for the amplitude of the ripples in the tail of the generalized solitary wave when its central part has a sech² shape. This Note provides estimates (not yet rigorous) for the ripple amplitude when the central part is flat and wide. To cite this article: C. Fochesato, F. Dias, C. R. Acad. Sci. Paris, Ser. I 337 (2003).     

Embedding optimisation algorithms with Mosel

Algebraic modelling languages allow models to be implemented in such a way that they can easily be understood and modified. They are therefore a working environment commonly used by practitioners in Operations Research. Having once developed models, they need to be integrated inside the company information system. This step often involves embedding a model into a programming language environment: many existing algebraic modelling languages make possible to run parameterised models and subsequently retrieve their results, but without any facility for interacting with the model during the model generation or solution process.In this paper we show how to use the Mosel environment to implement complex algorithms directly in the modelling language.The Office cleaning problem is solved by a branch-and-cut algorithm, implemented entirely in the modelling language (including the definition of the callback function for the solver). Secondly, a cutting stock problem is solved by column generation, also implemented in the modelling language.AMS classification: 90Cxx, 65K05, 68N15     

Behaviour of (−Δ−k2−i0+)−1 outside fading obstacles,independant scattering hypothesis and applications

This paper deals with the behaviour of k‐outgoing solutions of ?Δu?k²u=f outside a fading soft obstacle. We extend an approach using the so‐called Lax–Phillips construction and the well‐known properties of the capacity of smooth obstacles. So, classical results are recovered in a straightforward manner. The previous approach enables us to consider the case of obstacles composed of many tiny spheres. Roughly speaking, we prove that the scattering amplitude is approximately the sum of the scattering amplitudes scattered by each isolated sphere, which is an alternative form of the first Born approximation. As a consequence, two inverse problems are solved. Copyright © 2003 John Wiley & Sons, Ltd.     

A comparison theorem for a piecewise Lipschitz continuous Hamiltonian and application to Shape-from-Shading problems

Summary The reconstruction from a shaded image of a Lambertian and not self-shadowing surface illuminated by a single distant pointwise light source may be written as a first-order Hamilton-Jacobi equation.In this paper, we continue the investigation begun in E. Rouy and A. Tourin into the uniqueness of the solution of this equation; the approach is based on the viscosity solutions theory and the dynamic programming principle.More precisely, we concentrate here on the uniqueness of the viscosity solution of this equation in case the measured luminous intensity reflected by the surface is discontinuous along a smooth curve. We prove a general comparison result for a piecewise Lipschitz continuous Hamiltonian and illustrate it by numerical experiments.     

Single electron tunneling rates in multijunction circuits

The rate of electron tunneling through normal metal tunnel junctions is calculated for the case of ultrasmall junction capacitances. The so-called Coulomb blockade of electron tunneling at low temperatures is shown to be strongly affected by the external electrical circuit. Under the common experimental condition of a low impedance environment the Coulomb blockade is suppressed for single tunnel junctions. However, a Coulomb gap structure emerges for junctions embedded in a high impedance environment. For a double junction setup a Coulomb blockade of tunneling arises even for low impedance environments due to the charge quantization on the metallic island between the junctions. An approach using circuit analysis is presented which allows to reduce the calculation of tunneling rates in multijunction circuits to those of a single junction in series with an effective capacitance. The range of validity of the socalled local rule and global rule rates is clarified. It is found that the tunneling rate tends towards the global rule rate as the number of junctions is increased. Some specific results are given for a one-dimensional array of tunnel junctions.     

Characteristic classes of flat bundles, II

On a smooth varietyX defined over a fieldK of characteristic zero, one defines characteristic classes of bundles with an integrableK-connection in a group lifting the Chow group, which map, whenK is the field of complex numbers andX is proper, to Cheeger-Simons' secondary analytic invariants, compatibly with the cycle map in the Deligne cohomology.     

A short note on the generalized Euler transform for the summation of power series

Applying the generalized Euler transform to the firstn partial sums of a power series results in a triangular array whose inferior diagonal givesn approximate values of the sum of this series. The aim of this short note is to estimate the best of thesen values and to compare it with the actual best one for a collection of test series.