Operational Interval Extraction Based on Long‐Short Term Memory Networks for Building More Feasible Reservoir Operation Models
Bibliographic record
Abstract
Abstract Advances in data analytics create an opportunity to enhance reservoir operation. A challenge arising is how to utilize operational data to form realistic constraints of the reservoir operation practice. To address this issue, a novel approach is proposed to extract operational intervals of reservoir outflow by a deep learning method, namely the physics‐guided long‐short term memory network. The knowledge‐informed reservoir operation (KIRO) model was built by adding derived operational intervals of outflow as constraints for the traditional reservoir operation (TRO) model. KIRO couples (a) an optimization model to search for optimal operation schemes, and (b) operational intervals of reservoir operators' decisions based on realistic factors. China's Qingjiang cascade reservoir including Shuibuya, Geheyan, and Gaobazhou reservoirs is used as a case study. Results show that KIRO can yield more physically feasible operation schemes than TRO due to its additional constraints. Specifically, KIRO avoids excessive reservoir water level fluctuations and outflow variations compared with TRO. Moreover, the extracted operational interval can help uncover implicit demands of real‐world operation, for example, the KIRO model accurately identified the cascade reservoir unit maintenance events from 31 January 2019, to 31 March 2019, and the operation schemes were aligned more closely with the power demands. This study provides a new method for building more feasible reservoir operation models based on deep learning.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 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.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".