Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computer experiment”

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 55 records · Page 3

Learning Symbolic Expressions: Mixed-Integer Formulations, Cuts, and Heuristics

Here, in this paper, we consider the problem of learning a regression function without assuming its functional form. This problem is referred to as symbolic regression. An expression tree is typically used to represent a solution function, which is determined by assigning operators and operands to the nodes. Cozad and Sahinidis propose a nonconvex mixed-integer nonlinear program (MINLP), in which binary variables are used to assign operators and nonlinear expressions are used to propagate data values through nonlinear operators, such as square, square root, and exponential. We extend this formulation by adding new cuts that improve the solution of this challenging MINLP. We also propose a heuristic that iteratively builds an expression tree by solving a restricted MINLP. We perform computational experiments and compare our approach with a mixed-integer program–based method and a neural network–based method from the literature.

97 MATHEMATICS AND COMPUTING↗

Real-Time Radiological Source Term Estimation for Multiple Sources in Cluttered Environments

A particle filter algorithm is presented to estimate the position, strength, and cardinality of an unknown number of radioactive point sources in an obstacle-rich environment using count measurements. The algorithm addresses gaps in the prior literature by incorporating two novel elements. The first is a precomputation step in which local terrain and obstacle data is processed to compute attenuation kernels throughout the search area. This enables rapid estimation performance in obstacle-rich environments as measurements are gathered. The second novel feature is a dynamic particle allocation technique in which the number of particles is adjusted in real time to meet convergence goals. This feature allows the algorithm to scale more efficiently to scenarios with a larger number of sources. Furthermore, a series of computational experiments using simulated data demonstrates the algorithm’s performance in a cluttered environment with up to eight sources.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

EUCLID: Experiments Underpinned by Computational Learning for Improvements in Nuclear Data [Slides]

EUCLID will design validation experiments optimized to resolve compensating errors and adjust nuclear data to experiments. A big part of the success of the EUCLID proposal was due to previous work supported by NCSP (MCNP, nuclear data, and NCERC capabilities). The work performed under EUCLID will similarly benefit the NCSP mission. It will lead to new MCNP capabilities, improved nuclear data and nuclear data capabilities, and new methodology and tools that will have large impact on future NCERC experiments.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Discovering Active Subspaces for High-Dimensional Computer Models

Dimension reduction techniques have long been an important topic in statistics, and active subspaces (AS) have received much attention this past decade in the computer experiments literature. The most common approach towards estimating the AS is to use Monte Carlo with numerical gradient evaluation. While sensible in some settings, this approach has obvious drawbacks. Recent research has demonstrated that active subspace calculations can be obtained in closed form, conditional on a Gaussian process (GP) surrogate, which can be limiting in high-dimensional settings for computational reasons. In this paper, we produce the relevant calculations for a more general case when the model of interest is a linear combination of tensor products. These general equations can be applied to the GP, recovering previous results as a special case, or applied to the models constructed by other regression techniques including multivariate adaptive regression splines (MARS). Furthermore, using a MARS surrogate has many advantages including improved scaling, better estimation of active subspaces in high dimensions and the ability to handle a large number of prior distributions in closed form. In one real-world example, we obtain the active subspace of a radiation-transport code with 240 inputs and 9,372 model runs in under half an hour.

97 MATHEMATICS AND COMPUTING↗

Comparison of open‐source three‐dimensional reconstruction pipelines for maize‐root phenotyping

