{"id":"W2107363488","doi":"10.1109/lcomm.2010.07.100407","title":"Amplify-and-Forward Relaying in Channel-Noise-Assisted Cooperative Networks with Relay Selection","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Ergodic theory; Relay; Cumulative distribution function; Probability density function; Channel (broadcasting); Expression (computer science); Computer science; Topology (electrical circuits); Signal-to-noise ratio (imaging); Upper and lower bounds; Closed-form expression; Selection (genetic algorithm); Channel capacity; Noise (video); Relay channel; Outage probability; Mathematics; Algorithm; Applied mathematics; Telecommunications; Statistics; Fading; Mathematical analysis; Physics; Combinatorics; Artificial intelligence","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.001644411,0.0008144063,0.0006288583,0.0004993546,0.000437468,0.0007200996,0.0007336211,0.0007331155,0.0003670809],"category_scores_gemma":[0.003262994,0.0003112582,0.0002648646,0.0007379917,0.0009456929,0.0007776068,0.000723708,0.0002649295,0.0001329103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000864098,"about_ca_system_score_gemma":0.0004523299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001904801,"about_ca_topic_score_gemma":0.002876414,"domain_scores_codex":[0.9993137,0.0003390997,0.00002187381,0.0000654092,0.0001888144,0.00007102532],"domain_scores_gemma":[0.9976918,0.001701431,0.0001880947,0.00009343119,0.0002911985,0.00003413482],"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.0001166153,0.00003133698,0.0005413716,0.0000567315,0.00002759309,0.0001910784,0.0001116713,0.9735491,0.005406083,0.009365694,0.0001717663,0.01043105],"study_design_scores_gemma":[0.000007570402,0.000109735,0.0001223536,0.000003756943,0.00001397443,0.00005284733,0.00002630586,0.9950079,0.001401245,0.00314652,0.0001008604,0.000006962067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4724633,0.001262054,0.5195923,0.0002294571,0.00002937446,0.00006859121,0.00006487357,0.0001893828,0.006100692],"genre_scores_gemma":[0.9856685,0.0002776902,0.0133469,0.00001765385,0.00001120741,0.00002938432,0.00001516854,0.000005609111,0.0006278688],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001904801,"threshold_uncertainty_score":0.008696616,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02841809767530662,"score_gpt":0.2693604635133959,"score_spread":0.2409423658380893,"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."}}