助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   布尔代数 在 计算机硬件技术 分类中 的翻译结果: 查询用时:0.016秒
图标索引 在分类学科中查询
所有学科
计算机硬件技术
数学
计算机软件及计算机应用
自动化技术
无线电电子学
自然地理学和测绘学
电信技术
物理学
安全科学与灾害防治
更多类别查询

图标索引 历史查询
 

布尔代数
相关语句
  boolean algebra
    Then, in order to consider the combined influence of system topology, task set, communication path set and p~essing unit set, thenetwork analysis method which is based on graph theory, probability theory and Boolean algebra, is used to setup the distributed systems reliability model;
    然后采用建立在图论、概率论及布尔代数基础上的网络分析法建立了分布式系统的可靠性模型,用以综合考虑系统拓朴结构、任务集、通讯路径集和处理单元集等对系统可靠性的影响;
短句来源
    The paper is of certain significance to improve the four fundamental operations theory of Boolean algebra.
    本文的工作对进一步完善布尔代数的四则运算理论具有一定的意义 .
短句来源
  “布尔代数”译为未确定词的双语例句
    In this paper, on the basis of the analysis method of the net list graph, we present a method for calculating the forward or backward link reliability of the net list graph to solve the reliability problem of dual ring net, and solve respectively reliability, mean time between failure (MTBF) and availability of dual ring netwith the different skip distance (8) in the light ofBoolean algebra.
    本文应用网格图的分析方法,将双环同的可靠性问题,归结为相应的网格图的顺向链路或逆向链路的可靠度计算,应用布尔代数的概率方法,分别求出具有不同跳距S的双环网的可靠度、平均无故障时间和平稳利用率。
短句来源
    Therefore, this paper enriches and improves the theory and practice of Boolean algebra-the design tool of digital system.
    通过本文 ,进一步丰富和完善了数字系统的设计工具——布尔代数的理论和实践
短句来源
  相似匹配句对
    The paper is of certain significance to improve the four fundamental operations theory of Boolean algebra.
    本文的工作对进一步完善布尔代的四则运算理论具有一定的意义 .
短句来源
    Therefore, this paper enriches and improves the theory and practice of Boolean algebra-the design tool of digital system.
    通过本文 ,进一步丰富和完善了字系统的设计工具——布尔代的理论和实践
短句来源
    Correct selection of digital-analog converters
    模转换器的正确选择
短句来源
    A Universal Interface Used at Keyboard and Display
    通用的键盘和显接口
短句来源
查询“布尔代数”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  boolean algebra
They have proved that if the set of keys is a Boolean algebra or a finite field, then there does not exist a two-operation homomorphic sharing scheme.
      
In the paper we prove that any constructivizable infinite atomic Boolean algebra has ?0 non-self-equivalent constructivizations.
      
It is proved that on a normed denumerably complete Boolean algebra each continuous exterior measure majorizes at least one measure.
      
Factorization of an automorphism of a complete boolean algebra into a product of three involutions
      
An algorithm based on classical Boolean algebra and allowing one to find any unitary transformation realized by the quantum CNOT operators is proposed.
      
更多          


The algorithm given in this paper is a method of test generation of a digital circuit, in which the function block is used as a primitive logic element. The "G-F" two-valued description of the line varisbles and "G-F" two-valued basic calculation formula are derived according to the detectability of faults. In the process of path sensitization, the test of faulty block and sensitized function values of sensitized functional block is generated by the "G-F" two-valued formula respectively. To quicken the backtrace,...

The algorithm given in this paper is a method of test generation of a digital circuit, in which the function block is used as a primitive logic element. The "G-F" two-valued description of the line varisbles and "G-F" two-valued basic calculation formula are derived according to the detectability of faults. In the process of path sensitization, the test of faulty block and sensitized function values of sensitized functional block is generated by the "G-F" two-valued formula respectively. To quicken the backtrace, such strategies as fault flag, implication, value area as well as the Boolean algebraic operation etc. are adopted with remarkable effect. As the time parameter t and clock variable cp are introduced in to the sequential circuits, processing of combinational circuits and sequential circuits becomes unified. The algorithm was programmed on a computer with a speed of 0.5 million times per second. It implemented a test generation of more than 4000 gates of sequential circuits.The mean faulty coverage ratio is up to 98%, and 90% of the faults are located at the right chip. Some real test results of the printed circuits boards are listed at the end of the paper.

本算法根据故障的可检测性导出了电路引线的“G-F”二值描述和“G-F”二值基本运算公式,根据这一公式分别求故障块和敏化块的测试码和敏化条件。为了快速回推(解方程),用故障路标、值区、隐含以及布尔代数运算等措施,效果显著。 由于在时序电路中引入时间参数t和脉冲变量cp,统一了组合电路和时序电路的处理。 本算法已在50万次/秒的计算机上编制了程序,处理了超过4000个门的大型时序电路。故障覆盖率平均达98%,90%的故障定位到一块组件,本文最后给出了几种插件的实测结果。

In this paper, on the basis of the analysis method of the net list graph, we present a method for calculating the forward or backward link reliability of the net list graph to solve the reliability problem of dual ring net, and solve respectively reliability, mean time between failure (MTBF) and availability of dual ring netwith the different skip distance (8) in the light ofBoolean algebra. At last, when the total node numbers are 9, we analyse and compare the reliability parameter among three kinds of dual...

In this paper, on the basis of the analysis method of the net list graph, we present a method for calculating the forward or backward link reliability of the net list graph to solve the reliability problem of dual ring net, and solve respectively reliability, mean time between failure (MTBF) and availability of dual ring netwith the different skip distance (8) in the light ofBoolean algebra. At last, when the total node numbers are 9, we analyse and compare the reliability parameter among three kinds of dual ring net, and give forth the optimal model of dual ring net with the daisy lin k.

本文应用网格图的分析方法,将双环同的可靠性问题,归结为相应的网格图的顺向链路或逆向链路的可靠度计算,应用布尔代数的概率方法,分别求出具有不同跳距S的双环网的可靠度、平均无故障时间和平稳利用率。最后,在总结点数N=9时,对3种不同的双环网可靠性参数进行分析与比较,并给出最优菊花链双环网的模型。

Presents an algorithm for generating the sum of disjoint products by using binary decision diagram as well as certain ordering role of paths and Boolean algebra formulas. Compared with the one by using the binary decision diagrams only, this algorithm is much simpler and will generate fewer terms of the sum of disjoint products. Therefore, the algorithm for calculating system reliability is more efficient.

利用二分决策图,同时采用道路排序技巧及布尔代数运算给出了求不交和的方法,它比单纯采用二分决策图的算法更简单,不交和的项数更少,从而得到一个求网络可靠度的有效算法.

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

 


 
CNKI小工具
在英文学术搜索中查有关布尔代数的内容
在知识搜索中查有关布尔代数的内容
在数字搜索中查有关布尔代数的内容
在概念知识元中查有关布尔代数的内容
在学术趋势中查有关布尔代数的内容
 
 

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