助手标题
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
共[2181]条 当前为第81条到100条[由于搜索限制,当前仅支持显示前5页数据]
 

相关语句
boolean
This is useful in studying Boolean functions and in engineering.
      
This paper presents a heuristic polarity decision-making algorithm for solving Boolean satisfiability (SAT).
      
On the 2m-variable symmetric Boolean functions with maximum algebraic immunity
      
The properties of the 2m-variable symmetric Boolean functions with maximum algebraic immunity are studied in this paper.
      
At last, some necessary conditions for a symmetric Boolean function on even number variables to have maximum algebraic immunity are introduced.
      
Taking R0-semantic Lindenbaum algebra as a prototype, the concepts of implicational latices and regular implicational lattices which are generalizations of the concept of Boolean algebras are introduced.
      
Reaization of the neighboring logic symmetry for boolean ordered set
      
By means of Logic symmetric relation, the single neighboring Logic path forN dimensions Boolean ordered set is solved.
      
Spectral characterization of Boolean functions satisfying k degree propagation criteria
      
This paper discusses spectral characterization of Boolean functions satisfying k degree propagation criteria and satisfying k order strict avalanche criterion respectively.
      
Enumerating correlation-immune boolean functions of order one
      
A large class of linear structural functions(LSF) satisfying the condition of correlational immunity of order one are constructed by studying the linear structural Boolean functions.
      
Ordinary algebra is used to represent Boolean algebra on logic variables with states 0 and 1, so to achieve a unify approach to simulated both digital and analog circuit in PSPICE.
      
The autocorrelation of a Boolean function possesses the capability to reflect such characteristics as linear structure, Strict Avalanche Criterion(SAC) and Propagation Criterion(PC) of degree k.
      
The application on the Advanced Encryption Standard(AES) shows the SAC and PC characteristics of Boolean functions of AES S-box.
      
The map folding method for the conversion between Boolean expression and COC expansions is analyzed.
      
Based on it, the tabular techniques are proposed for the conversion between Boolean expression and COC expansion and for the derivation of GOC expansions with fixed polarities.
      
The Fast Tabular Technique (FTT) for the conversion from the Boolean expression to the GOC expansion with the required polarity is also proposed.
      
We shall also consider the representation for Boolean ring.
      
We determine the Boolean transformations F: Bn → Bn which have unique fixed points.
      
 

首页上一页12345下一页尾页 

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