Identifying influential spreaders in social networks: A two-stage quantum-behaved particle swarm optimization with Lévy flight

The influence maximization problem aims to select a small set of influential nodes, termed a seed set, to maximize their influence coverage in social networks. Although the methods that are based on a greedy strategy can obtain good accuracy, they come at the cost of enormous computational time, and are therefore not applicable to practical scenarios in large-scale networks. In addition, the centrality heuristic algorithms that are based on network topology can be completed in relatively less time. However, they tend to fail to achieve satisfactory results because of drawbacks such as overlapped influence spread. In this work, we propose a discrete two-stage metaheuristic optimization combining quantum-behaved particle swarm optimization with Lévy flight to identify a set of the most influential spreaders. According to the framework,first, the particles in the population are tasked to conduct an exploration in the global solution space to eventually converge to an acceptable solution through the crossover and replacement operations. Second, the Lévy flight mechanism is used to perform a wandering walk on the optimal candidate solution in the population to exploit the potentially unidentified influential nodes in the network. Experiments on six real-world social networks show that the proposed algorithm achieves more satisfactory results when compared to other well-known algorithms.

Integration of uniform design and quantum-behaved particle swarm optimization to the robust design for a railway vehicle suspension system under different wheel conicities and wheel rolling radii

This paper proposes a systematic method, integrating the uniform design (UD) of experiments and quantum-behaved particle swarm optimization (QPSO), to solve the problem of a robust design for a railway vehicle suspension system. Based on the new nonlinear creep model derived from combining Hertz contact theory, Kalker's linear theory and a heuristic nonlinear creep model, the modeling and dynamic analysis of a 24 degree-of-freedom railway vehicle system were investigated. The Lyapunov indirect method was used to examine the effects of suspension parameters, wheel conicities and wheel rolling radii on critical hunting speeds. Generally, the critical hunting speeds of a vehicle system resulting from worn wheels with different wheel rolling radii are lower than those of a vehicle system having original wheels without different wheel rolling radii. Because of worn wheels, the critical hunting speed of a running railway vehicle substantially declines over the long term. For safety reasons, it is necessary to design the suspension system parameters to increase the robustness of the system and decrease the sensitive of wheel noises. By applying UD and QPSO, the nominal-the-best signal-to-noise ratio of the system was increased from -48.17 to -34.05 dB. The rate of improvement was 29.31%. This study has demonstrated that the integration of UD and QPSO can successfully reveal the optimal solution of suspension parameters for solving the robust design problem of a railway vehicle suspension system.

A Novel Quantum-Behaved Particle Swarm Optimization Algorithm

The efficient management of ambulance routing for emergency requests is vital to save lives when a disaster occurs.Quantum-behaved Particle Swarm Optimization(QPSO)algorithm is a kind of metaheuristic algorithms applied to deal with the problem of scheduling.This paper analyzed the motion pattern of particles in a square potential well,given the position equation of the particles by solving the Schrödinger equation and proposed the Binary Correlation QPSO Algorithm Based on Square Potential Well(BC-QSPSO).In this novel algorithm,the intrinsic cognitive link between particles’experience information and group sharing information was created by using normal Copula function.After that,the control parameters chosen strategy gives through experiments.Finally,the simulation results of the test functions show that the improved algorithms outperform the original QPSO algorithm and due to the error gradient information will not be over utilized in square potential well,the particles are easy to jump out of the local optimum,the BC-QSPSO is more suitable to solve the functions with correlative variables.

A novel mapping algorithm for three-dimensional network on chip based on quantum-behaved particle swarm optimization

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.

Automatic Image Inspection of Fabric Defects Based on Optimal Gabor Filter

An effective method for automatic image inspection of fabric defects is presented. The proposed method relies on a tuned 2D-Gabor filter and quantum-behaved particle swarm optimization( QPSO) algorithm. The proposed method consists of two main steps:( 1) training and( 2) image inspection. In the image training process,the parameters of the 2D-Gabor filters can be tuned by QPSO algorithm to match with the texture features of a defect-free template. In the inspection process, each sample image under inspection is convoluted with the selected optimized Gabor filter.Then a simple thresholding scheme is applied to generating a binary segmented result. The performance of the proposed scheme is evaluated by using a standard fabric defects database from Cotton Incorporated. Good experimental results demonstrate the efficiency of proposed method. To further evaluate the performance of the proposed method,a real time test is performed based on an on-line defect detection system. The real time test results further demonstrate the effectiveness, stability and robustness of the proposed method,which is suitable for industrial production.

一种基于QPSO-RVM的模拟电路故障预测方法

提出了一种可应用于模拟电路故障预测的方法。通过提取被测电路的频域响应信号,计算皮尔逊相关系数,从而表征电路元件的健康度;在获取元件在不同时间点的健康度数据的基础上,推导出电路元件发生故障时的健康度阈值;将经量子粒子群算法优化的相关向量机算法用于故障预测,预测各个时间点的元件健康度变化轨迹并估计模拟电路的剩余有用寿命。该预测方法计算简单、通用性强,适用于实时预测。故障预测仿真实验与实例实验证明了方法的有效性与先进性。

