卡尔

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

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

In this paper ,we study the crossing numbers of the cartesian product graph and complete tripartite graph.

本文研究某些简单图与路，星图的笛卡尔积图的交叉数和完全三部图的交叉数。

Generally speaking, calculating the crossing numbers of graphs is very difficult, there are only a few results in this area at present, and the majorities are some special Cartesian product graphs.

一般来说，计算图的交叉数是一个很难的问题，目前只有少数这方面的结果，其中大部分是一些特殊笛卡尔积图的交叉数。

Then we can give the generalized Hamming weight's expression for the cartesian product.

则可给出笛卡尔积码广义Hamming重量的表达式。

Multiple classes may appear, resulting in a cartesian product or "cross" join.

出现多个类，会导致笛卡尔积或者称"交差"连接。

A join is a Cartesian product of two row sets, with the join predicate applied as a filter to the result.

一个连接是两个行集的笛卡尔乘积，谓词连接作为一个过滤结果应用。

The natural number set N and the cartesian product N×N.

自然数集N和笛卡尔积N×N。

At first,cartesian product provided us with a method for constructing information granularity in fuzzy relation.

首先利用笛卡尔积，构建了模糊关系下的信息粒；然后给出不同粒度下模糊粗糙算子的表示方法，进而形成一个分层递阶结构；最后考虑了对于模糊信息系统粒度粗细的选择问题，并给出一个实例，从而为粒度计算提供一个具体而实用的框架。

Based on the properties of the saturation function, it was proved that the stability region of such dynamical systems can be decomposed into Cartesian product of an invariant set of their adjoint systems and a sufficiently large ball.

结合饱和函数的特殊性质，证明了此类系统的稳定域可分解为伴随系统的不变集与一个足够大球体的笛卡尔积。

There can be several iterations within a section, you can specify an additional constraint to get a subset of the Cartesian product (constraint=), and you can repeat each one several times with different seeds.

一个代码段中会有几个迭代，你可以指定额外的限制条件来得到一个笛卡尔乘积的子集(constraint=)，你可以用不同的种子重复每一个工作几次。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。