MétaCan
Menu
Back to cohort
Record W4384159314 · doi:10.5954/icarob.2023.os7-3

Design of a Database-Driven Control System for a Web Conveyor

2023· article· en· W4384159314 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.

fundA Canadian funder is recorded on the work.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueProceedings of International Conference on Artificial Life and Robotics · 2023
Typearticle
Languageen
FieldEngineering
TopicIndustrial Automation and Control Systems
Canadian institutionsnot available
FundersJapan Society for the Promotion of ScienceUniversity of TokushimaUniversity of Alberta
KeywordsDatabaseComputer scienceDatabase designWeb applicationWorld Wide Web

Abstract

fetched live from OpenAlex

Web Conveyor used in the processing of plastic films and other materials is a large-scale system consisting of multiple drive rolls, and it is difficult to understand the system characteristics during driving.This paper proposes a databasedriven control scheme based on the FRIT scheme to implement motor control of this conveyor without system identification.To reduce the computational cost, the concept of database design based on similarity is introduced.The web conveyor's operating output can quickly achieve a reference signal, because it can be based on a database that holds operational data.

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.942
Threshold uncertainty score0.402

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.0000.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.074
GPT teacher head0.266
Teacher spread0.192 · 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