Adaptive genetic algorithm-based design of gamma-graphyne nanoribbon incorporating diamond-shaped segment with high thermoelectric conversion efficiency

The gamma-graphyne nanoribbons(γ-GYNRs) incorporating diamond-shaped segment(DSSs) with excellent thermoelectric properties are systematically investigated by combining nonequilibrium Green’s functions with adaptive genetic algorithm. Our calculations show that the adaptive genetic algorithm is efficient and accurate in the process of identifying structures with excellent thermoelectric performance. In multiple rounds, an average of 476 candidates(only 2.88% of all16512 candidate structures) are calculated to obtain the structures with extremely high thermoelectric conversion efficiency.The room temperature thermoelectric figure of merit(ZT) of the optimal γ-GYNR incorporating DSSs is 1.622, which is about 5.4 times higher than that of pristine γ-GYNR(length 23.693 nm and width 2.660 nm). The significant improvement of thermoelectric performance of the optimal γ-GYNR is mainly attributed to the maximum balance of inhibition of thermal conductance(proactive effect) and reduction of thermal power factor(side effect). Moreover, through exploration of the main variables affecting the genetic algorithm, it is revealed that the efficiency of the genetic algorithm can be improved by optimizing the initial population gene pool, selecting a higher individual retention rate and a lower mutation rate. The results presented in this paper validate the effectiveness of genetic algorithm in accelerating the exploration of γ-GYNRs with high thermoelectric conversion efficiency, and could provide a new development solution for carbon-based thermoelectric materials.

GCAGA: A Gini Coefficient-Based Optimization Strategy for Computation Offloading in Multi-User-Multi-Edge MEC System

To support the explosive growth of Information and Communications Technology(ICT),Mobile Edge Comput-ing(MEC)provides users with low latency and high bandwidth service by offloading computational tasks to the network’s edge.However,resource-constrained mobile devices still suffer from a capacity mismatch when faced with latency-sensitive and compute-intensive emerging applications.To address the difficulty of running computationally intensive applications on resource-constrained clients,a model of the computation offloading problem in a network consisting of multiple mobile users and edge cloud servers is studied in this paper.Then a user benefit function EoU(Experience of Users)is proposed jointly considering energy consumption and time delay.The EoU maximization problem is decomposed into two steps,i.e.,resource allocation and offloading decision.The offloading decision is usually given by heuristic algorithms which are often faced with the challenge of slow convergence and poor stability.Thus,a combined offloading algorithm,i.e.,a Gini coefficient-based adaptive genetic algorithm(GCAGA),is proposed to alleviate the dilemma.The proposed algorithm optimizes the offloading decision by maximizing EoU and accelerates the convergence with the Gini coefficient.The simulation compares the proposed algorithm with the genetic algorithm(GA)and adaptive genetic algorithm(AGA).Experiment results show that the Gini coefficient and the adaptive heuristic operators can accelerate the convergence speed,and the proposed algorithm performs better in terms of convergence while obtaining higher EoU.The simulation code of the proposed algorithm is available:https://github.com/Grox888/Mobile_Edge_Computing/tree/GCAGA.

A Linear Domain System Identification for Small Unmanned Aerial Rotorcraft Based on Adaptive Genetic Algorithm

This paper proposes a new adaptive linear domain system identification method for small unmanned aerial rotorcraft.Byusing the flash memory integrated into the micro guide navigation control module, system records the data sequences of flighttests as inputs (control signals for servos) and outputs (aircraft’s attitude and velocity information).After data preprocessing, thesystem constructs the horizontal and vertical dynamic model for the small unmanned aerial rotorcraft using adaptive geneticalgorithm.The identified model is verified by a series of simulations and tests.Comparison between flight data and the one-stepprediction data obtained from the identification model shows that the dynamic model has a good estimation for real unmannedaerial rotorcraft system.Based on the proposed dynamic model, the small unmanned aerial rotorcraft can perform hovering,turning, and straight flight tasks in real flight tests.

Extraction of Laser Stripe Center Line Based on Genetic Algorithm and NURBS Interpolation

