MétaCan
Menu
Back to cohort

Adaptive Q-leaming-supported Resource Allocation Model in Vehicular Fogs

2022· article· en· W4312235499 on OpenAlexaff
Md Tahmid Hossain, Robson E. De Grande

Bibliographic record

Venue2022 IEEE Symposium on Computers and Communications (ISCC) · 2022
Typearticle
Languageen
FieldEngineering
TopicTransportation and Mobility Innovations
Canadian institutionsBrock University
Fundersnot available
KeywordsComputer scienceReinforcement learningDistributed computingResource allocationCloud computingCloudletResource management (computing)Vehicular ad hoc networkQuality of serviceResource (disambiguation)FogCompromiseComputer networkWirelessWireless ad hoc networkArtificial intelligenceTelecommunications

Abstract

fetched live from OpenAlex

Vehicular Cloud Computing (VCC) exhibits many drawbacks with the demands of vehicular applications and intermittent network conditions. Vehicular Fog computing is a novel method for supporting and promoting the effective sharing of services and resources in urban areas. Diverse works on vehicular resource management have sought to handle the very dynamic vehicular environment using various methods, such as policy-based greedy and stochastic techniques. Nevertheless, high vehicular mobility poses many issues that compromise service consistency, efficiency, and quality. Adaptive vehicular Fogs incorporating Reinforcement Learning can deal with mobility and correctly distribute services and resources across all Fogs. Thus, we introduce an adaptive resource management model using cloudlet dwell time for resource estimation, mathematical formula for Fog selection, and reinforcement learning for iterative review and feedback mechanism for generating optimal resource allocation policy.

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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.019
Threshold uncertainty score0.039

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.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0020.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.018
GPT teacher head0.224
Teacher spread0.205 · 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
GenreMethods

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

Citations1
Published2022
Admission routes1
Has abstractyes

Explore more

Same venue2022 IEEE Symposium on Computers and Communications (ISCC)Same topicTransportation and Mobility InnovationsFrench-language works237,207