Bibliographic record
Abstract
Purpose The purpose of this paper is to demonstrate that by utilizing the relationship between redundant hardware components, inherent in parallel machinery, vibration-based fault detection methods can be made more robust to changes in operational conditions. This work reports on a study of fault detection on bearings operating in two parallel subsystems that experience identical changes in speed and load. Design/methodology/approach This study was carried out using two identical subsystems that operate on the same duty cycle. The systems were run with both healthy and a variety of common bearing faults. The faults were detected by analyzing the residual between the features of the two vibration signatures from the two subsystems. Findings This work found that by utilizing this relationship in parallel operating machinery the fault detection process can be improved. The study looked at several different types of feature vector and found that, in this case, features based on envelope analysis or autoregressive model work the best, whereas basic statistical features did not work as well. Originality/value The proposed method can be a computationally efficient and simple solution to monitoring non-stationary machinery where there is hardware redundancy present. This method is shown to have some advantages over non-parallel approaches.
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.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 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".