Search NASA⌕ Search

SEARCH · Search NASA

Results for “evolutionary computation”

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.

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

At least 271 records · Page 15

Classifier-Guided Sampling for Complex Energy System Optimization

This report documents the results of a Laboratory Directed Research and Development (LDRD) effort entitled “Classifier-Guided Sampling for Complex Energy System Optimization” that was conducted during FY 2014 and FY 2015. The goal of this project was to develop, implement, and test major improvements to the classifier-guided sampling (CGS) algorithm. CGS is type of evolutionary algorithm for performing search and optimization over a set of discrete design variables in the face of one or more objective functions. Existing evolutionary algorithms, such as genetic algorithms, may require a large number of objective function evaluations to identify optimal or near-optimal solutions. Reducing the number of evaluations can result in significant time savings, especially if the objective function is computationally expensive. CGS reduces the evaluation count by using a Bayesian network classifier to filter out non-promising candidate designs, prior to evaluation, based on their posterior probabilities. In this project, both the single-objective and multi-objective versions of the CGS are developed and tested on a set of benchmark problems. As a domain-specific case study, CGS is used to design a microgrid for use in islanded mode during an extended bulk power grid outage.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimizing Grain Boundary Structures with LAMMPS Using Evolutionary Algorithms

Grain boundary structure optimization is an important part of materials modeling. Current methods for grain boundary structure optimization involve inefficient, time-consuming processes that do not fully explore the interface parameter space. Evolutionary algorithms have recently been demonstrated to be effective at determining both stable and metastable grain boundary interface structures. In this work, we demonstrate the use of GBOpt, a grain boundary structure optimization software designed to use the Large-scale Atomic/Molecular Massively Parallel Simulation (LAMMPS) software to efficiently determine grain boundary structures. We demonstrate that a only a few manipulations, namely atom insertion, atom removal, and relative grain displacement, are sufficient to explore much of the grain boundary structure parameter space. The efficacy of this approach is demonstrated on an FCC Ni system, and a BCC Fe system. The computational cost is compared against the gamma-surface sampling approach to demonstrate performance improvement.

Evolutionary algorithms↗

Modeling subgrid combustion processes in simulations of thermonuclear supernovae

Supernovae of type Ia are thought to arise from the thermonuclear incineration of a carbon-oxygen white dwarf stellar remnant. However, the detailed explosion scenario and stellar evolutionary origin scenario – or scenarios – which lead to observed supernovae are still quite uncertain. One of the principal tests of proposed scenarios is comparison with the explosion products inferred, for example, from the spectrum of the supernovae. Making this comparison requires computation of the combustion dynamics and products through simulation of proposed scenarios. Here we discuss two specific proposed explosion scenarios, the deflagration-detonation transition and the helium shell double detonation, With these two examples in mind, we proceed to discuss challenges to computational modeling of the combustion taking place in these explosions. Both subsonically and supersonically propagating reaction fronts are discussed,called deflagrations and detonations respectively. Several major stages of the combustion occur on length and time scales that are many orders of magnitude smaller than those accessible in simulations of the explosion. Models which attempt to capture this sub-grid behavior and the verification of those models is briefly discussed.

79 ASTRONOMY AND ASTROPHYSICS↗

P finder: genomic and metagenomic annotation of RNase P RNA gene (rnpB)

