A Novel Damage Detection Algorithm using Time-Series Analysis-Based Blind Source Separation
Bibliographic record
Abstract
In this paper, a novel damage detection algorithm is developed based on blind source separation in conjunction with time-series analysis. Blind source separation (BSS), is a powerful signal processing tool that is used to identify the modal responses and mode shapes of a vibrating structure using only the knowledge of responses. In the proposed method, BSS is first employed to estimate the modal response using the vibration measurements. Time-series analysis is then performed to characterize the mono-component modal responses and successively the resulting time-series models are utilized for one-step ahead prediction of the modal response. With the occurrence of newer measurements containing the signature of damaged system, a variance-based damage index is used to identify the damage instant. Once the damage instant is identified, the damaged and undamaged modal parameters of the system are estimated in an adaptive fashion. The proposed method solves classical damage detection issues including the identification of damage instant, location as well as the severity of damage. The proposed damage detection algorithm is verified using extensive numerical simulations followed by the full scale study of UCLA Factor building using the measured responses under Parkfield earthquake.
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 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.001 | 0.000 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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 teacher head, 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".