{"id":"W2034350339","doi":"10.1155/2007/21808","title":"Performance of a Two-Level Call Admission Control Scheme for DS-CDMA Wireless Networks","year":2007,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Call Admission Control; Computer network; Code division multiple access; Queueing theory; Scheme (mathematics); Throughput; Wireless; Queue; Wireless network; Markov chain; Access control; Real-time 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002073516,0.001139724,0.0009420172,0.0009915238,0.0009428302,0.001612953,0.0008986262,0.001163008,0.001064825],"category_scores_gemma":[0.006609921,0.0002773312,0.000389462,0.000697219,0.0009958323,0.001070986,0.001158348,0.0009946262,0.0001404926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002163538,"about_ca_system_score_gemma":0.001790012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008426554,"about_ca_topic_score_gemma":0.003294023,"domain_scores_codex":[0.9979545,0.0005012281,0.0001024099,0.0001891691,0.0008731195,0.0003796195],"domain_scores_gemma":[0.9967596,0.001417568,0.0003406206,0.0003818099,0.0007965505,0.0003038103],"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.002343646,0.000776358,0.01186134,0.0001674467,0.0001916027,0.0002167716,0.0003499016,0.8094483,0.06658438,0.01491533,0.001151828,0.09199312],"study_design_scores_gemma":[0.00005176885,0.0002313148,0.0008432797,0.000003304136,0.00001917705,0.00004055656,0.00001570593,0.9930766,0.004760956,0.000748524,0.0001813666,0.00002763494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8046294,0.0009109131,0.1893751,0.0004056481,0.0001544157,0.0001381965,0.00009163967,0.001011439,0.003283235],"genre_scores_gemma":[0.9906261,0.00008215467,0.008864898,0.00003151878,0.00001151425,0.000025904,0.00002625643,0.000008069333,0.000323581],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008426554,"threshold_uncertainty_score":0.01675498,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0640402240700387,"score_gpt":0.3330711937309005,"score_spread":0.2690309696608618,"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."}}