An Explicit Conduit Storage Synthesis Algorithm for Solving Decoupled Forcemain Networks
Bibliographic record
Abstract
A typical collection system may include many gravity mains connected by pump stations pushing flow into a complex network of pressurized conduits or forcemains (ASCE, 1982).The EPA standard SWMM5 engine solves this complex case, but it can be very expensive and time consuming.In most forcemain networks, the solution time improves significantly by separating or "decoupling" the gravity network from the force main network.Decoupling can improve computational speed three to five times.Larger networks have much larger increases in solution time speed for the decoupled network, up to twenty times faster.Results for the decoupled model may differ from the original model.In particular, wet-well levels in the gravity network influence the pump operations for the forcemain network.Ignoring the storage available in gravity conduits can lead to oversized pump designs, because the overall storage volume is much larger than the volume available in the wet-well alone.This chapter develops a rigorous dynamic conduit storage synthesizer approach that estimates the conduit volume available for storage and applies it to the wet-well depth-area curve to reduce the impact of decoupling the model on pumping simulations.We discuss the new method and apply it to a decoupled system with and without synthesized storage.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.007 | 0.001 |
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".