{"id":"W1972111226","doi":"10.1109/tvt.2014.2380775","title":"Full-Duplex MIMO Precoding for Sum-Rate Maximization With Sequential Convex Programming","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Precoding; Maximization; Convex optimization; Mathematical optimization; Rate of convergence; MIMO; Mathematics; Algorithm; Convex function; Convergence (economics); Regular polygon; Computer science; Telecommunications; Beamforming","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.0001884326,0.0002823868,0.0002980813,0.0004847262,0.0003314987,0.00005644226,0.0003927797,0.0003703761,0.00002955873],"category_scores_gemma":[0.0000168865,0.000291077,0.0001023891,0.0006407074,0.0001754282,0.0001607112,0.000003136645,0.0004722985,0.00003326366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001303919,"about_ca_system_score_gemma":0.00002695216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009715549,"about_ca_topic_score_gemma":0.0001942403,"domain_scores_codex":[0.9987117,0.00005221395,0.0003292656,0.0003406165,0.0001273876,0.0004388153],"domain_scores_gemma":[0.9988299,0.0001179526,0.00007170515,0.0007639448,0.0001491151,0.00006736763],"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.00004413804,0.00007612944,0.00001085684,0.00008093689,0.0001307201,0.000001419359,0.00006494665,0.9213316,0.03977475,0.0009833276,0.00002099438,0.03748021],"study_design_scores_gemma":[0.0009333857,0.0003304852,0.000009940672,0.00007429461,0.0001007386,0.00003702717,0.00008609054,0.861217,0.1287311,0.00003156771,0.008104862,0.0003435353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2975084,0.00004767455,0.6996349,0.0004557332,0.000202749,0.0006177415,0.00001611732,0.001491861,0.00002484506],"genre_scores_gemma":[0.9561371,0.00005854303,0.04253596,0.00003019116,0.00003026589,0.001007205,0.000033965,0.0001031355,0.00006369561],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6586286,"threshold_uncertainty_score":0.9999542,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01247713503605276,"score_gpt":0.2187978376185193,"score_spread":0.2063207025824665,"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."}}