Enhancing Security and Energy Efficiency of Cyber-Physical Systems using Deep Reinforcement Learning
Bibliographic record
Abstract
In the era of Industry 4.0, achieving both energy efficiency and robust security in Cyber-Physical Systems (CPSs) presents a significant challenge because of the resource requirements and complexity of these systems. This paper presents a novel method to integrate energy efficiency and robust security measures in CPSs. We propose the integration of anomaly detection techniques into the CPSs, to facilitate self-adaptation to changing conditions and threats, thereby enhancing system flexibility and reliability while also optimizing energy consumption. Our approach enhances the flexibility and reliability of CPSs by integrating Deep Reinforcement Learning (DRL) into the MAPE-K (Monitor-Analyze-Plan-Execute with Knowledge) control loop. This integration not only streamlines anomaly detection but also optimizes energy consumption, ensuring efficient and effective management of critical system functions. The outcome is a marked improvement in the adaptive decision-making capabilities of CPSs, leading to heightened security and better energy efficiency across various sectors and applications. This study significantly advances sustainable industrial practices within the Industry 4.0 paradigm, emphasizing the development of CPSs that excel in both energy efficiency and robust security.
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.002 |
| 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".