期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Anycast service model and its QoS routing algorithm 被引量:11
1
作者 WANG Jian xin, CHEN Song qiao, CHEN Jian er (College of Information Science and Engineering, Central South University, Changsha 410083, China) 《Journal of Central South University of Technology》 2001年第2期135-139,共5页
In the Internet, a group of replicated servers is commonly used in order to improve the scalability of network service. Anycast service is a new network service that can improve network load distribution and simplify ... In the Internet, a group of replicated servers is commonly used in order to improve the scalability of network service. Anycast service is a new network service that can improve network load distribution and simplify certain applications. In this paper, the authors described a simple anycast service model in the Internet without significant affecting the routing and protocol processing infrastructure that was already in place, and proposed an anycast QoS routing algorithm for this model. The algorithm used randomized method to balance network load and improve its performance. Several new techniques are proposed in the algorithm, first, theminimum hops for each node are used in the algorithm, which are used as metric for computing the probability of possible out links. The metric is pre computed for each node in the network, which can simplify the network complexity and provide the routing process with useful information. Second, randomness is used at the link level and depends dynamically on the routing configuration. This provides great flexibility for the routing process, prevents the routing process from overusing certain fixed routing paths, and adequately balances the delay of the routing path. the authors assess the quality of QoS algorithm in terms of the acceptance ratio on anycast QoS requests, and the simulation results on a variety of network topologies and on various parameters show that the algorithm has good performances and can balance network load effectively. 展开更多
关键词 QOS anycast service network routing randomized algorithm
在线阅读 下载PDF
Investigation of Nuclear Binding Energy and Charge Radius Based on Random Forest Algorithm
2
作者 CAI Boshuai YU Tianjun +3 位作者 LIN Xuan ZHANG Jilong WANG Zhixuan YUAN Cenxi 《原子能科学技术》 EI CAS CSCD 北大核心 2023年第4期704-712,共9页
The random forest algorithm was applied to study the nuclear binding energy and charge radius.The regularized root-mean-square of error(RMSE)was proposed to avoid overfitting during the training of random forest.RMSE ... The random forest algorithm was applied to study the nuclear binding energy and charge radius.The regularized root-mean-square of error(RMSE)was proposed to avoid overfitting during the training of random forest.RMSE for nuclides with Z,N>7 is reduced to 0.816 MeV and 0.0200 fm compared with the six-term liquid drop model and a three-term nuclear charge radius formula,respectively.Specific interest is in the possible(sub)shells among the superheavy region,which is important for searching for new elements and the island of stability.The significance of shell features estimated by the so-called shapely additive explanation method suggests(Z,N)=(92,142)and(98,156)as possible subshells indicated by the binding energy.Because the present observed data is far from the N=184 shell,which is suggested by mean-field investigations,its shell effect is not predicted based on present training.The significance analysis of the nuclear charge radius suggests Z=92 and N=136 as possible subshells.The effect is verified by the shell-corrected nuclear charge radius model. 展开更多
关键词 nuclear binding energy nuclear charge radius random forest algorithm
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部