Lag Synchronization of Unknown Chaotic Delayed Yang–Yang-Type Fuzzy Neural Networks With Noise Perturbation Based on Adaptive Control and Parameter Identification
Bibliographic record
Abstract
This paper considers the lag synchronization (LS) issue of unknown coupled chaotic delayed Yang-Yang-type fuzzy neural networks (YYFCNN) with noise perturbation. Separate research work has been published on the stability of fuzzy neural network and LS issue of unknown coupled chaotic neural networks, as well as its application in secure communication. However, there have not been any studies that integrate the two. Motivated by the achievements from both fields, we explored the benefits of integrating fuzzy logic theories into the study of LS problems and applied the findings to secure communication. Based on adaptive feedback control techniques and suitable parameter identification, several sufficient conditions are developed to guarantee the LS of coupled chaotic delayed YYFCNN with or without noise perturbation. The problem studied in this paper is more general in many aspects. Various problems studied extensively in the literature can be treated as special cases of the findings of this paper, such as complete synchronization (CS), effect of fuzzy logic, and noise perturbation. This paper presents an illustrative example and uses simulated results of this example to show the feasibility and effectiveness of the proposed adaptive scheme. This research also demonstrates the effectiveness of application of the proposed adaptive feedback scheme in secure communication by comparing chaotic masking with fuzziness with some previous studies. Chaotic signal with fuzziness is more complex, which makes unmasking more difficult due to the added fuzzy logic.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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 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".