{"id":"W2143849964","doi":"10.1109/twc.2013.13.120151","title":"Optimal-Switching Adaptive Modulation for Multiuser Relay Networks with Feedback Delays","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Relay; Nakagami distribution; Computer science; Link adaptation; Spectral efficiency; Fading; Quadrature amplitude modulation; Bit error rate; Control theory (sociology); Topology (electrical circuits); Cumulative distribution function; Upper and lower bounds; QAM; Channel state information; Mathematics; Channel (broadcasting); Probability density function; Telecommunications; Power (physics); Wireless; Statistics; Physics","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":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0002835158,0.0002940576,0.0002677538,0.0002093539,0.001662592,0.0003140782,0.002310652,0.0001331255,0.00003023019],"category_scores_gemma":[0.000006640117,0.0002734652,0.0001379914,0.0008022991,0.000132811,0.001168176,0.00003997405,0.0006364334,0.00006418511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001533195,"about_ca_system_score_gemma":0.00008345584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006196077,"about_ca_topic_score_gemma":0.0004814859,"domain_scores_codex":[0.9981987,0.0003044883,0.0004486567,0.0004462388,0.0002189309,0.0003829362],"domain_scores_gemma":[0.9949788,0.0008778553,0.000201532,0.00318029,0.0006034274,0.0001580277],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003226438,0.0003565005,0.00001821453,0.000004909586,0.0001053626,2.22796e-7,0.001195092,0.7806692,0.0006871123,0.01148424,0.0002359473,0.2052109],"study_design_scores_gemma":[0.000763446,0.0001695668,0.0004294154,0.00009614675,0.00002504319,0.000007039203,0.0001343767,0.9967408,0.0005596594,0.0000919806,0.0006323297,0.0003501903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009610589,0.0001707517,0.9850307,0.003001801,0.0001580983,0.001240866,0.000006998412,0.0003786636,0.0004015527],"genre_scores_gemma":[0.7565815,0.0007156493,0.2409773,0.0003064057,0.00002002281,0.001129971,0.00001264844,0.00003481215,0.0002217268],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7469709,"threshold_uncertainty_score":0.9999717,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04124335255221889,"score_gpt":0.2687711435659568,"score_spread":0.2275277910137379,"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."}}