Self-adaptive PID controller of microwave drying rotary device tuning on-line by genetic algorithms

The control design, based on self-adaptive PID with genetic algorithms(GA) tuning on-line was investigated, for the temperature control of industrial microwave drying rotary device with the multi-layer(IMDRDWM) and with multivariable nonlinear interaction of microwave and materials. The conventional PID control strategy incorporated with optimization GA was put forward to maintain the optimum drying temperature in order to keep the moisture content below 1%, whose adaptation ability included the cost function of optimization GA according to the output change. Simulations on five different industrial process models and practical temperature process control system for selenium-enriched slag drying intensively by using IMDRDWM were carried out systematically, indicating the reliability and effectiveness of control design. The parameters of proposed control design are all on-line implemented without iterative predictive calculations, and the closed-loop system stability is guaranteed, which makes the developed scheme simpler in its synthesis and application, providing the practical guidelines for the control implementation and the parameter design.

Acid-pickling plates and strips speed control system by microwave heating based on self-adaptive fuzzy PID algorithm

Double self-adaptive fuzzy PID algorithm-based control strategy was proposed to construct quasi-cascade control system to control the speed of the acid-pickling process of titanium plates and strips. It is very useful in overcoming non-linear dynamic behavior, uncertain and time-varying parameters, un-modeled dynamics, and couples between the automatic turbulence control (ATC) and the automatic acid temperature control (AATC) with varying parameters during the operation process. The quasi-cascade control system of inner and outer loop self-adaptive fuzzy PID controller was built, which could effectively control the pickling speed of plates and strips. The simulated results and real application indicate that the plates and strips acid pickling speed control system has good performances of adaptively tracking the parameter variations and anti-disturbances, which ensures the match of acid pickling temperature and turbulence of flowing with acid pickling speed, improving the surface quality of plates and strips acid pickling, and energy efficiency.

Unfolding neutron spectra from water-pumping-injection multilayered concentric sphere neutron spectrometer using self-adaptive differential evolution algorithm

A self-adaptive differential evolution neutron spectrum unfolding algorithm(SDENUA)is established in this study to unfold the neutron spectra obtained from a water-pumping-injection multilayered concentric sphere neutron spectrometer(WMNS).Specifically,the neutron fluence bounds are estimated to accelerate the algorithm convergence,and the minimum error between the optimal solution and input neutron counts with relative uncertainties is limited to 10^(-6)to avoid unnecessary calculations.Furthermore,the crossover probability and scaling factor are self-adaptively controlled.FLUKA Monte Carlo is used to simulate the readings of the WMNS under(1)a spectrum of Cf-252 and(2)its spectrum after being moderated,(3)a spectrum used for boron neutron capture therapy,and(4)a reactor spectrum.Subsequently,the measured neutron counts are unfolded using the SDENUA.The uncertainties of the measured neutron count and the response matrix are considered in the SDENUA,which does not require complex parameter tuning or an a priori default spectrum.The results indicate that the solutions of the SDENUA agree better with the IAEA spectra than those of MAXED and GRAVEL in UMG 3.1,and the errors of the final results calculated using the SDENUA are less than 12%.The established SDENUA can be used to unfold spectra from the WMNS.

An improved self-adaptive membrane computing optimization algorithm and its applications in residue hydrogenating model parameter estimation

In order to solve the non-linear and high-dimensional optimization problems more effectively, an improved self-adaptive membrane computing(ISMC) optimization algorithm was proposed. The proposed ISMC algorithm applied improved self-adaptive crossover and mutation formulae that can provide appropriate crossover operator and mutation operator based on different functions of the objects and the number of iterations. The performance of ISMC was tested by the benchmark functions. The simulation results for residue hydrogenating kinetics model parameter estimation show that the proposed method is superior to the traditional intelligent algorithms in terms of convergence accuracy and stability in solving the complex parameter optimization problems.

Enhanced self-adaptive evolutionary algorithm for numerical optimization

