A channel-based mobile-assisted fairly-shared packet scheduling scheme for nonreal-time applications in CDMA networks
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
In this paper, we propose a fair packet scheduling scheme called CB+MA+FS for nonreal-time applications in a cellular CDMA network. Our research is motivated by the need to provide increased throughput in downlinks of a cellular CDMA system while ensuring fairness to users in terms of delivered throughput over time. The following packet scheduling schemes are investigated in this paper: channel based only (CBO), channel based and proportional fairness (CB+PF), and the proposed channel-based mobile-assisted and fairly-shared (CB+MA+FS). An indicator is used to decide the packets to be scheduled in each slot based on realtime channel conditions, required E/sub b//I/sub 0/, required average rate and achieved average rate. For each user, base station computes this indicator and ranks all users based on this indicator. Then, a certain percentage of users is scheduled based on the current link states and achieved average throughput.
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.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| 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