Abstract Understanding three‐dimensional (3D) root traits is essential to improve water uptake, increase nitrogen capture, and raise carbon sequestration from the atmosphere. However, quantifying 3D root traits by reconstructing 3D root models for deeper field‐grown roots remains a challenge due to the unknown tradeoff between 3D root‐model quality and 3D root‐trait accuracy. Therefore, we performed two computational experiments. We first compared the 3D model quality generated by five state‐of‐the‐art open‐source 3D model reconstruction pipelines on 12 contrasting genotypes of field‐grown maize roots. These pipelines included COLMAP, COLMAP+PMVS (Patch‐based Multi‐View Stereo), VisualSFM, Meshroom, and OpenMVG+MVE (Multi‐View Environment). The COLMAP pipeline achieved the best performance regarding 3D model quality versus computational time and image number needed. In the second test, we compared the accuracy of 3D root‐trait measurement generated by the Digital Imaging of Root Traits 3D pipeline (DIRT/3D) using COLMAP‐based 3D reconstruction with our current DIRT/3D pipeline that uses a VisualSFM‐based 3D reconstruction on the same dataset of 12 genotypes, with 5–10 replicates per genotype. The results revealed that (1) the average number of images needed to build a denser 3D model was reduced from 3000 to 3600 (DIRT/3D [VisualSFM‐based 3D reconstruction]) to around 360 for computational test 1, and around 600 for computational test 2 (DIRT/3D [COLMAP‐based 3D reconstruction]); (2) denser 3D models helped improve the accuracy of the 3D root‐trait measurement; (3) reducing the number of images can help resolve data storage problems. The updated DIRT/3D (COLMAP‐based 3D reconstruction) pipeline enables quicker image collection without compromising the accuracy of 3D root‐trait measurements.

09 BIOMASS FUELS↗

Multi-stage heat release of multi-component fuels: Insights and implications for advanced engine operation

Multi-stage heat release (MSHR) is a unique phenomenon typically seen in lean/diluted and low- to intermediate-temperature combustion. Despite its relevance to advanced engine operation, the MSHR of multi-component fuels has barely been quantified. This study aims to characterize the MSHR of multi-component fuels in a rapid compression machine (RCM) at conditions representative of advanced combustion engines. New experimental data are first reported in the RCM at an equivalence ratio of 0.4, pressure of 60 bar and temperatures from 702 to 795 K for a research grade, multi-component gasoline surrogate, termed PACE-20. Here, experiments confirm the existence of MSHR for PACE-20 at all temperatures, and reveal the strong inhibiting effect of temperature on MSHR, where increasing temperature inhibits MSHR by suppressing first stage heat release and promoting second and third stage heat release. A detailed chemical kinetic model is also adopted to model the experiments, with good agreement observed. The response of MSHR characteristics to changes in different engine operating parameters (i.e., temperature, pressure, equivalence ratio and CO 2 dilution level) and fuel compositions (i.e., mole fraction of n-pentane, n-heptane, isooctane, cyclopentane, 1-hexene, ethanol and aromatics in PACE-20) is further evaluated via statistical analysis coupling quasi-random sampling, extensive computer experiments and high-dimensional model representation. The change in MSHR is characterized through 8 quantities of interest (QOIs), i.e., duration and extent of each heat release stage, and their standard deviations. The analysis highlights the dependence of the QOIs on the individual parameters as well as their interplays, with temperature exhibiting the strongest impact among all parameters. Furthermore, it is demonstrated that if MSHR is to be facilitated and combustion phasing is to be extended to enable engine operation at higher compression ratios, it is recommended to operate the engine at low intake temperatures, boosted intake pressures and high CO 2 dilutions (i.e., high EGR levels) with gasoline fuels containing more n-pentane and less aromatics.

42 ENGINEERING↗

Motion Dynamics of Motile Microbes in Pore-Networks and its Implications for Reactive Transport Processes

This report outlines new methods to improve simulations of microbial transport and microbially mediated reactions in porous media. A range of experimental, modeling, and machine learning tools are introduced to make these simulations faster, more reliable, and useful for real-world applications. At the microscopic level, the study investigates how different types of bacteria move through confined spaces. A new artificial intelligence tool called DeepTrackStat, is introduced to track motions dynamics as observed in videos of particles migrating through pore networks. This tool is especially helpful for studying fast-moving microbes and requires less computing power than traditional tracking methods. At larger scales, the research looks at how microbes and chemicals interact in zones where surface water and groundwater meet. To connect the small- and large-scale findings, the study presents a neural network model called STAMNet. This tool helps scale up detailed small-scale microbial motion behaviors to predict large-scale environmental changes more efficiently. By combining lab experiments, computer models, and artificial intelligence, the research presented supports smarter environmental decision-making, especially in bioremediation of contaminated groundwater and protection of water quality.

