{"id":"W2000965014","doi":"10.3182/20090916-3-es-3003.00028","title":"Computing reachable sets for uncertain nonlinear hybrid systems using interval constraint propagation techniques","year":2009,"lang":"en","type":"article","venue":"IFAC Proceedings Volumes","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Local consistency; Intersection (aeronautics); Interval (graph theory); Nonlinear system; Constraint satisfaction problem; Interval arithmetic; Constraint satisfaction; Hybrid system; Mathematical optimization; Set (abstract data type); Mathematics; Constraint (computer-aided design); Consistency (knowledge bases); Computer science; Algorithm; Artificial intelligence; Engineering; Discrete mathematics","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.0009411243,0.0002310414,0.0003599585,0.0001268973,0.0002590473,0.0005422347,0.0005392599,0.00007304428,8.840134e-7],"category_scores_gemma":[0.0001989674,0.0002077968,0.0001020529,0.0003193986,0.00007031562,0.0006530908,0.0001166183,0.0001761093,0.000002224114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001271704,"about_ca_system_score_gemma":0.00007390073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005383027,"about_ca_topic_score_gemma":9.939573e-8,"domain_scores_codex":[0.9982288,0.00002451459,0.0004506045,0.000550241,0.000274707,0.0004711088],"domain_scores_gemma":[0.9989551,0.0000699356,0.0002935247,0.0001472609,0.0004142535,0.0001198733],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001384274,0.0001121953,0.0002923534,0.0001780093,0.00002248789,0.000007150125,0.0004823978,0.00008025914,0.02526115,0.01494386,0.0004756387,0.9581307],"study_design_scores_gemma":[0.0001813311,0.000385744,0.00003323753,0.0002784471,0.00001074627,0.0001676378,0.0001499332,0.9682236,0.0227429,0.005351083,0.002182865,0.0002925359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04165855,0.0001087836,0.9556547,0.0005071756,0.0002990171,0.0008051405,0.000008383743,0.0005771351,0.0003811229],"genre_scores_gemma":[0.2700163,0.000003289522,0.729511,0.0001552402,0.0002412552,0.0000166258,0.000002925452,0.0000127507,0.00004068239],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9681433,"threshold_uncertainty_score":0.8473707,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03920751588142565,"score_gpt":0.3268830860651937,"score_spread":0.2876755701837681,"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."}}