Applications of Distance Protection Schemes for a Forked Inter-Tie between Industrial Cogeneration and a Large Utility: Tips, Tricks and Traps
Bibliographic record
Abstract
This paper describes an experience with the application of distance protective relaying schemes, where a cogeneration facility is added to an existing industrial plant. The single contingency inter-tie between the industrial plant and a third party utility is modified to allow bi-directional power flow and isolation (islanding) if required. Within the industrial complex boundary, state-of the-art, modern, multi-stage, numerical distance relays are utilized to provide a fast, reliable and stable protection scheme for the plant's short, high voltage transmission line. There are two competing objectives that the Industrial Engineer must balance for the integrated system to function properly. On one hand, the integrated protection system must be fast enough, under fault conditions near the co- generation facilities, to isolate and protect the equipment and avoid generator instability. On the other hand, the protection system must be stable and secure to prevent nuisance tripping and to insure islanding for continued plant operation post event. The protection scheme is further complicated by the forked inter- tie arrangement. Selection, setting and coordination between the plant and utility protection scheme provide for an interesting case study from an industrial protection engineering point of view. The challenge is in studying, adapting, coordinating, setting and de-bugging the integrated protection scheme for both sides of the inter-tie. It requires cooperation of the utility and must fulfill both safety and operation requirements.
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
Direct model labels (unvalidated)
Per-model category and study-design labels from the labeling rounds. They are machine output, unvalidated, and the disagreement between models ships as data. No study design here is MEDLINE-validated yet.
| Model arm | Categories | Study design | Confidence |
|---|---|---|---|
| gemma | no category Domain: not available · Genre: Empirical About the Canadian research system: no · About a Canadian topic: no | Not applicable | low |
| gpt | no category Domain: not available · Genre: Methods About the Canadian research system: no · About a Canadian topic: no | Other design | low |
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| 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, unvalidatedLabeled directly by 2 models reading the full record.
The models disagree on parts of this classification; every voice is preserved in the section at the end of the page.
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".