| 1. | Calculate number of periods
计算周期数。 |
| 2. | " developerworks , june 2005 provides a roadmap for harvesting spare compute cycles
” （ developerworks ， 2005年6月）给出了一个利用空闲计算周期的路线图。 |
| 3. | 6 . three fast algorithms for determining the k - error linear complexity of periodic sequences are proposed
提出三个计算周期序列k -错线性复杂度的快速算法。 |
| 4. | The reasons are that in a scavenging grid , which snatches computing cycles from desktop pcs , ownership of the resources remains local and scheduling must accommodate the needs of the owners
原因在于，拾遗网格是从桌面pc中获取计算周期，而资源的所有者仍然在本地，所以网格对资源的规划必须适应资源所有者的需要。 |
| 5. | If the lowest computation period for one unit is one minute and the highest 10 minutes , then clients could easily contact the server for more information at anything between 20 - and 200 - minute intervals
如果一个单元的最短计算周期为一分钟，最长时间为10分钟，那么客户机很可能每过20分钟到200分钟向服务器请求更多信息。 |
| 6. | 3 . a fast algorithm is proposed for computing the linear complexity of a binary sequence with period p ? and generalized one for determining the linear complexity of a sequence with period pfl over gf ( q )
提出了一个计算周期为p ~ n的二元序列的线性复杂度的快速算法，并推广为确定gf （ q ）上周期为p ~ n的序列线性复杂度的快速算法。 |
| 7. | The high - order finite element methods are used to obtain high accurate solutions of the steady flows . characteristics of the chaotic mixing are analyzed by numerical simulation and experiment through examining of the asymptotic coverage of a passive tracer
数值模拟采用高阶有限元获得高精度的流场，计算周期和非周期混沌混合中的染色液滴对流图案和实验进行比较。 |
| 8. | Based on these , it is discussed how to realize and simplify it in dsp system . the primary parameters of the hardware system are also estimated such as sample frequency , calculation period and the amount of memory
并在此基础上，分析了该算法在dsp处理器中的实现以及运算量的初步简化，估算了该波束形成算法所要求的硬件系统载荷? ?运算量(计算周期) 、采样率以及数据存储量。 |
| 9. | Imagine an environment where free computing cycles are dynamically gathered for real - time on - demand computing directly from the data - generating instruments themselves instead of monolithic large - scale , batch - orientated computation
假设有这样一个环境：将空闲的计算周期搜集起来，根据需要提供给数据生成的基础设施中所执行的计算使用（而不是那些大型的、面向批处理的计算） 。 |
| 10. | This dissertation mainly investigate important measure indexes ? inear complexity , k - error linear complexity and period , on the security of stream ciphers , design several fast algorithms for determining the linear complexity and k - error linear complexity of periodic sequences
本文主要研究流密码安全性重要的度量指标- -线性复杂度、 k -错线性复杂度和周期等，设计出若干计算周期序列的线性复杂度和k -错线性复杂度的快速算法，得到如下主要结果： 1 |
