- 更多网络例句与乘积集合相关的网络例句 [注：此内容来源于网络，仅供参考]
-
Firstly, we analyze the deficiencies ofexisting ones, extend domains of fuzzy logical operators from the cap product withtwo sets to them with arbitrary (finite, enumerable, or non-enumerable) number ofsets to form two general mappings so as to conform them to the fuzzy conjunctionand infimum, and to fuzzy disjunction and supremum, respectively, and fuzzify theset inclusion of fuzzy sets. Similar to the classical adjunction, the concept of fuzzyadjunction is introduced.
首先分析了原有"模糊形态学"框架的缺陷，进而将模糊合取和模糊析取算子的定义域从两个集合的笛卡儿乘积推广到任意多个集合的笛卡儿乘积，形成两个一般的映射，使得模糊合取与下确界、模糊析取与上确界保持一致，以此将模糊集的包含关系一般化。
-
Motivated by the newψfunctional stability,we can establish some new kinds of stabilities which are different from the exponential stability.With the help of semimartingale convergence theorem,stochastic calculous,moment inequality,Burkholder-Davis-Gundy inequality,Gronwall inequality etc.,we find that the product ofψfunction and the solutions of neutral equations will approach a nonempty set if some specific conditions are satisfied.
我们应用半鞅收敛定理、随机微积分的相关知识以及矩不等式、Burkholder-Davis-Gundy不等式和Gronwall不等式等技巧，得到中立型随机泛函微分方程的解与特定的"ψ函数"的乘积在一定的条件下将趋向某非空集合这一结论，并建立了该中立型方程的随机LaSalle型定理。
-
The matrix =( xi, xjp having the e-th power of the greatest common P-divisorp of xi and xj as its-entry is called the e-th power GCD matrix on S. The matrix = having the e-th power of the least common P-multiple p of xi and xj as its-entry is called the e-th power LCM matrix on 5. We obtained the following results:(1) is nonsingular for any set S;(2) If S is an FC set, then the determined of has formula Det =Jpe(x1)...Jpe, where the function Jpe is the generalized Jordan totient function;(3) A formula of the inverse of is given when S is an FC set;(4) If S is an FC set, then |.
以_P的e次方为第i行j列元素的矩阵称为定义在S上的e次幂GCD矩阵，记为；以_P的e次方为第i行j列元素的矩阵称为S上的e次幂LCM矩阵，记为，我们得到了如下结果：①定义在集合S上的e次幂GCD矩阵是非奇异的；②若S是R上的FC集，则S上的e次幂GCD矩阵的行列式Det=J_p~e(x_1)J_P~e(x_2)…，J_p~e，其中J_p~e为R上的Jordan函数；③当S为FC集时，得到了的逆矩阵~-1的表达式；④证明了当S是FC集时，整除，即等于与R上另一个矩阵的乘积。
- 更多网络解释与乘积集合相关的网络解释 [注：此内容来源于网络，仅供参考]
-
direct product：直积
在数学中,经常定义已知对象的直积(direct product)来给出新对象. 例子有集合的乘积(参见笛卡尔积),群的乘积(下面描述), 环的乘积和其他代数结构的乘积. 拓扑空间的乘积是另一个例子.
-
overall efficiency：总效率
第一个限制条件意味著由 i此一表示参考集合(reference set) 内决策单率两者的乘积,而与亦分别被称之为总效率 (overall efficiency) 以及纯粹技术效率注7.在固定规模报酬(CRS)下投入导向与产出导向所估计出之经营效率值互为倒数,
-
product set：乘积集合=>積集合
product separator 产品分离器 | product set 乘积集合=>積集合 | product sheet for wind power industry 风能行业应用产品表
-
product sheet for wind power industry：风能行业应用产品表
product set ==> 乘积集合=>積集合 | product sheet for wind power industry ==> 风能行业应用产品表 | product sign ==> 乘号