In this paper,we first propose a memristive chaotic system and implement it by circuit simulation.The chaotic dynamics and various attractors are analysed by using phase portrait,bifurcation diagram,and Lyapunov expon...In this paper,we first propose a memristive chaotic system and implement it by circuit simulation.The chaotic dynamics and various attractors are analysed by using phase portrait,bifurcation diagram,and Lyapunov exponents.In particular,the system has robust chaos in a wide parameter range and the initial value space,which is favourable to the security communication application.Consequently,we further explore its application in image encryption and present a new scheme.Before image processing,the external key is protected by the Grain-128a algorithm and the initial values of the memristive system are updated with the plain image.We not only perform random pixel extraction and masking with the chaotic cipher,but also use them as control parameters for Brownian motion to obtain the permutation matrix.In addition,multiplication on the finite field GF(2^(8))is added to further enhance the cryptography.Finally,the simulation results verify that the proposed image encryption scheme has better performance and higher security,which can effectively resist various attacks.展开更多
A solution to compute the optimal path based on a single-line-single-directional（SLSD）road network model is proposed.Unlike the traditional road network model,in the SLSD conceptual model,being single-directional an...A solution to compute the optimal path based on a single-line-single-directional（SLSD）road network model is proposed.Unlike the traditional road network model,in the SLSD conceptual model,being single-directional and single-line style,a road is no longer a linkage of road nodes but abstracted as a network node.Similarly,a road node is abstracted as the linkage of two ordered single-directional roads.This model can describe turn restrictions,circular roads,and other real scenarios usually described using a super-graph.Then a computing framework for optimal path finding（OPF）is presented.It is proved that classical Dijkstra and A algorithms can be directly used for OPF computing of any real-world road networks by transferring a super-graph to an SLSD network.Finally,using Singapore road network data,the proposed conceptual model and its corresponding optimal path finding algorithms are validated using a two-step optimal path finding algorithm with a pre-computing strategy based on the SLSD road network.展开更多
基金This work was supported by the National Natural Science Foundation of China(61203004)the Natural Science Foundation of Heilongjiang Province(F201220)the Heilongjiang Provincial Natural Science Foundation of Joint Guidance Project(LH2020F022).
文摘In this paper,we first propose a memristive chaotic system and implement it by circuit simulation.The chaotic dynamics and various attractors are analysed by using phase portrait,bifurcation diagram,and Lyapunov exponents.In particular,the system has robust chaos in a wide parameter range and the initial value space,which is favourable to the security communication application.Consequently,we further explore its application in image encryption and present a new scheme.Before image processing,the external key is protected by the Grain-128a algorithm and the initial values of the memristive system are updated with the plain image.We not only perform random pixel extraction and masking with the chaotic cipher,but also use them as control parameters for Brownian motion to obtain the permutation matrix.In addition,multiplication on the finite field GF(2^(8))is added to further enhance the cryptography.Finally,the simulation results verify that the proposed image encryption scheme has better performance and higher security,which can effectively resist various attacks.
基金The National Key Technology R&D Program of China during the 11th Five Year Plan Period(No.2008BAJ11B01)
文摘A solution to compute the optimal path based on a single-line-single-directional（SLSD）road network model is proposed.Unlike the traditional road network model,in the SLSD conceptual model,being single-directional and single-line style,a road is no longer a linkage of road nodes but abstracted as a network node.Similarly,a road node is abstracted as the linkage of two ordered single-directional roads.This model can describe turn restrictions,circular roads,and other real scenarios usually described using a super-graph.Then a computing framework for optimal path finding（OPF）is presented.It is proved that classical Dijkstra and A algorithms can be directly used for OPF computing of any real-world road networks by transferring a super-graph to an SLSD network.Finally,using Singapore road network data,the proposed conceptual model and its corresponding optimal path finding algorithms are validated using a two-step optimal path finding algorithm with a pre-computing strategy based on the SLSD road network.
