MétaCan
Menu
Back to cohort
Record W1497740160

A complex adaptive system based on squirrels behaviors for distributed resource allocation

2006· article· en· W1497740160 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueWeb Intelligence and Agent Systems An International Journal · 2006
Typearticle
Languageen
FieldComputer Science
TopicDistributed and Parallel Computing Systems
Canadian institutionsUniversity of CalgaryUniversity of Manitoba
Fundersnot available
KeywordsComputer scienceScalabilityDistributed computingResource allocationResource (disambiguation)Class (philosophy)Set (abstract data type)Variety (cybernetics)ArchitectureArtificial intelligenceComputer networkDatabase
DOInot available

Abstract

fetched live from OpenAlex

This paper introduces new general-purpose Complex Adaptive System (CAS) algorithms that solve the resource allocation problem in distributed systems. These CAS algorithms are based on squirrel natural behaviors and provide a novel CAS metaphor. The CAS Squirrels system is described together with its associated class architecture. A comprehensive set of experiments is carried to corroborate our hypothesis that CAS Squirrel based algorithms provide a efficient resource allocation on a distributed system. The algorithms are based on squirrel hoarding mechanisms. The scalability and reliability obtained from the experiments are maintained across a wide variety of distributed system characteristics. The research work uses the Peer-to-Peer Distributed File System storage resource allocation problem to validate our hypothesis.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScholarly communication
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.979
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.044
GPT teacher head0.289
Teacher spread0.245 · 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