On the Adaptability Range, Self-Selection, and Economic Nature of Biological Evolution

This article employs a combined approach of biology and economics to reveal that biological evolution has an economic nature, evolving towards improved energy efficiency. The orthodox Darwinian theory of evolution describes evolution as the random variation of organisms and their survival through natural selection. In fact, the natural environment itself is a constantly changing context, and the strategy to adapt to this change is to enhance behavioral capabilities, thereby expanding the range and dimensions of behavior. Therefore, the improvement of behavioral capabilities is an important aspect of evolution. The enhancement of behavioral capabilities expands the range of adaptation to the natural environment and increases the space for behavioral choices. Within this space of behavioral choices, some options are more effective and superior to others;thus, the ability to select is necessary to make the improved behavioral capabilities more beneficial to the organism itself. The birth and development of the brain serve the purpose of selection. By using the brain to make selections, at least the “better” behavior will be chosen between two alternatives. Once the better behavior yields better results, and the organism can associate these results with the corresponding behavior, it will persist in this behavior. The persistent repetition of a behavior over generations will form a habit. Habits passed down through generations constitute a new environment, causing the organism’s genes to activate or deactivate certain functions, ultimately leading to genetic changes that are beneficial to that habit. Since the brain’s selection represents the organism’s self-selection, it differs from random variation;it is also a rational selection, choosing behaviors that either obtain more energy or reduce energy consumption. Thus, this evolution possesses an economic nature.

Large eddy simulation of aircraft wake vortex with self-adaptive grid method

A self-adaptive-grid method is applied to numerical simulation of the evolu- tion of aircraft wake vortex with the large eddy simulation （LES）. The Idaho Falls （IDF） measurement of run 9 case is simulated numerically and compared with that of the field experimental data. The comparison shows that the method is reliable in the complex atmospheric environment with crosswind and ground effect. In addition, six cases with different ambient atmospheric turbulences and Brunt V^iis/il^i （BV） frequencies are com- puted with the LES. The main characteristics of vortex are appropriately simulated by the current method. The onset time of rapid decay and the descending of vortices are in agreement with the previous measurements and the numerical prediction. Also, sec-ondary structures such as baroclinic vorticity and helical structures are also simulated. Only approximately 6 million grid points are needed in computation with the present method, while the number can be as large as 34 million when using a uniform mesh with the same core resolution. The self-adaptive-grid method is proved to be practical in the numerical research of aircraft wake vortex.

Self-adaptive learning based discrete differential evolution algorithm for solving CJWTA problem

Cooperative jamming weapon-target assignment （CJWTA） problem is a key issue in electronic countermeasures （ECM）. Some symbols which relevant to the CJWTA are defined firstly. Then, a formulation of jamming fitness is presented. Final y, a model of the CJWTA problem is constructed. In order to solve the CJWTA problem efficiently, a self-adaptive learning based discrete differential evolution （SLDDE） algorithm is proposed by introduc-ing a self-adaptive learning mechanism into the traditional discrete differential evolution algorithm. The SLDDE algorithm steers four candidate solution generation strategies simultaneously in the framework of the self-adaptive learning mechanism. Computa-tional simulations are conducted on ten test instances of CJWTA problem. The experimental results demonstrate that the proposed SLDDE algorithm not only can generate better results than only one strategy based discrete differential algorithms, but also outper-forms two algorithms which are proposed recently for the weapon-target assignment problems.

Prediction-based Manufacturing Center Self-adaptive Demand Side Energy Optimization in Cyber Physical Systems

