MétaCan
Menu
Back to cohort

Deep Adaptive Transmission for Internet of Vehicles (IoV)

2020· article· en· W3013355220 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

Venue2020 International Conference on Computing, Networking and Communications (ICNC) · 2020
Typearticle
Languageen
FieldComputer Science
TopicWireless Signal Modulation Classification
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsTransmitterComputer scienceTransmission (telecommunications)FadingChannel (broadcasting)Link adaptationA priori and a posterioriBit error rateData transmissionComputer networkReal-time computingElectronic engineeringTelecommunicationsEngineering

Abstract

fetched live from OpenAlex

To support reliable transmission of data at high rate in time-varying fading channels, adaptive transmission is required, where transmitter and receiver adjust their transmission and reception mode to the dynamics of the channel. The receiver, based on its channel estimation and prediction, decides the optimal link adaptation and feeds this back to the transmitter. In this paper, we develop a deep learning (DL)-based link adaptation algorithm for highly dynamic communication links, where adaptive transmission parameters are decided for l > 1 forward time steps without a priori knowledge on channel statistics. Compared to conventional solutions, our approach reduces the feedback requirements from the receiver to the transmitter by a factor of l which significantly reduces the complexity. This achievement comes at no additional cost on the data rate and/or bit error rate.

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: Methods · Consensus signal: none
Teacher disagreement score0.981
Threshold uncertainty score0.752

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.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.119
GPT teacher head0.305
Teacher spread0.187 · 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