A COMMON PHENOMENON IN CHAOTIC SYSTEMS LINKED BY TIME DELAY * Int. J. Bifurcation Chaos 2006.16:3727-3736. Downloaded from www.worldscientific.com by UNIVERSITY OF WESTERN ONTARIO WESTERN LIBRARIES on 07/24/12. For personal use only.
Bibliographic record
Abstract
In this paper, we report a common phenomenon observed in chaotic systems linked by time delay. Recently, the Lorenz chaotic system has been extended to the family of Lorenz systems which includes the Chen and Lü systems. These three chaotic systems, corresponding to different sets of system parameter values, are topologically different. With the aid of numerical simulations, we have surprisingly found that a simple time delay, directly applied to one or more state variables, transforms the Lorenz system to the generalized Chen system or the generalized Lü system without any parameter changes. The existence of this phenomenon has also been found in other known chaotic systems: the Rössler system, the Chua’s circuit and the 4-Liu system. This finding has shown a common characteristic of chaotic systems: a new chaotic “branch ” can be created from a chaotic attractor by simply adding a time delay. Keywords:Lorenzsystem;Rössler system; Chen system; Chua’s circuit; 4-Liu system; time delay. 1.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".