Watermelon uniform random generation with applications
نویسندگان
چکیده
منابع مشابه
Non-uniform Random Variate Generation
This is a survey of the main methods in non-uniform random variate generation, and highlights recent research on the subject. Classical paradigms such as inversion, rejection, guide tables, and transformations are reviewed. We provide information on the expected time complexity of various algorithms, before addressing modern topics such as indirectly specified distributions, random processes, a...
متن کاملUniform Random Rational Number Generation
Classical floating point random numbers fail simple tests when considered as rational numbers. A uniform random number generator based on a linear congruential generator with output in the rational numbers is implemented within the two computer algebra systems Maple 10 and MuPAD Pro 3.1. The empirical tests in Knuth’s suite of tests show no evidence against the hypothesis that the output sample...
متن کاملSome Characterizations of the Uniform Distribution with Applications to Random Number Generation
Let U and V be independent random variables with continuous density function on the interval (0, 1). We describe families of functions g for which uniformity of U and V is equivalent to uniformity of g(U, V) on (0, 1). These results axe used to prescribe methods for improving the quality of pseudo-random number generators by making them closer in distribution to the U(0, 1) distribution.
متن کاملUniform Random Generation of Huge Metamodel Instances
The size and the number of models is drastically increasing, preventing organizations from fully exploiting Model Driven Engineering benefits. Regarding this problem of scalability, some approaches claim to provide mechanisms that are adapted to numerous and huge models. The problem is that those approaches cannot be validated as it is not possible to obtain numerous and huge models and then to...
متن کاملSimulation Generation Of Non - Uniform Random Numbers
Problem: Given a uniform random variable U, generate a random variable X having a prescribed distribution function F X) (⋅. We previously discussed the inversion method. While inversion is a very general method, it may be computationally expensive. In particular, computing 1 X F () − ⋅ may have to be implemented via a numerical root-finding method in many cases. Therefore, we will now describe ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00218-4