New type of chaos synchronization in discrete-time systems: the F-M synchronization
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.
Bibliographic record
Abstract
Abstract In this paper, a new type of synchronization for chaotic (hyperchaotic) maps with different dimensions is proposed. The novel scheme is called F – M synchronization, since it combines the inverse generalized synchronization (based on a functional relationship F ) with the matrix projective synchronization (based on a matrix M ). In particular, the proposed approach enables F – M synchronization with index d to be achieved between n -dimensional drive system map and m -dimensional response system map, where the synchronization index d corresponds to the dimension of the synchronization error. The technique, which exploits nonlinear controllers and Lyapunov stability theory, proves to be effective in achieving the F – M synchronization not only when the synchronization index d equals n or m , but even if the synchronization index d is larger than the map dimensions n and m . Finally, simulation results are reported, with the aim to illustrate the capabilities of the novel scheme proposed herein.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it