1) cap product
卡积
2) Cartesian product
卡氏积
1.
As solving the kinematical concept,the progressing of search depth was automatically confirmed by enlarging the description of the functional requirements and using the optimal technique,the solution space was effectively confirmed,avoiding combine exploration of the solutions,and the multi-plan design of mechanical structure was also completed by the Cartesian product operation of the stru.
在原理运动方案求解时通过扩大功能需求描述 ,引入相应的优化技术 ,实现了分解级数的自动确定 ,有效地界定了原理方案的解空间 ,避免了解的组合爆炸和众多无意义解的生成 ;由传递函数确定的结构集合的卡氏积运算实现结构的多方案设计 ,为相关设计提供一种新思路。
2.
The edgeintegrity of some special graphs such as the grids ,wheel ,Cartesian products of some complete graphs etc are given.
文中主要给出了格子图,轮图,完全图的卡氏积等特殊图的边完整度。
3.
Let N m(n) be the number of hamiltonian cycles in the cartesian product P m×C n, In this paper we derive the formula for N 3(n).
设 Nm(n)表示卡氏积 Pm × Cn 中哈密顿圈的个数 。
3) Cartesian product
笛卡尔积
1.
Crossing numbers of cartesian products of stars with 5-vertex graphs
五阶图与星图的笛卡尔积交叉数
2.
The relation between the Cartesian product and authentication codes is studied in this paper.
该文研究了笛卡尔积与认证码的关系,根据笛卡儿积的结构特点,提出了一种将认证符信息嵌入到编码规则的思想,从工程应用的角度实现了基于笛卡尔积的各阶欺骗概率相等的最优Cartesian认证码的构造,并给出了基于笛卡尔积和拉丁方的各阶欺骗概率相等的安全认证码的构造方案。
3.
Through the analysis of the second power Cartesian product of natural number set N——N×N and the thirdpower Cartesian product of natural number set N——N×N×N,obtains the conclusion that they all have the bijective relation to natural number set N,it means that the set N×N and the set N×N×N are all countably infinite.
通过对自然数集合N的二次笛卡尔积运算———N×N和三次笛卡尔积运算———N×N×N的详细分析,得出了它们与自然数集合N之间都存在双射关系结论,即集合N×N和集合N×N×N都是可数无穷的。
5) cartesian product
笛卡儿积
1.
And the formulae for estimatingthe edge-toughness of Cartesian product and Kronecker product of some special graphs are presented.
证明了一类r-正则r=κ′(G)连通非完全图G的边坚韧度近似等于r/2(1+(1/│V(G)│-1))并且提供了估计一些特殊图类的笛卡儿积和Kronecker积的边坚韧度的公式。
2.
Product topology and box topology are two methods for introducing topologies in general Cartesian product,both of them are generalization of the concept of finite product topology.
积拓扑与箱拓扑是在拓扑空间族的笛卡儿积上引进的2种不同的拓扑,它们都是有限积拓扑的推广,对这2种拓扑作以比较是有益的。
3.
This paper discusses the upper chromatic number of the Cartesian product of co-hypergraphs.
讨论反超图的笛卡儿积的着色理论 ,求出了满足一定条件的反超图的笛卡儿积的上色数 。
6) Cartesian products
笛卡尔积
1.
It is proved that the crossing number of Hn is Z(5,n)+n+n2], and the crossing number of Cartesian products of W4 and K1,n is Z(5,n)+2n+n2].
证明了Hn的交叉数为Z(5,n)+n+﹂2n],并在此基础上证明了轮W4与星K1,n的笛卡尔积的交叉数为Z(5,n)+2n+﹂2n]。
2.
LetG1×G2 be the cartesian products of G1 with G2,V(G1×G2)=V(G1)×V(G2),E(G1×G2)=｛(u1,u2)(v1,v2)｜u1=v1 and u2v2∈E(G2),or u2=v2 and u1v1∈E(G1)｝.
两个图G1和G2的笛卡尔积图G1×G2是这样一个图:V(G1×G2)=V(G1)×V(G2),E(G1×G2)={(u1,u2)(v1,v2)|u1=v1且u2v2∈E(G2),或者u2=v2且u1v1∈E(G1)}。
3.
In this paper,we prove the crossing number of Cartesian products of W_5 with S_n is 6「n/2」「(n-1)/2」+2n+3「n/2」+3「n/2」(「x」denotes the maximum integer that is no more than x),also we abtain the crossing numbers of Cartesian products of some sungraph of W_5 with S_n.
目前,对于六阶图与星图笛卡尔积的交叉数知之甚少。
补充资料：卡氏积
离散数学用语。
设 a1,a2,…… ，an 为n个集合(n>= 2) ,称集合
{< x1,x2,…… ，xn > | xi ∈ ai , i = 1, 2,…… n} 为n维卡氏积 ，记作
a1×a2×……×an .如果n个集合均为 a 时 ，记作 an 这里n是上标，因为系统不支持类似word中的上标标记 ，只好写成这样了。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条