Search NASA⌕ Search

SEARCH · Search NASA

Results for “adaptive structures space structures”

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 37 records · Page 2

In Silico Screening of CO 2 –Dipeptide Interactions for Bioinspired Carbon Capture

Carbon capture, sequestration and utilization offers a viable solution for reducing the total amount of atmospheric CO 2 concentrations. On an industrial scale, amine-based solvents are extensively employed for CO 2 capture through chemisorption. Nevertheless, this method is marked by the high cost associated with solvent regeneration, high vapor pressure, and the corrosive and toxic attributes of by-products, such as nitrosamines. An alternative approach is the biomimicry of sustainable materials that have strong affinity and selectivity for CO 2 . Bioinspired approaches, such as those based on naturally occurring amino acids, have been proposed for direct air capture methodologies. In this study, we present a database consisting of 960 dipeptide molecular structures, composed of the 20 naturally occurring amino acids. Furthermore, those structures were analyzed with a novel computational workflow presented in this work that considers certain interaction sites that determine CO 2 affinity. Density functional theory (DFT) and symmetry-adapted perturbation theory (SAPT) computations were performed for the calculation of CO 2 interaction energies, which allowed to limit our search space to 400 unique dipeptide structures. Using this computational workflow, we provide statistical insights into dipeptides and their affinity for CO 2 binding, as well as design principles that can further enhance CO 2 capture through cooperative binding.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Multi-Objective Bayesian Optimized Human Assessed Multi-Target Generated Spectral Recommender System for Rapid Pareto Discoveries of Material Properties

Optimization for different tasks like material characterization, synthesis, and functional properties for desired applications over multi-dimensional control parameter and function spaces need a rapid strategic search through active learning. However, in all cases prior to optimization, the target material properties are assumed known and fixed, which mostly deviates from real-world scenarios in material synthesis. This can be critical for running expensive experiments on new materials, when the experimental results are fuzzy for any scientific outcomes due to improper target setting, ultimately wasting time and cost. The failure rate and cost are even higher over exploring on multi-target space, where we want to learn the pareto among multiple properties, to jointly optimize during material synthesis for desired applications. To address the challenge, here we introduce the human-operator attempt flexibility in the active learning based automated experiment framework, with generating multiple human assessed targets through a voting-based recommender system during real-time microscope measurements over the large material image space, sequentially learn/update multiple desired targets through a weighting system, and adaptively search in multiple material properties functional space for non-dominated pareto discoveries to maximize the custom structural similarity based acquisition function. We term this a multi-objective Bayesian optimized human assessed multi-target generated spectral recommender systems (MOBO-HAM-SRS). The approach has been demonstrated to peizoresponse force spectroscopy of a ferroelectric thin film, exploring with different kernels and acquisition functions. This work shows an advancement towards human-AI collaborated automated experiments, steering optimization trajectories through human overpowering AI at the early stage when uncertainty is high and AI overpowering human at the later stage with rapid exploration towards optimal goal, following human-assessed multiple targets properties.

Biswas, Arpan↗

Neural architecture search via similarity adaptive guidance

Evolutionary neural network architecture search (ENAS) has attracted the attention of many experts due to its global optimization capabilities to automatically search for convolutional neural network architectures based on the target task. The current search space for ENAS is not to design a fully structured network, but to search for smaller cell architectures to reduce search costs. However, blind search strategies do not effectively utilize the potential experience of the population. In order to utilize the potential experience learned by the current population to guide the evolutionary search of the population, we propose a similarity guided neural network architecture search algorithm based on cell architecture, which utilizes the similarity between pairwise architectures in the population as empirical knowledge learned by the population. Our proposed algorithm provides a novel method for calculating architecture similarity, which calculates architecture similarity separately from the cell and macro-structure. Then we decouple the connections and operations in the cell and calculate connection and operation similarity separately. In addition, we propose adaptive similarity selection and binary tournament selection strategies to enhance the algorithm’s global and local search capabilities and effectively explore the search space. Finally, we design an improved single-point crossover operator to enhance the local search ability of the evolutionary operator. The experimental results show that SAGNAS is a competitive algorithm that achieves 97.44% and 81.60% in CIFAR10 and CIFAR100 with only 1.9 GPU-days spent.

97 MATHEMATICS AND COMPUTING↗

Contrasting coordination of non‐structural carbohydrates with leaf and root economic strategies of alpine coniferous forests

