MétaCan
Menu
Back to cohort
Record W2164616507 · doi:10.1109/tmag.2008.2002779

Sequential Optimization Method for the Design of Electromagnetic Device

2008· article· en· W2164616507 on OpenAlexaff
Gang Lei, K.R. Shao, Youguang Guo, Jianguo Zhu, J.D. Lavers

Bibliographic record

VenueIEEE Transactions on Magnetics · 2008
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Multi-Objective Optimization Algorithms
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsBayesian optimizationComputer scienceTest functions for optimizationKrigingMathematical optimizationSequential analysisProcess (computing)Optimization problemContinuous optimizationFinite element methodDesign of experimentsAlgorithmOptimal designMulti-swarm optimizationMathematicsArtificial intelligenceMachine learning

Abstract

fetched live from OpenAlex

Three sequential optimization methods, sequential least square method, sequential Kriging method, and sequential linear Bayesian method, are presented for the optimization design of electromagnetic device. Sequential optimization method (SOM) is composed of coarse optimization process and fine optimization process. The main purpose of the former is to reduce the design space; while the target of the latter is to update the optimal design parameters. To illustrate the performance of the proposed methods, an analytic test function and the TEAM Workshop Problem 22 are investigated. Experimental results of test function demonstrate that SOM can obtain satisfactory solutions; and practical application illustrates that the number of finite element sample points is less than 1/10 compared with that by direct optimization method, while the optimal results are even better than that by direct optimization method.

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.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.004
Threshold uncertainty score0.014

Distilled classifier scores by category (both heads)

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

Citations50
Published2008
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on MagneticsSame topicAdvanced Multi-Objective Optimization AlgorithmsFrench-language works237,207