Combining the heuristic algorithm (HA) developed based on the specific knowledge of the cooperative multiple target attack (CMTA) tactics and the particle swarm optimization (PSO), a heuristic particle swarm opt...Combining the heuristic algorithm (HA) developed based on the specific knowledge of the cooperative multiple target attack (CMTA) tactics and the particle swarm optimization (PSO), a heuristic particle swarm optimization (HPSO) algorithm is proposed to solve the decision-making (DM) problem. HA facilitates to search the local optimum in the neighborhood of a solution, while the PSO algorithm tends to explore the search space for possible solutions. Combining the advantages of HA and PSO, HPSO algorithms can find out the global optimum quickly and efficiently. It obtains the DM solution by seeking for the optimal assignment of missiles of friendly fighter aircrafts (FAs) to hostile FAs. Simulation results show that the proposed algorithm is superior to the general PSO algorithm and two GA based algorithms in searching for the best solution to the DM problem.展开更多
To enhance the optimization ability of particle swarm algorithm, a novel quantum-inspired particle swarm optimization algorithm is proposed. In this method, the particles are encoded by the probability amplitudes of t...To enhance the optimization ability of particle swarm algorithm, a novel quantum-inspired particle swarm optimization algorithm is proposed. In this method, the particles are encoded by the probability amplitudes of the basic states of the multi-qubits system. The rotation angles of multi-qubits are determined based on the local optimum particle and the global optimal particle, and the multi-qubits rotation gates are employed to update the particles. At each of iteration, updating any qubit can lead to updating all probability amplitudes of the corresponding particle. The experimental results of some benchmark functions optimization show that, although its single step iteration consumes long time, the optimization ability of the proposed method is significantly higher than other similar algorithms.展开更多
This paper introduces the quantum control of Lyapunov functions based on the state distance, the mean of imaginary quantities and state errors.In this paper, the specific control laws under the three forms are given.S...This paper introduces the quantum control of Lyapunov functions based on the state distance, the mean of imaginary quantities and state errors.In this paper, the specific control laws under the three forms are given.Stability is analyzed by the La Salle invariance principle and the numerical simulation is carried out in a 2D test system.The calculation process for the Lyapunov function is based on a combination of the average of virtual mechanical quantities, the particle swarm algorithm and a simulated annealing algorithm.Finally, a unified form of the control laws under the three forms is given.展开更多
Among the bio-inspired techniques,PSO-based clustering algorithms have received special attention. An improved method named Particle Swarm Optimization (PSO) clustering algorithm based on cooperative evolution with mu...Among the bio-inspired techniques,PSO-based clustering algorithms have received special attention. An improved method named Particle Swarm Optimization (PSO) clustering algorithm based on cooperative evolution with multi-populations was presented. It adopts cooperative evolutionary strategy with multi-populations to change the mode of traditional searching optimum solutions. It searches the local optimum and updates the whole best position (gBest) and local best position (pBest) ceaselessly. The gBest will be passed in all sub-populations. When the gBest meets the precision,the evolution will terminate. The whole clustering process is divided into two stages. The first stage uses the cooperative evolutionary PSO algorithm to search the initial clustering centers. The second stage uses the K-means algorithm. The experiment results demonstrate that this method can extract the correct number of clusters with good clustering quality compared with the results obtained from other clustering algorithms.展开更多
Mapping of three-dimensional network on chip is a key problem in the research of three-dimensional network on chip. The quality of the mapping algorithm used di- rectly affects the communication efficiency between IP ...Mapping of three-dimensional network on chip is a key problem in the research of three-dimensional network on chip. The quality of the mapping algorithm used di- rectly affects the communication efficiency between IP cores and plays an important role in the optimization of power consumption and throughput of the whole chip. In this paper, ba- sic concepts and related work of three-dimensional network on chip are introduced. Quantum-behaved particle swarm op- timization algorithm is applied to the mapping problem of three-dimensional network on chip for the first time. Sim- ulation results show that the mapping algorithm based on quantum-behaved particle swarm algorithm has faster con- vergence speed with much better optimization performance compared with the mapping algorithm based on particle swarm algorithm. It also can effectively reduce the power consumption of mapping of three-dimensional network on chip.展开更多
Nowadays,succeeding safe communication and protection-sensitive data from unauthorized access above public networks are the main worries in cloud servers.Hence,to secure both data and keys ensuring secured data storag...Nowadays,succeeding safe communication and protection-sensitive data from unauthorized access above public networks are the main worries in cloud servers.Hence,to secure both data and keys ensuring secured data storage and access,our proposed work designs a Novel Quantum Key Distribution(QKD)relying upon a non-commutative encryption framework.It makes use of a Novel Quantum Key Distribution approach,which guarantees high level secured data transmission.Along with this,a shared secret is generated using Diffie Hellman(DH)to certify secured key generation at reduced time complexity.Moreover,a non-commutative approach is used,which effectively allows the users to store and access the encrypted data into the cloud server.Also,to prevent data loss or corruption caused by the insiders in the cloud,Optimized Genetic Algorithm(OGA)is utilized,which effectively recovers the data and retrieve it if the missed data without loss.It is then followed with the decryption process as if requested by the user.Thus our proposed framework ensures authentication and paves way for secure data access,with enhanced performance and reduced complexities experienced with the prior works.展开更多
为了提高网络入侵检测率,提出一种协同量子粒子群算法和最小二乘支持向量机的网络入侵检测模型(CQPSO-LSSVM)。将网络特征子集编码成量子粒子位置,入侵检测正确率作为特征子集优劣的评价标准,采用协同量子粒子群算法找到最优特征子集,...为了提高网络入侵检测率,提出一种协同量子粒子群算法和最小二乘支持向量机的网络入侵检测模型(CQPSO-LSSVM)。将网络特征子集编码成量子粒子位置,入侵检测正确率作为特征子集优劣的评价标准,采用协同量子粒子群算法找到最优特征子集,采用最小二乘支持向量机建立网络入侵检测模型,并采用KDD CUP 99数据集进行仿真测试。结果表明,CQPSO-LSSVM获得了比其他入侵检测模型更高的检测效率和检测率。展开更多
文摘Combining the heuristic algorithm (HA) developed based on the specific knowledge of the cooperative multiple target attack (CMTA) tactics and the particle swarm optimization (PSO), a heuristic particle swarm optimization (HPSO) algorithm is proposed to solve the decision-making (DM) problem. HA facilitates to search the local optimum in the neighborhood of a solution, while the PSO algorithm tends to explore the search space for possible solutions. Combining the advantages of HA and PSO, HPSO algorithms can find out the global optimum quickly and efficiently. It obtains the DM solution by seeking for the optimal assignment of missiles of friendly fighter aircrafts (FAs) to hostile FAs. Simulation results show that the proposed algorithm is superior to the general PSO algorithm and two GA based algorithms in searching for the best solution to the DM problem.
文摘To enhance the optimization ability of particle swarm algorithm, a novel quantum-inspired particle swarm optimization algorithm is proposed. In this method, the particles are encoded by the probability amplitudes of the basic states of the multi-qubits system. The rotation angles of multi-qubits are determined based on the local optimum particle and the global optimal particle, and the multi-qubits rotation gates are employed to update the particles. At each of iteration, updating any qubit can lead to updating all probability amplitudes of the corresponding particle. The experimental results of some benchmark functions optimization show that, although its single step iteration consumes long time, the optimization ability of the proposed method is significantly higher than other similar algorithms.
基金Project supported by the National Natural Science Foundation of China (Grant No.62176140)。
文摘This paper introduces the quantum control of Lyapunov functions based on the state distance, the mean of imaginary quantities and state errors.In this paper, the specific control laws under the three forms are given.Stability is analyzed by the La Salle invariance principle and the numerical simulation is carried out in a 2D test system.The calculation process for the Lyapunov function is based on a combination of the average of virtual mechanical quantities, the particle swarm algorithm and a simulated annealing algorithm.Finally, a unified form of the control laws under the three forms is given.
基金National Natural Science Foundation of China ( No.60873058)Science and Technology Project of Shandong Province of China (No.2009GG10001008)Soft Science Research Project, China (No.2009RKA285)
文摘Among the bio-inspired techniques,PSO-based clustering algorithms have received special attention. An improved method named Particle Swarm Optimization (PSO) clustering algorithm based on cooperative evolution with multi-populations was presented. It adopts cooperative evolutionary strategy with multi-populations to change the mode of traditional searching optimum solutions. It searches the local optimum and updates the whole best position (gBest) and local best position (pBest) ceaselessly. The gBest will be passed in all sub-populations. When the gBest meets the precision,the evolution will terminate. The whole clustering process is divided into two stages. The first stage uses the cooperative evolutionary PSO algorithm to search the initial clustering centers. The second stage uses the K-means algorithm. The experiment results demonstrate that this method can extract the correct number of clusters with good clustering quality compared with the results obtained from other clustering algorithms.
文摘Mapping of three-dimensional network on chip is a key problem in the research of three-dimensional network on chip. The quality of the mapping algorithm used di- rectly affects the communication efficiency between IP cores and plays an important role in the optimization of power consumption and throughput of the whole chip. In this paper, ba- sic concepts and related work of three-dimensional network on chip are introduced. Quantum-behaved particle swarm op- timization algorithm is applied to the mapping problem of three-dimensional network on chip for the first time. Sim- ulation results show that the mapping algorithm based on quantum-behaved particle swarm algorithm has faster con- vergence speed with much better optimization performance compared with the mapping algorithm based on particle swarm algorithm. It also can effectively reduce the power consumption of mapping of three-dimensional network on chip.
文摘Nowadays,succeeding safe communication and protection-sensitive data from unauthorized access above public networks are the main worries in cloud servers.Hence,to secure both data and keys ensuring secured data storage and access,our proposed work designs a Novel Quantum Key Distribution(QKD)relying upon a non-commutative encryption framework.It makes use of a Novel Quantum Key Distribution approach,which guarantees high level secured data transmission.Along with this,a shared secret is generated using Diffie Hellman(DH)to certify secured key generation at reduced time complexity.Moreover,a non-commutative approach is used,which effectively allows the users to store and access the encrypted data into the cloud server.Also,to prevent data loss or corruption caused by the insiders in the cloud,Optimized Genetic Algorithm(OGA)is utilized,which effectively recovers the data and retrieve it if the missed data without loss.It is then followed with the decryption process as if requested by the user.Thus our proposed framework ensures authentication and paves way for secure data access,with enhanced performance and reduced complexities experienced with the prior works.
基金Qingdao National Laboratory for Marine Science and Technology“Stretch Correction Research and Parallel implementation for Reverse-time migration of Multi-component Seismic Wave-field” (grant no.QNLM2016ORP0206)the Fundamental Research Funds for the Central UniversitiesBUCT“Research on Method of Elastic Vector Wave Field Imaging” (grant no.ZY1924)。
文摘为了提高网络入侵检测率,提出一种协同量子粒子群算法和最小二乘支持向量机的网络入侵检测模型(CQPSO-LSSVM)。将网络特征子集编码成量子粒子位置,入侵检测正确率作为特征子集优劣的评价标准,采用协同量子粒子群算法找到最优特征子集,采用最小二乘支持向量机建立网络入侵检测模型,并采用KDD CUP 99数据集进行仿真测试。结果表明,CQPSO-LSSVM获得了比其他入侵检测模型更高的检测效率和检测率。