Locating Leaks in Water Distribution Systems Using Network Modeling
Bibliographic record
Abstract
Water distribution systems can experience high levels of leakage resulting in major financial, supply and pressure losses.Locating and repairing system leaks can drastically reduce the amount of water that is lost, as well as reduce the costs for obtaining, treating and pressurizing water distribution systems to meet current and future demands.This chapter describes an efficient step-testing network modeling approach that solves the leakage detection problem using a direct application of network modeling and field testing.The technique involves bracketing the test area with excessive leakage into a tight branched network with a flow meter installed on its input main.Working from the valve furthest away from the flow meter, the size of the area is systematically reduced by closing valves to cut off different pipe sections in succession (so that less and less of the test area is supplied through the meter), at the same time recording changes in flow rate at the meter and comparing with model results.The sequence of closing valves is followed working backward towards the flow meter until the meter is reached (when the flow becomes zero).A disproportionate change in flow discrepancy between two successive steps indicates a leak in the section of pipe that was last shut off.The sequence is repeated by opening valves in reverse order.The method can effectively narrow down leaks to specific pipe segments of the distribution system.It is normally carried out at night before the morning high demand to minimize supply interruption and inconvenience to customers.An example application is used to illustrate the
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".