MétaCan
Menu
Back to cohort
Record W2790363005 · doi:10.1109/tie.2018.2807413

Development of Reduced Preisach Model Using Discrete Empirical Interpolation Method

2018· article· en· W2790363005 on OpenAlexaff
Zhi Li, Jinjun Shan, Ulrich Gabbert

Bibliographic record

VenueIEEE Transactions on Industrial Electronics · 2018
Typearticle
Languageen
FieldMaterials Science
TopicMagnetic Properties and Applications
Canadian institutionsYork University
FundersNational Natural Science Foundation of ChinaAlexander von Humboldt-Stiftung
KeywordsInterpolation (computer graphics)RelaySuperposition principleHysteresisComputationControl theory (sociology)Computer scienceReduction (mathematics)MathematicsAlgorithmPhysicsMathematical analysisArtificial intelligence

Abstract

fetched live from OpenAlex

The Preisach model, which is constructed by the superposition of relay operators, is one of the most popular hysteresis models to describe the hysteresis nonlinearities in smart-materials-based actuators. The application of the Preisach model suffers from the tradeoff between the model accuracy and the number of the relay operators. With a large number of relay operators, the Preisach model can predict the hysteretic effect very precisely; however, a large number of relay operators may lead to a heavy computation burden. To deal with this tradeoff, in this paper, a model order reduction method, namely discrete empirical interpolation method, is applied to reduce the number of the relay operators and meanwhile to preserve the model accuracy of the original Preisach model. Simulations under different conditions (different input signals and different density functions) and experimental tests on a magnetostrictive-actuated platform are conducted to validate the effectiveness of the proposed reduced Preisach model.

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.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation 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: Methods · Consensus signal: Methods
Teacher disagreement score0.005
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0020.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.001

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.123
GPT teacher head0.359
Teacher spread0.236 · 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 designSimulation or modeling
Domainnot available
GenreMethods

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

Citations40
Published2018
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Industrial ElectronicsSame topicMagnetic Properties and ApplicationsFrench-language works237,207