Unbalanced power systems resolution including power and frequency regulation
Bibliographic record
Abstract
Power flow analyses constitute an effective tool in determining the steady state solution of power systems. Hence they play a fundamental role in the investigation and design of such systems. The present work revisits a distributed slack bus model, adapts it to the resolution of three-phase (unbalanced) power systems by Newton’s method, and implements it in a computer program. The model takes into consideration economic power transactions between areas of a network, as well as the variation in network frequency resulting from load versus generated power perturbations and ensuing control operations. As an initial investigation, a single slack bus model that assumes a constant frequency is also described and implemented. Various component admittance matrices are derived explicitly. Single-phase components are also implemented in order to facilitate the treatment of unbalanced loads, and to permit the study of systems that comprise both transmission and distribution elements. In addition, the voltages at specified buses can be regulated through the operation of tap changers installed on threephase and single-phase transformers. The implementation code is discussed in detail. High computation speeds could be reached by devising several array-based procedures, among other measures. A number of numerical examples are presented, among which is a large network containing 3000 three-phase buses (9000 nodes). As it should, in every case the imposed conditions are met, and the balance in power is respected at every bus.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 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.006 | 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 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".