The incremental algorithm use a tree structure to organize the set of concept nodes, and decrease the time needed to build concept lattice.
本文的渐进式算法利用一种树状结构来对概念格节点进行索引，从而有效地提高了概念格的构造速度。
According to the distance between concept nodes in a concept lattice and the product hierarchies, we can get product-oriented query expansions.
考虑概念格中的不同“概念结点”的距离，获取查询扩展词汇，并结合产品层次，就给出了基于概念格的产品优先的查询扩展。
In Version 6, the concept of node groups is introduced to assist with distinguishing between nodes of different capabilities.
在版本6中，引进了节点组的概念，用来帮助区分具备不同能力的节点。
Even though this is a cluster concept, it should be implemented on all nodes: standalone, virtualized, or clustered.
尽管这是一个集群概念，但是应该在所有节点上实现它：单独的节点、虚拟化节点和集群节点。
LDAP USES the concept of a distinguished name (DN) to identify the particular nodes in an LDAP tree.
LDAP使用专有名称(DN)的概念来识别ldap树上特定的节点。
The basic Graphviz language syntax focuses on the concept of nodes and edges.
基本的Graphviz语言语法主要关注节点和边的概念。
DOM programmers are already familiar with the concept of nodes, which is integral to understanding XPath expressions and the values returned from those expressions.
DOM程序员已经熟悉了节点的概念，这是理解XPath表达式和这些表达式的返回值不可或缺的。
XPath 2.0 introduces the concept of a sequence, which is an ordered list of zero or more values - nodes, integers, strings, and so on.
XPath 2.0引入了序列的概念，序列是一种有序列表，可以包含零个或多个值—节点、整数、字符串等等。
Using that concept, you can also store Pointers to list nodes in your node, allowing you to have lists as the data for a list node. Here's how it might look.
同理，您也可以在节点中存储指向列表节点的指针，这样就可以将列表作为列表节点的数据。
Using the concept of correlation degree between nodes we build a local world of each node in the network, and the size of the local-world increases with time.
应用节点间相关度的概念来确定每一新加入节点的局域世界，并定义局域世界的规模是动态增加的。
We presented the conception of change rate of nodes architecture, according to the theory of concept similarity.
结构变更分析中借鉴概念图相似度的思想，提出了节点结构变更率的概念。
It is proved that immediate predecessor of all new nodes is only one of a node or successors in old concept lattice.
证明了所有新节点在原概念格中的直接父节点，只可能在某个节点和它的子节点中。
This paper introduces the concept of "partition node" to describe the topologically-critical nodes, whose failure may potentially lead to overlay partitioning.
提出了分点概念来描述对等网络的拓扑关键点，这些结点的失效很可能导致覆盖网的分割。
Advantage of the algorithm is that scope of generating new nodes is small, and concept lattice is quickly constructed.
此算法的优点是生成新节点的范围小，构建概念格的速度快。
Frequent weighted concept lattice is a kind of special weighted concept lattice, whose nodes are all frequent, namely, each satisfies the threshold given by the users.
频繁加权概念格是一种特殊的加权概念格，其所有结点都是频繁结点，即满足用户阈值的结点。
Based on the concept of virtual backbone networks, this paper researches the problem of selecting nodes of virtual backbone networks, which is named Key node in this paper, in Sensor networks.
基于虚拟骨干网的概念，研究传感器网络中虚拟骨干网的节点即关键点的选取问题。
In order to tackle with the problems coming up with the structural adjustment of industry chain, this paper proposes a concept of industry chain nodes and describes the enterprise process.
针对产业链进行结构性调整时所产生的问题，给出产业链节点概念并对企业业务流程进行描述。
To solve these questions, this thesis lead into the concept of Leisure Degree and Link Expiration Time of the nodes, and take the weight of both as the condition for path choosing.
针对以上问题，本文引入节点的空闲度和连接时间的概念，并将二者的加权和作为路径选择的依据。
These tiny sensor nodes consist of sensors, data processing components and communications components, and the sensor nodes achieve the concept of wireless sensor network.
传感器采集到的信息能够通过多跳的方式在传感器节点之间传输，从而构成无线传感器网络。
The concept of the extended resection is to excise the local lesion enough and dissect lymph nodes and kill completely cells from the tumor.
根治切除术的现代概念是充分切除患癌脏器，彻底清除区域淋巴结，完全杀灭腹腔脱落癌细胞。
A recognition method of celestial spectra outliers based on concept lattice is proposed by regarding the intension of the concept lattice nodes as characteristic subspace of the celestial spectra.
在宇宙中，寻求特殊的、未知的天体是人类探索宇宙奥妙所追求的目标之一，天体光谱离群数据识别方法是实现该目标的有效手段之一。
To make the exiting routing algorithms tolerate concave fault regions without disabling any healthy nodes, the concept of "Hole" is proposed in this paper.
“洞”的提出是为了弥补现有容错路由算法无法容忍凹型故障区域的不足。
Based on the concept of Local map, the algorithm tries to update as few nodes as possible to reduce cost.
算法使用了局部图的思想，使每次迭代更新尽量少的节点来减少代价。实验证明算法具有良好的效率、近似度和可伸缩性。
Based on the concept of Local map, the algorithm tries to update as few nodes as possible to reduce cost.
算法使用了局部图的思想，使每次迭代更新尽量少的节点来减少代价。实验证明算法具有良好的效率、近似度和可伸缩性。
应用推荐