Abstract Background The rnpB gene encodes for an essential catalytic RNA (RNase P). Like other essential RNAs, RNase P’s sequence is highly variable. However, unlike other essential RNAs (i.e. tRNA, 16 S, 6 S,...) its structure is also variable with at least 5 distinct structure types observed in prokaryotes. This structural variability makes it labor intensive and challenging to create and maintain covariance models for the detection of RNase P RNA in genomic and metagenomic sequences. The lack of a facile and rapid annotation algorithm has led to the rnpB gene being the most grossly under annotated essential gene in completed prokaryotic genomes with only a 24% annotation rate. Here we describe the coupling of the largest RNase P RNA database with the local alignment scoring algorithm to create the most sensitive and rapid prokaryote rnpB gene identification and annotation algorithm to date. Results Of the 2772 completed microbial genomes downloaded from GenBank only 665 genomes had an annotated rnpB gene. We applied P Finder to these genomes and were able to identify 2733 or nearly 99% of the 2772 microbial genomes examined. From these results four new rnpB genes that encode the minimal T-type P RNase P RNAs were identified computationally for the first time. In addition, only the second C-type RNase P RNA was identified in Sphaerobacter thermophilus . Of special note, no RNase P RNAs were detected in several obligate endosymbionts of sap sucking insects suggesting a novel evolutionary adaptation. Conclusions The coupling of the largest RNase P RNA database and associated structure class identification with the P Finder algorithm is both sensitive and rapid, yielding high quality results to aid researchers annotating either genomic or metagenomic data. It is the only algorithm to date that can identify challenging RNAse P classes such as C-type and the minimal T-type RNase P RNAs. P Finder is written in C# and has a user-friendly GUI that can run on multiple 64-bit windows platforms (Windows Vista/7/8/10). P Finder is free available for download at https://github.com/JChristopherEllis/P-Finder as well as a small sample RNase P RNA file for testing.

59 BASIC BIOLOGICAL SCIENCES↗

INFLATING AND DEFLATING HOT JUPITERS: COUPLED TIDAL AND THERMAL EVOLUTION OF KNOWN TRANSITING PLANETS

We examine the radius evolution of close in giant planets with a planet evolution model that couples the orbital-tidal and thermal evolution. For 45 transiting systems, we compute a large grid of cooling/contraction paths forward in time, starting from a large phase space of initial semimajor axes and eccentricities. Given observational constraints at the current time for a given planet (semimajor axis, eccentricity, and system age), we find possible evolutionary paths that match these constraints, and compare the calculated radii to observations. We find that tidal evolution has two effects. First, planets start their evolution at larger semimajor axis, allowing them to contract more efficiently at earlier times. Second, tidal heating can significantly inflate the radius when the orbit is being circularized, but this effect on the radius is short-lived thereafter. Often circularization of the orbit is proceeded by a long period while the semimajor axis slowly decreases. Some systems with previously unexplained large radii that we can reproduce with our coupled model are HAT-P-7, HAT-P-9, WASP-10, and XO-4. This increases the number of planets for which we can match the radius from 24 (of 45) to as many as 35 for our standard case, but for some of these systems we are required to be viewing them at a special time around the era of current radius inflation. This is a concern for the viability of tidal inflation as a general mechanism to explain most inflated radii. Also, large initial eccentricities would have to be common. We also investigate the evolution of models that have a floor on the eccentricity, as may be due to a perturber. In this scenario, we match the extremely large radius of WASP-12b. This work may cast some doubt on our ability to accurately determine the interior heavy element enrichment of normal, noninflated close in planets, because of our dearth of knowledge about these planets' previous orbital-tidal histories. Finally, we find that the end state of most close in planetary systems is disruption of the planet as it moves ever closer to its parent star.

79 ASTRONOMY AND ASTROPHYSICS↗

Parallel time integration software

This package implements an optimal-scaling multigrid solver for the (non) linear systems that arise from the discretization of problems with evolutionary behavior. Typically, solution algorithms for evolution equations are based on a time-marching approach, solving sequentially for one time step after the other. Parallelism in these traditional time-integrarion techniques is limited to spatial parallelism. However, current trends in computer architectures are leading twards system with more, but not faster. processors. Therefore, faster compute speeds must come from greater parallelism. One approach to achieve parallelism in time is with multigrid, but extending classical multigrid methods for elliptic poerators to this setting is a significant achievement. In this software, we implement a non-intrusive, optimal-scaling time-parallel method based on multigrid reduction techniques. The examples in the package demonstrate optimality of our multigrid-reduction-in-time algorithm (MGRIT) for solving a variety of parabolic equations in two and three sparial dimensions. These examples can also be used to show that MGRIT can achieve significant speedup in comparison to sequential time marching on modern architectures.

