Vibration Suppression for Active Magnetic Bearings Using Adaptive Filter with Iterative Search Algorithm

Active Magnetic Bearing(AMB) is a kind of electromagnetic support that makes the rotor movement frictionless and can suppress rotor vibration by controlling the magnetic force. The most common approach to restrain the rotor vibration in AMBs is to adopt a notch filter or adaptive filter in the AMB controller. However, these methods cannot obtain the precise amplitude and phase of the compensation current. Thus, they are not so effective in terms of suppressing the vibrations of the fundamental and other harmonic orders over the whole speed range. To improve the vibration suppression performance of AMBs,an adaptive filter based on Least Mean Square(LMS) is applied to extract the vibration signals from the rotor displacement signal. An Iterative Search Algorithm(ISA) is proposed in this paper to obtain the corresponding relationship between the compensation current and vibration signals. The ISA is responsible for searching the compensating amplitude and shifting phase online for the LMS filter, enabling the AMB controller to generate the corresponding compensation force for vibration suppression. The results of ISA are recorded to suppress vibration using the Look-Up Table(LUT) in variable speed range. Comprehensive simulations and experimental validations are carried out in fixed and variable speed range, and the results demonstrate that by employing the ISA, vibrations of the fundamental and other harmonic orders are suppressed effectively.

An Iterated Greedy Algorithm with Memory and Learning Mechanisms for the Distributed Permutation Flow Shop Scheduling Problem

The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because of its straightforward,single-solution evolution framework.However,a potential draw-back of IGA is the lack of utilization of historical information,which could lead to an imbalance between exploration and exploitation,especially in large-scale DPFSPs.As a consequence,this paper develops an IGA with memory and learning mechanisms(MLIGA)to efficiently solve the DPFSP targeted at the mini-malmakespan.InMLIGA,we incorporate a memory mechanism to make a more informed selection of the initial solution at each stage of the search,by extending,reconstructing,and reinforcing the information from previous solutions.In addition,we design a twolayer cooperative reinforcement learning approach to intelligently determine the key parameters of IGA and the operations of the memory mechanism.Meanwhile,to ensure that the experience generated by each perturbation operator is fully learned and to reduce the prior parameters of MLIGA,a probability curve-based acceptance criterion is proposed by combining a cube root function with custom rules.At last,a discrete adaptive learning rate is employed to enhance the stability of the memory and learningmechanisms.Complete ablation experiments are utilized to verify the effectiveness of the memory mechanism,and the results show that this mechanism is capable of improving the performance of IGA to a large extent.Furthermore,through comparative experiments involving MLIGA and five state-of-the-art algorithms on 720 benchmarks,we have discovered that MLI-GA demonstrates significant potential for solving large-scale DPFSPs.This indicates that MLIGA is well-suited for real-world distributed flow shop scheduling.

Research on Euclidean Algorithm and Reection on Its Teaching

In this paper,we prove that Euclid's algorithm,Bezout's equation and Divi-sion algorithm are equivalent to each other.Our result shows that Euclid has preliminarily established the theory of divisibility and the greatest common divisor.We further provided several suggestions for teaching.

DDoS Attack Autonomous Detection Model Based on Multi-Strategy Integrate Zebra Optimization Algorithm

Previous studies have shown that deep learning is very effective in detecting known attacks.However,when facing unknown attacks,models such as Deep Neural Networks(DNN)combined with Long Short-Term Memory(LSTM),Convolutional Neural Networks(CNN)combined with LSTM,and so on are built by simple stacking,which has the problems of feature loss,low efficiency,and low accuracy.Therefore,this paper proposes an autonomous detectionmodel for Distributed Denial of Service attacks,Multi-Scale Convolutional Neural Network-Bidirectional Gated Recurrent Units-Single Headed Attention(MSCNN-BiGRU-SHA),which is based on a Multistrategy Integrated Zebra Optimization Algorithm(MI-ZOA).The model undergoes training and testing with the CICDDoS2019 dataset,and its performance is evaluated on a new GINKS2023 dataset.The hyperparameters for Conv_filter and GRU_unit are optimized using the Multi-strategy Integrated Zebra Optimization Algorithm(MIZOA).The experimental results show that the test accuracy of the MSCNN-BiGRU-SHA model based on the MIZOA proposed in this paper is as high as 0.9971 in the CICDDoS 2019 dataset.The evaluation accuracy of the new dataset GINKS2023 created in this paper is 0.9386.Compared to the MSCNN-BiGRU-SHA model based on the Zebra Optimization Algorithm(ZOA),the detection accuracy on the GINKS2023 dataset has improved by 5.81%,precisionhas increasedby 1.35%,the recallhas improvedby 9%,and theF1scorehas increasedby 5.55%.Compared to the MSCNN-BiGRU-SHA models developed using Grid Search,Random Search,and Bayesian Optimization,the MSCNN-BiGRU-SHA model optimized with the MI-ZOA exhibits better performance in terms of accuracy,precision,recall,and F1 score.

