MétaCan
Menu
Back to cohort
Record W2752339956 · doi:10.1109/aim.2017.8014247

Cavity resonator tuning using perturbation-based extremum seeking control

2017· article· en· W2752339956 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
FieldEngineering
TopicExtremum Seeking Control Systems
Canadian institutionsTRIUMFSimon Fraser UniversityUniversity of British Columbia
Fundersnot available
KeywordsTunerResonatorControl theory (sociology)Perturbation (astronomy)Reflection (computer programming)PhysicsComputer scienceOpticsRadio frequencyControl (management)

Abstract

fetched live from OpenAlex

Perturbation-based extremum seeking (ES) is a non model-based approach to maximize or minimize the output of a dynamic system without requiring any explicit information about the dynamics of the system, steady state map, or the value of the extremum. In this work, perturbation-based ES is used to minimize power reflection from a cavity resonator in order to provide maximum accelerating field for particles travelling through the cavity. Power reflection is minimized by equalizing the frequency of the cavity and RF source. The controller sends commands to a step motor setup connected to the cavity. The step motor moves the tuner plate which changes the frequency of the cavity. Simulation and experimental results are presented which indicate that the algorithm can successfully minimize power reflection despite variations in the value of the minimum.

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.001
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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.962
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0000.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.023
GPT teacher head0.242
Teacher spread0.219 · 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

Quick stats

Citations0
Published2017
Admission routes1
Has abstractyes

Explore more

Same topicExtremum Seeking Control SystemsFrench-language works237,207