Source record↗

HUNTRESS: a fast heuristic for reconstructing phylogenetic trees of tumor evolution (HUNTRESS) v0.1

We introduce HUNTRESS (Histogrammed UNion Tree REconStruction heuriStic), a computational method for tumor phylogeny reconstruction from noisy genotype matrices derived from single-cell sequencing data, whose running time is linear with the number of cells and quadratic with the number of mutations. Provided that the input genotype matrix includes no false positives, each cellular subpopulation is at least a user defined fraction of the total number of cells, and the number of cells are much bigger than the number of mutations considered, HUNTRESS computes the ground truth tumor phylogeny with high probability. On simulated data HUNTRESS is faster than available alternatives with comparable or better accuracy. Additionally, the phylogenies reconstructed by HUNTRESS on two single-cell sequencing data sets agree with the best known evolutionary scenarios for the associated tumors.

Buluc, Aydin↗

PhyloNet: a software package for analyzing and reconstructing reticulate evolutionary relationships

Background: Phylogenies, i.e., the evolutionary histories of groups of taxa, play a major role in representing the interrelationships among biological entities. Many software tools for reconstructing and evaluating such phylogenies have been proposed, almost all of which assume the underlying evolutionary history to be a tree. While trees give a satisfactory first-order approximation for many families of organisms, other families exhibit evolutionary mechanisms that cannot be represented by trees. Processes such as horizontal gene transfer (HGT), hybrid speciation, and interspecific recombination, collectively referred to as reticulate evolutionary events, result in networks, rather than trees, of relationships. Various software tools have been recently developed to analyze reticulate evolutionary relationships, which include SplitsTree4, LatTrans, EEEP, HorizStory, and T-REX. Results: In this paper, we report on the PhyloNet software package, which is a suite of tools for analyzing reticulate evolutionary relationships, or evolutionary networks, which are rooted, directed, acyclic graphs, leaf-labeled by a set of taxa. These tools can be classified into four categories: (1) evolutionary network representation: reading/writing evolutionary networks in a newly devised compact form; (2) evolutionary network characterization: analyzing evolutionary networks in terms of three basic building blocks – trees, clusters, and tripartitions; (3) evolutionary network comparison: comparing two evolutionary networks in terms of topological dissimilarities, as well as fitness to sequence evolution under a maximum parsimony criterion; and (4) evolutionary network reconstruction: reconstructing an evolutionary network from a species tree and a set of gene trees. Conclusion: The software package, PhyloNet, offers an array of utilities to allow for efficient and accurate analysis of evolutionary networks. The software package will help significantly in analyzing large data sets, as well as in studying the performance of evolutionary network reconstruction methods. Further, the software package supports the proposed eNewick format for compact representation of evolutionary networks, a feature that allows for efficient interoperability of evolutionary network software tools. Currently, all utilities in PhyloNet are invoked on the command line.

59 BASIC BIOLOGICAL SCIENCES↗

Parallel time integration software

This package implements an optimal-scaling multigrid solver for the (non) linear systems that arise from the discretization of problems with evolutionary behavior. Typically, solution algorithms for evolution equations are based on a time-marching approach, solving sequentially for one time step after the other. Parallelism in these traditional time-integrarion techniques is limited to spatial parallelism. However, current trends in computer architectures are leading twards system with more, but not faster. processors. Therefore, faster compute speeds must come from greater parallelism. One approach to achieve parallelism in time is with multigrid, but extending classical multigrid methods for elliptic poerators to this setting is a significant achievement. In this software, we implement a non-intrusive, optimal-scaling time-parallel method based on multigrid reduction techniques. The examples in the package demonstrate optimality of our multigrid-reduction-in-time algorithm (MGRIT) for solving a variety of parabolic equations in two and three sparial dimensions. These examples can also be used to show that MGRIT can achieve significant speedup in comparison to sequential time marching on modern architectures.