Non-structural carbohydrates (NSCs), as the labile fraction and dominant carbon currency, are essential mediators of plant adaptation to environments. However, whether and how NSC coordinates with plant economic strategy frameworks, particularly the well-recognized leaf economics spectrums (LES) and root economics space (RES), remains unclear. We examined the relationships between NSC and key plant economics traits in leaves and fine roots across 90 alpine coniferous populations on the Tibetan Plateau, China. We observed contrasting coordination of NSC with economics traits in leaves and roots. Leaf total NSC and soluble sugar aligned with the leaf economic spectrum, conveying a trade-off between growth and storage in leaves. However, NSC in roots was independent of the root economic spectrum, but highly coordinated with root foraging, with more starch and less sugar in forage-efficient, thinner roots. Further, NSC-trait coordination in leaves and roots was, respectively, driven by local temperature and precipitation. These findings highlight distinct roles of NSC in shaping the above- and belowground multidimensional economics trait space, and NSC-based carbon economics provides a mechanistic understanding of how plants adapt to heterogeneous habitats and respond to environmental changes.

54 ENVIRONMENTAL SCIENCES↗

Footprints of Worldwide Adaptation in Structured Populations of Drosophila melanogaster Through the Expanded DEST 2.0 Genomic Resource

Abstract Large-scale genomic resources can place genetic variation into an ecologically informed context. To advance our understanding of the population genetics of the fruit fly Drosophila melanogaster, we present an expanded release of the community-generated population genomics resource Drosophila Evolution over Space and Time (DEST 2.0; https://dest.bio/). This release includes 530 high-quality pooled libraries from flies collected across six continents over more than a decade (2009 to 2021), most at multiple time points per year; 211 of these libraries are sequenced and shared here for the first time. We used this enhanced resource to elucidate several aspects of the species' demographic history and identify novel signs of adaptation across spatial and temporal dimensions. For example, we showed that the spatial genetic structure of populations is stable over time, but that drift due to seasonal contractions of population size causes populations to diverge over time. We identified signals of adaptation that vary between continents in genomic regions associated with xenobiotic resistance, consistent with independent adaptation to common pesticides. Moreover, by analyzing samples collected during spring and fall across Europe, we provide new evidence for seasonal adaptation related to loci associated with pathogen response. Furthermore, we have also released an updated version of the DEST genome browser. This is a useful tool for studying spatiotemporal patterns of genetic variation in this classic model system.

Biochemistry & Molecular Biology↗

Adaptive Conformer Sampling for Property Prediction Using the Conductor-like Screening Model for Real Solvents

The valorization of lignocellulose-derived bioproducts requires effective separation from excessive water. Liquid–liquid extraction is a promising low-energy separation technology, but effective extraction requires solvent selection based on the thermodynamic properties of the bioproduct and solvent components. We propose a computational framework for predicting such properties by developing an adaptive conformer selection approach for use with COSMO-RS (conductor-like screening model for real solvents) calculations. In this framework, molecular dynamics simulations are used to generate many molecular structures (conformers) at representative temperatures in varying solvent environments. Conformers are then clustered based on structural metrics in a low-dimensional space and selected using a mixed-integer quadratic programming problem to iteratively insert a sampled conformer. At each iteration, we determine bioproduct properties using COSMO-RS. Here, we demonstrate the capability of the proposed framework on representative bioproducts to show convergence of the adaptive sampling toward experimentally measured properties with fewer calculations than required by random conformer sampling, enabling the improved screening of solvent systems for liquid-phase separation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Determination of nuclear PDFs using Markov chain Monte Carlo methods

Global QCD analyses of nuclear parton distribution functions (nPDFs) have traditionally relied on the Hessian method for uncertainty estimation. However, the inherent Gaussian approximation and reliance on local curvature often prove insufficient for nPDF fits, which are frequently characterized by limited data constraints and non-Gaussian likelihoods. In this paper, we present the first nPDF determination based on Markov Chain Monte Carlo (MCMC) techniques, implemented within the nCTEQ framework using an adaptive Metropolis-Hastings algorithm. The MCMC approach enables a direct mapping of the posterior distribution and reveals a highly nontrivial parameter-space structure, including multiple modes and pronounced non-Gaussian behavior, particularly for the valence PDFs. We perform the first single-nucleus global analysis of lead PDFs using exclusively lead data and compare it to a multi-nuclei fit employing a standard analytic A dependence. The inclusion of lighter nuclei reduces quark uncertainties and modifies the shape of the lead PDFs, while leaving the gluon distribution largely unaffected. A complementary Hessian analysis exposes systematic limitations of the Gaussian approximation. Our results demonstrate that MCMC methods provide a more reliable framework for uncertainty quantification in nPDF determinations.

Derakhshanian, N. [Institute of Nuclear Physics Po↗

Explicit Monotone Stable Super-Time-stepping Methods for Finite Time Singularities

We explore a novel way to numerically resolve the scaling behavior of finite-time singularities in solutions of nonlinear parabolic PDEs. The Runge–Kutta–Legendre (RKL) and Runge–Kutta–Gegenbauer (RKG) super-time-stepping methods were originally developed for nonlinear complex physics problems with diffusion. These are multistage single step second-order, forward-in-time methods with no implicit solves. The advantage is that the time-step size for stability scales with stage number 𝑠 as $\mathcal{O}$⁡(𝑠 2 ). Many interesting nonlinear PDEs have finite-time singularities, and the presence of diffusion often limits one to using implicit or semi-implicit time-step methods for stability constraints. Finite-time singularities are particularly challenging due to the large range of scales that one desires to resolve, often with adaptive spatial grids and adaptive time steps. Here, in this study, we show two examples of nonlinear PDEs for which the self-similar singularity structure has time and space scales that are resolvable using the RKL and RKG methods, without forcing even smaller time steps. Compared to commonly used implicit numerical methods, we achieve a significantly smaller run time while maintaining comparable accuracy. We also prove numerical monotonicity for both the RKL and RKG methods under their linear stability conditions for the constant coefficient heat equation, in the case of infinite domain and periodic boundary condition, leading to a theoretical guarantee of the superiority of the RKL and RKG methods over traditional super-time-stepping methods, such as the Runge-Kutta-Chebyshev and the orthogonal Runge-Kutta-Chebyshev methods. Code can be found at https://github.com/ZT220501/SRK-Singularity.

97 MATHEMATICS AND COMPUTING↗

Computational Modeling To Adapt Neutralizing Antibody

Monoclonal antibodies (mAbs) is the leading therapy for viral infections because it provides immediate protection and can be administered at higher levels than in a natural immune response. Finding mAbs that neutralize a broad spectrum of viral targets has proven difficult because many species and strains exist and blanket targeting is a slow and laborious process to experimentally screen 108 variants. A new method is needed to rapidly redesign mAbs for homologous targets. This project speeds up redesign using structure-based computational design to reduce the mAbs search space to a manageable level and screen mutants at a much higher rate than in experiments. Computation will also provide critical knowledge about the fundamental interactions. The project will adapt S230, a human antibody that neutralizes SARS-CoV, to neutralize SARS-COV-2.

60 APPLIED LIFE SCIENCES↗

The Effect of Geometry, Spin, and Orbital Optimization in Achieving Accurate, Correlated Results for Iron–Sulfur Cubanes

Iron–sulfur clusters comprise an important functional motif in the catalytic centers of biological systems, capable of enabling important chemical transformations at ambient conditions. This remarkable capability derives from a notoriously complex electronic structure that is characterized by a high density of states that is sensitive to geometric changes. The spectral sensitivity to subtle geometric changes has received little attention from correlated, large active space calculations, owing partly to the exceptional computational complexity for treating these large and correlated systems accurately. Here, to provide insight into this aspect, we report the first Complete Active Space Self Consistent Field (CASSCF) calculations for different geometries of the [Fe(II/III) 4 S 4 (SMe) 4 ] -2 clusters using two complementary, correlated solvers: spin-pure Adaptive Sampling Configuration Interaction (ASCI) and Density Matrix Renormalization Group (DMRG). We find that the previously established picture of a double-exchange driven magnetic structure, with minute energy gaps (<1 mHa) between consecutive spin states, has a weak dependence on the underlying geometry. However, the spin gap between the singlet and the spin state 2S + 1 = 19, corresponding to a maximal number of Fe-d electrons being unpaired and of parallel spin, is strongly geometry dependent, changing by a factor of 3 upon slight deformations that are still within biologically relevant parameters. The CASSCF orbital optimization procedure, using active spaces as large as 86 electrons in 52 orbitals, was found to reduce this gap compared to typical mean-field orbital approaches. Our results show the need for performing large active space calculations to unveil the challenging electronic structure of these complex catalytic centers and should serve as accurate starting points for fully correlated treatments upon inclusion of dynamical correlation outside the active space.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Navigating the Expansive Landscapes of Soft Materials: A User Guide for High-Throughput Workflows

Synthetic polymers are highly customizable with tailored structures and functionality, yet this versatility generates challenges in the design of advanced materials due to the size and complexity of the design space. Thus, exploration and optimization of polymer properties using combinatorial libraries has become increasingly common, which requires careful selection of synthetic strategies, characterization techniques, and rapid processing workflows to obtain fundamental principles from these large data sets. Herein, we provide guidelines for strategic design of macromolecule libraries and workflows to efficiently navigate these high-dimensional design spaces. We describe synthetic methods for multiple library sizes and structures as well as characterization methods to rapidly generate data sets, including tools that can be adapted from biological workflows. We further highlight relevant insights from statistics and machine learning to aid in data featurization, representation, and analysis. This Perspective acts as a “user guide” for researchers interested in leveraging high-throughput screening toward the design of multifunctional polymers and predictive modeling of structure–property relationships in soft materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Adaptive language model training for molecular design

Abstract The vast size of chemical space necessitates computational approaches to automate and accelerate the design of molecular sequences to guide experimental efforts for drug discovery. Genetic algorithms provide a useful framework to incrementally generate molecules by applying mutations to known chemical structures. Recently, masked language models have been applied to automate the mutation process by leveraging large compound libraries to learn commonly occurring chemical sequences (i.e., using tokenization) and predict rearrangements (i.e., using mask prediction). Here, we consider how language models can be adapted to improve molecule generation for different optimization tasks. We use two different generation strategies for comparison, fixed and adaptive. The fixed strategy uses a pre-trained model to generate mutations; the adaptive strategy trains the language model on each new generation of molecules selected for target properties during optimization. Our results show that the adaptive strategy allows the language model to more closely fit the distribution of molecules in the population. Therefore, for enhanced fitness optimization, we suggest the use of the fixed strategy during an initial phase followed by the use of the adaptive strategy. We demonstrate the impact of adaptive training by searching for molecules that optimize both heuristic metrics, drug-likeness and synthesizability, as well as predicted protein binding affinity from a surrogate model. Our results show that the adaptive strategy provides a significant improvement in fitness optimization compared to the fixed pre-trained model, empowering the application of language models to molecular design tasks.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Probabilistic Context Neighborhood model for lattices

Here we present the Probabilistic Context Neighborhood model designed for two-dimensional lattices as a variation of a Markov random field assuming discrete values. In this model, the neighborhood structure has a fixed geometry but a variable order, depending on the neighbors’ values. Our model extends the Probabilistic Context Tree model, originally applicable to one-dimensional space. It retains advantageous properties, such as representing the dependence neighborhood structure as a graph in a tree format, facilitating an understanding of model complexity. Furthermore, we adapt the algorithm used to estimate the Probabilistic Context Tree to estimate the parameters of the proposed model. We illustrate the accuracy of our estimation methodology through simulation studies. Additionally, we apply the Probabilistic Context Neighborhood model to spatial real-world data, showcasing its practical utility.

97 MATHEMATICS AND COMPUTING↗

Multiobjective and categorical global optimization of photonic structures based on ResNet generative neural networks

Abstract We show that deep generative neural networks, based on global optimization networks (GLOnets), can be configured to perform the multiobjective and categorical global optimization of photonic devices. A residual network scheme enables GLOnets to evolve from a deep architecture, which is required to properly search the full design space early in the optimization process, to a shallow network that generates a narrow distribution of globally optimal devices. As a proof-of-concept demonstration, we adapt our method to design thin-film stacks consisting of multiple material types. Benchmarks with known globally optimized antireflection structures indicate that GLOnets can find the global optimum with orders of magnitude faster speeds compared to conventional algorithms. We also demonstrate the utility of our method in complex design tasks with its application to incandescent light filters. These results indicate that advanced concepts in deep learning can push the capabilities of inverse design algorithms for photonics.

Jiang, Jiaqi↗

Adaptive Discovery and Mixed-Variable Optimization of Next Generation Synthesizable Microelectronic Materials

Design of new microelectronic materials is characterized by several challenges such as high-dimensionality of the atomic structure-composition variable space, formidable cost of directly using high-fidelity simulations for design optimization, dispersity in literature-reported similar materials and synthesis methods, complex physical mechanisms, and mixed qualitative and quantitative design variables that lead to a disjointed design space. Even though machine learning (ML) techniques have been employed to expedite materials innovation, existing methods treat ML and design optimization as two separate processes, failing to resolve the fundamental challenges associated with high dimensionality and mixed-variable complexity. We have developed a ML enhanced mixed-variable material design optimization framework to efficiently extract useful information from existing data in literature and physics-based simulations to guide the autonomous search for optimal materials. Our proposed framework is composed of four computational modules: (1) a natural language processing (NLP) based virtual screening module, (2) classification based concept exploration module, (3) a density functional theory (DFT)-based high-fidelity evaluation model, and (4) a novel latent-variable Gaussian process (LVGP) ML model for mixed-variable problems with uncertainty quantification, which seamlessly integrates with Bayesian Optimization (BO) and achieves superb efficiency through embedded physics-based dimension reduction. Our approach is demonstrated and validated using the testbed of functional materials exhibiting metal-insulation transitions (MITs), with the targeted reversible resistivity changes (∼10^5) near room temperature. At the end of the 30-month project, we have developed a series of new ML techniques using NLP, conditional variational autoencoders, active learning, latent-variable Gaussian processes, integrated with Bayesian optimization. Our project has resulted in new predicted MITs compounds and improved understanding of MITs microscopic mechanisms, which in turn will revolutionize microelectronics science to provide energy-saving solutions. Our research has improved both creativity and efficiency in transforming rare-event discoveries of new functional materials to persistent innovations. In addition to open-sourcing the online MIT database and the classification model, the LVGP open source code has been downloaded more than 15,000 times within two years. More than 40 MIT compounds have been identified and many have been pursued experimentally via collaborators. The research results are published in close to 20 collaborative papers in high-impact journals, such as Chem. Mater., Appl. Phys. Rev., Sci. Rep., among others of design space.

36 MATERIALS SCIENCE↗

Toward Accelerating Discovery via Physics-Driven and Interactive Multifidelity Bayesian Optimization

Both computational and experimental material discovery bring forth the challenge of exploring multidimensional and often nondifferentiable parameter spaces, such as phase diagrams of Hamiltonians with multiple interactions, composition spaces of combinatorial libraries, processing spaces, and molecular embedding spaces. Often these systems are expensive or time consuming to evaluate a single instance, and hence classical approaches based on exhaustive grid or random search are too data intensive. This resulted in strong interest toward active learning methods such as Bayesian optimization (BO) where the adaptive exploration occurs based on human learning (discovery) objective. However, classical BO is based on a predefined optimization target, and policies balancing exploration and exploitation are purely data driven. In practical settings, the domain expert can pose prior knowledge of the system in the form of partially known physics laws and exploration policies often vary during the experiment. Here, we propose an interactive workflow building on multifidelity BO (MFBO), starting with classical (data-driven) MFBO, then expand to a proposed structured (physics-driven) structured MFBO (sMFBO), and finally extend it to allow human-in-the-loop interactive interactive MFBO (iMFBO) workflows for adaptive and domain expert aligned exploration. These approaches are demonstrated over highly nonsmooth multifidelity simulation data generated from an Ising model, considering spin–spin interaction as parameter space, lattice sizes as fidelity spaces, and the objective as maximizing heat capacity. Detailed analysis and comparison show the impact of physics knowledge injection and real-time human decisions for improved exploration with increased alignment to ground truth. Here, the associated notebooks allow to reproduce the reported analyses and apply them to other systems.

97 MATHEMATICS AND COMPUTING↗

Sparse-grid discontinuous Galerkin methods for the Vlasov–Poisson–Lenard–Bernstein model

Sparse-grid methods have recently gained interest in reducing the computational cost of solving high-dimensional kinetic equations. In this paper, we construct adaptive and hybrid sparse-grid methods for the Vlasov–Poisson–Lenard–Bernstein (VPLB) model. This model has applications to plasma physics and is simulated in two reduced geometries: a 0x3v space homogeneous geometry and a 1x3v slab geometry. Here we use the discontinuous Galerkin (DG) method as a base discretization due to its high-order accuracy and ability to preserve important structural properties of partial differential equations. We utilize a multiwavelet basis expansion to determine the sparse-grid basis and the adaptive mesh criteria. We analyze the proposed sparse-grid methods on a suite of three test problems by computing the savings afforded by sparse-grids in comparison to standard solutions of the DG method. The results are obtained using the adaptive sparse-grid discretization library ASGarD.

97 MATHEMATICS AND COMPUTING↗