Dynamic Load Balancing Applying Water-Filling Approach in Smart Grid Systems
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
To enhance the reliability of the power grid, further processing of the power demand to achieve load balancing is regarded as a critical step in the context of smart grids with Internet of Things technology. In this paper, dynamic offline and online scheduling algorithms are proposed to minimize the power fluctuations by applying a geometric water-filling approach. For the offline approach, full information in the power demand is available, possibly by predicting from the power utilities. We present an exact approach in order to allocate the elastic loads based on the inelastic load's information considering the group-and node-power upper constraints. For the online approach, the reference level is computed dynamically using historical demand data to minimize the fluctuation in the grid, and the elastic loads can only be scheduled in the future time slots. Two dynamic algorithms are investigated to achieve load balancing in the power grid without influencing user experience by real-time reference level adjustment. Facilitated by the proposed methodologies, the power utilities can significantly reduce the cost of improving the power capacity, and the consumers are able to enjoy more stable electrical power.
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.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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