Cyber physical systems（CPS） recently emerge as a new technology which can provide promising approaches to demand side management（DSM）, an important capability in industrial power systems. Meanwhile, the manufacturing center is a typical industrial power subsystem with dozens of high energy consumption devices which have complex physical dynamics. DSM, integrated with CPS, is an effective methodology for solving energy optimization problems in manufacturing center. This paper presents a prediction-based manufacturing center self-adaptive energy optimization method for demand side management in cyber physical systems. To gain prior knowledge of DSM operating results, a sparse Bayesian learning based componential forecasting method is introduced to predict 24-hour electric load levels for specific industrial areas in China. From this data, a pricing strategy is designed based on short-term load forecasting results. To minimize total energy costs while guaranteeing manufacturing center service quality, an adaptive demand side energy optimization algorithm is presented. The proposed scheme is tested in a machining center energy optimization experiment. An AMI sensing system is then used to measure the demand side energy consumption of the manufacturing center. Based on the data collected from the sensing system, the load prediction-based energy optimization scheme is implemented. By employing both the PSO and the CPSO method, the problem of DSM in the manufac^ring center is solved. The results of the experiment show the self-adaptive CPSO energy optimization method enhances optimization by 5% compared with the traditional PSO optimization method.

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.

Self-adaptive one-dimensional nonlinear finite element method based on element energy projection method

The element energy projection （EEP） method for computation of super- convergent resulting in a one-dimensional finite element method （FEM） is successfully used to self-adaptive FEM analysis of various linear problems, based on which this paper presents a substantial extension of the whole set of technology to nonlinear problems. The main idea behind the technology transfer from linear analysis to nonlinear analysis is to use Newton＇s method to linearize nonlinear problems into a series of linear problems so that the EEP formulation and the corresponding adaptive strategy can be directly used without the need for specific super-convergence formulation for nonlinear FEM. As a re- sult, a unified and general self-adaptive algorithm for nonlinear FEM analysis is formed. The proposed algorithm is found to be able to produce satisfactory finite element results with accuracy satisfying the user-preset error tolerances by maximum norm anywhere on the mesh. Taking the nonlinear ordinary differential equation （ODE） of second-order as the model problem, this paper describes the related fundamental idea, the imple- mentation strategy, and the computational algorithm. Representative numerical exam- ples are given to show the efficiency, stability, versatility, and reliability of the proposed approach.

An algorithm to remove noise from locomotive bearing vibration signal based on self-adaptive EEMD filter

An improved ensemble empirical mode decomposition(EEMD) algorithm is described in this work, in which the sifting and ensemble number are self-adaptive. In particular, the new algorithm can effectively avoid the mode mixing problem. The algorithm has been validated with a simulation signal and locomotive bearing vibration signal. The results show that the proposed self-adaptive EEMD algorithm has a better filtering performance compared with the conventional EEMD. The filter results further show that the feature of the signal can be distinguished clearly with the proposed algorithm, which implies that the fault characteristics of the locomotive bearing can be detected successfully.

Self-Adaptive Grinding for Blind Tip Reconstruction of AFM Diamond Probe

Blind tip reconstruction(BTR) method is one of the favorable methods to estimate the atomic force microscopy(AFM) probe shape. The exact shape of the characterizer is not required for BTR, while the geometry of the sample may affect the reconstruction significantly. A cone-shaped array sample was chosen as a characterizer to be evaluated. The target AFM probe to be reconstructed was a diamond triangular pyramid probe with two feature angles, namely front angle(FA) and back angle(BA). Four conical structures with different semi-angles were dilated by the pyramid probe. Simulation of scanning process demonstrates that it is easy to judge from the images of the isolated rotary structure, cone-shaped, the suitability of the sample to be a tip characterizer for a pyramid probe. The cone-shaped array sample was repeatedly scanned 50 times by the diamond probe using an AFM. The series of scanning images shrank gradually and more information of the probe was exhibited in the images, indicating that the characterizer has been more suitable for BTR. The feature angle FA of the characterizer increasingly reduces during the scanning process. A self-adaptive grinding between the probe and the characterizer contributes to BTR of the diamond pyramid probe.

The control of welding wire feed self-adaptive mechanism based on fuzzy PID

