Existing numerical methods for complex composites, such as multiscale simulation and neural network algorithms, face significant limitations. Multiscale techniques are often prohibitively expensive for large models, w...Existing numerical methods for complex composites, such as multiscale simulation and neural network algorithms, face significant limitations. Multiscale techniques are often prohibitively expensive for large models, while neural networks struggle to represent underlying microscopic material properties. To overcome these challenges, a meso-micro scale numerical method using a virtual node approach is developed in this study. A Wbraid/Al/Epoxy functional structural material is fabricated, and a representative periodic unit cell is identified based on its architecture. The complex structure is then discretized into nodes, and mechanical interactions are governed by pre-defined computation rules. This virtual node method is systematically compared against both multiscale simulation and a neural network algorithm, with validation provided through mechanical experiments. The results demonstrate that the nodal operation strategy significantly reduces computational resource requirements. By quantifying microscopic bonding with coefficients, explicit interface treatment is avoided, granting the method strong adaptability to lattice materials. The method can simulate extremely complex structures using parameters from simple tests and is suited for large systems. Compared to three-point bending experiments, errors for multiscale, virtual node, and neural network methods were 12.4%, 6.9%, and 34.5%, respectively. Under dynamic compression, the errors were 2.7%, 9.3%, and 15.43%. The virtual node method demonstrated superior accuracy under static conditions, enabling efficient prediction and auxiliary development of complex structural materials.展开更多
The number of IPv6 routes in todays backbone routers has grown rapidly,which has put tremendous pressure on route lookup and storage.Based on the analysis of IPv6 address prefix length and distribution characteristics...The number of IPv6 routes in todays backbone routers has grown rapidly,which has put tremendous pressure on route lookup and storage.Based on the analysis of IPv6 address prefix length and distribution characteristics,this paper proposes an IPv6 route lookup architecture called LPR-Trie.The core idea of the algorithm is to utilize more spaces and accelerate routing lookup.Moreover,we put forward the concept of virtual nodes,and leverage the link between virtual nodes and ordinary nodes to accelerate routing lookup.We provide the longest prefix routing entry(LPR)calculation algorithm to achieve the longest prefix match.The experimental results show that the virtual node mechanism increases the search speed up to 244%,and the virtual nodes have better stability by setting an appropriate keep-alive time according to the characteristics of actual traffic.This paper shows that our design improves the routing lookup speed and have better memory utilization.展开更多
A novel polygonal finite element method （PFEM） based on partition of unity is proposed, termed the virtual node method （VNM）. To test the performance of the present method, numerical examples are given for solid m...A novel polygonal finite element method （PFEM） based on partition of unity is proposed, termed the virtual node method （VNM）. To test the performance of the present method, numerical examples are given for solid mechanics problems. With a polynomial form, the VNM achieves better results than those of traditional PFEMs, including the Wachspress method and the mean value method in standard patch tests. Compared with the standard triangular FEM, the VNM can achieve better accuracy. With the ability to construct shape functions on polygonal elements, the VNM provides greater flexibility in mesh generation. Therefore, several fracture problems are studied to demonstrate the potential implementation. With the advantage of the VNM, the convenient refinement and remeshing strategy are applied.展开更多
A virtual node placement strategy based on service-aware is proposed for an information acquisition platform. The performance preferences and types of services in the information acquisition platform are analyzed as w...A virtual node placement strategy based on service-aware is proposed for an information acquisition platform. The performance preferences and types of services in the information acquisition platform are analyzed as well as a comparison of the running time of services both in virtual node centralized and decentralized placing. All physical hosts are divided into different sub-clusters by using the analytic hierarchy process( AHP),in order to fit service of different performance preferences. In the sub-cluster,both load balance and quality of service are taken into account. Comparing with the heuristic algorithm,the experiment results show that the proposed placement strategy is running for a shorter time. And comparing with the virtual node placement strategy provided by OpenStack,the experiment results show that the proposed placement strategy can improve the execution speed of service in the information acquisition platform,and also can balance the load which improves resources utilization.展开更多
Satellite networks have many advantages over traditional terrestrial networks.However,it is very difficult to design a satellite network with excellent performance.The paper briefly summarizes some existing satellite ...Satellite networks have many advantages over traditional terrestrial networks.However,it is very difficult to design a satellite network with excellent performance.The paper briefly summarizes some existing satellite network routing technologies from the perspective of both single-layer and multilayer satellite constellations,and focuses on the main ideas,characteristics,and existing problems of these routing technologies.For single-layer satellite networks,two routing strategies are discussed,virtual node strategy and virtual topology strategy.Moreover,considering the deficiency of existing multilayer satellite network routing,we discuss the topic invulnerability.Finally,the challenges and problems faced by the satellite network are analyzed and the trend of future development is predicted.展开更多
文摘Existing numerical methods for complex composites, such as multiscale simulation and neural network algorithms, face significant limitations. Multiscale techniques are often prohibitively expensive for large models, while neural networks struggle to represent underlying microscopic material properties. To overcome these challenges, a meso-micro scale numerical method using a virtual node approach is developed in this study. A Wbraid/Al/Epoxy functional structural material is fabricated, and a representative periodic unit cell is identified based on its architecture. The complex structure is then discretized into nodes, and mechanical interactions are governed by pre-defined computation rules. This virtual node method is systematically compared against both multiscale simulation and a neural network algorithm, with validation provided through mechanical experiments. The results demonstrate that the nodal operation strategy significantly reduces computational resource requirements. By quantifying microscopic bonding with coefficients, explicit interface treatment is avoided, granting the method strong adaptability to lattice materials. The method can simulate extremely complex structures using parameters from simple tests and is suited for large systems. Compared to three-point bending experiments, errors for multiscale, virtual node, and neural network methods were 12.4%, 6.9%, and 34.5%, respectively. Under dynamic compression, the errors were 2.7%, 9.3%, and 15.43%. The virtual node method demonstrated superior accuracy under static conditions, enabling efficient prediction and auxiliary development of complex structural materials.
基金support from the National Natural Science Foundation of China (61872252)National Key Research and Development Program of China (2018YFB1800403)+1 种基金the Beijing Natural Science Foundation (4202012)the Science and Technology Project of Beijing Municipal Commission of Education in China (KM201810028017)
文摘The number of IPv6 routes in todays backbone routers has grown rapidly,which has put tremendous pressure on route lookup and storage.Based on the analysis of IPv6 address prefix length and distribution characteristics,this paper proposes an IPv6 route lookup architecture called LPR-Trie.The core idea of the algorithm is to utilize more spaces and accelerate routing lookup.Moreover,we put forward the concept of virtual nodes,and leverage the link between virtual nodes and ordinary nodes to accelerate routing lookup.We provide the longest prefix routing entry(LPR)calculation algorithm to achieve the longest prefix match.The experimental results show that the virtual node mechanism increases the search speed up to 244%,and the virtual nodes have better stability by setting an appropriate keep-alive time according to the characteristics of actual traffic.This paper shows that our design improves the routing lookup speed and have better memory utilization.
文摘A novel polygonal finite element method （PFEM） based on partition of unity is proposed, termed the virtual node method （VNM）. To test the performance of the present method, numerical examples are given for solid mechanics problems. With a polynomial form, the VNM achieves better results than those of traditional PFEMs, including the Wachspress method and the mean value method in standard patch tests. Compared with the standard triangular FEM, the VNM can achieve better accuracy. With the ability to construct shape functions on polygonal elements, the VNM provides greater flexibility in mesh generation. Therefore, several fracture problems are studied to demonstrate the potential implementation. With the advantage of the VNM, the convenient refinement and remeshing strategy are applied.
基金Supported by the National Natural Science Foundation of China(No.61100189,61370215,61370211,61402137)the National Key Technology R&D Program(No.2012BAH45B01)the Open Project Foundation of Information Security Evaluation Center of Civil Aviation,Civil Aviation University of China(No.CAAC-ISECCA-201703)
文摘A virtual node placement strategy based on service-aware is proposed for an information acquisition platform. The performance preferences and types of services in the information acquisition platform are analyzed as well as a comparison of the running time of services both in virtual node centralized and decentralized placing. All physical hosts are divided into different sub-clusters by using the analytic hierarchy process( AHP),in order to fit service of different performance preferences. In the sub-cluster,both load balance and quality of service are taken into account. Comparing with the heuristic algorithm,the experiment results show that the proposed placement strategy is running for a shorter time. And comparing with the virtual node placement strategy provided by OpenStack,the experiment results show that the proposed placement strategy can improve the execution speed of service in the information acquisition platform,and also can balance the load which improves resources utilization.
基金This work is supported by the National Natural Science Foundation of China(Nos.61572435,61472305,61473222)the Natural Science Foundation of Shaanxi Province(Nos.2015JZ002,2015JM6311)+1 种基金the Natural Science Foundation of Zhejiang Province(No.LZ16F020001)Programs Supported by Ningbo Natural Science Foundation(No.2016A610035).
文摘Satellite networks have many advantages over traditional terrestrial networks.However,it is very difficult to design a satellite network with excellent performance.The paper briefly summarizes some existing satellite network routing technologies from the perspective of both single-layer and multilayer satellite constellations,and focuses on the main ideas,characteristics,and existing problems of these routing technologies.For single-layer satellite networks,two routing strategies are discussed,virtual node strategy and virtual topology strategy.Moreover,considering the deficiency of existing multilayer satellite network routing,we discuss the topic invulnerability.Finally,the challenges and problems faced by the satellite network are analyzed and the trend of future development is predicted.
