Atom-atomic potentials and the correlation distribution functions for modeling liquid benzene by the molecular dynamics methods

A brief review of the potential functions used in the molecular dynamics modeling of liquid benzene is presented. The structural characteristics of liquid benzene obtained from the correlation distribution functions are discussed. It is demonstrated that, within the framework of this approach, the predicted structure of liquid benzene is virtually independent of the form of the potential used.     

Some heteroclinic solutions of a model of skin pattern formation

In this paper we study travelling wave solutions to a system of four non‐linear partial differential equations, which arise in a tissue interaction model for skin morphogenesis. Under the ‘small‐stress’ assumption we prove the existence and uniqueness (up to a translation) of solutions with the dermis and epidermis cell densities being positive, which are a perturbation of a uniform epidermal cell density. We discuss the problem of the minimal wave‐speed. Copyright © 2004 John Wiley & Sons, Ltd.     

Justification of the Shallow-Water Limit for a Rigid-Lid Flow with Bottom Topography

The so-called lake equations arise as the shallow-water limit of the rigid-lid equations—three-dimensional Euler equations with a rigid-lid upper boundary condition—in a horizontally periodic basin with bottom topography. We prove an a priori estimate in the Sobolev space H ^m for m≥ 3 which shows that a solution to the rigid-lid equations can be approximated by a solution of the lake equations for an interval of time which can be estimated in terms of the initial deviation from a columnar configuration and the magnitude of the initial data in H ^m , the gradient of the bottom topography in H ^m+1 , and the aspect ratio of the basin. In particular, any solution to the lake equations remains close to some solution of the rigid-lid equations for an interval of time that can be made arbitrarily large by choosing the aspect ratio of the basin small. Received 10 October 1996 and accepted 15 May 1997     

Neuro-fuzzy approach to processing inputs with missing values in pattern recognition problems

An approach to dealing with missing data, both during the design and normal operation of a neuro-fuzzy classifier is presented in this paper. Missing values are processed within a general fuzzy min–max neural network architecture utilising hyperbox fuzzy sets as input data cluster prototypes. An emphasis is put on ways of quantifying the uncertainty which missing data might have caused. This takes a form of classification procedure whose primary objective is the reduction of a number of viable alternatives rather than attempting to produce one winning class without supporting evidence. If required, the ways of selecting the most probable class among the viable alternatives found during the primary classification step, which are based on utilising the data frequency information, are also proposed. The reliability of the classification and the completeness of information is communicated by producing upper and lower classification membership values similar in essence to plausibility and belief measures to be found in the theory of evidence or possibility and necessity values to be found in the fuzzy sets theory. Similarities and differences between the proposed method and various fuzzy, neuro-fuzzy and probabilistic algorithms are also discussed. A number of simulation results for well-known data sets are provided in order to illustrate the properties and performance of the proposed approach.     

Letter: Note on Invariants of the Weyl Tensor

Algebraically special gravitational fields are described using algebraic and differential invariants of the Weyl tensor. A type III invariant is also given and calculated for Robinson-Trautman spaces.     

Randomization helps to perform independent tasks reliably

This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

Une axiomatisation de la substitution

We investigate the notion of substitution in an abstract way, without defining it explicitly. We single out the essential features of the operation of performing a substitution in order to define a concept of substitutive structure, called logos. We then prove a completeness theorem making precise and justifying the intuition that formulas true for the usual substitution can be proved from the logos axioms only. To cite this article: M. Crabbé, C. R. Acad. Sci. Paris, Ser. I 338 (2004).     

The Dedekind-MacNeille completion as a reflector

We introduce a special type of order-preserving maps between quasiordered sets, the so-called cut-stable maps. These form the largest morphism class such that the corresponding category of quasiordered sets contains the category of complete lattices and complete homomorphisms as a full reflective subcategory, the reflector being given by the Dedekind-MacNeille completion (alias normal completion or completion by cuts). Suitable restriction of the object class leads to the category of separated quasiordered sets and its full reflective subcategory of completely distributive lattices. Similar reflections are obtained for continuous lattices, algebraic lattices, etc.     

Rigid nitronyl-nitroxide-labelled anchoring molecules: syntheses, structural and magnetic investigations

The syntheses of two rigid organic molecular rods bearing a nitronyl-nitroxide radical and a terminal nitrogen-based functionality like a pyridine or a cyano group are reported. Both new paramagnetic molecules are fully characterized, including crystal structure analysis. Furthermore their magnetic behaviours in the crystalline state are investigated and their spin concentration corroborate their excellent purity. While the pyridine functionalized rod is synthesized by converting the corresponding benzaldehyde to the phenyl-nitronyl-nitroxide radical, the synthesis of the cyano functionalized rod demonstrates the accessibility of highly sophisticated spin-labelled molecules via cross-coupling reaction with a meta-iodo-phenyl-nitronyl-nitroxide moiety.