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

Ipsilateral femoral vein compression: A contraindication to thrombin injection of femoral pseudoaneurysms

AbstractDevelopment of a femoral artery pseudoaneurysm occurs in 0.6% to 3.2% of interventional procedures. Nonsurgical treatment has consisted of ultrasound scan—directed compression and, more recently, direct thrombin injection into the pseudoaneurysm cavity to achieve thrombosis. Reported complications after thrombin injection are rare. We report two cases of femoral venous compression associated with pseudoaneurysm injection and review the literature. A 76-year-old man and an 86-year-old man both underwent thrombin injection of pseudoaneurysms compressing the ipsilateral common femoral vein. Both patients were diagnosed with deep venous thrombosis and subsequently needed surgical exploration for repair of the pseudoaneurysm and release of the venous compression. At exploration, both were found to have significant inflammation surrounding the femoral vessels, which made vessel exposure challenging. Because of the venous outflow obstruction involved in femoral pseudoaneurysms with secondary venous compression and the surgical difficulty caused by surrounding inflammation, avoidance of thrombin injection in favor of early surgical intervention is suggested

Relating L-Resilience and Wait-Freedom via Hitting Sets

The condition of t-resilience stipulates that an n-process program is only obliged to make progress when at least n-t processes are correct. Put another way, the live sets, the collection of process sets such that progress is required if all the processes in one of these sets are correct, are all sets with at least n-t processes. We show that the ability of arbitrary collection of live sets L to solve distributed tasks is tightly related to the minimum hitting set of L, a minimum cardinality subset of processes that has a non-empty intersection with every live set. Thus, finding the computing power of L is NP-complete. For the special case of colorless tasks that allow participating processes to adopt input or output values of each other, we use a simple simulation to show that a task can be solved L-resiliently if and only if it can be solved (h-1)-resiliently, where h is the size of the minimum hitting set of L. For general tasks, we characterize L-resilient solvability of tasks with respect to a limited notion of weak solvability: in every execution where all processes in some set in L are correct, outputs must be produced for every process in some (possibly different) participating set in L. Given a task T, we construct another task T_L such that T is solvable weakly L-resiliently if and only if T_L is solvable weakly wait-free

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

History of degenerative spondylolisthesis: From anatomical description to surgical management

This review of the historical medical literature aimed at understanding the evolution of surgical management of degenerative spondylolisthesis over time. The Medic@, IndexCat and Gallica historical databases and PubMed and Embase medical databases were used, with several search-terms, exploring the years 1700-2018. Data from anatomical, biomechanical, pathophysiological and surgical studies were compiled. In total, 150 documents were obtained, dating from 1782 to 2018: 139 from PubMed, 1 from Medic@, 7 from IndexCat, and 3 from Gallica. The review thus ranges in time from (1) description of the first clinical cases by several authors in Europe (1782), (2) the identification of a distinct entity by MacNab (1963), and (3) surgical management by the emerging discipline of minimally invasive spine surgery, to its subsequent evolution up to the present day. Spondylolisthesis is a frequent condition potentially responsible for a variety of functional impairments. Understanding and surgical management have progressed since the 20th century. Historically, the first descriptions of treatments concerned only spondylolisthesis associated with spondylolysis, especially in young adults. More recently, there has been progress in the understanding of the disease in elderly people, with the recognition of degenerative spondylolisthesis. New technologies and surgical techniques, aided by advances in supportive care, now provide spine surgeons with powerful treatment tools. Better knowledge of the evolution of surgery throughout history should enable better understanding of current approaches and concepts for treating degenerative spondylolisthesis

Solving atomic multicast when groups crash

In this paper, we study the atomic multicast problem, a fundamental abstraction for building faulttolerant systems. In the atomic multicast problem, the system is divided into non-empty and disjoint groups of processes. Multicast messages may be addressed to any subset of groups, each message possibly being multicast to a different subset. Several papers previously studied this problem either in local area networks [3, 9, 20] or wide area networks [13, 21]. However, none of them considered atomic multicast when groups may crash. We present two atomic multicast algorithms that tolerate the crash of groups. The first algorithm tolerates an arbitrary number of failures, is genuine (i.e., to deliver a message m, only addressees of m are involved in the protocol), and uses the perfect failures detector P. We show that among realistic failure detectors, i.e., those that do not predict the future, P is necessary to solve genuine atomic multicast if we do not bound the number of processes that may fail. Thus, P is the weakest realistic failure detector for solving genuine atomic multicast when an arbitrary number of processes may crash. Our second algorithm is non-genuine and less resilient to process failures than the first algorithm but has several advantages: (i) it requires perfect failure detection within groups only, and not across the system, (ii) as we show in the paper it can be modified to rely on unreliable failure detection at the cost of a weaker liveness guarantee, and (iii) it is fast, messages addressed to multiple groups may be delivered within two inter-group message delays only

A Superstabilizing log⁡(n)\log(n)-Approximation Algorithm for Dynamic Steiner Trees

In this paper we design and prove correct a fully dynamic distributed algorithm for maintaining an approximate Steiner tree that connects via a minimum-weight spanning tree a subset of nodes of a network (referred as Steiner members or Steiner group) . Steiner trees are good candidates to efficiently implement communication primitives such as publish/subscribe or multicast, essential building blocks for the new emergent networks (e.g. P2P, sensor or adhoc networks). The cost of the solution returned by our algorithm is at most $\log |S|$ times the cost of an optimal solution, where $S$ is the group of members. Our algorithm improves over existing solutions in several ways. First, it tolerates the dynamism of both the group members and the network. Next, our algorithm is self-stabilizing, that is, it copes with nodes memory corruption. Last but not least, our algorithm is \emph{superstabilizing}. That is, while converging to a correct configuration (i.e., a Steiner tree) after a modification of the network, it keeps offering the Steiner tree service during the stabilization time to all members that have not been affected by this modification

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