MétaCan
Menu
Back to cohort
Record W4240515399 · doi:10.1109/iwsoc.2004.1319850

A programmable base MDLNS MAC with self-generated lookup table

2004· article· en· W4240515399 on OpenAlexafffund
W. Zhang, G.A. Jullien, V.S. Dimitrov

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNumerical Methods and Algorithms
Canadian institutionsUniversity of Calgary
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsDramLookup tableComputer scienceAdderAccumulator (cryptography)Parallel computingLogarithmReduction (mathematics)Binary numberComputer hardwareTable (database)AlgorithmArithmeticMathematics

Abstract

fetched live from OpenAlex

This paper presents an new architecture for a programmable second base multi-dimensional logarithmic number system (MDLNS) multiply accumulator cell (MAC) using DRAM to store the conversion lookup table (LUT). It uses a direct mapping from nonbinary exponents to binary format with a more than 50% reduction in DRAM size compared to a recently reported architecture. With a simple modification of the DRAM data loading structure, each MAC can build its own LUT specific to the nonbinary exponents of the corresponding MDLNS coefficient in a pipelined data flow. This results not only in a considerable reduction of DRAM size, but also in the elimination of adders normally required for computing non-binary exponents in a data filtering channel.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.008
Threshold uncertainty score0.027

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0020.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0080.003

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.012
GPT teacher head0.238
Teacher spread0.226 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2004
Admission routes2
Has abstractyes

Explore more

Same topicNumerical Methods and AlgorithmsFrench-language works237,207