助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   完全对偶 的翻译结果: 查询用时:0.024秒
图标索引 在分类学科中查询
所有学科
更多类别查询

图标索引 历史查询
 

完全对偶
相关语句
  completely dual
     A Kind of Weak Completely Dual Formal System WCL~* for L~* System
     L~*系统的一种弱完全对偶形式系统WCL
短句来源
     A formal deductive system L * for fuzzy propositional calculus, and the revised Kleene logic system W-,W, W k were studied. Both of them were first proposed by professor WANG Guo jun. A kind of weak completely dual formal deductive system WC L- * was given.
     研究了模糊命题演算的一种形式演绎系统 L* 和修正的 Kleene逻辑系统 W-,W,Wk 及 R0-代数 ,给出了 L* 系统的一种弱完全对偶形式系统 WCL-* ,并证明了二者之间的等价性 ,为形式演绎系统的研究和应用提供了一个有益的途径
短句来源
  相似匹配句对
     A kind of duality on completely distributive lattices
     完全分配格上的一种对偶关系
短句来源
     Dual Hypergroups
     对偶超群
短句来源
     ) antithesis is in (L, (?)
     )对偶于(L,(?)
短句来源
     A Kind of Weak Completely Dual Formal System WCL~* for L~* System
     L~*系统的一种弱完全对偶形式系统WCL
短句来源
     Complete Infinite Modules
     完全无限模
短句来源
查询“完全对偶”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  perfect duality
However, no constraint qualifications are needed and yet perfect duality maintains between the primal and dual programs.
      
A note on perfect duality and limiting lagrangeans
      
In this note we derive and extend the substance of recent results on Perfect Duality and Limiting Lagrangeans by using standard convex analysis and convex duality theory.
      
Perfect duality in semi-infinite and semidefinite programming
      
This paper develops new relationships between the recently constructed semidefinite programming perfect duality and the earlier perfect duality achieved for linear semi-infinite programming.
      
更多          


In this note, at first, We point out an error in reference [2]. Next,we give a class of new dual ideals which is exactly dual to the idealintroduced by Iseki [1] .We also construct the quotient algdbras withrespect to these dual ideals and study some of their importantproperties. Moreover, we show that in setting of bounded implicativeBCK-algebras, our results will imply those of [2] §4. and so theerror of [2] is corrected.

本文首先指出了文[2]的一个错误,其次引进了一类新的对偶理想,它完全对偶于Iseki的理想,我们讨论这种对偶理想的一些重要性质,关于它构造了商代数。在有界关联BCK-代数的情形,我们的结果包含了[2]§4,从而纠正了[2]的错误。限于篇幅,我们将不加证明地给出一些结果。

he upper bound of system reliability predicted by the upper bound method pres-ented in ref.[1]will monotonically converge to a wrong value which is less than the precise one,and the predicted single value of the system reliability will be too conservative.A new method for calcula-ting upper bounds of system reliability arid fully coupled practical calculation formulas for upper and lower bounds are presented in this paper.Examples show that for any complex system with non-sin-gle series,the application of the...

he upper bound of system reliability predicted by the upper bound method pres-ented in ref.[1]will monotonically converge to a wrong value which is less than the precise one,and the predicted single value of the system reliability will be too conservative.A new method for calcula-ting upper bounds of system reliability arid fully coupled practical calculation formulas for upper and lower bounds are presented in this paper.Examples show that for any complex system with non-sin-gle series,the application of the formulas given in this paper can make the calculated results monotonically converged to the true value,and the predicted single value of the system reliability of higher aecuracy.

用文献[1]提出的上限计算法预计的系统可靠度的上限会单调收敛至一个小于精确值的错误数值,并使系统可靠度的单一预计值过于保守。本文提出一种计算系统可靠度上限的新方法,并给出了完全对偶的、实用的上下限计算公式。实例表明,对于任何非单纯串联的复杂系统,应用本文的公式均能保证使计算结果单调收敛至真值,并使系统可靠度的单一预计值具有较高的精度。

A formal deductive system L * for fuzzy propositional calculus, and the revised Kleene logic system W-,W, W k were studied. Both of them were first proposed by professor WANG Guo jun. A kind of weak completely dual formal deductive system WC L- * was given. And the equivalence between them was proved. This work offers a useful tool for further studying and developing L * system.

研究了模糊命题演算的一种形式演绎系统 L* 和修正的 Kleene逻辑系统 W-,W,Wk 及 R0-代数 ,给出了 L* 系统的一种弱完全对偶形式系统 WCL-* ,并证明了二者之间的等价性 ,为形式演绎系统的研究和应用提供了一个有益的途径

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关完全对偶的内容
在知识搜索中查有关完全对偶的内容
在数字搜索中查有关完全对偶的内容
在概念知识元中查有关完全对偶的内容
在学术趋势中查有关完全对偶的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社