MétaCan
Menu
Back to cohort
Record W2103231026 · doi:10.1109/temc.2009.2019763

Introducing Nonuniform Grids into the FDTD Solution of the Transmission-Line Equations by Renormalizing the Per-Unit-Length Parameters

2009· article· en· W2103231026 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 Electromagnetic Compatibility · 2009
Typearticle
Languageen
FieldEngineering
TopicElectromagnetic Simulation and Numerical Methods
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsFinite-difference time-domain methodDiscretizationGridTransmission lineMathematical analysisMathematicsTransmission (telecommunications)Finite difference methodMathematical optimizationApplied mathematicsComputer scienceGeometryPhysicsOpticsTelecommunications

Abstract

fetched live from OpenAlex

A challenging aspect of using the finite-difference time-domain (FDTD) method to solve nonuniform transmission-line equations is to choose a discretization grid with an adequate spatial resolution. When the per-unit-length parameters have strong variations, an efficient problem-solving strategy requires the use of a nonuniform discretization grid. This paper presents a nonuniform gridding method that makes use of an analytically defined coordinate transformation to map a nonuniformly spaced grid onto a uniformly spaced grid where the standard FDTD time stepping equations can be applied. This approach absorbs all the details of the nonuniform grid into effective or renormalized per-unit-length parameters.

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 categoriesnone
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.598
Threshold uncertainty score0.738

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.001
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.001
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.259
Teacher spread0.244 · 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