54 ENVIRONMENTAL SCIENCES↗

Automatic Differentiation of C++ Codes on Emerging Manycore Architectures with Sacado

Automatic differentiation (AD) is a well-known technique for evaluating analytic derivatives of calculations implemented on a computer, with numerous software tools available for incorporating AD technology into complex applications. However, a growing challenge for AD is the efficient differentiation of parallel computations implemented on emerging manycore computing architectures such as multicore CPUs, GPUs, and accelerators as these devices become more pervasive. In this work, we explore forward mode, operator overloading-based differentiation of C++ codes on these architectures using the widely available Sacado AD software package. In particular, we leverage Kokkos, a C++ tool providing APIs for implementing parallel computations that is portable to a wide variety of emerging architectures. Here we describe the challenges that arise when differentiating code for these architectures using Kokkos, and two approaches for overcoming them that ensure optimal memory access patterns as well as expose additional dimensions of fine-grained parallelism in the derivative calculation. We describe the results of several computational experiments that demonstrate the performance of the approach on a few contemporary CPU and GPU architectures. We then conclude with applications of these techniques to the simulation of discretized systems of partial differential equations.

97 MATHEMATICS AND COMPUTING↗

Deep Kronecker neural networks: A general framework for neural networks with adaptive activation functions

Here we propose a new type of neural networks, Kronecker neural networks (KNNs), that form a general framework for neural networks with adaptive activation functions. KNNs employ the Kronecker product, which provides an efficient way of constructing a very wide network while keeping the number of parameters low. Our theoretical analysis reveals that under suitable conditions, KNNs induce a faster decay of the loss than that by the feed-forward networks. This is also empirically verified through a set of computational examples. Furthermore, under certain technical assumptions, we establish global convergence of gradient descent for KNNs. As a specific case, we propose the Rowdy activation function that is designed to get rid of any saturation region by injecting sinusoidal fluctuations, which include trainable parameters. The proposed Rowdy activation function can be employed in any neural network architecture like feed-forward neural networks, Recurrent neural networks, Convolutional neural networks etc. The effectiveness of KNNs with Rowdy activation is demonstrated through various computational experiments including function approximation using feed-forward neural networks, solution inference of partial differential equations using the physics-informed neural networks, and standard deep learning benchmark problems using convolutional and fully-connected neural networks.

97 MATHEMATICS AND COMPUTING↗

Discovery of LaAlO 3 as an efficient catalyst for two-electron water electrolysis towards hydrogen peroxide

Electrochemical two-electron water oxidation reaction (2e-WOR) has drawn significant attention as a promising process to achieve the continuous on-site production of hydrogen peroxide (H 2 O 2 ). However, compared to the cathodic H 2 O 2 generation, the anodic 2e-WOR is more challenging to establish catalysts due to the severe oxidizing environment. In this study, we combine density functional theory (DFT) calculations with experiments to discover a stable and efficient perovskite catalyst for the anodic 2e-WOR. Our theoretical screening efforts identify LaAlO 3 perovskite as a stable, active, and selective candidate for catalyzing 2e-WOR. Our experimental results verify that LaAlO 3 achieves an overpotential of 510 mV at 10 mA cm -2 in 4 M K 2 CO 3 /KHCO 3 , lower than those of many reported metal oxide catalysts. In addition, LaAlO 3 maintains a stable H 2 O 2 Faradaic efficiency with only a 3% decrease after 3 h at 2.7 V vs. RHE. This computation-experiment synergistic approach introduces another effective direction to discover promising catalysts for the harsh anodic 2e-WOR towards H 2 O 2 .

08 HYDROGEN↗

