A Macro-Scale Generalized Search and Rescue (SAR) Model for the Coastal Regions of Eastern Canada and the Arctic
Bibliographic record
Abstract
Abstract Given the complexity of Search and Rescue (SAR) activities in the coastal regions of Eastern Canada and the Arctic, there is a need to objectively assess system capabilities at a high level to determine the expected rescue time for multiple scenarios and system configurations. This paper outlines a new macro-scale generalized SAR model to simulate the main activities within the SAR system in Eastern Canada and the Arctic. The model uses discrete event simulation to represent the SAR operations and a probabilistic Monte Carlo approach to incorporate uncertainties in performance data for the different components of the system. Algorithms are first developed to identify the major decision-relevant components of SAR response, including the time to interpret emergency notifications and mobilize helicopter resources, the operability of assets in given environmental conditions, and the proximity and capability of resources. Following this, the model is coded in MATLAB, using a time-stepping approach, enabling changes in the scenario, asset status, and system configuration at any time step. Case scenarios are used as initial verification, beginning with a simplistic approach, and building complexity in the model parameters. For this paper, we will discuss simple and complex scenarios which are based on common incident occurrences and SAR system operational details in eastern Canada's coastal regions and the Arctic. We assess the sensitivity of the overall SAR system to various input parameters to better understand how factors such as the Location of Incident (LOI) and number of People in Distress (PID) influence SAR response time in remote coastal areas, as well as the impact of refueling station locations for more distant and longer duration scenarios.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.002 | 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".