SEARCH · Search NASA

Results for “Evolutionary”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4

All sources NASA NTRS DOE OSTI

NASA NTRS2003

A Genetic Representation for Evolutionary Fault Recovery in Virtex FPGAs

Most evolutionary approaches to fault recovery in FPGAs focus on evolving alternative logic configurations as opposed to evolving the intra-cell routing. Since the majority of transistors in a typical FPGA are dedicated to interconnect, nearly 80% according to one estimate, evolutionary fault-recovery systems should benefit hy accommodating routing. In this paper, we propose an evolutionary fault-recovery system employing a genetic representation that takes into account both logic and routing configurations. Experiments were run using a software model of the Xilinx Virtex FPGA. We report that using four Virtex combinational logic blocks, we were able to evolve a 100% accurate quadrature decoder finite state machine in the presence of a stuck-at-zero fault.

Lohn, Jason↗

NASA NTRS2003

Aerodynamic Shape Optimization using an Evolutionary Algorithm

A method for aerodynamic shape optimization based on an evolutionary algorithm approach is presented and demonstrated. Results are presented for a number of model problems to access the effect of algorithm parameters on convergence efficiency and reliability. A transonic viscous airfoil optimization problem-both single and two-objective variations is used as the basis for a preliminary comparison with an adjoint-gradient optimizer. The evolutionary algorithm is coupled with a transonic full potential flow solver and is used to optimize the inviscid flow about transonic wings including multi-objective and multi-discipline solutions that lead to the generation of pareto fronts. The results indicate that the evolutionary algorithm approach is easy to implement, flexible in application and extremely reliable.

Hoist, Terry L.↗

NASA NTRS2000

Automated Hardware Design via Evolutionary Search

The goal of this research is to investigate the application of evolutionary search to the process of automated engineering design. Evolutionary search techniques involve the simulation of Darwinian mechanisms by computer algorithms. In recent years, such techniques have attracted much attention because they are able to tackle a wide variety of difficult problems and frequently produce acceptable solutions. The results obtained are usually functional, often surprising, and typically "messy" because the algorithms are told to concentrate on the overriding objective and not elegance or simplicity. advantages. First, faster design cycles translate into time and, hence, cost savings. Second, automated design techniques can be made to scale well and hence better deal with increasing amounts of design complexity. Third, design quality can increase because design properties can be specified a priori. For example, size and weight specifications of a device, smaller and lighter than the best known design, might be optimized by the automated design technique. The domain of electronic circuit design is an advantageous platform in which to study automated design techniques because it is a rich design space that is well understood, permitting human-created designs to be compared to machine- generated designs. developed for circuit design was to automatically produce high-level integrated electronic circuit designs whose properties permit physical implementation in silicon. This process entailed designing an effective evolutionary algorithm and solving a difficult multiobjective optimization problem. FY 99 saw many accomplishments in this effort.

Lohn, Jason D.↗

NASA NTRS1998

Bell-Curve Based Evolutionary Optimization Algorithm

The paper presents an optimization algorithm that falls in the category of genetic, or evolutionary algorithms. While the bit exchange is the basis of most of the Genetic Algorithms (GA) in research and applications in America, some alternatives, also in the category of evolutionary algorithms, but use a direct, geometrical approach have gained popularity in Europe and Asia. The Bell-Curve Based Evolutionary Algorithm (BCB) is in this alternative category and is distinguished by the use of a combination of n-dimensional geometry and the normal distribution, the bell-curve, in the generation of the offspring. The tool for creating a child is a geometrical construct comprising a line connecting two parents and a weighted point on that line. The point that defines the child deviates from the weighted point in two directions: parallel and orthogonal to the connecting line, the deviation in each direction obeying a probabilistic distribution. Tests showed satisfactory performance of BCB. The principal advantage of BCB is its controllability via the normal distribution parameters and the geometrical construct variables.

Sobieszczanski-Sobieski, J.↗

NASA NTRS2004

Taking evolutionary circuit design from experimentation to implementation: some useful techniques and a silicon demonstration

