Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “experimental 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 919 records · Page 51

Data-Consistent Inversion for Stochastic Input-to-Output Maps

Data-consistent inversion is a recently developed measure-theoretic framework for solving a stochastic inverse problem involving models of physical systems. The goal is to construct a probability measure on model inputs (i.e., parameters of interest) whose associated push-forward measure matches (i.e., is consistent with) a probability measure on the observable outputs of the model (i.e., quantities of interest). Previous implementations required the map from parameters of interest to quantities of interest to be deterministic. This work generalizes this framework for maps that are stochastic, i.e., contain uncertainties and variation not explainable by variations in uncertain parameters of interest. Generalizations of previous theorems of existence, uniqueness, and stability of the data-consistent solution are provided while new theoretical results address the stability of marginals on parameters of interest. A notable aspect of the algorithmic generalization is the ability to query the solution to generate independent identically distributed samples of the parameters of interest without requiring knowledge of the so-called stochastic parameters. This work therefore extends the applicability of the data-consistent inversion framework to a much wider class of problems. This includes those based on purely experimental and field data where only a subset of conditions are either controllable or can be documented between experiments while the underlying physics, measurement errors, and any additional covariates are either uncertain or not accounted for by the researcher. Finally, numerical examples demonstrate application of this approach to systems with stochastic sources of uncertainties embedded within the modeling of a system and a numerical diagnostic is summarized that is useful for determining if a key assumption is verified among competing choices of stochastic maps.

97 MATHEMATICS AND COMPUTING↗

An agent-based blackboard system for multi-objective optimization

In the field of multi-objective optimization, there are a multitude of algorithms from which to choose. Each algorithm has strengths and weaknesses associated with the mechanics for finding the Pareto front. Recently, researchers have begun to examine how multi-agent environments can be used to help solve multi-objective optimization problems. In this work, we propose a multi-objective optimization algorithm based on a multi-agent blackboard system (MABS). The MABS framework allows for multiple agents to read and write pertinent optimization problem data to a central blackboard agent. Agents can stochastically search the design space, use previously discovered solutions to explore local optima, or update and prune the Pareto front. A centralized blackboard framework allows the optimization problem to be solved in a cohesive manner and permits stopping, restarting, or updating the optimization problem. The MABS framework is tested against three alternative optimization algorithms across a suite of engineering design problems and typically outperforms the other algorithms in discovering the Pareto front. A parallelizability study is performed where we find that the MABS is able to evaluate a set number of designs, which require an evaluation time ranging from 0 to 300 seconds, quicker than a traditional optimization algorithm: this fact becomes more apparent the longer it takes to evaluate a design. To provide context for the benefits provided by MABS, a real-world nuclear engineering design problem is examined. MABS is used to examine the placement of experiments in a nuclear reactor, where we are able to evaluate hundreds of configurations for experimental placement while maintaining a strict set of safety constraints.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

End-to-end optimization for battery materials and molecules by combining graph neural networks and reinforcement learning

The National Renewable Energy Laboratory (NREL), together with the Colorado School of Mines (CSM) and Colorado State University (CSU), has developed a machine learning-enhanced approach to design new battery materials. Currently, such materials are designed in part via numerous expensive high-fidelity computational simulations that predict the performance of a given composition. Even with computational screening tools, the vast landscape of possible molecular or crystal structures exceeds current and future computational capacity. Improving the efficiency by which new materials can be optimized will therefore disrupt the cost, risk, and time required to bring new energy solutions to the marketplace. Predicting the properties of an organic molecule or periodic crystalline material given its structure has grown increasingly common. These approaches leverage large-scale computational and experimental databases and ML approaches such as graph neural networks. The inverse design problem of finding a material that possesses desired properties is substantially more challenging, since enumerating all valid material structures is not feasible. In this project, we leveraged recent success in reinforcement learning to efficiently navigate this high-dimensional search space. Just as algorithms can find the optimal chess moves from nearly limitless options, we train an approach to evolve a simple starting structure into a complex structure that possess the desired properties. Our solution has been demonstrated by applying it to two related design application tasks for short- and long-term energy storage, respectively: (1) the design of solid-state ion conductors and (2) the design of organic redox-active materials. The project has resulted an open-source software library for material design, documented examples of applying the library to both organic and inorganic material optimization, and peer-reviewed publications detailing the data, computational models, and resulting candidate materials.

25 ENERGY STORAGE↗

End-to-End Optimization for Battery Materials and Molecules by Combining Graph Neural Networks and Reinforcement Learning

