Assessment of the performance of the inter-arrival time algorithm to identify ice shattering artifacts in cloud particle probe measurements
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
Abstract. Shattering presents a serious obstacle to current airborne in situ methods of characterizing the microphysical properties of ice clouds. Small shattered fragments result from the impact of natural ice crystals with the forward parts of aircraft-mounted measurement probes. The presence of these shattered fragments may result in a significant overestimation of the measured concentration of small ice crystals, contaminating the measurement of the ice particle size distribution (PSD). One method of identifying shattered particles is to use an inter-arrival time algorithm. This method is based on the assumption that shattered fragments form spatial clusters that have short inter-arrival times between particles, relative to natural particles, when they pass through the sample volume of the probe. The inter-arrival time algorithm is a successful technique for the classification of shattering artifacts and natural particles. This study assesses the limitations and efficiency of the inter-arrival time algorithm. The analysis has been performed using simultaneous measurements of two-dimensional (2-D) optical array probes with the standard and antishattering "K-tips" collected during the Airborne Icing Instrumentation Experiment (AIIE). It is shown that the efficiency of the algorithm depends on ice particle size, concentration and habit. Additional numerical simulations indicate that the effectiveness of the inter-arrival time algorithm to eliminate shattering artifacts can be significantly restricted in some cases. Improvements to the inter-arrival time algorithm are discussed. It is demonstrated that blind application of the inter-arrival time algorithm cannot filter out all shattered aggregates. To mitigate against the effects of shattering, the inter-arrival time algorithm should be used together with other means, such as antishattering tips and specially designed algorithms for segregation of shattered artifacts and natural particles.
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.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 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