Current techniques in evolutionary synthesis of analogue and digital circuits designed at transistor level have focused on achieving the desired functional response, without paying sufficient attention to issues needed for a practical implementation of the resulting solution. No silicon fabrication of circuits with topologies designed by evolution has been done before, leaving open questions on the feasibility of the evolutionary circuit design approach, as well as on how high-performance, robust, or portable such designs could be when implemented in hardware. It is argued that moving from evolutionary 'design-for experimentation' to 'design-for-implementation' requires, beyond inclusion in the fitness function of measures indicative of circuit evaluation factors such as power consumption and robustness to temperature variations, the addition of certain evaluation techniques that are not common in conventional design. Several such techniques that were found to be useful in evolving designs for implementation are presented; some are general, and some are particular to the problem domain of transistor-level logic design, used here as a target application. The example used here is a multifunction NAND/NOR logic gate circuit, for which evolution obtained a creative circuit topology more compact than what has been achieved by multiplexing a NAND and a NOR gate. The circuit was fabricated in a 0.5 mum CMOS technology and silicon tests showed good correspondence with the simulations.

digital circuits designs↗

NASA NTRS2008

Development of X-TOOLSS: Preliminary Design of Space Systems Using Evolutionary Computation

Evolutionary computational (EC) techniques such as genetic algorithms (GA) have been identified as promising methods to explore the design space of mechanical and electrical systems at the earliest stages of design. In this paper the authors summarize their research in the use of evolutionary computation to develop preliminary designs for various space systems. An evolutionary computational solver developed over the course of the research, X-TOOLSS (Exploration Toolset for the Optimization of Launch and Space Systems) is discussed. With the success of early, low-fidelity example problems, an outline of work involving more computationally complex models is discussed.

Schnell, Andrew R.↗

NASA NTRS2009

Evolutionary Computing Methods for Spectral Retrieval

A methodology for processing spectral images to retrieve information on underlying physical, chemical, and/or biological phenomena is based on evolutionary and related computational methods implemented in software. In a typical case, the solution (the information that one seeks to retrieve) consists of parameters of a mathematical model that represents one or more of the phenomena of interest. The methodology was developed for the initial purpose of retrieving the desired information from spectral image data acquired by remote-sensing instruments aimed at planets (including the Earth). Examples of information desired in such applications include trace gas concentrations, temperature profiles, surface types, day/night fractions, cloud/aerosol fractions, seasons, and viewing angles. The methodology is also potentially useful for retrieving information on chemical and/or biological hazards in terrestrial settings. In this methodology, one utilizes an iterative process that minimizes a fitness function indicative of the degree of dissimilarity between observed and synthetic spectral and angular data. The evolutionary computing methods that lie at the heart of this process yield a population of solutions (sets of the desired parameters) within an accuracy represented by a fitness-function value specified by the user. The evolutionary computing methods (ECM) used in this methodology are Genetic Algorithms and Simulated Annealing, both of which are well-established optimization techniques and have also been described in previous NASA Tech Briefs articles. These are embedded in a conceptual framework, represented in the architecture of the implementing software, that enables automatic retrieval of spectral and angular data and analysis of the retrieved solutions for uniqueness.

Terrile, Richard↗

NASA NTRS2011

Evolutionary Computational Methods for Identifying Emergent Behavior in Autonomous Systems

A technique based on Evolutionary Computational Methods (ECMs) was developed that allows for the automated optimization of complex computationally modeled systems, such as autonomous systems. The primary technology, which enables the ECM to find optimal solutions in complex search spaces, derives from evolutionary algorithms such as the genetic algorithm and differential evolution. These methods are based on biological processes, particularly genetics, and define an iterative process that evolves parameter sets into an optimum. Evolutionary computation is a method that operates on a population of existing computational-based engineering models (or simulators) and competes them using biologically inspired genetic operators on large parallel cluster computers. The result is the ability to automatically find design optimizations and trades, and thereby greatly amplify the role of the system engineer.

Terrile, Richard J.↗

DOE OSTI2020

Evolutionary history, potential intermediate animal host, and cross-species analyses of SARS-CoV-2