Source record↗

A metabolic modeling platform for the computation of microbial ecosystems in time and space (COMETS)

Genome-scale stoichiometric modeling of metabolism has become a standard systems biology tool for modeling cellular physiology and growth. Extensions of this approach are emerging as a valuable avenue for predicting, understanding and designing microbial communities. Computation of microbial ecosystems in time and space (COMETS) extends dynamic flux balance analysis to generate simulations of multiple microbial species in molecularly complex and spatially structured environments. Here we describe how to best use and apply the most recent version of COMETS, which incorporates a more accurate biophysical model of microbial biomass expansion upon growth, evolutionary dynamics and extracellular enzyme activity modules. In addition to a command-line option, COMETS includes user-friendly Python and MATLAB interfaces compatible with the well-established COBRA models and methods, as well as comprehensive documentation and tutorials. Overall, this protocol provides a detailed guideline for installing, testing and applying COMETS to different scenarios, generating simulations that take from a few minutes to several days to run, with broad applicability to microbial communities across biomes and scales.

59 BASIC BIOLOGICAL SCIENCES↗

Benchmarking the Performance of Neuromorphic and Spiking Neural Network Simulators

Software simulators play a critical role in the development of new algorithms and system architectures in any field of engineering. Neuromorphic computing, which has shown potential in building brain-inspired energy-efficient hardware, suffers a slow-down in the development cycle due to a lack of flexible and easy-to-use simulators of either neuromorphic hardware itself or of spiking neural networks (SNNs), the type of neural network computation executed on most neuromorphic systems. While there are several openly available neuromorphic or SNN simulation packages developed by a variety of research groups, they have mostly targeted computational neuroscience simulations, and only a few have targeted small-scale machine learning tasks with SNNs. Evaluations or comparisons of these simulators have often targeted computational neuroscience-style workloads. In this work, we seek to evaluate the performance of several publicly available SNN simulators with respect to non-computational neuroscience workloads, in terms of speed, flexibility, and scalability. We evaluate the performance of the NEST, Brian2, Brian2GeNN, BindsNET and Nengo packages under a common front-end neuromorphic framework. Our evaluation tasks include a variety of different network architectures and workload types to mimic the computation common in different algorithms, including feed-forward network inference, genetic algorithms, and reservoir computing. We also study the scalability of each of these simulators when running on different computing hardware, from single core CPU workstations to multi-node supercomputers. Our results show that the BindsNET simulator has the best speed and scalability for most of the SNN workloads (sparse, dense, and layered SNN architectures) on a single core CPU. However, when comparing the simulators leveraging the GPU capabilities, Brian2GeNN outperforms the others for these workloads in terms of scalability. NEST performs the best for small sparse networks and is also the most flexible simulator in terms of reconfiguration capability NEST shows a speedup of at least 2x compared to the other packages when running evolutionary algorithms for SNNs. The multi-node and multi-thread capabilities of NEST show at least 2x speedup compared to the rest of the simulators (single core CPU or GPU based simulators) for large and sparse networks. We conclude our work by providing a set of recommendations on the suitability of employing these simulators for different tasks and scales of operations. We also present the characteristics for a future generic ideal SNN simulator for different neuromorphic computing workloads.

97 MATHEMATICS AND COMPUTING↗

An evolutionary algorithm for designing microbial communities via environmental modification