To improve the measurement accuracy of structured laser for inner surface dimensions of a deep hole, a new method to extract the laser stripe center line is proposed. An improved adaptive genetic algorithm that can converge rapidly and search the global optimum is used to determine the threshold for the laser stripe segmentation. And then NURBS interpolation which has a good local control capability is adopted to extract the laser stripe center line. Experiments show that the extracted laser stripe center line is stable and the diameter of the deep hole can be measured accurately.

Sparse Planar Retrodirective Antenna Array Using Improved Adaptive Genetic Algorithm

An improved adaptive genetic algorithm is presented in this paper. It primarily includes two modified methods： one is novel adaptive probabilities of crossover and mutation, the other is truncated selection approach. This algorithm has been validated to be superior to the simple genetic algorithm （SGA） by a complicated binary testing function. Then the proposed algorithm is applied to optimizing the planar retrodirective array to reduce the cost of the hardware. The fitness function is discussed in the optimization example. After optimization, the sparse planar retrodirective antenna array keeps excellent retrodirectivity, while the array architecture has been simplified by 34%. The optimized antenna array can replace uniform full array effectively. Results show that this work will gain more engineering benefits in practice.

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.

Adaptive genetic diversity of dominant species contributes to species co-existence and community assembly

The synthesis of evolutionary biology and community ecology aims to understand how genetic variation within one species can shape community properties and how the ecological properties of a community can drive the evolution of a species.A rarely explored aspect is whether the interaction of genetic variation and community properties depends on the species'ecological role.Here we investigated the interactions among environmental factors,species diversity,and the within-species genetic diversity of species with different ecological roles.Using high-throughput DNA sequencing,we genotyped a canopydominant tree species,Parashorea chinensis,and an understory-abundant species,Pittosporopsis kerrii,from fifteen plots in Xishuangbanna tropical seasonal rainforest and estimated their adaptive,neutral and total genetic diversity;we also surveyed species diversity and assayed key soil nutrients.Structural equation modelling revealed that soil nitrogen availability created an opposing effect in species diversity and adaptive genetic diversity of the canopy-dominant Pa.chinensis.The increased adaptive genetic diversity of Pa.chinensis led to greater species diversity by promoting co-existence.Increased species diversity reduced the adaptive genetic diversity of the dominant understory species,Pi.kerrii,which was promoted by the adaptive genetic diversity of the canopy-dominant Pa.chinensis.However,such relationships were absent when neutral genetic diversity or total genetic diversity were used in the model.Our results demonstrated the important ecological interaction between adaptive genetic diversity and species diversity,but the pattern of the interaction depends on the identity of the species.Our results highlight the significant ecological role of dominant species in competitive interactions and regulation of community structure.

An adaptive reanalysis method for genetic algorithm with application to fast truss optimization

Although the genetic algorithm （GA） for structural optimization is very robust, it is very computationally intensive and hence slower than optimality criteria and mathematical programming methods. To speed up the design process, the authors present an adaptive reanalysis method for GA and its applications in the optimal design of trusses. This reanalysis technique is primarily derived from the Kirsch＇s combined approximations method. An iteration scheme is adopted to adaptively determine the number of basis vectors at every generation. In order to illustrate this method, three classical examples of optimal truss design are used to validate the proposed reanalysis-based design procedure. The presented numerical results demonstrate that the adaptive reanalysis technique affects very slightly the accuracy of the optimal solutions and does accelerate the design process, especially for large-scale structures.

Detection of Adaptive Genetic Diversity in Wild Potato Populations and Its Implications in Conservation of Potato Germplasm

