{"id":"W2149024062","doi":"10.1109/tcomm.2013.022713.120129","title":"Relay Beamforming Designs in Multi-User Wireless Relay Networks Based on Throughput Maximin Optimization","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Beamforming; Relay; Mathematical optimization; Computer science; Optimization problem; Wireless; Computational complexity theory; Convex optimization; Minimax; Wireless network; Algorithm; Mathematics; Regular polygon; 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.001408015,0.001258769,0.001057794,0.0005383729,0.0003431814,0.0008908559,0.0007560012,0.001055795,0.001619179],"category_scores_gemma":[0.002851492,0.0006683388,0.0004784368,0.0007845624,0.0007304452,0.001428375,0.0008620683,0.0007261006,0.0006350393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000621011,"about_ca_system_score_gemma":0.0005502095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004929242,"about_ca_topic_score_gemma":0.0006315609,"domain_scores_codex":[0.9993056,0.0003855606,0.00002926094,0.0000920138,0.0001420664,0.00004543412],"domain_scores_gemma":[0.9992269,0.0005394631,0.00008771176,0.00003996573,0.00008784394,0.00001812733],"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.00008757744,0.00003194119,0.0002258104,0.000122313,0.0000384971,0.00007853858,0.0001086839,0.9102812,0.007125563,0.02621926,0.0009017636,0.05477892],"study_design_scores_gemma":[0.00001033165,0.00004630415,0.00004737266,0.000008171945,0.00000657499,0.00003374177,0.00001053002,0.9913327,0.001529496,0.006530412,0.0004365729,0.000007764879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00315792,0.0001520108,0.9957846,0.00004148471,0.000008137448,0.00001892674,0.000008101195,0.00007580624,0.0007530394],"genre_scores_gemma":[0.4594562,0.001267556,0.5353658,0.0001395893,0.00008260784,0.0003757786,0.0000804759,0.000116165,0.003115779],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001619179,"threshold_uncertainty_score":0.007446349,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08093831440962014,"score_gpt":0.2975022704308457,"score_spread":0.2165639560212256,"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."}}