Design and implementation of a wavelet analysis‐based shunt fault detection and identification module for transmission lines application
Bibliographic record
Abstract
The power utility companies have been trying to identify and locate three‐phase transmission line faults in the shortest possible time in order to prevent economic losses. In the last few decades, technology used for power system protection has evolved from electromechanical devices to solid state and processor‐based intelligent devices. This study presents the design and implementation of a wavelet analysis‐based fault detection and identification module that contemplates the analysis of high frequency transients produced during faults. The design was implemented on a cost effective low‐end embedded system. The proposed logic employs a multi‐resolution wavelet analysis of high frequency details in the range of 5–10 kHz. The amount of high frequency components present in the transformed current signals, obtained after processing, identifies the fault. The ground and line‐to‐line faults were classified on the basis of the adaptive thresholds obtained from system behaviour. The proposed approach, after the completion of simulations, was implemented on a digital signal controller. The developed fault detection and identification prototype was successful in accurately identifying the power system faults, thus validating the feasibility of the proposed methodology.
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.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.004 | 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, 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".