Search NASA⌕ Search

SEARCH · Search NASA

Results for “evolutionary algorithms”

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 289 records · Page 16

Comparative Analysis of TRGBs (CATs) from Unsupervised, Multi-halo-field Measurements: Contrast is Key

The tip of the red giant branch (TRGB) is an apparent discontinuity of the luminosity function (LF) due to the end of the red giant evolutionary phase and is used to measure distances in the local universe. In practice, tip localization via edge detection response (EDR) relies on several methods applied on a case-by-case basis. It is hard to evaluate how individual choices affect a distance estimation using only a single host field while also avoiding confirmation bias. To devise a standardized approach, we compare unsupervised, algorithmic analyses of the TRGB in multiple halo fields per galaxy. We first optimize methods for the lowest field-to-field dispersion, including spatial filtering, smoothing, and weighting of LF, color band selection, and tip selection based on the number of likely RGB stars and the ratio of stars below versus above the tip (R). We find R, which we call the tip contrast, to be the most important indicator of the quality of EDR measurements; higher R selection can decrease field-to-field dispersion. Further, since R is found to correlate with the age or metallicity of the stellar population based on theoretical modeling, it might result in a displacement of the detected tip magnitude. We find a tip-contrast relation with a slope of -0.023 ± 0.0046 mag/ratio, an ~5σ result that can be used to correct these variations in the detections. When using TRGB to establish a distance ladder, consistent TRGB standardization using tip-contrast relation across rungs is vital to make robust cosmological measurements.

79 ASTRONOMY AND ASTROPHYSICS↗

Local packing modulates diversity of iron pathways and cooperative behavior in eukaryotic and prokaryotic ferritins

Ferritin-like molecules show a remarkable combination of the evolutionary conserved activity of iron uptake and release that engage different pores in the conserved ferritin shell. It was hypothesized that pore selection and iron traffic depend on dynamic allostery with no conformational changes in the backbone. In this study, we detect the allosteric networks in Pseudomonas aeruginosa bacterioferritin (BfrB), bacterial ferritin (FtnA), and bullfrog M and L ferritins (Ftns) by a network-weaving algorithm (NWA) that passes threads of an allosteric network through highly correlated residues using hierarchical clustering. The residue-residue correlations are calculated in the packing-on elastic network model that introduces atom packing into the common packing-off model. Applying NWA revealed that each of the molecules has an extended allosteric network mostly buried inside the ferritin shell. The structure of the networks is consistent with experimental observations of iron transport: The allosteric networks in BfrB and FtnA connect the ferroxidase center with the 4-fold pores and B-pores, leaving the 3-fold pores unengaged. In contrast, the allosteric network directly links the 3-fold pores with the 4-fold pores in M and L Ftns. The majority of the network residues are either on the inner surface or buried inside the subunit fold or at the subunit interfaces. We hypothesize that the ferritin structures evolved in a way to limit the influence of functionally unrelated events in the cytoplasm on the allosteric network to maintain stability of the translocation mechanisms. We showed that the residue-residue correlations and the resultant long-range cooperativity depend on the ferritin shell packing, which, in turn, depends on protein sequence composition. Switching from the packing-on to the packing-off model reduces correlations by 35%–38% so that no allosteric network can be found. The influence of the side-chain packing on the allosteric networks explains the diversity in mechanisms of iron traffic suggested by experimental approaches.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Making social networks more human: A topological approach

