A new proof of the analyticity of the electronic density of molecules

We give a new, short proof of the regularity away from the nuclei of the electronic density of a molecule obtained in [1,2]. The new argument is based on the regularity properties of the Coulomb interactions underlined in [3,4] and on well-known elliptic technics. [1] S. Fournais, M. Hoffmann-Ostenhof, T. Hoffmann-Ostenhof, T. Oe stergaard Soerensen: The electron density is smooth away from the nuclei. Comm. Math. Phys. 228, no. 3 (2002), 401-415. [2] S. Fournais, M. Hoffmann-Ostenhof, T. Hoffmann-Ostenhof, T. Oestergaard Soerensen: Analyticity of the density of electronic wave functions. Ark. Mat. 42, no. 1 (2004), 87-106. [3] W. Hunziker: Distortion analyticity and molecular resonances curves. Ann. Inst. H. Poincar\'e, s. A, t. 45, no 4, 339-358 (1986). [4] M. Klein, A. Martinez, R. Seiler, X.P. Wang: On the Born-Oppenheimer expansion for polyatomic molecules. Comm. Math. Phys. 143, no. 3, 607-639 (1992). The paper is published in Letters in Mathematical Physics 93, number 1, pp. 73-83, 2010. The original publication is available at " www.springerlink.com "

Long-Time Dynamics of Variable Coefficient mKdV Solitary Waves

We study the Korteweg-de Vries-type equation dt u=-dx(dx^2 u+f(u)-B(t,x)u), where B is a small and bounded, slowly varying function and f is a nonlinearity. Many variable coefficient KdV-type equations can be rescaled into this equation. We study the long time behaviour of solutions with initial conditions close to a stable, B=0 solitary wave. We prove that for long time intervals, such solutions have the form of the solitary wave, whose centre and scale evolve according to a certain dynamical law involving the function B(t,x), plus an H^1-small fluctuation.Comment: 19 page

Effect of leading-edge geometry on boundary-layer receptivity to freestream sound

The receptivity to freestream sound of the laminar boundary layer over a semi-infinite flat plate with an elliptic leading edge is simulated numerically. The incompressible flow past the flat plate is computed by solving the full Navier-Stokes equations in general curvilinear coordinates. A finite-difference method which is second-order accurate in space and time is used. Spatial and temporal developments of the Tollmien-Schlichting wave in the boundary layer, due to small-amplitude time-harmonic oscillations of the freestream velocity that closely simulate a sound wave travelling parallel to the plate, are observed. The effect of leading-edge curvature is studied by varying the aspect ratio of the ellipse. The boundary layer over the flat plate with a sharper leading edge is found to be less receptive. The relative contribution of the discontinuity in curvature at the ellipse-flat-plate juncture to receptivity is investigated by smoothing the juncture with a polynomial. Continuous curvature leads to less receptivity. A new geometry of the leading edge, a modified super ellipse, which provides continuous curvature at the juncture with the flat plate, is used to study the effect of continuous curvature and inherent pressure gradient on receptivity

The VLSI design of a single chip Reed-Solomon encoder

A design for a single chip implementation of a Reed-Solomon encoder is presented. The architecture that leads to this single VLSI chip design makes use of a bit serial finite field multiplication algorithm

On the VLSI design of a pipeline Reed-Solomon decoder using systolic arrays

A new very large scale integration (VLSI) design of a pipeline Reed-Solomon decoder is presented. The transform decoding technique used in a previous article is replaced by a time domain algorithm through a detailed comparison of their VLSI implementations. A new architecture that implements the time domain algorithm permits efficient pipeline processing with reduced circuitry. Erasure correction capability is also incorporated with little additional complexity. By using a multiplexing technique, a new implementation of Euclid's algorithm maintains the throughput rate with less circuitry. Such improvements result in both enhanced capability and significant reduction in silicon area

Preliminary catalog of pictures taken on the lunar surface during the Apollo 16 mission

A catalog of all pictures taken from the lunar module or the lunar surface during the Apollo 16 lunar stay is presented. The tabulations are arranged for the following specific uses: (1) given the number of a particular frame, find its location in the sequence of lunar surface activity, the station from which it was taken and the subject matter of the picture; (2) given a particular location or activity within the sequence of lunar surface activity, find the pictures taken at that time and their subject matter; and (3) given a sample number from the voice transcript listed, find the designation assigned to the same sample by the lunar receiving laboratory

A VLSI single chip (255,223) Reed-Solomon encoder with interleaver

A single-chip implementation of a Reed-Solomon encoder with interleaving capability is described. The code used was adapted by the CCSDS (Consulative Committee on Space Data Systems). It forms the outer code of the NASA standard concatenated coding system which includes a convolutional inner code of rate 1/2 and constraint length 7. The architecture, leading to this single VLSI chip design, makes use of a bit-serial finite field multiplication algorithm due to E.R. Berlekamp

A simplified procedure for correcting both errors and erasures of a Reed-Solomon code using the Euclidean algorithm

It is well known that the Euclidean algorithm or its equivalent, continued fractions, can be used to find the error locator polynomial and the error evaluator polynomial in Berlekamp's key equation needed to decode a Reed-Solomon (RS) code. A simplified procedure is developed and proved to correct erasures as well as errors by replacing the initial condition of the Euclidean algorithm by the erasure locator polynomial and the Forney syndrome polynomial. By this means, the errata locator polynomial and the errata evaluator polynomial can be obtained, simultaneously and simply, by the Euclidean algorithm only. With this improved technique the complexity of time domain RS decoders for correcting both errors and erasures is reduced substantially from previous approaches. As a consequence, decoders for correcting both errors and erasures of RS codes can be made more modular, regular, simple, and naturally suitable for both VLSI and software implementation. An example illustrating this modified decoding procedure is given for a (15, 9) RS code

Review of finite fields: Applications to discrete Fourier, transforms and Reed-Solomon coding

An attempt is made to provide a step-by-step approach to the subject of finite fields. Rigorous proofs and highly theoretical materials are avoided. The simple concepts of groups, rings, and fields are discussed and developed more or less heuristically. Examples are used liberally to illustrate the meaning of definitions and theories. Applications include discrete Fourier transforms and Reed-Solomon coding