{"id":"W2099876783","doi":"10.1109/glocom.2009.5426222","title":"Optimization of Power Constrained Multi-Source Uplink Relay Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Beamforming; Relay; Telecommunications link; Computer science; Decoding methods; Relaxation (psychology); Antenna (radio); Mathematical optimization; Optimization problem; Power (physics); Transmitter power output; Computer network; Algorithm; Telecommunications; Mathematics; Transmitter","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.001302056,0.001159676,0.001143535,0.0004246117,0.0002968068,0.00117159,0.0007750261,0.001061089,0.002026337],"category_scores_gemma":[0.003450146,0.0005838026,0.0003778381,0.0008335467,0.000761766,0.001422242,0.0009387629,0.0008682631,0.000405813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000967869,"about_ca_system_score_gemma":0.0005852316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001463257,"about_ca_topic_score_gemma":0.001287395,"domain_scores_codex":[0.9992076,0.0004578351,0.00002358272,0.0001132678,0.0001227064,0.00007508352],"domain_scores_gemma":[0.99831,0.001295371,0.0001279181,0.00006920302,0.0001577477,0.00003976906],"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.0000433981,0.00001305769,0.0001173488,0.0000494877,0.00001796376,0.00005900323,0.00002515678,0.9810947,0.0008580299,0.009874221,0.0003918028,0.007455806],"study_design_scores_gemma":[0.000009399449,0.00001953529,0.00004378963,0.000004523723,0.000004652878,0.00001317023,0.00001252029,0.9940177,0.0004452747,0.005153941,0.0002716675,0.000003747081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03863956,0.001317196,0.9511836,0.0004978358,0.00004625276,0.0000406425,0.0001157071,0.0001512031,0.008008083],"genre_scores_gemma":[0.8844783,0.001451232,0.1062592,0.0001498013,0.00007957802,0.0001640599,0.0001620239,0.0001066182,0.0071491],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002026337,"threshold_uncertainty_score":0.00702244,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02535978645383936,"score_gpt":0.2684067799738968,"score_spread":0.2430469935200574,"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."}}