{"id":"W2171722911","doi":"10.1109/49.914513","title":"Performance of a priority-based dynamic capacity allocation scheme for wireless ATM systems","year":2001,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; Concordia University","funders":"","keywords":"Computer science; Telecommunications link; Computer network; Scheduling (production processes); Real-time computing; Time division multiple access; Queue; Queueing theory; Markov process; Asynchronous Transfer Mode; Markov chain","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.001635735,0.0002005054,0.000351177,0.000582299,0.0005863627,0.0001911212,0.004940017,0.0001493837,0.000002465075],"category_scores_gemma":[0.0002315735,0.0002029529,0.00009591186,0.002349875,0.0001824378,0.0005535498,0.0002046364,0.001088652,0.000007634691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005555269,"about_ca_system_score_gemma":0.0006687485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005273103,"about_ca_topic_score_gemma":0.0002072828,"domain_scores_codex":[0.9969862,0.0008781125,0.0008704988,0.0002593202,0.0005666549,0.0004392685],"domain_scores_gemma":[0.9930758,0.00140589,0.0005843091,0.003079834,0.001703437,0.0001506885],"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.001422658,0.01197847,0.1605142,0.0008729501,0.0006936222,0.00001761164,0.004556527,0.4592305,0.0887774,0.110578,0.002249286,0.1591088],"study_design_scores_gemma":[0.0009094656,0.0002225991,0.01335955,0.0004202363,0.000006514016,0.00005749057,0.00002331524,0.9827145,0.0005959222,0.0001374282,0.00135873,0.0001942172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7954468,0.0004337541,0.1995466,0.003067585,0.0002159051,0.0007855517,0.000008289552,0.0001059873,0.0003894835],"genre_scores_gemma":[0.9559345,0.001854158,0.04181651,0.00006300327,0.00003707888,0.0002026482,0.00002299658,0.00002299291,0.00004612263],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5234841,"threshold_uncertainty_score":0.9179863,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05451781948200624,"score_gpt":0.3219360821774601,"score_spread":0.2674182626954539,"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."}}