MétaCan
Menu
Back to cohort
Record W2968776414 · doi:10.1109/tcpmt.2019.2933799

Efficient Time-Domain Sensitivity Analysis of Active Networks

2019· article· en· W2968776414 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIEEE Transactions on Components Packaging and Manufacturing Technology · 2019
Typearticle
Languageen
FieldPhysics and Astronomy
TopicModel Reduction and Neural Networks
Canadian institutionsCarleton University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsSensitivity (control systems)PassivityControl theory (sociology)Electronic circuitStability (learning theory)Differential equationMathematicsSet (abstract data type)Computer scienceReduction (mathematics)Topology (electrical circuits)Electronic engineeringEngineeringMathematical analysisGeometryControl (management)

Abstract

fetched live from OpenAlex

The conventional sensitivity analysis based on model-order reduction (MOR) techniques guarantees the passivity and, consequently, the stability of the reduced sensitivity circuit provided that the original circuit is passive. This excludes a large class of circuits that are stable but not necessarily passive. In this article, an efficient MOR method is presented for the sensitivity analysis of active stable circuits. The proposed algorithm preserves the stability of both the original and associated sensitivity equations, and is based on reducing the first-order variational equations in the form of a set of stable multi-input differential equations. The sensitivity equations are decomposed into several subsystems of equations where each subsystem contains a dedicated cluster of inputs, thereby avoiding the significant increase in the size of the reduced model due to increasing the number of inputs.

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: Empirical
Teacher disagreement score0.338
Threshold uncertainty score0.730

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.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.007
GPT teacher head0.215
Teacher spread0.208 · 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