Sentence examples for max equal to from inspiring English sources

When an ac field reached the intensity, Ecrit, that generated a maximal membrane potential delta psi max, equal to or greater than the delta psi crit, the membrane was perforated at the two loci facing the electrodes.

We defined the balloon volume at balloon pressure of c − d as the minimal inflating volume (V MIN, equal to [a + b/2] − 0.231b) and c + d as the maximal volume (V MAX, equal to [a + b/2] + 0.231b).

The 12-h steam curing period comprises a 3-h temperature increase at a rate of 13.3 °C/h, a 6-h constant T max equal to 60 °C, and a 3-h temperature decrease at a rate of 13.3 °C/h.

Thus, knowing the matrix Q from the dendritic geometry and the vector c 1 s from the starting edge s, it is possible to construct the sum of c k s ( g ) terms, for all k < k max, equal to the sum of coefficients for all trips travelling up to k max edges, from x ∈ s to y ∈ g.

We selected a narrower range for the estimation of optimal balloon volume and defined the balloon volume at balloon pressure of c − d as the minimal inflating volume (V MIN, equal to [a + b/2] − 0.231b) and c + d as the maximal volume (V MAX, equal to [a + b/2] + 0.231b).

To avoid any theoretical extrapolation of the ROC curve, it makes sense to set FAR max equal to the FAR associated with the rightmost point of the more conservative of the two procedures being compared, as illustrated using hypothetical data in Fig. 5.

The estimated maximum of function d f, d max equals to the estimated maximum of the function value at the domain boundary, and the estimated minimum of function d f, d min equals to the estimated minimum of the function value at the domain boundary.

Then, the maximum backlog D max is equal to Q max.

The upper bound is usually chosen as x max = 2 b max + 1 [4], where b max is equal to the maximum bit width of T. The number of stages S has to be at least the largest minimal adder depth of the coefficients.

In a hypercubic lattice in D dimensions with small J, for example, it is given by v max ≈ 3 J / D along the lattice axes and by v max ≈ 3 J / D along the diagonal (where all the components of v max are equal to each other).

A spanning tree T of G*(Y) with score ω max (T) equal to HC Y) is also known as a bottleneck minimum spanning tree or bottleneck MST, for short.