MétaCan
Menu
Back to cohort
Record W2751041681 · doi:10.1109/iscc.2017.8024562

A cooperative and adaptive resource scheduling for Vehicular Cloud

2017· article· en· W2751041681 on OpenAlexafffund
Rodolfo I. Meneguette, Azzedine Boukerche

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicVehicular Ad Hoc Networks (VANETs)
Canadian institutionsUniversity of Ottawa
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsCloud computingComputer scienceScheduling (production processes)Quality of serviceService (business)Computer networkService qualityResource allocationVehicular ad hoc networkDistributed computingWireless ad hoc networkBusinessTelecommunicationsEngineeringOperations managementWireless

Abstract

fetched live from OpenAlex

A Vehicular Cloud is defined as a set of vehicles that share their computation resources in a cloud. These resources are scheduled on demand based on cooperation between vehicles and the roadside. The biggest challenge in this type of cloud is to create a structure that will manage the service and resource when the cloud does not depend on the roadside infrastructure. Thus, the vehicles need to collaborate with each other to provide services and resources through their embedded resources. To address this challenge, we propose a service scheduling that will manage the requested service and the allocation service to achieve the quality of service requirements, considering the vehicular network characteristics. Simulation results show that the proposed approach achieves a higher service ratio (approximately 95%) with a lack of service of about 5%. Furthermore, the proposed solution achieved an average of 93% when we consider the average service quality and an average of 0,6 second in the service consuming delay.

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.001
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.012
Threshold uncertainty score0.024

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.000
Scholarly communication0.0010.001
Open science0.0020.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.

Opus teacher head0.017
GPT teacher head0.234
Teacher spread0.217 · 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

Citations33
Published2017
Admission routes2
Has abstractyes

Explore more

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