MétaCan
Menu
Back to cohort
Record W2018151558 · doi:10.1109/tap.2012.2186237

A Memory-Efficient Implementation of TLM-Based Adjoint Sensitivity Analysis

2012· article· en· W2018151558 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

VenueIEEE Transactions on Antennas and Propagation · 2012
Typearticle
Languageen
FieldEngineering
TopicElectromagnetic Simulation and Numerical Methods
Canadian institutionsMcMaster University
Fundersnot available
KeywordsSensitivity (control systems)Lossy compressionClassification of discontinuitiesComputer scienceTransmission (telecommunications)Transmission lineComputer data storageAlgorithmElectronic engineeringMathematicsComputer hardwareMathematical analysisTelecommunications

Abstract

fetched live from OpenAlex

We present a memory efficient algorithm for the estimation of adjoint sensitivities with the 2D transmission line modeling (TLM) method. The algorithm is based on manipulating the local scattering matrices to reduce the required storage for the original structure simulation associated with lossy dielectric discontinuities. Only one value per cell is stored for two dimensional simulations. Moreover, the connection step for the scattered sensitivity storage is embedded during the adjoint simulation and the sensitivity estimates are calculated on the fly. The required memory storage for our implementation is only 10% of the original implementation of AVM sensitivity with TLM.

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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.595
Threshold uncertainty score0.361

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.001
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.015
GPT teacher head0.277
Teacher spread0.263 · 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