查询词典 cardinality

1 Base cardinality is the number of rows in a base table.

基本的行集数是一个表的行数。

The structure theorem is obtained by defining "ternary ordered partition method" which is used to choose the test-sets of the first $k$ tests, and by defining two operations and two relations on feedback sequences; The isomorphism classification theorem is strictly proved by virtue of the structure theorem, thus the complicated problem of discussing $3^k$ possible search domains is reduced to the relatively easy problem on $k+1$ representative search domains; By the techniques of "super-coin construction method" and "image-union method", the search problem on $k+1$ representative search domains is reduced to the simple verification of several conditions on finite space of small cardinality.

通过引入用于选取前$k$次试验的试验集的"三元有序剖分法"以及关于反馈序列的两种运算和两种关系，得到了结构定理；基于结构定理严格地证明了同构类定理，从而将必须针对$3^k$个搜索域的复杂问题转变为讨论$k+1$个具代表性的搜索域的相对简单的问题；通过"构造超币法"和"并像法"等技术手段，将关于$k+1$个具代表性的搜索域的搜索问题转化为简单的关于势非常小的有限空间的几个条件的验证问题。

In the fourth section of this paper, we take into account one of the main features of the problem: namely, the presence of large symmetries in the solution space. In fact, the degree of symmetry grows exponentially with the cardinality of the set of colors.

在本文的第四章节中，研究发现在利用遗传算法解决图的着色问题中存在着一个重要的不足，即在问题解空间中存在着大量的冗余数据。

A set with cardinality s\s銆俰s said to be denumerable or countably infinite.

具有基数s%5Cs。的集合，被称为是可列的或可数无穷的。

A set with cardinality s＼s.is said to be denumerable or countably infinite .

具有基数s＼s。的集合，被称为是可列的或可数无穷的。

Research on hand shows that the genus of an secure hyperelliptic curve should be small and the cardinality of its Jacobian group should contain a 160bit big prime factor at least.

现有的研究表明，用于构造密码体制的超椭圆曲线必须是低亏格的，且它的Jacobian基数中必须至少含有一个160bit的大素因子。

As a result, LS-OOC based on orthogonal Latin square has been acquired. The large cardinality of LS-OOC is beneficial to synchronous OCDMA system.

研究了有限域上的Latin矩阵与OOC码字的联系，设计出基于正交Latin方阵的LS-OOC码字，自相关旁辦和互相关最大值都为1，非常符合OCDMA通信技术对地址码的要求。

In this paper, a new random algorithm is introduced for the classical problem of estimating the cardinality of a union of sets, which only needs pair -wise independent random input.

仅用成对独立的随机变量作为输入，得到了一个关于估计并集的基的问题的随机算法。

For any two vertices u and v of a graph G, a u-v geodesic is the shortest path between u and v. The set I consists of all vertices lying on a u-v geodesic. For SV, I is the union of all sets I for vertices u, v∈S. The geodetic number g is the minimum cardinality among the subsets S of V with I=V.

对于图G内的任意两点u和v，u-v测地线是指在u和v之间的最短路。I表示位于一条u-v测地线上所有点的集合，对于SV，I表示所有I的并，这里u，v∈S，G的测地数g是使I=V的最小点集S的基数。

If G is a {2K_1+K_2, C_4}-free graph, we show thatifα＞3 then G is a split graph, and ifα=3 then for any independentset S of cardinality 3, G-S is a chordal graph or G-S?

如果图G不含与4-圈和2K_1+K_2同构的导出子图，我们证明了如果α＞3，那么G是一个split图；如果α=3，那么对于G的任一个有三个元素的独立集S，G-S是一个弦图或者G-S？

For every one of my New Year resolutions, I have been a backslider for years.

说到我的新年决心，我每年都做

With empathy and focus on a feeling level, we can all relate to the common ground of mutuality of emotions.

有了同情心和感觉上一级的重点，我们都可以涉及到相互的情感共同点。