Search · four archives
Search · four archives
15 papers · ranked by Valyu relevance
Pu Li, Qizhi Li, Wenye Tang, Weiqiang Wang + 6 more
'Brent E. Little' 'Sai Tek Chu' 'K. Alan Shore' 'Yuwen Qin' 'Yuncai Wang'] Random bit generators are critical for information security, cryptography, stochastic modeling, and simulations. Speed and scalability are key challenges faced by current physical random bit generation. Herein, we propose a massively parallel…
Wenhui Luo, Olivia Chen, Nobuyuki Yoshikawa, Naoki Takeuchi
Alternative computing such as stochastic computing and bio-inspired computing holds promise for overcoming the limitations of von Neumann computers. However, one difficulty in the implementation of such alternative computing is the need for a large number of random bits at the same time. To address this issue, we…
Yuxi Pang, Shaonian Ma, Qiang Ji, Xian Zhao + 5 more
uncorrelated Brillouin random fiber lasing oscillation Authors: ['Yuxi Pang' 'Shaonian Ma' 'Qiang Ji' 'Xian Zhao' 'Zengguang Qin' 'Zhaojun Liu' 'Ping Lu' 'Xiaoyi Bao' 'Yanping Xu'] Abstract: Correlations existing between spectral components in multi-wavelength lasers have been the key challenge that hinders these laser…
Yuqi Hu, Qingsong Bai, Xi Tang, Wei Xiong + 10 more
'Yanlan Xiao' 'Runchang Du' 'Leiji Liu' 'Guangqiong Xia' 'Zhengmao Wu' 'Junbo Yang' 'Heng Zhou' 'Jiagui Wu'] Ultrafast physical random bit (PRB) generators and integrated schemes have proven to be valuable in a broad range of scientific and technological applications. In this study, we experimentally demonstrated a PRB…
Saleh Khalaj Monfared, Omid Hajihassani, Soroush Meghdadi Zanjani, Mohammadsina Kiarostami + 2 more
'Mohammadsina Kiarostami' 'Dara Rahmati' 'Saeid Gorgin'] Abstract—In this work a high throughput method for generating high quality Pseudo-Random Numbers using the bitslicing technique is proposed. In such technique, instead of the conventional row-major data representation, column-major data representation is employed…
Yawen Zhang, Runsheng Wang, Xinyue Zhang, Zherui Zhang + 4 more
'Zuodong Zhang' 'Yuan Wang' 'Ru Huang'] Abstract — Stochastic computing (SC) presents high error tolerance and low hardware cost, and has great potential in applications such as neural networks and image processing. However, the bitstream generator, which converts a binary number to bitstreams, occupies a large area…
Markus Manssen, Martin Weigel, Alexander K. Hartmann
- 3 Institut f¨ur Physik, Johannes Gutenberg-Universit¨at Mainz, Staudinger Weg 7, 55099 Mainz, Germany Abstract. High-performance streams of (pseudo) random numbers are crucial for the efficient implementation for countless stochastic algorithms, most importantly, Monte Carlo simulations and molecular dynamics…
Behrouz Zolfaghari, Khodakhast Bibak, Takeshi Koshiba, Éloi Bossé
Many security-related scenarios including cryptography depend on the random generation of passwords, permutations, Latin squares, CAPTCHAs and other types of non-numerical entities. Random generation of each entity type is a different problem with different solutions. This study is an attempt at a unified solution for…
Gleb Beliakov, Michael Johnstone, Douglas Creighton, Tim Wilkin
Pseudorandom number generators are required for many computational tasks, such as stochastic modelling and simulation. This paper investigates the serial CPU and parallel GPU implementation of a Linear Congruential Generator based on the binary representation of the normal number α2,3. We adapted two methods of modular…
Jonathan Passerat‐Palmbach, David R.C. Hill
Stochastic simulations are often sensitive to the source of randomness that characterizes the statistical quality of their results. Consequently, we need highly reliable Random Number Generators (RNGs) to feed such applications. Recent developments try to shrink the computation time by relying more and more General…
Mohammed Abutaha, Islam Amar, Salman AlQahtani, Xiaowei Li + 2 more
Encrypting pictures quickly and securely is required to secure image transmission over the internet and local networks. This may be accomplished by employing a chaotic scheme with ideal properties such as unpredictability and non-periodicity. However, practically every modern-day system is a real-time system, for which…
Authors not listed
This paper presents a simplified model of iterative compound optimization in drug/agrochemical discovery. Compounds are represented as binary strings, with project evolution simulated through random bit changes. The model reproduces key statistical features of real projects, including activity distributions and…
Christoph Stelz, Lukas Hübner, Alexandros Stamatakis
Phylogenetic trees describe the evolutionary history among biological species based on their genomic data. Maximum Likelihood (ML) based phylogenetic inference tools search for the tree and evolutionary model that best explain the observed genomic data. Given the independence of likelihood score calculations between…
David S. Lawrie
Forward Wright-Fisher simulations are powerful in their ability to model complex demography and selection scenarios, but suffer from slow execution on the CPU, thus limiting their usefulness. The single-locus Wright-Fisher forward algorithm is, however, exceedingly parallelizable, with many steps which are so-called…
Kecong Tang, Ahsan Sanaullah, Degui Zhi, Shaojie Zhang
Durbin’s positional Burrows-Wheeler transform (PBWT) enables algorithms with the optimal time complexity of O(MN) for reporting all vs all haplotype matches in a population panel with M haplotypes and N variant sites. However, even this efficiency may still be too slow when the number of haplotypes reaches millions. To…