MétaCan
Menu
Back to cohort
Record W2156662737 · doi:10.1109/tcad.2010.2090065

Transient Simulation of Distributed Networks Using Delay Extraction Based Numerical Convolution

2011· article· en· W2156662737 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 Computer-Aided Design of Integrated Circuits and Systems · 2011
Typearticle
Languageen
FieldPhysics and Astronomy
TopicLightning and Electromagnetic Phenomena
Canadian institutionsWestern University
Fundersnot available
KeywordsConvolution (computer science)Transient (computer programming)Frequency domainComputer scienceAlgorithmTime domainNonlinear systemFourier transformFast Fourier transformOverlap–add methodPiecewise linear functionPiecewiseComputer simulationInverseMathematicsMathematical analysisFourier analysisSimulationGeometryPhysicsArtificial intelligence

Abstract

fetched live from OpenAlex

This paper presents a numerical convolution based approach for transient simulation of distributed networks characterized by band limited frequency domain data when terminated with arbitrary nonlinear circuits. The proposed algorithm uses time-frequency decompositions to extract multiple propagation delays of a distributed network and the associated attenuation losses in a piecewise manner, and implements inverse fast Fourier transform to efficiently convert the frequency response into a sum of delayed time domain responses. Numerical examples illustrate that the proposed algorithm shows significantly more accurate results for networks with multiple long delays when compared to existing numerical convolution techniques.

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: none
Teacher disagreement score0.891
Threshold uncertainty score0.816

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.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.044
GPT teacher head0.243
Teacher spread0.199 · 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