MétaCan
Menu
Back to cohort
Record W2753471900 · doi:10.1109/lwc.2017.2747555

Effective Small Social Community Aware D2D Resource Allocation Underlaying Cellular Networks

2017· article· en· W2753471900 on OpenAlex
Zebing Feng, Zhiyong Feng, T. Aaron Gulliver

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 · 2017
Typearticle
Languageen
FieldEngineering
TopicAdvanced MIMO Systems Optimization
Canadian institutionsUniversity of Victoria
FundersNational Natural Science Foundation of China
KeywordsExploitComputer scienceResource allocationBipartite graphMatching (statistics)Cellular networkResource management (computing)Distributed computingGraphResource (disambiguation)Computer networkComputer securityTheoretical computer scienceMathematics

Abstract

fetched live from OpenAlex

Social-aware device-to-device (D2D) resource allocation utilizes social ties in human-formed social networks to allocate spectrum resources between D2D users and cellular users. In this letter, we consider the small size social communities formed by people with similar interests and exploit them to optimize the resource allocation of the communities. This results in an optimal graph matching problem among communities to solve the D2D resource allocation problem. Solutions are derived via bipartite graph matching and an effective small social community resource allocation algorithm corresponding to the cases of small and high D2D user loads.

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 categoriesMeta-epidemiology (narrow), Science and technology studies
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.802
Threshold uncertainty score1.000

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.0030.000
Scholarly communication0.0000.000
Open science0.0020.000
Research integrity0.0000.001
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.030
GPT teacher head0.255
Teacher spread0.225 · 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