Supplementary Impedance-Based Fault-Location Algorithm for Series-Compensated Lines
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 new impedance-based supplementary fault-location algorithm for series capacitor-compensated transmission lines (SCCTLs), which improves the accuracy of the existing fault-location algorithms. The proposed algorithm utilizes the fact that the metal-oxide varistor (MOV) may become bypassed in faulted or all phases before the interruption of fault for certain fault scenarios. The removal of the nonlinear element, that is, MOV from the fault loop enables the proposed algorithm to provide more accurate fault-location results compared to the most advanced impedance-based technique. Another major advantage of the proposed algorithm is that the dedicated subroutines are not required for the location of a fault in a particular section of the transmission line. The proposed fault-location algorithm is rigorously tested for various fault scenarios in the 500-kV SCCTL simulated in PSCAD. The performance of the proposed algorithm is compared to a well-known existing impedance-based fault-location algorithm for SCCTLs to illustrate higher accuracy and improved sensitivity of the proposed technique.
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.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