MétaCan
Menu
Back to cohort
Record W1511703720

Denoising network tomography estimations

2010· article· en· W1511703720 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueInternational Conference on Data Communication Networking · 2010
Typearticle
Languageen
FieldEngineering
TopicSparse and Compressive Sensing Techniques
Canadian institutionsDalhousie University
Fundersnot available
KeywordsNetwork tomographyNoise reductionComputer scienceTomographyArtificial intelligenceTransformation (genetics)AlgorithmPattern recognition (psychology)
DOInot available

Abstract

fetched live from OpenAlex

In this paper, we apply the technique of sparse shrinkage coding (SCS) to denoise the network tomography model with errors. SCS is used in the field of image recognition for denoising of the image data and we are the first one to apply this technique for estimating error free link delays from erroneous link delay data. To make SCS properly adoptable in network tomography, we have made some changes in the SCS technique such as the use of Non Negative Matrix Factorization (NNMF) instead of ICA for the purpose of estimating sparsifying transformation. Our technique does not need the knowledge of the routing matrix which is assumed known in conventional tomography. The estimated error free link delays are compared with the original error free link delays based on the data obtained from a laboratory test bed. The simulation results reveal that denoising of the tomography data has been carried out successfully by applying SCS.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.916
Threshold uncertainty score0.651

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0020.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.092
GPT teacher head0.321
Teacher spread0.229 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it