Dynamic compensation and its application of shock wave pressure sensor

In order to correct the test error caused by the dynamic characteristics of pressure sensor and avoid the influence of the error of sensor＇s dynamic model on compensation results,a dynamic compensation method of the pressure sensor is presented,which is based on quantum-behaved particle swarm optimization（QPSO）algorithm and the mean square error（MSE）.By using this method,the inverse model of the sensor is built and optimized and then the coefficients of the optimal compensator are got.This method is verified by the dynamic calibration with shock tube and the dynamic characteristics of the sensor before and after compensation are analyzed in time domain and frequency domain.The results show that the working bandwidth of the sensor is extended effectively.This method can reduce dynamic measuring error and improve test accuracy in actual measurement experiments.

DESIGN OF DIGITAL IMPACTING FILTER IN CP-EBPSK WITH RANDOM-POLAR COMMUNICATION SYSTEM

To solve the difficulty of designing digital impacting filter in the receiver of random-polar modulated Extended Binary Phase Shift Keying with Continuous Phase (CP-EBPSK), a design method based on Quantum-behaved Particle Swarm Optimization (QPSO) algorithm is proposed. Firstly, QPSO is introduced elaborately, and the basic flow of QPSO is also given. Then, the demodulation principle of digital impacting filter in the communication system of CP-EBPSK with random-polar is demonstrated, and QPSO is utilized to design the digital impacting filter, which also takes the effect of finite word length into consideration when implemented by hardware. Finally, the proposed method is simulated. Simulation results show that the digital impacting filter designed by new method can derive satisfied demodulation performance.

Classification of Abandoned Areas for Solar Energy Projects Using Artificial Intelligence and Quantum Mechanics

The increasing demand for energy has intensified recently, requiring alternative sources to fossil fuels, which have become economically and environmentally unfeasible. On the other hand, the increasing land occupation in recent centuries is a growing problem, demanding greater efficiency, particularly in the reuse of abandoned areas, which has become an alternative. An interesting alternative would be installing energy facilities like solar, wind, biomass, and geothermal, in these areas. The objective of this paper is to develop a classification methodology, based on Artificial Intelligence (AI) and Quantum Theory (QT), to automatically carry out the classification of abandoned areas suitable for the settlement of these power plants. Artificial Neural Networks (ANNs) improved by the hybrid algorithm Quantum-behaved Particle Swarm Optimization (QPSO) together with the Levenberg-Marquardt Algorithm (LMA) were used for the classification task. In terms of Mean Squared Error (MSE), the QPSO-LMA approach achieved a decrease of 19.6% in relation to the classical LMA training with random initial weights. Moreover, the model’s accuracy showed an increase of 7.3% for the QPSO-LMA over the LMA. To validate this new approach, it was also tested on six different datasets available in the UCI Machine Learning Repository and seven classical techniques established in the literature. For the problem of installing photovoltaic plants in abandoned areas, the knowledge acquired with the solar dataset can be extrapolated to other regions.

A Surface-Simplex Swarm Evolution Algorithm

In the paper,a particle surface-simplex search（PSSS） is designed based on particle surface-simplex and particle surface-simplex neighborhood.Using PSSS and an evolutionary strategy of multi-states swarm,a surface-simplex swarm evolution（SSSE） algorithm for numerical optimization is proposed.In the experiments,SSSE is applied to solve 17 benchmark problems and compared with the other intelligent optimization algorithms.In the application,SSSE is used to analyze the three intrinsic independent components of gravity earth tide.The results demonstrate that SSSE can accurately find optima or close-to-optimal solutions of the complex functions with high-dimension.The performance of SSSE is stable and efficient.

A hybrid multi-objective PSO algorithm with local search strategy for VLSI partitioning

Very large scale integration （VLSI） circuit par- titioning is an important problem in design automation of VLSI chips and multichip systems; it is an NP-hard combi- national optimization problem. In this paper, an effective hy- brid multi-objective partitioning algorithm, based on discrete particle swarm optimzation （DPSO） with local search strat- egy, called MDPSO-LS, is presented to solve the VLSI two- way partitioning with simultaneous cutsize and circuit delay minimization. Inspired by the physics of genetic algorithm, uniform crossover and random two-point exchange operators are designed to avoid the case of generating infeasible so- lutions. Furthermore, the phenotype sharing function of the objective space is applied to circuit partitioning to obtain a better approximation of a true Pareto front, and the theorem of Markov chains is used to prove global convergence. To improve the ability of local exploration, Fiduccia-Matteyses （FM） strategy is also applied to further improve the cutsize of each particle, and a local search strategy for improving circuit delay objective is also designed. Experiments on IS- CAS89 benchmark circuits show that the proposed algorithm is efficient.