{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005080897,0.0003057033,0.0002738165,0.0004415269,0.001089932,0.0002711071,0.002757846,0.0001907726,0.0001294777],"category_scores_gemma":[0.00002121394,0.0003173599,0.0001357553,0.001537932,0.0001564085,0.0009532352,0.00004436877,0.001024264,0.0001314375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002882438,"about_ca_system_score_gemma":0.0001168985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008364786,"about_ca_topic_score_gemma":0.0005022457,"domain_scores_codex":[0.9974898,0.0007426229,0.0006243554,0.0004673457,0.0002625723,0.0004133085],"domain_scores_gemma":[0.9944469,0.0009919067,0.0001773378,0.003993639,0.0002481677,0.0001420661],"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.000007355879,0.0006320447,0.00003398705,0.000003096162,0.00001414151,5.887329e-7,0.0004732894,0.9616528,0.00009701541,0.002234455,0.0001486948,0.03470256],"study_design_scores_gemma":[0.0007995874,0.00009140409,0.0002682783,0.0001619778,0.00001119271,0.000002927738,0.0000673063,0.9966604,0.0003993711,0.00002579964,0.001178479,0.0003333246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004177086,0.0001562437,0.9915833,0.005071633,0.0002566014,0.0008297016,0.000003807403,0.000327275,0.001353666],"genre_scores_gemma":[0.6940873,0.001598765,0.3022095,0.000997351,0.00001021721,0.0005907227,0.00001629622,0.00003301083,0.0004568414],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6936696,"threshold_uncertainty_score":0.9999278,"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."}}