Bayesian Networks (BNs) are probabilistic, graphical models for representing complex dependency structures. They have many applications in science and engineering. Their particularly powerful variant – Non-Parametric BNs – are for the first time implemented as an open-access scriptable code, in the form of a MATLAB toolbox “BANSHEE”.¹ The software allows for quantifying the BN, validating the underlying assumptions of the model, visualizing the network and its corresponding rank correlation matrix, and finally making inference with a BN based on existing or new evidence. We also include in the toolbox, and discuss in the paper, some applied BN models published in most recent scientific literature.

Water distribution networks (WDNs) are critical to provide safe, clean drinking water around the globe. However, they are susceptible to accidental or deliberate contamination, potentially resulting in poisoned water, many fatalities and large economic consequences. In order to protect against such intrusions, an efficient sensor network should be placed in a WDN. Finding the optimal placement for water quality sensors is a challenging problem. Several sensor placement strategies have been proposed, but the vast majority of these strategies rely on the assumption that the sensors are perfect. In this paper we provide evidence for the imperfection of water quality sensors, by conducting measurements in an operational environment. We investigate the imperfection of four types of water quality sensors being employed in actual WDNs for the purpose of contamination detection. We describe experiments conducted at the WaDi testbed, a realistic water distribution facility at the Singapore University of Technology and Design. Through these experiments we study the imperfection, sensitivity and degradation of the water quality sensors, under normal conditions (water flow without contaminants present) as well as under attack conditions. It is shown that several aspects of sensor imperfection do occur, including missing values, inexplicable jumps and drifting.

Water Distribution Networks (WDNs) are often susceptible to either accidental or deliberate contamination which can lead to poisoned water, many fatalities and large economic consequences. In order to protect against these intrusions or attacks, an efficient sensor network with a limited number of sensors should be placed in a WDN. In this paper, we focus on optimal sensor placements by introducing two greedy-based algorithms in which the imperfection of sensors and multiple objectives can be taken into account. The algorithms were tested using a medium scale urban WDN. It is shown that our algorithms are able to find sensor placements in reasonable time and that its solutions are close to optimal. Furthermore, relaxing the often used assumption that sensors work perfectly results in different sensor placements than were found before, indicating the importance to take sensor imperfection into account when placing sensors.

In this paper we take one of the cutting edge algorithms for computing the all-terminal reliability and the k-terminal reliability of a network and use it to compute the reliability of a real life gas distribution network in the Netherlands. To do this we estimate network properties using industry knowledge and combine several different techniques to make the problem computable. This is the first time known to us that these techniques have been applied to a large, in this case over 20000 nodes, real life network. Besides this, we show the versatility of this pathwidth-based dynamic programming algorithm by suggesting some powerful but simple modifications and argue that this network is representative for other distribution networks.