To investigate the evolutionary history of the recent outbreak of severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) in China, a total of 70 genomes of virus strains from China and elsewhere with sampling dates between 24 December 2019 and 3 February 2020 were analyzed. To explore the potential intermediate animal host of the SARS-CoV-2 virus, we reanalyzed virome data sets from pangolins and representative SARS-related coronaviruses isolates from bats, with particular attention paid to the spike glycoprotein gene. We performed phylogenetic, split network, transmission network, likelihood-mapping, and comparative analyses of the genomes. Additionally, based on Bayesian time-scaled phylogenetic analysis using the tip-dating method, we estimated the time to the most recent common ancestor and evolutionary rate of SARS-CoV-2, which ranged from 22 to 24 November 2019 and 1.19 to 1.31 × 10 -3 substitutions per site per year, respectively. Our results also revealed that the BetaCoV/bat/Yunnan/RaTG13/2013 virus was more similar to the SARS-CoV-2 virus than the coronavirus obtained from the two pangolin samples (SRR10168377 and SRR10168378). We also identified a unique peptide (PRRA) insertion in the human SARS-CoV-2 virus, which may be involved in the proteolytic cleavage of the spike protein by cellular proteases, and thus could impact host range and transmissibility. Interestingly, the coronavirus carried by pangolins did not have the RRAR motif. Therefore, we concluded that the human SARS-CoV-2 virus, which is responsible for the recent outbreak of COVID-19, did not come directly from pangolins.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2021

A parallel evolutionary multiple-try metropolis Markov chain Monte Carlo algorithm for sampling spatial partitions

We develop an Evolutionary Markov Chain Monte Carlo (EMCMC) algorithm for sampling spatial partitions that lie within a large, complex, and constrained spatial state space. Our algorithm combines the advantages of evolutionary algorithms (EAs) as optimization heuristics for state space traversal and the theoretical convergence properties of Markov Chain Monte Carlo algorithms for sampling from unknown distributions. Local optimality information that is identified via a directed search by our optimization heuristic is used to adaptively update a Markov chain in a promising direction within the framework of a Multiple-Try Metropolis Markov Chain model that incorporates a generalized Metropolis-Hastings ratio. We further expand the reach of our EMCMC algorithm by harnessing the computational power afforded by massively parallel computing architecture through the integration of a parallel EA framework that guides Markov chains running in parallel.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Cross-scale dynamics and the evolutionary emergence of infectious diseases

When emerging pathogens encounter new host species for which they are poorly adapted, they must evolve to escape extinction. Pathogens experience selection on traits at multiple scales, including replication rates within host individuals and transmissibility between hosts. We analyze a stochastic model linking pathogen growth and competition within individuals to transmission between individuals. Our analysis reveals a new factor, the cross-scale reproductive number of a mutant virion, that quantifies how quickly mutant strains increase in frequency when they initially appear in the infected host population. This cross-scale reproductive number combines with viral mutation rates, single-strain reproductive numbers, and transmission bottleneck width to determine the likelihood of evolutionary emergence, and whether evolution occurs swiftly or gradually within chains of transmission. We find that wider transmission bottlenecks facilitate emergence of pathogens with short-term infections, but hinder emergence of pathogens exhibiting cross-scale selective conflict and long-term infections. Furthermore, our results provide a framework to advance the integration of laboratory, clinical, and field data in the context of evolutionary theory, laying the foundation for a new generation of evidence-based risk assessment of emergence threats.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2024

Extending evolutionary forecasts across bacterial species

Improving evolutionary forecasting requires progressing from studying repeated evolution of a single genotype under identical conditions to formulating broad principles. These principles should enable predictions of how similar species will adapt to similar selective pressures. Evolve-and-resequence experiments with multiple species allow testing forecasts on different biological levels and elucidating the causes for failed predictions. Here, we show that forecasts for adaptation to static culture conditions can be extended to multiple species by testing previous predictions for Pseudomonas syringae and Pseudomonas savastanoi. In addition to sequence divergence, these species differ in their repertoire of biofilm regulatory genes and structural components. Consistent with predictions, both species repeatedly produced biofilm mutants with a wrinkly spreader phenotype. Predominantly, mutations occurred in the wsp operon, with less frequent promoter mutations near uncharacterized diguanylate cyclases. However, mutational patterns differed on the gene level, which was explained by a lack of conservation in relative fitness of mutants between more divergent species. The same mutation was the most frequent for both species suggesting that conserved mutation hotspots can increase parallel evolution. This study shows that evolutionary forecasts can be extended across species, but that differences in the genotype–phenotype–fitness map and mutational biases limit predictability on a detailed molecular level.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2023