A posteriori superlinear convergence bounds for block conjugate gradient

In this paper, we extend to the block case the a posteriori bound showing superlinear convergence of the conjugate gradient method developed by van der Vorst and Vuik in [J. Comput. Applied Math., 48 (1993), pp. 327–341]. That is, we obtain similar bounds but now for the block conjugate gradient method. We also present a series of computational experiments, illustrating the validity of the bound developed here as well as the bound by Simoncini and Szyld from [SIAM Review, 47 (2005), pp. 247–272] using angles between subspaces. Using these bounds, we make some observations on the onset of superlinearity and how this onset depends on the eigenvalue distribution and the block size.

97 MATHEMATICS AND COMPUTING↗

Classical-Quantum Algorithm for Solving Stochastic Programs

Stochastic programming provides a rigorous mathematical framework for making decisions under uncertainty in a risk-aware manner. Two-stage stochastic programming is, perhaps, the simplest form of this framework. Here the first-stage variables represent decisions that must be made "here and now" in the face of uncertainty, while the second-stage variables are decisions made after uncertain events. However, the broad adoption of stochastic programming has been hindered by computational challenges caused by the two-stage stochastic programming formulation which requires solving an ensemble of optimization problems. Using quantum amplitude estimation (QAE), quantum computers have shown the theoretic ability to compute expectations with Monte-Carlo methods with quadratically fewer samples than classical methods. In this work, we present a quantum algorithm for computing the expectation term using QAE for given first-stage decisions. Further, we detail methods of computing gradient information from the quantum calculation enabling the application of classical gradient-based optimization techniques. The result is a classical-quantum hybrid method of solving two-stage stochastic programs. These techniques are demonstrated with computational experiments based an engineering optimization problem.

97 MATHEMATICS AND COMPUTING↗

Faster solutions to the interdiction defense problem using suboptimal solutions

The interdiction defense (ID) problem solves a defender-attacker-defender model where the defender and attacker share the same set of components to harden and target. Here, we build upon the best response intersection (BRI) algorithm by developing the BRI with suboptimal solutions (BRI-SS) algorithm to solve the ID problem. The BRI-SS algorithm utilizes off-the-shelf optimization solvers that return suboptimal solutions at no additional computation cost. We derive novel cuts from suboptimal solutions, reducing the number of iterations required for the algorithm to converge while maintaining optimality guarantees. We also present a heuristic that utilizes all obtained suboptimal solutions to select the next defense to evaluate at each iteration. We perform computational experiments applied to power grid interdiction on standard test cases. Our results demonstrate that the BRI-SS algorithm consistently outperforms the BRI algorithm across all test cases.

Computer science↗

Systemwide Planning with a Branch-and-Price Algorithm for Pavement-Marking Assessment Data Collection via the Mobile Retroreflectivity Unit Routing Model

The visibility of pavement markings is one of the most critical factors for traffic safety, and a periodical assessment plan is crucial for maintaining this function. Traditional assessment methods, such as visual windshield surveys or manual testing using handheld devices, are unsafe, time-consuming, and labor-intensive. In recent years, transportation agencies have begun to adopt the use of mobile retroreflectivity units (MRUs) for condition assessment of pavement markings. MRUs, different from other manual methods, can be utilized to collect large-scale retroreflectivity data in an efficient manner. However, no relevant research has yet proposed a mathematical optimization model for arranging the evaluation schedule and paths of MRUs. This study aims to propose a MRU routing model, and an efficient solution methodology. A branch-and-price algorithm, including column generation and branch-and-bound, was implemented. Computational experiments have been conducted based on actual tasks from the Florida MRU program for validation. In conclusion, results show that the proposed solution methodology with a set partitioning model in this study not only finds the optimal solution for problems with tasks less than 60, but also effectively narrows the solution gap to be within 1.0% for problems with tasks less than 131.

42 ENGINEERING↗

Foundational Science to Accelerate Nuclear Energy Innovation [Brochure]

