MétaCan
Menu
Back to cohort
Record W2122056900 · doi:10.1002/acs.828

Least squares based self‐tuning control of dual‐rate systems

2004· article· en· W2122056900 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

VenueInternational Journal of Adaptive Control and Signal Processing · 2004
Typearticle
Languageen
FieldEngineering
TopicAdvanced Control Systems Optimization
Canadian institutionsUniversity of Alberta
FundersNatural Sciences and Engineering Research Council of CanadaNational Natural Science Foundation of China
KeywordsControl theory (sociology)Rate of convergenceDual (grammatical number)Convergence (economics)Transformation (genetics)Tracking errorMathematical optimizationInteger (computer science)Computer scienceSampling (signal processing)MathematicsControl (management)Key (lock)Telecommunications

Abstract

fetched live from OpenAlex

Abstract A polynomial transformation technique is used to obtain a frequency‐domain model for a dual‐rate system in which the output sampling period is an integer multiple of the input updating period. Based on this model, a self‐tuning control algorithm is proposed by minimizing output tracking error criteria from directly the dual‐rate input–output data. Convergence properties of the algorithm are analysed in detail in the stochastic framework. The output tracking error at the output sampling instants has the property of minimum variance. It is shown that the control algorithm can achieve virtually optimal control asymptotically, ensuring the closed‐loop systems to be stable and globally convergent. A simulation example illustrates the self‐tuning scheme presented. Copyright © 2004 John Wiley & Sons, Ltd.

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

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.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.007
GPT teacher head0.211
Teacher spread0.204 · 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