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.     

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.     

Stratifiable Families of Extremals and Sufficient Conditions for Optimality in Optimal Control Problems

It is shown that, if a parametrized fämily of extremals F can be stratified in a way compatible with the flow map generated by F, then those trajectories of the family which realize the minimal values of the cost in F are indeed optimal in comparison with all trajectories which lie in the region R covered by the trajectories of F. It is not assumed that F is a field covering the state space injectively. As illustration, an optimal synthesis is constructed for a system where the flow of extremals exhibits a simple cusp singularity.     

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     

Lattices contained in planar orders are planar

The covering graph of a lattice which is contained in an ordered set with a planar covering graph is itself planar.Presented by R. W. Quackenbush.     

On mechano-chemical Calcium waves

The influence of mechano-chemical coupling on calcium concentration waves is considered. The propagation of calcium waves is described by a reaction–diffusion equation with the reaction term dependent on the mechanical stress responsible for the release of calcium. Similarly the balance of mechanical forces is influenced by the calcium concentration through the so-called traction force.     

Farkas-type results for fractional programming problems

Considering a constrained fractional programming problem, within the present paper we present some necessary and sufficient conditions, which ensure that the optimal objective value of the considered problem is greater than or equal to a given real constant. The desired results are obtained using the Fenchel–Lagrange duality approach applied to an optimization problem with convex or difference of convex (DC) objective functions and finitely many convex constraints. These are obtained from the initial fractional programming problem using an idea due to Dinkelbach. We also show that our general results encompass as special cases some recently obtained Farkas-type results.     

Lévy processes and Fourier multipliers

We study Fourier multipliers which result from modulating jumps of Lévy processes. Using the theory of martingale transforms we prove that these operators are bounded in Lp(Rd) for 1<p<∞ and we obtain the same explicit bound for their norm as the one known for the second order Riesz transforms.