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 379 records · Page 21

Resistive magnetohydrodynamic reconnection: Resolving long-term, chaotic dynamics

In this paper, we address the long-term evolution of an idealised double current system entering reconnection regimes where chaotic behavior plays a prominent role. Our aim is to quantify the energetics in high magnetic Reynolds number evolutions, enriched by secondary tearing events, multiple magnetic island coalescence, and compressive versus resistive heating scenarios. Our study will pay particular attention to the required numerical resolutions achievable by modern (grid-adaptive) computations, and comment on the challenge associated with resolving chaotic island formation and interaction. We will use shock-capturing, conservative, grid-adaptive simulations for investigating trends dominated by both physical (resistivity) and numerical (resolution) parameters, and confront them with (visco-)resistive magnetohydrodynamic simulations performed with very different, but equally widely used discretization schemes. This will allow us to comment on the obtained evolutions in a manner irrespective of the adopted discretization strategy. Our findings demonstrate that all schemes used (finite volume based shock-capturing, high order finite differences, and particle in cell-like methods) qualitatively agree on the various evolutionary stages, and that resistivity values of order 0.001 already can lead to chaotic island appearance. However, none of the methods exploited demonstrates convergence in the strong sense in these chaotic regimes. At the same time, nonperturbed tests for showing convergence over long time scales in ideal to resistive regimes are provided as well, where all methods are shown to agree. Both the advantages and disadvantages of specific discretizations as applied to this challenging problem are discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

FastTree: Computing Large Minimum Evolution Trees with Profiles instead of a Distance Matrix

Gene families are growing rapidly, but standard methods for inferring phylogenies do not scale to alignments with over 10,000 sequences. We present FastTree, a method for constructing large phylogenies and for estimating their reliability. Instead of storing a distance matrix, FastTree stores sequence profiles of internal nodes in the tree. FastTree uses these profiles to implement Neighbor-Joining and uses heuristics to quickly identify candidate joins. FastTree then uses nearest neighbor interchanges to reduce the length of the tree. For an alignment with N sequences, L sites, and a different characters, a distance matrix requires O(N2) space and O(N2L) time, but FastTree requires just O(NLa+N √N) memory and O(N √N log(N)La) time. To estimate the tree’s reliability, FastTree uses local bootstrapping, which gives another 100-fold speedup over a distance matrix. For example, FastTree computed a tree and support values for 158,022 distinct 16S ribosomal RNAs in 17 h and 2.4 GB of memory. Just computing pairwise Jukes–Cantor distances and storing them, without inferring a tree or bootstrapping, would require 17 h and 50 GB of memory. In simulations, FastTree was slightly more accurate than Neighbor-Joining, BIONJ, or FastME; on genuine alignments, FastTree’s topologies had higher likelihoods. FastTree is available at http://microbesonline.org/fasttree.

59 BASIC BIOLOGICAL SCIENCES↗

Evolutionary reinforcement learning of dynamical large deviations

In this work, we show how to bound and calculate the likelihood of dynamical large deviations using evolutionary reinforcement learning. An agent, a stochastic model, propagates a continuous-time Monte Carlo trajectory and receives a reward conditioned upon the values of certain path-extensive quantities. Evolution produces progressively fitter agents, potentially allowing the calculation of a piece of a large-deviation rate function for a particular model and path-extensive quantity. For models with small state spaces, the evolutionary process acts directly on rates, and for models with large state spaces, the process acts on the weights of a neural network that parameterizes the model's rates. This approach shows how path-extensive physics problems can be considered within a framework widely used in machine learning.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Tree Pruner: An efficient tool for selecting data from a biased genetic database

Background: Large databases of genetic data are often biased in their representation. Thus, selection of genetic data with desired properties, such as evolutionary representation or shared genotypes, is problematic. Selection on the basis of epidemiological variables may not achieve the desired properties. Available automated approaches to the selection of influenza genetic data make a tradeoff between speed and simplicity on the one hand and control over quality and contents of the dataset on the other hand. A poorly chosen dataset may be detrimental to subsequent analyses. Results: We developed a tool, Tree Pruner, for obtaining a dataset with desired evolutionary properties from a large, biased genetic database. Tree Pruner provides the user with an interactive phylogenetic tree as a means of editing the initial dataset from which the tree was inferred. The tree visualization changes dynamically, using colors and shading, reflecting Tree Pruner actions. At the end of a Tree Pruner session, the editing actions are implemented in the dataset. Currently, Tree Pruner is implemented on the Influenza Research Database (IRD). The data management capabilities of the IRD allow the user to store a pruned dataset for additional pruning or for subsequent analysis. Tree Pruner can be easily adapted for use with other organisms. Conclusions: Tree Pruner is an efficient, manual tool for selecting a high-quality dataset with desired evolutionary properties from a biased database of genetic sequences. It offers an important alternative to automated approaches to the same goal, by providing the user with a dynamic, visual guide to the ongoing selection process and ultimate control over the contents (and therefore quality) of the dataset.

