Optimal Downlink Data Transmission Scheduling in Next Generation Wireless Systems.
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
The scheduling of data transmission from base station to mobiles, in wireless CDMA based systems, is formulated as an optimal control problem under a quadratic objective. Minimum tune transmission requires a scheduling scheme whereby attention is devoted to a single mobile at a time, and maximum available power is used when transmitting. However, amongst the infinitely many candidate time minimizing schedules, some are deemed fairer or better in some sense than others. We show how quadratic type objectives are flexible enough to skew the controls in the desired direction, and furthermore, we establish that the solution to the resulting optimal control problem (quadratic objective, linear in the dynamics with nonlinear state constraints) can be approached via a standard linear quadratic regulator framework. Scalability of the proposed algorithms is achieved for large numbers of users through an exact aggregation theory
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.000 | 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