MétaCan
Menu
Back to cohort
Record W1615652209 · doi:10.23919/ecc.2013.6669752

Reducing domain structural complexity in PDE backstepping boundary observer design using conformal mapping

2013· article· en· W1615652209 on OpenAlexaff
Reza Banaei Khosroushahi, Horacio J. Marquez

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicStability and Controllability of Differential Equations
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsBacksteppingPartial differential equationObserver (physics)Conformal mapBoundary (topology)Boundary value problemComputer scienceDistributed parameter systemApplied mathematicsHeat equationKernel (algebra)MathematicsMathematical analysisControl theory (sociology)Artificial intelligenceDiscrete mathematicsAdaptive controlPhysics

Abstract

fetched live from OpenAlex

In this paper we study backstepping boundary observer design for a class of distributed parameter systems defined in a cylindrical domain with prescribed boundary conditions. We show that applying standard PDE backstepping boundary observer design results in a hyperbolic PDE with four independent variables which is difficult to solve both numerically and analytically. By introducing a modified domain structure using conformal mapping, we obtain a simplified design process which is reduced to solving a two-dimensional PDE for the kernel function. Finally, we sketch the complete treatment to solve the partial differential equation describing the kernel equation and then perform a simulation study to verify the L2performance of the designed observer. This technique has a direct application in soft-sensor design for internal temperature measurement in systems subjected to dynamic heat distribution, particularly microfluidic Lab-on-a-Chip (LOC) devices.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.001
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.089
GPT teacher head0.253
Teacher spread0.164 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations1
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicStability and Controllability of Differential EquationsFrench-language works237,207