59 BASIC BIOLOGICAL SCIENCES↗

Evolutionary multi-objective optimization and Pareto-frontal uncertainty quantification of interatomic forcefields for thermal conductivity simulations

Predictive Molecular Dynamics simulations of thermal transport require forcefields that can simultaneously reproduce several structural, thermodynamic and vibrational properties of materials like lattice constants, phonon density of states, and specific heat. This requires a multi-objective optimization approach for forcefield parameterization. Existing methodologies for forcefield parameterization use ad-hoc and empirical weighting schemes to convert this into a single-objective optimization problem. Here, we provide and describe software to perform multi-objective optimization of Stillinger–Weber forcefields (SWFF) for two-dimensional layered materials using the recently developed 3rd generation non-dominated sorting genetic algorithm (NSGA-III). NSGA-III converges to the set of optimal forcefields lying on the Pareto front in the multi-dimensional objective space. This set of forcefields is used for uncertainty quantification of computed thermal conductivity due to variability in the forcefield parameters. We demonstrate this new optimization scheme by constructing a SWFF for a representative two-dimensional material, 2H-MoSe 2 and quantifying the uncertainty in their computed thermal conductivity.

97 MATHEMATICS AND COMPUTING↗

miROrtho: computational survey of microRNA genes

MicroRNAs (miRNAs) are short, non-protein coding RNAs that direct the widespread phenomenon of post-transcriptional regulation of metazoan genes. The mature ~22-nt long RNA molecules are processed from genome-encoded stem-loop structured precursor genes. Hundreds of such genes have been experimentally validated in vertebrate genomes, yet their discovery remains challenging, and substantially higher numbers have been estimated. The miROrtho database (http://cegg.unige. ch/mirortho) presents the results of a comprehensive computational survey of miRNA gene candidates across the majority of sequenced metazoan genomes. We designed and applied a three-tier analysis pipeline: (i) an SVM-based ab initio screen for potent hairpins, plus homologs of known miRNAs, (ii) an orthology delineation procedure and (iii) an SVM-based classifier of the ortholog multiple sequence alignments. The web interface provides direct access to putative miRNA annotations, ortholog multiple alignments, RNA secondary structure conservation, and sequence data. The miROrtho data are conceptually complementary to the miRBase catalog of experimentally verified miRNA sequences, providing a consistent comparative genomics perspective as well as identifying many novel miRNA genes with strong evolutionary support.

59 BASIC BIOLOGICAL SCIENCES↗

The histone code of the fungal genus Aspergillus uncovered by evolutionary and proteomic analyses

Chemical modifications of DNA and histone proteins impact the organization of chromatin within the nucleus. Changes in these modifications, catalysed by different chromatin-modifying enzymes, influence chromatin organization, which in turn is thought to impact the spatial and temporal regulation of gene expression. While combinations of different histone modifications, the histone code, have been studied in several model species, we know very little about histone modifications in the fungal genus Aspergillus, whose members are generally well studied due to their importance as models in cell and molecular biology as well as their medical and biotechnological relevance. Here, we used phylogenetic analyses in 94 Aspergilli as well as other fungi to uncover the occurrence and evolutionary trajectories of enzymes and protein complexes with roles in chromatin modifications or regulation. We found that these enzymes and complexes are highly conserved in Aspergilli, pointing towards a complex repertoire of chromatin modifications. Nevertheless, we also observed few recent gene duplications or losses, highlighting Aspergillus species to further study the roles of specific chromatin modifications. SET7 (KMT6) and other components of PRC2 (Polycomb Repressive Complex 2), which is responsible for methylation on histone H3 at lysine 27 in many eukaryotes including fungi, are absent in Aspergilli as well as in closely related Penicillium species, suggesting that these lost the capacity for this histone modification. We corroborated our computational predictions by performing untargeted MS analysis of histone post-translational modifications in Aspergillus nidulans. This systematic analysis will pave the way for future research into the complexity of the histone code and its functional implications on genome architecture and gene regulation in fungi.

59 BASIC BIOLOGICAL SCIENCES↗

Nearby stellar substructures in the Galactic halo from DESI Milky Way Survey Year 1 Data Release

We report five nearby ($d_{\mathrm{helio}} < 5$ kpc) stellar substructures in the Galactic halo from a subset of 138 661 stars in the Dark Energy Spectroscopic Instrument (DESI) Milky Way Survey Year 1 Data Release. With an unsupervised clustering algorithm, HDBSCAN*, these substructures are independently identified in Integrals of Motion ($E_{\rm tot}$, $L_{\rm z}$, $\log {J_r}$, $\log {J_z}$) space and Galactocentric cylindrical velocity space ($V_{R}$, $V_{\phi }$, $V_{z}$). We associate all identified clusters with known nearby substructures (Helmi streams, M18-Cand10/MMH-1, Sequoia, Antaeus, and ED-2) previously reported in various studies. With metallicities precisely measured by DESI, we confirm that the Helmi streams, M18-Cand10, and ED-2 are chemically distinct from local halo stars. We have characterized the chemodynamic properties of each dynamic group, including their metallicity dispersions, to associate them with their progenitor types (globular cluster or dwarf galaxy). Our approach for searching substructures with HDBSCAN* reliably detects real substructures in the Galactic halo, suggesting that applying the same method can lead to the discovery of new substructures in future DESI data. With more stars from future DESI data releases and improved astrometry from the upcoming Gaia Data Release 4, we will have a more detailed blueprint of the Galactic halo, offering a significant improvement in our understanding of the formation and evolutionary history of the Milky Way Galaxy.

dynamics↗

Biomimetic, Soft-Material Synapse for Neuromorphic Computing: from Device to Network

Neuromorphic computing refers to a variety of brain-inspired computers, devices, and models inspired by the interconnectivity, performance, and energy efficiency of the human brain. Unlike the ubiquitous von Neumann computer architectures with complex processor cores and sequential computation, biological neurons and synapses operate by storing and processing information simultaneously with the capacity of flexible adaptation resulting in massive computational capability with much less power consumption. The search for a synaptic material which can closely imitate bio-synapse has led to an alamethicin-doped, synthetic biomembrane which can emulate key synaptic functions due to generic memristive property enabling learning and computation. This two-terminal, biomolecular memristor, in contrast to its solid-state counterparts, features similar structure, switching mechanism, and ionic transport modality as biological synapses while consuming considerably lower power. In this paper, we outline a methodology for using this biomolecular synapse to build neural networks capable of solving real-world problems. The physical mechanism underlying its volatile memristance is explored followed by the development of a model of this device for circuit simulation. We outline a circuit design technique to integrate this synapse with solid-state neuron circuit for hardware implementation. Based on these results, we develop a high level simulation framework and use a training scheme called Evolutionary Optimization for Neuromorphic System (EONS) to generate networks for solving two problems, namely iris dataset classification and EEG classification task. The small network size and comparable to state-of-the-art accuracy of these preliminary networks show its potential to enhance synaptic functionality in next generation neuromorphic hardware.

Sakib hasan, Md↗

Multidimensional low-Mach number time-implicit hydrodynamic simulations of convective helium shell burning in a massive star

A realistic parametrization of convection and convective boundary mixing in conventional stellar evolution codes is still the subject of ongoing research. Furthermore, to improve the current situation, multidimensional hydrodynamic simulations are used to study convection in stellar interiors. Such simulations are numerically challenging, especially for flows at low Mach numbers which are typical for convection during early evolutionary stages. We explore the benefits of using a low-Mach hydrodynamic flux solver and demonstrate its usability for simulations in the astrophysical context. Simulations of convection for a realistic stellar profile are analyzed regarding the properties of convective boundary mixing. The time-implicit Seven-League Hydro (SLH) code was used to perform multidimensional simulations of convective helium shell burning based on a 25 M ⊙ star model. The results obtained with the low-Mach AUSM + -up solver were compared to results when using its non low-Mach variant AUSM B + -up. We applied well-balancing of the gravitational source term to maintain the initial hydrostatic background stratification. The computational grids have resolutions ranging from 180 × 90 2 to 810 × 540 2 cells and the nuclear energy release was boosted by factors of 3 × 10 3 , 1 × 10 4 , and 3 × 10 4 to study the dependence of the results on these parameters.

79 ASTRONOMY AND ASTROPHYSICS↗

On polymorphism for discrete evolutionary dynamics driven either by selection or segregation distortion

We revisit some problems arising in the context of multiallelic discrete-time and deterministic evolutionary dynamics driven first by fitness differences and then by segregation distortion. In the model with fitness, we describe classes of fitness matrices exhibiting polymorphism. In the segregation case, still in search for conditions of polymorphism, we focus on a class of skew-symmetric matrices with a unique strictly positive kernel vector. Our main results reduce the study of these cases to the analysis of stochastic matrices.

97 MATHEMATICS AND COMPUTING↗

Mesoscopic structure conditions the emergence of cooperation on social networks

We study the evolutionary Prisoner's Dilemma on two social networks substrates obtained from actual relational data. We find very different cooperation levels on each of them that cannot be easily understood in terms of global statistical properties of both networks. We claim that the result can be understood at the mesoscopic scale, by studying the community structure of the networks. We explain the dependence of the cooperation level on the temptation parameter in terms of the internal structure of the communities and their interconnections. We then test our results on community-structured, specifically designed artificial networks, finding a good agreement with the observations in both real substrates. Our results support the conclusion that studies of evolutionary games on model networks and their interpretation in terms of global properties may not be sufficient to study specific, real social systems. Further, the study allows us to define new quantitative parameters that summarize the mesoscopic structure of any network. In addition, the community perspective may be helpful to interpret the origin and behavior of existing networks as well as to design structures that show resilient cooperative behavior.

97 MATHEMATICS AND COMPUTING↗

The Grammatical Universe and the Laws of Thermodynamics and Quantum Entanglement

The universal nilpotent computational rewrite system (UNCRS) is shown to formalize an irreversible process of evolution in conformity with the First, Second and Third Laws of Thermodynamics, in terms of a single algebraic creation operator (ikE+ip+jm) which delivers the whole quantum mechanical language apparatus, where k, i, j are quaternions units and E, p, m are energy, momentum and rest mass. This nilpotent evolution describes 'a dynamic zero totality universe' in terms of its fermion states (each of which, by Pauli exclusion, is unique and nonzero), where, together with their boson interactions, these define physics at the fundamental level. (The UNCRS implies that the inseparability of objects and fields in the quantum universe is based on the fact that the only valid mathematical representations are all automorphisms of the universe itself, and that this is the mathematical meaning of quantum entanglement. It thus appears that the nilpotent fermion states are in fact what is called the splitting field in Quantum Mechanics of the Galois group which leads to the roots of the corresponding algebraic equation, and concerns in this case the alternating group of even permutations which are themselves automorphisms). In the nilpotent evolutionary process: (i) the Quantum Carnot Engine (QCE) extended model of thermodynamic irreversibility, consisting of a single heat bath of an ensemble of Standard Model elementary particles, retains a small amount of quantum coherence / entanglement, so as to constitute new emergent fermion states of matter, and (ii) the metric (E{sup 2}-p{sup 2}m{sup 2}) = 0 ensures the First Law of the conservation of energy operates at each nilpotent stage, so that (iii) prior to each creation (and implied corresponding annihilation / conserve operation), E and m can be postulated to constitute dark energy and matter respectively. It says that the natural language form of the rewrite grammar of the evolution consists of the well known precepts of the Laws of Thermodynamics, formalized by the UNCRS regress, so as to become (as UNCRS rewrites already published at CASYS), firstly the Quantum Laws of Physics in the form of the generalized Dirac equation and later at higher stages of QCE ensemble complexity, the Laws of Life in the form of Nature's (DNA / RNA genetic) Code and then subsequently those of Intelligence and Consciousness (Nature's Rules).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Large-scale tides in general relativity

