MétaCan
Menu
Back to cohort
Record W2157700663 · doi:10.1109/cdc.2005.1582671

Coupled Dynamic Systems: From Structure Towards State Agreement

2006· article· en· W2157700663 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
FieldComputer Science
TopicNonlinear Dynamics and Pattern Formation
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsNonlinear systemDigraphSynchronization (alternating current)InterconnectionState vectorVector fieldNonlinear dynamical systemsControl theory (sociology)Topology (electrical circuits)State (computer science)Directed graphProperty (philosophy)Computer scienceGraphMathematicsDiscrete mathematicsPhysicsTheoretical computer scienceAlgorithmCombinatorics

Abstract

fetched live from OpenAlex

The state agreement problem is studied for nonlinear continuous-time systems. A general interconnection of nonlinear subsystems is treated, where the vector fields can switch within a finite family. Associated to each vector field is a directed graph based in a natural way on the interaction structure of the subsystems. With the assumption that the vector fields satisfy a certain sub-tangentiality condition, it is proved that asymptotic state agreement is achieved if and only if the dynamic interaction digraph has the property of being sufficiently connected over time. Applications of the main result are then made to the synchronization of coupled Kuramoto oscillators with time-varying interaction and to the analysis of a biochemical reaction network.

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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.664
Threshold uncertainty score0.656

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.005
GPT teacher head0.209
Teacher spread0.204 · 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

Citations5
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicNonlinear Dynamics and Pattern FormationFrench-language works237,207