MétaCan
Menu
Back to cohort
Record W2097277121 · doi:10.1109/cdc.2005.1582659

Structural Results on the Optimal Transmission Scheduling Policies and Costs for Correlated Sources and Channels

2006· article· en· W2097277121 on OpenAlexaff
D.V. Djonin, Vallidevi Krishnamurthy

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Network Optimization
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsMarkov decision processComputer scienceMathematical optimizationScheduling (production processes)Transmission (telecommunications)ConvexityChannel (broadcasting)Markov processMarkov chainWirelessMonotonic functionComputer networkMathematicsTelecommunications

Abstract

fetched live from OpenAlex

The problem of transmission adaptation over a correlated time-varying wireless channel is formulated as a Constrained Markov Decision Process. The model includes a transmission buffer and finite state Markov model for time-varying radio channel and incoming traffic. This crosslayer optimization problem is formulated as to minimize the transmission cost (e.g. power or bit-error-rate) under the constraint on a buffer cost such as the transmission delay. Under the assumptions on submodularity and convexity of the cost function it is shown that the optimal randomized policy is monotonically increasing with the increase of the buffer state.

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 imitation

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

metaresearch head score (Codex)0.004
metaresearch head score (Gemma)0.020
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.010
Threshold uncertainty score0.035

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.020
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.002
Science and technology studies0.0010.002
Scholarly communication0.0030.005
Open science0.0030.002
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0100.001

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.009
GPT teacher head0.211
Teacher spread0.203 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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

Quick stats

Citations15
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Wireless Network OptimizationFrench-language works237,207