对非递归部分进行多相分解，实现高速滤波。
Polyphase decomposition is applied to non-recursive part to realize high-speed filtering.
然而，造成这种现象的部分原因是大多数命令式语言没有提供相应的支持，因此使用递归很困难。
However, part of the reason lies with the fact that most imperative languages have lackluster support for it, making it more difficult to use than it should be.
第二部分代表迭代或递归。
当然，列表的强大力量部分来自于递归处理列表元素的能力，这表示可以从列表提取头部，直到列表为空，然后累积结果。
Of course, part of the power of lists comes in recursive processing of the list elements, which simply means pulling the head from the list until the list is empty, then accumulating the results.
当前计算的结果依赖于之前的部分结果，所以，在每次后续递归调用中，我们向前传递那些结果。
The result of the present computation depended on the partial results before it, so in each successive recursive call, we pass those results forward.
艾菲尔铁塔看起来惊人的部分原因在于它是一个递归的解决方案，塔上之塔。
The Eiffel tower looks striking partly because it is a recursive solution, a tower on a tower.
所以我们递归处理列表其余部分，并再次尝试。
通过将大型、复杂的系统划分为小型的构成部分并集中于每个部分，可以递归地使用体系结构。
Architecture can be used recursively by dividing a large, complex system into small constituent parts and focusing on each part.
在本栏目的下一部分，我将向您介绍WSFL另一个很酷的功能：在现有的商业流程中递归嵌套成新的商业流程。
In the next installment of this column, I'll introduce you to another cool feature of WSFL: the ability to recursively compose new business processes from existing business processes.
非递归查询允许服务器返回部分响应，例如返回可能知道答案(或可能具有更多信息)的服务器的名称或地址。
Non-recursive queries allow the server to return a partial response, such as returning the name or address of the server that may know the answer (or may have more information).
如果我来写斐波那契数列你可以看看这儿,原因是我想让你看看这部分的递归可以翻倍。
And the reason I want to show you this is to notice that the recursion can be doubled.
为此，它将选取列表的第一个元素 — 列表头部 —来对该元素执行处理，然后再递归式地将列表的其余部分传递给自身。
To do so, it will pick off the first element of the list — the head — to do the processing on that element, and recursively pass the rest of the list to itself again.
通过递归地将系统分解为各个要素部分，关注体系架构也是一种很好的将大型问题分解为一系列小型问题的方式。
The focus on architecture is also a good way of taking a large problem and breaking it down into a series of smaller problems, by recursively decomposing the system into its constituent parts.
函数其余部分的代码将输出文件，接着输出目录，然后是递归。
The rest of the code found in the function prints the files, then the directories, then recurses.
在第4部分和最后，我们将探讨递归嵌套的概念，并且示例说明商业流程怎样被组合利用来解决更加复杂的商业问题。
In the fourth and final installment, we'll explore the concept of recursive composition and demonstrate how business processes may be combined to solve ever more complex business issues.
为了实现递归，可以通过将proceed(. .)调用封装在匿名类中来隐藏连接点的其他部分。
To do this recursively, you close over the rest of the join point by encapsulating the proceed (..) call in an anonymous class.
first能够去除列表的第一个元素，rest简化了将尾部递归(清单9中的递归类型)应用于列表其余部分的过程。
First can peel off the first element of the list, and rest makes it easy to apply tail recursion — the type of recursion in Listing 9 — to the rest.
非递归查询允许服务器返回部分响应，例如返回可能知道答案(或可能具有更多信息)的服务器的名称或地址。
Non - recursive queries allow the server to return a partial response, such as returning the name or address of the server that may know the answer (or may have more information).
第二部分，基于递归算法，使用一种“下落”(DROP)方法来分配堆场空间。
Secondly, based on recursive algorithm, a yard approach to the yard space allocation, named DROP.
该结构将波前控制算法分为递归运算和卷积运算两部分后，采用规范映射方法将其分别映射到脉动阵列，再将两个阵列链接以实现单路的波前控制运算。
This structure divides wavefront control calculation into recursive algorithm and convolution algorithm, and maps them to respectively systolic array by using canonical mapping method.
作为滤波理论的应用，我们研究了一类部分可观测的递归线性二次最优控制问题。
As an application of filtering theory, we study one kind of partially observed linear quadratic recursive optimal control problem.
作为最大值原理的应用，我们研究了一类部分可观测的递归线性二次最优控制问题。
As an application of the maximum principle, one kind of partially observed linear quadratic recursive optimal control problem is also studied.
作为最大值原理的应用，我们研究了一类部分可观测的递归线性二次最优控制问题。
As an application of the maximum principle, one kind of partially observed linear quadratic recursive optimal control problem is also studied.
应用推荐