查询词典 algebraically dependent elements

If the vertex set of a graph can be partitioned into two disjoint nonempty sets V_(1) and V_(2), every vertex in V_(1) connects every vertex in V_(2) and there is no edge in V_(1) and V_(2), then we call this graph is a complete bipartite graph. If V_(1) contains m elements and V_(2) contains n elements, then we denote this complete bipartite graph K_.

当一个图中的点集合可以分成两个非空的集合V_(1)及V_(2)，若 V_(1)中的每一点都与V_(2)中的点有边相连，且在V_(1)及V_(2)中的点都没有边相连，则称此图为完全二分图；若 V_(1)中有m个点，V_(2)中有n个点，则此完全二分图记为K_。

Utilizing the inclusion relationship between two subsets or subspaces, disjunct matrices with the same number of elements 1 in each row and column were constructed. However, the experimental number of elements was greater than the lower bound of information.

利用子集或子空间之间的包含关系可以构建出分离矩阵，它的每行和每列中元素1的个数分别都一样，但试验总次数即行数明显大于信息下界。

The number of elements in a finite group.Reflection of display elements about a line or plane.

显示元素再现在相对于某一条直线或某一个平面的对称位置。

By taking the advantages of SPH and standard finite element methods,a coupled method is proposed,in which the computational model is made up of finite elements in initial time and the large distortional elements are converted automatically into smoothed particles.

扼要讨论了光滑粒子法的离散思想，充分利用光滑粒子法和有限元方法各自的优点，提出了一种初始时刻用有限元建模，计算过程中大变形单元自动转换为光滑粒子的耦合算法。

150 Chapter 1 The History and Future of Computers 3.2 Boolean Algebra Table 3-2 Distributivity Idempotency Absorption laws 分配律同一律吸收律 a=ab+ac a+= a+a=a aa=a a+ab=a a=a'=a'b''=a'+b' DeMorgan's laws德摩根定理计算机专业英语 1-151 Chapter 1 The History and Future of Computers 3.2 Boolean Algebra Since a finite set of n elements has exactly 2n subsets, and it can be shown that the finite Boolean algebras are precisely the finite set algebras, each finite Boolean algebra consists of exactly 2n elements for some integer n.

由于n个元素的有限集有且只有个子集由于个元素的有限集有且只有2n个子集，而且很显然有限布个元素的有限集有且只有个子集，尔代数一定是有限集合代数，所以对某个整数n而言而言，尔代数一定是有限集合代数，所以对某个整数而言，每个有限布尔代数也有且只有2n个元素。例如，上文定义的集合T的限布尔代数也有且只有个元素。

31 Chapter 3 Number Systems and Boolean Algebra 3.2 Boolean Algebra Table 3-2 Distributivity Idempotency Absorption laws 分配律同一律吸收律 a=ab+ac a+= a+a=a aa=a a+ab=a a=a'=a'b''=a'+b' DeMorgan's laws德摩根定理计算机专业英语 3-32 Chapter 3 Number Systems and Boolean Algebra 3.2 Boolean Algebra Since a finite set of n elements has exactly 2n subsets, and it can be shown that the finite Boolean algebras are precisely the finite set algebras, each finite Boolean algebra consists of exactly 2n elements for some integer n.

由于n个元素的有限集有且只有个子集由于个元素的有限集有且只有2n个子集，而且很显然有限布个元素的有限集有且只有个子集，尔代数一定是有限集合代数，所以对某个整数n而言而言，尔代数一定是有限集合代数，所以对某个整数而言，每个有限布尔代数也有且只有2n个元素。例如，上文定义的集合T的限布尔代数也有且只有个元素。

Calculate average: Add all elements and divide by number of elements.

计算平均：添加的所有内容和鸿沟的一些内容。

This kind pushs sending is complete station sex, net of corvee labor formerly imposed on Xizang serfs is met all elements inside the website such as analytic user of intelligence, dorp, theme, extract its from inside the content of each elements, pertinent information and behavior movement characteristic-- gene, use gene to finish dependency to match then.

这种推送是全站性的，乌拉网会智能的分析用户、村落、主题等网站内的所有元素，从各个元素的内容、相关信息和行为动作中提取出其特性--基因，进而利用基因完成相关性匹配。

Adjacency search, double linked element list, random direction search, adjacency rotation, and heredity of geometrical quantities are applied to increase the efficiency of mesh generation. The relationship between the computing time and the number of generated elements is nearly linear and the time complexity is O(N^1.05), where N is the number of elements.

采用了邻接单元搜索、双向链表存储、随机方向搜索、邻接旋转、几何量继承等技术，使算法的计算时间与生成单元数近似呈线性关系，时间复杂度达到O(N^1.05)，N为生成单元数。

While these elements are ductile and malleable, they are not the same as the transition elements.

他们同样具有很好的延展性和段造性，但是和过渡金属不同。

He got into race cars, while my father liked go-karts more, so I didn't really pay attention to what Diego was doing, as I was just racing karts.

叔叔开的是跑车，而我父亲更喜欢越野卡丁车，所以我并不太关注Diego在做什么，我仅仅在跑我的卡丁车而已。

She is at present gone to look for the best nectar and ambrosia to regale me this evening.

她今晚为款待我，现在又去准备美酒佳肴去了。