{"id":"W2612409511","doi":"10.1049/iet-cta.2016.1248","title":"Memory scheduling robust filter‐based fault detection for discrete‐time polytopic uncertain systems over fading channels","year":2017,"lang":"en","type":"article","venue":"IET Control Theory and Applications","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Fading; Computer science; Control theory (sociology); Scheduling (production processes); Fault detection and isolation; Discrete time and continuous time; Filter (signal processing); Filtering theory; Real-time computing; Algorithm; Channel (broadcasting); Mathematics; Computer network; Mathematical optimization; Artificial intelligence; Actuator; Control (management); Computer vision","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.0005677592,0.0002111823,0.00030459,0.00008349097,0.0008749399,0.0003381073,0.0002175851,0.0001423778,0.00001575468],"category_scores_gemma":[0.00007468109,0.0002024568,0.0001127497,0.00005371299,0.00006952616,0.0002029902,0.00001268501,0.000140451,0.00002107281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000528417,"about_ca_system_score_gemma":0.00001175634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003557444,"about_ca_topic_score_gemma":0.00001059805,"domain_scores_codex":[0.9989691,0.00008057081,0.0002864377,0.0002820325,0.0001004969,0.0002813637],"domain_scores_gemma":[0.9988805,0.0003293837,0.0001323679,0.0004944259,0.00005282945,0.0001104694],"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.0002602639,0.00003525649,0.00003093609,0.0003497057,0.0002767269,0.000001341508,0.0001526267,0.8191178,0.1265445,0.01416327,0.00006408717,0.03900343],"study_design_scores_gemma":[0.002134654,0.00003654421,0.00008300742,0.00006232053,0.0000768555,0.000006118683,0.0001495355,0.9863816,0.002965189,0.001125804,0.006706315,0.0002720505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02395121,0.0006199022,0.9713208,0.0001107125,0.0005582143,0.001766611,0.000117726,0.0003820292,0.001172788],"genre_scores_gemma":[0.9957206,0.000007790436,0.00007515676,0.00006371085,0.0007598152,0.002635447,0.0000126251,0.00004092269,0.0006839156],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9717694,"threshold_uncertainty_score":0.8255949,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01161584496296285,"score_gpt":0.2426723439249575,"score_spread":0.2310564989619946,"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."}}