There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced self-adaptiveevolutionary algorithm （ESEA） to overcome the demerits above. In the ESEA, four evolutionary operators are designed to enhance the evolutionary structure. Besides, the ESEA employs four effective search strategies under the framework of the self-adaptive learning. Four groups of the experiments are done to find out the most suitable parameter values for the ESEA. In order to verify the performance of the proposed algorithm, 26 state-of-the-art test functions are solved by the ESEA and its competitors. The experimental results demonstrate that the universality and robustness of the ESEA out-perform its competitors.

Modified Self-adaptive Immune Genetic Algorithm for Optimization of Combustion Side Reaction of p-Xylene Oxidation

In recent years, immune genetic algorithm (IGA) is gaining popularity for finding the optimal solution for non-linear optimization problems in many engineering applications. However, IGA with deterministic mutation factor suffers from the problem of premature convergence. In this study, a modified self-adaptive immune genetic algorithm (MSIGA) with two memory bases, in which immune concepts are applied to determine the mutation parameters, is proposed to improve the searching ability of the algorithm and maintain population diversity. Performance comparisons with other well-known population-based iterative algorithms show that the proposed method converges quickly to the global optimum and overcomes premature problem. This algorithm is applied to optimize a feed forward neural network to measure the content of products in the combustion side reaction of p-xylene oxidation, and satisfactory results are obtained.

Dynamic self-adaptive ANP algorithm and its application to electric field simulation of aluminum reduction cell

Region partition(RP) is the key technique to the finite element parallel computing(FEPC),and its performance has a decisive influence on the entire process of analysis and computation.The performance evaluation index of RP method for the three-dimensional finite element model(FEM) has been given.By taking the electric field of aluminum reduction cell(ARC) as the research object,the performance of two classical RP methods,which are Al-NASRA and NGUYEN partition(ANP) algorithm and the multi-level partition(MLP) method,has been analyzed and compared.The comparison results indicate a sound performance of ANP algorithm,but to large-scale models,the computing time of ANP algorithm increases notably.This is because the ANP algorithm determines only one node based on the minimum weight and just adds the elements connected to the node into the sub-region during each iteration.To obtain the satisfied speed and the precision,an improved dynamic self-adaptive ANP(DSA-ANP) algorithm has been proposed.With consideration of model scale,complexity and sub-RP stage,the improved algorithm adaptively determines the number of nodes and selects those nodes with small enough weight,and then dynamically adds these connected elements.The proposed algorithm has been applied to the finite element analysis(FEA) of the electric field simulation of ARC.Compared with the traditional ANP algorithm,the computational efficiency of the proposed algorithm has been shortened approximately from 260 s to 13 s.This proves the superiority of the improved algorithm on computing time performance.

Marchenko imaging based on self-adaptive traveltime updating

Marchenko imaging obtains the subsurface reflectors using one-way Green’s functions,which are retrieved by solving the Marchenko equation.This method generates an image that is free of spurious artifacts due to internal multiples.The Marchenko imaging method is a target-oriented technique;thus,it can image a user specified area.In the traditional Marchenko method,an accurate velocity model is critical for estimating direct waves from imaging points to the surface.An error in the velocity model results in the inaccurate estimation of direct waves.In turn,this leads to errors in computation of one-way Green’s functions,which then affects the final Marchenko images.To solve this problem,in this paper,we propose a self-adaptive traveltime updating technique based on the principle of equal traveltime to improve the Marchenko imaging method.The proposed method calculates the time shift of direct waves caused by the error in the velocity model,and corrects the wrong direct wave according to the time shift and reconstructs the correct Green’s functions.The proposed method improves the results of imaging using an inaccurate velocity model.By comparing the results from traditional Marchenko and the new method using synthetic data experiments,we demonstrated that the adaptive traveltime updating Marchenko imaging method could restore the image of geological structures to their true positions.

Generalized Self-Adaptive Genetic Algorithms

In order to solve the problem between searching performance and convergence of genetic algorithms, a fast genetic algorithm generalized self-adaptive genetic algorithm (GSAGA) is presented. (1) Evenly distributed initial population is generated. (2) Superior individuals are not broken because of crossover and mutation operation for they are sent to subgeneration directly. (3) High quality im- migrants are introduced according to the condition of the population schema. (4) Crossover and mutation are operated on self-adaptation. Therefore, GSAGA solves the coordination problem between convergence and searching performance. In GSAGA, the searching per- formance and global convergence are greatly improved compared with many existing genetic algorithms. Through simulation, the val- idity of this modified genetic algorithm is proved.

