Sentence examples for if it assigns from inspiring English sources

Let E be a real uniformly convex and uniformly smooth Banach space, K be a nonempty proper subset of E. The operator (P_{K} Erightarrow K) is called a metric projection operator if it assigns to each (xin E) its nearest point (bar{x} in K), which is the solution of the minimization problem P_{K}x=bar{x};quad bar{x}mboxVert x-bar{x}Vert = inf_{xiin K}|x-xi|.

Let E be a real uniformly convex and uniformly smooth Banach space, K be a nonempty proper subset of E. The operator (P_{K} Erightarrow K) is called a metric projection operator if it assigns to each (xin E) its nearest point (bar{x} in K), which is the solution of the minimization problem P_{K}x=bar{x};quad bar{x}:|x-bar{x}|= inf_{xiin K} |x-xi|.

τ on (Delta^) is a triangle function if it assigns a d.d.f. in (Delta^) to every pair of d.d.f.'s in (Delta^timesDelta^) and satisfies the following conditions: begin{aligned}& tau(F,G) = tau(G, F), & tau(F,G) leq tau K, R) quad mbox{whenever } Fleq K, Gleq R, & tau(F,H) = F, & taubigl tau(F,G), Rbigr) = taubigl(F,tau(G,R bigr).

Λ∶V→L is a surjective mapping and it is called a multi level function if it assigns to each vertex an element of the level set L. A graph H = (V,EGT) is called a finite, undirected generalized tree if its edge set can be represented by the union EGT: = E1∪E2∪E3, where E1 forms the edge set of the underlying undirected rooted tree T. E2 denotes the set of horizontal Across-edges.

For its part, the White House's denials about this leak would sound more credible if it assigned some urgency to solving the C.I.A. leak case.

So, if the agent has a goal to get to the other side of a street and it is raining, it might prefer the action of carrying an umbrella if it also assigns higher utility to staying dry.

For instance, perhaps it is a virtue of a credence function if the credences it assigns cohere with one another in a particular way, and a vice if they do not.

We say that a credence function is actually calibrated at a particular possible world if the credence it assigns to a proposition matches the relative frequency with which propositions of that kind are true at that world.

And we say that a credence function is hypothetically calibrated if the credence it assigns to a proposition matches the limiting relative frequency with which propositions of that kind would be true were there more propositions of that kind.

The priority classes in each cell are organised in the manner portrayed in Figure 3, such that when a MS is allocated to a particular priority class, its RBs (if it is assigned more than one) can be allocated contiguously, a feature particular to an LTE uplink.

For example, a cell is assigned to the endoplasm reticulum (ER) class if it is assigned to ER in the ER-all, ER-Cytoplasm and ER-Vacuole/Vacuolar Membrane, and ER-Cell Periphery binary classifiers (Table 2).