The welding wire feed mechanism is an important component of welding equipment, both reliability and stabilization are the premise that the welding quality can be ensured. The PID is currently adapted to control the welding wire feed mechanism, although the fuzzy PID has advantage of fast response and adaptation, the precision of fuzzy PID is lower. Accordingly, the fuzzy self-adaptive PID controller was proposed through changing fuzzy input variables and output variables based on variable universe, simple furwtion is adopted as scaling factor, the fuzzy PID controller parameters are adjusted to improve the precision and adjustment range. Simulation results show that control effects of fuzzy self-adaptive PID adopted by the welding wire feed mechanism have good adaptive ability and robustness based on variable universe, the welding experiments indicate that the welding quality met the requirements actually.

Towards a Component Framework for Architecture-Based Self-Adaptive Applications

Self-adaptive software is an efficient way to cope with highly dynamic nature of the environment where it is situated. In this paper, from the perspective of software architecture, we propose a component framework for supporting the architecture-based design and development of self-adaptive applications. It captures some key elements of the research on software architecture and provides more flexible facilities to decouple interacting components. Based on that, a prototype is implemented to demonstrate its feasibility, and at last a case study is presented to illustrate our framework.

Adaptive Surrogate Model Based Optimization (ASMBO) for Unknown Groundwater Contaminant Source Characterizations Using Self-Organizing Maps

Characterization of unknown groundwater contaminant sources in terms of location, magnitude and duration of source activity is a complex problem. In this study, to increase the efficiency and accuracy of source characterization an alternative methodology to the methodologies proposed earlier is developed. This methodology, Adaptive Surrogate Modeling Based Optimization (ASMBO) uses the capabilities of Self Organizing Map (SOM) algorithm to design the surrogate models and adaptive surrogate models for source characterization. The most important advantage of this methodology is its direct utilization for groundwater contaminant characterization without the necessity of utilizing a linked simulation optimization model. The validation of the SOM based surrogate models and SOM based adaptive surrogate models demonstrates that the quantity and quality of initial sample sizes have crucial role on the accuracy of solutions as the designed monitoring locations. The performance evaluation results of the proposed methodology are obtained using error free and erroneous concentration measurement data. These results demonstrate that the developed methodology could approximate groundwater flow and transport simulation models, and substitute the optimization model for characterization of unknown groundwater contaminant sources in terms of location, magnitude and duration of source activity.

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.

Self-adaptive large neighborhood search algorithm for parallel machine scheduling problems

A self-adaptive large neighborhood search method for scheduling n jobs on m non-identical parallel machines with mul- tiple time windows is presented. The problems＇ another feature lies in oversubscription, namely not all jobs can be scheduled within specified scheduling horizons due to the limited machine capacity. The objective is thus to maximize the overall profits of processed jobs while respecting machine constraints. A first-in- first-out heuristic is applied to find an initial solution, and then a large neighborhood search procedure is employed to relax and re- optimize cumbersome solutions. A machine learning mechanism is also introduced to converge on the most efficient neighborhoods for the problem. Extensive computational results are presented based on data from an application involving the daily observation scheduling of a fleet of earth observing satellites. The method rapidly solves most problem instances to optimal or near optimal and shows a robust performance in sensitive analysis.

SELF-ADAPTIVE STRATEGY FOR ONE-DIMENSIONAL FINITE ELEMENT METHOD BASED ON ELEMENT ENERGY PROJECTION METHOD

Based on the newly-developed element energy projection （EEP） method for computation of super-convergent results in one-dimensional finite element method （FEM）, the task of self-adaptive FEM analysis was converted into the task of adaptive piecewise polynomial interpolation. As a result, a satisfactory FEM mesh can be obtained, and further FEM analysis on this mesh would immediately produce an FEM solution which usually satisfies the user specified error tolerance. Even though the error tolerance was not completely satisfied, one or two steps of further local refinements would be sufficient. This strategy was found to be very simple, rapid, cheap and efficient. Taking the elliptical ordinary differential equation of second order as the model problem, the fundamental idea, implementation strategy and detailed algorithm are described. Representative numerical examples are given to show the effectiveness and reliability of the proposed approach.

Variable Parameter Self-Adaptive Control Strategy Based on Driving Condition Identification for Plug-In Hybrid Electric Bus

