A “data-driven uncertainty” computational method to model and predict instabilities of a frictional system
Bibliographic record
Abstract
Abstract Most of the recently developed methods for predicting instabilities of frictional systems couple stochastic algorithms with the finite element method (FEM). They use random variables to model the uncertainty of input parameters through standard probability laws. Regardless of the fact that advanced numerical schemes are available nowadays, a systematic and accurate method to describe finely the uncertainties upstream the model, and thus predict its response is still missing. In this contribution, we present a data-driven stochastic finite element scheme to predict the dynamic behavior of a rubbing system. The proposed framework relies on data-driven approach and uses four steps. In the first, the measured data are integrated directly, for the uncertainty quantification, by means of the random balance design (RBD). In the second step, the generated stochastic data are evaluated in an iterative way to solve friction-induced vibration problem. In the third step, the resulted data are reordered in such a way that the corresponding values of each measured input parameters are ranked in ascending order. Finally, the Fourier spectrum is introduced on the reordered results to compute the sensitivity indices. Thus, instead of Monte Carlo-based formalism or Fourier Amplitude Sensitivity Test (FAST), the computational cost of the proposed method is kept down to $$\mathcal {O}(N)$$ O ( N ) with N the number of samples. We investigate the efficiency of the suggested solver on a reduced brake system. Altogether, the suggested procedure achieves excellent accuracy at a much reduced computational time compared to the methods available in the literature.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".