{"id":"W2136915087","doi":"10.1109/glocom.2008.ecp.787","title":"On Optimal Power Allocation for Source-Orthogonal Relay-Nonorthogonal Amplify-and-Forward Relaying","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Upper and lower bounds; Mathematical optimization; Power (physics); Computer science; Channel (broadcasting); Selection (genetic algorithm); Optimization problem; Asymptotically optimal algorithm; Mathematics; Telecommunications","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001414932,0.0009084225,0.00120522,0.0005695047,0.0003850132,0.0009775884,0.0005841511,0.0007950357,0.001436888],"category_scores_gemma":[0.003537683,0.0005320726,0.0003922377,0.0009287529,0.001202075,0.001170178,0.0007007605,0.0006536704,0.0002471353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001254603,"about_ca_system_score_gemma":0.0009254479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002119861,"about_ca_topic_score_gemma":0.002307077,"domain_scores_codex":[0.9994059,0.0003091351,0.00002094205,0.00007354846,0.0001204996,0.00007005245],"domain_scores_gemma":[0.9984753,0.001243404,0.0001109289,0.00003710632,0.0001106878,0.00002255289],"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.00009273925,0.00004075038,0.0002044248,0.0001086865,0.00002565843,0.0001024198,0.0001117662,0.8887387,0.002380817,0.08447193,0.0008285965,0.02289355],"study_design_scores_gemma":[0.00001174604,0.00002929578,0.0000557795,0.000008744441,0.000006529458,0.00001936248,0.00001660434,0.9770657,0.0004490063,0.02194343,0.0003887167,0.000005140102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04727195,0.001097108,0.9413582,0.0002809604,0.00003432261,0.00006703655,0.00006901778,0.00005615404,0.009765182],"genre_scores_gemma":[0.8544149,0.002923234,0.1362625,0.0001028065,0.0001095472,0.0002070882,0.0001011989,0.00006989216,0.005808785],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002119861,"threshold_uncertainty_score":0.009102821,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03790974255160513,"score_gpt":0.2696929305997769,"score_spread":0.2317831880481718,"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."}}