A variable parameter self-adaptive control strategy based on driving condition identification is proposed to take full advantage of the fuel saving potential of the plug-in hybrid electric bus(PHEB).Firstly,the principal component analysis(PCA)and the fuzzy c-means clustering(FCM)algorithm is used to construct the comprehensive driving cycle,congestion driving cycle,urban driving cycle and suburban driving cycle of Chinese urban buses.Secondly,an improved particle swarm optimization(IPSO)algorithm is proposed,and is used to optimize the control parameters of PHEB under different driving cycles,respectively.Then,the variable parameter self-adaptive control strategy based on driving condition identification is given.Finally,for an actual running vehicle,the driving condition is identified by relevance vector machine(RVM),and the corresponding control parameters are selected to control the vehicle.The simulation results show that the fuel consumption of using the variable parameter self-adaptive control strategy is reduced by 4.2% compared with that of the fixed parameter control strategy,and the feasibility of the variable parameter self-adaptive control strategy is verified.

Self-adaptive strategy for one-dimensional finite element method based on EEP method with optimal super-convergence order

Based on the newly-developed element energy projection （EEP） method with optimal super-convergence order for computation of super-convergent results, an improved self-adaptive strategy for one-dimensional finite element method （FEM） is proposed. In the strategy, a posteriori errors are estimated by comparing FEM solutions to EEP super-convergent solutions with optimal order of super-convergence, meshes are refined by using the error-averaging method. Quasi-FEM solutions are used to replace the true FEM solutions in the adaptive process. This strategy has been found to be simple, clear, efficient and reliable. For most problems, only one adaptive step is needed to produce the required FEM solutions which pointwise satisfy the user specified error tolerances in the max-norm. Taking the elliptical ordinary differential equation of the second order as the model problem, this paper describes the fundamental idea, implementation strategy and computational algorithm and representative numerical examples are given to show the effectiveness and reliability of the proposed approach.

An improved self-calibration approach based on adaptive genetic algorithm for position-based visual servo

An improved self-calibrating algorithm for visual servo based on adaptive genetic algorithm is proposed in this paper. Our approach introduces an extension of Mendonca-Cipolla and G. Chesi＇s self-calibration for the positionbased visual servo technique which exploits the singular value property of the essential matrix. Specifically, a suitable dynamic online cost function is generated according to the property of the three singular values. The visual servo process is carried out simultaneous to the dynamic self-calibration, and then the cost function is minimized using the adaptive genetic algorithm instead of the gradient descent method in G. Chesi＇s approach. Moreover, this method overcomes the limitation that the initial parameters must be selected close to the true value, which is not constant in many cases. It is not necessary to know exactly the camera intrinsic parameters when using our approach, instead, coarse coding bounds of the five parameters are enough for the algorithm, which can be done once and for all off-line. Besides, this algorithm does not require knowledge of the 3D model of the object. Simulation experiments are carried out and the results demonstrate that the proposed approach provides a fast convergence speed and robustness against unpredictable perturbations of camera parameters, and it is an effective and efficient visual servo algorithm.

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.

Self-adaptive correction of clutch control with proportional valve

A new method for self-adaptive correction of the clutch proportional valve by Lyapunov stability function is proposed. Compared with displacement curve of hydraulic control cylinder under standard load, pulse width modulation （PWM） voltage imposed on clutch proportional valve is cor- rected according to the error to improve the consistency of the clutch control system in the process of clutch engagement. Computer simulations are conducted with this self-adaptive correction method by establishing the clutch control system model and results indicate that the principle of the method is correct. The flow rate variation obtains effective restraint which is caused by clutch control system characteristic of different vehicle under constant PWM voltage.

A SELF-ADAPTIVE TECHNIQUE FORA KIND OF NONLINEAR CONJUGATEGRADIENT METHODS

Conjugate gradient methods. are a class of important methods for unconstrained optimization, especially when the dimension is large. In 2001, Dai and Liao have proposed a new conjugate condition, based on it two nonlinear conjugate gradient methods are constructed. With trust region idea, this paper gives a self-adaptive technique for the two methods. The numerical results show that this technique works well for the given nonlinear optimization test problems.