In this paper, the stability of disclination ring in nematie liquid crystals is studied. In the presence of saddle-splay elasticity （characterized by k24） the disclination ring has a universal equilibrium radius. De...In this paper, the stability of disclination ring in nematie liquid crystals is studied. In the presence of saddle-splay elasticity （characterized by k24） the disclination ring has a universal equilibrium radius. Depending on the values of the saddle-splay constant k24, the universal equilibrium radius is altered. When k24 〉 0.92k （m = 1/2） and k24 〉 0.88k （m =-1/2）, the disclination will be a point rather than a ring, where k is the Frank elastic constant in the one-constant approximation.展开更多
By leveraging the 5G enabled vehicular ad hoc network(5G-VANET), it is widely recognized that connected vehicles have the potentials to improve road safety, transportation intelligence and provide in-vehicle entertain...By leveraging the 5G enabled vehicular ad hoc network(5G-VANET), it is widely recognized that connected vehicles have the potentials to improve road safety, transportation intelligence and provide in-vehicle entertainment experience. However, many enabling applications in 5G-VANET rely on the efficient content sharing among mobile vehicles, which is a very challenging issue due to the extremely large data volume, rapid topology change, and unbalanced traffic. In this paper, we investigate content prefetching and distribution in 5G-VANET. We first introduce an edge computing based hierarchical architecture for efficient distribution of large-volume vehicular data. We then propose a multi-place multi-factor prefetching scheme to meet the rapid topology change and unbalanced traffic. The content requests of vehicles can be served by neighbors, which can improve the sharing efficiency and alleviate the burden of networks. Furthermore, we use a graph theory based approach to solve the content distribution by transforming it into a maximum weighted independent set problem. Finally, the proposed scheme is evaluated with a greedy transmission strategy to demonstrate its efficiency.展开更多
基金the Natural Science Foundation of Shanghai Municipal Commission of Science and Technology under Grant No.04ZR14059National Natural Science Foundation of China under Grant No.10575068
文摘In this paper, the stability of disclination ring in nematie liquid crystals is studied. In the presence of saddle-splay elasticity （characterized by k24） the disclination ring has a universal equilibrium radius. Depending on the values of the saddle-splay constant k24, the universal equilibrium radius is altered. When k24 〉 0.92k （m = 1/2） and k24 〉 0.88k （m =-1/2）, the disclination will be a point rather than a ring, where k is the Frank elastic constant in the one-constant approximation.
基金the support of National Science and Technology Major Project of the Ministry of Science and Technology of China under Grant No.2016ZX03001025003the Natural Science Foundation of Beijing under Grant No.4181002+2 种基金the Natural Science Foundation of China under Grant No.91638204BUPT Excellent Ph.D. Students Foundation under Grant No.CX2018210Natural Sciences and Engineering Research Council (NSERC),Canada
文摘By leveraging the 5G enabled vehicular ad hoc network(5G-VANET), it is widely recognized that connected vehicles have the potentials to improve road safety, transportation intelligence and provide in-vehicle entertainment experience. However, many enabling applications in 5G-VANET rely on the efficient content sharing among mobile vehicles, which is a very challenging issue due to the extremely large data volume, rapid topology change, and unbalanced traffic. In this paper, we investigate content prefetching and distribution in 5G-VANET. We first introduce an edge computing based hierarchical architecture for efficient distribution of large-volume vehicular data. We then propose a multi-place multi-factor prefetching scheme to meet the rapid topology change and unbalanced traffic. The content requests of vehicles can be served by neighbors, which can improve the sharing efficiency and alleviate the burden of networks. Furthermore, we use a graph theory based approach to solve the content distribution by transforming it into a maximum weighted independent set problem. Finally, the proposed scheme is evaluated with a greedy transmission strategy to demonstrate its efficiency.
