Approximation of multi-scale elliptic problems using patches of finite elements

In this paper we present a method to solve numerically elliptic problems with multi-scale data using multiple levels of not necessarily nested grids. The method consists in calculating successive corrections to the solution in patches whose discretizations are not necessarily conforming. It resembles the FAC method (see Math. Comp. 46 (174) (1986) 439–456) and its convergence is obtained by a domain decomposition technique (see Math. Comp. 57 (195) (1991) 1–21). However it is of much more flexible use in comparison to the latter. To cite this article: R. Glowinski et al., C. R. Acad. Sci. Paris, Ser. I 337 (2003).     

Study of removal processes of <Superscript>7</Superscript>Be and <Superscript>137</Superscript>Cs from the atmosphere

In order to understand better the way in which radioactive contamination may be transferred from the atmosphere to other ecological compartments it is necessary to obtain information of the deposition mechanisms of radionuclides. Concentration and speciation of ¹³⁷Cs and ⁷Be in the atmospheric aerosol and deposition were studied. The mixed deposition velocities of water-soluble and insoluble ¹³⁷Cs and ⁷Be were determined. The relation between activity concentrations of insoluble ⁷Be in the atmosphere and its amount in deposition was observed. It is supposed that in the deposition process of radiocesium the precipitation plays an important role in scavenging of water-soluble radiocesium by falling raindrops, in contrast to insoluble ¹³⁷Cs where the dry deposition becomes predominant.     

Solid Lipid Nanoparticles (SLNs): Preparation and Properties of Calix[4]resorcinarene Derived Systems.

Solid Lipid Nanoparticles (SLNs) have been prepared fromc-2,c-8,c-14,c-20-tetraundecyl-4,6,10,12,16,18,22,24-octahydroxyresorc[4]areneas colloidal suspensions. Photon Correlation Spectroscopy studies revealed aparticle hydrodynamic diameter of 150 nm. Non-contact mode Atomic ForceMicroscopy allows observation of the particles as slightly flattened sphericalobjects of 236 (±40) nm diameter and 145 (±40) nm height. Thestudy of the preparation parameters showed that shear force does not affectthe hydrodynamic size of the SLNs. In contrast, the viscosity and the pH ofthe aqueous phase, the amphiphile concentration in the organic phase and thevolume of organic phase used, all lead to variation in the size of the particles.In term of post preparation parameters only the ionic strength has been shownto affect significantly the particle size; while the pH of the storing solution,microwave, ultrasonic and thermal treatments do not. Short and long-termstability studies have been performed to measure the effect of the ionic strengthon the stability of the particles. The use of carbohydrate cryoprotectants does notallow re-dispersion of the colloidal suspension after freeze-drying.     

Enumeration of three-dimensional convex polygons

A self-avoiding polygon (SAP) on a graph is an elementary cycle. Counting SAPs on the hypercubic lattice ℤ ^d withd≥2, is a well-known unsolved problem, which is studied both for its combinatorial and probabilistic interest and its connections with statistical mechanics. Of course, polygons on ℤ ^d are defined up to a translation, and the relevant statistic is their perimeter. A SAP on ℤ ^d is said to beconvex if its perimeter is “minimal”, that is, is exactly twice the sum of the side lengths of the smallest hyper-rectangle containing it. In 1984, Delest and Viennot enumerated convex SAPs on the square lattice [6], but no result was available in a higher dimension. We present an elementar approach to enumerate convex SAPs in any dimension. We first obtain a new proof of Delest and Viennot's result, which explains combinatorially the form of the generating function. We then compute the generating function for convex SAPs on the cubic lattice. In a dimension larger than 3, the details of the calculations become very cumbersome. However, our method suggests that the generating function for convex SAPs on ℤ ^d is always a quotient ofdifferentiably finite power series.     

Latin Squares without Orthogonal Mates

In 1779 Euler proved that for every even n there exists a latin square of order n that has no orthogonal mate, and in 1944 Mann proved that for every n of the form 4k + 1, k ≥ 1, there exists a latin square of order n that has no orthogonal mate. Except for the two smallest cases, n = 3 and n = 7, it is not known whether a latin square of order n = 4k + 3 with no orthogonal mate exists or not. We complete the determination of all n for which there exists a mate-less latin square of order n by proving that, with the exception of n = 3, for all n = 4k + 3 there exists a latin square of order n with no orthogonal mate. We will also show how the methods used in this paper can be applied more generally by deriving several earlier non-orthogonality results.