Examples of MersenneTwisterRNG

org.uncommons.maths.random.MersenneTwisterRNG
ath.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html" target="_top">Mersenne Twister algorithm developed by Makoto Matsumoto and Takuji Nishimura.

This is a very fast random number generator with good statistical properties (it passes the full DIEHARD suite). This is the best RNG for most experiments. If a non-linear generator is required, use the slower {@link AESCounterRNG} RNG.
This PRNG is deterministic, which can be advantageous for testing purposes since the output is repeatable. If multiple instances of this class are created with the same seed they will all have identical output.

This code is translated from the original C version and assumes that we will always seed from an array of bytes. I don't pretend to know the meanings of the magic numbers or how it works, it just does.

NOTE: Because instances of this class require 128-bit seeds, it is not possible to seed this RNG using the {@link #setSeed(long)} method inheritedfrom {@link Random}. Calls to this method will have no effect. Instead the seed must be set by a constructor.
@author Makoto Matsumoto and Takuji Nishimura (original C version) @author Daniel Dyer (Java port)

Examples of org.uncommons.maths.random.MersenneTwisterRNG

public class MersenneTwisterRandomInitializer extends RandomInitializerImpl {


    private static final long serialVersionUID = 1L;


    public MersenneTwisterRandomInitializer() {
  super(new MersenneTwisterRNG());
    }

View Full Code Here

Examples of org.uncommons.maths.random.MersenneTwisterRNG

    public MersenneTwisterRandomInitializer() {
  super(new MersenneTwisterRNG());
    }


    public MersenneTwisterRandomInitializer(float start, float end) {
  super(new MersenneTwisterRNG(), start, end);
    }

View Full Code Here

Examples of org.uncommons.maths.random.MersenneTwisterRNG

    testSeed = true;
  }


  private Random buildRandom() {
    if (testSeed) {
      return new MersenneTwisterRNG(STANDARD_SEED);
    } else if (fixedSeed == null) {
      return new MersenneTwisterRNG();
    } else {
      return new MersenneTwisterRNG(RandomUtils.longSeedtoBytes(fixedSeed));
    }
  }

View Full Code Here

Examples of org.uncommons.maths.random.MersenneTwisterRNG

    testSeed = true;
  }


  private Random buildRandom() {
    if (testSeed) {
      return new MersenneTwisterRNG(STANDARD_SEED);
    } else if (fixedSeed == null) {
      // Force use of standard generator, and disallow use of those based on /dev/random since
      // it causes hangs on Ubuntu
      try {
        return new MersenneTwisterRNG(SEED_GENERATOR);
      } catch (SeedException se) {
        // Can't happen
        throw new IllegalStateException(se);
      }
    } else {
      return new MersenneTwisterRNG(RandomUtils.longSeedtoBytes(fixedSeed));
    }
  }

View Full Code Here

Examples of org.uncommons.maths.random.MersenneTwisterRNG

  /**
   * Test method for {@link org.apache.mahout.ga.watchmaker.cd.CDFitness#get()}.
   */
  public void testGet() {
    int n = 100;
    Random rng = new MersenneTwisterRNG();
    int tp, tn, fp, fn;
    double se, sp;


    for (int nloop = 0; nloop < n; nloop++) {
      tp = rng.nextInt(1000);
      tn = rng.nextInt(1000);
      fp = rng.nextInt(1000);
      fn = rng.nextInt(1000);


      CDFitness fitness = new CDFitness(tp, fp, tn, fn);
      se = ((double) tp) / (tp + fn);
      sp = ((double) tn) / (tn + fp);

View Full Code Here

Examples of org.uncommons.maths.random.MersenneTwisterRNG


  private MockDataSet mock;


  @Override
  protected void setUp() {
    rng = new MersenneTwisterRNG();
    mock = new MockDataSet(rng, 100);
  }

View Full Code Here

Examples of org.uncommons.maths.random.MersenneTwisterRNG

    Assert.assertTrue("value > max", value <= max);
  }


  @Override
  protected void setUp() {
    rng = new MersenneTwisterRNG();
    mock = new MockDataSet(rng, 50);
  }

View Full Code Here

Examples of org.uncommons.maths.random.MersenneTwisterRNG

    // the dataline has all its attributes set to 1d
    DataLine dl = EasyMock.createMock(DataLine.class);
    EasyMock.expect(dl.getAttribut(EasyMock.anyInt())).andReturn(1d).atLeastOnce();
    EasyMock.replay(dl);


    Random rng = new MersenneTwisterRNG();
    for (int nloop = 0; nloop < n; nloop++) {
      mock.categoricalDataset();


      // all weights are 1 (active)
      CDRule rule = new CDRule(0.);
      for (int condInd = 0; condInd < rule.getNbConditions(); condInd++) {
        rule.setW(condInd, 1.);
        rule.setO(condInd, rng.nextBoolean());
        rule.setV(condInd, rng.nextInt(2)); // two categories
      }


      // the condition is true if the operator is == and the values are equal
      // (value==1), or the operator is != and the values are no equal
      // (value==0)

View Full Code Here

Examples of org.uncommons.maths.random.MersenneTwisterRNG

   */
  public void testMate1() {
    int maxattributes = 100;
    int maxcrosspnts = 10;
    int n = 100; // repeat this test n times
    Random rng = new MersenneTwisterRNG();


    // Initialize dataset
    DataSet dataset = EasyMock.createMock(DataSet.class);
    DataSet.initialize(dataset);


    for (int nloop = 0; nloop < n; nloop++) {
      // we need at least 2 attributes for the crossover
      // and a label that will be skipped by the rules
      int nbattributes = rng.nextInt(maxattributes) + 3;
      int crosspnts = rng.nextInt(maxcrosspnts) + 1;


      // prepare dataset mock
      EasyMock.reset(dataset);
      EasyMock.expect(dataset.getNbAttributes()).andReturn(nbattributes).times(2);
      EasyMock.replay(dataset);

View Full Code Here

Examples of org.uncommons.maths.random.MersenneTwisterRNG

   */
  public void testMate2() {
    int maxattributes = 100;
    int maxcrosspnts = 10;
    int n = 100; // repeat this test n times
    Random rng = new MersenneTwisterRNG();


    // Initialize dataset
    DataSet dataset = EasyMock.createMock(DataSet.class);
    DataSet.initialize(dataset);


    for (int nloop = 0; nloop < n; nloop++) {
      int nbattributes = rng.nextInt(maxattributes) + 3;
      int crosspnts = rng.nextInt(maxcrosspnts) + 1;
      // in the case of this test crosspnts should be < nbattributes
      if (crosspnts >= nbattributes)
        crosspnts = nbattributes - 1;


      // prepare dataset mock

View Full Code Here

0 1 2 3

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.