改进了传统的树匹配和动态规划算法。
Improved on the traditional tree matching with dynamic programming algorithm.
实现了XML的树匹配构件匹配检索算法。
This paper implemented the tree matching, component matching and retrieval algorithm.
传统的聚合组播包括三个主要步骤，分别是候选树生成，树选择和组树匹配。
The traditional Aggregated Multicast was divided the problem into three sub-problems, namely, candidate tree generation, tree selection and group-to-tree mapping.
该文分析了一种解决组播状态问题的方法——聚集组播和聚集组播的组-树匹配算法。
A method of resolving the scalability problem — aggregated multicast and the group-tree matching algorithm are analyzed.
提出了基于无序标签树匹配和结构图搜索的组件检索与匹配策略，并实现了一个组件库管理系统模型。
A kind of component matching model based on the unordered label tree-inclusion matching and Struct Graph (S-Graph) searching model is proposed. A components management system model is also realized.
本文围绕查全率和查准率的效率问题，引入树匹配思想，对基于XML的元数据检索进行了深入的研究。
This thesis aims at the efficiency problem of accuracy and recall rate in XML retrieval. Based on tree matching, the thesis makes a further study on the XML retrieval technology about metadata.
构造骨架树邻接矩阵并给出拓扑标记向量的定义，用拓扑标记向量之差的二范数作为两个骨架树匹配节点对的距离；
Construct the skeleton tree′s adjacency matrix, then define a Topology Signature Vector and compute the distance of matching node pair by the difference of the TSV.
本文从构件的刻面分类模式出发，针对构件检索的特点，结合树匹配模型思想，在构件树路径匹配算法的基础上提出一种改进算法。
This paper give an improved algorithm which based on path containment matching algorithm and combined with the features of faceted classification scheme and the theory of tree matching.
对于匹配TOPIC对象的主题字符串，以及主题树中该主题字符串之下、没有定义与之匹配的TOPIC对象的各个主题，此TOPIC对象为它们提供默认设置。
The topic object provides default Settings for the topic string that matches it, as well as topics under it in the topic tree that do not have a topic object defined to match them.
这将得到多个新的值元素，这些元素具有匹配名称，并附加到给定的树位置。
This will result in multiple new value elements, with matching names, being appended at a given tree location.
TOPIC对象和匹配它们的RACF配置文件保护主题树。
Topic objects and the RACF profiles that match them secure topic trees.
文档树中匹配一个选择符的元素称为那个选择符的主题。
The elements of the document tree that match a selector are called subjects of the selector.
没有循环依赖，二进制文件，库，文档，构建，第三方的代码都组织进合适的文件夹内。源码树的物理布局与逻辑层次、组织方式相匹配。
No circular dependencies, binaries, libs, docs, builds, third-party code all organized into appropriate folders Physical layout of source tree matches logical hierarchy and organization.
尽管XPath提供了一种紧凑和优雅的方式来遍历xml树，但其模式匹配函数的能力相当有限。
While XPath provides a compact and elegant way of traversing an XML tree, its pattern matching functions have a rather limited capability.
如下的规则匹配文档树中所有的H1元素
The following rule matches all H1 elements in the document tree
正则表达式提供了跨文本的字符串的更丰富的模式匹配，但在遍历诸如xml树这样的数据结构时，它和XPath一样易于使用。
Regular expressions provide much richer pattern matching across strings of text, but are as easy to use as XPath when traversing a data structure such as an XML tree.
Dojo小部件接受网格和树格式的数据，但是它们按不能这种格式使用，因为Wink框架生成的输出不能匹配 Dojo标准。
The Dojo widgets accept data in the grid and tree formats, but they cannot be used as is because the output produced from the Wink framework does not match the Dojo standard.
基本上，RCC是一种绑定机制，把非svg的XML元素匹配到svg树中。
Basically, RCC is a binding mechanism that matches a non-SVG XML element to an SVG tree.
您可以轻松集成模式匹配库与树访问者，使访问者能够利用树模型。
It is not hard to integrate a pattern-matching library with the tree visitor to get to a point where visitors can leverage tree patterns.
实际上，将IntBetween3And 17作为int的一个子类型是很有意义的，至少从表面上是如此，而不管继承树是否与此匹配。
In fact, it makes sense to call IntBetween3And17 a subtype of int, at least informally, whether or not the inheritance tree matches that.
本文采用松驰迭代与约束树搜索相结合的策略，获取优化的匹配结果。
The strategy which combines relaxation and constrained tree-searching is employed to obtain the optimal matching result.
它较好地匹配了树的复杂性和训练样本量及错分率界。
It well matches the tree complexity to the training data and the misclassification rate bound.
我们将首先利用FilterPushdown模式来匹配图中的某个模式，随后在匹配的点对树进行修改。
Using the Filter Pushdown pattern, we would first match a pattern in the graph, then modify the tree at the point of the match. Here's the Filter Pushdown pattern to match.
Transformer搜索树中的匹配项，在该点更改树，并返回该点。
Transformer searches for a match in the tree, mutates the tree at that point, and returns it.
Environment树中元素的名称与SOAPwebreply 的信封的主体中的名称匹配。
The names of the elements in the Environment tree match the names in the Body of the Envelope of the SOAP webreply.
这种表示比传统分析树不仅空间较小，而且进行结构匹配的速度快。
Compared with the conventional parse tree, this representation not only consumes less space, but also is faster for structure matching.
提出了基于四叉树分形编码的水印算法，通过在不同寻找区域中搜索最佳匹配定义域块来嵌入水印。
This paper proposes a watermarking algorithm based on quadtree fractal coding, which is to search for the optimized matched domain blocks in different regions and to embed the watermarking.
根据观测星图和导航星所具有的特性- - -星对角距和连通性，构造了最大连通匹配树识别算法。
Construct maximum connection match tree identification algorithm with respect to the characters of observed star map and guide stars -star diagonal distance and connection.
在分析了后缀树和后缀数组字符串匹配算法的基础上，详细阐述了基于后缀数组的精确串联重复序列识别方法。
It addresses the method of identifying the accurate tandem repeat in detail after analyzing suffix tree and suffix array algorithms of string matching.
这种方法比树模式匹配方法更容易实现，并适用于支持并行指令的其他DSP处理器。
This method is easier than tree pattern matching, and can be used in other DSP processors supporting parallel instructions.
应用推荐