Placement of distributed crack sensor on I‐shaped steel girders of medium‐span bridges, using available field data
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
It is critical to detect cracks in steel girders of bridges before they have the potential to compromise the integrity of the structure. Both distributed binary sensors and distributed fiber optic sensors are capable of detecting cracks that are wider than 0.2 mm in steel girders. The objective of this paper is to report the optimum placement of these sensors on the girder to detect smallest possible length of the crack. In this work, the optimized placement of crack sensors was studied using FEM of two typical medium-span simply supported steel girder bridges (Girder A, 30-m–long span, and Girder B, 22-m–long span). Using loads estimated from field monitoring data and FEM, a map of crack opening along the length of the crack was calculated for stable crack lengths. Using these maps and given the detectable crack opening of 0.2 mm, the optimum place to position a distributed crack sensor to detect the smallest crack length was determined. For Girder A, the sensor should be placed at 150 to 250 mm above flange at midspan and at one third from the support, and for the rest of the length of the girder, it should be placed at 200–300 mm above the bottom flange. For Girder B, the optimum placement for installation of binary sensor is estimated to be at 150 to 220 mm above the tension flange. The proposed method of calculation of placement can be used for installation of distributed sensors on other types of bridges.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| 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