Sentence examples for option parameters from inspiring English sources

Finding the optimum value was not a necessity only for the raddi parameter but also for other training option parameters.

If commissioners decide in favor of pursuing the option, parameters such as kind, number, location and cost would have to be determined, Castro said.

Phylogenetic trees were constructed using the neighbor-joining (NJ) method of the MEGA6 program with the p-distance and complete deletion option parameters.

Finally, phylogenetic trees were constructed based on alignments using maximum likelihood (ML) method of MEGA 6.0 (Molecular Evolutionary Genetics Analysis) with complete deletion option parameters engaged [ 113].

Phylogenetic trees including the tomato MMP protein sequences were constructed using the neighbor-joining (NJ) method of the MEGA6 program with the p-distance and complete deletion option parameters [ 50].

Phylogenetic trees based on the protein sequences of the PLDs were constructed using the neighbor-joining (NJ) method of the program MEGA4 [ 43] with p-distance and the complete deletion option parameters engaged.

This chapter gives an introduction to the technological options, choice parameters and engineering rules of the digestion unit, gas storage, pipework, pumps and valves.

This type of 'genfis2' does not deliver the same quality of training data results as does test data except that the radii value, a training option parameter, is selected small which may result in over-fitting problems (Jang 1993).

Table 1 The main options of i-GSEA4GWAS v2 Option Parameter name (separated by ",") Default value Description Select mapping rules of SNPs→genes 20 kb, 5 kb, 100 kb, 500 kb, within gene, customized (0 500 kb) 20 kb The threshold of SNP mapping to its nearest gene.

The individual option, parameter, and process submodel pages display each parameter, option and submodel's value for every stored simulation.

Given an integer v as the value of the space-saving option parameter, for i = 1,…, b, each set of motifs K i is partitioned into ⌈| K i |/ v⌉ subsets K i = { K i, 1, K i, 2, …, K i, ⌈ | K i | / v ⌉ }, each one containing at most v distinct motifs.