Stochastic Energy Simulation for Risk Analysis of Energy Retrofits
Bibliographic record
Abstract
Building energy modeling is a common procedure for the analysis of energy efficiency retrofits. Smaller retrofits of isolated systems, such as equipment motors and lighting systems, can often be made without the need for complete energy modeling; however, when the retrofit affects multiple systems, such as those involving the building envelope or the heating or cooling system, or when the retrofits of motors and lighting systems are so significant that they affect the heating and cooling load of the building, a more complete energy analysis is necessary. Because the exact inputs to building energy models are never known, and some inputs to the model are stochastic in nature (e.g., occupancy, plug-loads, lighting loads, weather), deterministic prediction of energy use is not only invariably inaccurate, it is actually inappropriate. When simple deterministic energy savings without uncertainty are used in economic analyses (e.g., return on investment), it is difficult to analyze the risk/benefit of the retrofit investment with true accuracy. A stochastic simulation, which includes the effects of input uncertainty and stochastic inputs, is a more appropriate way to predict the building energy use. In this paper, we present a method for stochastic energy simulation that propagates probability characterizations of the input values through a computational engine to create probable energy use predictions. When this probable energy use is combined with forecasts of energy and construction costs, a probable estimate of return on energy efficiency measure investment is generated, and an economic risk/benefit analysis of the investment can be made. Such information is especially important to the growing energy service company market. The computational engine is based on the CEN/ISO monthly building energy calculation standards so its accuracy is well researched and validated, and the computational simplicity allows for efficient stochastic analysis.
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.003 | 0.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.003 |
| 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".