这在fork-join问题实现中很常见，因为递归分解问题的过程将会创建大量的新Problem对象。
This is typical of fork-join problem implementations because the process of recursively dividing the problem will create a potentially large number of new Problem objects.
基于区域递归分解算法是一种有效的四边形网格生成算法，能较好地运用于复杂的单连通和多连通图形区域，自动化程度高。
This paper presents an efficient algorithm for creating automatic quadrilateral mesh based on a recursive decomposition domain of quadrilateral elements.
递归的系统分解和从抽象到具体的转换。
Recursive system decomposition and transformation from the abstract to the concrete.
DB 2V9.5解除了这个限制，现在即使模式是递归的，用户也可以对数据进行注释和分解。
DB2 V9.5 lifts this restriction, and now users can annotate and decompose the data even when the schema is recursive.
这些服务经常依次被当作流程，这导致递归的分解。
These services, in turn, are often considered to be processes, which leads to the recursive decomposition.
某个流程在其本身的分解层次结构中出现，这将导致一个递归的细化过程。
A process that occurs within its own decomposition hierarchy leads to a recursive refinement.
DB 29支持XML模式的注释，因此除递归模式外，可以将数据分解为关系表。
DB2 9 supports annotation of XML schemas so that the data can be decomposed into relational tables with the restriction on recursive schemas.
如果Group名称与另一个Ruleset相匹配，那么递归调用就尝试进一步分解字符串(对于上一篇专栏文章示例中的an：fields元素，也是这么做的)。
If the Group name matches another Ruleset, a recursive call attempts to further decompose the string (this was true for the an: fields element that appeared in the examples in the last column).
在需要分解以确定原子级系统元素时，此方法的递归性质让分解尽可能多次的发生。
The recursive nature of the approach allows decomposition to occur as many times as needed to identify atomic system elements.
通过递归地将系统分解为各个要素部分，关注体系架构也是一种很好的将大型问题分解为一系列小型问题的方式。
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.
从业务过程或者业务模型开始着手，然后将之递归地分解成子过程或子模型，直到达到某些条件，再继续分解就会违反这些条件为止。
Starting from the business-process or a business model and decomposing that into sub-processes or sub-models recursively until some condition is met by which it can't be decomposed any further.
基于线性代数与矩阵理论，给出利用LDLT分解计算实对称矩阵特征值的递归算法。
A recursive algorithm for calculating the eigenvalues of a real symmetric matrix based on LDLT decomposition is given.
给出了循环几乎可分解的循环有向三元系的一些直接构造和递归构造。
The direct and recursive constructions for a cyclically almost resolvable cyclic directed triple system are given.
对刀具ae信号进行递归小波分解，提取特征并应用于改进的ART2网络识别刀具状态。
The AE signals of tool conditions are decomposed using a recursive wavelet from which the features are extracted and delivered to an improved ART2 network for fault recognition.
对刀具AE信号进行递归小波分解，提取特征并应用ART2网络识别刀具状态。
The AE signals of tool conditions were decomposed using a recursive wavelet from which the features are extracted and delivered to an ART2 network for fault recognition.
对非递归部分进行多相分解，实现高速滤波。
Polyphase decomposition is applied to non-recursive part to realize high-speed filtering.
完全分解过程将以递归方式执行此替换，直到字符串中的任何字符都不能再做进一步的分解。
A full decomposition recursively performs this replacement until none of the characters in the string can be decomposed further.
完全分解过程将以递归方式执行此替换，直到字符串中的任何字符都不能再做进一步的分解。
A full decomposition recursively performs this replacement until none of the characters in the string can be decomposed further.
应用推荐