{"id":"W2017528090","doi":"10.1155/s1048953304311032","title":"A deterministic discretisation‐step upper bound for state estimation via Clark transformations","year":2004,"lang":"en","type":"article","venue":"International Journal of Stochastic Analysis","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Upper and lower bounds; Discretization; Smoothing; Applied mathematics; State (computer science); A priori and a posteriori; Transformation (genetics); Markov chain; Grid; Stability (learning theory); Markov process; Mathematical optimization; Algorithm; Mathematical analysis; Statistics; Computer science; Geometry","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.003981226,0.0008242548,0.000742981,0.0008182353,0.0005341312,0.001671223,0.001398515,0.00132216,0.002472096],"category_scores_gemma":[0.01702261,0.0004697695,0.0008750399,0.000619198,0.002810881,0.001812496,0.002528432,0.002983423,0.0004363652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001985095,"about_ca_system_score_gemma":0.00158606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004120519,"about_ca_topic_score_gemma":0.002054004,"domain_scores_codex":[0.9984309,0.0004596957,0.00007453622,0.0002280058,0.0006600495,0.0001467627],"domain_scores_gemma":[0.988079,0.008903576,0.0006976873,0.001023158,0.001020308,0.0002763445],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001740388,0.00004044025,0.0008390373,0.0001273665,0.00003562729,0.00007964178,0.0002002118,0.6803567,0.01202469,0.2764018,0.0006549652,0.0290655],"study_design_scores_gemma":[0.000005414517,0.00002315036,0.00003649455,0.000006489742,0.000003078589,0.000006388768,0.000004446925,0.9849866,0.001611539,0.01289207,0.0004177291,0.000006515154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007972551,0.0001894797,0.9898242,0.0002073191,0.00003104288,0.00002205565,0.00001713475,0.0001326703,0.001603508],"genre_scores_gemma":[0.7279768,0.0005754073,0.2662356,0.0002430593,0.00009589336,0.0002852745,0.0001173294,0.0001709673,0.004299575],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004120519,"threshold_uncertainty_score":0.02105504,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00933430757979468,"score_gpt":0.2731855753862911,"score_spread":0.2638512678064964,"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."}}