{"id":"W2134905923","doi":"10.1109/icassp.2006.1661062","title":"Optimal Power Allocation for Full-Duplex Cooperative Multiple Access","year":2006,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Quality of service; Computer network; Mathematical optimization; Transmission (telecommunications); Channel (broadcasting); Convex optimization; Key (lock); Power (physics); Pairwise comparison; Regular polygon; Telecommunications; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002038139,0.0001208263,0.0001156748,0.00006248469,0.0003052043,0.000400269,0.001043616,0.00004069125,0.00009098085],"category_scores_gemma":[0.00006028227,0.0001052849,0.00004997635,0.0003395,0.00003456797,0.0008165904,0.0003461368,0.00007147038,0.00003288304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004226352,"about_ca_system_score_gemma":0.00005644354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001811833,"about_ca_topic_score_gemma":0.0002411404,"domain_scores_codex":[0.9991106,0.00006283634,0.0002171395,0.0002889023,0.0001166651,0.0002039025],"domain_scores_gemma":[0.9987832,0.0002220085,0.00006052613,0.0004963479,0.0003936596,0.00004423705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005207542,0.0003493954,0.0007358499,0.00000877283,0.00003610188,0.000001280803,0.0007865762,0.1184596,0.02471827,0.7713211,0.05885635,0.02467466],"study_design_scores_gemma":[0.0006187394,0.00008183878,0.002145594,0.000007827905,0.000002388404,0.000002494381,0.00002282228,0.9503002,0.008152641,0.00008466757,0.03837547,0.0002053014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02953234,0.0001386933,0.9627987,0.002570101,0.0001415088,0.0004055431,0.000002143279,0.0001886397,0.004222312],"genre_scores_gemma":[0.9103879,0.00003031627,0.08691715,0.000569449,0.00005621379,0.000113995,0.00002691591,0.000007876823,0.001890127],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8808556,"threshold_uncertainty_score":0.4293393,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04514966191199819,"score_gpt":0.3116903215743187,"score_spread":0.2665406596623205,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}