MétaCan
Menu
Back to cohort
Record W2164855315 · doi:10.1109/81.847874

Efficient capacitance extraction computations in wavelet domain

2000· article· en· W2164855315 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 Circuits and Systems I Fundamental Theory and Applications · 2000
Typearticle
Languageen
FieldComputer Science
TopicImage and Signal Denoising Methods
Canadian institutionsCarleton University
Fundersnot available
KeywordsSpeedupWaveletAlgorithmCapacitanceComputationThresholdingMatrix (chemical analysis)Wavelet transformComputer scienceKernel (algebra)DiagonalMathematicsParallel computingPhysicsArtificial intelligenceMaterials scienceGeometry

Abstract

fetched live from OpenAlex

A new approach is presented for efficient capacitance extraction. This technique utilizes wavelet bases and is kernel independent. The main benefits of the proposed technique are as follows: (1) it takes a full advantage of the multiresolution analysis and gives accurate total charge on a conductor without obtaining an accurate solution for the charge density per se; (2) the method employs an extremely aggressive thresholding algorithm and compresses the stiffness matrix to an almost diagonal sparse matrix; and (3) construction of the stiffness matrix is performed iteratively, which facilitates easy and simple control of convergence and provides means of trading accuracy for speed. The proposed method has computational cost of O(N), versus O(N/sup 3/) for conventional methods. The proposed algorithm has a major impact on the speed and accuracy of physical interconnect parameter extraction with speedup reaching 10/sup 3/ for even moderately sized problems.

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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.901
Threshold uncertainty score0.608

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.0010.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.018
GPT teacher head0.270
Teacher spread0.252 · 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