The National Renewable Energy Laboratory (NREL), together with the Colorado School of Mines (CSM) and Colorado State University (CSU), has developed a machine learning-enhanced approach to the design of new battery materials. Currently, such materials are designed in part via numerous expensive high-fidelity computational simulations that predict the performance of a given composition. Even with computational screening tools, the vast landscape of possible molecular or crystal structures exceeds current and future computational capacity. Improving the efficiency by which new materials can be optimized will therefore disrupt the cost, risk, and time required to bring new energy solutions to the marketplace. Predicting the properties of an organic molecule or periodic crystalline material given its structure has grown increasingly common. These approaches leverage large-scale computational and experimental databases and ML approaches such as graph neural networks. The inverse design problem of finding a material that possesses desired properties is substantially more challenging, since enumerating all valid material structures is not feasible. In this project, we leveraged recent success in reinforcement learning to efficiently navigate this high-dimensional search space. Just as algorithms can find the optimal chess moves from nearly limitless options, we train an approach to evolve a simple starting structure into a complex structure that possess the desired properties. Our solution has been demonstrated by applying it to two related design application tasks for short- and long-term energy storage, respectively: (1) the design of solid-state ion conductors and (2) the design of organic redox-active materials. The project has resulted an open-source software library for material design, documented examples of applying the library to both organic and inorganic material optimization, and peer-reviewed publications detailing the data, computational models, and resulting candidate materials.

25 ENERGY STORAGE↗

Reinforcement Learning-Guided Long-Timescale Simulation of Hydrogen Transport in Metals

Diffusion in alloys is an important class of atomic processes. However, atomistic simulations of diffusion in chemically complex solids are confronted with the timescale problem: the accessible simulation time is usually far shorter than that of experimental interest. In this work, long-timescale simulation methods are developed using reinforcement learning (RL) that extends simulation capability to match the duration of experimental interest. Two special limits, RL transition kinetics simulator (TKS) and RL low-energy states sampler (LSS), are implemented and explained in detail, while the meaning of general RL are also discussed. As a testbed, hydrogen diffusivity is computed using RL TKS in pure metals and a medium entropy alloy, CrCoNi, and compared with experiments. The algorithm can produce counter-intuitive hydrogen-vacancy cooperative motion. We also demonstrate that RL LSS can accelerate the sampling of low-energy configurations compared to the Metropolis–Hastings algorithm, using hydrogen migration to copper (111) surface as an example.

36 MATERIALS SCIENCE↗

Sequence-defined Pareto frontier of a copolymer structure

The correlations between the sequence of monomers in a macromolecule and its three-dimensional (3D) structure is a grand challenge in polymer science. The properties and functions of macromolecules depend on their 3D shape that has appeared to be dictated by their monomer sequence. However, the progress towards understanding the sequence–structure-property correlations and their utilization in materials engineering are slow because it is almost impossible to characterize an astronomically large number of possible sequences of a copolymer using traditional experimental and simulation methods. To address this problem, here, we combine evolutionary computing and coarse-grained molecular dynamics (CGMD) simulation and study the sequence-structure correlations of a model AB-type copolymer in a solution and assess the impact of sequence on the packing density in its bulk phase. The CGMD-based evolutionary algorithm (EA) screens the sequence space of a single chain copolymer efficiently and identifies a wide range of single-molecule structures including extremal radii of gyration. The data are utilized to estimate the Pareto front of the structure-space of a binary copolymer as a function of its composition. The monomer packings in single-molecule solution phase and multimolecular bulk phase are found to be identical. Finally, this work highlights the opportunities of sequence-specific control of macromolecular structure for designing target materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Polyconvex neural network models of thermoelasticity

Machine-learning function representations such as neural networks have proven to be excellent constructs for constitutive modeling due to their flexibility to represent highly nonlinear data and their ability to incorporate constitutive constraints, which also allows them to generalize well to unseen data. Here, in this work, we extend a polyconvex hyperelastic neural network framework to (isotropic) thermo-hyperelasticity by specifying the thermodynamic and material theoretic requirements for an expansion of the Helmholtz free energy expressed in terms of deformation invariants and temperature. Different formulations which a priori ensure polyconvexity with respect to deformation and concavity with respect to temperature are proposed and discussed. The physics-augmented neural networks are furthermore calibrated with a recently proposed sparsification algorithm that not only aims to fit the training data but also penalizes the number of active parameters, which prevents overfitting in the low data regime and promotes generalization. The performance of the proposed framework is demonstrated on synthetic data, which illustrate the expected thermomechanical phenomena, and existing temperature-dependent uniaxial tension and tension-torsion experimental datasets.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multipoint-BAX: a new approach for efficiently tuning particle accelerator emittance via virtual objectives

