这包括计算权重数组的算法、重构失真图案的方式以及计算图案的能量级别的算法。
This includes the algorithms for computing a weight array, the way to reconstruct distorted patterns, and the algorithm for computing a pattern's energy level.
现在我要使用这个临时密钥以des -cbc算法加密第3步中得到的附加后的字节数组。
I will now use the temporary secret key to encrypt the original padded byte array from Step 3 using the DES-CBC algorithm.
Accelerator系统鼓励你以整个数组操作的方式来表述数据并行处理算法，对不同的后台程序(或“目标”)的实现更有效。
The Accelerator system encourages you to express data-parallel algorithms in terms of whole array operations which leads to efficient implementations for various back ends (" targets ").
用于迭代数组(相对于LinkedList)的具体算法留给设计模式的实现部分。
The specific algorithm used to iterate over an array (versus a LinkedList) is left to the design pattern implementation.
调用应用程序提供的算法：C运行时库函数qsort 排序对象数组，但你必须提供比较函数。
To Invoke an Application-Supplied Algorithm The C runtime library function qsort sorts an array of objects, but you must supply the function that compares objects.
envelope是另一种JSON数组，包含密匙算法、iv、andissued_at等加密信息。
The envelope is just another JSON array that describes the encryption, containing keys algorithm, iv, andissued_at.
繁衍选择算法会查找weights数组，选择第一个双亲—其实，每个个体都有可能成为双亲，但是双亲位置的数目是确定的。
The breeding selection algorithm picks one parent by looking at the weights - in effect, every individual gets a chance to be a parent, but the number of parent slots is finite.
的位置并去访问，然后继续下去，也就意味着，找到数组中的第i个元素的方法，是关于数组的长度呈线性复杂度的，这回增加算法的复杂度。
I've got to count my way down, which means that the access would be linear in the length of the list to find the I 'th element of the list, and that's going to increase the complexity.
使用指定的哈希算法计算指定字节数组子集的哈希值，并对结果哈希值签名。
Computes the hash value of a subset of the specified byte array using the specified hash algorithm, and signs the resulting hash value.
该算法通过灰度变化率设置阈值判别脉冲噪声点，并将脉冲噪声点信息记录到与图像对应的噪声记录数组中。
This algorithm set threshold to distinguish impulse noise point, through variance rate of gray level. The information of every impulse noise point is noted in a array.
该算法看着数组的中间。
给出了二维数组的体差不等式测试算法，并证明二维数组的体差不等式测试算法具有多项式时间复杂度。
This paper presents a new dependence difference inequality test algorithm for two-dimensional arrays, and proves that the time complexity of the algorithm is polynomial.
另一种相似的算法是在数组中制造出一个“断层”，然后为其中一边的所有元素赋值，就像“地震”发生时那样。
Another similar method involves making a "fracture" across the array and incrementing one side of it, as if an earthquake had occurred.
提出了数组运算与矩阵运算之间的关系定理，利用该定理给出了计算矩的一种递推算法；
A theorem of relation between quadrate and matrix operation is proposed; an iterating algorithm is then given based on the theorem.
文中详细给出了维分布数组的下标地址计算公式，分布数组的内情向量结构以及分布数组映射函数算法，并对有关编译实现技术进行了探讨。
The formula of subscript address calculation for distributed array, the structure of the internal information vector, and the algorithm of mapping function of distributed array are given.
在托管数组中不允许使用指针算法。
在分析了后缀树和后缀数组字符串匹配算法的基础上，详细阐述了基于后缀数组的精确串联重复序列识别方法。
It addresses the method of identifying the accurate tandem repeat in detail after analyzing suffix tree and suffix array algorithms of string matching.
函数的作用是用“自然排序”算法对数组排序。数组内所有值的键保持不变。
The natsort() function sorts an array by using a "natural order" algorithm. The values keep their original keys.
在定义了数据结构和变量数组的基础上，给出了参数自学习过程算法，改善了模型样机对不同规格样本工件的适应性。
A parameter self-learning algorithm is presented after defining data structure and variable array to improve the prototype's adaptability to different size of workpieces.
就水坝分割算法中的队列的结构设计提出了一种多级可变长度的数组结构。
A queue structure with automated length adjustment is proposed to optimize the watershed algorithm.
该算法利用结构数组，通过搜索映射链表，有效地解决了不同FOM间类属性及参数的映射问题。
It utilizes struct array via searching mapping chain list, solves mapping problem on attribute or parameter of class among different FOMs effectively.
如果数组已经排好序，怎样优化你的算法？
What if the given array is already sorted? How would you optimize your algorithm?
为进一步增强算法的鲁棒性，还使用了BCH纠错编码技术、冗余嵌入和数组重组技术。
To further enhance the robustness, BCH error correction coding techniques, redundant embedding, and an array of recombinant techniques are used.
正如文中所指出的那样，绝大多数组合与时序优化问题，实际上都是NP -完全问题，因而试图给出现实可行的一劳永逸的通用算法在目前是办不到的。
Just as this paper points out, most problems about combination and sequential optimization are in fact NP-complete, so, it's impossible to find a general algorithm to solve all the problem presently.
本文通过对FORTRAN DO循环中数组元素下标式的函数性态的分析研究，给出了一种新的向量化算法——这种算法作者称为“相关函数法”。
By studying the functional properties of index expressions of array elements in FORTRAN DO-loops, a new algorithm, called the associative function algorithm, is developed.
索引告诉我从哪里开始检索数组，对不对？，然后我会去记录下我做了多少次比较，这样我就能看到这个算法的工作量了？
I'm going to set up an index, which is going to tell me where to look, starting at the first part of the list, right?
该算法使用数组方式编码染色体，并采用非常规码的交叉和变异运算因子。
It encodes the chromosome as an array of integers, and USES irregular crossover and mutation operations.
提出了数组链染色体编码方式，以及基于自适应性变异概率和模拟退火惩罚函数法的适应性遗传算法（AGA）。
This paper proposes the array chain chromosome coding and the Adaptive GA (AGA) that combines the self-adaptive mutation probability and simulation anneal punishment function.
用一个数组和一个字符数组分别储存学生的分数和姓名，然后用排序算法进行排序，最后按降幂输出结果。
With an array of characters and an array of storage, respectively, and the names of scores of students, and then sort sorting algorithm, and finally by the lower power output.
用一个数组和一个字符数组分别储存学生的分数和姓名，然后用排序算法进行排序，最后按降幂输出结果。
With an array of characters and an array of storage, respectively, and the names of scores of students, and then sort sorting algorithm, and finally by the lower power output.
应用推荐