What's getting in the way of a One Water approach to water services planning and management?

A range of factors prevents the development of institutional changes that would allow a shift to "One Water" systems. Foremost of these is the inertia associated with the dominant paradigm of centralised and siloed systems. This, together with the complex structure of regulations that currently exist for water supply, wastewater and storm water management, poses significant obstacles to a fully integrated approach. The regulatory patchwork environment, with overlapping responsibilities and jurisdictions, particularly with respect to the need for management of both public health and environmental risks, currently hinders system integration. This paper aims to understand what institutional challenges organisations engaged in the One Water approach have faced

Global Versus Local Computations: Fast Computing with Identifiers

This paper studies what can be computed by using probabilistic local interactions with agents with a very restricted power in polylogarithmic parallel time. It is known that if agents are only finite state (corresponding to the Population Protocol model by Angluin et al.), then only semilinear predicates over the global input can be computed. In fact, if the population starts with a unique leader, these predicates can even be computed in a polylogarithmic parallel time. If identifiers are added (corresponding to the Community Protocol model by Guerraoui and Ruppert), then more global predicates over the input multiset can be computed. Local predicates over the input sorted according to the identifiers can also be computed, as long as the identifiers are ordered. The time of some of those predicates might require exponential parallel time. In this paper, we consider what can be computed with Community Protocol in a polylogarithmic number of parallel interactions. We introduce the class CPPL corresponding to protocols that use $O(n\log^k n)$, for some k, expected interactions to compute their predicates, or equivalently a polylogarithmic number of parallel expected interactions. We provide some computable protocols, some boundaries of the class, using the fact that the population can compute its size. We also prove two impossibility results providing some arguments showing that local computations are no longer easy: the population does not have the time to compare a linear number of consecutive identifiers. The Linearly Local languages, such that the rational language $(ab)^*$, are not computable.Comment: Long version of SSS 2016 publication, appendixed version of SIROCCO 201

Probing active forces via a fluctuation-dissipation relation: Application to living cells

We derive a new fluctuation-dissipation relation for non-equilibrium systems with long-term memory. We show how this relation allows one to access new experimental information regarding active forces in living cells that cannot otherwise be accessed. For a silica bead attached to the wall of a living cell, we identify a crossover time between thermally controlled fluctuations and those produced by the active forces. We show that the probe position is eventually slaved to the underlying random drive produced by the so-called active forces.Comment: 5 page

Anonymous Asynchronous Systems: The Case of Failure Detectors

Due the multiplicity of loci of control, a main issue distributed systems have to cope with lies in the uncertainty on the system state created by the adversaries that are asynchrony, failures, dynamicity, mobility, etc. Considering message-passing systems, this paper considers the uncertainty created by the net effect of three of these adversaries, namely, asynchrony, failures, and anonymity. This means that, in addition to be asynchronous and crash-prone, the processes have no identity. Trivially, agreement problems (e.g., consensus) that cannot be solved in presence of asynchrony and failures cannot be solved either when adding anonymity. The paper consequently proposes anonymous failure detectors to circumvent these impossibilities. It has several contributions. First it presents three classes of failure detectors (denoted AP, A∩ and A∑) and show that they are the anonymous counterparts of the classes of perfect failure detectors, eventual leader failure detectors and quorum failure detectors, respectively. The class A∑ is new and showing it is the anonymous counterpart of the class ∑ is not trivial. Then, the paper presents and proves correct a genuinely anonymous consensus algorithm based on the pair of anonymous failure detector classes (A∩, A∑) (“genuinely” means that, not only processes have no identity, but no process is aware of the total number of processes). This new algorithm is not a “straightforward extension” of an algorithm designed for non-anonymous systems. To benefit from A∑, it uses a novel message exchange pattern where each phase of every round is made up of sub-rounds in which appropriate control information is exchanged. Finally, the paper discusses the notions of failure detector class hierarchy and weakest failure detector class for a given problem in the context of anonymous systems

Charge distribution in two-dimensional electrostatics

We examine the stability of ringlike configurations of N charges on a plane interacting through the potential $V(z_1,...,z_N)=\sum_i |z_i|^2-\sum_{i<j} ln|z_i-z_j|^2$. We interpret the equilibrium distributions in terms of a shell model and compare predictions of the model with the results of numerical simulations for systems with up to 100 particles.Comment: LaTe

Facet ridge end points in crystal shapes

Equilibrium crystal shapes (ECS) near facet ridge end points (FRE) are generically complex. We study the body-centered solid-on-solid model on a square lattice with an enhanced uniaxial interaction range to test the stability of the so-called stochastic FRE point where the model maps exactly onto one dimensional Kardar-Parisi-Zhang type growth and the local ECS is simple. The latter is unstable. The generic ECS contains first-order ridges extending into the rounded part of the ECS, where two rough orientations coexist and first-order faceted to rough boundaries terminating in Pokrovsky-Talapov type end points.Comment: Contains 4 pages, 5 eps figures. Uses RevTe

Extended Universality of the Surface Curvature in Equilibrium Crystal Shapes

We investigate the universal property of curvatures in surface models which display a flat phase and a rough phase whose criticality is described by the Gaussian model. Earlier we derived a relation between the Hessian of the free energy and the Gaussian coupling constant in the six-vertex model. Here we show its validity in a general setting using renormalization group arguments. The general validity of the relation is confirmed numerically in the RSOS model by comparing the Hessian of the free energy and the Gaussian coupling constant in a transfer matrix finite-size-scaling study. The Hessian relation gives clear understanding of the universal curvature jump at roughening transitions and facet edges and also provides an efficient way of locating the phase boundaries.Comment: 19 pages, RevTex, 3 Postscript Figures, To appear in Phys. Rev.