Abstract Although beam emittance is critical for the performance of high-brightness accelerators, optimization is often time limited as emittance calculations, commonly done via quadrupole scans, are typically slow. Such calculations are a type of multipoint query , i.e. each query requires multiple secondary measurements. Traditional black-box optimizers such as Bayesian optimization are slow and inefficient when dealing with such objectives as they must acquire the full series of measurements, but return only the emittance, with each query. We propose a new information-theoretic algorithm, Multipoint-BAX , for black-box optimization on multipoint queries, which queries and models individual beam-size measurements using techniques from Bayesian Algorithm Execution (BAX). Our method avoids the slow multipoint query on the accelerator by acquiring points through a virtual objective , i.e. calculating the emittance objective from a fast learned model rather than directly from the accelerator. We use Multipoint-BAX to minimize emittance at the Linac Coherent Light Source (LCLS) and the Facility for Advanced Accelerator Experimental Tests II (FACET-II). In simulation, our method is 20× faster and more robust to noise compared to existing methods. In live tests, it matched the hand-tuned emittance at FACET-II and achieved a 24% lower emittance than hand-tuning at LCLS. Our method represents a conceptual shift for optimizing multipoint queries, and we anticipate that it can be readily adapted to similar problems in particle accelerators and other scientific instruments.

43 PARTICLE ACCELERATORS↗

Quantum Gravity in the Lab. I. Teleportation by Size and Traversable Wormholes

With the long-term goal of studying models of quantum gravity in the lab, we propose holographic teleportation protocols that can be readily executed in table-top experiments. These protocols exhibit similar behavior to that seen in the recent traversable-wormhole constructions of Gao et al. [J. High Energy Phys., 2017, 151 (2017)] and Maldacena et al. [Fortschr. Phys., 65, 1700034 (2017)]: information that is scrambled into one half of an entangled system will, following a weak coupling between the two halves, unscramble into the other half. We introduce the concept of teleportation by size to capture how the physics of operator-size growth naturally leads to information transmission. The transmission of a signal through a semiclassical holographic wormhole corresponds to a rather special property of the operator-size distribution that we call size winding. For more general systems (which may not have a clean emergent geometry), we argue that imperfect size winding is a generalization of the traversablewormhole phenomenon. In addition, a form of signaling continues to function at high temperature and at large times for generic chaotic systems, even though it does not correspond to a signal going through a geometrical wormhole but, rather, to an interference effect involving macroscopically different emergent geometries. Finally, we outline implementations that are feasible with current technology in two experimental platforms: Rydberg-atom arrays and trapped ions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Long-Range Biometric Identification in Real World Scenarios: A Comprehensive Evaluation Framework Based on Missions

The considerable body of data available for evaluating biometric recognition systems in Research and Development (R&D) environments has contributed to the increasingly common problem of target performance mismatch. Biometric algorithms are frequently tested against data that may not reflect the real world applications they target. From a Testing and Evaluation (T&E) standpoint, this domain mismatch causes difficulty assessing when improvements in State-of-the-Art (SOTA) research actually translate to improved applied outcomes. This problem can be addressed with thoughtful preparation of data and experimental methods to reflect specific use-cases and scenarios.To that end, this paper evaluates research solutions for identifying individuals at ranges and altitudes, which could support various application areas such as counterterrorism, protection of critical infrastructure facilities, military force protection, and border security. We address challenges including image quality issues and reliance on face recognition as the sole biometric modality. By fusing face and body features, we propose developing robust biometric systems for effective long-range identification from both the ground and steep pitch angles. Preliminary results show promising progress in whole-body recognition. This paper presents these early findings and discusses potential future directions for advancing long-range biometric identification systems based on mission-driven metrics.

Aykac, Deniz↗

Auto-BLAST (AutoBLAST) [SWR-20-93]