Method for Estimating the State of Health of Lithium-ion Batteries Based on Differential Thermal Voltammetry and Sparrow Search Algorithm-Elman Neural Network

Precisely estimating the state of health(SOH)of lithium-ion batteries is essential for battery management systems(BMS),as it plays a key role in ensuring the safe and reliable operation of battery systems.However,current SOH estimation methods often overlook the valuable temperature information that can effectively characterize battery aging during capacity degradation.Additionally,the Elman neural network,which is commonly employed for SOH estimation,exhibits several drawbacks,including slow training speed,a tendency to become trapped in local minima,and the initialization of weights and thresholds using pseudo-random numbers,leading to unstable model performance.To address these issues,this study addresses the challenge of precise and effective SOH detection by proposing a method for estimating the SOH of lithium-ion batteries based on differential thermal voltammetry(DTV)and an SSA-Elman neural network.Firstly,two health features(HFs)considering temperature factors and battery voltage are extracted fromthe differential thermal voltammetry curves and incremental capacity curves.Next,the Sparrow Search Algorithm(SSA)is employed to optimize the initial weights and thresholds of the Elman neural network,forming the SSA-Elman neural network model.To validate the performance,various neural networks,including the proposed SSA-Elman network,are tested using the Oxford battery aging dataset.The experimental results demonstrate that the method developed in this study achieves superior accuracy and robustness,with a mean absolute error(MAE)of less than 0.9%and a rootmean square error(RMSE)below 1.4%.

Grid-Connected/Islanded Switching Control Strategy for Photovoltaic Storage Hybrid Inverters Based on Modified Chimpanzee Optimization Algorithm

Uneven power distribution,transient voltage,and frequency deviations are observed in the photovoltaic storage hybrid inverter during the switching between grid-connected and island modes.In response to these issues,this paper proposes a grid-connected/island switching control strategy for photovoltaic storage hybrid inverters based on the modified chimpanzee optimization algorithm.The proposed strategy incorporates coupling compensation and power differentiation elements based on the traditional droop control.Then,it combines the angular frequency and voltage amplitude adjustments provided by the phase-locked loop-free pre-synchronization control strategy.Precise pre-synchronization is achieved by regulating the virtual current to zero and aligning the photovoltaic storage hybrid inverter with the grid voltage.Additionally,two novel operators,learning and emotional behaviors are introduced to enhance the optimization precision of the chimpanzee algorithm.These operators ensure high-precision and high-reliability optimization of the droop control parameters for photovoltaic storage hybrid inverters.A Simulink model was constructed for simulation analysis,which validated the optimized control strategy’s ability to evenly distribute power under load transients.This strategy effectively mitigated transient voltage and current surges during mode transitions.Consequently,seamless and efficient switching between gridconnected and island modes was achieved for the photovoltaic storage hybrid inverter.The enhanced energy utilization efficiency,in turn,offers robust technical support for grid stability.

An iterative curvelet thresholding algorithm for seismic random noise attenuation

In this paper,we explore the use of iterative curvelet thresholding for seismic random noise attenuation.A new method for combining the curvelet transform with iterative thresholding to suppress random noise is demonstrated and the issue is described as a linear inverse optimal problem using the L1 norm.Random noise suppression in seismic data is transformed into an L1 norm optimization problem based on the curvelet sparsity transform. Compared to the conventional methods such as median filter algorithm,FX deconvolution, and wavelet thresholding,the results of synthetic and field data processing show that the iterative curvelet thresholding proposed in this paper can sufficiently improve signal to noise radio（SNR） and give higher signal fidelity at the same time.Furthermore,to make better use of the curvelet transform such as multiple scales and multiple directions,we control the curvelet direction of the result after iterative curvelet thresholding to further improve the SNR.

