Cable degradation discharge point location method based on transient zero sequence alarm and acoustic environmental data
Bibliographic record
Abstract
By optimizing the automation configuration of medium-voltage distribution lines, capturing the initial signals of cable insulation hidden danger, combining the real case data of 6 years of distribution network insulation faults and hidden danger in a city of Zhejiang, summarizing the waveform law and progressive signal characteristics in the process of insulation hidden danger deterioration, a set of real-time monitoring method based on the analysis of big data of the medium-voltage distribution line cable insulation deterioration of the corona hidden danger has been developed. The method is based on the master station to realize localization, instead of periodic on-site equipment charged detection, has been verified on-site and found discharge traces cable head in advance. This method utilizes distribution automation and dispatch automation configurations to capture the instantaneous zero-sequence overcurrent signals corresponding to insulation degradation discharges, waveform characteristics, acoustic mutations, and environmental information as input. A quantitative risk algorithm consisting of eight analysis dimensions such as zero-sequence spike characteristics, number of spikes, and synchronization of acoustic ripple and spike timing is used. Three optional computational media, including master station, enhanced DTU, and DTU external component, are used to give hidden risk localization. The two methods, local discharge detection robot and manual detection, are used to confirm the site and then carry out out outage maintenance to prevent the further expansion of hidden dangers. The method relies on the distribution automation of existing protection devices and master station configuration to assist a small number of sensors and edge computing devices to realize, through the protection device uninterrupted monitoring instead of manual periodic local discharge detection. It solves the problems of high cost of periodic testing, unavoidable accidents caused by continuous insulation degradation in the interval of testing cycle, hidden location of some cables and blind area of testing, and effectively improves the reliability of power supply.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".