「subsets」の共起表現一覧(1語右で並び替え)

subsets

1語右で並び替え

該当件数:123件

  • ense that, for every pair of nonempty compact subsets A and B of Rn and every 0 ≤ t ≤ 1,
  • of A. Note that the maximization ranges over subsets A of G, subject to A being over half the size
  • et of the meets of the sets, i.e., for finite subsets A and B of a poset L,
  • ion of the set M of matroid elements into two subsets A and B. If ρ denotes the rank function of th
  • the switch graph may be partitioned into two subsets according to which vertex of the switch graph
  • In this context, directed subsets again provide a generalization of convergent
  • e, because they imply that there exist proper subsets and proper supersets of an infinite set S tha
  • for B cells belonging to both the B-1 and B-2 subsets, and elicits its effects by interacting with
  • so lacks support for higher-order fuzzy sets, subsets, and so on.
  • Cofinal subsets are very important in the theory of directed
  • he puzzle involves "AB elimination", in which subsets are identified within a row whose range of va
  • Directed subsets are used in domain theory, which studies dire
  • elements of the set are called points and the subsets are called lines.
  • plete graph on ω1 vertices into finitely many subsets, at least one of the subsets contains a compl
  • verge uniformly in all derivatives on compact subsets away from the nodes, and
  • be "learned" by splitting the source set into subsets based on an attribute value test.
  • Animal culture media can be divided into five subsets based on the level of defined media (Jayme an
  • As links are added, connected subsets begin to form.
  • SP/k is actually a sequence of language subsets called SP/1, SP/2, … SP/8.
  • ter it generates (i.e., the collection of all subsets containing C) is called the principal filter
  • ile retaining all the constructs of preceding subsets, forming a stepwise system for teaching compu
  • possible division of the vertex set into two subsets has "many" links between those two subsets.
  • For a complete lattice, arbitrary subsets have both infima and suprema and thus infinit
  • In other words, the number of subsets in each subcollection T is less than or equal
  • k Safer C pioneered the use of safer language subsets in commercial embedded control systems.
  • Obviously, if J belongs to N, then any of its subsets is also in N. Therefore N is an abstract simp
  • has selective activities on different T cell subsets; it induces proliferation of Treg cell popula
  • process subsets known as teams, which support coarrays, colle
  • ined as the intersection of all closed convex subsets of X that contain K.
  • A, B, and S are subsets of G such that , where V is the vertex set of
  • roteins expressed by natural killer cells and subsets of T cells.
  • In general, subsets of this order do not have least upper bounds:
  • Baeza-Yates et al. used simulation on two subsets of the Web of 3 million pages from the .gr
  • Boldi et al. used simulation on subsets of the Web of 40 million pages from the .it
  • Subsets of the group are selected by Mr. Oliver to me
  • Subsets of these capabilities are available as Scient
  • migrate in response to CXCL16 include several subsets of T cells, and natural killer T (NKT) cells.
  • more generally Lebesgue measures) of compact subsets of Euclidean space.
  • ce is defined to consist of all of the finite subsets of X, with the semilattice operation given by
  • etermines a simplicial complex, the family of subsets of antichain members, and conversely the maxi
  • the metric outer measure property, all Borel subsets of X are Hd measurable.
  • ebra B is isomorphic to the algebra of clopen subsets of its Stone space S(B).
  • en any topological space X, the collection of subsets of X that are clopen (both closed and open) i
  • -synuclein and tau constitute two distinctive subsets of filaments in the same inclusion bodies.
  • et of edges whose end points are in different subsets of the partition.
  • It is defined as the number of subsets of four leaves that are not related by the sa
  • rs (X, Y) of 2m-tuples, each corresponding to subsets of the finite field GF(2m) in some fixed way.
  • s the largest possible diamond-free family of subsets of an n-element set, then it is known that
  • lating the surface area and volume of compact subsets of Euclidean space.
  • ructure (the search tree) whose nodes are the subsets of S.
  • Then, cofinal subsets of A (or sequences, or nets) are used to defi
  • or the special case where L is the lattice of subsets of a set, the power set lattice.
  • ; 11 of these appear to be expressed in small subsets of chemosensory neurons.
  • With [κ]<ω denoting the set of all finite subsets of κ, a cardinal number κ such that for every
  • he class W of all reflexive well-orderings of subsets of X is a definable subclass of the preceding
  • For example, fractal subsets of the plane may have intermediate dimension
  • NLRP1, NLRP3 and NLRC4 are subsets of the NLR family and thus have two common fe
  • is the graph whose vertices are the k-element subsets of an n-element set, two vertices being adjac
  • The subsets of cytokeratins which an epithelial cell expr
  • The ligands for several KIR proteins are subsets of HLA class I molecules; thus, KIR proteins
  • d A to E. In certain circumstances, there are subsets of these exit groups; these are marked with n
  • pondence between blunt (or pointed) cones and subsets of S. Indeed, the central projection C' is si
  • pairwise alignments or sub-MSAs incorporating subsets of the query sequence as a means of optimizin
  • suffices to replace F by F' consisting of all subsets of Q that contain at least one element of F.
  • n the real numbers, the subset order ⊆ on the subsets of any given set and the divisibility order o
  • (Ω, Σ, Pr) to the space of non-empty, compact subsets of Rn equipped with the Hausdorff metric.
  • ssical Brunn-Minkowski inequality for compact subsets of n-dimensional Euclidean space Rn to random
  • r letters: , or , or even , where S and T are subsets of the alphabet being used.
  • N uses class inheritance to model the natural subsets of the available number types: E.g. the integ
  • As an example, let S be the set of all finite subsets of natural numbers and consider the partially
  • every n, the f-image of the set of n-element subsets of H has countably many elements.
  • mains: P is the collection of downward-closed subsets of domain D that are also closed under existi
  • any discrete collections, where a family F of subsets of a space X is called discrete, when every p
  • and now supports for most of the methods and subsets of the method that give both hackers and mali
  • "Mapping subsets of scholarly information".
  • Let A and B be subsets of .
  • Individual odorants activate subsets of receptors.
  • Various subsets of the sixteen binary connectives (e.g.
  • K(X) is a bounded sublattice of subsets of X.
  • finite totally-ordered subsets) of S as faces.
  • Lineages are typically visualized as subsets of a phylogenetic tree.
  • Lineages are subsets of the evolutionary tree of life.
  • definition of being IP has been extended from subsets of the special semigroup of natural numbers w
  • It consists of a family of subsets of a set such that the intersection of two su
  • just a pre-measure and not a true measure on subsets of X, as can be seen by considering dense, co
  • ene gun has become a common tool for labeling subsets of cells in cultured tissue.
  • that GIGs and IGs describe merely-overlapping subsets of the CSLs.
  • The collection of all subsets of feasible sets forms a matroid.
  • D is directed complete, i.e. all directed subsets of D have a supremum.
  • Individual patients present differing subsets of symptoms, which may change over the course
  • The set of all linearly independent subsets of a vector space V, ordered by inclusion.
  • graph: its vertices can be separated into two subsets of five and six vertices respectively, such t
  • rds are obtained via symmetric differences of subsets of the 24 cells-- i.e., by binary addition.
  • roteins expressed by natural killer cells and subsets of T cells.
  • The Scott-open subsets of a partially ordered set P form a topology
  • t; they are further divided between IA and IB subsets on sequence similarity.
  • at signature is then fragmented into disjoint subsets, one for every sort.
  • ex in white and the vertices in grey form the subsets S and T of an s-t cut, whose cut-set contains
  • xpander mixing lemma states that, for any two subsets S,T of a regular expander graph G, the number
  • It is simply a nested group of sets and subsets shown as a set of nested brackets.
  • n of the real numbers and therefore for their subsets such as the integers and rational numbers.
  • , one finds a partition of the graph into two subsets, such that the edges separating the two subse
  • e hemicompact if it has a sequence of compact subsets such that every compact subset of the space l
  • ion the integers 1, 2, ..., n into k nonempty subsets such that all elements in each subset have pa
  • s) and a partition of the given points into r subsets, such that x belongs to the convex hull of ea
  • the variable splits the set into homogeneous subsets that have the same value of the target variab
  • ivides the set of points in two roughly equal subsets: the smaller part should have at least a 1/(d
  • nfinite set is partitioned into finitely many subsets, then at least one of them must be infinite.
  • rking environment for application software or subsets thereof.
  • and a slice through the center causes the two subsets to be equal regardless of the number of secto
  • d an integer k > 1, partition V into k parts ( subsets) V1, V2, ..., Vk such that the parts are disj
  • uclidean d-space, there is a partition into r subsets whose convex hulls intersect in at least one
  • he smallest r such that any r points have two subsets whose convex hulls intersect.
  • very rule of the reduct, and it has no proper subsets with the same property.)
  • Subsets with a maximum (that is, subsets which are bo
  • The intersection of these λ-many measure 1 subsets would thus also have to have measure 1, but i
  • ts, we define the set S# to be the set of all subsets X of the complete lattice that have non-empty