MétaCan
Menu
Back to cohort
Record W2892914188 · doi:10.1587/nolta.9.406

Application of stochastic computing in brainware

2018· article· en· W2892914188 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

VenueNonlinear Theory and Its Applications IEICE · 2018
Typearticle
Languageen
FieldEngineering
TopicAdvanced Memory and Neural Computing
Canadian institutionsMcGill University
FundersJapan Society for the Promotion of ScienceUniversity of TokyoMinistry of Education, Culture, Sports, Science and Technology
KeywordsStochastic computingComputer scienceComputationProbabilistic logicCMOSMultiplication (music)Stochastic processBinary numberBitstreamComputer hardwareParallel computingComputer engineeringAlgorithmElectronic engineeringArtificial intelligenceDecoding methodsArithmeticEngineeringMathematics

Abstract

fetched live from OpenAlex

This paper reviews applications of stochastic computing in brainware LSI (BLSI) for visual information processing. Stochastic computing exploits random bit streams, realizing the area-efficient hardware of complicated functions, such as multiplication and tanh functions in comparison with binary computation. Using stochastic computing, we implement the hardware of several physiological models of the primary visual cortex of brains, where these models require such the complicated functions. Our vision BLSIs are implemented using Taiwan Semiconductor Manufacturing Company (TSMC) 65 nm CMOS process and discussed with traditional fixed-point implementations in terms of hardware performance and computation accuracy. In addition, an analog-to-stochastic converter is designed using CMOS and magnetic tunnel junctions that exhibit probabilistic switching behaviors for area/energy-efficient signal conversions to stochastic bit streams.

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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.795
Threshold uncertainty score0.361

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.009
GPT teacher head0.265
Teacher spread0.256 · 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