A new relaying scheme for protection of transmission lines connected to DFIG‐based wind farms
Bibliographic record
Abstract
Abstract This paper presents a new protection scheme with low communication capacity requirement for protecting lines connected to a doubly‐fed induction generator (DFIG)‐based wind farm (WF). The proposed relaying scheme addresses the line protection challenges which stem from the non‐synchronous frequency component of the current fed from a DFIG‐based WF during a short‐circuit fault. The fault current frequency of a DFIG‐based WF deviates from the synchronous frequency during a fault, which affects the operation of distance relays. In such a scenario, the distance relay located at the WF terminal may lose its coordination with downstream relays, resulting in unnecessary tripping. The proposed scheme relies on the impedance trajectory captured by the local relay, local fault current characteristics, and the frequency tracking of the fault current measured at the distance relays located at the two ends of the transmission line connected to a DFIG‐based WF. The reliable performance of the proposed scheme is verified on a 4‐bus test system under balanced and unbalanced faults during super‐ and sub‐synchronous operating modes of the DFIG as well as its robustness against power system disturbances.
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.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.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".