Pipeline Rupture Detection Using Real-Time Transient Modelling and Convolutional Neural Networks
Bibliographic record
Abstract
Demonstrating the ability to reliably detect pipeline ruptures is critical for pipeline operators as they seek to maintain the social license necessary to construct and upgrade their pipeline systems. Current leak detection systems range from very simple mass balances to highly complex models with real-time simulation and advanced statistical processing with the goal of detecting small leaks around 1% of the nominal flow rate. No matter how finely-tuned these systems are, however, they are invariably affected by noise and uncertainties in a pipeline system, resulting in false alarms that reduce system confidence. This study aims to develop a leak detection system that can detect leaks with high reliability by focusing on sudden-onset leaks of various sizes (ruptures), as opposed to slow leaks that develop over time. The expected outcome is that not only will pipeline operators avoid the costs associated with false-alarm shut downs, but more importantly, they will be able to respond faster and more confidently in the event of an actual rupture. To accomplish these goals, leaks of various sizes are simulated using a real-time transient model based on the method of characteristics. A novel leak detection model is presented that fuses together several different preprocessing techniques, including convolution neural networks. This leak detection system is expected to increase operator confidence in leak alarms, when they occur, and therefore decrease the amount of time between leak detection and pipeline shutdown.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".