研究了基于相空间重构的递归图及定量递归分析。
The recurrence plots and quantification recurrence analysis on the basis of state space reconstruction are explored.
正如您在图10中可以看到的，图标和标题对先是遍历，然后再递归。
As you can see in Figure 10, the icon and caption pairs are iterated across and then down.
图4显示一个递归组合流程，其中一个流程中的活动被绑定到另一个流程的公共接口。
Figure 4 shows a recursively composed process where an activity in one process is tied to the public interface of another process.
递归组合的思想很简单：可以通过组合现有的商业流程来定义新的商业流程（请参见图1）。
The idea of recursive composition is simple: new business processes can be defined by combining existing business processes (see Figure 1).
你也可以从更高层递归地调用这些打包了的交互活动，类似于宏调用(图4)。
You can invoke these packaged interactions recursively from within higher-level interactions analogous to macro invocations (Figure 4).
然后就可以选择合适的XMLAPI，让每个bean提供表示自己状态的元素，并递归地对自己的成员调用对象图。
You would then pick a suitable XML API and have each bean emit elements to represent its state and recursively call down the object graph to its members.
提出了资源引用导航和工序图递归化生成技术，并在工艺可重用设计系统中得到应用。
Resource guidance and recursive generation techniques of process picture sheet are presented, and have been applied to this system.
现在有一些文献对有向图的强连通分量做了一些讨论，一般采用了递归的方法。
Many documents and papers nowadays have discussed the strong connected component of the directed graph, and the method they adopted is usually Recursion.
丢番图方程；正整数解；同余；递归序列。
Diophantine equation; Positive integer solution; congruence; Recurrent sequence.
介绍了用递归低通滤波器方法来实现图象的方差自适应增强。
A method of implementing adaptive enhancement of variance on an image by a recursive low-pass filter is introduced mainly in this paper.
内容包括：数组、链接表、栈和队列、递归、树与森林、图、排序、检索和散列结构等。
The contents are included as follows: Array, Linked List, Stack and Queue, Recursion, Tree and Forest, Graph, Sorting, Indexing and Hashing Structure, etc.
研究了任意N阶k正则简单图的生成法则，提出了由简单完全图递归生成任意N阶k正则图的方法。
The generative rule of arbitrary N-rank K-regular simple graph is studied, and the method of recursively generating arbitrary N-rank K-regular graph from the simple complete graph is put forward.
研究了任意N阶k正则简单图的生成法则，提出了由简单完全图递归生成任意N阶k正则图的方法。
The generative rule of arbitrary N-rank K-regular simple graph is studied, and the method of recursively generating arbitrary N-rank K-regular graph from the simple complete graph is put forward.
应用推荐