Density perturbations in cosmology, i.e. spherically symmetric adiabatic perturbations of a Friedmann-Lemaȋtre-Robertson-Walker (FLRW) spacetime, are locally exactly equivalent to a different FLRW solution, as long as their wavelength is much larger than the sound horizon of all fluid components. This fact is known as the 'separate universe' paradigm. However, no such relation is known for anisotropic adiabatic perturbations, which correspond to an FLRW spacetime with large-scale tidal fields. Here, we provide a closed, fully relativistic set of evolutionary equations for the nonlinear evolution of such modes, based on the conformal Fermi (CFC) frame. We show explicitly that the tidal effects are encoded by the Weyl tensor, and are hence entirely different from an anisotropic Bianchi I spacetime, where the anisotropy is sourced by the Ricci tensor. In order to close the system, certain higher derivative terms have to be dropped. We show that this approximation is equivalent to the local tidal approximation of Hui and Bertschinger [1]. We also show that this very simple set of equations matches the exact evolution of the density field at second order, but fails at third and higher order. This provides a useful, easy-to-use framework for computing the fully relativistic growth of structure at second order.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The ages of A-stars. I. Interferometric observations and age estimates for stars in the Ursa major moving group

We have observed and spatially resolved a set of seven A-type stars in the nearby Ursa Major moving group with the Classic, CLIMB, and PAVO beam combiners on the Center for High Angular Resolution Astronomy Array. At least four of these stars have large rotational velocities (vsini ≳ 170 km s{sup −1}) and are expected to be oblate. These interferometric measurements, the stars’ observed photometric energy distributions, and vsini values are used to computationally construct model oblate stars from which stellar properties (inclination, rotational velocity, and the radius and effective temperature as a function of latitude, etc.) are determined. The results are compared with MESA stellar evolution models to determine masses and ages. The value of this new technique is that it enables the estimation of the fundamental properties of rapidly rotating stars without the need to fully image the star. It can thus be applied to stars with sizes comparable to the interferometric resolution limit as opposed to those that are several times larger than the limit. Under the assumption of coevality, the spread in ages can be used as a test of both the prescription presented here and the MESA evolutionary code for rapidly rotating stars. With our validated technique, we combine these age estimates and determine the age of the moving group to be 414 ± 23 Myr, which is consistent with, but much more precise than previous estimates.

