通过实例进行了算法测试和比较。
因此，密码算法测试平台的研究具有非常重要的实际意义。
Therefore, the testing of cryptographic algorithm is of practical significance.
第五章提出了用佳点集理论构造算法测试集的方法，并给出实例。
Chapter 5 presents the way to make test set of the algorithm, and gives some instances.
本文讲述的是一种应用加权递推的最小二乘辨识算法测试舵机带宽的实用方法。
An efficient method for testing the band width of actuator, weighted recursive least squares identification arithmetic, is presented in this paper.
算法测试表明：改进后的人工鱼群算法提高了收敛速度，增强了全局搜索能力。
Algorithm tests show that this algorithm can improve the speed of convergence efficiently and is good at global searching in solution space.
针对软件测试方案中的悬浮控制算法测试，对平台进行了细化设计并予以实现。
After the test requirements have been analyzed, the platform is constructed primarily, and the test ways and the test schemes to the whole levitation system are shown.
在算法测试中，采用四阶龙格库塔法和毕卡逼近法分别对姿态矩阵方程进行了解算，并对得到的数据进行测试和评估。
In the algorithm test, Runge-Kutta method and the Picard approximation method were used to make the solution for the matrix equation of the profile calculation, and I evaluated the data obtained.
在S3C44 B0 X开发板上进行算法测试，结果证明，用该方法校准的触摸屏系统的稳定性和精度得到很大改善。
It tests the algorithm based on developing board of S3C44B0X. Results show that the stability and precision of touch screen system are greatly improved.
使用典型的数据集对您感兴趣的特定算法真正进行一下基准测试会告诉您需要了解哪些内容。
Actual benchmark testing of a particular algorithm of interest to you, using a representative data set, would tell you what you need to know.
当希望对SPE代码或算法进行单元测试或获取有关它们的分时信息时，这可能就足够了。
When you want to do unit tests on SPE code or algorithms or get timing information on them, this is probably enough.
换句话说，补充您的统计测试或过程学习的一个好办法就是将这个过程作为算法实现。
In other words, a good way to complement your learning of a statistical test or procedure is to implement that procedure as an algorithm.
开发人员可以快速试验一个想法、研究一种对象属性或不同算法，而无需编译、执行和测试任何代码。
A developer can quickly try out an idea and explore an object's properties or different algorithms without having to compile, execute, and test any code.
是的，当你首先编写测试时，你不能编写一个完整的算法。
It's true, when you write tests first, you cannot write a whole algorithm.
接着下一个测试必须使用不同的参数值，迫使我们实现正确的算法，以通过所有的测试，即使我们还没有开始下一个环节的重构。
However, the next test might use different parameter values, forcing us to implement a proper algorithm in order to pass both tests, even if we didn't refactor as described next.
想想看这个程序会在我们测试复杂的算法时给我们提供多大的帮助！
Think of the time such a program might save us for testing complex algorithms!
在白箱测试中，测试工程师能够访问内部数据结构和算法。
In white-box testing, the test engineer has access to the internal data structures and algorithms.
为了测试他们的算法，研究者们用两个机器人进行了20次“隐藏-查找”实验。
To test their algorithms, the researchers ran 20 hide-and-seek experiments with two autonomous robots.
当然还有效率更高的素数测试方法，不过这种算法最容易理解。
Of course, much more efficient algorithms for testing primality exist, but this one is the easiest to understand.
一旦输入向量通过了“大小相等”和“值大于1”测试，就执行算法的核心部分。
Once the input vectors have passed the "equal size" and "size greater than 1" tests, the heart of the algorithm is executed.
有时候人工测试是比计算机算法更有效率的办法!
Sometimes a human is a more efficient oracle than a computer algorithm!
只要经过为数不多的测试，可能是10次，也可能是20次，您就会清楚的知道算法汇集需要多长时间，以及您想要的适应性是什么样子的。
A few test runs, maybe 10 or 20, will give you a good feel for how quickly the algorithm converges, what kind of fitness you can expect.
这需要不同的测试检测算法，在下面讨论的框架中就会看到。
This requires a different test detection algorithm, as you will see as you now turn your attention to these frameworks.
他们根据“通话时间”测试了这些“像素”之间的联系程度，并且使用了多种算法，把多个“像素”拼成更大的区域。
They measured how strongly these were connected in terms of "talk time", and used several algorithms to group the pixels into larger regions.
好，今天剩下的时间里，我们不再讲算法，计算和排序这些话题了，我们会做一些非常实用的事，我们主要的讲讲测试。
OK. Today, for the rest of the lecture, we're going to take a break from the topic of algorithms, and computation, and things of the sort. And do something pretty pragmatic.
LinkedIn有两个工程师从事这个管道开发，他们每周可以测试5个新算法。
They have two engineers who work on this pipeline, and are able to test five new algorithms per week.
Tellurium0.7.0中的Santa算法通过一次定位整个的UImodule，从而进一步提高测试的智能性。
The Santa algorithm in Tellurium 0.7.0 further improves the test robustness by locating the whole UI module in a single attempt.
当清除多余区域时，叫作“MethodandSystemforGeneratinganOptimizedSuite ofTestCases”的用一种算法可以使覆盖区域达到最少的测试用例。
Called "Method and System for Generating an Optimized Suite of test cases," it USES an algorithm and can arrive at a minimal number of test cases for coverage while eliminating redundancy.
当我开始凭经验测试时，我实在惊奇Burrows - Wheeler算法的有效性。
I was honestly surprised by just how effective the Burrows-Wheeler algorithm was when I started empirical testing.
第二个更简单的算法叫做Deutsch -Jozsa算法，它用来测试一枚硬币的正反面是否等概率出现。
The second, more simple, algorithm, the Deutsch-Jozsa algorithm, tests whether the flip of a coin is fair or not.
第二个更简单的算法叫做Deutsch -Jozsa算法，它用来测试一枚硬币的正反面是否等概率出现。
The second, more simple, algorithm, the Deutsch-Jozsa algorithm, tests whether the flip of a coin is fair or not.
应用推荐