A better understanding on how genetic diversity is structured at natural habitats can be helpful for exploration and acquisition of plant germplasm. Historically, studies have relied on DNA markers to elucidate potato genetic diversity. Current advances in genomics are broadening applications allowing the identification of markers linked to genomic regions under selection. Those markers, known as adaptive markers, unlock additional ways to value and organize germplasm diversity. For example, conservation priorities could be given to germplasm units containing markers associated to unique geographic identity, and/or linked to traits of tolerance to abiotic stresses. This study investigated if adaptive marker loci were possible to be identified in a large AFLP marker dataset of ninety-four populations of the wild potato species S. fendleri. These populations originated from six different mountain ranges in southern Arizona, USA. A total of 2094 polymorphic AFLP markers were used to conduct genetic diversity analyses of populations and mountain ranges. Adaptive markers were detected using Bayesian methods which distinguished marker loci departing significantly from frequencies expected under neutral models of genetic differentiation. This identified 16 AFLP loci that were considered to be adaptive. To contrast diversity parameters generated with each set of markers, analyses that included all the 2094 AFLP markers, and only the 16 adaptive markers were conducted. The results showed that both were efficient for establishing genetic associations among populations and mountain ranges. However, adaptive markers were better on revealing geographic patterns and identity which would suggest these markers were linked to selection at the natural sites. An additional test to determine if adaptive markers associated to climate variables found two loci associated to specific climate variables in populations from different regions but sharing similar environmental structure. The distribution of adaptive markers among populations revealed that only two were needed to build a core subset able to keep all the markers. This preliminary assessment shows that adaptive genetic diversity could offer an additional way to measure diversity in potato germplasm and to set up options for conservation and research.

Composition of Web Services of Multi-Population Adaptive Genetic Algorithm Based on Cosine Improvement

Web quality of service (QoS) awareness requires not only the selection of specific services to complete specific tasks, but also the comprehensive quality of service of the whole web service composition. How to select the web service composition with the highest comprehensive QoS is a NP hard problem. In this paper, an improved multi population genetic algorithm is proposed. Cosine adaptive operator is added to the algorithm to avoid premature algorithm caused by improper genetic operator and the disadvantage of destroying excellent individuals in later period. Experimental results show that compared with the common genetic algorithm and multi population genetic algorithm, this algorithm has the advantages of shorter time consumption and higher accuracy, and effectively avoids the loss of effective genes in the population.

A New Fuzzy Adaptive Genetic Algorithm

Multiple genetic algorithms (GAs) need a large population size, which will take a long time for evolution. A new fuzzy adaptive GA is proposed in this paper. This algorithm is more effective in global search while keeping the overall population size constant. The simulation results of function optimization show that with the proposed algorithm, the phenomenon of premature convergence can be overcome effectively, and a satisfying optimization result is obtained.

Method for Fault Feature Selection for a Baler Gearbox Based on an Improved Adaptive Genetic Algorithm

The performance and efficiency of a baler deteriorate as a result of gearbox failure.One way to overcome this challenge is to select appropriate fault feature parameters for fault diagnosis and monitoring gearboxes.This paper proposes a fault feature selection method using an improved adaptive genetic algorithm for a baler gearbox.This method directly obtains the minimum fault feature parameter set that is most sensitive to fault features through attribute reduction.The main benefit of the improved adaptive genetic algorithm is its excellent performance in terms of the efficiency of attribute reduction without requiring prior information.Therefore,this method should be capable of timely diagnosis and monitoring.Experimental validation was performed and promising findings highlighting the relationship between diagnosis results and faults were obtained.The results indicate that when using the improved genetic algorithm to reduce 12 fault characteristic parameters to three without a priori information,100%fault diagnosis accuracy can be achieved based on these fault characteristics and the time required for fault feature parameter selection using the improved genetic algorithm is reduced by half compared to traditional methods.The proposed method provides important insights into the instant fault diagnosis and fault monitoring of mechanical devices.

Time-optimal trajectory planning based on improved adaptive genetic algorithm

This paper investiga tes a trajectory planning algorithm to reduce the manipulator’s working time.A t ime-optimal trajectory planning(TOTP)is conducted based on improved ad aptive genetic algorithm(IAGA)and combined with cubic triangular Bezier spline(CTBS).The CTBS based trajectory planning we did before can achieve continuous second and third derivation,hence it meets the stability requirements of the m anipulator.The working time can be greatly reduced by applying IAGA to the puma 560 trajectory planning when considering physical constraints such as angular ve locity,angular acceleration and jerk.Simulation experiments in both Matlab and ADAMS illustrate that TOTP based on IAGA can give a time optimal result with sm oothness and stability.

