Extreme Learning Machine Based Adaptive Distance Relaying Scheme for Static Synchronous Series Compensator Based Transmission Lines
Bibliographic record
Abstract
This article presents an extreme learning machine based fast and accurate adaptive distance relaying scheme for transmission lines in the presence of a static synchronous series compensator. The ideal trip characteristics of the distance relay is greatly affected by pre-fault system conditions, ground fault resistance, and zero-sequence voltage. The proposed research develops an extreme learning machine based adaptive distance relaying scheme for two-terminal transmission networks with static synchronous series compensators when a single-line-to-ground fault situation is most likely to occur. The study includes an analytical approach, including a steady-state model of static synchronous series compensator with detailed simulation on MATLAB/Simulink (The MathWorks, Natick, Massachusetts, USA) and open real-time simulation software with MATLAB (OPAL-RT) platform (OPAL-RT Technologies, Montreal, Quebec, Canada). The proposed extreme learning machine based adaptive distance relaying scheme is extensively validated on the two terminal transmission lines with static synchronous series compensators, and the performance is compared with the existing radial basis feed-forward neural network based adaptive distance relaying scheme. The results on simulation and real-time platform show significant improvements in the performance indices, such as speed, selectivity, and reliability of the digital relay.
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.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.000 | 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".