{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005056537,0.0004709963,0.0003235503,0.0002693836,0.0003010609,0.000486209,0.0007530366,0.0003822783,0.0007982681],"category_scores_gemma":[0.0006696836,0.0001656785,0.0003369307,0.0002046448,0.0004588163,0.0004068431,0.0004583127,0.0006069749,0.00008271899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009041124,"about_ca_system_score_gemma":0.000993901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006458467,"about_ca_topic_score_gemma":0.005099182,"domain_scores_codex":[0.9997461,0.00005096045,0.00001553671,0.000050316,0.0001042142,0.00003286885],"domain_scores_gemma":[0.9997798,0.00007882552,0.00003825993,0.00001170645,0.00007367835,0.00001782581],"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.0001259461,0.0001222487,0.000518813,0.0001772291,0.00005854904,0.0002997989,0.0002349377,0.8122423,0.0297141,0.07542985,0.001960334,0.0791159],"study_design_scores_gemma":[0.00001120832,0.00006979826,0.00007966561,0.000003135395,0.000008773331,0.00001450658,0.000004797826,0.996454,0.0008707,0.002066959,0.0004106638,0.000005848803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02471013,0.0002828736,0.9706727,0.0002237533,0.00008473924,0.00006375285,0.0000265929,0.0002080007,0.003727363],"genre_scores_gemma":[0.9780124,0.0001875577,0.02006211,0.00006402099,0.00003767155,0.00007468547,0.00002739701,0.000009652468,0.00152447],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006458467,"threshold_uncertainty_score":0.01284176,"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."}}