Experimental verification of multidirectional multiscroll chaotic attractors
Bibliographic record
Abstract
A systematic methodology for circuit design is proposed for experimental verification of multidirectional multiscroll chaotic attractors, including one-directional (1-D) n-scroll, 2-D n/spl times/m-grid scroll, and 3-D n/spl times/m/spl times/l-grid scroll chaotic attractors. Two typical cases are investigated in detail: the hysteresis and saturated multiscroll chaotic attractors. A simple blocking circuit diagram is designed for experimentally verifying 1-D 5/spl sim/11-scroll, 2-D 3/spl times/5/spl sim/11-grid scroll, and 3-D 3/spl times/3/spl times/5/spl sim/11-grid scroll hysteresis chaotic attractors by manipulating the switchers. Moreover, a block circuitry is also designed for physically realizing 1-D 10, 12, 14-scroll, 2-D 10, 12, 14/spl times/10-grid scroll, and 3-D 10/spl times/10/spl times/10-grid scroll saturated chaotic attractors via switching. In addition, one can easily realize chaotic attractors with a desired odd number of scrolls by slightly modifying the corresponding voltage saturated function series of the circuit, to produce for instance a 1-D 13-scroll saturated chaotic attractor. This is the first time in the literature to report an experimental verification of a 1-D 14-scroll, a 2-D 14/spl times/10-grid scroll and a 3-D 10/spl times/10/spl times/10-grid (totally 1000) scroll chaotic attractors. Only the 3-D case is reported in detail for simplicity of presentation. It is well known that hardware implementation of 1-D n-scroll with n/spl ges/10, 2-D n/spl times/m-grid scroll with n,m/spl ges/10, and 3-D n/spl times/m/spl times/l-grid scroll with n,m,l/spl ges/10 chaotic attractors is very difficult technically, signifying the novelty and significance of the achievements reported in this paper. Finally, this circuit design approach provides some principles and guidelines for hardware implementation of chaotic attractors with a multidirectional orientation and with a large number of scrolls, useful for future circuitry design and engineering applications.
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.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.003 | 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".