Early fault detection in cable television networks (the case of the reverse pilot)
Bibliographic record
Abstract
In this work, we present a model based method for reliably detecting reverse pilot faults within cable amplifier networks. This method has the advantage over traditional fixed bound fault detection techniques in that it is able to compensate for changes in the environmental conditions and, hence, reduce the occurrence of false alarms. Cable television distribution networks are used to distribute cable signals from a centrally located injection site (head-end), to subscribers' homes. Typically cable amplifier plants are two way asymmetrical communication networks. The downstream path, from the head-end to the subscribers' homes, is used mainly for delivering cable television services. Traditionally, the upstream path has been used to transmit the status data from the trunk amplifiers to the head-end. More recently it is used to provide a data path from the subscribers to the head-end for use in interactive services. Hence the ability to detect the occurrence of faults in the reverse path is quite important. We have implemented a general approach based on using a back propagation neural network to model the dynamics of the reverse pilot of cable television amplifiers. This technique was able to provide good temporal localization of the start of fault conditions and a clear indication of the presence of the fault through its occurrence.
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.004 |
| 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.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| 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".