MétaCan
Menu
Back to cohort

STABILITY ANALYSIS OF UNCERTAIN DISCRETE‐TIME SYSTEMS WITH TIME‐VARYING STATE DELAY: A PARAMETER‐DEPENDENT LYAPUNOV FUNCTION APPROACH

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

VenueAsian Journal of Control · 2006
Typearticle
Languageen
FieldEngineering
TopicStability and Control of Uncertain Systems
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsControl theory (sociology)Lyapunov functionStability (learning theory)Discrete time and continuous timeMathematicsConstant (computer programming)Function (biology)State (computer science)Time domainComputer scienceNonlinear systemControl (management)AlgorithmStatistics

Abstract

fetched live from OpenAlex

ABSTRACT This paper presents several new robust stability conditions for linear discrete‐time systems with polytopic parameter uncertainties and time‐varying delay in the state. These stability criteria, derived by defining parameter‐dependent Lyapunov functions, are not only dependent on the maximum and minimum delay bounds, but also dependent on uncertain parameters in the sense that different Lyapunov functions are used for the entire uncertainty domain. It is established, theoretically, that these robust stability criteria for the nominal and constant‐delay case encompass some existing result as their special case. The delay‐dependent and parameter‐dependent nature of these results guarantees the proposed robust stability criteria to be potentially less conservative.

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.002
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.621
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
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.006
GPT teacher head0.184
Teacher spread0.178 · 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