MétaCan
Menu
Back to cohort
Record W2134905923 · doi:10.1109/icassp.2006.1661062

Optimal Power Allocation for Full-Duplex Cooperative Multiple Access

2006· article· en· W2134905923 on OpenAlexaff
Wessam Mesbah, Timothy N. Davidson

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsMcMaster University
Fundersnot available
KeywordsComputer scienceQuality of serviceComputer networkMathematical optimizationTransmission (telecommunications)Channel (broadcasting)Convex optimizationKey (lock)Power (physics)Pairwise comparisonRegular polygonTelecommunicationsMathematics

Abstract

fetched live from OpenAlex

Multiple access schemes in which the transmitting nodes are allowed to cooperate have the potential to provide higher quality of service than conventional schemes. In the class of pairwise cooperative multiple access schemes in which channel state information is available at the transmitters, the allocation of transmission power plays a key role in the realization of these quality of service gains. Unfortunately, the natural formulation of the power allocation problem for full-duplex cooperative schemes is not convex, but it is shown herein that this non-convex formulation can be simplified and re-cast in a convex form. In fact, in most scenarios a closed form expression for the optimal power allocation for each point on the boundary of an achievable rate region can be obtained

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.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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.881
Threshold uncertainty score0.429

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.0010.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.045
GPT teacher head0.312
Teacher spread0.267 · 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.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
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

Citations7
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207