MétaCan
Menu
Back to cohort
Record W3114221257 · doi:10.1142/s0218127420502533

On the Scaling Law of Phase Drift in Coupled Nonlinear Oscillators for Precision Timing

2020· article· en· W3114221257 on OpenAlexaff
Antonio Palacios, Pietro-Luciano Buono, Visarath In, Patrick Longhini

Bibliographic record

VenueInternational Journal of Bifurcation and Chaos · 2020
Typearticle
Languageen
FieldComputer Science
TopicNonlinear Dynamics and Pattern Formation
Canadian institutionsUniversité du Québec à Rimouski
FundersOffice of Naval Research
KeywordsScalingNonlinear systemCoupling (piping)PhysicsPhase (matter)Synchronization (alternating current)Reduction (mathematics)Type (biology)Limit (mathematics)Scaling lawStatistical physicsPhase synchronizationMathematical analysisMathematicsQuantum mechanicsTopology (electrical circuits)CombinatoricsGeometry

Abstract

fetched live from OpenAlex

Computational and experimental works reveal that the coupling of similar crystal oscillators leads to a variety of collective patterns, mainly various forms of discrete rotating waves and synchronization patterns, which have the potential for developing precision timing devices through phase drift reduction. Among all observed patterns, the standard traveling wave, in which consecutive crystals oscillate out of phase by [Formula: see text], where [Formula: see text] is the network size, leads to optimal phase drift error that scales down as [Formula: see text] as opposed to [Formula: see text] for an uncoupled ensemble. In this manuscript, we provide an analytical proof of the scaling laws, for uncoupled and coupled symmetric networks, and show that [Formula: see text] is the fundamental limit of phase-error reduction that one can obtain with a symmetric network of nonlinear oscillators of any type, not just crystals.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.009
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.009
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0010.002
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.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.034
GPT teacher head0.310
Teacher spread0.277 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations2
Published2020
Admission routes1
Has abstractyes

Explore more

Same venueInternational Journal of Bifurcation and ChaosSame topicNonlinear Dynamics and Pattern FormationFrench-language works237,207