MétaCan
Menu
Back to cohort
Record W2896435355 · doi:10.1002/cpe.5021

Real‐time multiuser scheduling based on end‐user requirement using big data analytics

2018· article· en· W2896435355 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueConcurrency and Computation Practice and Experience · 2018
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Network Optimization
Canadian institutionsUniversité du Québec à Chicoutimi
FundersNational Natural Science Foundation of China
KeywordsComputer scienceMaximum throughput schedulingScheduling (production processes)Quality of serviceComputer networkWireless networkWirelessThroughputFadingDistributed computingChannel (broadcasting)Round-robin schedulingFair-share schedulingTelecommunicationsEngineering

Abstract

fetched live from OpenAlex

Summary With the rapid growth in wireless data networks and increasing demand for multimedia applications, the next generation of wireless networks should be able to provide services for heterogeneous traffic with diverse quality of service (QoS) requirements. Multiuser diversity refers to a type of diversity present across different users in a fading environment. This diversity can be exploited by scheduling transmissions so that users transmit when their channel conditions are favorable. Hence, scheduling algorithms that support QoS and maintain a required throughput to ensure users' satisfaction are crucial to the development of these wireless networks. In this paper, different scheduling techniques have been evaluated using OFDM with different scenarios. The goal is to analyze the properties of networks such as throughput, fairness, and delay. Experimental results indicate that the PFS approach outperforms the other techniques in terms of fairness, throughput, and 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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.778
Threshold uncertainty score0.605

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.084
GPT teacher head0.347
Teacher spread0.264 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it