Online predictive diagnosis of electrical train door systems
Bibliographic record
Abstract
Considering availability purposes for train transportation, passenger accesses (doors and steps) are often designated as critical systems. To improve global availability of its rolling stock, Bombardier Transportation (BT) aims at reinforcing its maintenance procedure by introducing predictive diagnosis. The SURFER project has been initiated to develop online and in-cars tools to early detect and prevent faults. In this paper, an overview of achieved progress with respect to online predictive diagnosis will be introduced. For this purpose, many signals are recorded using a test bench by BT: electrical motor intensity current, door displacement, binary indicators as door closed and locked. The paper focuses on designing a semi-Supervised discriminative probabilistic model that take into account contextual variables (train inclination or constraints due to passengers affluence) to perform a robust predictive diagnosis. The main steps of the proposed method are the followings: the segmentation of the provided signals into opening and closing phases, the extraction of relevant features from opening/closing phases, the setting of the discriminative diagnosis model based on statistical semi-supervised learning. The proposed approach is tested on signals collected from regional trains fleeting around Paris. It allows the earlier detection of anomalies, for instance, those due to maladjustments. The practical implementation of this approach will be detailed together with its preliminary results.
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.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".