Software Escalation Prediction Based on Deep Learning in the Cognitive Internet of Vehicles
Bibliographic record
Abstract
In the Cognitive Internet of Vehicles (CIoV), vehicles, road side units (RSU) and other key nodes have been equipped with more and more software to support intelligent transportation system (ITS), vehicle automatic control and intelligent road information services. Additionally, technological innovation forces the software in the CIoV to update and upgrade in time. However, escalation is critical to the safety, stability, and maintenance cost of transportation systems. It can be assumed that when the intelligent services supporting CIoV can realize self-perception and escalation, the cognitive ability and coordination ability of the entire CIoV will be greatly improved. To address this, we first propose a deep learning-based method for Software Escalation Prediction (SEP) in CIoV. Specifically, the pretraining mechanism of transformers in the field of natural language processing is combined with software upgrade-related events to dynamically model software sequence activities. To capture the event association in the software activities, we use graph modeling software’s state log and utilize a graph neural network (GNN) to learn the complex life activity rule of software. Finally, the above characteristics are deeply integrated. The proposed method has a 6%–8% improvement over the RoBERTa methods.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| 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".