Multivariate Reservoir Inflow Forecasting Using Temporal Neural Networks
Bibliographic record
Abstract
An experiment on predicting multivariate water resource time series, specifically the prediction of hydropower reservoir inflow using temporal neural networks, is presented. This paper focuses on dynamic neural networks to address the temporal relationships of the hydrological series. Three types of temporal neural network architectures with different inherent representations of temporal information are investigated. An input delayed neural network (IDNN) and a recurrent neural network (RNN) with and without input time delays are proposed for multivariate reservoir inflow forecasting. The forecast results indicate that, overall, the RNN obtained the best performance. The results also suggest that the use of input time delays significantly improves the conventional multilayer perceptron (MLP) network but does not provide any improvement in the RNN model. However, the RNN with input time delays remains slightly more effective for multivariate reservoir inflow prediction than the IDNN model. Moreover, it is found that the conventional MLP network widely used in hydrological applications is less effective at multivariate reservoir inflow forecasting than the proposed models. Furthermore, the experiment shows that employing only time-delayed recurrences can be the more effective and less costly method for multivariate water resources time series prediction.
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.004 |
| 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.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".