This paper proposes an image encryption algorithm LQBPNN（logistic quantum and back propagation neural network）based on chaotic sequences incorporating quantum keys. Firstly, the improved one-dimensional logistic cha...This paper proposes an image encryption algorithm LQBPNN（logistic quantum and back propagation neural network）based on chaotic sequences incorporating quantum keys. Firstly, the improved one-dimensional logistic chaotic sequence is used as the basic key sequence. After the quantum key is introduced, the quantum key is incorporated into the chaotic sequence by nonlinear operation. Then the pixel confused process is completed by the neural network. Finally, two sets of different mixed secret key sequences are used to perform two rounds of diffusion encryption on the confusing image. The experimental results show that the randomness and uniformity of the key sequence are effectively enhanced. The algorithm has a secret key space greater than 2182. The adjacent pixel correlation of the encrypted image is close to 0, and the information entropy is close to 8. The ciphertext image can resist several common attacks such as typical attacks, statistical analysis attacks and differential attacks.展开更多
Job shop scheduling has become the basis and core of advanced manufacturing technology. Various differences exist between academic research and practical production. The majority of previous researches on job shop sch...Job shop scheduling has become the basis and core of advanced manufacturing technology. Various differences exist between academic research and practical production. The majority of previous researches on job shop scheduling problem (JSSP)describe the basic production environment, which have a single objective and limited constraints. However,a practical process of production is characterized by having multiple objectives,no-wait constraint,and limited storage. Thus this research focused on multiobjective,no-wait JSSP. To analyze the problem,it was further divided into two sub-problems, namely, sequencing and timetabling. Hybrid non-order strategy and modified complete local search with memory were used to solve each problem individually. A Pareto-based strategy for performing fitness assessment was presented in this study. Various experiments on benchmark problems proved the feasibility and effectiveness of the proposed algorithm.展开更多
基金supported by National Natural Science Foundation of China (No. 61402012)Doctor Foundation of Anhui University of Science and Technology
文摘This paper proposes an image encryption algorithm LQBPNN（logistic quantum and back propagation neural network）based on chaotic sequences incorporating quantum keys. Firstly, the improved one-dimensional logistic chaotic sequence is used as the basic key sequence. After the quantum key is introduced, the quantum key is incorporated into the chaotic sequence by nonlinear operation. Then the pixel confused process is completed by the neural network. Finally, two sets of different mixed secret key sequences are used to perform two rounds of diffusion encryption on the confusing image. The experimental results show that the randomness and uniformity of the key sequence are effectively enhanced. The algorithm has a secret key space greater than 2182. The adjacent pixel correlation of the encrypted image is close to 0, and the information entropy is close to 8. The ciphertext image can resist several common attacks such as typical attacks, statistical analysis attacks and differential attacks.
基金National Natural Science Foundations of China(Nos.61174040,61573144,11304200)Shanghai Commission of Science and Technology,China(No.12JC1403400)+1 种基金Shanghai Municipal Education Commission for Training Young Teachers,China(No.ZZSDJ15031)Shanghai Teaching and Reforming Experimental Undergraduate Majors Construction Program,China
文摘Job shop scheduling has become the basis and core of advanced manufacturing technology. Various differences exist between academic research and practical production. The majority of previous researches on job shop scheduling problem (JSSP)describe the basic production environment, which have a single objective and limited constraints. However,a practical process of production is characterized by having multiple objectives,no-wait constraint,and limited storage. Thus this research focused on multiobjective,no-wait JSSP. To analyze the problem,it was further divided into two sub-problems, namely, sequencing and timetabling. Hybrid non-order strategy and modified complete local search with memory were used to solve each problem individually. A Pareto-based strategy for performing fitness assessment was presented in this study. Various experiments on benchmark problems proved the feasibility and effectiveness of the proposed algorithm.
