In order to solve this problem , we present a new method in this paper through using the bezier curve as the axial deformation control curve to generate variety trunks and branches 在生成树的过程中,利用bezier曲线作为顶点控制曲线,采用轴变形方法生成形态各异、效果逼真的树干和分枝。
These lemmas together with spanning tree protocol and local address forwarding information for transparent bridges are taken to fulfil physical topology discovery in subnet finely 以引理为基础，利用生成树协议和地址转发表，解决了对于网内物理拓扑的正确发现，更细致地显示整个网络拓扑。
Once i understood what the code in question was attempting to do , i could then relate the error to the code generation model tree and isolate the model component where the generation was going awry 一旦理解了有问题的代码想做什么，就可以把错误与代码生成树联系起来，并分离出生成出错的模型组件。
The nmst is taken as prediction tree and is used to remove the correlation of hyperspectral image . compared with the mst algorithm , the construction speed of nmst is improved more than ten times 近最小生成树算法与最小生成树算法相比，预测树的构造速度提高一个数量级以上，而压缩比降低了不到5 。
The result of the test indicates that this algorithm reduces the height of the spanning tree of information dispensing , so that reduces the time of information dispensing and improves the performance of the system 测试结果表明,该算法减少了信息分发生成树的高度,从而进一步减少了信息分发的时间,提高了系统的性能。
At first , various existing dynamic multicast routing algorithms with no constraint is compared . a dynamic multicast algorithm dpg ( dynamic prim - based greedy multicast algorithm ) which is based on minimum span tree is presented 在比较了典型的动态无约束费用优化多播路由算法后，提出了基于最小生成树的动态贪婪算法? ?一dpg算法。
If the reasonable multicast tree can be constructed , we can consume least network resources and achieve our task . this paper stepwisily gives a comprehensive study to multicast tree problem on the base of graph theory 本篇论文在现代图论研究的基础上，由简单到复杂，逐步深入，对多播生成树问题尽可能的作出一个整体的，全面的探索和研究。
Redundant power supplies , hot - swappable modules and spanning tree protocol ( stp ) support are all mandatory elements of a backbone switch , as is support for emerging switch technologies , including virtual lans 具有冗余能力的电源、可热插拔的模块和对生成树协议（ stp ）的支持都是基干交换机必备的成分，实际上它支持新出现的交换技术，如虚拟局域网。
To control the process of adding all the methods and classes described in the last section , the jibx binding compiler first creates an internal representation of each binding in the form of a code generation tree structure 为了控制上一节中描述的所有方法和类的添加过程， jibx绑定编译器首先用代码生成树结构的形式，创建了每个绑定的内部表示形式。
This algorithm begins with yielding a least - cost spanning tree . then check every path from source to destination . if one path beyond the maximum delay , replace it with least - delay path in order to satisfying the delay bounded 该算法在构造满足时延约束的组播树过程中,先构造最小生成树作为初始树,然后以时延最小路径代替树中的时延越界路径,直至树的根节点到所有目的节点的路径满足时延要求。