An enhanced iterative joint channel estimation and symbol detection algorithm for OFDM systems

For orthogonal frequency division multiplexing (OFDM) wireless communication, the system throughput and data rate are usually limited by pilots, especially in a high mobility environment. In this paper, an enhanced iterative joint channel estimation and symbol detection algorithm is proposed to enhance the system throughput and data rate. With lower pilot power, the proposed scheme increases system throughput firstly, and then the channel estimation and symbol detection proceed iteratively within one OFDM symbol to improve the BER performance. In the proposed algorithm, the original channel estimate of each OFDM symbol is based on the channel estimate of the previous OFDM symbol, thus the variation of the mobile channel is traced efficiently, so the number of pilots in the time domain can be reduced greatly. Besides reducing the system overhead, the proposed algorithm is also shown by simulation to give much better BER performance than the conventional iterative algorithm does.

Dimension-down iterative algorithm for the mixed transportation network design problem

An optimal dimension-down iterative algorithm （DDIA） is proposed for solving a mixed （continuous/ discrete） transportation network design problem （MNDP）, which is generally expressed as a mathematical programming with equilibrium constraints （MPEC）. The upper level of the MNDP aims to optimize the network performance via both the expansion of existing links and the addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium （UE） model. The idea of the proposed DDIA is to reduce the dimensions of the problem. A group of variables （discrete/continuous） are fixed to altemately optimize another group of variables （continuous/discrete）. Some continuous network design problems （CNDPs） and discrete network design problems （DNDPs） are solved repeatedly until the optimal solution is obtained. A numerical example is given to demonstrate the efficiency of the proposed algorithm.

Low complexity iterative differential decoding algorithm for multiband UWB communication systems

Due to not requiring channel state information （CSI） at both the transmitter and the receiver, noncoherent ultra-wideband （UWB） incurs a performance penalty of approximately 3 dB in the required signal to noise ratio （SNR） compared to the coherent case. To overcome the gap, an effective differential encoding and decoding scheme for multiband UWB systems is proposed. The proposed scheme employs the parallel concatenation of two recursive differential unitary space-frequency encoders at the transmitter. At the receiver, two component decoders iteratively decode information bits by interchanging soft metric values between each other. To reduce the computation complexity, a decoding algorithm which only uses transition probability to calculate the log likelihood ratios （LLRs） for the decoded bits is given. Simulation results show that the proposed scheme can dramatically outperform the conventional differential and even coherent detection at high SNR with a few iterations.

A Correntropy-based Affine Iterative Closest Point Algorithm for Robust Point Set Registration

The iterative closest point(ICP)algorithm has the advantages of high accuracy and fast speed for point set registration,but it performs poorly when the point set has a large number of noisy outliers.To solve this problem,we propose a new affine registration algorithm based on correntropy which works well in the affine registration of point sets with outliers.Firstly,we substitute the traditional measure of least squares with a maximum correntropy criterion to build a new registration model,which can avoid the influence of outliers.To maximize the objective function,we then propose a robust affine ICP algorithm.At each iteration of this new algorithm,we set up the index mapping of two point sets according to the known transformation,and then compute the closed-form solution of the new transformation according to the known index mapping.Similar to the traditional ICP algorithm,our algorithm converges to a local maximum monotonously for any given initial value.Finally,the robustness and high efficiency of affine ICP algorithm based on correntropy are demonstrated by 2D and 3D point set registration experiments.

An Iterative Compensation Algorithm for Springback Control in Plane Deformation and Its Application

In order to solve the springback problem in sheet metal forming, the trial and error method is a widely used method in the factory, which is time-consuming and costly for its non-direction and non-quantitative. Finite element simulation is an e ective method to predict the springback of complex shape parts, but its precision is sensitive to the simulation model, particularly material model and boundary conditions. In this paper, the simple iterative method is introduced to establish the iterative compensation algorithm, and the convergence criterion of iterative parameters is put forward. In addition, the new algorithm is applied to the V-free bending and stretch-bending processes, and the convergence of curvature and bending angle is proved theoretically and verified experimentally. At the same time,the iterative compensation experiments for plane bending show that, the new method can predict the next compensaantido tnh ev atlaureg ebta cseurdv oatnu trhe ew sitphri tnhgeb earcrko ro fo fe laecshs ttehsat,n s0 o. 5 th%a ta rteh eo btatraigneet db aefntedri n2 g-3 a nitgelrea tiwoitnhs.t Thhei se rrreosre aorf clhe sps rtohpaons e±s 0 a.1%new iterative compensation algorithm to predict springback in sheet metal forming process, where each compensation value depends only on the iteration parameter di erence before and after springback for the same forming process of same material.

