Dual-Side Scheduling for Radar Resource Management
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
A radar task scheduling method, dual-side scheduling (DSS), is proposed in this paper. In this method, the radar tasks are firstly received as an original sequence, then the time window for the task execution is separated into two sides. All the tasks at each side are shifting toward a separator, connected each other head-to-tail without dwell overlaps. The separator is placed at one of pre-set locations, and the random shifted start time (RSST) technique is applied in order to finalize the scheduling: the start time of each task is randomly shifted in its schedulable interval, then the DSS is respectively conducted at each separator. The RSST process is repeated many times, and the resulting schedule with the minimal cost among all attempts is the final solution. Over a broad range of task loading rate, the proposed method shows 1.5 to 6.2 times less costly than the earliest start time (EST), which is a widely used one-side scheduling method. A full cycle of DSS takes a few tens of milliseconds, short enough for real radar applications.
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.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