A cyber process control system based on pattern recognition and cloud computing
Bibliographic record
Abstract
Abstract: This paper presents a novel simulation model of the Cyber Process Control System (CPCS) by combining pattern recognition and Cloud Computing (CC). This paper's originality arises from its aim to build a cloud computing platform for autonomous machines, and the exploration of manufacturing data to generate interpretable patterns to be used in process control decision making. The combining of Cloud technology and machine learning brings production to Industry 4.0. The proposed system is tested using data Carbon Fiber Reinforced Polymer (CFRP) routing process. The little information available about the manufacturing process of this type of material and the interaction between the production steps makes the manufacturing process quite difficult. This system generates interpretable rules of controllable operating parameters sent to the controller to keep the machining process within the limits of the specifications. The second step is activated during the drifting conditions in the machining step. Also, the simulation of the machining process is illustrated to generate the relations between input and output variables of the machining process. The findings of the corrective actions are illustrated and the interaction between the two industrial steps is simulated. Finally, current and future CPCS and CC applications in Industry 4.0 are discussed.
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.001 |
| 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.004 | 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".