{"id":"W2555336608","doi":"10.1109/access.2016.2628808","title":"Joint Secure AF Relaying and Artificial Noise Optimization: A Penalized Difference-of-Convex Programming Framework","year":2016,"lang":"en","type":"article","venue":"IEEE Access","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Artificial noise; Computer science; Relay; Robustness (evolution); Semidefinite programming; Secure transmission; Mathematical optimization; Robust optimization; Optimization problem; MIMO; Convex optimization; Physical layer; Transmission (telecommunications); Wireless; Channel (broadcasting); Algorithm; Computer network; Mathematics; Regular polygon; Power (physics); Telecommunications","routes":{"ca_aff":true,"ca_fund":true,"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.0001578941,0.0001650911,0.0002697761,0.0001261436,0.00007484165,0.0001234402,0.0004194761,0.0001708846,0.00007482875],"category_scores_gemma":[0.00009589252,0.0001338093,0.00004850584,0.0002391763,0.0001015375,0.0003525377,0.0001222009,0.0002026133,0.000003117475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004235827,"about_ca_system_score_gemma":0.00001751945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000014845,"about_ca_topic_score_gemma":0.000007252057,"domain_scores_codex":[0.9990059,0.00005042946,0.0003819074,0.0001837019,0.0001743,0.0002037909],"domain_scores_gemma":[0.9990598,0.0001684618,0.0001083355,0.0004915251,0.00009986045,0.00007202699],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002759211,0.0005763376,0.02368689,0.002208007,0.0005845057,0.0000423981,0.01571142,0.03907352,0.1642054,0.0460251,0.00184016,0.7057704],"study_design_scores_gemma":[0.002158601,0.0002199002,0.006696559,0.005874722,0.0002034839,0.00005159694,0.0004427535,0.2242103,0.7024979,0.05008671,0.004816637,0.00274089],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2883938,0.0003835335,0.7093635,0.000322233,0.000174081,0.0003355128,0.000007427288,0.0006422825,0.0003776785],"genre_scores_gemma":[0.9609795,0.0004141522,0.03835037,0.00002832048,0.00007232921,0.0001039606,0.00000289367,0.00003821786,0.00001026482],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7030295,"threshold_uncertainty_score":0.5456583,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04152872685809027,"score_gpt":0.2889733166641995,"score_spread":0.2474445898061092,"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."}}