These pattern matching algorithms seek to identify aggregated data structures (grouped together by similarity of ownership structure) that are growing the most in between the memory dumps.
这些模式匹配算法可以寻找并标识在内存转储之间增长最快的聚合数据结构(按照类似的所属权结构组合在一起)。
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.
正则表达式提供了跨文本的字符串的更丰富的模式匹配，但在遍历诸如xml树这样的数据结构时，它和XPath一样易于使用。
Water depth data (main parameters), which was matching to model's grid structure, was obtained by using the function of GIS digital elevation model (DEM) to linear-interpolate the isobath of chart.
在模型参数求取中应用了GIS的数字高程模型(DEM)功能将海图等深线通过线性内插得到与模型网格相匹配的具有栅格结构的水深数据(模型的主要参数)。
Different methods for generating pyramid data structure have been analysed, these effects in image matching are compared, also a fast algorithm of pyramid data struct is provided.
分析了多种金字塔数据结构的生成方法，比较了不同方法在影像匹配中的优劣，并提出了一种影像金字塔生成的快速算法。
The result of this method is content to contour line matching by building variant feature quality, constructing data structure, dealing with matching process's detail.
该方法通过提取曲线的相对不变特征量，构建数据结构，细致地处理匹配过程的细节，对轮廓曲线的部分匹配有着较为满意的匹配效果。
Experiments on chunking recognition and Part-of-Speech tagging are conducted to show that the new data structure greatly speeds up the feature matching process while keeping the same space complexity.
基本短语识别和词性标注的实验显示，这种新的数据结构的确能够极大地加快最大熵方法执行系统的速度，同时保持空间复杂度不变。
Despite their simple data structure, many complicated problems can be solved in linear time with suffix trees. So they are intensively employed in pattern matching on string and trees.
它的结构简单，但可以在线性的时间里解决许多复杂的问题，被大量的使用在字符串及树的模式匹配中。
The essay proposed, in the following section, a pattern-matching system based on these PMEs, and introduced the system architecture, bus structure, data interface, and etc.
在此基础上，本文给出了以上述引擎为核心的模式匹配系统，介绍了系统框架、总线结构和数据接口等内容。
This paper introduces system structure, function and the major part of the subsystem design and implementation, and talks about the data collection, storage and matching algorithms in detail.
本文介绍了该系统的系统结构、各子系统功能及各主要部分的设计与实现，并对数据采集、存储与选配算法及上下位机通信进行了详细介绍。
Chained data structure keep hit-set by its L-length. it does not need to create ancestor nodes, so it can reduce the saving of none hit-set and the room of matching the patterns.
层状链式图是根据模式的L长度分层存储命中模式，它不需要按照直接可达祖先思想创建路径的节点，因此减少了非命中模式节点的存储。
Chained data structure keep hit-set by its L-length. it does not need to create ancestor nodes, so it can reduce the saving of none hit-set and the room of matching the patterns.
层状链式图是根据模式的L长度分层存储命中模式，它不需要按照直接可达祖先思想创建路径的节点，因此减少了非命中模式节点的存储。
应用推荐