MétaCan
Menu
Back to cohort
Record W2098259065 · doi:10.1109/tmtt.2005.858381

An adjoint-based approach to computing time-domain sensitivity of multiport systems described by reduced-order models

2005· article· en· W2098259065 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 Microwave Theory and Techniques · 2005
Typearticle
Languageen
FieldPhysics and Astronomy
TopicModel Reduction and Neural Networks
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsSensitivity (control systems)Time domainWaveformFrequency domainNonlinear systemComputer scienceModel order reductionReduction (mathematics)Domain (mathematical analysis)Projection (relational algebra)AlgorithmElectronic engineeringMathematicsEngineeringTelecommunications

Abstract

fetched live from OpenAlex

This paper describes a new algorithm for obtaining time-domain sensitivity information of large linear networks via projection-based model-order reduction (MOR) techniques. The proposed algorithm enables adjoint-based time-domain sensitivity analysis techniques to be applied to a large network containing multiple linear multiport subnetworks. In addition, the proposed algorithm can also be used to obtain frequency-domain sensitivity information. The efficiency and accuracy of the proposed work is demonstrated through optimizing the time-domain waveforms of a high-speed interconnect circuit with nonlinear terminations.

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: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.743
Threshold uncertainty score0.889

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.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.013
GPT teacher head0.242
Teacher spread0.229 · 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