MétaCan
Menu
Back to cohort
Record W1581295754 · doi:10.1109/lcomm.2015.2454502

Centralized Adaptation for Parameter Estimation Over Wireless Sensor Networks

2015· article· en· W1581295754 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

VenueIEEE Communications Letters · 2015
Typearticle
Languageen
FieldEngineering
TopicAdvanced Adaptive Filtering Techniques
Canadian institutionsMcGill University
Fundersnot available
KeywordsFadingComputer scienceFusion centerWireless sensor networkWirelessPath lossNoise (video)Channel state informationAlgorithmWireless networkChannel (broadcasting)Estimation theoryComputer networkReal-time computingTelecommunicationsArtificial intelligenceCognitive radio

Abstract

fetched live from OpenAlex

We study the performance of centralized least mean squares (CLMS) algorithms in wireless sensor networks where nodes transmit their data over fading channels to a central processing unit (e.g., a fusion center or a cluster head) for parameter estimation. Wireless channel impairments, including fading and path loss, distort the transmitted data, cause link failure, and degrade the performance of adaptive solutions. To address this problem, we propose a novel CLMS algorithm that uses a refined version of the transmitted data and benefits from a link failure alarm strategy to discard severely distorted data. Furthermore, to remove the bias due to communication noise from the estimate, we introduce a bias elimination scheme that also leads to a lower steady-state mean square error. Our theoretical findings are supported by numerical simulation results.

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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.534
Threshold uncertainty score0.652

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.0000.000
Research integrity0.0000.000
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.069
GPT teacher head0.299
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