Fog computing has emerged as an important technology which can improve the performance of computation-intensive and latency-critical communication networks.Nevertheless,the fog computing Internet-of-Things(IoT)systems...Fog computing has emerged as an important technology which can improve the performance of computation-intensive and latency-critical communication networks.Nevertheless,the fog computing Internet-of-Things(IoT)systems are susceptible to malicious eavesdropping attacks during the information transmission,and this issue has not been adequately addressed.In this paper,we propose a physical-layer secure fog computing IoT system model,which is able to improve the physical layer security of fog computing IoT networks against the malicious eavesdropping of multiple eavesdroppers.The secrecy rate of the proposed model is analyzed,and the quantum galaxy–based search algorithm(QGSA)is proposed to solve the hybrid task scheduling and resource management problem of the network.The computational complexity and convergence of the proposed algorithm are analyzed.Simulation results validate the efficiency of the proposed model and reveal the influence of various environmental parameters on fog computing IoT networks.Moreover,the simulation results demonstrate that the proposed hybrid task scheduling and resource management scheme can effectively enhance secrecy performance across different communication scenarios.展开更多
A quantum BP neural networks model with learning algorithm is proposed. First, based on the universality of single qubit rotation gate and two-qubit controlled-NOT gate, a quantum neuron model is constructed, which is...A quantum BP neural networks model with learning algorithm is proposed. First, based on the universality of single qubit rotation gate and two-qubit controlled-NOT gate, a quantum neuron model is constructed, which is composed of input, phase rotation, aggregation, reversal rotation and output. In this model, the input is described by qubits, and the output is given by the probability of the state in which （1） is observed. The phase rotation and the reversal rotation are performed by the universal quantum gates. Secondly, the quantum BP neural networks model is constructed, in which the output layer and the hide layer are quantum neurons. With the application of the gradient descent algorithm, a learning algorithm of the model is proposed, and the continuity of the model is proved. It is shown that this model and algorithm are superior to the conventional BP networks in three aspects： convergence speed, convergence rate and robustness, by two application examples of pattern recognition and function approximation.展开更多
To solve discrete optimization difficulty of the spectrum allocation problem,a membrane-inspired quantum shuffled frog leaping（MQSFL） algorithm is proposed.The proposed MQSFL algorithm applies the theory of membrane...To solve discrete optimization difficulty of the spectrum allocation problem,a membrane-inspired quantum shuffled frog leaping（MQSFL） algorithm is proposed.The proposed MQSFL algorithm applies the theory of membrane computing and quantum computing to the shuffled frog leaping algorithm,which is an effective discrete optimization algorithm.Then the proposed MQSFL algorithm is used to solve the spectrum allocation problem of cognitive radio systems.By hybridizing the quantum frog colony optimization and membrane computing,the quantum state and observation state of the quantum frogs can be well evolved within the membrane structure.The novel spectrum allocation algorithm can search the global optimal solution within a reasonable computation time.Simulation results for three utility functions of a cognitive radio system are provided to show that the MQSFL spectrum allocation method is superior to some previous spectrum allocation algorithms based on intelligence computing.展开更多
The knapsack problem is a well-known combinatorial optimization problem which has been proved to be NP-hard. This paper proposes a new algorithm called quantum-inspired ant algorithm （QAA） to solve the knapsack prob...The knapsack problem is a well-known combinatorial optimization problem which has been proved to be NP-hard. This paper proposes a new algorithm called quantum-inspired ant algorithm （QAA） to solve the knapsack problem. QAA takes the advantage of the principles in quantum computing, such as qubit, quantum gate, and quantum superposition of states, to get more probabilistic-based status with small colonies. By updating the pheromone in the ant algorithm and rotating the quantum gate, the algorithm can finally reach the optimal solution. The detailed steps to use QAA are presented, and by solving series of test cases of classical knapsack problems, the effectiveness and generality of the new algorithm are validated.展开更多
For acquiring high energy efficiency and the maximal throughput, a new time slot structure is designed for energy harvesting(EH) cognitive radio(CR). Considering the CR system with EH and cooperative relay, a best coo...For acquiring high energy efficiency and the maximal throughput, a new time slot structure is designed for energy harvesting(EH) cognitive radio(CR). Considering the CR system with EH and cooperative relay, a best cooperative mechanism(BCM)is proposed for CR with EH. To get the optimal estimation performance, a quantum fireworks algorithm(QFA) is designed to resolve the difficulties of maximal throughput and EH, and the proposed cooperative mechanism is called as QFA-BCM. The proposed QFA combines the advantages of quantum computation theory with the fireworks algorithm(FA). Thus the QFA is able to obtain the optimal solution and its convergence performance is proved. By using the new cooperation mechanism and computing algorithm, the proposed QFA-BCM method can achieve comparable maximal throughput in the new timeslot structure. Simulation results have proved that the QFA-BCM method is superior to previous non-cooperative and cooperative mechanisms.展开更多
The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal...The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal. To solve this problem, a Grover searching algorithm based on weighted targets is proposed. First, each target is endowed a weight coefficient according to its importance. Applying these different weight coefficients, the targets are represented as quantum superposition states. Second, the novel Grover searching algorithm based on the quantum superposition of the weighted targets is constructed. Using this algorithm, the probability of getting each target can be approximated to the corresponding weight coefficient, which shows the flexibility of this algorithm. Finally, the validity of the algorithm is proved by a simple searching example.展开更多
In order to effectively solve combinatorial optimization problems,a membrane-inspired quantum bee colony optimization(MQBCO)is proposed for scientific computing and engineering applications.The proposed MQBCO algorith...In order to effectively solve combinatorial optimization problems,a membrane-inspired quantum bee colony optimization(MQBCO)is proposed for scientific computing and engineering applications.The proposed MQBCO algorithm applies the membrane computing theory to quantum bee colony optimization(QBCO),which is an effective discrete optimization algorithm.The global convergence performance of MQBCO is proved by Markov theory,and the validity of MQBCO is verified by testing the classical benchmark functions.Then the proposed MQBCO algorithm is used to solve decision engine problems of cognitive radio system.By hybridizing the QBCO and membrane computing theory,the quantum state and observation state of the quantum bees can be well evolved within the membrane structure.Simulation results for cognitive radio system show that the proposed decision engine method is superior to the traditional intelligent decision engine algorithms in terms of convergence,precision and stability.Simulation experiments under different communication scenarios illustrate that the balance between three objective functions and the adapted parameter configuration is consistent with the weights of three normalized objective functions.展开更多
基金supported by the National Natural Science Foundation of China(61571149,62001139)the Initiation Fund for Postdoctoral Research in Heilongjiang Province(LBH-Q19098)the Natural Science Foundation of Heilongjiang Province(LH2020F0178).
文摘Fog computing has emerged as an important technology which can improve the performance of computation-intensive and latency-critical communication networks.Nevertheless,the fog computing Internet-of-Things(IoT)systems are susceptible to malicious eavesdropping attacks during the information transmission,and this issue has not been adequately addressed.In this paper,we propose a physical-layer secure fog computing IoT system model,which is able to improve the physical layer security of fog computing IoT networks against the malicious eavesdropping of multiple eavesdroppers.The secrecy rate of the proposed model is analyzed,and the quantum galaxy–based search algorithm(QGSA)is proposed to solve the hybrid task scheduling and resource management problem of the network.The computational complexity and convergence of the proposed algorithm are analyzed.Simulation results validate the efficiency of the proposed model and reveal the influence of various environmental parameters on fog computing IoT networks.Moreover,the simulation results demonstrate that the proposed hybrid task scheduling and resource management scheme can effectively enhance secrecy performance across different communication scenarios.
基金the National Natural Science Foundation of China (50138010)
文摘A quantum BP neural networks model with learning algorithm is proposed. First, based on the universality of single qubit rotation gate and two-qubit controlled-NOT gate, a quantum neuron model is constructed, which is composed of input, phase rotation, aggregation, reversal rotation and output. In this model, the input is described by qubits, and the output is given by the probability of the state in which （1） is observed. The phase rotation and the reversal rotation are performed by the universal quantum gates. Secondly, the quantum BP neural networks model is constructed, in which the output layer and the hide layer are quantum neurons. With the application of the gradient descent algorithm, a learning algorithm of the model is proposed, and the continuity of the model is proved. It is shown that this model and algorithm are superior to the conventional BP networks in three aspects： convergence speed, convergence rate and robustness, by two application examples of pattern recognition and function approximation.
基金supported by the National Natural Science Foundation of China (61102106,61102105)the Fundamental Research Funds for the Central Universities (HEUCF100801,HEUCFZ1129)
文摘To solve discrete optimization difficulty of the spectrum allocation problem,a membrane-inspired quantum shuffled frog leaping（MQSFL） algorithm is proposed.The proposed MQSFL algorithm applies the theory of membrane computing and quantum computing to the shuffled frog leaping algorithm,which is an effective discrete optimization algorithm.Then the proposed MQSFL algorithm is used to solve the spectrum allocation problem of cognitive radio systems.By hybridizing the quantum frog colony optimization and membrane computing,the quantum state and observation state of the quantum frogs can be well evolved within the membrane structure.The novel spectrum allocation algorithm can search the global optimal solution within a reasonable computation time.Simulation results for three utility functions of a cognitive radio system are provided to show that the MQSFL spectrum allocation method is superior to some previous spectrum allocation algorithms based on intelligence computing.
基金supported by the National Natural Science Foundation of China(70871081)the Shanghai Leading Academic Discipline Project(S30504).
文摘The knapsack problem is a well-known combinatorial optimization problem which has been proved to be NP-hard. This paper proposes a new algorithm called quantum-inspired ant algorithm （QAA） to solve the knapsack problem. QAA takes the advantage of the principles in quantum computing, such as qubit, quantum gate, and quantum superposition of states, to get more probabilistic-based status with small colonies. By updating the pheromone in the ant algorithm and rotating the quantum gate, the algorithm can finally reach the optimal solution. The detailed steps to use QAA are presented, and by solving series of test cases of classical knapsack problems, the effectiveness and generality of the new algorithm are validated.
基金supported by the National Natural Science Foundation of China(61571149)the Special China Postdoctoral Science Foundation(2015T80325)+2 种基金the Heilongjiang Postdoctoral Fund(LBH-Z13054)the China Scholarship Council and the Fundamental Research Funds for the Central Universities(HEUCFP201772HEUCF160808)
文摘For acquiring high energy efficiency and the maximal throughput, a new time slot structure is designed for energy harvesting(EH) cognitive radio(CR). Considering the CR system with EH and cooperative relay, a best cooperative mechanism(BCM)is proposed for CR with EH. To get the optimal estimation performance, a quantum fireworks algorithm(QFA) is designed to resolve the difficulties of maximal throughput and EH, and the proposed cooperative mechanism is called as QFA-BCM. The proposed QFA combines the advantages of quantum computation theory with the fireworks algorithm(FA). Thus the QFA is able to obtain the optimal solution and its convergence performance is proved. By using the new cooperation mechanism and computing algorithm, the proposed QFA-BCM method can achieve comparable maximal throughput in the new timeslot structure. Simulation results have proved that the QFA-BCM method is superior to previous non-cooperative and cooperative mechanisms.
基金the National Natural Science Foundation of China (60773065).
文摘The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal. To solve this problem, a Grover searching algorithm based on weighted targets is proposed. First, each target is endowed a weight coefficient according to its importance. Applying these different weight coefficients, the targets are represented as quantum superposition states. Second, the novel Grover searching algorithm based on the quantum superposition of the weighted targets is constructed. Using this algorithm, the probability of getting each target can be approximated to the corresponding weight coefficient, which shows the flexibility of this algorithm. Finally, the validity of the algorithm is proved by a simple searching example.
基金Projects(61102106,61102105)supported by the National Natural Science Foundation of ChinaProject(2013M530148)supported by China Postdoctoral Science Foundation+1 种基金Project(HEUCF140809)supported by the Fundamental Research Funds for the Central Universities,ChinaProject(LBH-Z13054)supported by Heilongjiang Postdoctoral Fund,China
文摘In order to effectively solve combinatorial optimization problems,a membrane-inspired quantum bee colony optimization(MQBCO)is proposed for scientific computing and engineering applications.The proposed MQBCO algorithm applies the membrane computing theory to quantum bee colony optimization(QBCO),which is an effective discrete optimization algorithm.The global convergence performance of MQBCO is proved by Markov theory,and the validity of MQBCO is verified by testing the classical benchmark functions.Then the proposed MQBCO algorithm is used to solve decision engine problems of cognitive radio system.By hybridizing the QBCO and membrane computing theory,the quantum state and observation state of the quantum bees can be well evolved within the membrane structure.Simulation results for cognitive radio system show that the proposed decision engine method is superior to the traditional intelligent decision engine algorithms in terms of convergence,precision and stability.Simulation experiments under different communication scenarios illustrate that the balance between three objective functions and the adapted parameter configuration is consistent with the weights of three normalized objective functions.
