The article investigates some properties of square root of T3 tree’s nodes. It first proves several inequalities that are helpful to estimate the square root of a node, and then proves several theorems to describe th...The article investigates some properties of square root of T3 tree’s nodes. It first proves several inequalities that are helpful to estimate the square root of a node, and then proves several theorems to describe the distribution of the square root of the nodes on T3 tree.展开更多
This paper studies and analyses the character of the tree structure,and then presents an algorithm which is concise and convinent for the construction of tree structure.It is especially fit for the application system ...This paper studies and analyses the character of the tree structure,and then presents an algorithm which is concise and convinent for the construction of tree structure.It is especially fit for the application system using database.The special storege organization needn’t to be established in the database using this algorithm.By SQL statement,the data dispersed in different storeage organization can be dynamically combined into the data set including two fields:father node field and child node field.Then the algorithm can process those data and display the tree structure rapidly. At last,we design a control called TFDTreeView which inherits from TTreeView control using this algorithm. TFDTreeView control provide a interface function,through which we can construct the tree structure convinently. On some occasions,this method will be good for the application system.And ,by building the control ,we can reuse it in many system development.展开更多
针对基本的快速搜索随机树(rapidly-exploring random tree,RRT)算法用于路径规划时存在的树扩展无导向性、密集障碍物区域规划效率低、局部区域节点聚集等问题,提出一种新的RRT改进算法。该算法采用增强的目标偏向策略,并引入可变的权...针对基本的快速搜索随机树(rapidly-exploring random tree,RRT)算法用于路径规划时存在的树扩展无导向性、密集障碍物区域规划效率低、局部区域节点聚集等问题,提出一种新的RRT改进算法。该算法采用增强的目标偏向策略,并引入可变的权值系数,提高随机树扩展的导向性和灵活性;同时采用局部节点过滤机制,过滤局部区域内聚集的节点;最后,使用节点直连策略对初始路径进行优化处理。仿真实验的结果表明,改进的RRT算法规划路径的速度更快且生成的路径质量更高,充分证明了改进算法的有效可行性。展开更多
网络切片技术旨在共享的物理网络上创建出多个满足不同业务场景的虚拟网络,基于MCTS(Monte Carlo Tree Search)的切片部署方法在接受率等多种指标上均优于传统的启发式算法。针对基于MCTS的切片部署方法在大规模网络上存在的收敛时间过...网络切片技术旨在共享的物理网络上创建出多个满足不同业务场景的虚拟网络,基于MCTS(Monte Carlo Tree Search)的切片部署方法在接受率等多种指标上均优于传统的启发式算法。针对基于MCTS的切片部署方法在大规模网络上存在的收敛时间过长的问题,论文提出利用通过限制两跳之间的路径长度、并使用节点重要性排序结果作为先验知识对搜索树进行剪枝解决问题。进一步,论文使用广义网络温度GNT(Generalized Network Temperature)对MCTS的搜索目标进行改进。实验结果表明,论文提出的方法有效减缓了因为虚拟网络部署导致的底层网络资源碎片化问题。展开更多
文摘The article investigates some properties of square root of T3 tree’s nodes. It first proves several inequalities that are helpful to estimate the square root of a node, and then proves several theorems to describe the distribution of the square root of the nodes on T3 tree.
文摘This paper studies and analyses the character of the tree structure,and then presents an algorithm which is concise and convinent for the construction of tree structure.It is especially fit for the application system using database.The special storege organization needn’t to be established in the database using this algorithm.By SQL statement,the data dispersed in different storeage organization can be dynamically combined into the data set including two fields:father node field and child node field.Then the algorithm can process those data and display the tree structure rapidly. At last,we design a control called TFDTreeView which inherits from TTreeView control using this algorithm. TFDTreeView control provide a interface function,through which we can construct the tree structure convinently. On some occasions,this method will be good for the application system.And ,by building the control ,we can reuse it in many system development.
文摘针对基本的快速搜索随机树(rapidly-exploring random tree,RRT)算法用于路径规划时存在的树扩展无导向性、密集障碍物区域规划效率低、局部区域节点聚集等问题,提出一种新的RRT改进算法。该算法采用增强的目标偏向策略,并引入可变的权值系数,提高随机树扩展的导向性和灵活性;同时采用局部节点过滤机制,过滤局部区域内聚集的节点;最后,使用节点直连策略对初始路径进行优化处理。仿真实验的结果表明,改进的RRT算法规划路径的速度更快且生成的路径质量更高,充分证明了改进算法的有效可行性。
文摘网络切片技术旨在共享的物理网络上创建出多个满足不同业务场景的虚拟网络,基于MCTS(Monte Carlo Tree Search)的切片部署方法在接受率等多种指标上均优于传统的启发式算法。针对基于MCTS的切片部署方法在大规模网络上存在的收敛时间过长的问题,论文提出利用通过限制两跳之间的路径长度、并使用节点重要性排序结果作为先验知识对搜索树进行剪枝解决问题。进一步,论文使用广义网络温度GNT(Generalized Network Temperature)对MCTS的搜索目标进行改进。实验结果表明,论文提出的方法有效减缓了因为虚拟网络部署导致的底层网络资源碎片化问题。
