Reliability evaluation algorithm for complex medium voltage electrical distribution networks based on the shortest path
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
This paper presents a reliability evaluation algorithm for medium voltage radial electrical distribution networks (EDN). The algorithm is suitable for evaluating reasonably complex EDNs with multiple subfeeders. It applies a forward-search-method to identifying the section controlled by a breaker. By applying graph theory and considering the structural features of the EDNs, methods for searching for the shortest paths from any node to the energy source and between any two nodes are developed. Based on the definitions of feeder terminal node (FTN) and the shortest path from a failure element to FTNs, it is easy to identify a disconnected section, following which a classification of the nodes is obtained. The reliability indices of the buses, feeders and system are calculated, based on the nodal classification. The developed algorithm has been tested on a number of test systems and the results show the effectiveness and applicability of the approach.
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.002 | 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