Evolutionary Architecture Search for Generative Adversarial Networks Based on Weight Sharing

Generative adversarial networks (GANs) are a powerful generative technique but frequently face challenges with training stability. Network architecture plays a significant role in determining the final output of GANs, but designing a fine architecture demands extensive domain expertise. This article aims to address this issue by searching for high-performance generator’s architectures through neural architecture search (NAS). The proposed approach, called evolutionary weight sharing GANs (EWSGAN), is based on weight sharing and comprises two steps. First, a supernet of the generator is trained using weight sharing. Second, a multiobjective evolutionary algorithm (MOEA) is employed to identify optimal subnets from the supernet. These subnets inherit weights directly from the supernet for fitness assessment. Two strategies are used to stabilize the training of the generator supernet: 1) a fair single-path sampling strategy and 2) a discarding strategy. Experimental results indicate that the architecture searched by our method achieved a new state-of-the-art among NAS–GAN methods with a Fréchet inception distance (FID) of 9.09 and an inception score (IS) of 8.99 on the CIFAR-10 dataset. Finally, it also demonstrates competitive performance on the STL-10 dataset, achieving FID of 21.89 and IS of 10.51.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Investigating the eco‐evolutionary response of microbiomes to environmental change

Abstract Microorganisms are the primary engines of biogeochemical processes and foundational to the provisioning of ecosystem services to human society. Free‐living microbial communities (microbiomes) and their functioning are now known to be highly sensitive to environmental change. Given microorganisms' capacity for rapid evolution, evolutionary processes could play a role in this response. Currently, however, few models of biogeochemical processes explicitly consider how microbial evolution will affect biogeochemical responses to environmental change. Here, we propose a conceptual framework for explicitly integrating evolution into microbiome–functioning relationships. We consider how microbiomes respond simultaneously to environmental change via four interrelated processes that affect overall microbiome functioning (physiological acclimation, demography, dispersal and evolution). Recent evidence in both the laboratory and the field suggests that ecological and evolutionary dynamics occur simultaneously within microbiomes; however, the implications for biogeochemistry under environmental change will depend on the timescales over which these processes contribute to a microbiome's response. Over the long term, evolution may play an increasingly important role for microbially driven biogeochemical responses to environmental change, particularly to conditions without recent historical precedent.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2022

Scaling and Benchmarking an Evolutionary Algorithm for Constructing Biophysical Neuronal Models

Single neuron models are fundamental for computational modeling of the brain's neuronal networks, and understanding how ion channel dynamics mediate neural function. A challenge in defining such models is determining biophysically realistic channel distributions. Here, we present an efficient, highly parallel evolutionary algorithm for developing such models, named NeuroGPU-EA. NeuroGPU-EA uses CPUs and GPUs concurrently to simulate and evaluate neuron membrane potentials with respect to multiple stimuli. We demonstrate a logarithmic cost for scaling the stimuli used in the fitting procedure. NeuroGPU-EA outperforms the typically used CPU based evolutionary algorithm by a factor of 10 on a series of scaling benchmarks. We report observed performance bottlenecks and propose mitigation strategies. Finally, we also discuss the potential of this method for efficient simulation and evaluation of electrophysiological waveforms.

59 BASIC BIOLOGICAL SCIENCES↗

NASA NTRS2002

The Radiata and the evolutionary origins of the bilaterian body plan

