1) strong equivalence
强等价
1.
In the condition of(1)strong equivalence,(2)equivalence,(3)weak equivalence,many important results about the two kinds of fuzzy automata with outputs are obtained.
在文中,对文献8中介绍的具有输出字符功能的模糊自动机和模糊有限状态自动机的定义作了修改,并对它们进行了系统的研究,揭示了此两类自动机和取分配格的代数性质的紧密联系;得到了此两类自动机在:(1)强等价;(2)等价;(3)弱等价条件下的许多重要结论。
2.
This paper firstly point out the limitation of strong equivalence of [1] in analyzing the security relation between two signature schemes,and extend its idea security strong equivalence Then by use of the method of transform each other,we proof that ElGamal type signature scheme is security strong equivalence with corresponding MR(P) type scheme So the problem left in [2] is resolve
本文首先指出了文献 [1]强等价在分析两个方案的安全性关系中的局限性 ,并对它进行了推广———安全强等价 ,利用相互转换的方法证明了ElGamal型签名方案与相应的MR(P)型方案是安全强等价的 ,从而解决了文献 [2 ]中遗留的问题。
3.
This paper mainly discusses the strong equivalence of categories of comodules.
给出了强等价新的定义，并得到范畴Mct和MD强等价当且仅当cM和DM强等价。
2) strong compressible set
强等价集
1.
Meanwhile the strong compressible set has been introduced,to solve the problem that the values of attributes weight frequency are the same.
同时引入强等价集,很好地解决了属性加权频率值相同的问题。
2.
Meanwhile the strong compressible set has been introduced,so the problem that the values of attributes weight frequency are the same has been solved.
同时算法中引入了强等价集,很好地解决了属性加权频率值相同的问题。
3.
Heuristic knowledge reduction approach based on discernibility matrix and strong compressible set is proposed.
提出了基于区分矩阵与强等价集的启发式知识约简方法。
3) (Strongly) Topologically equivalent
(强)拓扑等价
4) (Strongly) Equivalent function
(强)等价函数
5) (Z_2) equivalence and (Z_2) strong equivalence
(Z_2)等价与(Z_2)强等价
6) strong bisimulation
强互模拟等价
1.
Simulation relation on interactive Markov chains(IMCs) of algebraic model for stochastic process was studied,and by using the fixed-point theory and weight function definition,the discrimination algorithms for strong bisimulation equivalence and strong simulation preorder on stochastic process algebraic IMCs were given and the temporal complexity of the given algorithms was analyzed,also.
对随机进程代数模型交互式马尔科夫链(IMCs)上的模拟关系进行研究,根据不动点定理和权函数的定义,给出交互式马尔可夫链模型上强互模拟等价和强模拟前序的判定算法,对算法的时间复杂度进行分析。
补充资料：椐椐强强
1.相随貌。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条