Differential Evolution Algorithm Based Self-adaptive Control Strategy for Fed-batch Cultivation of Yeast

In the fed-batch cultivation of Saccharomyces cerevisiae,excessive glucose addition leads to increased ethanol accumulation,which will reduce the efficiency of glucose utilization and inhibit product synthesis.Insufficient glucose addition limits cell growth.To properly regulate glucose feed,a different evolution algorithm based on self-adaptive control strategy was proposed,consisting of three modules(PID,system identification and parameter optimization).Performance of the proposed and conventional PID controllers was validated and compared in simulated and experimental cultivations.In the simulation,cultivation with the self-adaptive control strategy had a more stable glucose feed rate and concentration,more stable ethanol concentration around the set-point(1.0 g·L^(-1)),and final biomass concentration of 34.5 g-DCW·L^(-1),29.2%higher than that with a conventional PID control strategy.In the experiment,the cultivation with the self-adaptive control strategy also had more stable glucose and ethanol concentrations,as well as a final biomass concentration that was 37.4%higher than that using the conventional strategy.

Particle Swarm Optimization Algorithm Based on Chaotic Sequences and Dynamic Self-Adaptive Strategy

To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The self-adaptive inertia weight factor was used to accelerate the converging speed, and chaotic sequences were used to tune the acceleration coefficients for the balance between exploration and exploitation. The performance of the proposed algorithm was tested on four classical multi-objective optimization functions by comparing with the non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results verified the effectiveness of the algorithm, which improved the premature convergence problem with faster convergence rate and strong ability to jump out of local optimum.

Self-Adaptive Algorithms for the Split Common Fixed Point Problem of the Demimetric Mappings

The split common fixed point problem is an inverse problem that consists in finding an element in a fixed point set such that its image under a bounded linear operator belongs to another fixed-point set. In this paper, we present new iterative algorithms for solving the split common fixed point problem of demimetric mappings in Hilbert spaces. Moreover, our algorithm does not need any prior information of the operator norm. Weak and strong convergence theorems are given under some mild assumptions. The results in this paper are the extension and improvement of the recent results in the literature.

An Improved Binary Wolf Pack Algorithm Based on Adaptive Step Length and Improved Update Strategy for 0-1 Knapsack Problems

Binary wolf pack algorithm (BWPA) is a kind of intelligence algorithm which can solve combination optimization problems in discrete spaces.Based on BWPA, an improved binary wolf pack algorithm (AIBWPA) can be proposed by adopting adaptive step length and improved update strategy of wolf pack. AIBWPA is applied to 10 classic 0-1 knapsack problems and compared with BWPA, DPSO, which proves that AIBWPA has higher optimization accuracy and better computational robustness. AIBWPA makes the parameters simple, protects the population diversity and enhances the global convergence.

EVOLUTIONARY FUZZY GUIDANCE LAW WITH SELF-ADAPTIVE REGION

Effective guidance is one of the most important tasks to the performance of air-to-air missile. The fuzzy logic controller is able to perform effectively even in situations where the information about the plant is inaccurate and the operating conditions are uncertain. Based on the proportional navigation, the fuzzy logic and the genetic algorithm are combined to develop an evolutionary fuzzy navigation law with self-adapt region for the air-to-air missile guidance. The line of sight (LOS) rate and the closing speed between the missile and the target are inputs of the fuzzy controller. The output of the fuzzy controller is the commanded acceleration. Then a nonlinear function based on the conventional fuzzy logic control is imported to change the region. This nonlinear function can be changed with the input variables. So the dynamic change of the fuzzy variable region is achieved. The guidance law is optimized by the genetic algorithm. Simulation results of air-to-air missile attack using MATLAB show that the method needs less acceleration and shorter flying time, and its realization is simple.[KH*3/4D]

Dynamic finite element model updating using meta-model and genetic algorithm

