Resilient Synchronization for Insecure Markovian Jump Neural Networks to Mitigate Dual Cyber Attacks
Bibliographic record
Abstract
This study proposes a resilient asynchronous controller for Markovian jump neural networks, which can be impervious to the dual cyber attacks that act on actuators and sensors. The complicated occasions of uncertain system modes, actuator and sensor attacks, and unknown attack information are all considered. It is known that sensor attacks can generate corrupted signals to destroy the controller, and actuator attacks can maliciously tamper with the control signals. Mindful of such circumstances, a resilient controller is developed to defend against actuator and sensor attacks as well as to guarantee good synchronization performances. To overcome the unknowns of the occurred attacks, some new adaptive laws for adjusting attack parameters are introduced into the controller to assist with offsetting attack-induced influences. Under the designed controller, the synchronization error dynamic system is proven to be ultimately bounded within a known region, and then the obtained results are extended to address some other cases. Furthermore, a practical example of an analog resistance-capacitance network circuit and some comparative studies are demonstrated to verify the feasibility and superiority of the proposed controller.
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.000 | 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.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".