{"id":"W2024154419","doi":"10.1007/s10479-011-1013-1","title":"A Bayesian model and numerical algorithm for CBM availability maximization","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Theory of computation; Parameterized complexity; Markov decision process; Computer science; Mathematical optimization; Maximization; Partially observable Markov decision process; Bayesian probability; Expectation–maximization algorithm; Algorithm; Multivariate statistics; Markov chain; Markov process; Markov model; Mathematics; Artificial intelligence; Machine learning; Statistics","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":[],"consensus_categories":[],"category_scores_codex":[0.0007289479,0.00006654778,0.0001118279,0.0001123501,0.0001267242,0.0000300771,0.00008797696,0.00006819879,0.00005948866],"category_scores_gemma":[0.0002422564,0.00006381259,0.00003096409,0.0002278394,0.0001070488,0.0002659995,0.00002617522,0.0001048954,0.000003442442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001430742,"about_ca_system_score_gemma":0.00004502325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005854505,"about_ca_topic_score_gemma":0.0000143461,"domain_scores_codex":[0.9992186,0.00004807095,0.0002119672,0.0001589197,0.0001514289,0.0002110182],"domain_scores_gemma":[0.998989,0.00004934713,0.000006634571,0.0002010735,0.0006840231,0.00006991484],"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.00002234185,0.0001295237,0.00007385502,0.00009129407,0.00002185788,2.490493e-7,0.001210434,0.9601595,0.0005259463,0.005196964,0.0020442,0.03052381],"study_design_scores_gemma":[0.0001142253,0.00008038225,0.0002452701,0.000009539098,0.000002294898,6.306345e-7,0.00006997338,0.9927981,0.003570287,0.002931377,0.0001140771,0.00006381877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009394794,0.00007906705,0.9880134,0.0002265253,0.00002323339,0.000477746,0.00004637685,0.00003975046,0.001699078],"genre_scores_gemma":[0.77075,0.0003816611,0.2283867,0.00002257465,0.00001898477,0.0001555191,0.00003416696,0.00001750405,0.0002328427],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7613553,"threshold_uncertainty_score":0.2602202,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1699342649344517,"score_gpt":0.369331014930844,"score_spread":0.1993967499963923,"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."}}