An influent generator for WRRF design and operation based on a recurrent neural network with multi-objective optimization using a genetic algorithm
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Nowadays, modelling, automation and control are widely used for Water Resource Recovery Facilities (WRRF) upgrading and optimization. Influent generator (IG) models are used to provide relevant input time series for dynamic WRRF simulations used in these applications. Current IG models found in literature are calibrated on the basis of a single performance criterion, such as the mean percentage error or the root mean square error. This results in the IG being adequate on average but with a lack of representativeness of, for instance, the observed temporal variability of the dataset. However, adequately capturing influent variability may be important for certain types of WRRF optimization, e.g., reaction to peak loads, control system performance evaluation, etc. Therefore, in this study, a data-driven IG model is developed based on the long short-term memory (LSTM) recurrent neural network and is optimized by a multi-objective genetic algorithm for both mean percentage error and variability. Hence, the influent generator model is able to generate a time series with a probability distribution that better represents reality, thus giving a better influent description for WRRF design and operation. To further increase the variability of the generated time series and in this way approximate the true variability better, the model is extended with a random walk process.
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.
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.001 |
| Science and technology studies | 0.001 | 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 it