MétaCan
Menu
Back to cohort

Cross Entropy Optimization for Constrained Green Cooperative Cognitive Radio Network

2014· article· en· W2054925885 on OpenAlexaff
Muhammad Naeem, Ahmed Shaharyar Khwaja, Alagan Anpalagan, Muhammad Jaseemuddin

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsRelayCognitive radioOptimization problemMathematical optimizationCross-entropy methodComputer scienceConvex optimizationEntropy (arrow of time)Upper and lower boundsRegular polygonPower (physics)WirelessQuadratic assignment problemMathematicsTelecommunications

Abstract

fetched live from OpenAlex

In this paper, we apply the cross entropy optimization (CEO) to the problem of joint multiple relay assignment and source/relay power allocation (JMRAPA) in green cooperative cognitive radio (GCCR) networks. We use shared-band amplify and forward relaying for cooperative communication in the JMRAPA problem. The proposed JMRAPA maximizes the total rate and minimizes the greenhouse gas emissions in GCCR networks. It is a non-convex combinatorial optimization problem and is NP-hard. We propose to use concave upper bound that makes it a convex problem. The effectiveness of the proposed CEO-based method is shown through simulation results.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation 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.002
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.029
GPT teacher head0.292
Teacher spread0.263 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Citations2
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207