Search

The feature graph (Q-H graph) is the best way to intuitively and quantitatively reflect all features of the ventilation network. In this paper, an optimized adaptive genetic algorithm is proposed to solve the problem that rectangular blocks are cut in the process of drawing a Q-H diagram of a three-dimensional ventilation network. The algorithm adopts binary coding based on node sorting and mixed genetic coding based on integer coding. The formulas for calculating the adaptive crossover rate and mutation rate are designed, which can effectively generate new individuals and get rid of the search for local optimal values, ensuring the global optimal solution. Matlab was used to test the optimization effect of the Q-H graph; the results show that, for a complex ventilation network, the improved adaptive genetic algorithm can make the Q-H graph significantly reduce the number of rectangular pieces, which is divided, and make the Q-H graph have better effect to draw clearly and intuitively. [ABSTRACT FROM AUTHOR]

The improved particle filter (PF) based on the geometric center and likelihood estimation is proposed in order to solve the problem of particle dilution and degradation. In the resampling stage, the geometric center is used to resample the particles. The particles are filtered according to the distance between the particles and the geometric center, and then the particles are resampled. The resampled particles are composed of newborn particles and non-resampled particles. The former can help alleviate the degradation problem, while the latter can keep the diversity of the particle set. In order to ensure effectiveness of the PF, the positioning error threshold of the particle filter is introduced. In the phase of particle weighting calculation, in view of the problem of low accuracy and divergence of PF state estimation caused by non-stationary and non-Gaussian noise, it adopts non-Gaussian noise parameter estimation based on likelihood to approximately estimate the measurement noise instead of the Gaussian density function. The proposed model is applied to particle weight calculation to avoid particle degradation caused by Gaussian density function approximation. The simulation results show that, after the improved algorithm, the root-mean-square error is reduced to 0.085, the variance is reduced to 0.014, and the running time is shortened by 14.8% compared with the polynomial resampling algorithm, which can effectively alleviate particle degradation and dilution in the traditional PF algorithm, and the positioning accuracy is also improved. [ABSTRACT FROM AUTHOR]

Active noise control algorithms aimed at reducing Gaussian noise have been studied. However, the performance of these algorithms can deteriorate if impulsive noise or other non-Gaussian noise such as piling noise exists. To solve this problem, an algorithm named the filtered-x affine projection sign algorithm with a post-adaptive filter is proposed to reduce impulsive noise. The proposed algorithm is based on the filtered-x affine projection sign algorithm and the post-adaptive filter structure. In addition, an algorithm with a variable step size is proposed to improve the performance of the filtered-x affine projection sign algorithm with a post-adaptive filter by using a convex combination strategy. The fixed step size in the convex combination is replaced with a linear function of the ratio between the estimated error signal and the estimated desired signal. The detailed derivation processes of the proposed algorithms are given. The computational complexities are analyzed. Numerical simulations are carried out to demonstrate the performance of the proposed algorithms. The results illustrate that the proposed algorithms can effectively reduce impulsive noise. At the same time, the algorithm with a variable step size has better convergence performance than the filtered-x affine projection sign algorithm with a post-adaptive filter. [ABSTRACT FROM AUTHOR]

Quantum algorithms offer efficient solutions to computational problems that are expensive to solve classically. Publicly available quantum computers, such as those provided by IBM, can now be used to run small quantum circuits that execute quantum algorithms. However, these quantum computers are highly prone to noise. Here, we introduce important concepts of quantum circuit noise and connectivity that must be addressed to obtain reliable results on quantum computers. We utilize several examples to show how noise scales with circuit depth. We present Simon's algorithm, a quantum algorithm for solving a computational problem of the same name, explain how to implement it in IBM's Qiskit platform, and compare the results of running it both on a noiseless simulator and on physical hardware subject to noise. We discuss the impact of Qiskit's transpiler, which adapts ideal quantum circuits for physical hardware with limited connectivity between qubits. We show that even circuits of only a few qubits can have their success rate significantly reduced by quantum noise unless specific measures are taken to minimize its impact. [ABSTRACT FROM AUTHOR]