Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “random projection”

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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Dataset for SIAM MPI23 Project "Model inversion for complex physical systems using low-dimensional surrogates"

Training and testing data for the SIAM MPI23 workshop "Model inversion for complex physical systems using low-dimensional surrogates". The data consists of ensembles of input and output pairs corresponding to queries of a 2D saturated groundwater flow model. The inputs consist of random vectors which map to discretized model parameter fields via a Kosambi-Karhunen-Loève expansion. Output corresponds to discretized pressure fields.

basis adaptation, conditional Karhunen-Loève expan↗
DOE OSTI2021

Subsurface Characterization and Machine Learning Predictions at Brady Hot Springs Results

Geothermal power plants typically show decreasing heat and power production rates over time. Mitigation strategies include optimizing the management of existing wells - increasing or decreasing the fluid flow rates across the wells - and drilling new wells at appropriate locations. The latter is expensive, time-consuming, and subject to many engineering constraints, but the former is a viable mechanism for periodic adjustment of the available fluid allocations. Data and supporting literature from a study describing a new approach combining reservoir modeling and machine learning to produce models that enable strategies for the mitigation of decreased heat and power production rates over time for geothermal power plants. The computational approach used enables translation of sets of potential flow rates for the active wells into reservoir-wide estimates of produced energy and discovery of optimal flow allocations among the studied sets. In our computational experiments, we utilize collections of simulations for a specific reservoir (which capture subsurface characterization and realize history matching) along with machine learning models that predict temperature and pressure timeseries for production wells. We evaluate this approach using an "open-source" reservoir we have constructed that captures many of the characteristics of Brady Hot Springs, a commercially operational geothermal field in Nevada, USA. Selected results from a reservoir model of Brady Hot Springs itself are presented to show successful application to an existing system. In both cases, energy predictions prove to be highly accurate: all observed prediction errors do not exceed 3.68% for temperatures and 4.75% for pressures. In a cumulative energy estimation, we observe prediction errors that are less than 4.04%. A typical reservoir simulation for Brady Hot Springs completes in approximately 4 hours, whereas our machine learning models yield accurate 20-year predictions for temperatures, pressures, and produced energy in 0.9 seconds. This paper aims to demonstrate how the models and techniques from our study can be applied to achieve rapid exploration of controlled parameters and optimization of other geothermal reservoirs. Includes a synthetic, yet realistic, model of a geothermal reservoir, referred to as open-source reservoir (OSR). OSR is a 10-well (4 injection wells and 6 production wells) system that resembles Brady Hot Springs (a commercially operational geothermal field in Nevada, USA) at a high level but has a number of sufficiently modified characteristics (which renders any possible similarity between specific characteristics like temperatures and pressures as purely random). We study OSR through CMG simulations with a wide range of flow allocation scenarios. Includes a dataset with 101 simulated scenarios that cover the period of time between 2020 and 2040 and a link to the published paper about this project, where we focus on the Machine Learning work for predicting OSR's energy production based on the simulation data, as well as a link to the GitHub repository where we have published the code we have developed (please refer to the repository's readme file to see instructions on how to run the code). Additional links are included to associated work led by the USGS to identify geologic factors associated with well productivity in geothermal fields. Below are the high-level steps for applying the same modeling + ML process to other geothermal reservoirs: 1. Develop a geologic model of the geothermal field. The location of faults, upflow zones, aquifers, etc. need to be accounted for as accurately as possible 2. The geologic model needs to be converted to a reservoir model that can be used in a reservoir simulator, such as, for instance, CMG STARS, TETRAD, or FALCON 3. Using native state modeling, the initial temperature and pressure distributions are evaluated, and they become the initial conditions for dynamic reservoir simulations 4....

15 GEOTHERMAL ENERGY↗
DOE OSTI2021

An Experimental Analysis on the CNS Simulator Comparing Human Performance between Operators and Students

