MétaCan
Menu
Back to cohort
Record W2125953909 · doi:10.1109/22.898983

Efficient sensitivity analysis of transmission-line networks using model-reduction techniques

2000· article· en· W2125953909 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 · 2000
Typearticle
Languageen
FieldPhysics and Astronomy
TopicModel Reduction and Neural Networks
Canadian institutionsCarleton University
Fundersnot available
KeywordsSensitivity (control systems)Reduction (mathematics)Transmission lineModel order reductionWaveformElectric power transmissionLossy compressionElectronic engineeringAlgorithmSubspace topologyVoltageTransmission (telecommunications)Computer scienceTransformation (genetics)MathematicsTopology (electrical circuits)EngineeringTelecommunicationsMathematical analysisElectrical engineering

Abstract

fetched live from OpenAlex

An efficient algorithm, based on congruent transformation and model reduction, is proposed for evaluation of frequency- and time-domain sensitivity of large linear networks containing lossy coupled transmission lines. The sensitivity of the voltage and current waveforms can be calculated with respect to lumped components and parameters of transmission lines. The algorithm is based on projecting the adjoint network equations on a reduced-order subspace that preserves the circuit moments. The proposed algorithm provides a significant decrease in the computational expense for sensitivity analysis.

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.628
Threshold uncertainty score0.896

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.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.014
GPT teacher head0.264
Teacher spread0.251 · 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