Despite a growing understanding of how environmental composition affects microbial communities, it remains difficult to apply this knowledge to the rational design of synthetic multispecies consortia. This is because natural microbial communities can harbour thousands of different organisms and environmental substrates, making up a vast combinatorial space that precludes exhaustive experimental testing and computational prediction. Here, we present a method based on the combination of machine learning and metabolic modelling that selects optimal environmental compositions to produce target community phenotypes. In this framework, dynamic flux balance analysis is used to model the growth of a community in candidate environments. A genetic algorithm is then used to evaluate the behaviour of the community relative to a target phenotype, and subsequently adjust the environment to allow the organisms to approach this target. We apply this iterative process to thousands of in silico communities of varying sizes, showing how it can rapidly identify environments that yield desired taxonomic compositions and patterns of metabolic exchange. Moreover, this combination of approaches produces testable predictions for the assembly of experimental microbial communities with specific properties and can facilitate rational environmental design processes for complex microbiomes.

59 BASIC BIOLOGICAL SCIENCES↗

Evolving bipartite authentication graph partitions

As large scale enterprise computer networks become more ubiquitous, finding the appropriate balance between user convenience and user access control is an increasingly challenging proposition. Suboptimal partitioning of users’ access and available services contributes to the vulnerability of enterprise networks. Previous edge-cut partitioning methods unduly restrict users’ access to network resources. This paper introduces a novel method of network partitioning superior to the current state-of-the-art which minimizes user impact by providing alternate avenues for access that reduce vulnerability. Networks are modeled as bipartite authentication access graphs and a multi-objective evolutionary algorithm is used to simultaneously minimize the size of large connected components while minimizing overall restrictions on network users. Lastly, results are presented on a real world data set that demonstrate the effectiveness of the introduced method compared to previous naive methods.

97 MATHEMATICS AND COMPUTING↗

Parallel general purpose multiobjective optimization framework with application to electron beam dynamics

Particle accelerators are invaluable tools for research in the basic and applied sciences, such as materials science, chemistry, the biosciences, particle physics, nuclear physics and medicine. The design, commissioning, and operation of accelerator facilities is a nontrivial task, due to the large number of control parameters and the complex interplay of several conflicting design goals. The Argonne Wakefield Accelerator facility has some unique challenges resulting from its purpose to carry out advanced accelerator R&D. Individual experiments often have challenging beam requirements, and the physical configuration of the beam lines is often changed to accommodate the variety of supported experiments. The need for rapid deployment of different operational settings further complicates the optimization work that must be done for multiple constraints and challenging operational regimes. One example of this is an independently staged two-beam acceleration experiment which requires the construction of an additional beam line (this is now in progress). The high charge drive beam, well into the space charge regime, must be threaded through small aperture (17.6 mm) decelerating structures. In addition, the bunch length must be sufficiently short to maximize power generation in the decelerator. We propose to tackle this problem by means of multiobjective optimization algorithms which also facilitate a parallel deployment. In order to compute solutions in a meaningful time frame, a fast and scalable software framework is required. In this paper, we present a general-purpose framework for simulation-based multiobjective optimization methods that allows the automatic investigation of optimal sets of machine parameters. Using evolutionary algorithms as the optimizer and opal as the forward solver, validation experiments and results of multiobjective optimization problems in the domain of beam dynamics are presented. Optimized solutions for the new high charge drive beam line found by the framework were used to finish the design of a two beam acceleration experiment. The selected solution along with the associated beam parameters is presented.

43 PARTICLE ACCELERATORS↗

Mechanism of the Quorum-Quenching Lactonase (AiiA) from Bacillus thuringiensis. 2. Substrate Modeling and Active Site Mutations

