MétaCan
Menu
Back to cohort

Resource Allocation via Linear Programming for Fractional Cooperation

2012· article· en· W2104242807 on OpenAlexaff
Nariman Farsad, Andrew W. Eckford

Bibliographic record

VenueIEEE Transactions on Wireless Communications · 2012
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsYork University
Fundersnot available
KeywordsComputer scienceRelayMathematical optimizationResource allocationLinear programmingOptimization problemDemodulationLow-density parity-check codeDecoding methodsComputer networkTelecommunicationsAlgorithmMathematicsChannel (broadcasting)

Abstract

fetched live from OpenAlex

In this letter, resource allocation is considered for large multi-source, multi-relay networks employing fractional cooperation, in which each potential relay only allocates a fraction of its resources to relaying. Using a Gaussian approximation, it is shown that the optimization can be posed as a linear program, where the relays use a demodulate-and-forward (DemF) strategy, and where the transmissions are protected by low-density parity-check (LDPC) codes. This is useful since existing optimization schemes for this problem are nonconvex.

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 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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScience and technology studies
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.880
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0020.000
Scholarly communication0.0000.001
Open science0.0020.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.061
GPT teacher head0.315
Teacher spread0.255 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designOther design
Domainnot available
GenreMethods

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

Quick stats

Citations4
Published2012
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Wireless CommunicationsSame topicCooperative Communication and Network CodingFrench-language works237,207