A Novel Data-Energy Management Algorithm for Smart Transformers to Optimize the Total Load Demand in Smart Homes
Bibliographic record
Abstract
The increased integration of Electric Vehicles (EVs) into the distribution network can create severe issues—especially when demand response programs and time-varying electricity prices are applied, EVs tend to charge during the off-peak time to minimize the electricity cost. Hence, another peak demand might be created, and other solutions are required. Many researchers tried to solve the problem; however, limitations exist because of the decentralized topology of the network. The system operator is not allowed to control the end-users’ load due to security and privacy issues. To overcome this situation, we propose a novel data-energy management algorithm on the transformer’s level that controls the power demand profiles of the householders and exchange energy between them without violating their privacy and security. Our method is compared to an existing one in the literature based on a decentralized control strategy. Simulations show that our approach has reduced the electricity cost of the end-users by 3%, increased the revenue of the system operator, and reduced techno-economic losses by 50% and 42%, respectively. Our strategy shows better performance even with a 100% penetration level of EVs on the network, in which it respects the network’s constraints and maintains the voltage within the recommended limits.
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.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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 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".