{"id":"W1999613454","doi":"10.1109/icc.2014.6884126","title":"Sequential Convex Programming for Full-Duplex Single-User MIMO systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"MIMO; Convex optimization; Mathematical optimization; Convex function; Maximization; Regular polygon; Linear matrix inequality; Computer science; Algorithm; Proper convex function; Mathematics; Matrix (chemical analysis); Convex combination; Beamforming; 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":[],"consensus_categories":[],"category_scores_codex":[0.0002292682,0.0002096873,0.0002591126,0.00008835354,0.0001333813,0.0001698113,0.0004151551,0.0001314618,0.00005603212],"category_scores_gemma":[0.0000756976,0.000210046,0.0001020068,0.0001553438,0.0000554753,0.0001600078,0.00006390987,0.0001438975,0.0001088493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009653149,"about_ca_system_score_gemma":0.00001402758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000604194,"about_ca_topic_score_gemma":0.0001127831,"domain_scores_codex":[0.9988229,0.00004324897,0.0003670196,0.0002042849,0.0001495995,0.0004129143],"domain_scores_gemma":[0.9987833,0.0002265922,0.00004784376,0.0007118445,0.0001175468,0.0001128733],"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.00001674822,0.0001094547,0.0001126515,0.0005551153,0.0001620462,7.452588e-7,0.0003371729,0.8306546,0.1075816,0.03947084,0.007243448,0.01375558],"study_design_scores_gemma":[0.0003982072,0.00005505441,0.00001859555,0.00003701551,0.00002190838,0.00000751128,0.0001190926,0.745182,0.002726092,0.000002844433,0.251197,0.000234641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4538837,0.0005148461,0.5365493,0.0003056516,0.001344003,0.001495283,0.00002197778,0.002502847,0.003382319],"genre_scores_gemma":[0.970655,0.000008938141,0.02735739,0.00003417513,0.0002514495,0.0004375852,0.00007640794,0.00009020985,0.001088803],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5167713,"threshold_uncertainty_score":0.8565429,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02678979667782708,"score_gpt":0.2366313980655586,"score_spread":0.2098416013877315,"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."}}