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.

Capability Analysis of Chaotic Mutation and Its Self-Adaption

Through studying several kinds of chaotic mappings' distributions of orbital points, we analyze the capabilityof the chaotic mutations based on these mappings. Nunerical experiments support our conclusions very well. Thecapability analysis also led to a self-adaptive mechanism of chaotic mutation. The introducing of the self-adaptivechaotic mutation can improve the performance of genetic algorithm very prominently.

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.

Genetic Algorithms of Structural Fuzzy Reliability Index

In this paper the simple generation algorithms are improved. According to the geometric meaning of the structural reliability index, a method is proposed to deal with the variables in the standard normal space. With consideration of variable distribution, the correlation coefficient of the variables and its fuzzy reliability index, the feasibility and the reliability of the algorithms are proved with an example of structural reliability analysis and optimization.

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.

Knowledge Automatic Indexing Based on Concept Lexicon and Segm-entation Algorithm

This paper is based on two existing theories about automatic indexing of thematic knowledge concept. The prohibit-word table with position information has been designed. The improved Maximum Matching-Minimum Backtracking method has been researched. Moreover it has been studied on improved indexing algorithm and application technology based on rules and thematic concept word table.

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.

Semantic Indexing of Algorithms Courses Based on a New Ontology

Since the publication of the indexation documents and queries are represented by keywords from their content. The use of words to represent the document content and query generates several problems, the ambiguity of words and their disparity. The semantic indexing is as a solution that answers these problems. The goal context where the ambiguity is present, the semantic indexing is meant is to index by the meaning of words rather than words. In a to improve the performance of IRS （Information Retrieval System）. In this sense we will soon overcome the problems of traditional indexing approaches. What we propose is a new approach that will allow semantically indexing algorithms courses written in French language, based on a new application ontology. The aim of our approach is to adjust a semantic annotation tool with the reference ontology. The semantic annotation tool we generate an index that will be used in e-Learning as needed （question answering performance on the field. systems, information retrieval systems ） while improving

A hybrid algorithm for reengineering the refractive index profile of inhomogeneous coatings from optical in-situ broadband monitoring data

Reengineering the refractive index profile of inhomogeneous coatings is a troublesome task. Multiplicity of solutions may significantly reduced by providing additional information. For this reason an in-situ broadband monitoring system was developed to measure the transmittance of the growing film directly at the rotating substrate. For characterization of these coatings, a new model was developed, which significantly reduces the number of parameters. The refractive index profile may be described by a proper number of equally spaced volume fraction values using the Bruggeman effective media approach. A good initial approximation of the refractive index profile can be generated based on deposition rates for both materials recorded with quartz crystal monitor during manufacturing. During the optimization process, a second order minimization algorithm was used to vary the refractive index profile of the whole coating and film thickness of the intermediate stages. Finally, a significantly improved accuracy of the modelled transmittance was achieved.

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]

Grey-theory based algorithm for impact assessment of green design

Life cycle assessment (LCA) is an important content of green design;the major phase of LCA is impact assessment. After classifying the impact factors, with grey-system theory, the evaluating grey-groups and their whitening weighing functions are defined;the grey-cluster analysis of each classified impact is performed;based on analyzing results, the calculating method of classified impact index is given. By range of action, the impact classes are grouped to three groups - global impact, regional impact, and local impact;the calculating methods of grouped and overall impact index are presented. Finally, an application example of comparative choice of a category of products - three materials, steel, aluminum and engineering plastics is given.

基于重叠分块的FM-index性能研究与分析

FM-index压缩查询方法结合压缩技术和索引技术,其最大优势是能够在不解开压缩文件的情况下对源文件进行查询。该文通过理论分析和详细的测试数据研究重叠分块对FM-index压缩查询性能的改善。对改进后的FM-index和压缩软件Winrar在压缩时间和文件占用空间上进行分析和比较,进一步证明了重叠分块对FM-index压缩查询性能的改善。