{"id":"W1982586504","doi":"10.1007/s11277-008-9448-7","title":"A Channel based Fair Scheduling Scheme for Downlink Data Transmission in TD-CDMA Networks","year":2008,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Scheduling (production processes); Maximum throughput scheduling; Telecommunications link; Throughput; Code division multiple access; Computer network; Fairness measure; Network packet; Channel (broadcasting); Proportionally fair; Data transmission; Wireless; Real-time computing; Dynamic priority scheduling; Round-robin scheduling; Telecommunications; Quality of service; Mathematical optimization","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.0002505726,0.0002552255,0.0002946919,0.000165305,0.0004579104,0.0000263714,0.00136207,0.00019389,0.00001444664],"category_scores_gemma":[0.00002403538,0.0002950366,0.00007736649,0.0005824326,0.000148711,0.0004330104,0.0001709453,0.0005352012,0.000006544584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001331546,"about_ca_system_score_gemma":0.00008081958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001738113,"about_ca_topic_score_gemma":0.00009789568,"domain_scores_codex":[0.9985682,0.00007063564,0.0004251381,0.0003401674,0.0001761007,0.0004197809],"domain_scores_gemma":[0.9977918,0.0003910052,0.00007198686,0.001529217,0.0000978369,0.0001182123],"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.00003167862,0.00009912127,0.0001790523,0.00005118862,0.0000241384,0.000001692855,0.000476722,0.9911623,0.0003175392,0.0002348515,0.0002868931,0.007134829],"study_design_scores_gemma":[0.0009253842,0.00001462173,0.0002531469,0.0001884153,0.00001451128,0.000005996997,0.0001234549,0.9938905,0.00005724409,0.00003370658,0.004170844,0.0003221641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008720834,0.003180549,0.985839,0.0007864204,0.00008081429,0.0005816219,0.00009855441,0.0004155262,0.0002966486],"genre_scores_gemma":[0.8038873,0.002587771,0.1910363,0.00009019699,0.00009448574,0.00021389,0.001992422,0.00007744867,0.00002022896],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7951664,"threshold_uncertainty_score":0.9999502,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07385997584558751,"score_gpt":0.2848493049720901,"score_spread":0.2109893291265026,"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."}}