MétaCan
Menu
Back to cohort
Record W2131961744 · doi:10.1109/isic.1998.713655

Fault tolerant control system synthesis using imprecise fault identification and reconfigurable control

2002· article· en· W2131961744 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicFault Detection and Control Systems
Canadian institutionsWestern University
Fundersnot available
KeywordsControl reconfigurationFault toleranceFault (geology)Scheme (mathematics)Identification (biology)Computer scienceFault coverageFault detection and isolationControl systemController (irrigation)Control engineeringControl theory (sociology)Stuck-at faultControl (management)Fault indicatorEmbedded systemEngineeringActuatorDistributed computingArtificial intelligenceMathematicsElectronic circuit

Abstract

fetched live from OpenAlex

A new design scheme of a fault tolerant control system based on the imprecise fault identification and the robust reconfigurable control is proposed in this paper. The method integrates the fault detection and identification scheme with the reconfigurable control, and can be implemented online and in real-time. This method reduces the time delay between the onset of the fault and the controller reconfiguration so that the system stability after the fault occurrence can be recovered quickly. Finally, the pre-fault system performance is recovered through successive control reconfiguration.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.828
Threshold uncertainty score0.954

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.012
GPT teacher head0.195
Teacher spread0.183 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations44
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicFault Detection and Control SystemsFrench-language works237,207