Examples of RandomGenerator

br.net.woodstock.rockframework.core.string.impl.RandomGenerator
br.net.woodstock.rockframework.text.impl.RandomGenerator
br.net.woodstock.rockframework.util.RandomGenerator
com.oltpbenchmark.util.RandomGenerator
org.apache.commons.math.random.RandomGenerator
Interface extracted from java.util.Random. This interface is implemented by {@link AbstractRandomGenerator}. @since 1.1 @version $Revision: 949750 $ $Date: 2010-05-31 16:06:04 +0200 (lun. 31 mai 2010) $
org.apache.commons.math3.random.RandomGenerator
Interface extracted from java.util.Random. This interface is implemented by {@link AbstractRandomGenerator}. @since 1.1
org.xtreemfs.babudb.sandbox.RandomGenerator

If two instances of {@link Random} are created with the same seed, and the same sequence of method calls is made for each, they will generate and return identical sequences of numbers. In order to guarantee this property, particular algorithms are specified for the class {@link Random}.
This class was written for evaluating BabuDB at realistic conditions at an network/cluster. @author flangner
randomevents.generator.RandomGenerator
@author Kirill

Examples of org.apache.commons.math3.random.RandomGenerator

     * @return the population for the next generation.
     */
    public Population nextGeneration(final Population current) {
        Population nextGeneration = current.nextGeneration();


        RandomGenerator randGen = getRandomGenerator();


        while (nextGeneration.getPopulationSize() < nextGeneration.getPopulationLimit()) {
            // select parent chromosomes
            ChromosomePair pair = getSelectionPolicy().select(current);


            // crossover?
            if (randGen.nextDouble() < getCrossoverRate()) {
                // apply crossover policy to create two offspring
                pair = getCrossoverPolicy().crossover(pair.getFirst(), pair.getSecond());
            }


            // mutation?
            if (randGen.nextDouble() < getMutationRate()) {
                // apply mutation policy to the chromosomes
                pair = new ChromosomePair(
                    getMutationPolicy().mutate(pair.getFirst()),
                    getMutationPolicy().mutate(pair.getSecond()));
            }

View Full Code Here

Examples of org.apache.commons.math3.random.RandomGenerator

        Assert.assertTrue(ball.getRadius() > 0);
    }


    @Test
    public void testLargeSamples() throws IOException {
        RandomGenerator random = new Well1024a(0x35ddecfc78131e1dl);
        final UnitSphereRandomVectorGenerator sr = new UnitSphereRandomVectorGenerator(3, random);
        for (int k = 0; k < 50; ++k) {


            // define the reference sphere we want to compute
            double d = 25 * random.nextDouble();
            double refRadius = 10 * random.nextDouble();
            Vector3D refCenter = new Vector3D(d, new Vector3D(sr.nextVector()));
            // set up a large sample inside the reference sphere
            int nbPoints = random.nextInt(1000);
            List<Vector3D> points = new ArrayList<Vector3D>();
            for (int i = 0; i < nbPoints; ++i) {
                double r = refRadius * random.nextDouble();
                points.add(new Vector3D(1.0, refCenter, r, new Vector3D(sr.nextVector())));
            }


            // test we find a sphere at most as large as the one used for random drawings
            checkSphere(points, refRadius);

View Full Code Here

Examples of org.apache.commons.math3.random.RandomGenerator

        final List<T> parent2Rep = second.getRepresentation();
        // and of the children
        final List<T> child1Rep = new ArrayList<T>(length);
        final List<T> child2Rep = new ArrayList<T>(length);


        final RandomGenerator random = GeneticAlgorithm.getRandomGenerator();


        List<T> c1 = child1Rep;
        List<T> c2 = child2Rep;


        int remainingPoints = crossoverPoints;
        int lastIndex = 0;
        for (int i = 0; i < crossoverPoints; i++, remainingPoints--) {
            // select the next crossover point at random
            final int crossoverIndex = 1 + lastIndex + random.nextInt(length - lastIndex - remainingPoints);


            // copy the current segment
            for (int j = lastIndex; j < crossoverIndex; j++) {
                c1.add(parent1Rep.get(j));
                c2.add(parent2Rep.get(j));

View Full Code Here

Examples of org.apache.commons.math3.random.RandomGenerator

        assertVectorEquals(expectedInitialState, filter.getStateEstimation());


        RealVector pNoise = new ArrayRealVector(1);
        RealVector mNoise = new ArrayRealVector(1);


        RandomGenerator rand = new JDKRandomGenerator();
        // iterate 60 steps
        for (int i = 0; i < 60; i++) {
            filter.predict();


            // Simulate the process
            pNoise.setEntry(0, processNoise * rand.nextGaussian());


            // x = A * x + p_noise
            x = A.operate(x).add(pNoise);


            // Simulate the measurement
            mNoise.setEntry(0, measurementNoise * rand.nextGaussian());


            // z = H * x + m_noise
            RealVector z = H.operate(x).add(mNoise);


            filter.correct(z);

View Full Code Here

Examples of org.apache.commons.math3.random.RandomGenerator


        // check the initial state
        double[] expectedInitialState = new double[] { 0.0, 0.0 };
        assertVectorEquals(expectedInitialState, filter.getStateEstimation());


        RandomGenerator rand = new JDKRandomGenerator();


        RealVector tmpPNoise = new ArrayRealVector(
                new double[] { FastMath.pow(dt, 2d) / 2d, dt });


        // iterate 60 steps
        for (int i = 0; i < 60; i++) {
            filter.predict(u);


            // Simulate the process
            RealVector pNoise = tmpPNoise.mapMultiply(accelNoise * rand.nextGaussian());


            // x = A * x + B * u + pNoise
            x = A.operate(x).add(B.operate(u)).add(pNoise);


            // Simulate the measurement
            double mNoise = measurementNoise * rand.nextGaussian();


            // z = H * x + m_noise
            RealVector z = H.operate(x).mapAdd(mNoise);


            filter.correct(z);

View Full Code Here

Examples of org.apache.commons.math3.random.RandomGenerator


        final ProcessModel pm = new DefaultProcessModel(A, B, Q, initialState, initialErrorCovariance);
        final MeasurementModel mm = new DefaultMeasurementModel(H, R);
        final KalmanFilter filter = new KalmanFilter(pm, mm);


        final RandomGenerator rng = new Well19937c(1000);
        final NormalDistribution dist = new NormalDistribution(rng, 0, measurementNoise);


        for (int i = 0; i < iterations; i++) {
            // get the "real" cannonball position
            double x = cannonball.getX();

View Full Code Here

Examples of org.apache.commons.math3.random.RandomGenerator

        checkDisk(list, Arrays.asList(list.get(1), list.get(2), list.get(3)));
    }


    @Test
    public void testLargeSamples() {
        RandomGenerator random = new Well1024a(0xa2a63cad12c01fb2l);
        for (int k = 0; k < 100; ++k) {
            int nbPoints = random.nextInt(10000);
            List<Vector2D> points = new ArrayList<Vector2D>();
            for (int i = 0; i < nbPoints; ++i) {
                double x = random.nextDouble();
                double y = random.nextDouble();
                points.add(new Vector2D(x, y));
            }
            checkDisk(points);
        }
    }

View Full Code Here

Examples of org.apache.commons.math3.random.RandomGenerator

    }


    @Test
    public void testGetters() {
        final DistanceMeasure measure = new CanberraDistance();
        final RandomGenerator random = new JDKRandomGenerator();
        final FuzzyKMeansClusterer<DoublePoint> clusterer =
                new FuzzyKMeansClusterer<DoublePoint>(3, 2.0, 100, measure, 1e-6, random);


        Assert.assertEquals(3, clusterer.getK());
        Assert.assertEquals(2.0, clusterer.getFuzziness(), 1e-6);

View Full Code Here

Examples of org.apache.commons.math3.random.RandomGenerator

        Assert.assertEquals(3, disk.getSupportSize());
    }


    @Test
    public void testRandom() {
        final RandomGenerator random = new Well1024a(0x12faa818373ffe90l);
        final UnitSphereRandomVectorGenerator sr = new UnitSphereRandomVectorGenerator(2, random);
        for (int i = 0; i < 500; ++i) {
            double d = 25 * random.nextDouble();
            double refRadius = 10 * random.nextDouble();
            Vector2D refCenter = new Vector2D(d, new Vector2D(sr.nextVector()));
            List<Vector2D> support = new ArrayList<Vector2D>();
            for (int j = 0; j < 3; ++j) {
                support.add(new Vector2D(1.0, refCenter, refRadius, new Vector2D(sr.nextVector())));
            }

View Full Code Here

Examples of org.apache.commons.math3.random.RandomGenerator

        
    }


    @Test
    public void testInsideArc() {
        RandomGenerator random = new Well1024a(0xbfd34e92231bbcfel);
        UnitSphereRandomVectorGenerator sphRandom = new UnitSphereRandomVectorGenerator(3, random);
        for (int i = 0; i < 100; ++i) {
            Circle c1 = new Circle(new Vector3D(sphRandom.nextVector()), 1.0e-10);
            Circle c2 = new Circle(new Vector3D(sphRandom.nextVector()), 1.0e-10);
            checkArcIsInside(c1, c2);

View Full Code Here

0 1 2 3 4 5

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.