MétaCan
Menu
Back to cohort
Record W2140060924 · doi:10.1109/acc.2011.5990970

Derivation of an optimal boundary layer width for the smooth variable structure filter

2011· article· en· W2140060924 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
FieldComputer Science
TopicTarget Tracking and Data Fusion in Sensor Networks
Canadian institutionsMcMaster University
Fundersnot available
KeywordsSmoothingControl theory (sociology)Boundary (topology)Kalman filterCovarianceNoise (video)Boundary layerSubspace topologyFilter (signal processing)Covariance matrixMathematicsVariable (mathematics)Computer scienceMathematical analysisAlgorithmPhysics

Abstract

fetched live from OpenAlex

In this paper, an augmented form of the smooth variable structure filter (SVSF) is proposed. The SVSF is a state estimation strategy based on variable structure and sliding mode concepts. It uses a smoothing boundary to remove chattering (excessive switching along an estimated state trajectory). In its current form, the SVSF defines the boundary layer by an upper-bound on the uncertainties present in the estimation process (i.e., modeling errors, magnitude of noise, etc.). This is a conservative approach as one would be limiting the gain by assuming a larger smoothing boundary subspace than what is necessary. A more well-defined boundary layer will yield more accurate estimates. This paper derives a solution for an optimal boundary layer width by minimizing the trace of the a posteriori covariance matrix. The results of the derivation are simulated on a linear mechanical system for the purposes of control, and compared with the Kalman filter.

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: Methods · Consensus signal: Methods
Teacher disagreement score0.771
Threshold uncertainty score0.498

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.0010.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.035
GPT teacher head0.243
Teacher spread0.208 · 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