This study, as a previous study of the SHEEP project, aims to identify differences in human performance data through experiments with students and operators using CNS (Compact Nuclear Simulator). To achieve this goal, this experiment seeks to analyze the correlation of measured human performance between students and operators through a randomized factorial experiment design. Five human performances are measured. In addition, several scenarios and related procedures have been developed for the CNS experiments.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2021

Review: Magnesium Sheet Alloy Development for Room Temperature Forming

Sheet metal forming operations in the automotive industry, including stamping, flanging, bending, hemming and trimming, are dominantly done at room temperature (RT). Unfortunately, the poor RT formability of magnesium due to its hexagonal close packed (HCP) structure and generally strong texture has limited the use of these processes in high-volume automotive production. However, the formability of magnesium can be improved via fine grain structure and random texture to enable some RT forming operations. Here, this paper presents the latest magnesium alloy development and evaluation by the United States Automotive Materials Partnership (USAMP) in collaboration with its university partners. A new sheet alloy developed in a recent USAMP project, ZAXME11100 (USAMP Alloy 2 Plus), offers excellent ductility (31% tensile elongation) and RT formability (7.8 mm Erichsen Index) in solution-treated condition (T4), and a high yield strength (270 MPa) upon post-forming aging treatment (T6), promising RT forming for automotive applications.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Evaluating the Interplay between Trajectory Segmentation and Mode Inference Error

Travel behavior changes are essential to transportation decarbonization. Travel diaries, consisting of sequences of trips between places, are typically used to instrument human travel behavior. However, these diaries are only as accurate as the underlying methods used to construct them. Travel diary algorithms have been a popular research topic since the advent of Global Positioning System tracking surveys. These algorithms have typically been validated using prompted recall of presegmented trips, thus disregarding the continuity of mode inference. Phone operating systems have adopted battery-conserving techniques, but the resulting data collection errors have not been studied extensively. We introduce a framework to evaluate the accuracy of trip length computations and mode inference by analyzing continuous mode-segmented trajectories for groups of trips. We then use the framework to identify the input data quality and the impact of postprocessing. Our primary inputs to this evaluation are MobilityNet, a public dataset containing information from three artificial timelines covering 15 different travel modes, and sample open-source travel diary creation algorithms from the OpenPATH project. Our framework concretely shows that the variance of the distance error drops from (0.217, 0.0848) to (o.011, 0.0407) (Android, iOS) after postprocessing. Similarly, the weighted F-scores for mode inference increase from (0.25, 0.29) to (0.60, 0.74) (iOS, Android) between random forest and geographic information system-based models. We hope that this standardized method will be adapted to evaluate other, potentially proprietary, travel diary algorithms. Finally, the results can be used to understand and improve the state of the art in the travel diary creation field.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2025

Accelerating Neutrino Event Generation in MARLEY Using CUDA-Based RNG and GPU Parallelization

MARLEY is a simulation tool that helps scientists study how low-energy neutrinos interact with matter. To work properly, MARLEY uses random numbers thousands of times in each simulation. These random numbers are important for modeling things like how neutrinos collide with atoms and what particles they produce. Right now, MARLEY runs on a regular computer processor (CPU) and uses a built-in random number generator called the Mersenne Twister. This setup works, but it can be slow, especially when trying to simulate many events. This research focuses on making MARLEY run faster by moving the random number generation and some of the repetitive calculations from the CPU to a graphics processing unit (GPU), which can handle many tasks at the same time. We use CUDA (a tool for programming NVIDIA GPUs) and cuRAND (a GPU-based random number library) to test faster alternatives to the current random number system. We compare different GPU-based generators, like curand_mtgp32, xorwow, and philox, to see which ones are the quickest and still give reliable results. Early tests show that using the GPU can make MARLEY simulations much faster. This project not only helps improve current simulation performance but also moves closer to a full simulation chain where all stages can run on modern GPU hardware.

