MétaCan
Menu
Back to cohort
Record W2004538207 · doi:10.1109/icecs.2005.4633436

An efficient algorithm and architecture for natural logarithm using Maclaurin series

2005· article· en· W2004538207 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
TopicNumerical Methods and Algorithms
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsLogarithmNatural logarithmComputer scienceAlgorithmSeries (stratigraphy)ComputationArchitectureFunction (biology)Parallel computingRadix (gastropod)ArithmeticMathematics

Abstract

fetched live from OpenAlex

An algorithm for the computation of the natural logarithm using Maclaurin series is presented in this paper. The algorithm utilizes only the first two terms in Maclaurin series to compute logarithm function. A pipelined architecture implementing our algorithm is proposed and its execution time is estimated based on the rough model for the delay estimate of the main logic blocks. The execution time is also obtained for a target precision of 32 bits. The proposed architecture is compared with conventional radix-2 and high-radix digit-recurrence algorithm showing that the proposed architecture requires less execution time for higher precision.

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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.988
Threshold uncertainty score0.443

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.015
GPT teacher head0.296
Teacher spread0.281 · 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

Citations3
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicNumerical Methods and AlgorithmsFrench-language works237,207