MétaCan
Menu
Back to cohort
Record W2004401440 · doi:10.1002/cjce.20101

Extremum‐seeking control of retention for a microparticulate system

2008· article· en· W2004401440 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.
venuePublished in a venue whose home country is Canada.

Bibliographic record

VenueThe Canadian Journal of Chemical Engineering · 2008
Typearticle
Languageen
FieldEngineering
TopicExtremum Seeking Control Systems
Canadian institutionsQueen's UniversityPolytechnique Montréal
Fundersnot available
KeywordsControl theory (sociology)Controller (irrigation)Adaptive controlComputer scienceStability (learning theory)Control (management)Lyapunov stabilityScheme (mathematics)Control engineeringControl systemLyapunov functionEngineeringMathematicsArtificial intelligenceNonlinear system

Abstract

fetched live from OpenAlex

Abstract The operation of a paper machine relies on the close monitoring and control of several integrated units to ensure a high quality paper with the required specifications. In this paper, the retention control system in the wet‐end of a paper machine is considered. The control objective is to maximize the retention of fines and fibres in the paper sheet to prevent the accumulation of micro particles in the water system. We present an adaptive extremum‐seeking scheme for the optimization and control of retention in the wet‐end of a paper machine. An adaptive learning technique is introduced to construct an algorithm that drives the system to the optimal retention value. Lyapunov's stability theory is used in the design of the extremum‐seeking controller structure and the development of the parameter learning laws. The performance of the technique is illustrated via simulations based on a first‐principles dynamic model developed previously for a micro‐particulate system.

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.913
Threshold uncertainty score0.498

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.011
GPT teacher head0.165
Teacher spread0.154 · 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