Dunkley, Kimieka [Florida A-M]↗
DOE OSTI2023

2D k -th nearest neighbour statistics: a highly informative probe of galaxy clustering

ABSTRACT Beyond standard summary statistics are necessary to summarize the rich information on non-linear scales in the era of precision galaxy clustering measurements. For the first time, we introduce the 2D k-th nearest neighbour (kNN) statistics as a summary statistic for discrete galaxy fields. This is a direct generalization of the standard 1D kNN by disentangling the projected galaxy distribution from the redshift-space distortion signature along the line-of-sight. We further introduce two different flavours of 2D kNNs that trace different aspects of the galaxy field: the standard flavour which tabulates the distances between galaxies and random query points, and a ‘DD’ flavour that tabulates the distances between galaxies and galaxies. We showcase the 2D kNNs’ strong constraining power both through theoretical arguments and by testing on realistic galaxy mocks. Theoretically, we show that 2D kNNs are computationally efficient and directly generate other statistics such as the popular two-point correlation function (2PCF), voids probability function, and counts-in-cell statistics. In a more practical test, we apply the 2D kNN statistics to simulated galaxy mocks that fold in a large range of observational realism and recover parameters of the underlying extended halo occupation distribution (HOD) model that includes velocity bias and galaxy assembly bias. We find unbiased and significantly tighter constraints on all aspects of the HOD model with the 2D kNNs, both compared to the standard 1D kNN, and the classical redshift-space 2PCF.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Deep-learning-based image registration for nano-resolution tomographic reconstruction

Nano-resolution full-field transmission X-ray microscopy has been successfully applied to a wide range of research fields thanks to its capability of non-destructively reconstructing the 3D structure with high resolution. Due to constraints in the practical implementations, the nano-tomography data is often associated with a random image jitter, resulting from imperfections in the hardware setup. Without a proper image registration process prior to the reconstruction, the quality of the result will be compromised. Here a deep-learning-based image jitter correction method is presented, which registers the projective images with high efficiency and accuracy, facilitating a high-quality tomographic reconstruction. This development is demonstrated and validated using synthetic and experimental datasets. We report the method is effective and readily applicable to a broad range of applications. Together with this paper, the source code is published and adoptions and improvements from our colleagues in this field are welcomed.

deep learning↗
DOE OSTI2022

HPC Analytics of Fused Thermal Plants Data to Optimize Operating Envelope

In this project, ORNL extensively reviewed the ORAP RAM data, and it guided us to develop machine learning models that can predict time to next failures and forecast failure trends, which will be useful for optimizing power plant operation strategies. More specifically, we trained multiple random forest models and evaluated the model accuracy to validate with 10+ years of historical data. In addition, we implemented a web-based graphical user interface system for the models to show how our models can be used in more intuitive ways. This proof of concept allowed exploration of model use with power plant operators in mind. Developed machine learning models will be helpful for managing risks, planning maintenance and operation, ultimately reducing the down time and increasing the service hours. For future work, there are several interesting research topics including but not limited to model enhancement, creating synergy with traditional failure modeling approaches, and data-driven actionable recommendation and suggestions.

20 FOSSIL-FUELED POWER PLANTS↗
DOE OSTI2025

Likelihood-Based Particle Identification in the Short-Baseline Near Detector

Accurate particle identification is crucial in any high-energy physics experiment, allowing scientists to understand the unique interactions and mechanisms at play in a detector. In this project, I develop and study a new particle identification (PID) algorithm for the Short-Baseline Near Detector, a likelihood-based approach, different from out current $\chi^2$ method. A likelihood estimation offers a more physically motivated strategy for PID. The distribution random energy losses of charged particles traveling through a medium are described by the Vavilov probability density function. By using this model, we can account for random energy losses and construct likelihood functions specific to each particle type, potentially enabling a more accurate method for PID.

