A scheduling scheme for multiplexing of VBR sources in digital TV 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
Digital TV transmission systems allow a transmission channel to be shared by a number of sources. In order to improve the bandwidth utilization, variable bit rate encoding and statistical multiplexing techniques are usually used. However, the channel sharing requires a careful scheduling method for multiplexing. This is because the video and audio materials have to be presented at the receivers at specific points in time. In this paper, we present a novel scheduling scheme for statistical multiplexing of VBR sources. Our method is sensitive to the timing requirements of the sources and sends the packets as close to their transmission deadlines as possible. The advantages of our method are: (1) it decreases the broadcast deadline violation probability (or improves the bandwidth utilization), (2) it minimizes the delay and delay jitter of packets and (3) it generates a transport stream compliant with all the standard TV receivers. Simulations were conducted to compare our algorithm with the first-come-first-serve scheduling method. The results show that our algorithm significantly reduces both the percentage of dropped packets (by 35%-50%) and the average packet delay.
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