| /dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-clustering/src/main/java/de/lmu/ifi/dbs/elki/evaluation/clustering/internal/ |
| H A D | EvaluateVarianceRatioCriteria.java | 91 private boolean penalize = true; field in EvaluateVarianceRatioCriteria
104 public EvaluateVarianceRatioCriteria(NoiseHandling noiseOption, boolean penalize) { in EvaluateVarianceRatioCriteria() argument
107 this.penalize = penalize; in EvaluateVarianceRatioCriteria()
163 if(penalize && ignorednoise > 0) { in evaluateClustering()
256 private boolean penalize = true; field in EvaluateVarianceRatioCriteria.Parameterizer
270 penalize = penalizeP.isFalse(); in makeOptions()
277 return new EvaluateVarianceRatioCriteria<>(noiseOption, penalize); in makeInstance()
|
| H A D | EvaluateSilhouette.java | 101 private boolean penalize = true; field in EvaluateSilhouette
115 …uateSilhouette(DistanceFunction<? super O> distance, NoiseHandling noiseOption, boolean penalize) { in EvaluateSilhouette() argument
119 this.penalize = penalize; in EvaluateSilhouette()
209 if(penalize && ignorednoise > 0) { in evaluateClustering()
278 private boolean penalize = true; field in EvaluateSilhouette.Parameterizer
296 penalize = penalizeP.isFalse(); in makeOptions()
303 return new EvaluateSilhouette<>(distance, noiseOption, penalize); in makeInstance()
|
| H A D | EvaluateSimplifiedSilhouette.java | 85 private boolean penalize = true; field in EvaluateSimplifiedSilhouette
99 …iedSilhouette(NumberVectorDistanceFunction<?> distance, NoiseHandling noiseOpt, boolean penalize) { in EvaluateSimplifiedSilhouette() argument
103 this.penalize = penalize; in EvaluateSimplifiedSilhouette()
187 if(penalize && ignorednoise > 0) { in evaluateClustering()
271 private boolean penalize = true; field in EvaluateSimplifiedSilhouette.Parameterizer
290 penalize = penalizeP.isFalse(); in makeOptions()
297 return new EvaluateSimplifiedSilhouette(distance, noiseOption, penalize); in makeInstance()
|
| /dports/net/cjdns/cjdns-cjdns-v21.1/contrib/python/ |
| H A D | trashroutes | 83 penalize = True;
89 if (j == i): penalize = False;
90 if not penalize: break;
91 if penalize: penalty += 1;
|
| /dports/news/nget/nget-0.27.1/ |
| H A D | sockpool.cc | 117 nconfig.penalize(server); in connect()
132 if (nconfig.penalize(connection->server)) in release()
|
| H A D | server.h | 140 bool penalize(c_server::ptr server) const;
|
| /dports/science/pybrain/pybrain-0.3.3/pybrain/rl/environments/functions/ |
| H A D | transformations.py | 79 def penalize(x, distance=5): function
105 return basef.f(x) + penalize(x, distance) * penalizationFactor
230 + penalized * penalize(x))
|
| H A D | multimodal.py | 13 from pybrain.rl.environments.functions.transformations import penalize, generateDiags
139 … return - 1. / float(self.xdim) * sum(z * sin(sqrt(abs(z)))) + self._k + 100 * penalize(z / 100.)
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/docs/KeywordMetadata/ |
| H A D | method-soga-fitness_type-constraint_penalty | 5 formulation to penalize infeasible designs. The specification allows the input
|
| /dports/math/gismo/gismo-21.12.0/src/gsAssembler/ |
| H A D | gsCDRAssembler.hpp | 64 else if (m_options.getInt("DirichletStrategy") == dirichlet::penalize) in assemble()
|
| H A D | gsPoissonAssembler.hpp | 63 case dirichlet::penalize: in assemble()
|
| H A D | gsAssemblerOptions.h | 25 penalize = 13, ///< Penalize the diagonal at the position of Dirichlet DoFs, enumerator
|
| /dports/devel/hadoop2/hadoop-2.7.2-src/hadoop-mapreduce-project/hadoop-mapreduce-client/hadoop-mapreduce-client-core/src/main/java/org/apache/hadoop/mapreduce/task/reduce/ |
| H A D | MapHost.java | 107 public synchronized void penalize() { in penalize() method in MapHost
|
| /dports/print/lilypond-devel/lilypond-2.23.5/lily/ |
| H A D | page-turn-engraver.cc | 59 vector<Page_turn_event> penalize (Page_turn_event const &penalty) in penalize() function in Page_turn_event
314 vector<Page_turn_event> split = brk.penalize (repeat_penalties_[rep_index]); in finalize()
|
| /dports/print/lilypond/lilypond-2.22.1/lily/ |
| H A D | page-turn-engraver.cc | 56 vector<Page_turn_event> penalize (Page_turn_event const &penalty) in penalize() function in Page_turn_event
302 vector<Page_turn_event> split = brk.penalize (repeat_penalties_[rep_index]); in finalize()
|
| /dports/devel/gnulib/gnulib-20140202-stable/doc/posix-functions/ |
| H A D | gettimeofday.texi | 22 However, rather than penalize these systems with a replacement
|
| /dports/security/pkcs11-tools/pkcs11-tools-2.5.0/.gnulib/doc/posix-functions/ |
| H A D | gettimeofday.texi | 22 However, rather than penalize these systems with a replacement
|
| /dports/lang/gcc12-devel/gcc-12-20211205/gcc/config/rs6000/ |
| H A D | rs6000.opt | 645 When costing for loop vectorization, we probably need to penalize the loop body
649 total cost of vec_cost and non vec_cost, and penalize only if the proportion
655 vec_cost and non vec_cost, and penalize only if the sum exceeds the threshold
661 rs6000-density-size-threshold are satisfied, we decide to penalize the loop
667 When costing for loop vectorization, we probably need to penalize the loop body
671 penalize only if the proportion exceeds the threshold specified by this
678 and penalize only if it's satisfied. The default value is 20.
|
| /dports/multimedia/subsync/subsync-d9798a5/ |
| H A D | HISTORY.rst | 25 * Change to alignment algo: don't penalize matching video non-speech with subtitle speech;
|
| /dports/biology/vcflib/vcflib-1.0.2/doc/ |
| H A D | vcfremap.md | 31 -R, --repeat-gap-extend N penalize non-repeat-unit gaps in repeat sequence
|
| /dports/misc/vxl/vxl-3.3.2/contrib/rpl/rgrl/ |
| H A D | rgrl_feature_based_registration.cxx | 234 penalize_scaling( bool penalize) in penalize_scaling() argument
236 should_penalize_scaling_ = penalize; in penalize_scaling()
|
| /dports/lang/smalltalk/smalltalk-3.2.5/examples/ |
| H A D | Bench.st | 14 table should penalize it more.
|
| /dports/math/R-cran-quantreg/quantreg/man/ |
| H A D | rqss.Rd | 62 The option \code{method = "lasso"} allows one to penalize the coefficients
110 for univariate smoothing, it is also possible to penalize total variation of
|
| /dports/security/amavisd-new/amavis-v2.12.0/ |
| H A D | amavisd-new-qmqpqq.patch | 321 +my($self,$code,$resp,$penalize,$line) = @_;
325 +if($penalize) {
|
| /dports/science/code_saturne/code_saturne-7.1.0/src/alge/ |
| H A D | cs_grid.c | 2904 bool *penalize = NULL; in _automatic_aggregation_mx_native() local
2946 BFT_MALLOC(penalize, f_n_rows, bool); in _automatic_aggregation_mx_native()
2950 penalize[ii] = false; in _automatic_aggregation_mx_native()
2987 penalize[ii] = true; in _automatic_aggregation_mx_native()
3081 BFT_FREE(penalize); in _automatic_aggregation_mx_native()
3110 bool *penalize = NULL; in _automatic_aggregation_mx_msr() local
3163 penalize[ii] = false; in _automatic_aggregation_mx_msr()
3191 penalize[ii] = true; in _automatic_aggregation_mx_msr()
3211 if (penalize[ii]) in _automatic_aggregation_mx_msr()
3225 if (!penalize[jj]) { in _automatic_aggregation_mx_msr()
[all …]
|