域模型是一个可以序列化为XML的嵌套对象的递归数据结构。
The domain model is a recursive data structure of nested objects that can be serialized as XML.
由于其复杂的结构，你可以对活动递归地进行分组并对流进行连接以形成更高的层，这种层次清晰地定义了输入和输出。
As with complex structures, you can recursively group activities and their interconnection flows into higher-level activities with clearly defined inputs and outputs.
所以，只想直接展开结构，可能会形成无限的递归循环。
As a result, just trying to expand the structure directly leads to infinite recursion loops.
下图显示了查询递归数据的RCTE结构。
The following figure shows the structure of an RCTE for querying recursive data.
Lisp提供用于迭代的编码结构，但递归是更受欢迎的列表遍历方式。
Lisp provides coding structures for iteration, but recursion is a far more popular way to navigate lists.
r选项让rsync递归遍历目录并复制整个目录结构。
The -r option tells rsync to recurse into the directories and copy the entire structure.
为了允许递归，协作结构被嵌套到类的规范中。这就是说这个类的所有实例都将有一个由类定义的内部结构。
To allow recursion, a collaboration structure is nested within a class specification, which means that all instances of that class will have an internal structure specified by the class definition.
可以使用到这种层次结构，也可以使用递归嵌套的元素。
You can use either the through hierarchy or the element, nested recursively.
如果您的程序需要遍历文件系统(递归地遍历子目录)，那么要提防攻击者可能会利用您正在遍历的目录结构。
If your program walks the file system, recursively iterating through subdirectories, be careful if an attacker could ever manipulate the directory structure you're walking.
BPEL4WS允许您递归地组合结构化活动，以表达任意复杂的算法，这些算法表示了服务的实现。
BPEL4WS allows you to recursively combine the structured activities to express arbitrarily complex algorithms that represent the implementation of the service.
大多数问题与递归结构以及如何处理动态输入和输出数据有关。
The majority of the issues relate to recursive structures and how to cope with dynamic input and output data.
如果我们能找到一个除去这些不需要的栈结构的方法，那么我们的尾部递归函数就可以在固定大小的栈中运行。
If we could find a way to remove these unneeded stack frames, our tail-recursive functions would run in a constant stack size.
通过将大型、复杂的系统划分为小型的构成部分并集中于每个部分，可以递归地使用体系结构。
Architecture can be used recursively by dividing a large, complex system into small constituent parts and focusing on each part.
由于在成员项所包含的内容出现在较大型的结构之前，成员项必须是有效对象，所以最简单的递归继承方法不起作用。
Since member items need to be valid objects prior to their inclusion in larger structures, the simplest recursive descent approach would not work.
它是由递归下行复合数据结构引起的，这种下行方式有时在一次递归调用中要下行多级。
It is caused by recursively descending a composite data structure in such a way that, sometimes, more than one step in the descent is taken in a single recursive call.
某个流程在其本身的分解层次结构中出现，这将导致一个递归的细化过程。
A process that occurs within its own decomposition hierarchy leads to a recursive refinement.
此外，BLA体系结构支持按引用的递归组合，从而促进BLA和各个所部署构件的层次结构组装。
Additionally, BLA architecture supports recursive composition by reference, facilitating hierarchical assembly of BLAs and individual deployed artifacts.
LEVEL—伪列LEVEL返回一个整数值，表示所生成行的分层结构中的递归步骤。
LEVEL - the pseudo column LEVEL returns an integer value that represents the recursive step in the hierarchy at which the row was produced.
要想复制整个目录结构，可以使用 -r选项递归地把整个目录结构从一个位置复制到另一个位置：$cp -rsourcedestination。
To copy an entire directory structure you can use the -r option to recursively copy an entire directory structure from one place to another: $ cp -r source destination.
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.
另外一项差异在于，在zippers版本内部使用的是数据结构的线性尾递归遍历，而非递归遍历。
Another difference is that, internally, the zipper version USES a linear tail-recursive traversal of the data structure instead of a recursive traversal.
XML文档非常适合使用递归算法，因为它们的层次结构在本质上是可递归的。
A recursive algorithm works well with XML documents because their hierarchical structure is inherently recursive. The algorithm is as follows.
因为返回的SOAPElement在底层具有对象层次结构，所以必须递归地处理树以获得实际的数据对象。
Since the returned SOAPElement has a hierarchy of objects underneath, you have to iterate through the tree to get the actual data object.
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.
ls- R可以递归地列出层次结构中的内容。
所有的程序员都熟悉这些算法，包括递归、层次数据结构和多线程等。
All programmers are fluent in these algorithms, including such things as recursion, hierarchical data structures, and multithreading.
提出一种准对角递归神经网络(QDRNN)结构及学习算法。
A structure and training algorithm for quasi-diagonal recurrent neural network (QDRNN) is presented.
由于直接采用概率事件结构难以刻画递归进程，因此，本文在概率事件结构上采用了一种度量的方法。
Since it is hard to specify recursive processes using probabilistic event structures directly, we use a metric approach on probabilistic event structures.
研究了知识管理子系统的信息模型和树型结构的递归算法。
The recursive algorithmfor the information model and tree typed structure in the knowledge management subsystem has been studied.
在实证研究中，以PLS—结构方程原理为支撑，采用递归迭代方法对应用模型进行了详尽的拟合分析与统计检验。
In the demonstration research, base on the PLS - structure equation principle, used the recursion iteration method to carry on the exhaustive fitting analysis and the statistical test using the model.
应用推荐