Vanderwaal, Sophia [U. Alabama, Huntsville] (ORCID↗
DOE OSTI2022

Efficient computation of N -point correlation functions in D dimensions

We present efficient algorithms for computing the N-point correlation functions (NPCFs) of random fields in arbitrary D-dimensional homogeneous and isotropic spaces. Such statistics appear throughout the physical sciences and provide a natural tool to describe stochastic processes. Typically, algorithms for computing the NPCF components have $\mathscr O$(n N ) complexity (for a dataset containing n particles); their application is thus computationally infeasible unless N is small. By projecting the statistic onto a suitably defined angular basis, we show that the estimators can be written in a separable form, with complexity $\mathscr O$(n 2 ) or $\mathscr O$(n g log n g ) if evaluated using a Fast Fourier Transform on a grid of size n g . Our decomposition is built upon the D-dimensional hyperspherical harmonics; these form a complete basis on the (D – 1) sphere and are intrinsically related to angular momentum operators. Concatenation of (N – 1) such harmonics gives states of definite combined angular momentum, forming a natural separable basis for the NPCF. As N and D grow, the number of basis components quickly becomes large, providing a practical limitation to this (and all other) approaches: However, the dimensionality is greatly reduced in the presence of symmetries; for example, isotropic correlation functions require only states of zero combined angular momentum. We provide a Julia package implementing our estimators and show how they can be applied to a variety of scenarios within cosmology and fluid dynamics. The efficiency of such estimators will allow higher-order correlators to become a standard tool in the analysis of random fields.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Contributions to the BeEST sterile neutrino search

Sterile neutrinos are hypothetical right-handed leptons that have been postulated as extensions to the Standard Model to help explain the origin of neutrino masses and the matter-antimatter asymmetry in the Universe. Sterile neutrinos with keV-scale masses are also a promising candidate for dark matter. LLNL and the Colorado School of Mines are developing an experiment to search for sterile neutrinos by measuring the \Beryllium-7 Electron capture in Superconducting Tunnel junctions (STJs)" (the \BeEST" Experiment). When 7 Be implanted into STJ radiation detectors decays by electron capture, the neutrino escapes and the energy of the recoiling 7 Li nucleus can be measured with high accuracy. Using conservation of energy and momentum, the mass of the emitted neutrino can then be found. Sterile keV neutrinos would generate additional peaks in the spectrum, and the experiment uses high-resolution STJs to observe such a potential signal. During my internship, I contributed to different aspects of the BeEST experiment. I designed a UHV setup for X-ray spectroscopy analysis with STJs. It will allow high-resolution X-ray spectroscopy of different materials to examine the broadening in the BeEST spectra, the origins of which are unknown but may be related to material effects inside the STJ detectors. The design accounts for the specific demands of the BeEST project, but provides a degree of flexibility that makes it useful for other potential STJ projects. Additionally, to test the accuracy of the electronics and data analysis routine, an arbitrary waveform generator (AWG) will be used to generate simulated spectra that contain sterile neutrino signals of a specified mass and admixture. For this I programmed an AWG to output random STJ signals whose amplitudes follow the appropriate user-de ned probability distribution. The AWG signals can be input into the 32-channel preamplifier to simulate any spectrum of interest and test the uniformity of the amplifier chain, as well as the sensitivity of the data analysis.

42 ENGINEERING↗
DOE OSTI2020

Fast Computational Algorithms for Partial Differential Equations and Uncertainty Quantifications

