Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userContamination source inference in water distribution networks
69
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We study the inference of the origin and the pattern of contamination in water distribution networks. We assume a simplified model for the dyanmics of the contamination spread inside a water distribution network, and assume that at some random location a sensor detects the presence of contaminants. We transform the source location problem into an optimization problem by considering discrete times and a binary contaminated/not contaminated state for the nodes of the network. The resulting problem is solved by Mixed Integer Linear Programming. We test our results on random networks as well as in the Modena city network.
rate research
Read More
We present a Bayesian approach for the Contamination Source Detection problem in Water Distribution Networks. Given an observation of contaminants in one or more nodes in the network, we try to give probable explanation for it assuming that contamination is a rare event. We introduce extra variables to characterize the place and pattern of the first contamination event. Then we write down the posterior distribution for these extra variables given the observation obtained by the sensors. Our method relies on Belief Propagation for the evaluation of the marginals of this posterior distribution and the determination of the most likely origin. The method is implemented on a simplified binary forward-in-time dynamics. Simulations on data coming from the realistic simulation software EPANET on two networks show that the simplified model is nevertheless flexible enough to capture crucial information about contaminant sources.
Water distribution networks (WDNs) expand their service areas over time. These growth dynamics are poorly understood. One facet of WDNs is that they have loops in general, and closing loops may be a functionally important process for enhancing their robustness and efficiency. We propose a growth model for WDNs which generates networks with loops and is applicable to networks with multiple water sources. We apply the proposed model to four empirical WDNs to show that it produces networks whose structure is similar to that of the empirical WDNs. The comparison between the empirical and modeled WDNs suggests that the empirical WDNs realize a reasonable balance between cost, efficiency, and robustness. We also study the design of pipe diameters based on a biological positive feedback mechanism. Specifically, we apply a model inspired by Physarum polycephalum to find moderate positive correlations between the empirical and modeled pipe diameters. This result suggests that the distribution of pipe diameters in the empirical WDNs is closer to an optimal one than a uniformly random distribution. However, the difference between the empirical and modeled pipe diameters suggests that we may be able to improve the performance of WDNs by following organizing principles of biological flow networks.
We report the observation of upstream transport of floating particles when clear water is poured on the surface of a flat water surface on which mate or chalk particles are sprinkled. As a result, particles originally located only at the surface of the lower container can contaminate the upper water source by riding on vorticial water currents. We speculate that Marangoni forces in combination with geometry-induced vortices may explain the observed phenomenon.
This paper explores a variety of strategies for understanding the formation, structure, efficiency and vulnerability of water distribution networks. Water supply systems are studied as spatially organized networks for which the practical applications of abstract evaluation methods are critically evaluated. Empirical data from benchmark networks are used to study the interplay between network structure and operational efficiency, reliability and robustness. Structural measurements are undertaken to quantify properties such as redundancy and optimal-connectivity, herein proposed as constraints in network design optimization problems. The role of the supply-demand structure towards system efficiency is studied and an assessment of the vulnerability to failures based on the disconnection of nodes from the source(s) is undertaken. The absence of conventional degree-based hubs (observed through uncorrelated non-heterogeneous sparse topologies) prompts an alternative approach to studying structural vulnerability based on the identification of network cut-sets and optimal connectivity invariants. A discussion on the scope, limitations and possible future directions of this research is provided.
The structure and design of optimal supply networks is an important topic in complex networks research. A fundamental trait of natural and man-made networks is the emergence of loops and the trade-off governing their formation: adding redundant edges to supply networks is costly, yet beneficial for resilience. Loops typically form when costs for new edges are small or inputs uncertain. Here, we shed further light on the transition to loop formation. We demonstrate that loops emerge discontinuously when decreasing the costs for new edges for both an edge-damage model and a fluctuating sink model. Mathematically, new loops are shown to form through a saddle-node bifurcation. Our analysis allows to heuristically predict the location and cost where the first loop emerges. Finally, we unveil an intimate relationship among betweenness measures and optimal tree networks. Our results can be used to understand the evolution of loop formation in real-world biological networks.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
