结点

基本解释 (translations)

crunode

与结点相关的网络例句 [注：此内容来源于网络，仅供参考]

Three intersection functions,such as adjacent node set,node-arc angle set and connected node set,were presented,and based on the shortest path method proposed by Dijkstra,a road guide sign model was built by using the intersection functions.

结合路网的拓扑结构，定义了用于确定指路标志的状态函数集，给出了3个描述路网拓扑特征的交叉口函数：邻近结点集、结点-弧段夹角集和连通结点集，基于Dijkstra最短路径的思想，运用交叉口函数建立了城镇指路标志的标识模型：以待标识城镇为中心，在城镇的影响区域内，通过向外搜索交叉口邻近结点集来确定指路标志的设置，并使每个结点上标识的路径都是最优的。

The "Prufer" code of such a tree is built as follows: the leaf (a vertex that is incident to only one edge) with the minimal number is taken. This leaf, together with its incident edge is removed from the graph, while the number of the vertex that was adjacent to the leaf is written down.

从题目描述我们可以知道，对于一棵树，每次都找到编号最小的叶子结点，然后输出它的双亲结点的编号作为 Prufer Code，同时删除这个最小的叶子结点为下一次输出 Prufer Code 做准备。

We posed the concept of sufficient intersection about s(1≤s≤n) algebraic hypersurfaces in n-dimensional space and proved the dimension of polynomial space Pm(which denotes the space of all multivariate polynomials of total degree≤m) on the algebraic manifold S=s(f1,…, fs) where f1(X=0,…, f s=0denote s algebraic hypersurfaces of sufficient intersection, then gave a convenient expression for dimension calculation by using the backw ard difference operator.

给出了n维空间中s(1≤s≤n)个代数超曲面充分相交的概念，证明了n元m次多项式空间Pm在充分相交的代数流形S=s(f1，…， fs)（f1=0，…， fs=0表示s个代数超曲面）上的维数，并利用倒差分算子给出一个方便计算的表达式；构造了沿代数流形上插值适定结点组的叠加插值法；证明了在充分相交的代数流形上任意次插值适定结点组的存在性；给出代数流形上插值适定结点组的性质和判定条件。

With the development of modern logistics, the speed of constructing logistics node has become more and more fast. So how to evalue the ecomomic and social benefit of the logistics node construction project canonically and scientifically and to provide scientific data has become a outstanding problem.

随着我国物流业的发展，物流结点基础设施建设速度不断加快，如何对物流结点的建设进行规范、科学的经济评价和社会效益评价，为物流结点建设的可行性研究提供科学依据，成为我国物流行业目前急需解决的问题。

The FE model of the composite crunode was built through the FE program ANSYS,then the bearing capacity of the crunode was analyzed under the condition of unfavorable loading,and the parametric analysis was conducted.

通过有限元通用程序ANSYS建立该结点的有限元模型，研究在最不利荷载情况下的结点受力性能及结点参数对受力性能的影响，并进行了结点模型试验。

Packet Radio NetworkIn the network of Ad Hoc, the crunode has a report text to turn hair ability, the correspondence of crunode may pass by to have another an inside a turn of crunode hair, then has been much jump, this be the network of Ad Hoc with other move network of most basically distinct.

在Ad Hoc网络中，结点具有报文转发能力，结点间的通信可能要经过多个中间结点的转发，即经过多跳，这是Ad Hoc网络与其他移动网络的最根本区别。

This classification of the results generated by the composition of a tree, the node representing different scale clustering of categories, the father node category expressed by the son represented by the node class from leveraging on the latest advances.

这一分类方式所产生的结果构成一树形图，结点代表不同尺度聚类的类，父亲结点所表示的类由儿子结点所代表的类溶合而成。

In order to acquire the spatial stress distribution of the pier-beam fixed joint , a pier-beam fixed joint finite element space model is established and analyzed in different loading cases.

为掌握石板坡大桥墩梁固结点的三维应力状态，建立了墩梁固结点结构分析的空间有限元模型，根据施工过程中及成桥后的工况，分别进行了空间有限元计算，得到了墩梁固结点在三种工况下的应力分布情况，检验了设计的安全性与合理性，提出了改善墩梁固结点应力的措施和方法，为设计和施工提供了科学的依据。

This paper presents a self-adaptive load balancing algorithm, in which each peer creates a local load distribution view using a passive load statistic method and a local file requested view using file requested statistic method. When load imbalance exists in the system, the heavy loaded peer will make the logical links which point to itself to point to a light loaded peer in its local load distribution view, with the indegree of the heavy loaded peer decreasing and the indegree of the light loaded peer increasing, the load imbalance magnitude will decrease. When the request load of the heavy loaded peer is high, the peer will use its local file request view to get the popular file and cache the file to corresponding target peer.

提出一种自适应负载均衡方法，方法采用一种被动式结点负载统计方法生成局部负载视图；采用一种文件访问统计方法生成局部文件访问视图；当系统内结点负载存在差异，重载结点把指向自身的逻辑链路迁移至指向局部负载视图中的轻载结点，通过减小重载结点入度和增加轻载结点入度来减小结点间负载差异；当结点的请求负载较高时，通过局部文件访问视图计算需要缓存的热点文件及目标结点，降低承载热点文件的结点的请求负载。

A two-tier overlay network model is presented in this paper. Some consecutive nodes form an unstructured group and different groups are connected by a globally structured overlay with the Chord protocol. The model uses the Hilbert-based level search and the dynamic load balancing policy of a two-tier ring structure on top of the overlay network.This strategy has not only the characteristics of load balancing but also enough flexibility for searching.

Chord模型可以保证搜索系统中特定数据对象的跳跃次数在O的范围内，但只能根据数据对象的键进行准确匹配查询，不支持多关键字、部分关键字、通配符或是参数取值区间组成的复杂查询[1]；其次，相容散列的理论证明了当系统中有N个结点和K个键值的情况下，在每个结点上运行O个虚拟结点时，每个结点的键值范围可以无限趋于K/N。

与结点相关的网络解释 [注：此内容来源于网络，仅供参考]

AND node：与"结点

ANBFM ANAlogTRANslator 模拟转换器,模拟翻译机 | AND node "与"结点 | AND-OR extender 与或扩展器

antinode：反结点

antimodule 反模 | antinode 反结点 | antinomy 二律背反

censor contact：监护结点

cementing 水泥粘合 | censor contact 监护结点 | center 中心

binodal cyclide：双结点四次圆纹曲面

binoculartelescope | 双目望远镜,双筒望远镜 | binodal cyclide | 双结点四次圆纹曲面 | binodal solubility curve | 双结点溶解度曲线

interstitial atom：结点间原子

interstice 间隙 | interstitial atom 结点间原子 | interstitial compound 结点间化物

nodal point：节点;结点

nodal plane 节面 | nodal point 节点;结点 | nodal selection 结点选择

node locus：结点轨迹

node 节点 | node locus 结点轨迹 | node of a curve 曲线的结点

node of a curve：曲线的结点

node locus 结点轨迹 | node of a curve 曲线的结点 | noetherian category 诺特范畴

binodal quartic：双结点四次线

双结点四次圆纹曲面 binodal cyclide | 双结点四次线 binodal quartic | 双结[点] binode

UNSPLIT：通过删除结点合并具有假结点的弧段

SPLIT 给选定弧段增加一个结点 | UNSPLIT 通过删除结点合并具有假结点的弧段 | VERTEX 进行顶点的编辑