SOME NEW ITERATIVE ALGORITHMS FOR MONOTONE MIXED VARIATIONAL INEQUALITIES

In this paper,some new iterative algorithms for monotone mixed variational inequalities and the convergence in real Hilbert spaces are studied.

ITERATIVE ALGORITHM FOR AXIALLY ACCELERATING STRINGS WITH INTEGRAL CONSTITUTIVE LAW

A numerical method is proposed to simulate the transverse vibrations of a viscoelastic moving string constituted by an integral law. In the numerical computation, the Galerkin method based on the Hermite functions is applied to discretize the state variables, and the Runge- Kutta method is applied to solve the resulting differential-integral equation system. A linear iterative process is designed to compute the integral terms at each time step, which makes the numerical method more efficient and accurate. As examples, nonlinear parametric vibrations of an axially moving viscoelastic string are analyzed.

Iterative Learning Fault Diagnosis Algorithm for Non-uniform Sampling Hybrid System

For a class of non-uniform output sampling hybrid system with actuator faults and bounded disturbances,an iterative learning fault diagnosis algorithm is proposed.Firstly,in order to measure the impact of fault on system between every consecutive output sampling instants,the actual fault function is transformed to obtain an equivalent fault model by using the integral mean value theorem,then the non-uniform sampling hybrid system is converted to continuous systems with timevarying delay based on the output delay method.Afterwards,an observer-based fault diagnosis filter with virtual fault is designed to estimate the equivalent fault,and the iterative learning regulation algorithm is chosen to update the virtual fault repeatedly to make it approximate the actual equivalent fault after some iterative learning trials,so the algorithm can detect and estimate the system faults adaptively.Simulation results of an electro-mechanical control system model with different types of faults illustrate the feasibility and effectiveness of this algorithm.

Iterative Learning Control Algorithm with a Fixed Step

Iterative Learning Control （ILC） captures interests of many scholars because of its capability of high precision control implement without identifying plant mathematical models, and it is widely applied in control engineering. Presently, most ILC algorithms still follow the original ideas of ARIMOTO, in which the iterative-learning-rate is composed by the control error with its derivative and integral values. This kind of algorithms will result in inevitable problems such as huge computation, big storage capacity for algorithm data, and also weak robust. In order to resolve these problems, an improved iterative learning control algorithm with fixed step is proposed here which breaks the primary thought of ARIMOTO. In this algorithm, the control step is set only according to the value of the control error, which could enormously reduce the computation and storage size demanded, also improve the robust of the algorithm by not using the differential coefficient of the iterative learning error. In this paper, the convergence conditions of this proposed fixed step iterative learning algorithm is theoretically analyzed and testified. Then the algorithm is tested through simulation researches on a time-variant object with randomly set disturbance through calculation of step threshold value, algorithm robustness testing,and evaluation of the relation between convergence speed and step size. Finally the algorithm is validated on a valve-serving-cylinder system of a joint robot with time-variant parameters. Experiment results demonstrate the stability of the algorithm and also the relationship between step value and convergence rate. Both simulation and experiment testify the feasibility and validity of the new algorithm proposed here. And it is worth to noticing that this algorithm is simple but with strong robust after improvements, which provides new ideas to the research of iterative learning control algorithms.

Non-enhanced Low-tube-voltage High-pitch Dual-source Computed Tomography with Sinogram Affirmed Iterative Reconstruction Algorithm of the Abdomen and Pelvis

