说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 有环触发图
1)  cyclic triggering graph
有环触发图
1.
Through study of the termination of rule set corresponding to cyclic triggering graph and analysis of triggering graph and activation graph, we present the concept of united formula and thereby the algorithm to determine termination of rule set corresponding to cyclic triggering graph.
针对有环触发图对应规则集的终止性问题进行了研究,通过对触发图、活化图的分析,提出了联合公式的概念,在此基础上给出了有环触发图对应规则集的终止性判定算法,该算法的提出能够更精确地判定规则集的终止性。
2)  triggering graph
触发图
1.
By a study of the basic triggering graph analysis method, depending on the behavior characteristic of active rule, a rule termination analysis method combining triggering graph with activation graph is concluded, and introduced to the active object oriented database system AO2DB for active rule termination analysis.
通过对基本触发图分析方法的研究 ,根据主动规则的可终止性给出了将触发图和激活图相结合的一种规则终止分析方法 ,并将其运用于主动面向对象数据库系统 AO2 DB的规则终止分析中 。
3)  ring around
环形触发
4)  existing trigger
已有触发器
1.
According to the transformation principle between triggers and the intuitive of Karnaugh map,a new method to achieve transformation between triggers by comparing the existing trigger\'s Karnaugh map with the target trigger\'s Karnaugh map is put forward,and it is used in the conversion from JK trigger to other triggers.
根据触发器的变换原理和卡诺图的直观性,提出了一种通过比较目标触发器和已有触发器的卡诺图来实现触发器之间变换的方法,并把它用于JK触发器向其他类型触发器的转换。
5)  cyclic topology
有环图
1.
For the exist content-based Publish/Subscribe(P/S) systems,general peer-to-peer topology can not support subscription covering,on the base of absorbing their design ideas,with reverse path forwarding technique and dynamic receiver update and partition strategy,a new route algorithm for content-based P/S system which supports general cyclic topology and subscription covering is proposed.
针对现有内容发布/订阅系统事件路由算法不支持有环图下订阅覆盖的问题,采用目的地动态更新与划分、逆向最短路径转发等策略,提出一种有环图下支持订阅覆盖的路由算法。
6)  directed cycling graph
有向有环图
1.
In order to improve the efficiency of the algorithm for generating directed cutsets of directed cycling graph, directed cycling graph is converted to directed acyclic graph with contracted vertices by contracting edge of rings in directed cycling graph, and the algorithm for generating directed cutsets of directed acyclic graph is made to generate directed cutsets of directed cycling graph.
为了提高有向有环图有向割集生成算法的效率,通过收缩有向有环图环路中的边将有向有环图转换成带收缩顶点的有向无环图,并使得生成有向无环图有向割集的算法可以生成有向有环图的有向割集。
补充资料:图的减缩图(或称图子式)


图的减缩图(或称图子式)
minor of a graph

图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G,,GZ,…,则存在指标i
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条