On the domain dependence of solutions to the compressible Navier–Stokes equations of a barotropic fluid

We prove a general compactness result for the solution set of the compressible Navier–Stokes equations with respect to the variation of the underlying spatial domain. Among various corollaries, we then prove a general existence theorem for the system in question with no restrictions on smoothness of the spatial domain. Copyright © 2002 John Wiley & Sons, Ltd.     

Surface grating formation and erasing on a-Se films

Surface relief formation at holographic recording on amorphous selenium films was demonstrated and investigated. The presence of this optical phase modulation component is essential for ensuring significant, stable and erasable optical recording in a-Se films at 290–320 K temperatures, where conventional photodarkening was known as insignificant and unstable. Photocrystallization can only be observed in super-exposed a-Se films at the given experimental conditions of hologram recording. Erasing behavior of surface relief gratings under heat treatment was also investigated in order to reveal further details of the mechanism. Photoinduced structural transformations within the amorphous phase, connected to local ordering under the condition of light-induced fluidity, are proposed as an explanation for the relief formation and erasing. The observed reversible optical recording process may be useful for the various optoelectronic applications of photoconductive a-Se layers. Received: 12 June 2000 / Accepted: 6 June 2001 / Published online: 30 August 2001     

Isometries of the Dirichlet space among the composition operators

We show that every composition operator which is an isometry of the Dirichlet space is induced by a univalent full map of the disk into itself that fixes the origin. This is an analogue of the Hardy space result for inner functions due to Nordgren. The proof relies on the Stone-Weierstrass theorem and the Riesz representation theorem.

     

A warehouse-based design model for reverse logistics

In this paper, an MILP formulation is proposed for the design of a reverse logistics network based on a warehouse location–allocation model, which optimizes, simultaneously, the forward and reverse networks. A single product model with unlimited capacity is first defined. Subsequently, the model is extended to a multi-product capacitated recovery network model, where capacity limitations and a multi-product system can be considered. The proposed model is compared to published work in the field, where different model assumptions have been proposed. Two cases are described so as to gain a better insight into the model and allow a comparative analysis.     

Scaled-oscillation and regularity

We give sufficient conditions for Sobolev and Lipschitz functions in terms of their lower scaled-oscillation. The sharpness of these conditions is shown by examples. Our examples also show that a Stepanov-type differentiability theorem does not hold under the boundedness assumption of the lower scaled-oscillation.

     

New examples of Osserman metrics with nondiagonalizable Jacobi operators

Explicit examples of Osserman 4-manifolds with exactly two distinct eigenvalues of the Jacobi operators, α and β=4α≠0, are given. The former has multiplicity two and is a double root of the minimal polynomial of the Jacobi operators.     

Inclusion of carbon nanotubes in a TiO2 sol-gel matrix

We report here the successful inclusion of carbon nanotubes (CNs) into a TiO₂ matrix prepared by a sol-gel method. The presence of CNs in the sol-gel matrix and the structure of the film were analyzed principally by transmission electron microscopy. Complementary information about the behavior of embedded carbon nanotubes versus heat treatment and ion irradiation were obtained by X-ray photoelectron spectroscopy. The elaboration of an inorganic matrix containing embedded carbon nanotubes leads to a new nanocomposite. The possible applications of this nanocomposite are discussed.     

Aggregate error locator and error value computation in AG codes

The aggregate error locator is defined and a computation method is given. The aggregate error locator is then used in a type of Forney algorithm to compute the error values in the received words of a Ca,b algebraic geometry code.