您要查找的是不是：
- FUZZY CARTESIAN PRODUCT AND MULTI EXTENSION PRINCIPLE Fuzzy卡氏积与多元扩展原理
- fuzzy Cartesian product 模糊笛卡儿积,模糊卡的逊素积
- In this article we construct extended fuzzy measure on fuzzy intervals, fuzzy numbers and cartesian product of fuzzy intervals and derive fuzzy measure space. 摘要本论文建构在模糊区间，模糊数和模糊区间的卡氏积上的扩张模糊测度并推导出模糊测度空间。
- In this paper we discuss some properties of fuzzy H-ideals in BCH-algebras on their construction, e.g. Cartesian product of fuzzy H-ideals et al. 讨论了BCH-代数的Fuzzy H-理想的某些构造性质,如Fuzzy H-理想的Cartesian积等。
- It is the Cartesian product between the specified tables. 它是指定表的笛卡尔积。
- A cross join is also called a cross product or Cartesian product. 交叉连接也称作矢量积或笛卡儿积。
- This paper introduces the concept of generalized fuzzy relation and extends relational algebra operators such as union, intersection, difference, Cartesian product, selection, projection etc. 文中引入了广义模糊关系的概念，讨论了广义模糊关系代数的操作：广义模糊并、广义模糊交、广义模糊差、广义模糊笛卡尔积、广义模糊投影和广义模糊选择等。
- Cross joins are also called Cartesian products. 交叉联接也称作笛卡尔积。
- In this paper ,we study the crossing numbers of the cartesian product graph. 本文研究一类笛卡尔积图的交叉数。
- A join is a Cartesian product of two row sets, with the join predicate applied as a filter to the result. 一个连接是两个行集的笛卡尔乘积，谓词连接作为一个过滤结果应用。
- Cartesian Product of Fuzzy BCK-filters Fuzzy BCK-滤子的Cartesian积
- The two FOR loops generate a Cartesian product from which the product name and the individual feature are returned. 两个FOR循环将生成笛卡儿积,将从该积返回产品名称和单个功能。
- Let G be the Cartesian product graph of paths or cycles, and let t(G) denote the number of spanning trees in ?G?. 设 G是路或圈的笛卡尔乘积图 ;t( G)表示 G的支撑树数 .
- In chapter two ,we determine the crossing number of the cartesian product of five graphs on 6-vertex with path. 在第二章，我们确定了5个六阶图与路P_n的笛卡尔交叉数；
- This paper discusses the upper chromatic number of the Cartesian product of co-hypergraphs. 讨论反超图的笛卡儿积的着色理论,求出了满足一定条件的反超图的笛卡儿积的上色数。
- The size of a Cartesian product result set is the number of rows in the first table multiplied by the number of rows in the second table. 第一个表的行数乘以第二个表的行数等于笛卡尔积结果集的大小。
- In Chapter two, we prove that the cartesian product graphs of a cycle and a path satisfy the list edge coloring conjecture. 第二章证明了由圈和路构成的(笛卡儿)积图满足图的边列表着色猜想。
- This paper introduce the method which deals the operate nature of set with Cartesian product, and it is similar to Venn diagraph in set theory. 介绍了涉及集合笛卡儿积(Cartesian product)的运算性质讨论的一种类似于文氏图(Venn diagram)的方法.
- The lexicographical order on the Cartesian product of a set of totally ordered sets indexed by an ordinal, is itself a total order. 在用一个序数索引的那些全序集合的笛卡尔积的一个集合上的词典序自身是全序。
- In a cross join, each row from one table is combined with each row from another table, resulting in what is called a cross product or a Cartesian product. 在交叉联接中,一个表中的每一行与另一个表中的每一行合并,导致生成叉积或卡迪尔积。
