MétaCan
Menu
Back to cohort
Record W2017165170 · doi:10.1504/ijwmc.2010.034214

Programmable agents for efficient topology formation of Bluetooth scatternets

2010· article· en· W2017165170 on OpenAlex
Sergio Gonzalez Valenzuela, Son T. Vuong, Victor C. M. Leung

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

VenueInternational Journal of Wireless and Mobile Computing · 2010
Typearticle
Languageen
FieldComputer Science
TopicBluetooth and Wireless Communication Technologies
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsComputer scienceBluetoothScatternetComputer networkDistributed computingFlexibility (engineering)WirelessScheme (mathematics)PiconetNetwork topologyTopology (electrical circuits)Telecommunications

Abstract

fetched live from OpenAlex

Recent years saw a significant number of efforts aimed at the efficient creation of Scatternets: multi-hop Wireless Personal Area Networks (WPAN) created by means of Bluetooth technology that allows users to seamlessly exchange information. We present a novel solution to the Scatternet formation problem by means of mobile programs that help realise our goal according to a predefined topology formation policy. We argue that this approach offers improved flexibility when compared with existing protocols that employ the message-passing communications model. The effectiveness of our proposed mobile processing scheme is demonstrated through computer simulations.

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.000
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: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.934
Threshold uncertainty score0.299

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.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.014
GPT teacher head0.290
Teacher spread0.276 · 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