Efficient practical method for differential protection of power transformer in the presence of the fault current limiters
Bibliographic record
Abstract
Abstract The algorithms of the present generation of practical differential relays are based on two methods. The first method is based on the ratio of the harmonic content of the differential current, and the second one is based on the length of the time interval between the zero‐crossing points of the differential current, called the gap‐detection method. However, these methods suffer from the installation of the fault current limiters (FCLs) in the power system and current transformer (CT) saturation phenomenon. This paper deals with a simple practical method for differential relays to secure their performance. In the suggested method, a classifying algorithm is used to categorize the input signal of the relay and then the best method of the present generation of differential relays is employed. By this simple decision, the method takes the advantage of harmonic‐based and gap‐detection methods, while avoiding their drawbacks. To prove the robustness of the suggested method, a test bench with a resistive solid‐state fault current limiter (SSFCL) is implemented and examined in different situations. The results validate the consistency and the accuracy of the modified technique not only in the absence and the presence of the FCL but in the case of CT saturation.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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".