Smart meter deployment optimisation and its analysis for appliance load monitoring
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
In this study, the authors study the problem of smart meter deployment optimisation for appliance load monitoring, that is, to monitor a number of devices without any ambiguity using the minimum number of low‐cost smart meters. The importance of this problem is due to the fact that the number of meters should be reduced to decrease the deployment cost, improve reliability and decrease congestion. In this way, in future, smart meters can provide additional information about the type and number of distinct devices connected, besides their normal functionalities concerned with providing overall energy measurements and their communication. The authors present two exact smart meter deployment optimisation algorithms, one based on exhaustive search and the other based on efficient implementation of the exhaustive search. They formulate the problem mathematically and present computational complexity analysis of their algorithms. Simulation scenarios show that for a typical number of home appliances, the efficient search method is significantly faster compared to the exhaustive search and can provide the same optimal solution. The authors also show the dependency of their method on the distribution of the load pattern that can potentially be in a typical household.
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.001 | 0.000 |
| 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.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