{"id":"W2152413159","doi":"10.1109/glocom.2005.1578286","title":"AQuA: aggregated queueing algorithm for CDMA2000 base station controll","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Queueing theory; Base station; Network packet; Queue; Channel (broadcasting); CDMA2000; Buffer (optical fiber); Buffer overflow; Algorithm; Distributed computing; Telecommunications","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.0003178863,0.0005421606,0.0005713121,0.0001868428,0.0004906719,0.0002077085,0.0009638912,0.0003076307,0.0001834606],"category_scores_gemma":[0.00007017591,0.000641409,0.0001804788,0.0007378069,0.0001393156,0.0008711637,0.00007939061,0.0003906118,0.0001813582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009449359,"about_ca_system_score_gemma":0.0002192041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001470299,"about_ca_topic_score_gemma":0.001906269,"domain_scores_codex":[0.9971357,0.0001591516,0.0009797339,0.0004800309,0.0002903423,0.0009550185],"domain_scores_gemma":[0.9973633,0.0002610197,0.0002882694,0.001296757,0.0004979263,0.0002927633],"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.0000227815,0.0001297565,0.00003972857,0.00001906996,0.000115596,0.000001455237,0.00007234266,0.551084,0.0001188365,0.002836117,0.01968029,0.42588],"study_design_scores_gemma":[0.001964645,0.0000495175,0.00009803678,0.00008315017,0.00007485259,0.00001903688,0.00008235875,0.8929843,0.0005417658,0.00108957,0.102408,0.0006047403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002654138,0.001807281,0.9803954,0.0010114,0.0006225568,0.0014002,0.0009542547,0.001334753,0.009819991],"genre_scores_gemma":[0.5214986,0.002876369,0.4720367,0.0003847955,0.0003513683,0.0005639809,0.001581951,0.0001037183,0.0006025651],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5188444,"threshold_uncertainty_score":0.9996037,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01595413676409905,"score_gpt":0.2582083014631412,"score_spread":0.2422541646990422,"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."}}