Examples of Binomial

cern.jet.random.Binomial
ern.ch/RD11/rkb/AN16pp/node19.html#SECTION000190000000000000000"> math definition and animated definition.
p(x) = k * p^k * (1-p)^(n-k) with k = n! / (k! * (n-k)!).
Instance methods operate on a user supplied uniform random number generator; they are unsynchronized.
Static methods operate on a default uniform random number generator; they are synchronized.
Implementation: High performance implementation. Acceptance Rejection/Inversion method. This is a port of RandBinomial used in CLHEP 1.4.0 (C++). CLHEP's implementation is, in turn, based on
V. Kachitvichyanukul, B.W. Schmeiser (1988): Binomial random variate generation, Communications of the ACM 31, 216-222. @author wolfgang.hoschek@cern.ch @version 1.0, 09/24/99
org.apache.hadoop.io.file.tfile.RandomDistribution.Binomial
org.apache.hadoop.zebra.tfile.RandomDistribution.Binomial

Examples of cern.jet.random.Binomial

    ////                         protected methods                 ////


    /** Method that is called after _randomNumberGenerator is changed.
     */
    protected void _createdNewRandomNumberGenerator() {
        _generator = new Binomial(1, 0.5, _randomNumberGenerator);
    }

View Full Code Here

Examples of cern.jet.random.Binomial


    /** Create a new random number generator.  This method is called
     *  after _randomNumberGenerator is changed.
     */
    protected void _createdNewRandomNumberGenerator() {
        _generator = new Binomial(1, 0.5, _randomNumberGenerator);
    }

View Full Code Here

Examples of org.apache.hadoop.io.file.tfile.RandomDistribution.Binomial

   *          Expected ratio between the most frequent words and the least
   *          frequent words. (e.g. 100)
   */
  public Dictionary(Random random, int entries, int minWordLen, int maxWordLen,
      int freqRatio) {
    Binomial binomial = new Binomial(random, minWordLen, maxWordLen, BINOMIAL_P);
    lead = Math.max(0,
        (int) (entries / (Math.exp(Math.log(freqRatio) / SIGMA) - 1)) - 1);
    zipf = new Zipf(random, lead, entries + lead, 1.1);
    dict = new String[entries];
    // Use a set to ensure no dup words in dictionary

View Full Code Here

Examples of org.apache.hadoop.zebra.tfile.RandomDistribution.Binomial

   *          Expected ratio between the most frequent words and the least
   *          frequent words. (e.g. 100)
   */
  public Dictionary(Random random, int entries, int minWordLen, int maxWordLen,
      int freqRatio) {
    Binomial binomial = new Binomial(random, minWordLen, maxWordLen, BINOMIAL_P);
    lead = Math.max(0,
        (int) (entries / (Math.exp(Math.log(freqRatio) / SIGMA) - 1)) - 1);
    zipf = new Zipf(random, lead, entries + lead, 1.1);
    dict = new String[entries];
    // Use a set to ensure no dup words in dictionary

View Full Code Here

Examples of org.apache.hadoop.zebra.tfile.RandomDistribution.Binomial

   *          Expected ratio between the most frequent words and the least
   *          frequent words. (e.g. 100)
   */
  public Dictionary(Random random, int entries, int minWordLen, int maxWordLen,
      int freqRatio) {
    Binomial binomial = new Binomial(random, minWordLen, maxWordLen, BINOMIAL_P);
    lead = Math.max(0,
        (int) (entries / (Math.exp(Math.log(freqRatio) / SIGMA) - 1)) - 1);
    zipf = new Zipf(random, lead, entries + lead, 1.1);
    dict = new String[entries];
    // Use a set to ensure no dup words in dictionary

View Full Code Here

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.