{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00386588,0.0009036254,0.001269669,0.003248762,0.0007378451,0.002009639,0.002194849,0.001653747,0.006116085],"category_scores_gemma":[0.02137675,0.001243303,0.001342026,0.002049207,0.001666392,0.00456313,0.002158483,0.003033832,0.00125525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001632783,"about_ca_system_score_gemma":0.002361092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004495293,"about_ca_topic_score_gemma":0.004842415,"domain_scores_codex":[0.9981353,0.000759916,0.00009039199,0.0002931177,0.0006084751,0.0001126329],"domain_scores_gemma":[0.9924586,0.005546473,0.0005401389,0.0004171617,0.000838538,0.0001989739],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002861066,0.0000662527,0.0008120011,0.000150346,0.00009703355,0.0001716758,0.0001453776,0.2590479,0.0008738409,0.6913743,0.001807177,0.04542551],"study_design_scores_gemma":[0.00001280411,0.00001468528,0.0002852087,0.00005112402,0.00001937442,0.00008797734,0.00001643627,0.583798,0.0003978366,0.4126934,0.002585975,0.00003715236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001710636,0.0001601218,0.9966126,0.0001303317,0.00001896927,0.00001878544,0.00005481543,0.00005272102,0.001241004],"genre_scores_gemma":[0.1975128,0.001849714,0.7917939,0.0003318149,0.0003173116,0.0003439658,0.0005540745,0.0001955204,0.007100854],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006116085,"threshold_uncertainty_score":0.02046037,"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."}}