OpenUP将项目划分为迭代:有计划的、有时限的迭代操作,通常以周为单位。
OpenUP divides the project into iterations: planned, time-boxed intervals typically measured in weeks.
那么,您会了解到所有的列表均有一个基本的操作:迭代。
So, you know that all lists have one basic operation: iteration.
状态通过 initial-state 预设,并在整个迭代过程中传递,允许访问者函数按照所需的任何方式操作状态。
The state is primed with initial-state and passed throughout the iteration, allowing the visitor functions to manipulate it in whatever way they desire.
所有参与方必须认识到常常需要通过另一次迭代把业务指示细化到操作层。
All parties must be aware there is frequently another iteration required to refine business directives to an operational scope.
在该迭代过程中,团队成员为E1中指定的特性构建最初的操作能力,为个人和家庭成员生成稳定的在线支付产品。
Team members built initial operational capability for features specified in E1 during this iteration, producing a stable, online payment product for individuals and family members.
新循环代码每次迭代中减少两个操作,随着迭代次数的增长,性能将显著提升。
The new loop code has two fewer operations per iteration, which can lead to increasing performance gains as the number of iterations increases.
获取或设置操作的迭代数。
通过反复迭代进行时反操作,可以明显提高聚焦信号能量;
Repeated time reversal iterations can obviously enhance the focus signal energy.
该方案基于公钥基础设施体系架构,采用了随机数、“盐”和多轮迭代等手段保证系统的安全性,并且通过在客户端进行密钥生成和加解密操作的方式实现了系统的可扩展性。
The scheme was based on the public key infrastructure(PKI) architecture with system security achieved by various means such as random numbers, salt, and multiple round iterations.
当前可视分析系统对分析推理的迭代过程支持不足,从而给用户带来较大的操作负担和记忆负担。
Existing visual analytic systems have deficiency in supporting the iterative process of analytic reasoning, which bring heavy memory burden to users.
算法采用使操作臂末端点与目标点间距离单调减小的控制策略,并推导出了相应的非迭代公式。
It USES the control strategy in which the distance between the manipulator end and the target could be decreased monotonously, and the corresponding non iterative formula is deducted.
该算法将复杂的优化问题转化为几十次简单的迭代加以解决,每次迭代只需几次快速傅里叶变换和收缩操作即可。
The algorithm converts the complex optimization problem to several iterations, each of which requires only several simple Fast Fourier Transformations and shrinkage operations.
是否有要立即采取的或在迭代计划中描述的用于减轻风险发生的影响的操作?
Are there any actions that would mitigate the impact of occurrence that you want to take now or describe in an iteration plan?
是否有要立即采取的或在迭代计划中描述的用于降低风险发生概率的操作?
Are there any actions that will reduce the probability of occurrence that you want to take now or describe in an iteration plan?
然而,这也是一个成本较高的选择,因为每当您跨集合内容进行迭代时,您就不得不同步所有操作,包括读和写,以此保证一致性。
That's also a costly option, however, because every time you iterate across the contents of the collection, you have to synchronize all operations, including read and write, to ensure consistency.
此外,您可以使用该操作来迭代数组(包括基本类型数组)中的元素。
In addition, you can use this action to iterate through the elements of an array, including arrays of primitives.
使用迭代器编写程序时,必须留意哪些操作会使迭代器失效。
When writing programs that use iterators, we must be aware of which operations can invalidate the iterators.
这种直接计算迭代器的方法,与用迭代器逐个元素自增操作到达中间元素的方法是等价的,但前者的效率要高得多。
It is more efficient to calculate this iterator directly than to write an equivalent program that increments the iterator one by one until it reaches the middle element.
在深入探讨容器操作之前,先来了解一下迭代器和迭代器范围。
Before we look further at the container operations, we should understand a bit more about iterators and iterator ranges.
您能够完成这些改变和添加操作,然后将新的或者修改过的测试标注为新的迭代。
You can make these changes and additions, and then tag the new or modified tests with the new iteration.
到期日:当工作被指定为到期时,如果操作者没有设置该数据区域的值,那么我们相信它的值就是迭代的截止日期。
Due date: When the work is specified as being due, if the contributor doesn't set value to this data field, we believe its value equal to the iteration's end date.
作为规则1和规则2所产生的副作用,您应当期望移植操作是一个需要被迭代完成的试验和错误过程,直到得到一个满意的结果为止。
As a side effect of rules 1 and 2 above, one should expect a migration to be a trial and error process to be done iteratively until a satisfactory result has been achieved.
若一种类型支持一组确定的操作(这些操作可用来遍历容器内的元素,并访问这些元素的值),我们就称这种类型为迭代器。
We refer to a type as an iterator if it supports a certain set of actions. Those actions let us navigate among the elements of a container and let us access the value of those elements.
其一种方法是迭代式的增加缓存大小并在峰值稳定状态负载下运行应用程序,直到PMI指标不再报告任何缓存丢弃操作。
The other option is to iteratively increase the cache size and run the application under peak steady state load until the PMI metrics report no more cache discards.
算法使用分组代替迭代计算,摒弃复杂的子载波交换操作,以极低的复杂度实现了等功率下的自适应子载波分配和比特加载。
The algorithm, which involves adaptive sub-carrier allocation and bit loading with equally power allocation, adopts a grouping technique rather than the sub-carrier swapping.
算法使用分组代替迭代计算,摒弃复杂的子载波交换操作,以极低的复杂度实现了等功率下的自适应子载波分配和比特加载。
The algorithm, which involves adaptive sub-carrier allocation and bit loading with equally power allocation, adopts a grouping technique rather than the sub-carrier swapping.
应用推荐