MétaCan
Menu
Back to cohort
Record W2163753693 · doi:10.1109/spi.2005.1500943

Time domain reduced order macromodel for interconnects excited by incident fields

2005· article· en· W2163753693 on OpenAlex
T.S. Roseanu, Min Ma, Roni Khazaka, P. Gunupudi

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
TopicElectromagnetic Simulation and Numerical Methods
Canadian institutionsCarleton UniversityMcGill University
Fundersnot available
KeywordsKrylov subspaceSpiceComputer scienceModel order reductionProjection (relational algebra)Time domainReduction (mathematics)Electronic engineeringFrequency domainSubspace topologyEquivalent circuitOrder (exchange)Topology (electrical circuits)AlgorithmMathematicsEngineeringElectrical engineeringIterative method

Abstract

fetched live from OpenAlex

This paper presents an algorithm for reduced order macromodeling of high speed interconnects excited by incident electromagnetic fields. The reduced order macromodel has the form of a passive reduced order network with Norton equivalent sources at the ports representing the incident fields. A projection based order reduction method is presented to efficiently evaluate the Norton equivalent sources and Krylov subspace methods are used to obtain the passive reduced order network. The resulting macromodel is typically an order of magnitude smaller than the original one and can be simulated in standard time domain simulators such as SPICE.

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 categoriesInsufficient payload (model declined to judge)
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.869
Threshold uncertainty score1.000

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.0010.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.009
GPT teacher head0.264
Teacher spread0.255 · 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