Sentence examples for subset of spheres from inspiring English sources

In particular, the localization of binding site(s) is composed of three related operations: 1) generating the molecular surface of the receptor using the DMS program; 2) generating spheres surrounding the receptor using the Sphgen program; and 3) selecting a subset of spheres to represent the binding site(s) using the Sphere_selector program.

The rinsing of spheres required to eliminate the glucose within the buffer between runs may have resulted in a different subset of spheres being interrogated each time that ultimately could add noise to the system.

(b) What is the mean number of pinwheels within a given subset of the sphere, relative to the (spherical) area of this subset?

What is the mean number of pinwheels within a given subset of the sphere, relative to the (spherical) area of this subset?

Let X be a nonempty finite subset of the sphere of dimension n−1, where n⩾3.

Also, any proper subset of a sphere is not necessarily totally convex.

In this paper, we define the concept of a spherical T-design for a finite subset of a sphere.

We obtain that finding a lexicographically minimum quasi-matching is equivalent to minimizing any strictly convex function on the degrees of the A-side of a quasi-matching and use this fact to prove a more general statement: the optima of any component-based strictly convex cost function on any subset of L1-sphere in Nn are precisely the lexicographically minimal elements of this subset.

Notice, however, that we are evaluating star generalized surface contents of subsets of antinorm spheres, here, while star generalized surface contents of subsets of norm spheres are considered in the preceding example.

Let V be a norm-closed subset of the unit sphere of a Hilbert space H that is stable under multiplication by scalars of absolute value 1.

Since (f n - f m ) (v m, n ) = 2, f n - f m V * = 2. Therefore, A = { f n : n = 1, 2, … } is a countable 2-separated subset of the unit sphere S V *.