Package org.jamesii.core.math.random.distributions

Examples of org.jamesii.core.math.random.distributions.UniformDistribution

50
51
52
53
54
55
56
   *          the random number generator to be used
   */
  public UniformNode(IRandom rng) {
    super();
    random = rng;
    distrib = new UniformDistribution(random);
  }
View Full Code Here
72
73
74
75
76
77
78
79
80
81
82
  @SuppressWarnings("unchecked")
  @Override
  public <N extends INode> N calc(IEnvironment<?> cEnv) {

    distrib =
        new UniformDistribution(random,
            ((ValueNode<Double>) lowerB.calc(cEnv)).getValue(),
            ((ValueNode<Double>) upperB.calc(cEnv)).getValue());

    return (N) new ValueNode<>(distrib.getRandomNumber());
  }
View Full Code Here
439
440
441
442
443
444
445
446
447
      double v1 = bounds.get(i).getFirstValue().doubleValue();
      double v2 = bounds.get(i).getSecondValue().doubleValue();
      double lowBorder = Math.min(v1, v2);
      double upBorder = Math.max(v1, v2);
      distributions[i] =
          new UniformDistribution(generator, lowBorder, upBorder);
    }
    return distributions;
  }
View Full Code Here
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
   *
   * @return the test data
   */
  private Double[][] generateTestData() {
    Double[][] result = new Double[4][500];
    UniformDistribution udist =
        new UniformDistribution(SimSystem.getRNGGenerator().getNextRNG(), 0, 10);
    for (int i = 0; i < result[0].length; i++) {
      result[0][i] = (double) i;
      for (int j = 1; j < result.length; j++) {
        result[j][i] = udist.getRandomNumber() * j + j * (double) (i * i);
      }
    }
    return result;
  }
View Full Code Here
62
63
64
65
66
67
68
   *          the random number generator to be used
   */
  public StochSearchPortfolioSelector(int sampleSize, IRandom rng) {
    iterations = sampleSize;
    random = rng;
    uDist = new UniformDistribution(random);
  }
View Full Code Here
200
201
202
203
204
205
206
207
208
209
210
    int maxSize =
        Math.max(genome1WithoutDuplicates.size(),
            genome2WithoutDuplicates.size());

    int crossoverPoint =
        (int) (new UniformDistribution(getRNG(), 0, maxSize)).getRandomNumber();
    Pair<List<Integer>, List<Integer>> crossedGenome =
        recombineGenomes(crossoverPoint, maxSize, genome1WithoutDuplicates,
            genome2WithoutDuplicates);
    newGenome1.addAll(crossedGenome.getFirstValue());
    newGenome2.addAll(crossedGenome.getSecondValue());
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
65
66
67
   */
  @Override
  public void generateRandomGenome(int length, int portfolioSize) {
    int remainingPortfolioSize = portfolioSize;
    boolean[] newGenome = new boolean[length];
    UniformDistribution randomPosition =
        new UniformDistribution(getRNG(), 0, newGenome.length);
    while (remainingPortfolioSize > 0) {
      int position = (int) randomPosition.getRandomNumber();
      if (!newGenome[position]) {
        newGenome[position] = true;
        remainingPortfolioSize--;
      }
    }
View Full Code Here
167
168
169
170
171
172
173
174
175
176
177
   * @return a pair of new individuals
   */
  @Override
  public Pair<IIndividual, IIndividual> recombine(IIndividual partner) {
    int crossoverPoint =
        (int) (new UniformDistribution(getRNG(), 0, genome.length))
            .getRandomNumber();
    Pair<boolean[], boolean[]> newGenomes =
        recombineGenomes(crossoverPoint, genome,
            partner.getBooleanRepresentation());
    return new Pair<IIndividual, IIndividual>(new BooleanIndividual(
View Full Code Here
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
      numOfAlgo = (int) (991 * rng.nextDouble() + 10);
    }
    if (numOfProb == 0) {
      numOfProb = (int) (991 * rng.nextDouble() + 10);
    }
    UniformDistribution u =
        new UniformDistribution(rng, minPerformance, maxPerformance + 1);
    Double[][] matrix = new Double[numOfAlgo][numOfProb];
    for (Double[] mat : matrix) {
      for (int i = 0; i < mat.length; i++) {
        mat[i] = u.getRandomNumber();
      }
    }
    return matrix;
  }
View Full Code Here
89
90
91
92
93
94
95
96
97
98
  /**
   * Test simple rejection with a second set of time series generated with a
   * lower variance.
   */
  public void testSimpleRejectionWithUniformDistributions() {
    testWithRandomData(true, new UniformDistribution(SimSystem
        .getRNGGenerator().getNextRNG(), INTERVAL_SHIFT_FOR_TESINTG, 1.),
        new UniformDistribution(SimSystem.getRNGGenerator().getNextRNG(), .0,
            1 - INTERVAL_SHIFT_FOR_TESINTG));
  }
View Full Code Here
TOP

Related Classes of org.jamesii.core.math.random.distributions.UniformDistribution

  • org.jamesii.asf.portfolios.ga.BooleanIndividual
  • org.jamesii.asf.portfolios.ga.GenePool
  • org.jamesii.asf.portfolios.ga.ListIndividual
  • org.jamesii.asf.portfolios.ga.TestGeneticAlgorithmPortfolioSelector
  • org.jamesii.asf.portfolios.ga.TestGeneticAlgorithmPortfolioSelectorPerformance
  • org.jamesii.asf.portfolios.stochsearch.StochSearchPortfolioSelector
  • org.jamesii.core.math.parsetree.random.UniformNode
  • org.jamesii.core.math.random.RandomSampler
  • org.jamesii.core.math.statistics.tests.wilcoxon.TestWilcoxonRankSumTest
  • org.jamesii.core.math.statistics.timeseries.sets.SetsOfTimeSeriesBootstrappingComparisonTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.