MétaCan
Menu
Back to cohort
Record W2293439794 · doi:10.1109/access.2016.2514480

Real-Time Streaming Communication With Optical Codes

2016· article· en· W2293439794 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIEEE Access · 2016
Typearticle
Languageen
FieldComputer Science
TopicBluetooth and Wireless Communication Technologies
Canadian institutionsUniversité du Québec à Chicoutimi
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceCommunication sourceLossy compressionBandwidth (computing)Real-time computingBinary numberCode (set theory)Binary dataProtocol (science)Binary codeForward error correctionChannel (broadcasting)Computer networkAlgorithmDecoding methodsArtificial intelligence

Abstract

fetched live from OpenAlex

Optical codes have long been used to carry small amounts of static data, such as URLs, IDs or other short binary sequences. In this paper, we experiment on the use of sequences of optical codes to form a one-way communication channel. In this context, a sender is made of a surface displaying rapidly changing codes, which are picked up by a receiver's camera and converted back into a binary data stream. After presenting experimental results seeking the combination of frame rate, code size, and error correction level maximizing effective bandwidth, we describe the implementation of a robust communication protocol designed, specifically for lossy, simplex, and low-bandwidth data links. Our findings indicate that such a protocol is sufficient for carrying at least voice-quality audio in real time.

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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.860
Threshold uncertainty score0.708

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.001
Open science0.0040.001
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.023
GPT teacher head0.280
Teacher spread0.257 · 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