MétaCan
Menu
Back to cohort
Record W4206456390 · doi:10.1109/tap.2021.3137179

On the Formulation and Implementation of the Love’s Condition Constraint for the Source Reconstruction Method

2021· article· en· W4206456390 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIEEE Transactions on Antennas and Propagation · 2021
Typearticle
Languageen
FieldEngineering
TopicGeophysical Methods and Applications
Canadian institutionsUniversity of Manitoba
FundersNatural Sciences and Engineering Research Council of CanadaUniversity of Manitoba
KeywordsComputer scienceConstraint (computer-aided design)Mathematical optimizationCalculus (dental)MathematicsGeometry

Abstract

fetched live from OpenAlex

The formulation and implementation of the Love’s condition constraint for the source reconstruction method (SRM) in near-field antenna measurements are analyzed in the context of inverse problems. To this end, the SRM is first analyzed to identify the nonunique or nonradiating (NR) current sources which may be present. Next, the advantages and disadvantages of general regularization techniques, which may address the NR currents, are presented which serve to motivate the use of the Love’s condition constraint. The main methods of formulating the constraint are then presented, one of which is a novel technique developed for this article. Following this, the formulation methods are analyzed in order to predict the similarities and differences of the methods in the context of addressing the NR currents of the SRM. This analysis is reinforced by simulated antenna measurements. In particular, the novel formulation method is demonstrated to provide a greater regularizing effect (in the examples considered), at the cost of computational complexity.

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: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.871
Threshold uncertainty score0.201

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.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.017
GPT teacher head0.285
Teacher spread0.268 · 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