22 papers · ranked by Valyu relevance
Matthias Volk, Borzoo Bonakdarpour, Joost-Pieter Katoen, Saba Aflaki
Randomization is a key concept in distributed computing to tackle impossibility results. This also holds for self-stabilization in anonymous networks where coin flips are often used to break symmetry. Although the use of randomization in self-stabilizing algorithms is rather common, it is unclear what the optimal coin…
Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev
Explorable heap selection is the problem of selecting the nth smallest value in a binary heap. The key values can only be accessed by traversing through the underlying infinite binary tree, and the complexity of the algorithm is measured by the total distance traveled in the tree (each edge has unit cost). This problem…
Miaoshan Lu, Hengxuan Jiang, Ruimin Wang, Shaowei An + 2 more
Plate Design is a necessary and time-consuming operation for GC/LC-MS based sample preparation. The implementation of the inter-batch balancing algorithm and the intra-batch randomization algorithm can have a significant impact on the final analysis results. For researchers without programming skills, a stable and…
Filip Milisav, Vincent Bazinet, Richard F. Betzel, Bratislav Misic
Scientific discovery in connectomics relies on the use of network null models. To systematically evaluate the prominence of brain network features, empirical measures are compared against null statistics computed in randomized networks. Modern imaging and tracing technologies provide an increasingly rich repertoire of…
Pier Paolo Poir, Louis Lagardère, Jean-Philip Piquemal
We propose a new strategy to solve the Tkatchenko-Scheffler Many-Body Dispersion (MBD) model’s equations. Our approach overcomes the original O(N**3) computational complexity that limits its applicability to large molecular systems within thecontext of O(N) Density Functional Theory (DFT). First, in order to generate…
Pier Paolo Poier, Louis Lagardère, Jean-Philip Piquemal
We propose a new strategy to solve the Tkatchenko-Scheffler Many-Body Dispersion (MBD) model’s equations. Our approach overcomes the original O(N**3) computational complexity that limits its applicability to large molecular systems within thecontext of O(N) Density Functional Theory (DFT). First, in order to generate…
Mengqi Zhang, Guangqiang Teng, Xiaoyu Lei, Boris Ryabko
Lei proposed an algorithm Algorithm $A_{3}$ in 2023 to generate an exact discrete uniform distribution from an unknown biased Bernoulli source. The present paper does not claim a new extraction algorithm. Its contributions are analytical: first, we provide a Fourier-analytic proof of the uniformity mechanism based on…
Bruno Salezze Vieira, Eduardo Machado Silva, Antônio Augusto Chaves
Scheduling Authors: ['Bruno Salezze Vieira' 'Eduardo Machado Silva' 'Antônio Augusto Chaves'] Efficient surgery room scheduling is essential for hospital efficiency, patient satisfaction, and resource utilization. This study addresses this challenge by introducing a novel concept of Random-Key Optimizer (RKO)…
Mahmudur Rahman Hera, David Koslicki, Conrado Martínez
With the surge in sequencing data generated from an ever-expanding range of biological studies, designing scalable computational techniques has become essential. One effective strategy to enable large-scale computation is to split long DNA or protein sequences into k-mers, and summarize large k-mer sets into compact…
Nevin Brackett‐Rozinsky, Daniel Lemire
Pseudorandom values are often generated as 64-bit binary words. These random words need to be converted into ranged values without statistical bias. We present an efficient algorithm to generate multiple independent uniformlyrandom bounded integers from a single uniformly-random binary word, without any bias. In the…
Manuel Penschuck
Shuffling is the process of rearranging a sequence of elements into a random order such that any permutation occurs with equal probability. It is an important building block in a plethora of techniques used in virtually all scientific areas. Consequently considerable work has been devoted to the design and…
Ruben Becker, Davide Cenzato, Sunghwan Kim, Bojana Kodric + 2 more
'Riccardo Maso' 'Nicola Prezza'] Wheeler automata were introduced in 2017 as a tool to generalize existing indexing and compression techniques based on the Burrows-Wheeler transform. Intuitively, an automaton is said to be Wheeler if there exists a total order on its states reflecting the natural co-lexicographic order…
Vincent Cicirello
This report presents algorithms for generating small random samples without replacement. It considers two cases. It presents an algorithm for sampling a pair of distinct integers, and an algorithm for sampling a triple of distinct integers. The worstcase runtime of both algorithms is constant, while the worstcase…
Martin Papenberg, Cheng Wang, Maïgane Diop, Syed Hassan Bukhari + 13 more
High throughput sequencing is a powerful tool for processing large amounts of DNA and RNA samples in batches. Proper experimental design and statistical methods are required to mitigate systematic technical factors due to differences in batches (“batch effects”), as data variation due to these non-biological factors…
Prasad U. Bandodkar, Razeen R. Shaikh, Gregory T. Reeves
Model development is essential to gain a mathematical understanding of the underlying phenomena in systems biology. In most models, it is typically hard to estimate the values of the biophysical/phenomenological parameters that characterize the model. The parameters are estimated by minimizing a function that reduces a…
Hojong Choi, Seung-Hyeok Shin, Diego Martín, Masoud Kaveh + 1 more
'Mohammad Reza Mosavi'] Ultrasound systems have been widely used for consultation; however, they are susceptible to cyberattacks. Such ultrasound systems use random bits to protect patient information, which is vital to the stability of information-protecting systems used in ultrasound machines. The stability of the…
Emin Karayel
Derandomization techniques are often used within advanced randomized algorithms. In particular, pseudorandom objects, such as hash families and expander graphs, are key components of such algorithms, but their verification presents a challenge. This work shows how such algorithms can be expressed and verified in…
Authors not listed
With the ever-increasing demand for atomistic structures representative of real-life systems as well as the ad-vent of exascale computers, it has now become necessary and possible to use advanced global optimization (GO) techniques to intelligently sample the potential energy surface (PES). Given the previous studies…
Authors not listed
Metastable states and the conformational transitions in between them are key to understanding dynamical behaviour and function of large-scale molecular systems. By combining basic dimensionality reduction techniques with a state-of-the art approximation of the Koopman operator associated to molecular dynamics…
Sakshi Patel, Thanikaiselvan Veeramalai, Amelia Carolina Sparavigna
With the advancement of technology worldwide, security is essential for online information and data. This research work proposes a novel image encryption method based on combined chaotic maps, Halton sequence, five-dimension (5D) Hyper-Chaotic System and Deoxyribonucleic Acid (DNA) encoding. Halton sequence is a known…
Matthew Sigit
number generation? Authors: ['Matthew Sigit'] | 1. | Introduction | 2 | | --- | --- | --- | | 2. | Background Research | 5 | | | 2.1 Existing deficiencies in Java | 5 | | | 2.2 Multiple Pendulum Systems | 6 | | | 2.3 Quantifying Random: The NIST Statistical Test Suite | 9 | | | 2.4 Quantifying Resources | 10 | | 3. |…
Jonas Verhellen
Computer-assisted design of small molecules has experienced a resurgence in academic and indus- trial interest due to the widespread use of data-driven techniques such as deep generative models. While the ability to generate molecules that fulfill required chemical properties is encouraging, the use of deep learning…