最小项

  • 网络minterm;minterms
最小项最小项
  1. 浅谈用最小项和最大项化简同一逻辑函数的规律

    Study on the Rule of the Simplification of Same Logic Function through the Minterm and the Maxterm

  2. 该方法通过神经元激活函数推导开关级电路的开关函数,同时引入神经网络中卡诺图化简和最小项限制的化简方法。

    This method takes the switch operations for CMOS circuits through the active functions of neurons , and takes the neural network 's k-map and the minterm suppression into consideration .

  3. 对两路、三路输入的RZ-DPSK信号的全光逻辑最小项产生进行了40Gb/s的实验验证,并且对实验装置及结果进行了分析与讨论。

    40 Gb / s generations of minterms for two or three input RZ-DPSK signals are experimentally demonstrated . The experimental setup and logic results are analyzed and discussed .

  4. 组合网络的最小项矢量法故障诊断

    A minterm - vector method for diagnosing fault in combinational networks

  5. 一类有噪实序列最小项的位序研究

    Study on Location Order of a Class of Real Noised sequences Minimum

  6. 一种新的基于最小项逻辑优化的软件设计与实现

    A New Method for the Design and Realization of the Minimizer for Combinational Logic Circuits

  7. 并引入卡诺图化简及最小项抑制的思想降低神经网络的实现复杂性。

    The ideas of Karnaugh map and minterm inhibition are introduced to reduce the complexity of Boolean neural network .

  8. 该算法针对每个项目设定了最小项支持度,最小项支持度与该项目的出现概率相关。

    This new algorithm sets for each item a minimum support rate , which is related to the probability of the item .

  9. 在穷举搜索真值表中最小项组基础上,通过检查和合并而实现逻辑函数的自动化简。

    All the strategy for searching the pre-processed true table , the examination and treatment of the minimum term assembles and the results synthesis are analyzed in it .

  10. 通过对编码器真值表的特点分析,利用卡诺图最小项合并规则得出了直接书写逻辑表达式的具体方法。

    Through to the encoder truth table characteristic analysis , has obtained the direct writing logical expression concrete method using the Karnaugh map most minor term merge rule .

  11. 针对当前多数教材中用最小项化简逻辑函数的方法,指出了如何用最大项化简的技巧,同时阐明了两者之间的关系。

    The author of this paper points out a new way on how to simplify the logic function through maxterm , and describes the relation between the two ways .

  12. 本文提出电力系统主结线的一种逻辑表达式,及其在不重覆使用最小项约束条件下的最佳表达式。

    This paper suggests one logical expression for schematic diagram of power system , and also optimum expression if any limiting conditions of minimum term are not to be applied repeatedly .

  13. 本文通过举例分析合并相邻方格最小项的规律、技巧及方法;最后归纳总结用卡诺图简化逻辑函数的方法与步骤。

    Karnow 's chart is a common using method for simplified logical fUnction , in this paper , the method and steps are obtained by means of the analyses of the practical examples .

  14. 本文讨论了单调函数和函数的最小项列表,在此基础上提出单调函数、单调递增函数和单调递减函数的列表判别方法,并举例说明了判别过程。

    This paper discusses the monotonic functions and the tabling of minimal items , proposes the tabling decision method of monotonic functions , monotone increasing and decreasing functions , and gives some examples to show the decision process .

  15. 语义缓存的最小权值项LWI替换策略

    LWI Replacement Policy for Client Semantic Cache

  16. 随着电路规模的增加,传输函数中的最小生成项个数呈指数规模增加。

    With the development of the number of elements in a whole circuit , the sum of terms in transfer function increases exponentially .

  17. 通过对经典最小二乘法目标函数的修正,添加了流量残差平方和最小一项,保证参数识别结果的唯一性。

    The uniqueness problem is solved by modifying the least squares method and adding a term of flow to the least squares criterion .

  18. 您可以通过查看查询中的最小时间项,以及查询中处理一个项目所需要的平均时间,来访问任意查询的效果。

    You can assess the effect of any queue by looking at the minimum time items are in the queue , as well as the average time taken to process an item in the queue .

  19. 围度值最小的两项分别为前臂围和上臂围,数值均小于300mm。其余项目数值适中。

    Minimum value is surrounded degree respectively the two surrounded and hiplines forearm , numerical were less than 300mm . Other projects , numerical moderate .

  20. 该策略通过分析缓存项与查询项在关系、条件及查询属性三个方面的相关性,然后结合数据访问频率将相似性最小的缓存项予以淘汰。

    This policy analyses the relativity between query items and caching items in several aspects , such as relation , condition and query attribute , and then collaborate with the data access frequency metric to determine the least similar item in cache .

  21. 在本文中我们研究缺项幂级数的最小模与最大项间的关系,改进了P。

    In this paper we discuss the relation between the minimum modulus and the maximum terms of gap power series , and improve the result due toP .