MétaCan
Menu
Back to cohort
Record W1573410078 · doi:10.1109/iscas.1999.777576

Sensitivity analysis of periodically switched linear circuits using an adjoint network technique

2003· article· en· W1573410078 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMatrix Theory and Algorithms
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsPhasorSensitivity (control systems)Electronic circuitBasebandPSLFrequency domainRLC circuitMathematicsNetwork analysisLinear circuitTopology (electrical circuits)Electronic engineeringComputer scienceEquivalent circuitBandwidth (computing)EngineeringTelecommunicationsMathematical analysisPhysicsElectrical engineering

Abstract

fetched live from OpenAlex

An adjoint network-based frequency-domain method for sensitivity analysis of periodically switched linear (PSL) circuits is presented. The incremental form of Tellegen's theorem for PSL circuits in phasor domain is introduced and the closed form expressions of frequency-domain sensitivity of PSL circuits are obtained. The method yields sensitivities with respect to all circuit elements in one frequency analysis. It is shown that both the baseband and sideband components of the network variables contribute to the baseband sensitivity. It is also demonstrated that the sensitivity of linear time-invariant (LTI) circuits is a special case of that of general PSL circuits. Numerical results computed using the proposed method are compared with those from other CAD tools.

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.002
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: Methods · Consensus signal: none
Teacher disagreement score0.761
Threshold uncertainty score0.453

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.002
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.025
GPT teacher head0.267
Teacher spread0.242 · 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

Quick stats

Citations5
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicMatrix Theory and AlgorithmsFrench-language works237,207