NEW FAULT LOCATION ALGORITHMS FOR TRANSMISSION LINES IN INTERCONNECTED POWER SYSTEMS
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 novel algorithms for fault location in single-circuit and double-circuit transmission lines in any general n-bus interconnected power system. The algorithms use the data available at one end of the faulted line. The effects of fault resistance, remote infeed, and pre-fault load flow are fully taken into consideration in the proposed algorithms. The novelty of these algorithms is in accounting for the system's interconnectivity by using a two-bus Thevenin equivalent network instead of the simplified two-equivalent-source model usually employed in fault location studies. The algorithms have been tested on an 11-bus interconnected power system for various fault conditions, using transient data obtained from PSCAD/EMTDC simulations. The results indicate the ability of the algorithms to compute fault location with high accuracy.
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.001 | 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