A broadly applicable algorithm for computing maximum likelihood estimates from incomplete data is presented at various levels of generality. Theory showing the monotone behaviour of the likelihood and convergence of the algorithm is derived. Many examples are sketched, including missing value

Two limit behaviours of a simple model of aerosol are considered. The only force acting on aerosol particles is a friction due to the flow of gas. It is first proved that in the limit of an infinite friction coefficient, the particles are simply advected by the gas. Then we consider very dilute sprays of aerosol, i.e. with distribution functions which are monokinetic (Dirac mass in velocity). This approach leads to a macroscopic system with a free-boundary problem.

Tools to visualise the structure of multi-agent

This article cites 14 articles, 10 of which can be accessed free at:

The TRANSFAC database on transcription factors, their binding sites, nucleotide distribution matrices and regulated genes as well as the complementing database TRANSCompel on composite elements have been further enhanced on various levels. A new web interface with different search options

This paper presents a methodology for agent-oriented analysis and design. The methodology is general, in that it is applicable to a wide range of multi-agent systems, and comprehensive, in that it deals with both the macro-level (societal) and the micro-level (agent) aspects of systems

A grand challenge in the post-genomic era is a complete computer representation of the cell and the organism, which will enable computational prediction of higher-level complexity of cellular processes and organism behavior from genomic information. Toward this end we have been developing a

information, and data access. These mechanisms are used to construct various higher-level metacomp...

. This allows programs to reason about the state of the world and consider the effects of various possible courses of action before committing to a particular behavior. The net effect is that programs may be written at a much higher level of abstraction than is usually possible. The language appears well suited

for a single channel wireless LAN being developed at Xerox Corporation's Palo Alto Research Center. We start with the MACA media access protocol rst proposed by Karn [9] and later refined by Biba [3] which uses an RTS-CTS-DATA packet exchange and binary exponential backo. Using packet-level