| /dports/textproc/py-gensim/gensim-4.0.1/gensim/similarities/ |
| H A D | docsim.py | 206 index.num_best = self.num_best
346 self.num_best = num_best
459 shard.num_best = self.num_best
539 shard.num_best = self.num_best
547 if self.num_best is None:
564 result = _nlargest(self.num_best, results)
573 merged = _nlargest(self.num_best, parts)
803 self.num_best = num_best
941 self.num_best = num_best
1040 self.num_best = num_best
[all …]
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/src/ |
| H A D | PEBBLMinimizer.cpp | 91 size_t i, num_best = bestVariablesArray.size(); in print_results() local
92 if (num_best != bestResponseArray.size()) { in print_results()
105 for (i=0; i<num_best; ++i) { in print_results()
108 if (num_best > 1) s << "(set " << i+1 << ") "; in print_results()
115 if (num_best > 1) s << "(set " << i+1 << ") "; s << "=\n"; in print_results()
121 num_best, i, in print_results()
|
| H A D | DataTransformModel.hpp | 69 size_t num_best, size_t best_ind);
76 size_t num_best, size_t best_ind);
193 size_t num_best, size_t best_ind,
200 size_t num_best, size_t best_ind,
209 const int &exp_index, const int &num_best,
216 const int &exp_index, const int &num_best,
|
| H A D | DataTransformModel.cpp | 891 size_t num_best, size_t best_ind) in print_best_responses() argument
926 num_best, best_ind, s); in print_best_responses()
931 num_best, best_ind, s); in print_best_responses()
939 size_t num_best, size_t best_ind, in recover_submodel_responses() argument
1069 if(num_best > 1) in archive_best_original()
1146 i, num_best, best_ind); in archive_submodel_responses()
1150 num_best, best_ind); in archive_submodel_responses()
1167 size_t num_best, size_t best_ind) { in archive_best_responses() argument
1202 resid_fns, wssr, num_best, best_ind); in archive_best_responses()
1212 const int &num_best, in archive_best_config_variables() argument
[all …]
|
| H A D | DakotaOptimizer.cpp | 198 size_t i, num_best = bestVariablesArray.size(); in print_results() local
199 if (num_best != bestResponseArray.size()) { in print_results()
216 for (i=0; i<num_best; ++i) { in print_results()
221 if (num_best > 1) s << "(set " << i+1 << ") "; in print_results()
225 if (num_best > 1) in print_results()
240 if (num_best > 1) s << "(set " << i+1 << ") "; s << "=\n"; in print_results()
251 num_best, i); in print_results()
259 num_best, i, s); // the weights are only used to compute the norm in print_results()
265 if (num_best > 1) s << "(set " << i+1 << ") "; s << "=\n"; in print_results()
|
| H A D | DakotaMinimizer.cpp | 1018 size_t num_best, size_t best_index, in print_model_resp() argument
1023 if (num_best > 1) s << "(set " << best_index+1 << ") "; s << "=\n"; in print_model_resp()
1030 size_t num_best, size_t best_index, in print_residuals() argument
1036 if (num_best > 1) s << "(set " << best_index+1 << ") "; s << "=\n"; in print_residuals()
1045 if (num_best > 1) s << "(set " << best_index+1 << ") "; in print_residuals()
1054 size_t i, num_best = bestVariablesArray.size(); in archive_best_results() local
1055 if (num_best != bestResponseArray.size()) { in archive_best_results()
1088 for (i=0; i<num_best; ++i) { in archive_best_results()
1095 num_best, i); in archive_best_results()
1102 for(i=0; i < num_best; ++i) { in archive_best_results()
[all …]
|
| H A D | SurrBasedMinimizer.cpp | 811 size_t i, num_best = bestVariablesArray.size(); in print_results() local
812 if (num_best != bestResponseArray.size()) { in print_results()
826 for (i=0; i<num_best; ++i) { in print_results()
829 if (num_best > 1) s << "(set " << i+1 << ") "; in print_results()
836 if (num_best > 1) s << "(set " << i+1 << ") "; s << "=\n"; in print_results()
842 num_best, i, in print_results()
847 if (num_best > 1) s << "(set " << i+1 << ") "; s << "=\n"; in print_results()
|
| H A D | DakotaMinimizer.hpp | 63 size_t num_best, size_t best_index,
68 size_t num_best, size_t best_index,
|
| H A D | DakotaLeastSq.cpp | 163 size_t num_best = 1, best_ind = 0; in print_results() local
194 bestResponseArray.front(), num_best, best_ind); in print_results()
206 num_best, best_ind, s); in print_results()
|
| H A D | NonDQUESOBayesCalibration.cpp | 704 int num_best = bestSamples.size(); in best_to_all() local
705 if (allSamples.numCols() != num_best) in best_to_all()
706 allSamples.shapeUninitialized(numContinuousVars, num_best); in best_to_all()
|
| /dports/textproc/py-gensim/gensim-4.0.1/gensim/ |
| H A D | interfaces.py | 339 if self.num_best is None:
345 return matutils.scipy2scipy_clipped(result, self.num_best)
350 return [matutils.full2sparse_clipped(v, self.num_best) for v in result]
353 return matutils.full2sparse_clipped(result, self.num_best)
|
| /dports/textproc/py-gensim/gensim-4.0.1/gensim/test/ |
| H A D | test_similarities.py | 76 index.num_best = num_best
95 self.testFull(num_best=num_best)
197 self.assertEqual(index.num_best, index2.num_best)
217 self.assertEqual(index.num_best, index2.num_best)
239 self.assertEqual(index.num_best, index2.num_best)
261 self.assertEqual(index.num_best, index2.num_best)
284 self.assertEqual(index.num_best, index2.num_best)
318 index.num_best = num_best
391 index = self.cls(CORPUS, self.similarity_matrix, num_best=num_best)
408 index = self.cls(query, self.similarity_matrix, num_best=num_best)
[all …]
|
| H A D | simspeed2.py | 66 index_dense.num_best = 10
78 index_dense.num_best = None
97 index_sparse.num_best = 10
110 index_sparse.num_best = None
|
| H A D | simspeed.py | 129 index_dense.num_best = 10
144 index_dense.num_best = None
171 index_sparse.num_best = 10
186 index_sparse.num_best = None
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/src/unit_test/ |
| H A D | h5py_console_extract.py | 352 num_best = 0
362 num_best += 1
364 num_funcs = len(all_labels) - num_best - num_starts
365 func_labels = all_labels[num_best + num_starts:]
388 results["best"].append(values[num_starts:num_starts+num_best])
389 results["functions"].append(values[num_starts+num_best:])
409 num_best = 0
417 num_best = len(all_labels) - num_weights*2
|
| /dports/misc/py-gluonnlp/gluon-nlp-0.10.0/src/gluonnlp/data/ |
| H A D | transforms.py | 541 def __init__(self, path, num_best=0, alpha=1.0): argument
544 self._nbest = num_best
818 num_best=0, argument
823 self._num_best = num_best
|
| /dports/math/py-cvxpy/cvxpy-1.1.17/cvxpy/reductions/solvers/conic_solvers/ |
| H A D | cplex_conif.py | 139 return status.num_best
155 status.num_best):
|
| /dports/science/openbabel/openbabel-3.1.1/src/formats/libinchi/ |
| H A D | strutil.c | 793 int num_best; in nFindOneOM() local
803 num_best = 1; in nFindOneOM()
815 num_best = 1; in nFindOneOM()
818 ord_OM[num_best ++] = ord_OM[i]; in nFindOneOM()
821 num_OM = num_best; in nFindOneOM()
826 num_best = 1; in nFindOneOM()
838 num_best = 1; in nFindOneOM()
844 num_OM = num_best; in nFindOneOM()
853 num_best = 1; in nFindOneOM()
865 num_best = 1; in nFindOneOM()
[all …]
|
| /dports/biology/ncbi-toolkit/ncbi/api/ |
| H A D | aceread.c | 3354 int num_best, sum_best; in ReplaceConsensusSequenceFromTraces() local
3408 num_best = 0; in ReplaceConsensusSequenceFromTraces()
3412 num_best ++; in ReplaceConsensusSequenceFromTraces()
3416 if (num_best == 0) { in ReplaceConsensusSequenceFromTraces()
3419 new_qual_scores[num_qual_scores++] = sum_best / num_best; in ReplaceConsensusSequenceFromTraces()
|
| /dports/graphics/tesseract/tesseract-5.0.0/src/ccmain/ |
| H A D | control.cpp | 796 int num_best = 0, num_new = 0; in SelectBestWords() local
848 ++num_best; in SelectBestWords()
867 return num_new - num_best; in SelectBestWords()
|
| /dports/misc/py-gluonnlp/gluon-nlp-0.10.0/scripts/bert/data/ |
| H A D | create_pretraining_data.py | 532 tokenizer = nlp.data.BERTSPTokenizer(args.sentencepiece, vocab, num_best=args.sp_nbest,
|