The Fast Prognosis of Inter-Turn Faults in an Induction Motor
Bibliographic record
Abstract
This paper introduces a novel approach for detecting and prognosing stator inter-turn faults in induction motors, addressing an important aspect of motor health monitoring.The most commonly employed method for fault detection in this context is Motor Current Signature Analysis (MCSA).By leveraging this method, the paper focuses on the generation of periodic Magneto Motive Force (MMF) waves in the balanced current signal as a result of inter-turn faults.These MMF waves serve as crucial indicators for identifying the presence of such faults.To achieve early detection and prognostic capability for inter-turn faults, the paper proposes a numerical model that relies on analyzing the forward and backward currents.This model offers a promising approach to effectively detect and prognose these faults before they escalate into more severe issues.The obtained results from applying the proposed method demonstrate its efficiency in fault detection and prognostic accuracy for stator inter-turn faults.To validate the effectiveness of the proposed approach, an experimental setup is implemented.This setup provides a real-world context for evaluating the performance and reliability of the method in detecting and prognosing inter-turn faults.Through this validation process, the paper strengthens the credibility and applicability of the proposed technique in practical motor maintenance and fault management scenarios.
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.001 | 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.001 | 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 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".