Although computer capabilities have been improved significantly, a large-scale virtual reality （VR） system demands much more in terms of memory and computation than the current computer systems can offer. This paper...Although computer capabilities have been improved significantly, a large-scale virtual reality （VR） system demands much more in terms of memory and computation than the current computer systems can offer. This paper discusses two important issues related to VR performance and applications in building navigation. These are dynamic loading of models based on cell segmentation for the optimal VR operation, and the route optimization based on path planning for easy navigation. The VR model of engineering and information technology complex （EITC） building at the University of Manitoba is built as an example to show the feasibility of the proposed methods. The reality, enhanced by three-dimensional （3D） real-time interactivity and visualization, leads navigators into a state of the virtual building immersion.展开更多
Virtual path concept has several valuable features to re construct an economical and efficient ATM network.The most important effect of VPs is to afford transmission efficiently through the dynamic control of VPs reso...Virtual path concept has several valuable features to re construct an economical and efficient ATM network.The most important effect of VPs is to afford transmission efficiently through the dynamic control of VPs resource including buffer and bandwidth.This paper described the problem of dynamic resource control of VP in ATM networks.Based on a discrete event dynamic model of resource control of VP in ATM networks,the optimal control law of resource allocation of VP in ATM networks with the method of dynamic programming was presented.The results of the theorem proof and simulation show that the dynamic control is more efficient to reduce the calls block rate comparing with the static allocation.展开更多
A algorithm of dynamic multi-step reinforcement learning based on virtual potential field path planning is proposed in this paper. Firstly, it is constructed the virtual potential field according to the known informat...A algorithm of dynamic multi-step reinforcement learning based on virtual potential field path planning is proposed in this paper. Firstly, it is constructed the virtual potential field according to the known information. And then in view of Q learning algorithm of the QekT algorithm, a multi-step reinforcement learning algorithm is proposed in this paper. It can update current Q value used of future dynamic k steps according to the current environment status. At the same time, the convergence is analyzed. Finally the simulation experiments are done. It shows that the proposed algorithm and convergence and so on are more efficiency than similar algorithms.展开更多
This paper presents a Doppler passive location method for moving targets with fixed single station using the Doppler frequency shift and time difference information.First,based on the relationship between frequency sh...This paper presents a Doppler passive location method for moving targets with fixed single station using the Doppler frequency shift and time difference information.First,based on the relationship between frequency shift and path difference,the virtual path difference is calculated from the measured value of Doppler frequency shift by means of mean value correction.Then,under the assumption that the target is moving at a constant speed along a straight line,two coaxial virtual double base arrays are constructed by using the moving track of the moving target based on the method of fixed period time difference.On this basis,the moving distance of the moving target can be calculated by using the ratio relationship between the frequency difference and the radial distance between the two adjacent detection points in the middle of the array,and the linear solution of the two double base path difference positioning equations.At this point,the relative coordinate position of the moving target can be obtained by directly using the linear solution of the double base path difference positioning equation again.展开更多
We present a new algorithm to compute a geodesic path over a triangle mesh. Based on Novotni＇s propagating wavefront method which is similar to the well known Dijkstra algorithm, we made some improvements which Novot...We present a new algorithm to compute a geodesic path over a triangle mesh. Based on Novotni＇s propagating wavefront method which is similar to the well known Dijkstra algorithm, we made some improvements which Novotni had missed and we also gave the method to find out the geodesic path which Novotni had not. It can handle both convex and non-convex surfaces or even with boundaries. Experiment results show that our method works very well both in efficiency and precision.展开更多
The Rapidly-exploring Random Tree(RRT)algorithm is an efficient path-planning algorithm based on random sampling.The RRT^(*)algorithm is a variant of the RRT algorithm that can achieve convergence to the optimal solut...The Rapidly-exploring Random Tree(RRT)algorithm is an efficient path-planning algorithm based on random sampling.The RRT^(*)algorithm is a variant of the RRT algorithm that can achieve convergence to the optimal solution.However,it has been proven to take an infinite time to do so.An improved Quick-RRT^(*)(Q-RRT^(*))algorithm based on a virtual light source is proposed in this paper to overcome this problem.The virtual light-based Q-RRT^(*)(LQRRT^(*))takes advantage of the heuristic information generated by the virtual light on the map.In this way,the tree can find the initial solution quickly.Next,the LQRRT^(*)algorithm combines the heuristic information with the optimization capability of the Q-RRT^(*)algorithm to find the approximate optimal solution.LQRRT^(*)further optimizes the sampling space compared with the Q-RRT^(*)algorithm and improves the sampling efficiency.The efficiency of the algorithm is verified by comparison experiments in different simulation environments.The results show that the proposed algorithm can converge to the approximate optimal solution in less time and with lower memory consumption.展开更多
While smart devices based on ARM processor bring us a lot of convenience,they also become an attractive target of cyber-attacks.The threat is exaggerated as commodity OSes usually have a large code base and suffer fro...While smart devices based on ARM processor bring us a lot of convenience,they also become an attractive target of cyber-attacks.The threat is exaggerated as commodity OSes usually have a large code base and suffer from various software vulnerabilities.Nowadays,adversaries prefer to steal sensitive data by leaking the content of display output by a security-sensitive application.A promising solution is to exploit the hardware visualization extensions provided by modern ARM processors to construct a secure display path between the applications and the display device.In this work,we present a scheme named SecDisplay for trusted display service,it protects sensitive data displayed from being stolen or tampered surreptitiously by a compromised OS.The TCB of SecDisplay mainly consists of a tiny hypervisor and a super light-weight rendering painter,and has only^1400 lines of code.We implemented a prototype of SecDisplay and evaluated its performance overhead.The results show that SecDisplay only incurs an average drop of 3.4%.展开更多
基金supported by Discovery Grants of National Science and Engineering Research Council of Canada (NSERC) and Faculty of Engineering at University of Manitoba
文摘Although computer capabilities have been improved significantly, a large-scale virtual reality （VR） system demands much more in terms of memory and computation than the current computer systems can offer. This paper discusses two important issues related to VR performance and applications in building navigation. These are dynamic loading of models based on cell segmentation for the optimal VR operation, and the route optimization based on path planning for easy navigation. The VR model of engineering and information technology complex （EITC） building at the University of Manitoba is built as an example to show the feasibility of the proposed methods. The reality, enhanced by three-dimensional （3D） real-time interactivity and visualization, leads navigators into a state of the virtual building immersion.
文摘Virtual path concept has several valuable features to re construct an economical and efficient ATM network.The most important effect of VPs is to afford transmission efficiently through the dynamic control of VPs resource including buffer and bandwidth.This paper described the problem of dynamic resource control of VP in ATM networks.Based on a discrete event dynamic model of resource control of VP in ATM networks,the optimal control law of resource allocation of VP in ATM networks with the method of dynamic programming was presented.The results of the theorem proof and simulation show that the dynamic control is more efficient to reduce the calls block rate comparing with the static allocation.
文摘A algorithm of dynamic multi-step reinforcement learning based on virtual potential field path planning is proposed in this paper. Firstly, it is constructed the virtual potential field according to the known information. And then in view of Q learning algorithm of the QekT algorithm, a multi-step reinforcement learning algorithm is proposed in this paper. It can update current Q value used of future dynamic k steps according to the current environment status. At the same time, the convergence is analyzed. Finally the simulation experiments are done. It shows that the proposed algorithm and convergence and so on are more efficiency than similar algorithms.
文摘This paper presents a Doppler passive location method for moving targets with fixed single station using the Doppler frequency shift and time difference information.First,based on the relationship between frequency shift and path difference,the virtual path difference is calculated from the measured value of Doppler frequency shift by means of mean value correction.Then,under the assumption that the target is moving at a constant speed along a straight line,two coaxial virtual double base arrays are constructed by using the moving track of the moving target based on the method of fixed period time difference.On this basis,the moving distance of the moving target can be calculated by using the ratio relationship between the frequency difference and the radial distance between the two adjacent detection points in the middle of the array,and the linear solution of the two double base path difference positioning equations.At this point,the relative coordinate position of the moving target can be obtained by directly using the linear solution of the double base path difference positioning equation again.
基金This work was supported by National Natural Science Foundation of PRC(No.60503058,No.60533080)the Science and Technology Fund of Huawei Technologies Co.,Ltd.
文摘We present a new algorithm to compute a geodesic path over a triangle mesh. Based on Novotni＇s propagating wavefront method which is similar to the well known Dijkstra algorithm, we made some improvements which Novotni had missed and we also gave the method to find out the geodesic path which Novotni had not. It can handle both convex and non-convex surfaces or even with boundaries. Experiment results show that our method works very well both in efficiency and precision.
基金This work was supported by the Natural Science Foundation of the Jiangsu Higher Education Institutions of China[grant number 19KJB510022]the Startup Research Foundation for Advanced Talents[grant number JSPIGKZ/2911119220].
文摘The Rapidly-exploring Random Tree(RRT)algorithm is an efficient path-planning algorithm based on random sampling.The RRT^(*)algorithm is a variant of the RRT algorithm that can achieve convergence to the optimal solution.However,it has been proven to take an infinite time to do so.An improved Quick-RRT^(*)(Q-RRT^(*))algorithm based on a virtual light source is proposed in this paper to overcome this problem.The virtual light-based Q-RRT^(*)(LQRRT^(*))takes advantage of the heuristic information generated by the virtual light on the map.In this way,the tree can find the initial solution quickly.Next,the LQRRT^(*)algorithm combines the heuristic information with the optimization capability of the Q-RRT^(*)algorithm to find the approximate optimal solution.LQRRT^(*)further optimizes the sampling space compared with the Q-RRT^(*)algorithm and improves the sampling efficiency.The efficiency of the algorithm is verified by comparison experiments in different simulation environments.The results show that the proposed algorithm can converge to the approximate optimal solution in less time and with lower memory consumption.
基金This work was financially supported by the National Natural Science Foundation of China(Grant No.61379145)the Joint Funds of CETC(Grant No.20166141B08020101).
文摘While smart devices based on ARM processor bring us a lot of convenience,they also become an attractive target of cyber-attacks.The threat is exaggerated as commodity OSes usually have a large code base and suffer from various software vulnerabilities.Nowadays,adversaries prefer to steal sensitive data by leaking the content of display output by a security-sensitive application.A promising solution is to exploit the hardware visualization extensions provided by modern ARM processors to construct a secure display path between the applications and the display device.In this work,we present a scheme named SecDisplay for trusted display service,it protects sensitive data displayed from being stolen or tampered surreptitiously by a compromised OS.The TCB of SecDisplay mainly consists of a tiny hypervisor and a super light-weight rendering painter,and has only^1400 lines of code.We implemented a prototype of SecDisplay and evaluated its performance overhead.The results show that SecDisplay only incurs an average drop of 3.4%.
