The generation algorithm of adaptive mesh which is based on the quad-tree data structure is presented.
以四分树为数据结构，建立了网格细分法生成自适应网格算法。
Obviously, it is more convenient to build and maintain the knowledge base compared with the tree data structure.
采用以上方法建造的知识库更为简洁，维护也更为方便。
The unique properties of quad tree data structure and divided pyramid image into partitions by using quad tree methods;
四叉树数据结构的特性与其邻域寻找算法，并将多分辨率影像数据按照四叉树结构进行分块处理；
The thesis sets up binary tree data structure of train route, and research train route automatic arrangement search arithmetic.
本文建立了列车进路的二叉树数据结构，并对列车进路自动排定搜索算法进行了研究探讨。
Each node represents one DEM data block. According this separation, by quad-tree data structure can get global different resolution DEM data storage architecture.
每个结点表示一个DEM数据分块，根据如此剖分，由这棵四叉树结构就得到全球范围不同分辨率的DEM数据存储结构。
A new unstructured Cartesian cutted grid generation method is introduced. The grid generation of some airfoils and wing is performed with the tree data structure.
描述了一种新的网格生成技术，即笛卡尔非结构切割网格技术，采用叉树数据结构，完成了几种单段和多段翼型以及三维机翼的网格生成。
The itemset lattice tree data structure was adopted to translate maximal frequent itemsets mining into the process of depth-first searching the itemset lattice tree.
采用项集格生成树的数据结构，将最大频繁项集挖掘过程转化为对项集格生成树进行深度优先搜索获取所有最大频繁节点的过程。
The design USES hierarchical design method, with the use of chain and tree data structure to achieve the FAT file system. It has well maintainability and portability.
本设计采用层次化设计，运用链表与树形数据结构实现FAT文件系统，具有较高的可维护性与可移植性。
A vertex tree is built to represent the data structure of the models by octonary subdivision.
以八叉剖分来建立一棵顶点树，用以表示整个网格模型的数据结构。
When considering a tree of nodes where each node is an immutable data structure, we must consider how to modify a node or nodes inside the tree without modifying the entire tree.
在考虑每个节点都是一个不可变数据结构的节点树时，我们必须考虑如何修改树内的一个节点或多个节点，而不必更改整个树。
So to construct a nonblocking linked list, tree, or hash table, we need to find a way to update multiple Pointers with CAS without leaving the data structure in an inconsistent state.
所以，要构建一个非阻塞的链表、树或哈希表，需要找到一种方式，可以用CAS更新多个指针，同时不会让数据结构处于不一致的状态。
The tree structure provides a view of the data that is more flexible than a simple database format.
与简单的数据库格式相比，树型结构提供了更加灵活的数据视图。
The Visitor pattern is often used to separate a data structure (the tree, in this case) from the algorithms that operate over the data structure.
访问者模式往往用于将数据结构(本例中是树)与通过数据结构操作的算法分离开来。
The left hand pane shows a tree structure that depicts how the data is hierarchically placed in the document.
左边的窗格显示了树形的层级结构，它描述了数据在文档中是如何以层级结构安排的。
Before we consider the question of tree manipulation, let's consider the data structure we'll use to define each node of the tree.
在考虑树操作问题之前，让我们来看看将用于定义树的各个节点的数据结构。
Represented as an ordinal number followed by either a single .0 or a set of ordinal numbers separated by dots, the node data type corresponds to a position in a tree structure.
节点数据类型用一个序数加一个 .0或一组以点号隔开的序数来表示，它对应于一个树结构中的一个位置。
Before it can be processed and transformed by the message flow, it must be converted into a logical message tree, which is a broker data structure that reflects the logical structure of the message.
在消息流能够处理和转换它之前，必须将其转换为逻辑消息树，这是反映消息逻辑结构的代理数据结构。
The data structure used is a red-black tree, which is ideal for performance-focused applications (and happens to be available generically as a library within the kernel).
这个数据结构是一个“红-黑”树，对于注重性能的应用程序很理想(且恰好作为内核中的一个库普遍可用)。
A graph as a data model was chosen for SOAP Section 5 encoding because a tree structure is often too restrictive for doing RPC and the encoding was designed to facilitate RPC.
SOAPSeciton5编码中选择图作为一种数据模型是因为，对于进行RPC而言，树结构常常限制过多，而编码本来就是为了方便rpc而设计的。
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一样易于使用。
You can look through the source code for the file rxp.c to see the way that RXP parsing generates a compact document tree as a data structure.
可以分析rxp . c文件的源代码，以了解rxp解析生成紧凑文档树作为数据结构的方法。
The Data Object Graph is the hierarchical structure of data. It contains a tree of Data Objects and another structure called the Change Summary (see Figure 4).
数据对象图是一个描述数据的分层结构，它包括一个数据对象树和另一个称作更改摘要 (Change Summary) 的结构（请参阅图 4）。
All collected data is sorted into a logical tree structure, a structure that the author of the BTrace scripts decides upon.
所有收集到的数据排序成一种逻辑树结构，其结构由BTrace脚本作者指定。
CrocTail is an easy to navigate and well-formed usage of the data from this API. It has a complete company profile, a map of all subsidiaries, and a tree of the complete corporate structure.
CrocTail方便浏览，对数据的使用合理，拥有完整的公司资料、分支公司图，以及详尽的公司结构树。
Data binding converts these XML trees to and from trees of objects (or sometimes graphs of objects, with links up or across the tree structure).
数据绑定使xml树和对象树(或者有时候是对象图，带有向上或跨整个树结构的链接)相互转换。
A DataGraph object represents data in a tree-like structure, with a root object at the top of the tree and children under it, similar to the structure that you might find in an XML document.
DataGraph对象以类似于树的形式表示数据，树的顶部是根对象，其下面为各个子项，与您在XML文档中看到的结构类似。
It also provides a flexible, tree-like structure to accommodate the need for various kinds of structured locale data.
它还提供了一种灵活的类树结构来满足各种结构化的语言环境数据的要求。
Extensible markup language (XML), described as both a markup language and a text-based data storage format, offers a text-based means to apply and describe a tree-based structure to information.
可扩展标记语言(XML)不仅仅是一种标记语言，还是一种基于文本的数据存储格式，提供了应用和描述信息的树状结构的一种基于文本的方法。
Extensible markup language (XML), described as both a markup language and a text-based data storage format, offers a text-based means to apply and describe a tree-based structure to information.
可扩展标记语言(XML)不仅仅是一种标记语言，还是一种基于文本的数据存储格式，提供了应用和描述信息的树状结构的一种基于文本的方法。
应用推荐