2) Subculture times
继代培养次数
3) algebraic degree
代数次数
1.
These constructed resilient functions possess the nonlinearity 2n-1-2n-[m/2] and the algebraic degree m-1 and we take count of these constructed resilient functions.
当(n,m)∈{(2r-1,r-1),(2r-1,r),(2r,r),(2r,r+1)}或者1≤m≤n/2+2-n/(2~(n/2+1)-2)时,构造了n元m维极大弹性函数,其非线性度为2n-1-2n-[m/2],代数次数为m-1。
2.
The cryptographic properties of the k -order quasi-Bent functions, such as balancedness, correlation immunity, propagation criterion and the highest algebraic degree can all be easily decided only by the distributions of 0 and 1 in the character matrix, which is different from the spectrum method and the auto-correlation method.
该文利用一类k阶拟Bent函数的特殊性质 ,把对这类函数的密码性质的研究转化为对矩阵性质的研究 ,如平衡性、相关免疫性、扩散性、最高代数次数等 。
3.
By these meth ods, both the independent variables dimension and resilient rank of functions ar e increasing,and algebraic degree is also enhance .
这些方法使得自变量的维数与弹性阶同步增长,且函数的代数次数也相应增加,从而避免了线性构造的缺陷。
4) iterative times
迭代次数
1.
The influence of different iterative times is analyzed.
通过对大气激光通信信道的分析,采用Turbo码对信道进行了编码,并对编译码系统进行了修正,建立了基于大气激光通信信道的系统模型;分析了迭代次数对大气激光通信系统性能的影响。
2.
The important parameters in the arithmetic such as size of iterative step,iterative times and initial solution are analyzed and optimized in detail.
本文对乘型迭代算法进行了研究,并对该算法中的一些重要参数,如迭代步长、迭代次数及初始解进行了优化分析,给出了这些参数对重建图像及运算时间的影响关系以及这些参数间的相互影响关系,同时给出了获取较优初始解的方法以及迭代步长和迭代次数的最佳取值范围。
5) iteration number
迭代次数
1.
The SIMPLER and CLEAR algorithm are compared with five two dimensional numerical examples of incompressible fluid flow and heat transfer problems on the subject of the ratio of the iteration number and the corresponding consumed CPU time for obtaining a converged solution under the same converging condition to investigate the robustness characteristic of the new algorithm.
本文上篇阐述了CLEAR算法的推导过程和计算步骤,本文下篇通过五个二维不可压缩流动和传热的算例,对CLEAR算法和SIMPLER算法进行了比较,比较的内容为,在相同的收敛条件下, CLEAR算法和SIMPLER算法收敛所需的迭代次数的比值和对应的CPU时间的比值,以及这两个比值和时步倍率的关系,从而进一步研究了CLEAR算法的健壮性。
2.
The feasibility conditions for the use of 2 -OPT with MTSP were used to determine the distribution of the iteration numbers and the upper bound of the expected algorithm run time.
利用需求分布独立于客户的空间分布的特点 ,将车辆路径问题 (VRP)转化为多旅行商 (MTSP)问题 ,并通过分析 MTSP进行 2 -OPT操作的可行性条件 ,建立起该算法运行所需的迭代次数的分布函数 ,进而求得平均运算时间复杂度的上界。
3.
In simulation,the effect of decoding algorithm、rate and iteration number is analysis on the performance of Turbo codes.
本文在简要介绍Turbo码的编译码原理的基础上,对Turbo码在通信系统中的应用进行了仿真,重点分析分析了译码方法、译码迭代次数、码率对Turbo性能的影响。
6) graded algebra
分次代数
1.
Relationship between solvable polynomial algebra and its two kinds of graded algebra under order filtration;
可解多项式代数与它在阶滤子下两种分次代数的关系
2.
An application of Groebner basis in graded algebras;
Groebner基在分次代数中的应用
3.
Some homological properties of connected graded algebras are generalized to more general graded algebras.
将前人关于连通分次代数的一些结论推广到零阶部分为Artin半单环的正分次代数上。
补充资料：断断继继
1.断断续续﹐时断时续。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条