On Channel Reuse for Cloud Network Users
Bibliographic record
Abstract
This paper deals with channel assignment for cloud network users based on the information from application layer. We assume a multiple user network where the services requested by the users are categorized into real-time (RT) and delay- tolerant (DT) services. We assign each wireless channel to a user who needs RT service. Inspired by the cognitive networks, we aim to assign the same channel to a second user who needs DT service, while minimizing the interference. Our objective is to simultaneously perform these assignments such that the SNR value of the worst user is maximized. This assignment significantly outperforms the separate assignment of the channels to RT users and then, to DT users. The resulting assignment problem turns out to be NP- hard. We propose a very simple, yet effective algorithm to solve this problem. In the second part of the paper, we will prove that the results of our suggested solution stay in a specific neighborhood of the optimal answer. In order to prove this fact, we statistically analyze the optimal solution, where we derive a general framework to express the statistical behavior of the optimal solution. Then we prove that both optimal solution and our solution achieve the same physical channel diversity.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".