{"id":"W2589141113","doi":"","title":"Optimal Power Allocation for a Successive Refinable Source with Multiple Descriptions over a Fading Relay Channel Using Broadcast/Multicast Strategies","year":2009,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"University of Waterloo","keywords":"Multicast; Fading; Relay; Channel (broadcasting); Computer science; Computer network; Power (physics); Channel state information; Electronic engineering; Telecommunications; Wireless; Engineering; Physics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006196866,0.001056447,0.0007111385,0.0003767393,0.0003337907,0.0008218607,0.0008692589,0.0007703166,0.001386635],"category_scores_gemma":[0.001475159,0.0004105089,0.0003881843,0.0004311456,0.0008063451,0.0009144473,0.0008348218,0.0006728018,0.0002450158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008116447,"about_ca_system_score_gemma":0.0007907652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00188754,"about_ca_topic_score_gemma":0.001550625,"domain_scores_codex":[0.9996459,0.0001223169,0.00002022064,0.0000677148,0.00007373956,0.00007003989],"domain_scores_gemma":[0.9995505,0.0002310504,0.00007785232,0.00003168334,0.00007422115,0.00003471215],"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.0004255461,0.00008605498,0.0005592268,0.0002603323,0.00008486331,0.0003178948,0.0002329031,0.8398878,0.04800318,0.04438803,0.001386131,0.06436802],"study_design_scores_gemma":[0.00002028236,0.00006637208,0.00008979303,0.000007618255,0.00001590184,0.00003587957,0.00002967333,0.991181,0.003073799,0.005182727,0.0002850494,0.00001191605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08659676,0.000624435,0.9075506,0.0003413926,0.00003623009,0.0000713118,0.00004588578,0.0001228731,0.004610526],"genre_scores_gemma":[0.9188961,0.0005537652,0.07763614,0.00008792382,0.00004272285,0.000079887,0.00004745722,0.00003973657,0.002616237],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00188754,"threshold_uncertainty_score":0.005888999,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02546767981237525,"score_gpt":0.2451323212315228,"score_spread":0.2196646414191476,"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."}}