{"id":"W2120752472","doi":"10.1109/cwit.2009.5069512","title":"An opportunistic-based protocol for bidirectional cooperative networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Protocol (science); Relay; Cooperative diversity; Outage probability; Channel (broadcasting); Upper and lower bounds; Selection (genetic algorithm); Exploit; Scheme (mathematics); Power (physics); Distributed computing; Fading; Mathematics; Computer security","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.001107073,0.000368356,0.0003503199,0.0004275283,0.000773787,0.0006041434,0.001072894,0.0005209158,0.001072521],"category_scores_gemma":[0.002649661,0.0001734267,0.000222123,0.0004581441,0.0009005213,0.001158289,0.001562114,0.0006539471,0.000167371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000469965,"about_ca_system_score_gemma":0.0007485802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006846322,"about_ca_topic_score_gemma":0.001127826,"domain_scores_codex":[0.9992685,0.0002465911,0.00003374784,0.00007141938,0.0002993038,0.00008041117],"domain_scores_gemma":[0.9984643,0.0008583752,0.0001779597,0.0002155019,0.0002152891,0.0000685951],"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.0002926314,0.0001518964,0.001198972,0.0004140307,0.00009665452,0.001207205,0.001174234,0.159182,0.05219446,0.5890954,0.005519833,0.1894727],"study_design_scores_gemma":[0.00006045286,0.0001834018,0.0002906756,0.00005042622,0.00006332053,0.001007594,0.0002311061,0.8378798,0.01261842,0.1188044,0.0287372,0.00007322794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01600369,0.0003372253,0.977374,0.0001873297,0.00006918269,0.0001248806,0.00002763126,0.0001393702,0.005736817],"genre_scores_gemma":[0.8473017,0.0007771877,0.1459337,0.0002246639,0.00006641084,0.0005682256,0.00008352925,0.00004246172,0.005002177],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001107073,"threshold_uncertainty_score":0.005854785,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0916778520068448,"score_gpt":0.3727935192452325,"score_spread":0.2811156672383877,"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."}}