MétaCan
Menu
Back to cohort
Record W1930525461 · doi:10.1109/mwscas.1990.140639

Adaptive linearization schemes for weakly nonlinear systems using adaptive linear and nonlinear FIR filters

2002· article· en· W1930525461 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

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Adaptive Filtering Techniques
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsLinearizationNonlinear systemControl theory (sociology)Feedback linearizationPreprocessorTerm (time)Linear systemComputer scienceAdaptive filterVolterra seriesAdaptive systemQuadratic equationMathematicsScheme (mathematics)Applied mathematicsAlgorithmArtificial intelligenceMathematical analysis

Abstract

fetched live from OpenAlex

Three adaptive linearization schemes are proposed. In the first scheme, linearization is performed by canceling nonlinearity at the output of a physical system. In the second, a nonlinear postprocessor is employed to postdistort signals. In the third, a preprocessor is used. The schemes using a postprocessor and a preprocessor are designed for weakly nonlinear systems, whereas the scheme of linearization by cancellation at the output can be applied to problems with stronger nonlinearities. In all three methods, necessary estimates of linear and nonlinear operators are provided by adaptive linear and nonlinear filters. Typical simulation results for a physical system modeled by a Volterra series with a linear term, a quadratic term, and a cubic term are presented and are judged encouraging.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.193
Threshold uncertainty score1.000

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.053
GPT teacher head0.255
Teacher spread0.203 · 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

Quick stats

Citations23
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Adaptive Filtering TechniquesFrench-language works237,207