A key problem in social network analysis is to identify nonhuman interactions. State-of-the-art bot-detection systems like Botometer train machine-learning models on user-specific data. Unfortunately, these methods do not work on data sets in which only topological information is available. In this paper, we propose a new, purely topological approach. Our method removes edges that connect nodes exhibiting strong evidence of non-human activity from publicly available electronic-social-network datasets, including, for example, those in the Stanford Network Analysis Project repository (SNAP). Our methodology is inspired by classic work in evolutionary psychology by Dunbar that posits upper bounds on the total strength of the set of social connections in which a single human can be engaged. We model edge strength with Easley and Kleinberg's topological estimate; label nodes as “violators” if the sum of these edge strengths exceeds a Dunbar-inspired bound; and then remove the violator-to-violator edges. We run our algorithm on multiple social networks and show that our Dunbar-inspired bound appears to hold for social networks, but not for nonsocial networks. Our cleaning process classifies 0.04% of the nodes of the Twitter-2010 followers graph as violators, and we find that more than 80% of these violator nodes have Botometer scores of 0.5 or greater. Furthermore, after we remove the roughly 15 million violator-violator edges from the 1.2-billion-edge Twitter-2010 follower graph, 34% of the violator nodes experience a factor-of-two decrease in PageRank. PageRank is a key component of many graph algorithms such as node/edge ranking and graph sparsification. Thus, this artificial inflation would bias algorithmic output, and result in some incorrect decisions based on this output.

97 MATHEMATICS AND COMPUTING↗

Recovered supernova Ia rate from simulated LSST images

Aims.TheVera C. RubinObservatory’s Legacy Survey of Space and Time (LSST) will revolutionize time-domain astronomy by detecting millions of different transients. In particular, it is expected to increase the number of known type Ia supernovae (SN Ia) by a factor of 100 compared to existing samples up to redshift ∼1.2. Such a high number of events will dramatically reduce statistical uncertainties in the analysis of the properties and rates of these objects. However, the impact of all other sources of uncertainty on the measurement of the SN Ia rate must still be evaluated. The comprehension and reduction of such uncertainties will be fundamental both for cosmology and stellar evolution studies, as measuring the SN Ia rate can put constraints on the evolutionary scenarios of different SN Ia progenitors. Methods.We used simulated data from the Dark Energy Science Collaboration (DESC) Data Challenge 2 (DC2) and LSST Data Preview 0 to measure the SN Ia rate on a 15 deg 2 region of the “wide-fast-deep” area. We selected a sample of SN candidates detected in difference images, associated them to the host galaxy with a specially developed algorithm, and retrieved their photometric redshifts. We then tested different light-curve classification methods, with and without redshift priors (albeit ignoring contamination from other transients, as DC2 contains only SN Ia). We discuss how the distribution in redshift measured for the SN candidates changes according to the selected host galaxy and redshift estimate. Results.We measured the SN Ia rate, analyzing the impact of uncertainties due to photometric redshift, host-galaxy association and classification on the distribution in redshift of the starting sample. We find that we are missing 17% of the SN Ia, on average, with respect to the simulated sample. As 10% of the mismatch is due to the uncertainty on the photometric redshift alone (which also affects classification when used as a prior), we conclude that this parameter is the major source of uncertainty. We discuss possible reduction of the errors in the measurement of the SN Ia rate, including synergies with other surveys, which may help us to use the rate to discriminate different progenitor models.

Astronomy & Astrophysics↗

Structure, Elastic Constants and XRD Spectra of Extended Solids under High Pressure

We present results of evolutionary simulations based on density functional calculations of a potentially new type of energetic materials called extended solids: P-N and N-H. High-density structures with covalent bonds generated using variable and fixed concentration methods were analysed in terms of thermo-dynamical stability and agreement with experimental X-ray diffraction (XRD) spectra. X-ray diffraction spectra were calculated using a virtual diffraction algorithm that computes kinematic diffraction intensity in three-dimensional reciprocal space before being reduced to a two-theta line profile. Calculated XRD patterns were used to search for the structure of extended solids present at experimental pressures by optimizing data according to experimental XRD peak position, peak intensity and theoretically calculated enthalpy. Elastic constants has been calculated for thermodynamically stable structures of P-N system.

Batyrev, I. G.↗

Lazy Updating of hubs can enable more realistic models by speeding up stochastic simulations

