{"id":"W2035381730","doi":"10.1017/s0269964807000319","title":"A BAYESIAN APPROACH TO FIND RANDOM-TIME PROBABILITIES FROM EMBEDDED MARKOV CHAIN PROBABILITIES","year":2007,"lang":"en","type":"article","venue":"Probability in the Engineering and Informational Sciences","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Markov renewal process; Variable-order Markov model; Markov property; Examples of Markov chains; Computer science; Uniformization (probability theory); Markov chain mixing time; Additive Markov chain; Chain rule (probability); Mathematics; Applied mathematics; Queueing theory; Algorithm; Markov model; Bayesian probability; Law of total probability; Posterior probability; Statistics","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":[],"consensus_categories":[],"category_scores_codex":[0.006000513,0.000200564,0.0002350358,0.0003091721,0.0002861404,0.0003520739,0.0004715729,0.00005384837,0.00003945976],"category_scores_gemma":[0.001469635,0.0001399092,0.00006333386,0.0009965986,0.0002713506,0.001735584,0.0001351233,0.0001559411,0.00002131963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006116895,"about_ca_system_score_gemma":0.00002634984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00013517,"about_ca_topic_score_gemma":0.00002573659,"domain_scores_codex":[0.9983146,0.00002788761,0.0005158763,0.0002863453,0.0004688024,0.00038644],"domain_scores_gemma":[0.9988915,0.000665966,0.0001122375,0.0002226142,0.00008310162,0.0000245898],"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.0001264265,0.0001138512,0.001148967,0.0003133422,0.00001979092,3.980519e-7,0.00644994,0.8640786,0.0000999742,0.1246077,0.00008719279,0.002953828],"study_design_scores_gemma":[0.0003978179,0.00001961067,0.003230471,0.0000613592,0.0000159044,0.000002950766,0.002566549,0.85471,0.00002530505,0.1373824,0.001267145,0.0003205585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.974266,0.00004986199,0.00929899,0.0008705142,0.00007909169,0.0009238017,0.000007594696,0.0001345012,0.01436962],"genre_scores_gemma":[0.9912362,0.000001069168,0.007802277,0.0005353708,0.0002223748,0.0001192425,0.00002347597,0.000006993766,0.00005302604],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01697015,"threshold_uncertainty_score":0.5705332,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01018031356843754,"score_gpt":0.2039760322211716,"score_spread":0.193795718652734,"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."}}