Mitigation of Radiation-Induced Fiber Bragg Grating (FBG) Sensor Drifts in Intense Radiation Environments Based on Long-Short-Term Memory (LSTM) Network
Bibliographic record
Abstract
This paper reports in-pile testing results of radiation-resistant fiber Bragg grating (FBG) sensors at high temperatures, intense neutron irradiation environments, and machine learning methods for radiation-induced sensor drift mitigation and reactor anomaly identification. The in-pile testing of fiber sensors was carried out in an MIT test reactor for 180 days at a nominal operational temperature of 640°C and high neutron flux. The test results show that FBG sensors inscribed by a femtosecond laser in random airline pure silica fiber can withstand harsh environments in the reactor core but exhibit significant radiation-induced drifts. Machine learning algorithms based on long short-term memory (LSTM) networks have been used to detect reactor anomaly events and mitigate sensor drifts over a duration of up to 85 days. Through progressive supervised learning, the LSTM neural network can achieve FBG wavelength-to-temperature mapping within ±0.95°C, ±2.63°C and ±6.49°C with over 80.2%, 90%, and 95% levels of accuracy confidence, respectively. The LSTM can also identify reactor anomaly samples with an accuracy of over 94%. The results presented in this paper show that despite sensor drifts and anomaly interruptions, the LSTM-based method can effectively elucidate data harnessed by fiber sensors. Machine learning algorithms have the potential to improve situational awareness and control for a wide range of harsh environment applications, including nuclear power generation.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 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 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".