考虑概念格中的不同“概念结点”的距离，获取查询扩展词汇，并结合产品层次，就给出了基于概念格的产品优先的查询扩展。
According to the distance between concept nodes in a concept lattice and the product hierarchies, we can get product-oriented query expansions.
试图提出广义结点概念，并给出图的一种表示方法。
This article intended to introduce the idea of generalized node point, and to give an expressive method of graph.
频繁加权概念格是一种特殊的加权概念格，其所有结点都是频繁结点，即满足用户阈值的结点。
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.
提出了分点概念来描述对等网络的拓扑关键点，这些结点的失效很可能导致覆盖网的分割。
This paper introduces the concept of "partition node" to describe the topologically-critical nodes, whose failure may potentially lead to overlay partitioning.
本文就结点阻抗矩阵的概念以及形成方法进行一次探讨。
This paper describes the fundamental concept of node impedance matrix and different methods to formate them.
运用交通网络保留容量的概念，引入交通网络容量可靠性，分析比较了基于路段容量的网络可靠性和基于结点容量的网络可靠性。
A reliability measure of network capacity under node capacities has been introduced, using the concept of network reserve capacity, and compared with that based on link capacities.
为了研究交换超立方体网络容错路由问题，引入了相邻结点集合类的概念，提出了相邻结点集的求解公式。
In order to deal with the problem of fault tolerant routing on exchanged hypercube, the concept of the neighbor sets of present node is defined.
为了研究交换超立方体网络容错路由问题，引入了相邻结点集合类的概念，提出了相邻结点集的求解公式。
In order to deal with the problem of fault tolerant routing on exchanged hypercube, the concept of the neighbor sets of present node is defined.
应用推荐