Sentence examples for max which can from inspiring English sources

Based on the maximum transmission range of each SU i, R T i ( max ), which can be estimated by Equation (1), we define by the set of all possible directed secondary links, with cardinality K.

Although the typically available upper bound s max, which can be measured from the maximum spectrum utilization observed statistically over a time period, provides a conservative determination of s, the cost is still high due to O s) iterations in detection.

SSR-couples are each two adjacent microsatellites being separated by less than 10 bp (d max ), which can be part of a more complex compound microsatellite.

We called this measure MAX, which can be defined as: where fc(t) comprises the fold changes in all tissues t compared to the mean expression and fc(t') comprises the fold changes in all tissues except the one with the highest fold change of this gene, respectively.

In this case, a line search (such as the bisection method) has to be performed to the variables δ in (12) and (13), and find δ max iteratively, which can be referred to [13 16].

As a result we have a Markov chain of states ψ N (z ), N ∈ [ 0, N max ], which can be used as thermal initial states for classical fields simulations.

Capping your upload rate will keep your upload connection from maxing out, which can drag down all of your other internet traffic.

As it can be gathered, the weighting is uniform inside the [ f min, f max] range, which can result in providing the same weights to a noisy frequency bin as to one that belongs to a speech source.

with ∂ X (t) denoting the sub-gradient of λ max(X (t)), which can be selected as partial mathbf{X}^{(t)} = mathbf{x}_{text{max}}mathbf{x}_{text{max}}^{H}, (26).

We show that this framework is a special case of the Gaussian max-mixtures framework, which can be efficiently incorporated into state-of-the-art graph-based simultaneous localization and mapping (SLAM) solvers.

Each iteration involves two max-min problems, which can be efficiently solved by generalized eigenvalue decomposition and the Dinkelbach's procedure, respectively, to obtain the optimized receive filter vector and unimodular transmit sequence.