Searcharxiv⌕ Search

arXiv subjects

Lina Sela Perelman

Publications and source records attributed to Lina Sela Perelman.

2 recordsLinked to original sources

Generalized network recovery based on topology and optimization for real-world systems

Designing effective recovery strategies for damaged networked systems is critical to the resilience of built, human and natural systems. However, progress has been limited by the inability to bring together distinct philosophies, such as complex network topology through centrality measures and network flow optimization through entropy measures. Network centrality-based metrics are relatively more intuitive and computationally efficient while optimization-based approaches are more amenable to dynamic adjustments. Here we show, with case studies in real-world transportation systems, that the two distinct network philosophies can be blended to form a hybrid recovery strategy that is more effective than either, with the relative performance depending on aggregate network attributes. Direct applications include disaster management and climate adaptation sciences, where recovery of lifeline networks can save lives and economies.

physics.soc-ph↗

Sensor placement for fault location identification in water networks: A minimum test cover approach

This paper focuses on the optimal sensor placement problem for the identification of pipe failure locations in large-scale urban water systems. The problem involves selecting the minimum number of sensors such that every pipe failure can be uniquely localized. This problem can be viewed as a minimum test cover (MTC) problem, which is NP-hard. We consider two approaches to obtain approximate solutions to this problem. In the first approach, we transform the MTC problem to a minimum set cover (MSC) problem and use the greedy algorithm that exploits the submodularity property of the MSC problem to compute the solution to the MTC problem. In the second approach, we develop a new \textit{augmented greedy} algorithm for solving the MTC problem. This approach does not require the transformation of the MTC to MSC. Our augmented greedy algorithm provides in a significant computational improvement while guaranteeing the same approximation ratio as the first approach. We propose several metrics to evaluate the performance of the sensor placement designs. Finally, we present detailed computational experiments for a number of real water distribution networks.

eess.SY↗