| /external/ltp/include/ |
| D | tst_fuzzy_sync.h | 135 int sampling; member
267 pair->sampling = pair->min_samples; in tst_fzsync_pair_reset()
466 if (pair->sampling > 0 || over_max_dev) { in tst_fzsync_pair_update()
476 if (pair->sampling > 0 && --pair->sampling == 0) { in tst_fzsync_pair_update()
486 if (!pair->sampling) { in tst_fzsync_pair_update()
494 pair->sampling = -1; in tst_fzsync_pair_update()
496 } else if (!pair->sampling) { in tst_fzsync_pair_update()
498 pair->sampling = -1; in tst_fzsync_pair_update()
596 && (pair->sampling > 0)) { in tst_fzsync_run_a()
600 pair->sampling = 0; in tst_fzsync_run_a()
[all …]
|
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| D | api_def_AllCandidateSampler.pbtxt | 51 estimate the post-rejection sampling probabilities.
68 summary: "Generates labels for candidate sampling with a learned unigram distribution."
70 See explanations of candidate sampling and the data formats at
71 go/candidate-sampling.
75 The advantages of sampling candidates per-batch are simplicity and the
|
| D | api_def_UniformCandidateSampler.pbtxt | 51 estimate the post-rejection sampling probabilities.
74 summary: "Generates labels for candidate sampling with a uniform distribution."
76 See explanations of candidate sampling and the data formats at
77 go/candidate-sampling.
81 The advantages of sampling candidates per-batch are simplicity and the
|
| D | api_def_LogUniformCandidateSampler.pbtxt | 51 estimate the post-rejection sampling probabilities.
74 summary: "Generates labels for candidate sampling with a log-uniform distribution."
76 See explanations of candidate sampling and the data formats at
77 go/candidate-sampling.
81 The advantages of sampling candidates per-batch are simplicity and the
|
| D | api_def_ThreadUnsafeUnigramCandidateSampler.pbtxt | 52 estimate the post-rejection sampling probabilities.
75 summary: "Generates labels for candidate sampling with a learned unigram distribution."
77 See explanations of candidate sampling and the data formats at
78 go/candidate-sampling.
82 The advantages of sampling candidates per-batch are simplicity and the
|
| D | api_def_LearnedUnigramCandidateSampler.pbtxt | 51 estimate the post-rejection sampling probabilities.
74 summary: "Generates labels for candidate sampling with a learned unigram distribution."
76 See explanations of candidate sampling and the data formats at
77 go/candidate-sampling.
81 The advantages of sampling candidates per-batch are simplicity and the
|
| D | api_def_CropAndResize.pbtxt | 50 A string specifying the sampling method for resizing. It can be either
51 `"bilinear"` or `"nearest"` and default to `"bilinear"`. Currently two sampling
64 sampling or nearest neighbor sampling (possibly with aspect ratio change) to a
|
| D | api_def_FixedUnigramCandidateSampler.pbtxt | 51 estimate the post-rejection sampling probabilities.
76 unigram sampling (as defined by the vocab file), and distortion = 0.0 gives
85 word token is used as ID 0. These IDs will have a sampling probability of 0.
127 summary: "Generates labels for candidate sampling with a learned unigram distribution."
139 The advantages of sampling candidates per-batch are simplicity and the
|
| /external/libyuv/files/docs/ |
| D | filtering.md | 34 For odd scale factors (e.g. 3x down) this is exactly the middle, and point sampling is used.
37 **Box** filter averages the entire box so sampling starts at 0.
59 …hod could be used for down sampling, and then it would be more reversible, but that would prevent …
94 // Scale step for point sampling duplicates all pixels equally.
100 // Scale step for bilinear sampling renders last pixel once for upsample.
116 // Scale step for bilinear sampling renders last pixel once for upsample.
127 // Scale step for point sampling duplicates all pixels equally.
143 Point sampling should ideally be the same as bilinear, but pixel by pixel, round to nearest neighbo…
155 Bilinear filtering is currently correct for down sampling, but not for upsampling.
161 … of the scale factor, to match the pixel that would be sampled for down sampling by the same amoun…
[all …]
|
| /external/u-boot/doc/device-tree-bindings/exynos/ |
| D | sound.txt | 9 - samsung,i2s-sampling-rate : sampling rate, default is 48000
21 samsung,i2s-sampling-rate = <48000>;
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/nonstiff/ |
| D | RungeKuttaIntegrator.java | 25 import org.apache.commons.math.ode.sampling.AbstractStepInterpolator;
26 import org.apache.commons.math.ode.sampling.DummyStepInterpolator;
27 import org.apache.commons.math.ode.sampling.StepHandler;
|
| D | EmbeddedRungeKuttaIntegrator.java | 23 import org.apache.commons.math.ode.sampling.AbstractStepInterpolator;
24 import org.apache.commons.math.ode.sampling.DummyStepInterpolator;
25 import org.apache.commons.math.ode.sampling.StepHandler;
|
| D | AdamsBashforthIntegrator.java | 24 import org.apache.commons.math.ode.sampling.NordsieckStepInterpolator;
25 import org.apache.commons.math.ode.sampling.StepHandler;
|
| /external/libopus/ |
| D | README.draft | 32 Usage: opus_demo [-e] <application> <sampling rate (Hz)> <channels (1/2)>
34 opus_demo -d <sampling rate (Hz)> <channels (1/2)> [options]
44 default: sampling rate
|
| /external/mesa3d/src/gallium/docs/source/cso/ |
| D | sampler.rst | 7 this state controls an individual texture unit's texel-sampling settings.
34 nearest sampling mode.
69 the texture LOD value are sampled from. The results of sampling from
76 If set to PIPE_TEX_COMPARE_R_TO_TEXTURE, the result of texture sampling
108 Maximum anistropy ratio to use when sampling from textures. For example,
|
| /external/swiftshader/third_party/llvm-7.0/llvm/docs/ |
| D | BranchWeightMetadata.rst | 72 block and entry counts which may not be accurate with sampling.
143 sampling-based profiles, this operand is an approximation of how many times
158 set by sampling based profile. It is needed because the sampling based profile
|
| /external/speex/libspeexdsp/ |
| D | filterbank.c | 54 FilterBank *filterbank_new(int banks, spx_word32_t sampling, int len, int type) in filterbank_new() argument
62 df = DIV32(SHL32(sampling,15),MULT16_16(2,len)); in filterbank_new()
63 max_mel = toBARK(EXTRACT16(sampling/2)); in filterbank_new()
|
| /external/compiler-rt/lib/esan/ |
| D | esan_flags.inc | 41 "Working set tool: sampling frequency in milliseconds.")
46 ESAN_FLAG(int, snapshot_step, 2, "Working set tool: the log of the sampling "
|
| /external/libgsm/ |
| D | README | 15 GSM 06.10 compresses frames of 160 13-bit samples (8 kHz sampling
21 form (given the bandwidth limitations of 8 kHz sampling rate).
|
| /external/u-boot/arch/arm/dts/ |
| D | exynos5250.dtsi | 85 samsung,i2s-sampling-rate = <48000>;
97 samsung,i2s-sampling-rate = <48000>;
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/ |
| D | MultistepIntegrator.java | 27 import org.apache.commons.math.ode.sampling.StepHandler;
28 import org.apache.commons.math.ode.sampling.StepInterpolator;
|
| /external/tensorflow/tensorflow/contrib/eager/python/examples/l2hmc/ |
| D | README.md | 8 for a Hamiltonian Monte Carlo (HMC) sampling algorithm. More specifically, the non-volume preserving
37 For example, we could wrap the function that does the sampling step:
|
| /external/grpc-grpc/tools/gource/ |
| D | gource.sh | 17 --multi-sampling \
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/sampling/ |
| D | FixedStepHandler.java | 18 package org.apache.commons.math.ode.sampling;
|
| D | StepHandler.java | 18 package org.apache.commons.math.ode.sampling;
|