The apparent conservation of cellular and molecular developmental mechanisms observed in a handful of bilaterian metazoans has spawned a "race" to reconstruct the bilaterian ancestor. Knowledge of this ancestor would permit us to reconstruct the evolutionary changes that have occurred along specific bilaterian lineages. However, comparisons among extant bilaterians provide an unnecessarily limited view of the ancestral bilaterian. Since the original bilaterians are believed by many to be derived from a radially symmetrical ancestor, additional evidence might be obtained by examining present-day radially symmetrical animals. We briefly review pertinent features of the body plans of the extant radial eumetazoan phyla, the Cnidaria, and Ctenophora, in the context of revealing potential evolutionary links to the bilaterians.

NASA Discipline Evolutionary Biology↗

NASA NTRS2005

Evolutionary Computing for Low-thrust Navigation

The development of new mission concepts requires efficient methodologies to analyze, design and simulate the concepts before implementation. New mission concepts are increasingly considering the use of ion thrusters for fuel-efficient navigation in deep space. This paper presents parallel, evolutionary computing methods to design trajectories of spacecraft propelled by ion thrusters and to assess the trade-off between delivered payload mass and required flight time. The developed methods utilize a distributed computing environment in order to speed up computation, and use evolutionary algorithms to find globally Pareto-optimal solutions. The methods are coupled with two main traditional trajectory design approaches, which are called direct and indirect. In the direct approach, thrust control is discretized in either arc time or arc length, and the resulting discrete thrust vectors are optimized. In the indirect approach, a thrust control problem is transformed into a costate control problem, and the initial values of the costate vector are optimized. The developed methods are applied to two problems: 1) an orbit transfer around the Earth and 2) a transfer between two distance retrograde orbits around Europa, the closest to Jupiter of the icy Galilean moons. The optimal solutions found with the present methods are comparable to other state-of-the-art trajectory optimizers and to analytical approximations for optimal transfers, while the required computational time is several orders of magnitude shorter than other optimizers thanks to an intelligent design of control vector discretization, advanced algorithmic parameterization, and parallel computing.

optimization↗

DOE OSTI2025

Hyperspectral leaf reflectance of grasses varies with evolutionary lineage more than with site

Abstract To predict ecological responses at broad environmental scales, grass species are commonly grouped into two broad functional types based on photosynthetic pathway. However, closely related species may have distinctive anatomical and physiological attributes that influence ecological responses, beyond those related to photosynthetic pathway alone. Hyperspectral leaf reflectance can provide an integrated measure of covarying leaf traits that may result from phylogenetic trait conservatism and/or environmental conditions. Understanding whether spectra‐trait relationships are lineage specific or reflect environmental variation across sites is necessary for using hyperspectral reflectance to predict plant responses to environmental changes across spatial scales. We measured hyperspectral leaf reflectance (400–2400 nm) and 12 structural, biochemical, and physiological leaf traits from five grass‐dominated sites spanning the Great Plains of North America. We assessed if variation in leaf reflectance spectra among grass species is explained more by evolutionary lineage (as captured by tribes or subfamilies), photosynthetic pathway (C 3 or C 4 ), or site differences. We then determined whether leaf spectra can be used to predict leaf traits within and across lineages. Our results using redundancy analysis ordination (RDA) show that grass tribe identity explained more variation in leaf spectra (adjusted R 2 = 0.12) than photosynthetic pathway, which explained little variation in leaf spectra (adjusted R 2 = 0.00). Furthermore, leaf reflectance from the same tribe across multiple sites was more similar than leaf reflectance from the same site across tribes (adjusted R 2 = 0.12 and 0.08, respectively). Across all sites and species, trait predictions based on spectra ranged considerably in predictive accuracies ( R 2 = 0.65 to <0.01), but R 2 was >0.80 for certain lineages and sites. The relationship between Vc max , a measure of photosynthetic capacity, and spectra was particularly promising. Chloridoideae, a lineage more common at drier sites, appears to have distinct spectra‐trait relationships compared with other lineages. Overall, our results show that evolutionary relatedness explains more variation in grass leaf spectra than photosynthetic pathway or site, but consideration of lineage‐ and site‐specific trait relationships is needed to interpret spectral variation across large environmental gradients.

Pau, Stephanie [Department of Geography University↗