Battery life modeling often involves a lot of manual parameter fitting and is not easy for users to adopt the model and use it. To reduce the difficulties for users to adopt battery lifetime models, an automatic battery lifetime modeling analysis and simulation tool suite, Auto-BLAST, has been developed. Auto-BLAST includes a lithium-loss-base life model, a battery electric model, and an algorithm which automatically fits all key parameters in the electric and life models using user provided data. The models and algorithm are packaged into two user-friendly GUIs, Auto-LifeMod, for easy battery life prognostic model fitting and Auto-LifeSim, for easy battery lifetime simulation. The lithium-loss-based life model adopts a similar model framework that models degradations using aging rate models, using battery cycling data to predict battery degradation and expected lifetime. The electric model is an equivalent circuit model which simulates battery voltage responses based on current/power demand profiles. The auto-fitting algorithm uses the user-input data to generate custom battery life model(s). Two GUIs, wrapping around the life model and the auto-fitting algorithm, provide friendly interfaces for users to generate a life model and use it for case study. One GUI requires summary data from accelerated battery life degradation tests as an input and produces battery life models predicting (a) capacity degradation, and (b) resistance growth of the battery. The GUI displays the electrical model response and the input experimental data against the life model predictions with fitted model parameters and fitting error. The GUI also generates an output file to save the fitted model parameters. The second GUI uses the life model from the first GUI and a user-defined battery cycling profile to predict battery lifetime degradation and expected lifetime. Predicted capacity and resistance vs. time are plotted in the GUI and saved to output file. There is a user guide for both GUIs

Mishra, Partha↗

A path integral ground state Monte Carlo algorithm for entanglement of lattice bosons

A ground state path integral quantum Monte Carlo algorithm is introduced that allows for the study of entanglement in lattice bosons at zero temperature. The Rényi entanglement entropy between spatial subregions is explored across the phase diagram of the one dimensional Bose-Hubbard model for systems consisting of up to L=256 L = 256 sites at unit-filling without any restrictions on site occupancy, far beyond the reach of exact diagonalization. The favorable scaling of the algorithm is demonstrated through a further measurement of the Rényi entanglement entropy at the two dimensional superfluid-insulator critical point for large system sizes, confirming the existence of the expected entanglement boundary law in the ground state. The Rényi estimator is extended to measure the symmetry resolved entanglement that is operationally accessible as a resource for experimentally relevant lattice gases with fixed total particle number.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A multi-backend autotuning study of feature selection on GPUs

Abstract Feature selection is an important step in machine learning that can benefit from GPU acceleration. As the number of GPU vendors increases, it is imperative to adapt algorithms such as the minimum Redundancy Maximum Relevance (mRMR) feature selection method to different backends that support several GPU architectures. This work presents a multi-backend implementation of mRMR across CUDA, HIP, and SYCL, and studies its performance when combined with Bayesian optimization and transfer learning to automatically tune execution parameters for different platforms and datasets. Our experimental results show that when tuned, CUDA and HIP achieve comparable performance on NVIDIA architectures, while SYCL exhibits a moderate performance gap. Overall, this work highlights the impact of backend choice and autotuning on GPU-accelerated feature selection and provides insights into deploying mRMR across heterogeneous environments.

Beceiro, Bieito (ORCID:0000000333014890)↗

Dislocation dynamics in polycrystalline materials

An extension of the dislocation dynamics method to polycrystalline materials is presented with emphasis on handling interactions between dislocations and grain boundaries. The key new features of the method include: (1) a grain boundary detection algorithm, (2) new dislocation emission criteria based on power dissipation and area growth, (3) mobility of dislocations at grain boundaries, and (4) extension of topological operations e.g. mesh adaption, collision, and dissociation to handle dislocations interacting with grain boundaries. Furthermore, verification and validation examples are executed to compare our calculations with existing analytic methods, molecular dynamics simulations, and experimental observations.

36 MATERIALS SCIENCE↗

General approaches for shear-correcting coordinate transformations in Bragg coherent diffraction imaging. Part I

This two-part article series provides a generalized description of the scattering geometry of Bragg coherent diffraction imaging (BCDI) experiments, the shear distortion effects inherent in the 3D image obtained from presently used methods and strategies to mitigate this distortion. Part I starts from fundamental considerations to present the general real-space coordinate transformation required to correct this shear, in a compact operator formulation that easily lends itself to implementation with available software packages. Such a transformation, applied as a final post-processing step following phase retrieval, is crucial for arriving at an undistorted, correctly oriented and physically meaningful image of the 3D crystalline scatterer. As the relevance of BCDI grows in the field of materials characterization, the available sparse literature that addresses the geometric theory of BCDI and the subsequent analysis methods are generalized here. This geometrical aspect, specific to coherent Bragg diffraction and absent in 2D transmission CDI experiments, gains particular importance when it comes to spatially resolved characterization of 3D crystalline materials in a reliable nondestructive manner. This series of articles describes this theory, from the diffraction in Bragg geometry to the corrections needed to obtain a properly rendered digital image of the 3D scatterer. Part I of this series provides the experimental BCDI community with the general form of the 3D real-space distortions in the phase-retrieved object, along with the necessary post-retrieval correction method. Part II builds upon the geometric theory developed in Part I with the formalism to correct the shear distortions directly on an orthogonal grid within the phase-retrieval algorithm itself, allowing more physically realistic constraints to be applied. Taken together, Parts I and II provide the X-ray science community with a set of generalized BCDI shear-correction techniques crucial to the final rendering of a 3D crystalline scatterer and for the development of new BCDI methods and experiments.

