Package: wnpp Severity: wishlist Owner: Debian Med Packaging Team <debian-med-packag...@lists.alioth.debian.org> Control: block 395843 by -1
* Package name : libuncommons-maths-java Version : 1.2.3 Upstream Author : Daniel W. Dyer * URL : http://maths.uncommons.org * License : Apache Programming Lang: Java Description : Random number generators, probability distributions, combinatorics and statistics for Java The Uncommons Maths library provides five easy-to-use, statistically sound, high-performance pseudorandom number generators (RNGs). They are: * MersenneTwisterRNG A Java port of the fast and reliable Mersenne Twister RNG originally developed by Makoto Matsumoto and Takuji Nishimura. * XORShiftRNG A Java implementation of the very fast PRNG described by George Marsaglia. It has a period of about 2160, which although much shorter than the Mersenne Twister's, it can be up to twice as fast. * CMWC4096RNG A Java implementation of a Complementary-Multiply-With-Carry (CMWC) RNG as described by George Marsaglia. It has an extremely long period (2131104) and performance comparable to the Mersenne Twister (though the Mersenne Twister has the advantage of only requiring 16 bytes of seed data rather than the 16 kilobytes required by the CMWC RNG). * AESCounterRNG This is a cryptographically-strong1 non-linear RNG that is around 10x faster than java.security.SecureRandom. Reverse-engineering the generator state from observations of its output would involve cracking the AES block cipher. * CellularAutomatonRNG A Java port of Tony Pasqualoni's fast Cellular Automaton RNG. It uses a 256-cell automaton to generate random values. This package is a dependency of wgs-assembler and will be handled by the Debian Med team.