This project concerned the construction, testing and analysis of computational algorithms for solving parameterized and stochastic partial differential equations. The study and understanding of equations of this type is of fundamental importance in numerous engineering and scientific applications. Examples include simulation of plasma dynamics in models of electric propulsion and nuclear fusion, simulation of multiphase flows, such as the flow of water, gas and oil in reservoirs, and structural analysis of the dependence of structures on materials. Parametrization is used in such settings when properties of the models such as viscosity of fluids or electric resistivity of materials are not precisely understood and instead are treated as random variables. The resulting solutions are themselves random, and having such solutions will enable engineers to use probabilistic methods to assess the likelihood of events, for example, whether a pollutant in a liquid will exceed a limit, and to use such analyses to develop ways to ensure positive outcomes. Construction of accurate (high resolution) computational solutions is expensive, requiring significant computer time and computational resources, and there is need to reduce computational cost to make simulation useful and effective. The aim of the project was to construct algorithms to efficiently compute surrogate solutions to parameterized problems to allow for efficient and accurate simulation. The technical approach used focused on two related strategies, based on rank-reduction methods and reduced-order models. These methods construct surrogate solutions of parameter-dependent models by projection or interpolation into low-dimensional approximation spaces. Cost savings are achieved if the low-dimensional spaces can be identified and constructed efficiently and if the resulting low-dimensional algebraic systems can be solved cheaply. Accomplishments include: Theoretical and empirical demonstration of the effectiveness of fast multigrid solution strategies for computing low-rank representations of parameter-dependent solutions to discrete partial differential equations, including the first proof establishing so-called textbook convergence properties for low-rank methods. Development of efficient solution algorithms for solving nonlinear parameter-dependent partial differential equations used in models of fluid dynamics. Developent of efficient algorithms for low-rank representation of solutions of time-dependent simulations of fluid dynamics using multi-dimensional tensor representations of solutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Improvements to the macroscopic-microscopic approach of nuclear fission

The well-established macroscopic-microscopic (mac-mic) description of nuclear fission enables the prediction of fission-fragment yields for a broad range of fissioning systems. In this work, we present several key enhancements to this approach. We improve upon the microscopic sector of nuclear potential-energy surfaces by magnifying the resolution of the Lipkin-Nogami equations and strengthening the Strutinsky procedure, thus reducing spurious effects from the continuum. We further present a novel deterministic method for calculating fission dynamics under the assumption of strongly damped nucleonic motion. Our technique directly determines the evolution of the scissioned shape distribution according to the number of random-walk steps rather than the statistical accumulation of fission events. We show that our new technique is equivalent to the Metropolis random walk pioneered over the past decade by Randrup and colleagues. It further improves upon it because we remove the need for altering the nuclear landscape via a biased potential. With our final improvement, we calculate fission fragments mass and charge distributions using particle number projection, which affords the simultaneous calculation of both mass- and charge-yield distributions. Fission fragments are thus calculated from the quantum-mechanical A -body states of the potential-energy surface rather than from the collective mass asymmetry variable α g of the finite-range liquid-drop model used in past work. We highlight the success of our enhancements by predicting the odd-even staggering and the charge polarization for the neutron-induced fission of 233 U and 235 U .

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Observations and Machine-Learned Models of Near-Surface Permafrost along the Koyukuk River, Alaska, USA

This dataset contains GeoTIFs (raster) and GeoPackages (vector) that map observations of near-surface permafrost and not-permafrost from a field campaign conducted near the village of Huslia, AK along the Koyukuk River and its floodplain in July 2018. These data were collected as part of a campaign to understand if and how permafrost impacts riverbank erosion. This problem cannot be assessed without knowing where permafrost exists. Permafrost was observed via frost probing (to a maximum depth of one meter), coring (to a maximum depth of two meters) and bank/bar excavations. An additional boat survey was performed wherein expert (Joel Rowland) judgment assessed the presence or absence of distinctive permafrost features (e.g., overhanging tundra mats, thermoerosional niching, ice wedges, active drainage of ice melt from soils). This dataset also contains the input features and results of two machine learning models (random forest and convolutional neural network) that extrapolate the observations to the full floodplain that may be useful for building, testing, or validating other machine-learned permafrost models. Permafrost data are provided as georasters of the same shape and geovectors (polylines/polygons) and are all projected into EPSG:32605. All data can be visualized with a GIS (QGIS, ArcGIS, etc.).

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