36 MATERIALS SCIENCE↗

Bayesian chain graph models to characterize microbe-environment dynamics

Microbiome data require statistical models that can simultaneously decode microbes' reaction to the environment and interactions among microbes. While a multiresponse linear regression model seems like a straight-forward solution, we argue that treating it as a graphical model is problematic given that the regression coefficient matrix does not encode the conditional dependence structure between response and predictor nodes. This observation is especially important in biological settings when we have prior knowledge on the edges from specific experimental interventions that can only be properly encoded under a conditional dependence model. Here, we propose a chain graph model with two sets of nodes (predictors and responses) whose solution yields a graph with edges that indeed represent conditional dependence, thus agreeing with the experimenter's intuition on the average behavior of nodes under treatment. The solution to our model is sparse via the Bayesian linear regression (LASSO). In addition, we propose an adaptive extension so that different shrinkages can be applied to different edges to incorporate edge-specific prior knowledge. Our model is computationally inexpensive through an efficient Gibbs sampling algorithm and can account for binary, counting, and compositional responses via an appropriate hierarchical structure. We test the performance of our model in a variety of simulated datasets, thereby showing superior performance to state-of-the-art approaches. We further apply our model to human gut and soil microbial compositional datasets, and we highlight that CG-LASSO can estimate biologically meaningful network structures in the data.

compositional data↗

A Methodology for Simulating Supercritical CO2 Heat Transfer Experiments Using Machine Learning Models

To support the growth of supercritical carbon dioxide (sCO2) power cycles in the energy industry, this study seeks to train a machine learning model to mirror experimental data to predict new heat transfer data. To do this experimental data was amassed, one preliminary set comprised of 16 test results, and an expanded version comprised of 38 test results. With the goal of predicting experimental apparatus temperatures and pressures, several iterations of models were tested investigating the impact of model hyper-parameters, data inclusion, and data pre-processing on model performance. A total of 15 variations cumulatively of Gaussian Process Regressors, Gradient Boosting Regressors, and Multi-Layer Perceptrons were trained and validated on the preliminary set, and the best algorithm of each class was re-trained on the expanded set. These were compared based on test/train R^2 , test/train mean absolute error (MAE), and validation MAE, to identify the successfulness of these models. It was shown temperatures could be predicted within just a few degrees, showing the potential of this approach. Future research has been identified with approaches to improve pressure and temperature predictions going forward.

Grabowski, Owen↗

Identification and selection of optimal reference genes for qPCR-based gene expression analysis in Fucus distichus under various abiotic stresses

Quantitative gene expression analysis is an important tool in the scientist’s belt. The identification of evenly expressed reference genes is necessary for accurate quantitative gene expression analysis, whether by traditional RT-PCR (reverse-transcription polymerase chain reaction) or by qRT-PCR (quantitative real-time PCR; qPCR). In the Stramenopiles (the major line of eukaryotes that includes brown algae) there is a noted lack of known reference genes for such studies, largely due to the absence of available molecular tools. Here we present a set of nine reference genes (Elongation Factor 1 alpha (EF1A), Elongation Factor 2 alpha (EF2A), Elongation Factor 1 beta (EF1B), 14-3-3 Protein, Ubiquitin Conjugating Enzyme (UBCE2), Glyceraldehyde-3-phosphate Dehydrogenase (GAPDH), Actin Related Protein Complex (ARP2/3), Ribosomal Protein (40s; S23), and Actin) for the brown alga Fucus distichus . These reference genes were tested on adult sporophytes across six abiotic stress conditions (desiccation, light and temperature modification, hormone addition, pollutant exposure, nutrient addition, and wounding). Suitability of these genes as reference genes was quantitatively evaluated across conditions using standard methods and the majority of the tested genes were evaluated favorably. However, we show that normalization genes should be chosen on a condition-by-condition basis. We provide a recommendation that at least two reference genes be used per experiment, a list of recommended pairs for the conditions tested here, and a procedure for identifying a suitable set for an experimenter’s unique design. With the recent expansion of interest in brown algal biology and accompanied molecular tools development, the variety of experimental conditions tested here makes this study a valuable resource for future work in basic biology and understanding stress responses in the brown algal lineage.

59 BASIC BIOLOGICAL SCIENCES↗