Bibliographic record
Abstract
One of the key challenges in conducting dynamic route planning is the process of collecting and disseminating instantaneous travel data in real time. Recent studies are evaluating VANET (Vehicular Ad Hoc Network) and its associated WAVE (Wireless Access in Vehicular Environment) standards to facilitate this process. In these studies, travel data accumulated from vehicle OBUs (on board unit) are shared with other vehicles over DSRC (dedicated short- range communication) medium using centralized or distributed approach. In most studies, data collection and dissemination process are not scalable enough for high density traffic environment. Specifically, with a centralized approach, if traffic management center (TMC) or Road Side Unit (RSU) performs route planning for vehicles, there will be many bidirectional communications between the centralized entity and vehicles, leading to higher channel congestion in heavy traffic areas. With a distributed approach, information shared by other vehicles might not be useful or pertinent for some vehicles, leading to wastage of channel bandwidth. Methods used for data collection also need to be intelligent to count in nontraditional circumstances to achieve accuracy. In this thesis, we have proposed a three tiered architecture for data collection, analysis and dissemination. In addition, 1) we demonstrated the concept of queuing delay at intersection for travel time calculation and developed a hybrid metric that considers average travel time and occupancy rate, 2) we offload the computation of route planning to vehicle OBUs and 3) we developed an algorithm that determines the area of propagation for data that needs to be disseminated. We evaluated the performance of our approach progressively using VEINS, SUMO and OMNET++ simulators.
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.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 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.002 | 0.001 |
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".