MétaCan
Menu
Back to cohort
Record W2993963137 · doi:10.1109/lwc.2019.2956702

Joint Placement Design, Admission Control, and Power Allocation for NOMA-Based UAV Systems

2019· article· en· W2993963137 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

VenueIEEE Wireless Communications Letters · 2019
Typearticle
Languageen
FieldEngineering
TopicUAV Applications and Optimization
Canadian institutionsUniversity of British Columbia, Okanagan CampusUniversity of British Columbia
Fundersnot available
KeywordsMathematical optimizationComputer scienceConvexityNomaQuality of serviceAdmission controlOptimization problemPower (physics)Power controlJoint (building)Computational complexity theoryConvex optimizationRegular polygonComputer networkMathematicsAlgorithmTelecommunications linkEngineering

Abstract

fetched live from OpenAlex

In the emerging non-orthogonal multiple access-based unmanned aerial vehicle systems, it is of practical importance to maximize the number of users with satisfied quality-of-service experience by incorporating placement design, admission control, and power allocation. To overcome the combinatorial nature and non-convexity of the above problem, a low-complexity mechanism is proposed based on the penalty function method and the successive convex approximation, and it converges to a Karush-Kuhn-Tucker point of the original problem. Simulations are provided to show the necessity of conducting the above optimization and the efficiency of the proposed mechanism.

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.883
Threshold uncertainty score0.669

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.000
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.019
GPT teacher head0.222
Teacher spread0.203 · 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