Search · four archives
Search · four archives
8 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…
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…
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…
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…
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…