1) extension constraint graph
可拓约束图
1.
A Rhombus Solving Strategy(RSS) based on EKR was discussed in detail,including creation of the extension constraint graph,extended inference of matter-element,calculation of relevant functions,and generation of extension set.
详细论述了基于可拓知识表示的菱形求解策略,包括可拓约束图的构建、物元拓展推理、关联函数计算和条件可拓集合的生成;开发了基于可拓知识表示及菱形求解策略的知识库系统。
2) Constraint Topology Graph
约束拓扑图
1.
TCTG(Tolerance Constraint Topology Graph)is represented intuitively,clearly and parameterly,and it is essential to tolerance solid model represented with B rep and CSG.
其公差约束拓扑图（ＴｏｌｅｒａｎｃｅＣｏｎｓｔｒａｉｎｔＴｏｐｏｌｏｇｙＧｒａｐｈ）逻辑推理简单方便，表示直观、清楚，且实现了参数化表示。
3) topological constraint
拓扑约束
1.
In this paper, the graph data model is introduced to represent the topological relation of pipeline network with respect to the complexity of pipeline network data, and the topological constraint condition is used to check the topological relation in order to keep the data correct.
针对管网数据的复杂性,提出利用图数据模型描述管网拓扑关系,并使用拓扑约束方法对管网数据一致性进行检测,以确保数据的正确性。
2.
The method solves respectively each problem as cthesified by the Seometric constraint and topological constraint.
该法根据各个图形元素间的几何约束和拓扑约束进行分类求解，采用逐点深入的方法对图形进行参数化处理，每实现一个尺寸的变化，整个图形都作相应的修改。
3.
Authors find some distance or angle constraints by analyzing the graph of topological constraints and then put them into geometric constraints.
先通过分析拓扑约束图,找到距离和角度约束,并将这些约束加入到其相应的几何约束中,然后通过分解找到子问题的临界参数值,再求解每个并列的参数区间内部的一个具体的实例,精确的参数范围就能够被确定。
4) topological constraints
拓扑约束
1.
Study of topological constraints solving for families of objects;
对象族拓扑约束求解的研究
5) constrain downward
约束延拓
6) Variable constraint
可变约束
1.
An improved MOE blind multi-user detection algorithm based on RLS is proposed in order to overcome the shortcomings that the direct eigenvalue decomposition must be used and the quadratic constraint is not fulfilled in the traditional variable constraint MOE blind multi-user detection algorithm.
针对传统的关于可变约束MOE盲多用户检测算法需直接进行特征值分解计算和不能实现二次约束限制的缺点,提出了一种基于RLS的改进型MOE盲多用户检测算法。
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
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
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条