Quadtrees as an Abstract Domain

Quadtrees have proved popular in computer graphics and spatial databases as a way of representing regions in two dimensional space. This hierarchical data-structure is flexible enough to support non-convex and even disconnected regions, therefore it is natural to ask whether this datastructure can form the basis of an abstract domain. This paper explores this question and suggests that quadtrees offer a new approach to weakly relational domains whilst their hierarchical structure naturally lends itself to representation with boolean functions

Modelling mucociliary clearance

Mathematical modelling of the fluid mechanics of mucociliary clearance (MCC) is reviewed and future challenges for researchers are discussed. The morphology of the bronchial and tracheal airway surface liquid (ASL) and ciliated epithelium are briefly introduced. The cilia beat cycle, beat frequency and metachronal coordination are described, along with the rheology of the mucous layer. Theoretical modelling of MCC from the late 1960s onwards is reviewed, and distinctions between ‘phenomenological’, ‘slender body theory’ and recent ‘fluid–structure interaction’ models are explained.\ud \ud The ASL consists of two layers, an overlying mucous layer and underlying watery periciliary layer (PCL) which bathes the cilia. Previous models have predicted very little transport of fluid in the PCL compared with the mucous layer. Fluorescent tracer transport experiments on human airway cultures conducted by Matsui et al. [Matsui, H., Randell, S.H., Peretti, S.W., Davis, C.W., Boucher, R.C., 1998. Coordinated clearance of periciliary liquid and mucus from airway surfaces. J. Clin. Invest. 102 (6), 1125–1131] apparently showed equal transport in both the PCL and mucous layer. Recent attempts to resolve this discrepancy by the present authors are reviewed, along with associated modelling findings. These findings have suggested new insights into the interaction of cilia with mucus due to pressure gradients associated with the flat PCL/mucus interface. This phenomenon complements previously known mechanisms for ciliary propulsion. Modelling results are related to clinical findings, in particular the increased MCC observed in patients with pseudohypoaldosteronism. Recent important advances by several groups in modelling the fluid–structure interaction by which the cilia movement and fluid transport emerge from specification of internal mechanics, viscous and elastic forces are reviewed. Finally, we discuss the limitations of existing work, and the challenges for the next generation of models, which may provide further insight into this complex and vital system

Towards a Notion of Distributed Time for Petri Nets

We set the ground for research on a timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the age of tokens required for enabling. The novelty is that, rather than a single global clock, we use a set of unrelated clocks --- possibly one per place --- allowing a local timing as well as distributed time synchronisation. We give a formal definition of the model and investigate properties of local versus global timing, including decidability issues and notions of processes of the respective models

Computability and analysis: the legacy of Alan Turing

We discuss the legacy of Alan Turing and his impact on computability and analysis.Comment: 49 page

Complexity of Restricted and Unrestricted Models of Molecular Computation

In [9] and [2] a formal model for molecular computing was proposed, which makes focused use of affinity purification. The use of PCR was suggested to expand the range of feasible computations, resulting in a second model. In this note, we give a precise characterization of these two models in terms of recognized computational complexity classes, namely branching programs (BP) and nondeterministic branching programs (NBP) respectively. This allows us to give upper and lower bounds on the complexity of desired computations. Examples are given of computable and uncomputable problems, given limited time