The Duality Between the Perceptron Algorithm and the von Neumann Algorithm

2013 ◽  
pp. 113-136 ◽  
Author(s):  
Dan Li ◽  
Tamás Terlaky
Keyword(s):  
Von Neumann ◽  
Perceptron Algorithm ◽  
Von Neumann Algorithm

scholarly journals DNA synthesis for true random number generation

2020 ◽  
Vol 11 (1) ◽  
Author(s):  
Linda C. Meiser ◽  
Julian Koch ◽  
Philipp L. Antkowiak ◽  
Wendelin J. Stark ◽  
Reinhard Heckel ◽  
...  
Keyword(s):  
Random Number ◽  
Random Number Generation ◽  
Sensitive Information ◽  
Encrypted Data ◽  
Von Neumann ◽  
Number Generation ◽  
Sequencing Technologies ◽  
Encryption And Decryption ◽  
Dna Strands ◽  
Von Neumann Algorithm

AbstractThe volume of securely encrypted data transmission required by today’s network complexity of people, transactions and interactions increases continuously. To guarantee security of encryption and decryption schemes for exchanging sensitive information, large volumes of true random numbers are required. Here we present a method to exploit the stochastic nature of chemistry by synthesizing DNA strands composed of random nucleotides. We compare three commercial random DNA syntheses giving a measure for robustness and synthesis distribution of nucleotides and show that using DNA for random number generation, we can obtain 7 million GB of randomness from one synthesis run, which can be read out using state-of-the-art sequencing technologies at rates of ca. 300 kB/s. Using the von Neumann algorithm for data compression, we remove bias introduced from human or technological sources and assess randomness using NIST’s statistical test suite.

Lectures on von Neumann Algebras

2019 ◽  
Author(s):  
Serban-Valentin Stratila ◽  
Laszlo Zsido
Keyword(s):  
Von Neumann Algebras ◽  
Von Neumann

John von Neumann

2004 ◽  
Vol 174 (12) ◽  
pp. 1371 ◽  
Author(s):  
Mikhail I. Monastyrskii
Keyword(s):  
John Von Neumann ◽  
Von Neumann

Information mechanics

2017 ◽  
Author(s):  
Sandip Tiwari
Keyword(s):  
Information Flow ◽  
Irreversible Processes ◽  
State Machines ◽  
Science And Engineering ◽  
Von Neumann ◽  
Principle Of Maximum Entropy ◽  
Information Manipulation ◽  
Classical Quantum ◽  
Physical Laws ◽  
Principle Of Maximum

Information is physical, so its manipulation through devices is subject to its own mechanics: the science and engineering of behavioral description, which is intermingled with classical, quantum and statistical mechanics principles. This chapter is a unification of these principles and physical laws with their implications for nanoscale. Ideas of state machines, Church-Turing thesis and its embodiment in various state machines, probabilities, Bayesian principles and entropy in its various forms (Shannon, Boltzmann, von Neumann, algorithmic) with an eye on the principle of maximum entropy as an information manipulation tool. Notions of conservation and non-conservation are applied to example circuit forms folding in adiabatic, isothermal, reversible and irreversible processes. This brings out implications of fluctuation and transitions, the interplay of errors and stability and the energy cost of determinism. It concludes discussing networks as tools to understand information flow and decision making and with an introduction to entanglement in quantum computing.

Unbounded Linear Operators

2018 ◽  
Author(s):  
D. E. Edmunds ◽  
W. D. Evans
Keyword(s):  
Hilbert Spaces ◽  
Linear Operators ◽  
Von Neumann ◽  
Limit Circle ◽  
Sectorial Operators ◽  
Closed Operators ◽  
The Stability ◽  
Symmetric Operators ◽  
Unbounded Linear Operators ◽  
Special Case

This chapter is concerned with closable and closed operators in Hilbert spaces, especially with the special classes of symmetric, J-symmetric, accretive and sectorial operators. The Stone–von Neumann theory of extensions of symmetric operators is treated as a special case of results for compatible adjoint pairs of closed operators. Also discussed in detail is the stability of closedness and self-adjointness under perturbations. The abstract results are applied to operators defined by second-order differential expressions, and Sims’ generalization of the Weyl limit-point, limit-circle characterization for symmetric expressions to J-symmetric expressions is proved.

Sign in / Sign up

Export Citation Format

Share Document