Detection of Rolling-Element Bearing Faults in Non-stationary Quasi-Parallel Machinery Using Residual Analysis Augmented by Neural Networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This work proposes a methodology for the detection of rolling-element bearing faults in quasi-parallel machinery. In the context of this work, parallel machinery is considered to be any group of identical components of a mechanical system that are linked to operate on the same duty cycle. Quasi-parallel machinery can further be defined as two components not identical mechanically, but their operating conditions are correlated and they operate in the same environmental conditions. Furthermore, a new fault detection architecture is proposed wherein a feed-forward neural network (FFNN) is utilized to identify the relationship between signals. The proposed technique is based on the analysis of a calculated residual between feature vectors from two separate components. This technique is designed to reduce the effects of changes in the machines operating state on the condition monitoring system. When a fault detection system is monitoring multiple components in a larger system that are mechanically linked, signals and information that can be gleaned from the system can be used to reduce influences from factors that are not related to condition. The FFNN is used to identify the relationship between the feature vectors from two quasi-parallel components and eliminate the difference when no fault is present. The proposed method is tested on vibration data from two gearboxes that are connected in series. The gearboxes contain bearings operating at different speeds and gear mesh frequencies. In these conditions, a variety of rolling-element bearing faults are detected. The results indicate that improvement in fault detection accuracy can be achieved by using the additional information available from the quasi-parallel machine. The proposed method is directly compared to a typical AANN novelty detection scheme.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| 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.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it