MétaCan
Menu
Back to cohort
Record W2759142102

EM-driven multi-objective design of impedance transformers by pareto ranking bisection algorithm

2017· article· en· W2759142102 on OpenAlex
Adrian Bekasiewicz, Sławomir Kozieł, Qingsha S. Cheng, J.W. Bandler

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

Venue2017 International Applied Computational Electromagnetics Society Symposium (ACES) · 2017
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Multi-Objective Optimization Algorithms
Canadian institutionsMcMaster University
Fundersnot available
KeywordsBisectionTransformerMulti-objective optimizationBisection methodPareto principleMathematical optimizationPareto optimalAlgorithmImpedance matchingMathematicsElectrical impedanceRanking (information retrieval)Matching (statistics)Computer scienceEngineeringArtificial intelligenceStatisticsVoltage
DOInot available

Abstract

fetched live from OpenAlex

In the paper, the problem of fast multi-objective optimization of compact impedance matching transformers is addressed by utilizing a novel Pareto ranking bisection algorithm. It approximates the Pareto front by dividing line segments connecting the designs found in the previous iterations, and refining the obtained candidate solutions by means of poll-type search involving Pareto ranking. The final Pareto set is obtained using surrogate-based optimization techniques. Our approach is validated using a compact impedance matching transformer and compared to state-of-the-art surrogate-assisted techniques.

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 categoriesMeta-epidemiology (narrow)
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.308
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.001
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0020.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.013
GPT teacher head0.267
Teacher spread0.254 · 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