Two-Level Sketching Alternating Anderson Acceleration for Complex Physics Applications

We present a novel two-level sketching extension of the Alternating Anderson–Picard (AAP) method for accelerating fixed-point iterations in challenging single- and multiphysics simulations governed by discretized PDEs. Our approach combines a static, physics-based projection that reduces the least-squares (LS) problem to the most informative field (e.g., via Schur-complement insight) with a dynamic, algebraic sketching stage driven by a backward stability analysis under Lipschitz continuity. We introduce inexpensive estimators for stability thresholds and cache-aware randomized selection strategies to balance computational cost against memory access overhead. The resulting algorithm solves reduced LS systems in place, minimizes memory footprints, and seamlessly alternates between low-cost Picard updates and Anderson mixing. Implemented in Julia, our two-level sketching AAP achieves up to 50% time-to-solution reductions compared to standard Anderson acceleration—without degrading convergence rates—on benchmark problems including Stokes, 𝑝-Laplacian, bidomain, and Navier–Stokes formulations at varying problem sizes. These results demonstrate the method’s robustness, scalability, and potential for integration into high-performance scientific computing frameworks. Our implementation is available open source in the AAP.jl library.

Barnafi, Nicolas [University of Chile, Santiago]↗
DOE OSTI2025

Optimizing transmit field inhomogeneity of parallel RF transmit design in 7T MRI using deep learning

Ultrahigh field (UHF) Magnetic Resonance Imaging (MRI) provides a higher signal-to-noise ratio and, thereby, higher spatial resolution. However, UHF MRI introduces challenges such as transmit radiofrequency (RF) field (B+1) inhomogeneities, leading to uneven flip angles and image intensity anomalies. These issues can significantly degrade imaging quality and its medical applications. This study addresses B+1 field homogeneity through a novel deep learning-based strategy. Traditional methods like Magnitude Least Squares (MLS) optimization have been effective but are time-consuming and dependent on the patient’s presence. Recent machine learning approaches, such as RF Shim Prediction by Iteratively Projected Ridge Regression and deep learning frameworks, have shown promise but face limitations like extensive training times and oversimplified architectures. We propose a two-step deep learning strategy. First, we obtain the desired reference RF shimming weights from multi-channel B+1 fields using random-initialized Adaptive Moment Estimation. Then, we employ Residual Networks (ResNets) to train a model that maps B+1 fields to target RF shimming outputs. Our approach does not rely on pre-calculated reference optimizations for the testing process and efficiently learns residual functions. Comparative studies with traditional MLS optimization demonstrate our method’s advantages in terms of speed and accuracy. The proposed strategy achieves a faster and more efficient RF shimming design, significantly improving imaging quality at UHF. This advancement holds potential for broader applications in medical imaging and diagnostics.

Lu, Zhengyi [Vanderbilt University]↗
DOE OSTI2023

ARENA: Adversary-Resistant Evolving Neural Architectures

Neural networks are becoming the cornerstone for national security prediction tasks. However, designing them requires significant research and trial/error, as they have many hyperparameters, including their computation graph (“architecture”). Neural architecture search (NAS) employs secondary optimizers to search for architectures maximizing objectives like accuracy. Evolutionary algorithms (EAs) are the most used class of optimizer for NAS. However, existing Python libraries for writing EAs limit the complexity of experiments a user can design. In this project, we built ARENA, a Python framework that encodes complex, hyper-realistic EAs. ARENA collects detailed information as it runs and is flexible enough to encode non-EA search algorithms. We tested ARENA on 4 toy optimization problems by encoding 3 search algorithms for each—random search, an EA, and simulated annealing. We also designed an EA that performs NAS on the MNIST dataset. Our experiments suggest the potential for immediate mission impact through solving lab-wide optimization problems.

97 MATHEMATICS AND COMPUTING↗