MétaCan
Menu
Back to cohort
Record W2066035964 · doi:10.1145/2810379.2810383

Vehicular Cloud

2015· article· en· W2066035964 on OpenAlexaff
Tao Zhang, Robson E. De Grande, Azzedine Boukerche

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicVehicular Ad Hoc Networks (VANETs)
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsCloud computingComputer scienceQueueing theoryRange (aeronautics)Traffic flow (computer networking)Set (abstract data type)Vehicular ad hoc networkDistributed computingMicroscopic traffic flow modelComputer networkReal-time computingTraffic generation modelWireless ad hoc networkTelecommunicationsEngineering

Abstract

fetched live from OpenAlex

Considerable attention has been assigned to Vehicular Cloud towards identifying methods to utilize under-used, available computing and physical resources of vehicles effectively. Most work on vehicular cloud is so far on the taxonomy definition level, and the dynamically changing amount of available resources characterizes vehicular cloud as more cumbersome and complex than the traditional Clouds. In this paper, we define and analyze the expected number of vehicles in a roadway segment. These vehicles can serve as the building blocks for the vehicular cloud, enabling a tremendously large set of applications that benefit the whole traffic system. To contribute with the analysis, two types of traffic scenarios are considered in this work. We use a macroscopic traffic model to investigate the free-flow traffic, and we utilize the queuing theory to observe the queuing-up traffic. The average number of vehicles within a roadway segment is calculated using stochastic models. The results show the boundaries on enabling vehicular cloud, allowing to determine a range of parameters for simulating vehicular clouds.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.011
Threshold uncertainty score0.038

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.002
Science and technology studies0.0010.000
Scholarly communication0.0030.002
Open science0.0020.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0110.006

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.

Opus teacher head0.015
GPT teacher head0.201
Teacher spread0.185 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations28
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicVehicular Ad Hoc Networks (VANETs)French-language works237,207