An unconditionally stable semi-analytical Lagrangian stream temperature model
Bibliographic record
Abstract
Stream temperature is a critical ecosystem indicator and plays an important role in river ice formation and breakup. Typically, stream temperature is simulated either using statistical models or discrete Eulerian energy balance models. These physically-based models often rely upon a grid-based finite difference or finite volume approach for simulating the advection-dominated in-stream energy balance. Such methods are conditionally stable and thus introduce constraints upon time and space step (e.g., Courant and Peclet constraints). They are also not conceptually consistent with commonly applied convolution-based hydrologic routing approaches, which don’t require reach discretization. Here, a novel semi-analytical technique for simulating advection, latent and sensible heat transfer, heat generation from friction, and hyporheic exchange with groundwater is introduced. It assumes a discrete convolution (i.e., transfer function or unit hydrograph) method is used for routing flows through the reach. The energy balance is applied to discrete parcels of water that travel along the reach exchanging energy with their surroundings; the parcel-based energy balance is solved exactly. The method is unconditionally stable, runs at the native time step of the hydrological model, and requires no spatial discretization. It can also easily simulate edge cases that are exceedingly difficult using discrete methods, such as a near-infinite convective exchange coefficient. The only approximation errors are associated with the model time step used to represent the inflow time series, the linearization of the Stefan-Boltzmann equation for longwave radiation flux, and the full mixing assumed at nodes of the stream network. The stream temperature model, as implemented within the Raven hydrological modelling framework, is demonstrated at several test catchments in the North American Rocky Mountains.
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.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 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".