MétaCan
Menu
Back to cohort
Record W2146107935 · doi:10.1002/acs.820

Identification of dual‐rate systems based on finite impulse response models

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

Bibliographic record

VenueInternational Journal of Adaptive Control and Signal Processing · 2004
Typearticle
Languageen
FieldEngineering
TopicControl Systems and Identification
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsImpulse responseInteger (computer science)Finite impulse responseDual (grammatical number)Identification (biology)Computer scienceNoise (video)System identificationLeast-squares function approximationAlgorithmImpulse (physics)Sampling (signal processing)Parameter identification problemMathematical optimizationControl theory (sociology)MathematicsModel parameterStatisticsArtificial intelligenceData modelingFilter (signal processing)

Abstract

fetched live from OpenAlex

Abstract Two identification algorithms, a least squares and a correlation analysis based, are developed for dual‐rate stochastic systems in which the output sampling period is an integer multiple of the input updating period. The basic idea is to use auxiliary FIR models to predict unmeasurable noise‐free (true) outputs, and then use these and system inputs to identify parameters of underlying fast single‐rate models. The simulation results indicate that the proposed algorithms are effective. 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.001
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.827
Threshold uncertainty score0.450

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.012
GPT teacher head0.227
Teacher spread0.214 · 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