{"id":"W1985863377","doi":"10.1007/s11009-007-9064-0","title":"On the Finite Buffer Queue with Renewal Input and Batch Markovian Service Process: GI/BMSP/1/N","year":2008,"lang":"en","type":"article","venue":"Methodology And Computing In Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Queue; Buffer (optical fiber); Markov process; Markovian arrival process; Process (computing); Queueing theory; Renewal theory; Markov chain; Mathematical optimization; Applied mathematics; Statistics; Computer network; Computer science","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007498506,0.00169376,0.002560431,0.002976718,0.001898608,0.003331591,0.004426157,0.002232872,0.006555759],"category_scores_gemma":[0.02062764,0.0009356688,0.001509392,0.002836763,0.004481336,0.006362304,0.002753382,0.004034566,0.0008742656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006829975,"about_ca_system_score_gemma":0.006338816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02923217,"about_ca_topic_score_gemma":0.0165915,"domain_scores_codex":[0.9972159,0.001162651,0.0001027179,0.0003968266,0.0007205821,0.0004012652],"domain_scores_gemma":[0.989278,0.006959994,0.0007670021,0.0005313368,0.001730685,0.0007330877],"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.0001777041,0.00008088531,0.0006272513,0.0001429631,0.00004639832,0.000195997,0.0002428857,0.1451483,0.001089542,0.8421932,0.004667546,0.005387242],"study_design_scores_gemma":[0.00002735539,0.00002659073,0.000254456,0.00003099781,0.00002283979,0.00004577349,0.00004015598,0.8640208,0.0001513922,0.1345422,0.0008064728,0.00003114365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08255882,0.004006413,0.8870977,0.003996781,0.0008177452,0.0001653217,0.0006108115,0.0004375101,0.02030883],"genre_scores_gemma":[0.8736786,0.005683085,0.08806476,0.001298693,0.00175923,0.0003989148,0.0007503658,0.0005218243,0.02784442],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02923217,"threshold_uncertainty_score":0.05812407,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05882307351263983,"score_gpt":0.265058538504877,"score_spread":0.2062354649922372,"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."}}