Results 291 to 300 of about 12,228,153 (333)

DIVE: A Multi-Label Smart Contract Vulnerability Dataset. [PDF]

open access: yesSci Data
Alsunaidi SJ, Aljamaan H, Hammoudeh M.
europepmc   +1 more source

Computing Arithmetic Functions Using Stochastic Logic by Series Expansion

IEEE Transactions on Emerging Topics in Computing, 2019
Stochastic logic implementations of complex arithmetic functions, such as trigonometric, exponential, and sigmoid, are derived based on truncated versions of their Maclaurin series expansions. This paper makes three contributions. First, it is shown that
Keshab K Parhi, Yin Liu
exaly   +2 more sources

Implementation of Boolean and Arithmetic Functions with 8T SRAM Cell for In-Memory Computation

2020 International Conference for Emerging Technology (INCET), 2020
The current computing system based on von-Neumann architecture is facing a memory wall, power wall, instruction parallelism wall. These walls of the current computing system have been a significant impact on computing efficiency of computing systems in ...
A. Rajput, M. Pattanaik
semanticscholar   +1 more source

Multibit optoelectronic memory using graphene/diamond (carbon sp2-sp3) heterojunctions and its arithmetic functions

, 2020
This work demonstrates that graphene/diamond (carbon sp2-sp3) heterojunctions can be used as multibit optoelectronic memory, where light information is stored as multilevel resistance in a nonvolatile manner.
K. Ueda, Y. Mizuno, H. Asano
semanticscholar   +1 more source

Pipelining of arithmetic functions

1972 IEEE 2nd Symposium on Computer Arithmetic (ARITH), 1972
Two addition and three multiplication algorithms were studied to see the effect of pipelining on system efficiency. A definition of efficiency was derived to compare the relative merits of various algorithms and implementations for addition and multiplication. This definition is basically defined as bandwidth cost.
Thomas G. Hallin, Michael J. Flynn
openaire   +2 more sources

On an Arithmetical Function

The Ramanujan Journal, 2004
For the positive integer \(n\) one denotes by \(d(n)\) the number of its positive divisors, and by \(\sigma(n)\) their sum. \(\delta(n)\) denotes the difference between the number of those positive divisors of \(n\) which are congruent to \(1\pmod 3\) and the number of those positive divisors of \(n\) which are congruent to \(-1\pmod 3\); \(\delta\) is
openaire   +1 more source

Strongly regular relations of arithmetic functions

Journal of Number Theory, 2017
A simple, but very useful concept in number theory is that of an arithmetic function. On the other hand, hyperstructure theory, first introduced by Marty, is a generalization of group theory and it is connected to different fields of mathematics.
M. A. Tahan, B. Davvaz
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy