{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005550892,0.0001852745,0.0001850252,0.000217646,0.0007318438,0.0002524203,0.001693319,0.0001050118,0.000007805696],"category_scores_gemma":[0.00005322,0.0001796742,0.0000328589,0.001129966,0.0002534068,0.0005819576,0.0004769955,0.001208187,0.00001139692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006486219,"about_ca_system_score_gemma":0.00005721229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004088991,"about_ca_topic_score_gemma":0.001868892,"domain_scores_codex":[0.9985222,0.0003937712,0.0003164284,0.0003376468,0.0001434518,0.0002864688],"domain_scores_gemma":[0.997314,0.0004229961,0.0001376029,0.00188551,0.0001426868,0.00009723387],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001851899,0.001166215,0.03073236,0.00004697983,0.0004185828,0.00003042995,0.01750703,0.2457,0.2362396,0.3039187,0.01313622,0.1509188],"study_design_scores_gemma":[0.0008716231,0.00007536584,0.01682426,0.0001031402,0.00001541426,0.00007449939,0.0000858953,0.9724706,0.0006305074,0.00003397834,0.008337477,0.0004771895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2390058,0.0004889726,0.7275905,0.02970674,0.0003623631,0.0005210197,0.000001654966,0.0003554948,0.00196749],"genre_scores_gemma":[0.9616393,0.0006379786,0.03508139,0.002363139,0.00003790683,0.0001612525,0.00001419567,0.00001954208,0.00004525363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7267707,"threshold_uncertainty_score":0.7326903,"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."}}