/dports/science/R-cran-Epi/Epi/R/ |
H A D | ci.Crisk.R | 89 probs <- NArray(list(time = 0:nrow(nd), functionVar 100 Crisk <- sim2ci.Crisk(probs, alpha = alpha) 102 Srisk <- sim2ci.Srisk(probs, perm = perm, 105 Stime <- sim2ci.Stime(probs, alpha = alpha) 117 function(probs, argument 123 function(probs, argument 124 perm = 1:dim(probs)[2], 127 cprobs <- aperm(apply(probs[,perm,], 141 function(probs, argument 142 int = attr(probs, "int"), [all …]
|
/dports/biology/freebayes/freebayes-1.3.5/src/ |
H A D | Dirichlet.cpp | 7 long double dirichlet(const vector<long double>& probs, in dirichlet() argument 17 vector<long double>::const_iterator p = probs.begin(); in dirichlet() 18 for (; p != probs.end() && a != alphas.end(); ++p, ++a) { in dirichlet() 26 long double dirichletMaximumLikelihoodRatio(const vector<long double>& probs, in dirichletMaximumLikelihoodRatio() argument 31 return dirichlet(probs, obs, s) / dirichlet(probs, m, s); in dirichletMaximumLikelihoodRatio() 37 long double dirichletln(const vector<long double>& probs, in dirichletln() argument 47 vector<long double>::const_iterator p = probs.begin(); in dirichletln() 48 for (; p != probs.end() && a != alphas.end(); ++p, ++a) { in dirichletln() 56 long double dirichletMaximumLikelihoodRatioln(const vector<long double>& probs, in dirichletMaximumLikelihoodRatioln() argument 61 return dirichletln(probs, obs, s) - dirichletln(probs, m, s); in dirichletMaximumLikelihoodRatioln()
|
/dports/science/py-obspy/obspy-1.2.2/obspy/taup/ |
H A D | velocity_model.py | 293 probs = np.where(probs)[0] 294 if probs.size: 296 "layer(s) %s\n%s" % (probs, self.layers[probs])) 302 probs = np.where(probs)[0] 303 if probs.size: 311 probs = np.where(probs)[0] 323 probs = np.where(probs)[0] 330 raise ValueError(msg % (probs, self.layers[probs])) 340 probs = np.logical_and(probs, self.layers['top_depth'] != 0) 341 probs = np.where(probs)[0] [all …]
|
/dports/security/mkp224o/mkp224o-1.5.0/ |
H A D | calcest.c | 17 const double probs[] = { 0.5, 0.8, 0.9, 0.95, 0.99 }; variable 23 for (size_t i = 0; i < sizeof(probs)/sizeof(probs[0]); ++i) { in main() 24 printf(" %11d%% |",(int)((probs[i]*100)+0.5)); in main() 29 for (size_t i = 0; i < sizeof(probs)/sizeof(probs[0]); ++i) { in main() 36 for (size_t j = 0; j < sizeof(probs)/sizeof(probs[0]); ++j) { in main() 37 double t = log2(1 - probs[j]) / log2(1 - (1 / pow(32,charcounts[i]))); in main()
|
/dports/science/py-cirq-aqt/Cirq-0.12.0/cirq-core/cirq/sim/ |
H A D | density_matrix_utils.py | 80 probs = _probs(density_matrix, indices, qid_shape) 85 result = prng.choice(len(probs), size=repetitions, p=probs) 160 result = prng.choice(len(probs), p=probs) 184 out /= probs[result] 201 probs = np.abs(tensor) 202 probs = np.transpose(probs, indices) 203 probs = np.reshape(probs, np.prod(probs.shape, dtype=np.int64)) 207 probs = np.abs( 217 probs = np.sum(probs, axis=tuple(range(1, len(probs.shape)))) 220 probs /= np.sum(probs) [all …]
|
H A D | state_vector.py | 213 probs = _probs(state_vector, indices, shape) 218 result = prng.choice(len(probs), size=repetitions, p=probs) 287 result = prng.choice(len(probs), p=probs) 314 out /= np.sqrt(probs[result]) 325 probs = np.abs(tensor) ** 2 326 probs = np.transpose(probs, indices) 327 probs = np.reshape(probs, np.prod(probs.shape, dtype=np.int64)) 331 probs = ( 344 probs = np.sum(probs, axis=tuple(range(1, len(probs.shape)))) 347 probs /= np.sum(probs) [all …]
|
/dports/science/py-cirq-core/Cirq-0.13.1/cirq-core/cirq/sim/ |
H A D | state_vector.py | 216 probs = _probs(state_vector, indices, shape) 221 result = prng.choice(len(probs), size=repetitions, p=probs) 290 result = prng.choice(len(probs), p=probs) 317 out /= np.sqrt(probs[result]) 328 probs = np.abs(tensor) ** 2 329 probs = np.transpose(probs, indices) 330 probs = np.reshape(probs, np.prod(probs.shape, dtype=np.int64)) 334 probs = ( 347 probs = np.sum(probs, axis=tuple(range(1, len(probs.shape)))) 350 probs /= np.sum(probs) [all …]
|
H A D | density_matrix_utils.py | 80 probs = _probs(density_matrix, indices, qid_shape) 85 result = prng.choice(len(probs), size=repetitions, p=probs) 160 result = prng.choice(len(probs), p=probs) 184 out /= probs[result] 201 probs = np.abs(tensor) 202 probs = np.transpose(probs, indices) 203 probs = np.reshape(probs, np.prod(probs.shape, dtype=np.int64)) 207 probs = np.abs( 217 probs = np.sum(probs, axis=tuple(range(1, len(probs.shape)))) 220 probs /= np.sum(probs) [all …]
|
/dports/science/py-cirq-pasqal/Cirq-0.13.1/cirq-core/cirq/sim/ |
H A D | state_vector.py | 216 probs = _probs(state_vector, indices, shape) 221 result = prng.choice(len(probs), size=repetitions, p=probs) 290 result = prng.choice(len(probs), p=probs) 317 out /= np.sqrt(probs[result]) 328 probs = np.abs(tensor) ** 2 329 probs = np.transpose(probs, indices) 330 probs = np.reshape(probs, np.prod(probs.shape, dtype=np.int64)) 334 probs = ( 347 probs = np.sum(probs, axis=tuple(range(1, len(probs.shape)))) 350 probs /= np.sum(probs) [all …]
|
H A D | density_matrix_utils.py | 80 probs = _probs(density_matrix, indices, qid_shape) 85 result = prng.choice(len(probs), size=repetitions, p=probs) 160 result = prng.choice(len(probs), p=probs) 184 out /= probs[result] 201 probs = np.abs(tensor) 202 probs = np.transpose(probs, indices) 203 probs = np.reshape(probs, np.prod(probs.shape, dtype=np.int64)) 207 probs = np.abs( 217 probs = np.sum(probs, axis=tuple(range(1, len(probs.shape)))) 220 probs /= np.sum(probs) [all …]
|
/dports/science/py-cirq-google/Cirq-0.13.0/cirq-core/cirq/sim/ |
H A D | density_matrix_utils.py | 80 probs = _probs(density_matrix, indices, qid_shape) 85 result = prng.choice(len(probs), size=repetitions, p=probs) 160 result = prng.choice(len(probs), p=probs) 184 out /= probs[result] 201 probs = np.abs(tensor) 202 probs = np.transpose(probs, indices) 203 probs = np.reshape(probs, np.prod(probs.shape, dtype=np.int64)) 207 probs = np.abs( 217 probs = np.sum(probs, axis=tuple(range(1, len(probs.shape)))) 220 probs /= np.sum(probs) [all …]
|
H A D | state_vector.py | 216 probs = _probs(state_vector, indices, shape) 221 result = prng.choice(len(probs), size=repetitions, p=probs) 290 result = prng.choice(len(probs), p=probs) 317 out /= np.sqrt(probs[result]) 328 probs = np.abs(tensor) ** 2 329 probs = np.transpose(probs, indices) 330 probs = np.reshape(probs, np.prod(probs.shape, dtype=np.int64)) 334 probs = ( 347 probs = np.sum(probs, axis=tuple(range(1, len(probs.shape)))) 350 probs /= np.sum(probs) [all …]
|
/dports/science/py-cirq-ionq/Cirq-0.13.1/cirq-core/cirq/sim/ |
H A D | state_vector.py | 216 probs = _probs(state_vector, indices, shape) 221 result = prng.choice(len(probs), size=repetitions, p=probs) 290 result = prng.choice(len(probs), p=probs) 317 out /= np.sqrt(probs[result]) 328 probs = np.abs(tensor) ** 2 329 probs = np.transpose(probs, indices) 330 probs = np.reshape(probs, np.prod(probs.shape, dtype=np.int64)) 334 probs = ( 347 probs = np.sum(probs, axis=tuple(range(1, len(probs.shape)))) 350 probs /= np.sum(probs) [all …]
|
H A D | density_matrix_utils.py | 80 probs = _probs(density_matrix, indices, qid_shape) 85 result = prng.choice(len(probs), size=repetitions, p=probs) 160 result = prng.choice(len(probs), p=probs) 184 out /= probs[result] 201 probs = np.abs(tensor) 202 probs = np.transpose(probs, indices) 203 probs = np.reshape(probs, np.prod(probs.shape, dtype=np.int64)) 207 probs = np.abs( 217 probs = np.sum(probs, axis=tuple(range(1, len(probs.shape)))) 220 probs /= np.sum(probs) [all …]
|
/dports/sysutils/istio/istio-1.6.7/vendor/github.com/openshift/api/vendor/gonum.org/v1/gonum/stat/distuv/ |
H A D | categorical_test.go | 52 probs := make([]float64, len(test)) 53 for i := range probs { 54 probs[i] = dist.Prob(float64(i)) 63 probs = make([]float64, len(test)) 64 for i := range probs { 65 probs[i] = dist.Prob(float64(i)) 67 same = samedDistCategorical(dist, counts, probs, 1e-2) 79 probs = make([]float64, len(test)) 80 for i := range probs { 81 probs[i] = dist.Prob(float64(i)) [all …]
|
/dports/math/py-statsmodels/statsmodels-0.13.1/statsmodels/stats/ |
H A D | diagnostic_gen.py | 94 probs = np.array([expected[idx].sum(0) for idx in indices]) 97 resid_pearson = (freqs - probs) / np.sqrt(probs) 98 chi2_stat_groups = ((freqs - probs)**2 / probs).sum(1) 113 probs=probs, 219 def cov_multinomial(probs): argument 228 k = probs.shape[-1] 230 cov = probs[..., None] * probs[..., None, :] 232 cov[..., di[0], di[1]] += probs 236 def var_multinomial(probs): argument 242 var = probs * (1 - probs)
|
/dports/textproc/R-cran-vroom/vroom/tests/testthat/ |
H A D | test-problems.R | 5 probs <- problems(x) globalVar 7 expect_equal(probs$row, 3) 8 expect_equal(probs$col, 2) 9 expect_equal(probs$expected, "a double") 10 expect_equal(probs$actual, "1.x") 25 probs <- problems(x) globalVar 27 expect_equal(probs$row, c(3, 2)) 28 expect_equal(probs$col, c(2, 1)) 108 probs <- problems(res) globalVar 109 expect_equal(probs$row, 7) [all …]
|
/dports/math/R-cran-matrixStats/matrixStats/inst/benchmarking/ |
H A D | colRowQuantiles_subset.md.rsp | 41 probs <- seq(from = 0, to = 1, by = 0.25) 44 "colQuantiles_X_S" = colQuantiles(X_S, probs = probs, na.rm = FALSE), 45 …"colQuantiles(X, rows, cols)" = colQuantiles(X, rows = rows, cols = cols, probs = probs, na.rm = … 46 "colQuantiles(X[rows, cols])" = colQuantiles(X[rows, cols], probs = probs, na.rm = FALSE), 55 "rowQuantiles_X_S" = rowQuantiles(X_S, probs = probs, na.rm = FALSE), 56 …"rowQuantiles(X, cols, rows)" = rowQuantiles(X, rows = cols, cols = rows, probs = probs, na.rm = … 57 "rowQuantiles(X[cols, rows])" = rowQuantiles(X[cols, rows], probs = probs, na.rm = FALSE),
|
/dports/security/vault/vault-1.8.2/vendor/github.com/ulikunitz/xz/internal/randtxt/ |
H A D | probs.go | 46 type probs []prob type 53 func (s probs) SortByNgram() { sort.Sort(s) } 60 func (s probs) SearchNgram(g string) int { 66 func (s probs) SearchProb(p float64) int { 72 probs anonMember 76 return s.probs[i].p < s.probs[j].p 82 func cdf(n int, p func(i int) prob) probs { 83 prs := make(probs, n) 107 func pCDFOfLM(lm ngrams) probs { 115 func cCDF(s ngrams) probs { [all …]
|
/dports/sysutils/helmfile/helmfile-0.138.7/vendor/github.com/ulikunitz/xz/internal/randtxt/ |
H A D | probs.go | 46 type probs []prob type 53 func (s probs) SortByNgram() { sort.Sort(s) } 60 func (s probs) SearchNgram(g string) int { 66 func (s probs) SearchProb(p float64) int { 72 probs anonMember 76 return s.probs[i].p < s.probs[j].p 82 func cdf(n int, p func(i int) prob) probs { 83 prs := make(probs, n) 107 func pCDFOfLM(lm ngrams) probs { 115 func cCDF(s ngrams) probs { [all …]
|
/dports/sysutils/jest/jest-f76bc46/vendor/github.com/ulikunitz/xz/internal/randtxt/ |
H A D | probs.go | 46 type probs []prob type 53 func (s probs) SortByNgram() { sort.Sort(s) } 60 func (s probs) SearchNgram(g string) int { 66 func (s probs) SearchProb(p float64) int { 72 probs anonMember 76 return s.probs[i].p < s.probs[j].p 82 func cdf(n int, p func(i int) prob) probs { 83 prs := make(probs, n) 107 func pCDFOfLM(lm ngrams) probs { 115 func cCDF(s ngrams) probs { [all …]
|
/dports/sysutils/istio/istio-1.6.7/vendor/github.com/ulikunitz/xz/internal/randtxt/ |
H A D | probs.go | 46 type probs []prob type 53 func (s probs) SortByNgram() { sort.Sort(s) } 60 func (s probs) SearchNgram(g string) int { 66 func (s probs) SearchProb(p float64) int { 72 probs anonMember 76 return s.probs[i].p < s.probs[j].p 82 func cdf(n int, p func(i int) prob) probs { 83 prs := make(probs, n) 107 func pCDFOfLM(lm ngrams) probs { 115 func cCDF(s ngrams) probs { [all …]
|
/dports/sysutils/terraform/terraform-1.0.11/vendor/github.com/ulikunitz/xz/internal/randtxt/ |
H A D | probs.go | 46 type probs []prob type 53 func (s probs) SortByNgram() { sort.Sort(s) } 60 func (s probs) SearchNgram(g string) int { 66 func (s probs) SearchProb(p float64) int { 72 probs anonMember 76 return s.probs[i].p < s.probs[j].p 82 func cdf(n int, p func(i int) prob) probs { 83 prs := make(probs, n) 107 func pCDFOfLM(lm ngrams) probs { 115 func cCDF(s ngrams) probs { [all …]
|
/dports/devel/bit/bit-1.1.2/vendor/github.com/ulikunitz/xz/internal/randtxt/ |
H A D | probs.go | 46 type probs []prob type 53 func (s probs) SortByNgram() { sort.Sort(s) } 60 func (s probs) SearchNgram(g string) int { 66 func (s probs) SearchProb(p float64) int { 72 probs anonMember 76 return s.probs[i].p < s.probs[j].p 82 func cdf(n int, p func(i int) prob) probs { 83 prs := make(probs, n) 107 func pCDFOfLM(lm ngrams) probs { 115 func cCDF(s ngrams) probs { [all …]
|
/dports/math/R-cran-matrixStats/matrixStats/tests/ |
H A D | rowOrderStats_subset.R | 3 rowOrderStats_R <- function(x, probs, ..., useNames = NA) { argument 4 ans <- apply(x, MARGIN = 1L, FUN = quantile, probs = probs, type = 3L) 22 probs <- 0.3 globalVar 31 if (is.null(cols)) which <- round(probs * ncol(x)) 37 else which <- round(probs * ncol(xx)) 44 which = which, probs = probs, useNames = useNames) 47 which = which, probs = probs, useNames = useNames)
|