The Determination of Protonation Constants of Some Amino Acids and Their Esters by Potentiometry in Different Media

In this study, stoichiometric protonation constants of L-tyrosine, L-cysteine, L-tryptophane, L-lysine, and L-histidine, and their methyl and ethyl esters in water and ethanol–water mixtures of 30, 50, and 70% ethanol (v/v), were determined potentiometrically using a combined pH electrode system calibrated as the concentration of hydrogen ion. Titrations were performed at 25^∘C and the ionic strength of the medium was maintained at 0.10 mol⋅L⁻¹ using sodium chloride. Protonation constants were calculated by using the BEST computer program. The effect of solvent composition on the protonation constants is discussed. The log₁₀ K₂ values of esters generally decreased with increasing ethanol content. However, the log₁₀ K₁ values of the esters of L-tyrosine, L-cysteine, and L-tryptophane were found to increase with increasing ethanol content in contrast those of L-lysine and L-histidine esters.     

Non-explosion en temps grand et stabilité de solutions globales des équations de Navier–StokesNon-blowup at large times and stability for global solutions to the Navier–Stokes equations

Suppose there exists a global solution u to the incompressible Navier–Stokes equations, such that $\text{u∈}\text{C}{}_{\mathrm{t}}\text{(}\text{H}\text{?}{}^{\mathrm{1/2}}\text{)}$. We prove that its $\text{H}\text{?}{}^{\mathrm{1/2}}$ norm goes to 0 at infinity. We next use this fact to control the $\text{L}{}^2{}_{\mathrm{t}}\text{(}\text{H}\text{?}{}^{\mathrm{3/2}}\text{)}$ norm of u, and finally we prove that such a solution is stable. To cite this article: I. Gallagher et al., C. R. Acad. Sci. Paris, Ser. I 334 (2002) 289–292.     

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.     

Erratum: Synthesis and characterization of diorganotin(IV) complexes of Schiff bases with ONO‐type donors and crystal structure of [N‐(2‐hydroxy‐4‐nitrophenyl)‐3‐ethoxysalicylideneiminato]diphenyltin(IV)

The article referenced above was first published online on 30 August 2007 with incorrect pagination; the pagination has now been corrected online and in print. Copyright © 2007 John Wiley & Sons, Ltd.     

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