全部

1·It is the Cartesian product between the specified tables.

它是指定表的笛卡尔积。

2·In this paper, we study the crossing Numbers of the cartesian product graph.

本文研究一类笛卡尔积图的交叉数。

3·Each data point or cell of a cube is the Cartesian product of members of its dimensions.

一个立方体的每个数据点或单元是它的维成员的笛卡尔乘积。

4·How to convert a tuple of vectors into a vector of tuples using the Cartesian product?

如何将一个元组向量为向量元组使用笛卡尔积？

5·If you introduce another for expression, the program will evaluate the Cartesian product.

如果引入了另一个for表达式，那么这个程序将对笛卡尔积求值。

6·Given a simple rigorous proof for the theorem by structuring Cartesian product of linear Spaces.

本文利用线性空间笛卡儿积的思想，给出了关于上述结论的简洁的、严密的逻辑证明。

7·We now derive, based on the above results, sufficient conditions for a Cartesian product network.

我们现在得出，基于上述结果，有足够的条件，笛卡尔积网络。

8·Pure situations in different blocks of the Cartesian product have different game results, generally.

纯策略空间的笛卡尔乘积的不同分块中的纯局势一般具有不同的博弈结果。

9·A cross join that does not have a WHERE clause produces the Cartesian product of the tables involved in the join.

一个没有WHERE子句的交叉联接，会产生所关联表的笛卡尔乘积。

10·The two FOR loops generate a Cartesian product from which the product name and the individual feature are returned.

两个FOR循环将生成笛卡儿积，将从该积返回产品名称和单个功能。