MétaCan
Menu
Back to cohort
Record W2288410826 · doi:10.1109/cdc.2015.7402117

Epsilon controllability of nonlinear systems on polytopes

2015· article· en· W2288410826 on OpenAlex
Mohamed K. Helwa, Peter E. Caines

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
FieldComputer Science
TopicPolynomial and algebraic computation
Canadian institutionsMcGill University
Fundersnot available
KeywordsPolytopeControllabilityNonlinear systemMathematicsCover (algebra)ConstructiveAffine transformationPolytope modelLinearizationState (computer science)CombinatoricsApplied mathematicsComputer scienceAlgorithmPure mathematicsEngineering

Abstract

fetched live from OpenAlex

The paper introduces the notion of epsilon controllability of nonlinear systems on polytopes, and then uses it to approximately solve the mutual accessibility problems of nonlinear systems on polytopes. In particular, we first show that if one constructs a polytopic cover of a given polytope such that the affine system resulting from the linearization of the nonlinear system inside each polytopic region of the cover is in-block controllable, then starting from any initial state in the interior of the given polytope, one can steer the nonlinear system to an epsilon neighborhood of any final state in the interior of the polytope in finite time, where epsilon depends on the size of the polytopic regions of the cover. We then study a hierarchy of covers, representing the nonlinear system at different levels of accuracy, and provide a constructive algorithm for achieving approximate mutual accessibility of nonlinear systems on polytopes.

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.959
Threshold uncertainty score0.193

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.029
GPT teacher head0.253
Teacher spread0.225 · 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

Citations11
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicPolynomial and algebraic computationFrench-language works237,207