Analysis and Prediction of Airfield Area Conflict Risk Under Dynamic Time‐Varying Network
Bibliographic record
Abstract
To ensure the safety of operations in the airfield area, it is crucial to address the increased conflict risks resulting from the growing number of vehicles and aircraft. Based on the complex network theory, this study takes aircraft and vehicles in the airfield area as nodes and selects five different indicators (average degree, average node weight, average weighted clustering coefficient, network density, and network efficiency) to characterize the operation state of the airfield area, so as to identify conflict risks. Building on this framework, an ATT‐Bi‐LSTM innovation prediction model based on LSTM network architecture is established to forecast the evolution of network indicators over time. By leveraging the algorithm to predict the temporal evolution of indicators, valuable insights into the future evolution of conflict risk can be gleaned from the prediction results. Real operational data from Xi’an Xianyang Airport are utilized as a demonstrative example in this study. The results of the experiments illustrate that the analytical approach proposed in this study achieves a precise identification of the indicators. The experimental results are then compared with data from other predictive models that operate on the same data set. Compared to alternative prediction models, the accuracy is increased by nearly 10%, reaching 89.78%. The results of the study help to accurately identify conflict risks in the airfield area in advance and provide strategic conflict avoidance strategies for relevant staff. This is essential to ensure the security of airfield area.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".