Suppressive Therapy In The Control Of Bilharziasis: A Comparative Trial In African School Children

A CAJM article on the control of bilharzia-sis in Zimbabwean (Rhodesian) African children.One of the major problems facing the health service in any country which has a high prevalence of bilharziasis is the shortage of medical personnel required for the successful treatment of the large numbers of people who show infection. However, if a totally safe regime involving the administration of relatively innocuous drug at low dosages over long periods of time to control or suppress the level of infection in the person, the administration of the drug could then be left to the teachers or to other responsible members of the community. It is in this context that the policy of suppressive therapy or management of schistosome infections shows its greatest attraction

Debris disk size distributions: steady state collisional evolution with P-R drag and other loss processes

We present a new scheme for determining the shape of the size distribution, and its evolution, for collisional cascades of planetesimals undergoing destructive collisions and loss processes like Poynting-Robertson drag. The scheme treats the steady state portion of the cascade by equating mass loss and gain in each size bin; the smallest particles are expected to reach steady state on their collision timescale, while larger particles retain their primordial distribution. For collision-dominated disks, steady state means that mass loss rates in logarithmic size bins are independent of size. This prescription reproduces the expected two phase size distribution, with ripples above the blow-out size, and above the transition to gravity-dominated planetesimal strength. The scheme also reproduces the expected evolution of disk mass, and of dust mass, but is computationally much faster than evolving distributions forward in time. For low-mass disks, P-R drag causes a turnover at small sizes to a size distribution that is set by the redistribution function (the mass distribution of fragments produced in collisions). Thus information about the redistribution function may be recovered by measuring the size distribution of particles undergoing loss by P-R drag, such as that traced by particles accreted onto Earth. Although cross-sectional area drops with 1/age^2 in the PR-dominated regime, dust mass falls as 1/age^2.8, underlining the importance of understanding which particle sizes contribute to an observation when considering how disk detectability evolves. Other loss processes are readily incorporated; we also discuss generalised power law loss rates, dynamical depletion, realistic radiation forces and stellar wind drag.Comment: Accepted for publication by Celestial Mechanics and Dynamical Astronomy (special issue on EXOPLANETS

Benchmark low-mass objects in Moving Groups

This is an Open Access article distributed under the terms of the Creative Commons Attribution License 2.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.In order to compile a sample of ultracool dwarfs that will serve as benchmarks for testing theoretical formation and evolutionary models, we selected low-mass cool (>M7) objects that are potentially members of five known young Moving Groups in the solar neighbourhood. We have studied the kinematics of the sample, finding that 49 targets belong to the young disk area, from which 36 are kinematic member of one of the five moving groups under study. Some of the identified low-mass members have been spectroscopically characterised (T-eff, log g) and confirmed as young members through a detailed study of age indicators

Determination of step--edge barriers to interlayer transport from surface morphology during the initial stages of homoepitaxial growth

We use analytic formulae obtained from a simple model of crystal growth by molecular--beam epitaxy to determine step--edge barriers to interlayer transport. The method is based on information about the surface morphology at the onset of nucleation on top of first--layer islands in the submonolayer coverage regime of homoepitaxial growth. The formulae are tested using kinetic Monte Carlo simulations of a solid--on--solid model and applied to estimate step--edge barriers from scanning--tunneling microscopy data on initial stages of Fe(001), Pt(111), and Ag(111) homoepitaxy.Comment: 4 pages, a Postscript file, uuencoded and compressed. Physical Review B, Rapid Communications, in press

Unsupervised Deconvolution of Dynamic Imaging Reveals Intratumor Vascular Heterogeneity and Repopulation Dynamics

With the existence of biologically distinctive malignant cells originated within the same tumor, intratumor functional heterogeneity is present in many cancers and is often manifested by the intermingled vascular compartments with distinct pharmacokinetics. However, intratumor vascular heterogeneity cannot be resolved directly by most in vivo dynamic imaging. We developed multi-tissue compartment modeling (MTCM), a completely unsupervised method of deconvoluting dynamic imaging series from heterogeneous tumors that can improve vascular characterization in many biological contexts. Applying MTCM to dynamic contrast-enhanced magnetic resonance imaging of breast cancers revealed characteristic intratumor vascular heterogeneity and therapeutic responses that were otherwise undetectable. MTCM is readily applicable to other dynamic imaging modalities for studying intratumor functional and phenotypic heterogeneity, together with a variety of foreseeable applications in the clinic

Large Kinetic Power in FRII Radio Jets

We investigate the total kinetic powers (L_{j}) and ages (t_{age}) of powerful jets of four FR II radio sources (Cygnus A, 3C 223, 3C 284, and 3C 219) by the detail comparison of the dynamical model of expanding cocoons with observed ones. It is found that these sources have quite large kinetic powers with the ratio of L_{j} to the Eddington luminosity (L_{Edd}) resides in $0.02 <L_{j}/L_{Edd} <10$. Reflecting the large kinetic powers, we also find that the total energy stored in the cocoon (E_{c}) exceed the energy derived from the minimum energy condition (E_{min}): $2< E_{c}/E_{min} <160$. This implies that a large amount of kinetic power is carried by invisible components such as thermal leptons (electron and positron) and/or protons.Comment: 5 pages, accepted for publication in Astrophysics and Space Scienc

Algorithms for Game Metrics

Simulation and bisimulation metrics for stochastic systems provide a quantitative generalization of the classical simulation and bisimulation relations. These metrics capture the similarity of states with respect to quantitative specifications written in the quantitative {\mu}-calculus and related probabilistic logics. We first show that the metrics provide a bound for the difference in long-run average and discounted average behavior across states, indicating that the metrics can be used both in system verification, and in performance evaluation. For turn-based games and MDPs, we provide a polynomial-time algorithm for the computation of the one-step metric distance between states. The algorithm is based on linear programming; it improves on the previous known exponential-time algorithm based on a reduction to the theory of reals. We then present PSPACE algorithms for both the decision problem and the problem of approximating the metric distance between two states, matching the best known algorithms for Markov chains. For the bisimulation kernel of the metric our algorithm works in time O(n^4) for both turn-based games and MDPs; improving the previously best known O(n^9\cdot log(n)) time algorithm for MDPs. For a concurrent game G, we show that computing the exact distance between states is at least as hard as computing the value of concurrent reachability games and the square-root-sum problem in computational geometry. We show that checking whether the metric distance is bounded by a rational r, can be done via a reduction to the theory of real closed fields, involving a formula with three quantifier alternations, yielding O(|G|^O(|G|^5)) time complexity, improving the previously known reduction, which yielded O(|G|^O(|G|^7)) time complexity. These algorithms can be iterated to approximate the metrics using binary search.Comment: 27 pages. Full version of the paper accepted at FSTTCS 200

Inheritance of Temporal Logic Properties

Abstract. Inheritance is one of the key features for the success of object-oriented languages. Inheritance (or specialisation) supports incremental design and re-use of already written specifications or programs. In a for-mal approach to system design the interest does not only lie in re-use of class definitions but also in re-use of correctness proofs. If a provably correct class is specialised we like to know those correctness properties which are preserved in the subclass. This can avoid re-verification of already proven properties and may thus substantially reduce the verifi-cation effort. In this paper we study the question of inheritance of correctness prop-erties in the context of state-based formalisms, using a temporal logic (CTL) to formalise requirements on classes. Given a superclass and its specialised subclass we develop a technique for computing the set of for-mulas which are preserved in the subclass. For specialisation we allow addition of attributes, modification of existing as well as extension with new methods.

Synchronous counting and computational algorithm design

Consider a complete communication network on n nodes, each of which is a state machine with s states. In synchronous 2-counting, the nodes receive a common clock pulse and they have to agree on which pulses are “odd” and which are “even”. We require that the solution is self-stabilising (reaching the correct operation from any initial state) and it tolerates f Byzantine failures (nodes that send arbitrary misinformation). Prior algorithms are expensive to implement in hardware: they require a source of random bits or a large number of states s. We use computational techniques to construct very compact deterministic algorithms for the first non-trivial case of f = 1. While no algorithm exists for n < 4, we show that as few as 3 states are sufficient for all values n ≥ 4. We prove that the problem cannot be solved with only 2 states for n = 4, but there is a 2-state solution for all values n ≥ 6.Peer reviewe