MétaCan
Menu
Back to cohort
Record W2041292207 · doi:10.1109/tac.2013.2274707

Reach Controllability of Single Input Affine Systems on a Simplex

2013· article· en· W2041292207 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

VenueIEEE Transactions on Automatic Control · 2013
Typearticle
Languageen
FieldEngineering
TopicAdvanced Control Systems Optimization
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsControllabilitySimplexAffine transformationBoundary (topology)MathematicsState spaceControl theory (sociology)State (computer science)Space (punctuation)Set (abstract data type)Applied mathematicsTopology (electrical circuits)Control (management)Computer sciencePure mathematicsMathematical analysisCombinatoricsAlgorithm

Abstract

fetched live from OpenAlex

We study the reach control problem (RCP) for a single input affine system with a simplicial state space. We extend previous results by exploring arbitrary triangulations of the state space; particularly allowing the set of possible equilibria to intersect the interior of simplices. In the studied setting, it is shown that closed-loop equilibria, nevertheless, only arise on the boundary of simplices. This allows to define a notion of reach controllability which quantifies the effect of the control input on boundary equilibria. Using reach controllability we obtain necessary and sufficient conditions for solvability of RCP by affine feedback.

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 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.948
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.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.009
GPT teacher head0.208
Teacher spread0.198 · 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