Sentence examples for whose partitioning from inspiring English sources

Such additives include spin labels designed to be "anchored" within a given region of the membrane or small freely diffusing paramagnetic species, whose partitioning properties across the water membrane interface create a gradient of paramagnetic effects which correlate with depth.

A possible explanation is that these are polar organic compounds, whose partitioning behavior cannot be well characterized by means of octanol water partition coefficients.

To accommodate individual choices regarding test assortments, students were asked to individually sign up for desired test parts, whose partitioning in turn reflected the structure of the related tuition modules.

Particularly, we observe that there may exist a landmark (l_i) whose partition equals to that of (l_j), thus we say (l_i) and (l_j) have the same discriminative information.

A bipartite graph is often denoted by ( mathbb{G}=left(mathbb{U},mathbb{V},mathbb{E}right) ), whose partition has the parts ( mathbb{U} ) and ( mathbb{V} ), with ( mathbb{E} ) denoting the edges of the graph.

A traditional discriminative approach, not premised on any generative model, involves the computation of hyperplanes that partition the clusters of known class instances from one another (optimizing certain metrics involving in-class and between-class variance); new instances are assigned to the class into whose partition they fall.

1. Stop if there is a pair of characters whose partition intersection graph contains a cycle.

This is a weighted bipartite graph whose partitions and are the sets of genes in genomes A and B, respectively.

Suppose P m is the one whose partition score is the minimum among all 2 q extensions.

In each iteration of H-BOP, for each row i we maintain a binary max heap H to store the candidate partitions of R(i) whose partition scores are among the k smallest.

Let P i * be the projection on R(i) of the global optimal partition of M. If the partition score of P i * is among the k smallest ones of all possible partitions of R(i), we only need to compute k partitions of R(i) whose partition scores are the smallest in each iteration without losing the global optimal partition at the end.