MétaCan
Menu
Back to cohort
Record W2060338200 · doi:10.1109/acc.2012.6314720

Designing synchronization protocols in networks of coupled nodes under uncertainty

2012· article· en· W2060338200 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
FieldEngineering
TopicControl and Stability of Dynamical Systems
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsSynchronizingSynchronization (alternating current)Coupling (piping)Computer scienceStability (learning theory)Element (criminal law)Noise (video)Synchronization networksControl theory (sociology)Distributed computingMathematical optimizationTopology (electrical circuits)MathematicsEngineeringTransmission (telecommunications)Computer networkTelecommunicationsArtificial intelligence

Abstract

fetched live from OpenAlex

This paper considers the problem of synchronizing the outputs of nodes in a network of N coupled dynamical systems in the presence of uncertainty. A computational approach is used to design coupling dynamics that ensure synchrony when nodes are subject to model uncertainty and that minimize nodal deviation from synchrony in the presence of input noise. The main result of this paper recasts the problem of designing the coupling a robust stability problem with a structured uncertainty element. A coupling satisfying the criteria of this robust stability problem can then be designed through an application of the small-gain theorem and μ-synthesis techniques.

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.913
Threshold uncertainty score0.244

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.013
GPT teacher head0.235
Teacher spread0.222 · 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