MétaCan
Menu
Back to cohort
Record W4205114939 · doi:10.2514/6.2022-1761

Ad-hoc Stigmeric Load Balancing

2022· article· en· W4205114939 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

VenueAIAA SCITECH 2022 Forum · 2022
Typearticle
Languageen
FieldComputer Science
TopicTarget Tracking and Data Fusion in Sensor Networks
Canadian institutionsLockheed Martin (Canada)
Fundersnot available
KeywordsComputer scienceLoad balancing (electrical power)Distributed computingComputer networkWireless ad hoc networkBandwidth (computing)ThrashingNode (physics)GridTelecommunicationsEngineeringWireless

Abstract

fetched live from OpenAlex

View Video Presentation: https://doi.org/10.2514/6.2022-1761.vid This paper offers an improvement over previous load balancing research. Previous research proposed a novel algorithm, allowing a network of nodes that track and report entities to rapidly distribute that responsibility with no dedicated command and control messaging or thrashing of responsibility. The assumption and limitation of the previous research is the algorithm assumed a predefined balance point for the network. The predefined balance point could be an equal load by all participants or some other distribution defined as pre-mission data. New research provides a method for a network to balance around the immediate needs of the network, constrained only by the capacity that each participant is available to help at that time while maintaining the favorable convergence and scaling properties of load balancing. This value can be limited by the available sensor timelines or constrained by the node operator. This approach is particularly of interest to networks with a symmetric information exchange scheme where the signal to noise ratio (and hence bandwidth) can change between participants due to range or jamming conditions.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: Not applicable
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.872
Threshold uncertainty score0.847

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.002
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0020.002
Research integrity0.0000.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.008
GPT teacher head0.219
Teacher spread0.211 · 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