Objective To investigate the image quality, radiation dose and diagnostic value of the low-tube-voltage high-pitch dual-source computed tomography(DSCT) with sinogram affirmed iterative reconstruction(SAFIRE) for non-enhanced abdominal and pelvic scans. Methods This institutional review board-approved prospective study included 64 patients who gave written informed consent for additional abdominal and pelvic scan with DSCT in the period from November to December 2012. The patients underwent standard non-enhanced CT scans(protocol 1) [tube voltage of 120 k Vp/pitch of 0.9/filtered back-projection(FBP) reconstruction] followed by high-pitch non-enhanced CT scans(protocol 2)(100 k Vp/3.0/SAFIRE). The total scan time, mean CT number, signal-to-noise ratio(SNR), image quality, lesion detectability and radiation dose were compared between the two protocols. Results The total scan time of protocol 2 was significantly shorter than that of protocol 1(1.4±0.1 seconds vs. 7.6±0.6 seconds, P<0.001). There was no significant difference between protocol 1 and protocol 2 in mean CT number of all organs(liver, 55.4±6.3 HU vs. 56.1±6.8 HU, P=0.214; pancreas, 43.6±5.9 HU vs. 43.7±5.8 HU, P=0.785; spleen, 47.9±3.9 HU vs. 49.4±4.3 HU, P=0.128; kidney, 32.2±2.3 HU vs. 33.1±2.3 HU, P=0.367; abdominal aorta, 44.8±5.6 HU vs. 45.0±5.5 HU, P=0.499; psoas muscle, 50.7±4.1 HU vs. 50.3±4.5 HU, P=0.279). SNR on images of protocol 2 was higher than that of protocol 1(liver, 5.0±1.2 vs. 4.5±1.1, P<0.001; pancreas, 4.0±1.0 vs. 3.6±0.8, P<0.001; spleen, 4.7±1.0 vs. 4.1±0.9, P<0.001; kidney, 3.1±0.6 vs. 2.8±0.6, P<0.001; abdominal aorta, 4.1±1.0 vs. 3.8±1.0, P<0.001; psoas muscle, 4.5±1.1 vs. 4.3±1.2, P=0.012). The overall image noise of protocol 2 was lower than that of protocol1(9.8±3.1 HU vs. 11.1±3.0 HU, P<0.001). Image quality of protocol 2 was good but lower than that of protocol 1(4.1±0.7 vs. 4.6±0.5, P<0.001). Protocol 2 perceived 229 of 234 lesions(97.9%) that were detected in protocol 1 in the abdomen and pelvis. Radiation dose of protocol 2 was lower than that of protocol 1(4.4±0.4 m Sv vs. 7.3±2.4 m Sv, P<0.001) and the mean dose reduction was 41.4%. Conclusion The high-pitch DSCT with SAFIRE can shorten scan time and reduce radiation dose while preserving image quality in non-enhanced abdominal and pelvic scans.

Improved gradient iterative algorithms for solving Lyapunov matrix equations

In this paper, an improved gradient iterative （GI） algorithm for solving the Lyapunov matrix equations is studied. Convergence of the improved method for any initial value is proved with some conditions. Compared with the GI algorithm, the improved algorithm reduces computational cost and storage. Finally, the algorithm is tested with GI several numerical examples.

Jointly-check iterative decoding algorithm for quantum sparse graph codes

For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms standard BP algorithm with an obvious performance improvement.

Comparison between iterative wavefront control algorithm and direct gradient wavefront control algorithm for adaptive optics system

Among all kinds of wavefront control algorithms in adaptive optics systems, the direct gradient wavefront control algorithm is the most widespread and common method. This control algorithm obtains the actuator voltages directly from wavefront slopes through pre-measuring the relational matrix between deformable mirror actuators and Hartmann wavefront sensor with perfect real-time characteristic and stability. However, with increasing the number of sub-apertures in wavefront sensor and deformable mirror actuators of adaptive optics systems, the matrix operation in direct gradient algorithm takes too much time, which becomes a major factor influencing control effect of adaptive optics systems. In this paper we apply an iterative wavefront control algorithm to high-resolution adaptive optics systems, in which the voltages of each actuator are obtained through iteration arithmetic, which gains great advantage in calculation and storage. For AO system with thousands of actuators, the computational complexity estimate is about O(n2) ～ O(n3) in direct gradient wavefront control algorithm, while the computational complexity estimate in iterative wavefront control algorithm is about O(n) ～(O(n)3/2), in which n is the number of actuators of AO system. And the more the numbers of sub-apertures and deformable mirror actuators, the more significant advantage the iterative wavefront control algorithm exhibits.