本文整理汇总了Java中dr.math.Poisson.nextPoisson方法的典型用法代码示例。如果您正苦于以下问题：Java Poisson.nextPoisson方法的具体用法？Java Poisson.nextPoisson怎么用？Java Poisson.nextPoisson使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类dr.math.Poisson的用法示例。
在下文中一共展示了Poisson.nextPoisson方法的4个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: mutate
import dr.math.Poisson; //导入方法依赖的package包/类
public Mutation[] mutate(byte[] sequence, byte[] childSequence) {
if (genomeLength != sequence.length) {
genomeLength = sequence.length;
poissonMean = genomeLength * muRate;
}
int mutationCount = Poisson.nextPoisson(poissonMean);
Mutation[] mutations = new Mutation[mutationCount];
System.arraycopy(sequence, 0, childSequence, 0, genomeLength);
byte newState;
for (int i = 0; i < mutationCount; i++) {
int pos = MathUtils.nextInt(genomeLength);
newState = (byte)MathUtils.nextInt(stateSize-1);
if (newState == sequence[i]) {
newState = (byte)((newState + 1) % stateSize);
}
childSequence[pos] = newState;
mutations[i] = new Mutation(pos, newState);
}
return mutations;
}
示例2: mutate
import dr.math.Poisson; //导入方法依赖的package包/类
public Mutation[] mutate(byte[] sequence, byte[] childSequence) {
if (genomeLength != sequence.length) {
genomeLength = sequence.length;
poissonMean = genomeLength * muRate;
}
int mutationCount = Poisson.nextPoisson(poissonMean);
Mutation[] mutations = new Mutation[mutationCount];
System.arraycopy(sequence, 0, childSequence, 0, genomeLength);
for (int i = 0; i < mutationCount; i++) {
int pos = MathUtils.nextInt(genomeLength);
byte state = (byte)((sequence[pos] + 1) % 2);
childSequence[pos] = state;
mutations[i] = new Mutation(pos, state);
}
return mutations;
}
示例3: generatePartition
import dr.math.Poisson; //导入方法依赖的package包/类
public double[] generatePartition() {
int lengthDividedByTwo = (getNumberOfPartitionsMinusOne() + 1) / 2;
int value = 0;
while (value < 1 || value > lengthDividedByTwo) {
value = Poisson.nextPoisson(mean);
}
int[] x = new int[getNumberOfPartitionsMinusOne() + 1];
for (int i = 0; i < value; i++) {
x[i] = 1;
}
MathUtils.permute(x);
if (x[0] == 1) {
for (int i = 0; i < x.length; i++) {
if (x[i] == 1) {
x[i] = 0;
} else {
x[i] = 1;
}
}
}
double[] rValue = new double[x.length];
for (int i = 0; i < rValue.length; i++) {
rValue[i] = x[i];
}
return rValue;
}
示例4: smoothPoissonOnly
import dr.math.Poisson; //导入方法依赖的package包/类
private static double[] smoothPoissonOnly(final double[] c, final double[] t, final boolean sample) {
final double[] smoothed = new double[c.length];
final double lambda = fitLambda(c, t);
for (int i = 0; i < c.length; i++) {
if (sample) {
smoothed[i] = Poisson.nextPoisson(lambda * t[i]);
} else {
smoothed[i] = lambda;
}
}
return smoothed;
}