MétaCan
Menu
Back to cohort
Record W2095223361 · doi:10.1080/00207720601014313

Practical stability of closed-loop descriptor systems

2006· article· en· W2095223361 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

VenueInternational Journal of Systems Science · 2006
Typearticle
Languageen
FieldEngineering
TopicStability and Control of Uncertain Systems
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsControl theory (sociology)Stability (learning theory)Lyapunov functionSimple (philosophy)MathematicsInvariant (physics)Closed loopLoop (graph theory)Computer scienceLTI system theoryControl (management)Linear systemControl engineeringArtificial intelligenceEngineeringNonlinear systemMachine learning

Abstract

fetched live from OpenAlex

Abstract Practical stability is of significant practical importance in scientific and engineering problems but less investigated for descriptor systems. This paper develops the concepts of practical stability to descriptor systems and by using Lyapunov functions and comparison principle, presents some techniques to specify admissible control sets, such that the motion of the closed-loop descriptor systems is practically stable and impulsive-free. Finally, as an application, this paper discusses linear time-invariant descriptor systems and derives a sufficient condition. To illustrate our approach, a simple circuit network and a numerical example are analysed. Keywords: Descriptor systemsClosed-loop systemsPractical stabilityComparison principleLyapunov function

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.003
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.589
Threshold uncertainty score0.463

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.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.001
Open science0.0010.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.028
GPT teacher head0.274
Teacher spread0.247 · 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