The Adaptability and Challenges of Protection Relays in Distributed Generation 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
The adaptability of relay protection in distributed generation systems is an important research topic in modern power systems. This paper proposes a relay protection scheme based on random forest algorithm, and uses IoT technology for real-time data collection and processing. By constructing a simulation model of a distributed power generation system, we compared and analyzed the performance of traditional fixed threshold protection schemes and schemes based on random forest algorithm in terms of sensitivity, accuracy, and reliability. The experimental results show that the scheme based on the random forest algorithm reduces the average response time to 0.12 seconds when dealing with faults, and the misoperation rate and rejection rate are reduced to 5% and 3.3%, respectively. In addition, the reliability of the scheme remained above 95% during 30 days of simulated operation. Experimental data shows that the new scheme significantly improves the sensitivity and accuracy of relay protection, and better adapts to the needs of distributed power generation systems.
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.001 | 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