The foundational science gaps inhibiting the advancement of nuclear energy technologies are identified and tackled in five priority research opportunities. These opportunities pave the way to accelerate the development and ultimately the adoption of new nuclear energy systems. They include the fundamental aspects of ion-electron interactions; novel properties of next-generation coolants and solvents; interfacial dynamics, not only in solids, but in other aspects of nuclear reactors; novel operando and in-situ monitoring and sensing; and artificial intelligence to accelerate condensed phases discovery. Building on the foundation established by previous BES workshops, these opportunities encompass recent advances in fundamental knowledge and focus on the experimental and computational methods needed to resolve major technical challenges for nuclear energy technologies. Through developing fundamental scientific insight as well as pushing the frontiers of modeling complex systems and probing the operation of materials and chemical systems in extreme environments, research motivated by the priorities identified here will further develop the promise, potential, and utilization of nuclear energy for a clean energy future. The PROs are as follows: (1) Master complex electronic structures to tailor thermochemical reactivity, transport, and microstructural evolution; (2) Interrogate and direct the physics and chemistry underpinning next-generation coolants and solvents; (3) Elucidate and control the underlying physics and chemistry of interfaces in complex nuclear environments; (4) Bridge multi-fidelity multi-resolution experiments, computational modeling, and data science to control dynamic behavior; and (5) Harness artificial intelligence to design inherently resilient condensed phases.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

An end-to-end deep learning method for solving nonlocal Allen–Cahn and Cahn–Hilliard phase-field models

Here, we propose an efficient end-to-end deep learning method for solving nonlocal Allen–Cahn (AC) and Cahn–Hilliard (CH) phase-field models. One motivation for this effort emanates from the fact that discretized partial differential equation-based AC or CH phase-field models result in diffuse interfaces between phases, with the only recourse for remediation is to severely refine the spatial grids in the vicinity of the true moving sharp interface whose width is determined by a grid-independent parameter that is substantially larger than the local grid size. In this work, we introduce non-mass conserving nonlocal AC or CH phase-field models with regular, logarithmic, or obstacle double-well potentials. Because of non-locality, some of these models feature totally sharp interfaces separating phases. The discretization of such models can lead to a transition between phases whose width is only a single grid cell wide. Another motivation is to use deep learning approaches to ameliorate the otherwise high cost of solving discretized nonlocal phase-field models. To this end, loss functions of the customized neural networks are defined using the residual of the fully discrete approximations of the AC or CH models, which results from applying a Fourier collocation method and a temporal semi-implicit approximation. To address the long-range interactions in the models, we tailor the architecture of the neural network by incorporating a nonlocal kernel as an input channel to the neural network model. We then provide the results of extensive computational experiments to illustrate the accuracy, predictive capabilities, and cost reductions of the proposed method.

42 ENGINEERING↗

Uncertainty quantification for molecular property predictions with graph neural architecture search

Graph Neural Networks (GNNs) have emerged as a prominent class of data-driven methods for molecular property prediction. However, a key limitation of typical GNN models is their inability to quantify uncertainties in the predictions. This capability is crucial for ensuring the trustworthy use and deployment of models in downstream tasks. To that end, we introduce AutoGNNUQ, an automated uncertainty quantification (UQ) approach for molecular property prediction. AutoGNNUQ leverages architecture search to generate an ensemble of high-performing GNNs, enabling the estimation of predictive uncertainties. Our approach employs variance decomposition to separate data (aleatoric) and model (epistemic) uncertainties, providing valuable insights for reducing them. In our computational experiments, we demonstrate that AutoGNNUQ outperforms existing UQ methods in terms of both prediction accuracy and UQ performance on multiple benchmark datasets, and generalizes well to out-of-distribution datasets. Additionally, we utilize t-SNE visualization to explore correlations between molecular features and uncertainty, offering insight for dataset improvement. AutoGNNUQ has broad applicability in domains such as drug discovery and materials science, where accurate uncertainty quantification is crucial for decision-making.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