MétaCan
Menu
Back to cohort
Record W2540934986 · doi:10.1016/j.procs.2016.09.356

Epidemiology-based Task Assignment Algorithm for Distributed Systems

2016· article· en· W2540934986 on OpenAlexafffund
Parth Brahmbhatt, Sergio Camorlinga

Bibliographic record

VenueProcedia Computer Science · 2016
Typearticle
Languageen
FieldComputer Science
TopicOpportunistic and Delay-Tolerant Networks
Canadian institutionsUniversity of Winnipeg
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceTask (project management)Context (archaeology)PopulationTask analysisAssignment problemDistributed computingMachine learningArtificial intelligenceMedicineMathematical optimization

Abstract

fetched live from OpenAlex

OBJECTIVE: Design task assignment algorithms based on the patterns of disease spread among the population. SCOPE: Epidemiology studies spatiotemporal patterns of illness in populations and the factors affecting it. An epidemic emerges out of the population activities and environment. Task assignment is a common activity in many realms where sub-tasks are created, delegated, and collectively carried out to achieve the original task. Due to its complexity and context, task assignment can be a challenging activity that can result in limited outcomes. This research studies task assignment as an epidemic assigned to a distributed system. We have developed computational models to understand the outbreak of aerosol-borne diseases by using the agent-based modelling approach. Experiments are carried out to observe the patterns of emergence during the spread of disease among the individuals and get insights of their mechanisms. These mechanisms are used to design algorithms for task assignment on distributed systems. RESULTS: Understanding the emergent behaviour of diseases can provide the platform for the development of distributed algorithms that can be helpful in overcoming some of the challenges of task assignment in a distributed system.

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.002
metaresearch head score (Gemma)0.008
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.004
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

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

Opus teacher head0.036
GPT teacher head0.271
Teacher spread0.235 · 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
Published2016
Admission routes2
Has abstractyes

Explore more

Same venueProcedia Computer ScienceSame topicOpportunistic and Delay-Tolerant NetworksFrench-language works237,207