{"id":"W2097962411","doi":"10.1109/mwc.2002.998522","title":"Dynamic bandwidth allocation with fair scheduling for WCDMA systems","year":2002,"lang":"en","type":"article","venue":"IEEE Wireless Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Government of Canada; Australian Government","keywords":"Computer science; Computer network; Scheduling (production processes); Code division multiple access; Quality of service; Broadband networks; Network packet; W-CDMA; Bandwidth (computing); Exploit; Bandwidth allocation; Wireless; Wireless network; Broadband; Distributed computing; Telecommunications","routes":{"ca_aff":true,"ca_fund":true,"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","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006426036,0.0002572119,0.000309143,0.0002698158,0.001086584,0.00054831,0.006965199,0.0001436419,0.000008197356],"category_scores_gemma":[0.00004992324,0.0002499485,0.00009525081,0.001130902,0.0003002633,0.0008728348,0.0006458135,0.0004978959,0.00009930831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002079528,"about_ca_system_score_gemma":0.0001075251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005801988,"about_ca_topic_score_gemma":0.0001772347,"domain_scores_codex":[0.9975309,0.0004248046,0.000530695,0.0004873693,0.0004833075,0.0005429348],"domain_scores_gemma":[0.9910068,0.001090238,0.0002832663,0.006780505,0.0006514418,0.0001877632],"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.00005453885,0.001909849,0.0009045504,0.0003330162,0.0004743352,0.000005294579,0.004982989,0.1779202,0.006209506,0.5925928,0.005170192,0.2094427],"study_design_scores_gemma":[0.0006095102,0.00008085386,0.0001709785,0.0001483891,0.00001325099,0.00002096392,0.000137747,0.9905466,0.0001722069,0.0003040005,0.007477391,0.0003180479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009083885,0.002913033,0.9760173,0.007890845,0.0002138397,0.001165758,0.00001316497,0.0005539611,0.002148221],"genre_scores_gemma":[0.8682734,0.001620247,0.1280834,0.0001030548,0.00003309223,0.00119232,0.00004785453,0.00004586729,0.0006007898],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8591895,"threshold_uncertainty_score":0.9999953,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0550840306179374,"score_gpt":0.2986498327629833,"score_spread":0.2435658021450459,"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."}}