An Adaptive Local Grid Nesting-based Genetic Algorithm for Multi-earth Observation Satellites' Area Target Observation

The Scheduling of the Multi-EOSs Area Target Observation(SMEATO)is an EOS resource schedul-ing problem highly coupled with computational geometry.The advances in EOS technology and the ex-pansion of wide-area remote sensing applications have increased the practical significance of SMEATO.In this paper,an adaptive local grid nesting-based genetic algorithm(ALGN-GA)is proposed for developing SMEATO solutions.First,a local grid nesting(LGN)strategy is designed to discretize the target area into parts,so as to avoid the explosive growth of calculations.A genetic algorithm(GA)framework is then used to share reserve information for the population during iterative evolution,which can generate high-quality solutions with low computational costs.On this basis,an adaptive technique is introduced to determine whether a local region requires nesting and whether the grid scale is sufficient.The effectiveness of the proposed model is assessed experimentally with nine randomly generated tests at different scales.The results show that the ALGN-GA offers advantages over several conventional algorithms in 88.9%of instances,especially in large-scale instances.These fully demonstrate the high efficiency and stability of the ALGN-GA.

EP300 contributes to high-altitude adaptation in Tibetans by regulating nitric oxide production

The genetic adaptation of Tibetans to high altitude hypoxia likely involves a group of genes in the hypoxic pathway, as suggested by earlier studies. To test the adaptive role of the previously reported candidate gene EP300 （histone acetyltransferase p300）, we conducted resequencing of a 108.9 kb gene region of EP300 in 80 unrelated Tibetans. The allele-frequency and haplotype-based neutrality tests detected signals of positive Darwinian selection on EP300 in Tibetans, with a group of variants showing allelic divergence between Tibetans and lowland reference populations, including Han Chinese, Europeans, and Africans. Functional prediction suggested the involvement of multiple EP300 variants in gene expression regulation. More importantly, genetic association tests in 226 Tibetans indicated significant correlation of the adaptive EP300 variants with blood nitric oxide （NO） concentration. Collectively, we propose that EP300 harbors adaptive variants in Tibetans, which might contribute to high-altitude adaptation through regulating NO production.

TOPOLOGY OPTIMIZATION OF TRUSS STRUCTURE WITH FUNDAMENTAL FREQUENCY AND FREQUENCY DOMAIN DYNAMIC RESPONSE CONSTRAINTS

In this paper, adaptive genetic algorithm （AGA） is applied to topology optimization of truss structure with frequency domain excitations. The optimization constraints include fundamental frequency, displacement responses under force excitations and acceleration responses under foundation acceleration excitations. The roulette wheel selection operator, adaptive crossover and mutation operators are used as genetic operators. Some heuristic strategies are put forward to direct the deletion of the extra bars and nodes on truss structures. Three examples demonstrate that the proposed method can yield the optimum structure form and the lightest weight of the given ground structure while satisfying dynamic response constraints.

KAEA: A Novel Three-Stage Ensemble Model for Software Defect Prediction

Software defect prediction is a research hotspot in the field of software engineering.However,due to the limitations of current machine learning algorithms,we can’t achieve good effect for defect prediction by only using machine learning algorithms.In previous studies,some researchers used extreme learning machine(ELM)to conduct defect prediction.However,the initial weights and biases of the ELM are determined randomly,which reduces the prediction performance of ELM.Motivated by the idea of search based software engineering,we propose a novel software defect prediction model named KAEA based on kernel principal component analysis(KPCA),adaptive genetic algorithm,extreme learning machine and Adaboost algorithm,which has three main advantages:(1)KPCA can extract optimal representative features by leveraging a nonlinear mapping function;(2)We leverage adaptive genetic algorithm to optimize the initial weights and biases of ELM,so as to improve the generalization ability and prediction capacity of ELM;(3)We use the Adaboost algorithm to integrate multiple ELM basic predictors optimized by adaptive genetic algorithm into a strong predictor,which can further improve the effect of defect prediction.To effectively evaluate the performance of KAEA,we use eleven datasets from large open source projects,and compare the KAEA with four machine learning basic classifiers,ELM and its three variants.The experimental results show that KAEA is superior to these baseline models in most cases.

