查询词典 boolean algebra
- 与 boolean algebra 相关的网络例句 [注:此内容来源于网络,仅供参考]
-
The relationships among Boolean algebra,set algebra,logic,and binary arithmetic have given Boolean algebras a central role in the development of electronic digital computers.
由于布尔代数、集合代数、逻辑学和二进制算术之间有内在的联系,所以布尔代数的理论在电子数字计算机的开发研制中是很关键的。
-
The relationships among Boolean algebra, set algebra, logic, and binary arithmetic have given Boolean algebras a central role in the development of electronic digital computers.
由于布尔代数,集合代数,逻辑学和二进制算术之间的内在联系,使得布尔代数的理论在电子计算机的发展中起到举足轻重的作用。
-
Like ordinary algebra, Boolean algebra has its own unique identities based on the bivalent states of Boolean variables.
象普通代数,布尔代数具有基于布尔变量的二价规定的独特的特性。
-
There define the Boolean operations for Boolean algebra of two and four elements,respectively.
这里分别定义了具有两个和四个元素的布尔代数的布尔运算。
-
It is proved that a semiring is complemented if and only if it is a direct product of some Boolean algebra and Boolean ring by studying the relations of congruences on the complemented semiring, so the complemented semiring is the commutative semiring.
s-内射模。通过研究可补半环S的性质及S上的同余关系,证明出可补半环与布尔环和布尔代数的直积是等价的,因而可补半环是交换半环。
-
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的限布尔代数也有且只有个元素。
-
Iseki , this theory contact to be suffused with universal algebra, group theory, ring theory, lattice theory,Boolean algebra,set point topology, toplogical algebra etc. we have already obtained the large quantity result to the research of the BCK algebra.
Iseki引入的代数系统,这一理论联系到泛代数、群论、环论、格论、布尔代数、点集拓扑和拓扑代数等,对BCK代数的研究已经取得了一大批的研究成果。
-
First of all, the dissertation proves that the three structures are pairwisely isomorphic—the Boolean Algebra formed by the value range topological space, the Boolean Algebra by knowledge nodes, and the Boolean Algebra by data sub-classes. Thus the essential relations between the three Boolean Algebras are constructed. Furthermore, The three structures have the same multiplying mechanism.
首先,论文从理论上证明了由数值域拓扑空间形成的布尔代数、由知识结点集形成的布尔代数、和由数据子类结构集形成的布尔代数在结构上有两两同构的关系,从而建立了了这三者在本质上的联系,并且论证了它们具有相同的"繁衍"机制。
-
Introduced Fan Boolean Algebra theory as a whole, after analyzing and studying of it, concluded that: the characteristic of Fan Boolean Algebra has determined that it can solve the extant problem of Data Mining to a certain extent, for example, it can guarantee the result after data mining to be usable , assured and construable;can solve the problems about expression difficulty of complicated concept, correlation of attributes emphasized incompletely and redundant examining;it can set up the unified model of Fan Boolean in a certain system;and it can promote the developmental research of new decision support system.
对泛布尔代数进行总体介绍,在分析和研究它的理论体系后,概括出:它的特性决定了它能在一定程度上解决数据挖掘的现存问题,比如可以保证数据挖掘结果的可用性、确定性及可解释性,可以解决复杂概念表达困难、属性间的相互关系强调不够、重复检验等问题;能就某一系统建立统一的泛布尔模型;并促进新型决策支持系统的开发研究,并对泛布尔代数与数据挖掘相结合的原理展开论述。
- 推荐网络例句
-
Do you know, i need you to come back
你知道吗,我需要你回来
-
Yang yinshu、Wang xiangsheng、Li decang,The first discovery of haemaphysalis conicinna.
1〕 杨银书,王祥生,李德昌。安徽省首次发现嗜群血蜱。
-
Chapter Three: Type classification of DE structure in Sino-Tibetan languages.
第三章汉藏语&的&字结构的类型划分。