Linear Current Flow Equations With Application to Distribution Systems Reconfiguration
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
Conventionally, power flow equations are used for distribution systems (DS) analysis to find the nodal voltages. For the particular form of the DS reconfiguration problem, however, a direct formulation in terms of branch flows allows a substantial increase in solution efficiency from an optimization point of view. In this paper, a set of linear current flow (LCF) equations are derived for DS. This formulation is then used within the network reconfiguration problem for loss minimization. A mixed-integer quadratically constrained programming (MIQCP) formulation, together with a mixed-integer linear programming (MILP) formulation, are proposed in this paper and assessed through simulations. In these comparisons, the MILP formulation shows computational advantages over the MIQCP version and the preceding literature. The proposed methods are evaluated on several test systems.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| 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.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 it