{"id":"W1564387379","doi":"","title":"A Markovian jump congestion control strategy for mobile ad-hoc networks with differentiated services traffic","year":2010,"lang":"en","type":"article","venue":"Chinese Control Conference","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; Network congestion; Markov process; Wireless ad hoc network; Mobile ad hoc network; Throughput; Controller (irrigation); Vehicular ad hoc network; Network packet; Packet loss; Distributed computing; Wireless; Mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005106989,0.0007443596,0.0009233542,0.0001776345,0.000428227,0.0008580821,0.001652512,0.000376987,0.0001191377],"category_scores_gemma":[0.0000457666,0.0005509758,0.0002367454,0.000498586,0.0002151569,0.0007869519,0.00006899677,0.000772219,0.00002762704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003186188,"about_ca_system_score_gemma":0.0003035773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007940358,"about_ca_topic_score_gemma":0.001250124,"domain_scores_codex":[0.9965466,0.000201092,0.0006648884,0.001158689,0.0004427753,0.0009859807],"domain_scores_gemma":[0.9963105,0.0007624388,0.0004361683,0.001101042,0.000907989,0.0004819144],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002072992,0.0004739842,0.002674554,0.0001225838,0.0004825648,0.00005438593,0.0004034117,0.1022575,0.001756784,0.0105914,0.0001848851,0.878925],"study_design_scores_gemma":[0.01188127,0.0008772952,0.01122339,0.00007555111,0.0001351399,0.0000493139,0.00003438444,0.972565,0.000005127098,0.0004134075,0.00202834,0.0007118099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3836942,0.001414253,0.609809,0.0007642212,0.001064983,0.002231101,0.00005647657,0.0007680902,0.0001977354],"genre_scores_gemma":[0.9958199,0.00009363027,0.001194904,0.0007345068,0.0004317451,0.001329037,0.00007029805,0.00005721567,0.0002687286],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8782132,"threshold_uncertainty_score":0.9996942,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005594481226531264,"score_gpt":0.2195402423222426,"score_spread":0.2139457610957113,"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."}}