MétaCan
Menu
Back to cohort
Record W2147793011 · doi:10.1002/acs.699

Adaptive control of Burgers' equation with unknown viscosity

2001· article· en· W2147793011 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 · 2001
Typearticle
Languageen
FieldEngineering
TopicStability and Controllability of Differential Equations
Canadian institutionsDalhousie University
Fundersnot available
KeywordsBurgers' equationViscosityLemma (botany)Lyapunov functionControl theory (sociology)A priori and a posterioriAdaptive controlMathematicsBoundary (topology)Adaptation (eye)Control (management)Computer scienceApplied mathematicsMathematical analysisPartial differential equationNonlinear systemArtificial intelligencePhysics

Abstract

fetched live from OpenAlex

Abstract In this paper, we propose a fortified boundary control law and an adaptation law for Burgers' equation with unknown viscosity, where no a priori knowledge of a lower bound on viscosity is needed. This control law is decentralized, i.e., implementable without the need for central computer and wiring. Using the Lyapunov method, we prove that the closed‐loop system, including the parameter estimator as a dynamic component, is globally H 1 stable and well posed. Furthermore, we show that the state of the system is regulated to zero by developing an alternative to Barbalat's Lemma which cannot be used in the present situation. Copyright © 2001 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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.838
Threshold uncertainty score0.574

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.015
GPT teacher head0.222
Teacher spread0.207 · 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