To access the Batch Editor open a Spring XML bean definition file with Batch jobs in it with the Spring Config Editor and select the batch-graph tab.
要想访问该编辑器，请使用SpringConfigEditor打开一个SpringXMLbean定义文件（里面有Batchjobs）并选择batch-graph标签。
This paper proposes an origin definition of heterogeneous task graph, which is a visual and valid description scheme of heterogeneous programs.
为此提出了异构任务图的定义，它是异构程序直观和有效描述方法。
For this algorithm, a new definition of components graph is described and good locality of algorithm is developed in use of lower distance.
该算法给出了新的区域关系图的定义，并利用了基于下降距离的方法的局部性；
The paper also gives the rules of subassembly detection, employing connection graph and local blocking graph, based on the definition of subassembly.
根据子装配体的定义给出了利用联接图和局部阻碍图识别子装配体的规则。
A constructible definition of the directed acyclic graph was described, and the reason why exists a solution that does not exceed the total execution time of all tasks was explained.
描述了有向无回路图的构造性定义，指出问题一定有不超过所有任务执行时间总和的解。
This paper presents a definition of imitative dual graph of outplane graphs, and proves the structural theorem on outplane graphs by using the nature of imitative dual graph of outplane graphs.
给出了外平面图的拟对偶图的定义，并利用拟对偶图的性质证明了外平面图的结构定理。
The definition and graph of the Witch of Agnesis is given.
给出了阿格尼丝箕舌线定义及图型。
By combining the rough set theory with the traditional graph theory, the equal definition of classical graph is presented based on the idea of rough set theory.
将粗糙集理论和传统图论相结合，给出基于粗糙集思想的传统图的等价定义及粗糙图的定义，并进一步给出了粗糙图的矩阵表示及粗糙图的粗糙性分析。
First of all, this paper gives a definition of the unique shortest chain graph (U. S. C. graph).
本文首先把图中任二点之间的最短链仅有一条者定义为唯一最短链图。
With the definition of the strong signed domination function and the strong signed domination number of a graph, some lower bounds of the strong signed domination number about graph are obtained.
本文对几类特殊图的强符号控制函数及强符号控制数进行了研究，给出了完全图、完全二部图、路及圈的强符号控制数。
With the definition of the strong signed domination function and the strong signed domination number of a graph, some lower bounds of the strong signed domination number about graph are obtained.
本文对几类特殊图的强符号控制函数及强符号控制数进行了研究，给出了完全图、完全二部图、路及圈的强符号控制数。
应用推荐