Kinetic Models for Chemotaxis and their Drift-Diffusion Limits

Kinetic models for chemotaxis, nonlinearly coupled to a Poisson equation for the chemo-attractant density, are considered. Under suitable assumptions on the turning kernel (including models introduced by Othmer, Dunbar and Alt), convergence in the macroscopic limit to a drift-diffusion model is proven. The drift-diffusion models derived in this way include the classical Keller-Segel model. Furthermore, sufficient conditions for kinetic models are given such that finite-time-blow-up does not occur. Examples are given satisfying these conditions, whereas the macroscopic limit problem is known to exhibit finite-time-blow-up. The main analytical tools are entropy techniques for the macroscopic limit as well as results from potential theory for the control of the chemo-attractant density.Present address: Centro de Matemática e Aplicações Fundamentais, Universidade de Lisboa, Av. Prof. Gama Pinto 2, 1649-003, Lisboa, Portugal     

Impact of Partial Separability on Large-Scale Optimization

ELSO is an environment for the solution oflarge-scale optimization problems. With ELSO the user is required to provide only code for the evaluation of a partially separable function. ELSO exploits the partialseparability structure of the function to computethe gradient efficiently using automatic differentiation.We demonstrate ELSO's efficiency by comparing thevarious options available in ELSO.Our conclusion is that the hybrid option in ELSOprovides performance comparable to the hand-coded option, while having the significantadvantage of not requiring a hand-coded gradient orthe sparsity pattern of the partially separable function.In our test problems, which have carefully coded gradients,the computing time for the hybrid AD option is within a factor of two of thehand-coded option.     

Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates

We provide an approximate analysis of the transient sojourn time for a processor sharing queue with time varying arrival and service rates, where the load can vary over time, including periods of overload. Using the same asymptotic technique as uniform acceleration as demonstrated in [12] and [13], we obtain fluid and diffusion limits for the sojourn time of the M_t/M_t/1 processor-sharing queue. Our analysis is enabled by the introduction of a “virtual customer” which differs from the notion of a “tagged customer” in that the former has no effect on the processing time of the other customers in the system. Our analysis generalizes to non-exponential service and interarrival times, when the fluid and diffusion limits for the queueing process are known.     

Dynamics of a pair of coupled nonlinear oscillators

A pair of coupled classical oscillators with a general potential and general form of coupling is investigated. For general potentials, the single-frequency solution is shown to be stable for small excitations. For special potentials, such system remains stable for an arbitrary excitation. In both cases, the stability does not depend on the form of coupling. Transition to the instability regime follows from the way how nonlinear potential entrains the energy transfer between the oscillators. Relation between the existence of multi-frequency quasi-periodic or periodic solutions and the instability of single-frequency ones is discussed.     

On a class of elliptic operators with nonpolynomial degeneracy on a boundary

Rostov-on-Don. Translated fromSibirskiî Matematicheskiî Zhurnal, Vol. 33, No. 5, pp. 91–99, September–October, 1992.     

Access to Paullone Analogues by Intramolecular Heck Reaction

The syntheses of paullone ( 1a ) and three paullone derivatives, including a sulfur analogue ( 2a ), a tricyclic derivative ( 2b ), and a ring‐enlarged variant ( 2c ), are described, Pd‐catalyzed intramolecular Heck reaction being the key step. The kinase‐inhibitory properties of the novel paullone analogues were investigated.     

Generating well-behaved utility functions for compromise programming

The purpose of this paper is to seek utility functions satisfying a weak condition which guarantees that the utility optimum always belongs to the compromise set. This set is a special subset of the attainable or feasible set, which is generated through the application of the well-known operational research approach called compromise programming. It is shown that there are large families of utility functions satisfying this condition, thus reinforcing the value of compromise programming as a good surrogate of the traditional utility optimum.Thanks are due to the reviewers for their helpful suggestions. The English editing by Ms. Christine Méndez is appreciated. The authors have been supported by the Comisión Interministerial de Ciencia y Tecnología (CICYT), Madrid, Spain.     

Bounded speed of propagation for solutions to radiative transfer equations

The Radiative Transfer Equation is the nonlinear transport equation