79 ASTRONOMY AND ASTROPHYSICS↗

Functional protein mining with conformal guarantees

Molecular structure prediction and homology detection offer promising paths to discovering protein function and evolutionary relationships. However, current approaches lack statistical reliability assurances, limiting their practical utility for selecting proteins for further experimental and in-silico characterization. To address this challenge, we introduce a statistically principled approach to protein search leveraging principles from conformal prediction, offering a framework that ensures statistical guarantees with user-specified risk and provides calibrated probabilities (rather than raw ML scores) for any protein search model. Our method (1) lets users select many biologically-relevant loss metrics (i.e. false discovery rate) and assigns reliable functional probabilities for annotating genes of unknown function; (2) achieves state-of-the-art performance in enzyme classification without training new models; and (3) robustly and rapidly pre-filters proteins for computationally intensive structural alignment algorithms. Our framework enhances the reliability of protein homology detection and enables the discovery of uncharacterized proteins with likely desirable functional properties.

59 BASIC BIOLOGICAL SCIENCES↗

Quartet-based inference is statistically consistent under the unified duplication-loss-coalescence model

Abstract Motivation The classic multispecies coalescent (MSC) model provides the means for theoretical justification of incomplete lineage sorting-aware species tree inference methods. This has motivated an extensive body of work on phylogenetic methods that are statistically consistent under MSC. One such particularly popular method is ASTRAL, a quartet-based species tree inference method. Novel studies suggest that ASTRAL also performs well when given multi-locus gene trees in simulation studies. Further, Legried et al. recently demonstrated that ASTRAL is statistically consistent under the gene duplication and loss model (GDL). GDL is prevalent in evolutionary histories and is the first core process in the powerful duplication-loss-coalescence evolutionary model (DLCoal) by Rasmussen and Kellis. Results In this work, we prove that ASTRAL is statistically consistent under the general DLCoal model. Therefore, our result supports the empirical evidence from the simulation-based studies. More broadly, we prove that the quartet-based inference approach is statistically consistent under DLCoal. Supplementary information Supplementary data are available at Bioinformatics online.

59 BASIC BIOLOGICAL SCIENCES↗

Neuro-Spark: A Submicrosecond Spiking Neural Networks Architecture for In-Sensor Filtering

Neuro-Spark, which is a new neuromorphic architecture with a field-programmable gate array (FPGA) implementation for ultrafast spiking neural network (SNN) inference at the edge, facilitates smart-pixel in-sensor filtering for high-energy physics experiments at the Large Hadron Collider (LHC). Utilizing the evolutionary optimization for neuromorphic systems (EONS) training method, we generate compact SNN models with 91% signal efficiency, akin to convolutional neural networks but with half the parameters. However, deploying near the detector poses a challenge because the SNN must handle a sustained input data rate exceeding 1013 GB/s. To overcome this, we propose a novel hardware architecture that uses high-level synthesis to construct a tuned architecture for the EONS-trained SNN. In addition to the analysis and validation with an AMD Xilinx Artix-A7 FPGA, our solution consumes only ç24% of FPGA LUT and flipflops. We also introduce an innovative quantization method that reduces FPGA resource utilization by ç15% without compromising accuracy. Our FPGA implementation achieves computing latency of ç10 ns for smart-pixel application inference on an edge FPGA.

Miniskar, Narasinga Rao↗