Fault diagnosis for rotor based on multi-sensor information and progressive strategies
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
Abstract Fault diagnosis is an effective tool to ensure safe operation of machinery and avoid serious accidents. As most currently used fault diagnosis methods usually employ mapping relationship established by training samples and their labels to achieve classification of testing samples, it is difficult for them to achieve fault diagnosis under the condition of incomplete training sample types. In addition, previous studies usually focus on feature extraction of single-channel vibration signal, which cannot get complete fault feature information. To solve the above problems, a progressive fault diagnosis method is investigated in this paper. First, the preliminary fault detection for the rotor is performed by studying reconstruction error of a sparse auto-encoder. Second, if a fault exists in the rotor, the outlier detection is implemented by the support vector data description method. Finally, if there are no outlier samples, the well -trained support vector machine is used to confirm the type of fault samples and complete the diagnosis. The performance of the proposed method was verified using the data obtained from a rotor laboratory bench. The types of rotor states investigated include normal, contact-rubbing, unbalance and misalignment. The experimental results verify the effectiveness and superiority of the proposed method in reducing the incidents of fault omission and fault misunderstanding.
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.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| 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