Test selection and optimization for PHM based on failure evolution mechanism model

The test selection and optimization （TSO） can improve the abilities of fault diagnosis, prognosis and health-state evalua- tion for prognostics and health management （PHM） systems. Traditionally, TSO mainly focuses on fault detection and isolation, but they cannot provide an effective guide for the design for testability （DFT） to improve the PHM performance level. To solve the problem, a model of TSO for PHM systems is proposed. Firstly, through integrating the characteristics of fault severity and propa- gation time, and analyzing the test timing and sensitivity, a testability model based on failure evolution mechanism model （FEMM） for PHM systems is built up. This model describes the fault evolution- test dependency using the fault-symptom parameter matrix and symptom parameter-test matrix. Secondly, a novel method of in- herent testability analysis for PHM systems is developed based on the above information. Having completed the analysis, a TSO model, whose objective is to maximize fault trackability and mini- mize the test cost, is proposed through inherent testability analysis results, and an adaptive simulated annealing genetic algorithm （ASAGA） is introduced to solve the TSO problem. Finally, a case of a centrifugal pump system is used to verify the feasibility and effectiveness of the proposed models and methods. The results show that the proposed technology is important for PHM systems to select and optimize the test set in order to improve their performance level.

Complete Real Solution of the Five-orientation Motion Generation Problem for a Spherical Four-bar Linkage

For a spherical four-bar linkage,the maximum number of the spherical RR dyad（R：revolute joint）of five-orientation motion generation can be at most 6.However,complete real solution of this problem has seldom been studied.In order to obtain six real RR dyads,based on Strum＇s theorem,the relationships between the design parameters are derived from a 6th-degree univariate polynomial equation that is deduced from the constraint equations of the spherical RR dyad by using Dixon resultant method.Moreover,the Grashof condition and the circuit defect condition are taken into account.Given the relationships between the design parameters and the aforementioned two conditions,two objective functions are constructed and optimized by the adaptive genetic algorithm（AGA）.Two examples with six real spherical RR dyads are obtained by optimization,and the results verify the feasibility of the proposed method.The paper provides a method to synthesize the complete real solution of the five-orientation motion generation,which is also applicable to the problem that deduces to a univariate polynomial equation and requires the generation of as many as real roots.

Characteristics of piecewise linear symmetric tri-stable stochastic resonance system and its application under different noises

Weak signal detection has become an important means of mechanical fault detections. In order to solve the problem of poor signal detection performance in classical tristable stochastic resonance system(CTSR), a novel unsaturated piecewise linear symmetric tristable stochastic resonance system(PLSTSR) is proposed. Firstly, by making the analysis and comparison of the output and input relationship between CTSR and PLSTSR, it is verified that the PLSTSR has good unsaturation characteristics. Then, on the basis of adiabatic approximation theory, the Kramers escape rate, the mean first-passage time(MFPT), and output signal-to-noise ratio(SNR) of PLSTSR are deduced, and the influences of different system parameters on them are studied. Combined with the adaptive genetic algorithm to synergistically optimize the system parameters, the PLSTSR and CTSR are used for numerically simulating the verification and detection of low-frequency, high-frequency,and multi-frequency signals. And the results show that the SNR and output amplitude of the PLSTSR are greatly improved compared with those of the CTSR, and the detection effect is better. Finally, the PLSTSR and CTSR are applied to the bearing fault detection under Gaussian white noise and Levy noise. The experimental results also show that the PLSTSR can obtain larger output amplitude and SNR, and can detect fault signals more easily, which proves that the system has better performance than other systems in bearing fault detection, and has good theoretical significance and practical value.