对RPE算法进行了改进和补充，使之适用于简单递归网，用来对网络的权值和阈值进行调整。
This RPE algorithm was adapted to the simple recurrent network by making improvement and complementarity, and the weight and the threshold of the network can be adjusted at the same time.
通过简单的递归语句，可以轻松地推动处理符号和数据列表。
Through simple recursive statements, you can power process lists of symbols and data easily.
很多植物在生成分枝形状和叶片图案时遵循简单的递归法则。
Many plants follow simple recursive formulas in generating their branching shapes and leaf patterns.
这就证明了，你可以通过这三个简单的概念，以及它们的递归应用，对任何复杂的软件架构建模。
It turns out that with these three simple concepts and their recursive application, it is possible for you to model arbitrarily complex software architectures.
通过增加简明的语法和支持，函数式语言使递归成为实现简单代码重用的候选方法。
By adding clean syntax and support, functional languages make recursion a candidate for simple code reuse.
递归组合的思想很简单：可以通过组合现有的商业流程来定义新的商业流程（请参见图1）。
The idea of recursive composition is simple: new business processes can be defined by combining existing business processes (see Figure 1).
HOP的第1章从几个简单的主题展开了讨论，例如递归和回调，同时给出了很好的例子。
Chapter 1 in HOP opens with simple topics like recursion and callbacks, always backed by good examples.
简单的非递归过程表达式并不能访问所有的元素，尽管许多库都包含有帮助功能，可以用于遍历树。
No simple non-recursive procedural expression accesses all elements, although many libraries include helper functions for walking the tree.
在开始介绍SPU汇编语言之前，先来看一个通过递归算法计算32 位数的阶乘的简单程序。
To begin looking at SPU assembly language, I will enter in a simple program for calculating the factorial of a 32-bit number using a recursive algorithm.
由于DITAscreen和uicontrol元素描述导航控件(参见清单1)，遍历一个通过应用程序的路径变成简单的递归。
Because the DITA screen and uicontrol elements describe navigation controls (see Listing 1), traversing a path through the application becomes a matter of simple recursion.
例如，概念模型可能显示从Person到它本身的一个简单的递归关系。
For example, the conceptual model may show a simple recursive relationship from Person to itself.
最后对于递归表达式的情况，当解析器在表达式递归中看到括号时，就应该简单地进行回送，如清单21中所示。
Finally, for the case of recursive expressions, the parser should simply echo parentheses when it sees them within the expression recursion, as illustrated in Listing 21.
我们先前的简单示例(其中，多态递归作为一个简单直接的自引用发生)会使这一事实变得模糊。
This fact may be obfuscated by our simple example earlier in which the polymorphic recursion occurs as a simple, direct self-reference.
对刚开始接触计算机编程的人而言，这里有递归的一个简单定义：当函数直接或者间接调用自己时，则发生了递归。
For those of you who are new to computer programming, here's a simple definition of recursion: recursion occurs when a function calls itself directly or indirectly.
由于尾部递归优化，这种方式是对列表进行迭代的一种非常简单的方式。
With tail-recursion optimization, this idiom is a marvelously concise way to iterate over a list.
有时候，编写递归程序时难以获得更简单的子问题。
Sometimes when writing recursive programs, finding the simpler sub-problem can be tricky.
由于在成员项所包含的内容出现在较大型的结构之前，成员项必须是有效对象，所以最简单的递归继承方法不起作用。
Since member items need to be valid objects prior to their inclusion in larger structures, the simplest recursive descent approach would not work.
使用归纳数据编写递归过程非常简单。
With inductive data, it is fairly easy to write recursive procedures.
在XSLT 1.0中，必须编写许多算法，甚至递归编写简单算法。
In XSLT 1.0, you must write many algorithms, even simple ones, recursively.
Lisp编译器或解释器能够将特定形式的递归翻译为迭代，从而允许以一种更为简单明快的方式来使用递归数据结构（如树结构）。
The Lisp compiler or interpreter can translate certain forms of recursion to iteration, allowing a simpler, cleaner way to work with recursive data structures, such as trees.
这些由列表构建的简单指令构成了递归、高阶函数，甚至是闭包和continuation之类高级抽象的基础。
These simple list-building instructions form the foundation of recursions, higher-order functions, and even higher-order abstractions like closures and continuations.
GNU文件实用程序(fileutils)可以完成递归目录删除和目录移动，但是在版本4.1之前，当遍历目录结构时，它只是简单的遵循“. .”这个特殊条目。
The GNU file utilities (fileutils) can do recursive directory deletions and directory moves, but before V4.1, it simply followed the ".. "special entry as it walked the directory structure.
为了让编写递归模式更为简单，Scheme使用一个名为命名let (named let)的快捷方法。
In order to make programming recursive patterns easier, Scheme contains a shortcut called the named let.
简单的说，递归的fib的分析实际上非常复杂。
Fib Roughly speaking, the analysis of fib is actually quite complex, of a recursive fib.
这两个简单的递归功能可以找到的所有用户。
These two simple functions can recursively find all of the users.
利用这些特性，对于求解较为复杂的线性递归关系提供了一种简单的方法。
Making use of these properties provides a simple and convenient solution for some more complex relationship of linear recursion.
微分等价递归算法计算简单，在体系可靠度计算中有着广泛的应用。
Differential equivalent recursion algorithm is widely used in the reliability calculation of structural system because of its simplicity.
运用树的遍历技术进行实用潮流计算，递归方程的使用使得编程简单，并且不需要形成阻抗阵或导纳阵。
Efficient power flow is calculated by means of tree technique and recursion, which do not need resistance or admittance matrix.
这样做允许我们简单的描述过程，但是仍然能够通过RUP生命周期的递归程序，建造十分复杂的计划。
This permits one to describe the process simply, but still be able to construct plans of arbitrary complexity by recursive application of the RUP lifecycle.
这样做允许我们简单的描述过程，但是仍然能够通过RUP生命周期的递归程序，建造十分复杂的计划。
This permits one to describe the process simply, but still be able to construct plans of arbitrary complexity by recursive application of the RUP lifecycle.
应用推荐