Current dynamic finite element model updating methods are not efficient or restricted to the problem of local optima. To circumvent these, a novel updating method which integrates the meta-model and the genetic algorithm is proposed. Experimental design technique is used to determine the best sampling points for the estimation of polynomial coefficients given the order and the number of independent variables. Finite element analyses are performed to generate the sampling data. Regression analysis is then used to estimate the response surface model to approximate the functional relationship between response features and design parameters on the entire design space. In the fitness evaluation of the genetic algorithm, the response surface model is used to substitute the finite element model to output features with given design parameters for the computation of fitness for the individual. Finally, the global optima that corresponds to the updated design parameter is acquired after several generations of evolution. In the application example, finite element analysis and modal testing are performed on a real chassis model. The finite element model is updated using the proposed method. After updating, root-mean-square error of modal frequencies is smaller than 2%. Furthermore, prediction ability of the updated model is validated using the testing results of the modified structure. The root-mean-square error of the prediction errors is smaller than 2%.

Finite Element Model Updating of Bridge Structures Based on Sensitivity Analysis and Optimization Algorithm

The dynamic characteristics of bridge structures, such as the natural frequencies, mode shapes and model damping ratio, are the basis of structural dynamic computation, seismic analysis, vibration control and structural health condition monitoring. In this paper, a three-dimensional finite-element model is established for a highway bridge over a railway on No.312 National Highway and the ambient test is carried out in site, the dynamic characteristics of the bridge are studied using the finite-element analysis and ambient vibration measurements. Comparison between the theoretical and experimental results shows that the frequency differences of the modes range between 0.44% and 8.77%. If the measurement is more reliable, the finite element model updating is necessary. Thus, a set of design variables is selected based on sensitivity analysis, then the finite element model of the bridge is updated based on optimization algorithm. The results of model updating show that the proposed updating method in this paper is more simple and effective, the updated finite element model can reflect the dynamic characteristics of the bridge better, the analytical results can provide the theoretical basis for damage identification and health condition monitoring of the bridge.

Self-adaptive fuzzy controller with formulary rule for servo control of discharge gap in Micro EDM

In micro electrical discharge machining （micro EDM）, it is difficult for servo controlling the narrow discharge gap with the characters of non-linear and quick change. In this paper, aiming at solving the problems above, a self-adaptive fuzzy controller with formulary rule （SAFCFR） is presented based on the dual feedbacks composed by gap electric signal and discharge-ratio statistics. To ensure the properties of self-optimizing and fast stabilization, the formulary rule was designed with a tuning factor. In addition, the fast-convergence algorithms were introduced to adjust control target center and output scale factor. In this way, the normal discharge ratio can tend to the highest value during micro-EDM process. Experimental results show that the proposed algorithms are effective in improving the servo-control performance. According to the drilling-micro-EDM experiments, the machining efficiency is improved by 20% through applying SAFCFR. Moreover, SAFCFR is a prompt way to optimize parameters of discharge-gap servo control.

Computing the Moore-Penrose Inverse of a Matrix Through Symmetric Rank-One Updates

This paper presents a recursive procedure to compute the Moore-Penrose inverse of a matrix A. The method is based on the expression for the Moore-Penrose inverse of rank-one modified matrix. The computational complexity of the method is analyzed and a numerical example is included. A variant of the algorithm with lower computational complexity is also proposed. Both algorithms are tested on randomly generated matrices. Numerical performance confirms our theoretic results.

关于数据库更新UPDATE命令的算法

本文从教学方法的角度讨论用其它工作区中数据库更新当前工作区中数据库的更新命令 UPDATE的算法，并通过实例加以说明 .

A self-adaptive stochastic resonance system design and study in chaotic interference

The us of stochastic resonance （SR） can effectively achieve the detection of weak signal in white noise and colored noise. However, SR in chaotic interference is seldom involved. In view of the requirements for the detection of weak signal in the actual project and the relationship between the signal, chaotic interference, and nonlinear system in the bistable system, a self-adaptive SR system based on genetic algorithm is designed in this paper. It regards the output signal-to-noise ratio （SNR） as a fitness function and the system parameters are jointly encoded to gain optimal bistable system parameters, then the input signal is processed in the SR system with the optimal system parameters. Experimental results show that the system can keep the best state of SR under the condition of low input SNR, which ensures the effective detection and process of weak signal in low input SNR.