MétaCan
Menu
Back to cohort
Record W2111756068 · doi:10.1142/s0218127406014976

COMPETITIVE MODES AND THEIR APPLICATION

2006· article· en· W2111756068 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

VenueInternational Journal of Bifurcation and Chaos · 2006
Typearticle
Languageen
FieldPhysics and Astronomy
TopicChaos control and synchronization
Canadian institutionsWestern University
Fundersnot available
KeywordsChaoticNonlinear systemComputer scienceSynchronization of chaosSimple (philosophy)Control theory (sociology)Mode (computer interface)Focus (optics)Function (biology)Dynamical systems theoryStatistical physicsMathematicsPhysicsArtificial intelligenceControl (management)

Abstract

fetched live from OpenAlex

We investigate nonlinear dynamical systems from the mode competition point of view, and propose the necessary conditions for a system to be chaotic. We conjecture that a chaotic system has at least two competitive modes (CM's). For a general nonlinear dynamical system, we give a simple, dynamically motivated definition of mode suitable for this concept. Since for most chaotic systems it is difficult to obtain the form of a CM, we focus on the competition between the corresponding modulated frequency components of the CM's. Some direct applications result from the explicit form of the frequency functions. One application is to estimate parameter regimes which may lead to chaos. It is shown that chaos may be found by analyzing the frequency function of the CM's without applying a numerical integration scheme. Another application is to create new chaotic systems using custom-designed CM's. Several new chaotic systems are reported.

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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.481
Threshold uncertainty score0.192

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