To respect the nature of discrete parts in a system, stochastic simulation algorithms (SSAs) must update for each action (i) all part counts and (ii) each action's probability of occurring next and its timing. This makes it expensive to simulate biological networks with well-connected “hubs” such as ATP that affect many actions. Temperature and volume also affect many actions and may be changed significantly in small steps by the network itself during fever and cell growth, respectively. Such trends matter for evolutionary questions, as cell volume determines doubling times and fever may affect survival, both key traits for biological evolution. Yet simulations often ignore such trends and assume constant environments to avoid many costly probability updates. Such computational convenience precludes analyses of important aspects of evolution. Here we present “Lazy Updating,” an add-on for SSAs designed to reduce the cost of simulating hubs. When a hub changes, Lazy Updating postpones all probability updates for reactions depending on this hub, until a threshold is crossed. Speedup is substantial if most computing time is spent on such updates. We implemented Lazy Updating for the Sorting Direct Method and it is easily integrated into other SSAs such as Gillespie's Direct Method or the Next Reaction Method. Testing on several toy models and a cellular metabolism model showed >10× faster simulations for its use-cases—with a small loss of accuracy. Thus we see Lazy Updating as a valuable tool for some special but important simulation problems that are difficult to address efficiently otherwise.

97 MATHEMATICS AND COMPUTING↗

GenomeFace v1.0

GenomeFace is meta-genome binning software. Metagenomic binning, the process of grouping DNA sequences into taxonomic units, is critical for understanding the functions, interactions, and evolutionary dynamics of microbial communities. We propose a deep learning approach to binning using two neural networks, one based on composition and another on environmental abundance, dynamically weighting the contribution of each based on characteristics of the input data. Trained on over 43,000 prokaryotic genomes, our network for composition-based binning is inspired by metric learning techniques used for facial recognition. Using a task-specific, multi-GPU accelerated algorithm to cluster the embeddings produced by our network, our binner leverages marker genes observed to be universally present in nearly all taxa to grade and select optimal clusters of sequences from a hierarchy of candidates. We evaluate our approach on four simulated datasets with known ground truth. Our linear time integration of marker genes recovers more near complete genomes than state of the art but computationally infeasible solutions using them, while being over an order of magnitude faster. Finally, we demonstrate the scalability and acuity of our approach by testing it on three of the largest metagenome assemblies ever performed. Compared to other binners, we produced 47%-183% more near complete genomes. From these datasets, we find over the genomes of over 3000 new candidate species which have never been previously cataloged, representing a potential 4% expansion of the known bacterial tree of life.

