Bibliographic record
Abstract
Power of constant impedance load is proportional to the square of bus voltage magnitude (SBVM). A solution space for a set of power balance equations (PBEs), constructed using SBVMs, has lower‐order terms and less non‐linearity. Such solution space yields faster solution. This work proposes a set of rectangular PBEs which uses SBVMs in conjunction with bus phase angles to relate branches power flow, a pair of real and reactive power equations for each branch for sending/receiving ends. Using an incidence matrix, branches power flows are related to bus powers with two set of equations for real and reactive powers. Another set of equations to relate rectangular form of voltages at generators to their voltage magnitudes, the total number of equations equals four times branches number, and two times buses number, less the two for unknown powers of slack bus. While the equations number is more than the node‐based PBEs, order of Jacobian's terms is significantly lower. Testing the proposed algorithm on numerous case studies, up to a 9241‐bus real system, showing the algorithm is precise, has superior convergence features, scales well for real systems and is up to thrice as fast as the rectangular node‐based load flow for some cases.
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.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.021 | 0.003 |
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".