{"id":"W2063601473","doi":"10.1109/tcomm.2013.031213.120686","title":"Outage Analysis of Opportunistic Scheduling in Dual-Hop Multiuser Relay Networks in the Presence of Interference","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Outage probability; Scheduling (production processes); Computer science; Hop (telecommunications); Interference (communication); Upper and lower bounds; Co-channel interference; Topology (electrical circuits); Single antenna interference cancellation; Channel state information; Channel (broadcasting); Relay channel; Closed-form expression; Computer network; Control theory (sociology); Fading; Mathematics; Telecommunications; Mathematical optimization; Wireless","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.0007573612,0.0001271703,0.0002840414,0.000603746,0.0001730979,0.00005850775,0.002460154,0.00006609326,0.0000479252],"category_scores_gemma":[0.00005134362,0.0001086381,0.0001212774,0.003255938,0.0002144306,0.0003694199,0.00005477062,0.000577797,0.000006082237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004379865,"about_ca_system_score_gemma":0.00005883886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003003798,"about_ca_topic_score_gemma":0.003144907,"domain_scores_codex":[0.9979709,0.0008070831,0.0006625254,0.0002092296,0.0001745854,0.0001756889],"domain_scores_gemma":[0.9944672,0.001875251,0.0002032936,0.003204801,0.0002073984,0.00004207356],"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.00001077862,0.001258105,0.002082569,0.00001292197,0.0002084761,0.000001440736,0.01231249,0.9235318,0.001628276,0.01958378,0.00002741917,0.03934192],"study_design_scores_gemma":[0.0001787668,0.00003315664,0.009249214,0.00009733265,0.00004576441,0.000001073314,0.0004807838,0.989531,0.0001545249,0.00008733724,0.00003963691,0.0001013626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04091654,0.0002771371,0.9557308,0.001932511,0.00006485038,0.0003730712,0.000006677297,0.00002900906,0.0006693939],"genre_scores_gemma":[0.9848911,0.002237375,0.01250872,0.0001227265,0.000002217931,0.0001761677,0.000006164248,0.000005965052,0.00004953834],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9439746,"threshold_uncertainty_score":0.457162,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08063186284505632,"score_gpt":0.3159307185270514,"score_spread":0.2352988556819951,"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."}}