A new adaptive evidential reasoning approach for network alarm correlation
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
In computer networks, fault detection and identification techniques rely substantially on analyzing a set of observed alarms generated by different network entities due to unknown failures. However, network alarms are subject to becoming lost and spurious and their information is often incomplete, ambiguous, and inconsistent. In this paper, an adaptive distributed Dempster-Shafer evidential reasoning technique is proposed to effectively reduce the negative impact of the uncertainty properties which network alarms can exhibit. Each observed alarm is perceived as a piece of evidence and as such, the incomplete and ambiguous properties can be tackled within the framework of the evidential theory. A discounting mechanism by which the observed alarms are assigned certain weights is also presented. A given weight reflects the significance of the information in the corresponding alarm. Then, the alarms are correlated by the Dempster's rule of combination and the inconsistent alarms play a limited role in the alarm correlation process since they are given lower weights. Simulations confirm that the proposed scheme has a high detection rate even in the presence of defective alarms.
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.001 |
| 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