Lettich, Richard [Lawrence Berkeley National Labor↗

Lignin-KMC: A Toolkit for Simulating Lignin Biosynthesis

Lignin is a bountiful biopolymer of phenylpropanoid monomers that is critical for plant structure and function. Based on the abundance of lignin in the biosphere and interest in lignin valorization, a more comprehensive understanding of lignin biosynthesis is imperative. We introduce an open-source software toolkit, Lignin-KMC, that combines kinetic Monte Carlo and first-principles calculations of radical coupling events to model lignin biosynthesis in silico. Lignification is simulated using the Gillespie algorithm with rates derived from density functional theory calculations of individual fragment couplings. Using this approach, we confirm experimental findings regarding the impact of lignification conditions on the polymer structure such as (1) the positive correlation between sinapyl alcohol fraction and depolymerization yield and (2) the primarily benzodioxane linked structure of C-lignin. Furthermore, we identify the in planta monolignol supply rate as a possible control mechanism for lignin biosynthesis based on evolutionary stresses. These examples not only highlight the robustness of our modeling framework but also motivate future studies of new lignin types, unexplored monolignol chemistries, and lignin structure predictions, all with an overarching aim of developing a more comprehensive molecular understanding of native lignin, which, in turn, can accelerate the biological and chemistry communities interested in this important biopolymer.

09 BIOMASS FUELS↗

CLUSTERING PROPERTIES OF FAR-INFRARED SOURCES IN Hi-GAL SCIENCE DEMONSTRATION PHASE FIELDS

We use a minimum spanning tree (MST) algorithm to characterize the spatial distribution of Galactic far-IR sources and derive their clustering properties. We aim to reveal the spatial imprint of different types of star-forming processes, e.g., isolated spontaneous fragmentation of dense molecular clouds, or events of triggered star formation around H II regions, and highlight global properties of star formation in the Galaxy. We plan to exploit the entire Herschel infrared GALactic (Hi-GAL) survey of the inner Galactic plane to gather significant statistics on the clustering properties of star-forming regions and to look for possible correlations with source properties such as mass, temperature, or evolutionary stage. In this paper, we present a pilot study based on the two 2 deg. x 2 deg. fields centered at longitudes l = 30 deg. and l = 59 deg. obtained during the science demonstration phase of the Herschel mission. We find that over half of the clustered sources are associated with H II regions and infrared dark clouds. Our analysis also reveals a smooth chromatic evolution of the spatial distribution where sources detected at short wavelengths, likely protostars surrounded by warm circumstellar material emitting in the far-infrared, tend to be clustered in dense and compact groups around H II regions while sources detected at long wavelengths, presumably cold and dusty density enhancements of the ISM emitting in the submillimeter, are distributed in larger and looser groups.

79 ASTRONOMY AND ASTROPHYSICS↗

Regional surname affinity: A spatial network approach

Abstract Objective We investigate surname affinities among areas of modern‐day China, by constructing a spatial network, and making community detection. It reports a geographical genealogy of the Chinese population that is result of population origins, historical migrations, and societal evolutions. Materials and methods We acquire data from the census records supplied by China's National Citizen Identity Information System, including the surname and regional information of 1.28 billion registered Chinese citizens. We propose a multilayer minimum spanning tree (MMST) to construct a spatial network based on the matrix of isonymic distances, which is often used to characterize the dissimilarity of surname structure among areas. We use the fast unfolding algorithm to detect network communities. Results We obtain a 10‐layer MMST network of 362 prefecture nodes and 3,610 edges derived from the matrix of the Euclidean distances among these areas. These prefectures are divided into eight groups in the spatial network via community detection. We measure the partition by comparing the inter‐distances and intra‐distances of the communities and obtain meaningful regional ethnicity classification. Discussion The visualization of the resulting communities on the map indicates that the prefectures in the same community are usually geographically adjacent. The formation of this partition is influenced by geographical factors, historic migrations, trade and economic factors, as well as isolation of culture and language. The MMST algorithm proves to be effective in geo‐genealogy and ethnicity classification for it retains essential information about surname affinity and highlights the geographical consanguinity of the population.

59 BASIC BIOLOGICAL SCIENCES↗

Online evolutionary neural architecture search for multivariate non-stationary time series forecasting

Time series forecasting (TSF) is one of the most important tasks in data science. TSF models are usually pre-trained with historical data and then applied on future unseen datapoints. However, real-world time series data is usually non-stationary and models trained offline usually face problems from data drift. Models trained and designed in an offline fashion can not quickly adapt to changes quickly or be deployed in real-time. To address these issues, this work presents the Online NeuroEvolution-based Neural Architecture Search (ONE-NAS) algorithm, which is a novel neural architecture search method capable of automatically designing and dynamically training recurrent neural networks (RNNs) for online forecasting tasks. Without any pre-training, ONE-NAS utilizes populations of RNNs that are continuously updated with new network structures and weights in response to new multivariate input data. ONE-NAS is tested on real-world, large-scale multivariate wind turbine data as well as the univariate Dow Jones Industrial Average (DJIA) dataset. These results demonstrate that ONE-NAS outperforms traditional statistical time series forecasting methods, including online linear regression, fixed long short-term memory (LSTM) and gated recurrent unit (GRU) models trained online, as well as state-of-the-art, online ARIMA strategies. Additionally, results show that utilizing multiple populations of RNNs which are periodically repopulated provide significant performance improvements, allowing this online neural network architecture design and training to be successful.

97 MATHEMATICS AND COMPUTING↗

Detecting macroevolutionary genotype–phenotype associations using error-corrected rates of protein convergence

On macroevolutionary timescales, extensive mutations and phylogenetic uncertainty mask the signals of genotype–phenotype associations underlying convergent evolution. To overcome this problem, we extended the widely used framework of non-synonymous to synonymous substitution rate ratios and developed the novel metric ω C , which measures the error-corrected convergence rate of protein evolution. While ω C distinguishes natural selection from genetic noise and phylogenetic errors in simulation and real examples, its accuracy allows an exploratory genome-wide search of adaptive molecular convergence without phenotypic hypothesis or candidate genes. Using gene expression data, we explored over 20 million branch combinations in vertebrate genes and identified the joint convergence of expression patterns and protein sequences with amino acid substitutions in functionally important sites, providing hypotheses on undiscovered phenotypes. We further extended our method with a heuristic algorithm to detect highly repetitive convergence among computationally non-trivial higher-order phylogenetic combinations. Our approach allows bidirectional searches for genotype–phenotype associations, even in lineages that diverged for hundreds of millions of years.

59 BASIC BIOLOGICAL SCIENCES↗

EVOLUTION OF CATACLYSMIC VARIABLES AND RELATED BINARIES CONTAINING A WHITE DWARF

We present a binary evolution study of cataclysmic variables (CVs) and related systems with white dwarf (WD) accretors, including for example, AM CVn systems, classical novae, supersoft X-ray sources (SXSs), and systems with giant donor stars. Our approach intentionally avoids the complications associated with population synthesis algorithms, thereby allowing us to present the first truly comprehensive exploration of all of the subsequent binary evolution pathways that zero-age CVs might follow (assuming fully non-conservative, Roche-lobe overflow onto an accreting WD) using the sophisticated binary stellar evolution code MESA. The grid consists of 56,000 initial models, including 14 WD accretor masses, 43 donor-star masses (0.1–4.7 M {sub ⊙}), and 100 orbital periods. We explore evolution tracks in the orbital period and donor-mass ( P {sub orb}– M {sub don}) plane in terms of evolution dwell times, masses of the WD accretor, accretion rate, and chemical composition of the center and surface of the donor star. We report on the differences among the standard CV tracks, those with giant donor stars, and ultrashort period systems. We show where in parameter space one can expect to find SXSs, present a diagnostic to distinguish among different evolutionary paths to forming AM CVn binaries, quantify how the minimum orbital period in CVs depends on the chemical composition of the donor star, and update the P {sub orb}( M {sub wd}) relation for binaries containing WDs whose progenitors lost their envelopes via stable Roche-lobe overflow. Finally, we indicate where in the P {sub orb}– M {sub don} the accretion disks will tend to be stable against the thermal-viscous instability, and where gravitational radiation signatures may be found with LISA.

79 ASTRONOMY AND ASTROPHYSICS↗

Bi-directional evolutionary optimization for photonic band gap structures

Toward an efficient and easy-implement optimization for photonic band gap structures, this paper extends the bi-directional evolutionary structural optimization (BESO) method for maximizing photonic band gaps. Photonic crystals are assumed to be periodically composed of two dielectric materials with the different permittivity. Based on the finite element analysis and sensitivity analysis, BESO starts from a simple initial design without any band gap and gradually re-distributes dielectric materials within the unit cell so that the resulting photonic crystal possesses a maximum band gap between two specified adjacent bands. Numerical examples demonstrated the proposed optimization algorithm can successfully obtain the band gaps from the first to the tenth band for both transverse magnetic and electric polarizations. Some optimized photonic crystals exhibit novel patterns markedly different from traditional designs of photonic crystals.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

ORBITAL MOTION OF HR 8799 b, c, d USING HUBBLE SPACE TELESCOPE DATA FROM 1998: CONSTRAINTS ON INCLINATION, ECCENTRICITY, AND STABILITY

HR 8799 is currently the only multiple-planet system that has been detected with direct imaging, with four giant planets of masses 7-10 M{sub Jup} orbiting at large separations (15-68 AU) from this young late A star. Orbital motion provides insight into the stability and possible formation mechanisms of this planetary system. Dynamical studies can also provide constraints on the planets' masses, which help calibrate evolutionary models, yet measuring the orbital motion is a very difficult task because the long-period orbits (50-500 yr) require long time baselines and high-precision astrometry. This paper studies the three planets HR 8799b, c, and d in the archival data set of HR 8799 obtained with the Hubble Space Telescope (HST) NICMOS coronagraph in 1998. The detection of all three planets is made possible by a careful optimization of the Locally Optimized Combination of Images algorithm, and we used a statistical analysis of a large number of reduced images. This work confirms previous astrometry for planet b and presents new detections and astrometry for planets c and d. These HST images provide a ten-year baseline with the discovery images from 2008, and therefore offer a unique opportunity to constrain their orbital motion now. Recent dynamical studies of this system show the existence of a few possible stable solutions involving mean motion resonances (MMRs), where the interaction between c and d plays a major role. We study the compatibility of a few of these stable scenarios (1d:1c, 1d:2c, or 1d:2c:4d) with the new astrometric data from HST. In the hypothesis of a 1d:2c:4b MMR our best orbit fit is close to the stable solution previously identified for a three-planet system and involves low eccentricity for planet d (e{sub d} = 0.10) and moderate inclination of the system (i = 28.0 deg), assuming a coplanar system, circular orbits for b and c, and exact resonance with integer period ratios. Under these assumptions, we can place strong constraints on the inclination of the system (27.3-31.4 deg) and on the eccentricity for d e{sub d} < 0.46. Our results are robust to small departures from exact integer period ratios and consistent with previously published results based on dynamical studies for a three-planet system prior to the discovery of the fourth planet.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗

Deep representation learning improves prediction of LacI-mediated transcriptional repression

Significance The understanding of protein function increases with new experimental and evolutionary datasets. A major challenge is to apply machine learning to these datasets to capture essential features of protein function. Here, we analyze the experimentally determined repression function for tens of thousands of mutants of the LacI protein. This study provides a continuous, noncategorical repression value across a majority of all single mutations and for thousands of higher-order mutations. To develop a top-performing model for the prediction of repression by LacI, we compare several leading variant effect prediction algorithms. A deep representation learning paradigm, first trained across millions of proteins from all known protein families and then fine-tuned using LacI experimental data, offers the highest predictive performance of repression function.

42 ENGINEERING↗

Finding Your Niche: An Evolutionary Approach to HPC Topologies

Traditional interconnection network design approaches focus on building general network topologies by optimizing the bisection bandwidth or minimizing the network’s diameter to reduce the maximum distance between any two nodes, thus amortizing the overall execution time of the HPC workloads. While such network topologies may accommodate a wide variety of applications in general, this may result in sub-optimal performance for many frequently-executed or dynamic workloads. In this paper, instead of focusing on designing an all-encompassing, general-purpose network topology, we develop a methodology to design customized network interconnects, evolved by “finding” the optimal topologies for a particular target workload given by its communication and contention profiles. To this end, we implement a Genetic Algorithm (GA)-based approach for network topology design tailored to improve the overall execution time of a particular workload of interest. We conducted extensive experiments with well-known motifs in physics-based workloads (Sweep3D and FFT), as well as with a representative graph application (MiniVite), using the well-known Structural Simulation Toolkit (SST) Macroscale Element Library (SST/macro) simulator for network interconnect evaluation. We demonstrate that our genetic algorithm-based approach is robust enough to find the underlying optimal topology of a particular workload.

network interconnects, graph search, meta-heuristi↗