The N-acyl-l-homoserine lactone hydrolases (AHL lactonases) have attracted considerable attention because of their ability to quench AHL-mediated quorum-sensing pathways in Gram-negative bacteria and because of their relation to other enzymes in the metallo-{beta}-lactamase superfamily. To elucidate the detailed catalytic mechanism of AHL lactonase, mutations are made on residues that presumably contribute to substrate binding and catalysis. Steady-state kinetic studies are carried out on both the wild-type and mutant enzymes using a spectrum of substrates. Two mutations, Y194F and D108N, present significant effects on the overall catalysis. On the basis of a high-resolution structural model of the enzyme-product complex, a hybrid quantum mechanical/molecular mechanical method is used to model the substrate binding orientation and to probe the effect of the Y194F mutation. Combining all experimental and computational results, we propose a detailed mechanism for the ring-opening hydrolysis of AHL substrates as catalyzed by the AHL lactonase from Bacillus thuringiensis. Several features of the mechanism that are also found in related enzymes are discussed and may help to define an evolutionary thread that connects the hydrolytic enzymes of this mechanistically diverse superfamily.

59 BASIC BIOLOGICAL SCIENCES↗

The study on knowledge transferring incentive for information system requirement development

Information system requirement development is a process of users’ knowledge sharing and transferring. However the tacit requirements developing is a main problem during requirement development process, for the reason of difficult to encoding, express, and communicate. Knowledge fusion and corporate effort is needed to finding tacit requirements. Under this background, our paper try to find out the rule of effort dynamic evolutionary of software developer and user by building an evolutionary game model on the condition of incentive system. And in addition this paper provides an in depth discussion at the end of this paper.

97 MATHEMATICS AND COMPUTING↗

Kaposi’s sarcoma–associated herpesvirus stably clusters its genomes across generations to maintain itself extrachromosomally

Genetic elements that replicate extrachromosomally are rare in mammals; however, several human tumor viruses, including the papillomaviruses and the gammaherpesviruses, maintain their plasmid genomes by tethering them to cellular chromosomes. We have uncovered an unprecedented mechanism of viral replication: Kaposi’s sarcoma–associated herpesvirus (KSHV) stably clusters its genomes across generations to maintain itself extrachromosomally. To identify and characterize this mechanism, we developed two complementary, independent approaches: live-cell imaging and a predictive computational model. The clustering of KSHV requires the viral protein, LANA1, to bind viral genomes to nucleosomes arrayed on both cellular and viral DNA. Clustering affects both viral partitioning and viral genome numbers of KSHV. The clustering of KSHV plasmids provides it with an effective evolutionary strategy to rapidly increase copy numbers of genomes per cell at the expense of the total numbers of cells infected.

59 BASIC BIOLOGICAL SCIENCES↗

Keck/NIRC2 L’-band Imaging of Jovian-mass Accreting Protoplanets around PDS 70

We present L’-band imaging of the PDS 70 planetary system with Keck/NIRC2 using the new infrared pyramid wave front sensor. We detected both PDS 70 b and c in our images, as well as the front rim of the circumstellar disk. After subtracting off a model of the disk, we measured the astrometry and photometry of both planets. Placing priors based on the dynamics of the system, we estimated PDS 70 b to have a semimajor axis of 20{sub −4}{sup +3} au and PDS 70 c to have a semimajor axis of 34{sub −6}{sup +12} au (95% credible interval). We fit the spectral energy distribution (SED) of both planets. For PDS 70 b, we were able to place better constraints on the red half of its SED than previous studies and inferred the radius of the photosphere to be 2–3 R {sub Jup}. The SED of PDS 70 c is less well constrained, with a range of total luminosities spanning an order of magnitude. With our inferred radii and luminosities, we used evolutionary models of accreting protoplanets to derive a mass of PDS 70 b between 2 and 4 M {sub Jup} and a mean mass accretion rate between 3 × 10{sup −7} and 8 × 10{sup −7} M {sub Jup}/yr. For PDS 70 c, we computed a mass between 1 and 3 M {sub Jup} and mean mass accretion rate between 1 × 10{sup −7} and 5 × 10{sup −7} M {sub Jup}/yr. The mass accretion rates imply dust accretion timescales short enough to hide strong molecular absorption features in both planets’ SEDs.

79 ASTRONOMY AND ASTROPHYSICS↗