Optimizing Point-in-Space Continuous Monitoring System Sensor Placement on Oil and Gas Sites
Not Available
Jia, Meng [Department of Applied Mathematics and S↗
SEARCH · Search NASA
Results for “Mathematical optimization”
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.
Powering Data Centers with Clean Energy: A Techno-Economic Case Study of Nuclear and Renewable Energy Dependability
Rising data demands from artificial intelligence (AI) and large language models (LLMs) generating images, videos, and text have prompted increased need for larger and more robust data centers in the United States. Major companies interested in these larger data centers face the choice of linking them to existing regional grids, building stand-alone power supplies onsite, or a combination of both. The request, review, and approval process for new transmission lines to grids in the United States, however, has grown in recent years to times spans rivaling those of new construction for nuclear power plants. Building an islanded power supply for each data center is therefore becoming a prominent option. In this case study, several technologies are modeled in techno-economic simulations for long-term system costs subject to fixed electricity demand from a singular data center. A 250 MWe data center is assumed with additional 50 MWe for resiliency. Techno-economic simulations are conducted using the Holistic Energy Resource Optimization Network (HERON) software, which is a part of the Framework for Optimization of Resources and Economics (FORCE) tool suite. Technologies considered include solar, wind, lithium-ion batteries, and several types of nuclear reactors: large-scale reactors, small modular reactors, and microreactors. A low- and high-cost estimate for each technology is assumed to develop a range of expected economic performance. Low-cost estimates included several clean energy production tax credits. Different combinations of renewable energy generators with nuclear reactors are considered, ranging from a fully renewable-powered data center to a fully nuclear-powered data center. Historic time series of wind and solar availability from the Texas grid are used to train a reduced order model; this model then generates unique time series with similar characteristics of the training dataset. Multiple scenarios of weather and subsequent operations are simulated for each renewable-nuclear combination to determine total costs throughout the project lifetime. Fully renewable-powered configurations required large amounts of installed capacity (GW scale) in the simulations to meet the fixed demand of the data center. This is due to some scenarios in the historical dataset which captured low-wind and low-solar days, requiring over-building of these technologies as well as batteries to compensate for the low amounts of electricity generation. Fully nuclear-powered configurations outperformed the fully renewable and mixed renewable-nuclear configurations in terms of cost, with ranges between $1B and $10B in 2023 USDs compared to $40B+ for fully renewable configurations. Of the nuclear technologies, small modular reactors performed better economically than large-scale nuclear models due to lower projected capital costs, and both performed better than the microreactor models. These results demonstrate the applicability of firm, dispatchable electricity resources from baseload generators like nuclear power plants for operating facilities that run at constant power without daily variability.
22 GENERAL STUDIES OF NUCLEAR REACTORS↗
Optimization of an Energy Tuning Assembly for High Explosives Detection
The Portable Isotopic Neutron Spectroscopy (PINS) system, employs neutron-induced gamma-ray spectroscopy and provides a nondestructive method for high explosives detection. In standard operation it uses Californium-252 as a neutron source. Operating PINS with a deuterium-tritium (DT) neutron generator has some advantages over Cf-252, including lifetime and ability to produce high-energy inelastic scattering gamma rays. However, current systems using DT neutron generators suffer from a high environmental background and reduced ability to induce neutron capture, reducing spectral quality and limiting nitrogen sensitivity. Here, this study presents the development of an energy-tuning assembly (ETA) designed to optimize the DT neutron energy spectrum to increase nitrogen reaction rates in a target, thereby improving high explosive detection capabilities. A metaheuristic optimization framework, MultiGNOWEE, coupled with MCNP, was employed to generate two ETA configurations: a single-objective ETA, which maximizes nitrogen capture reactions, and a multi-objective ETA, which balances neutron capture and inelastic scattering. Simulations demonstrated the optimized configurations achieved up to a 10-fold improvement in nitrogen capture rates compared to the bare configuration. Experimental validation was conducted using a DT neutron generator and a high-purity germanium (HPGe) detector. Two prototype ETAs were constructed and assessed on a melamine simulant. Measurements demonstrated improved nitrogen detection for both prototype ETA configurations when compared to the standard system.
97 MATHEMATICS AND COMPUTING↗
torch-einshard v1.0
torch-einshard is a Python library for describing local and distributed PyTorch tensor computations with compact, einsum-like notation. Its expressions name logical axes, specify how they are sharded across a PyTorch DeviceMesh, and represent partial reductions. The library automatically performs contractions, permutations, reshaping, splitting, gathering, reduction, reduce-scatter, and repartitioning while preserving autograd. Additional features include sharding-aware FFTs, tensor rolls, halo exchange, sliding windows, 1D–3D convolutions, uneven-shard handling, parameter initialization and gradient management, and cost-based execution planning. It is designed for scientific machine learning and large-model workloads, including tensor-, sequence-, and spatial-parallel MLPs, attention, convolutions, and spectral operations. Compared with manually combining torch.einsum and distributed collectives, torch-einshard expresses both the mathematical operation and data placement in one readable formula. This reduces boilerplate and synchronization errors, keeps forward and backward communication consistent, and allows the library to select optimized collective strategies without changing model code.
Morozov, Dmitriy [Lawrence Berkeley National Labor↗
Speed Optimizations for Physics Ray Trace Algorithms
Ray tracing is a process used commonly in computer graphics and in physics to track light photons and particles, respectively. Much research was found on improving execution times for the computer graphics applications; however, in the short time frame of this literary review, almost no research was found on improving the execution times for the physics applications that were relevant to this problem. Two ray trace algorithms, a STL raytrace and a conebeam raytrace, were optimized using OpenMP and CUDA.
97 MATHEMATICS AND COMPUTING↗
Quantum error mitigations for quantum approximate optimization algorithms on IBM quantum processors
Explore the source record for details and available documents.
97 MATHEMATICS AND COMPUTING↗
How Does Escherichia coli Allocate Proteome?
Microorganisms are shown to actively partition their intracellular resources, such as pro- teins, for growth optimization. Recent experiments have begun to reveal molecular com- ponents unpinning the partition; however, it remains unclear quantitatively how individual parts orchestrate to yield precise resource allocation that is both robust and dynamic. Here we developed a coarse-grained mathematical framework that centers on guanosine pentaphosphate (ppGpp)-mediated regulation, and used it to systematically uncover the design principles of proteome allocation in Escherichia coli. Our results showed that cellular ability of resource partition lies in an ultrasensitive, negative feedback control- ling topology with the ultrasensitivity arising from zero-order amino acid kinetics and the negative feedback from ppGpp-controlled ribosome synthesis. In addition, together with the time-scale separation between slow ribosome kinetics and fast turnovers of ppGpp and amino acids, the network topology confers the organism an optimization mechanism which mimics sliding mode control, a nonlinear optimization strategy that is widely used in man-made systems. We further showed that such a controlling mechanism is robust against parameter variations and molecular fluctuations, and is also efficient for biomass production over time. Furthermore, this work elucidates the fundamental controlling mechanism of E. coli proteome allocation, thereby providing insights into quantitative microbial physiology as well as the design of synthetic gene networks.
59 BASIC BIOLOGICAL SCIENCES↗
Artificial intelligence driven laser parameter search: Inverse design of photonic surfaces using greedy surrogate-based optimization
Photonic surfaces designed with specific optical characteristics are becoming increasingly crucial for novel energy harvesting and storage systems. The design of these surfaces can be achieved by texturing materials using lasers. The optimal adjustment of laser fabrication parameters to achieve target surface optical properties is an open challenge. Thus, we develop a surrogate-based optimization approach. Our framework employs the Random Forest algorithm to model the forward relationship between the laser fabrication parameters and the resulting optical characteristics. During the optimization process, we use a greedy, prediction-based exploration strategy that iteratively selects batches of laser parameters to be used in experimentation by minimizing the predicted discrepancy between the surrogate model’s outputs and the user-defined target optical characteristics. This strategy allows for efficient identification of optimal fabrication parameters without the need to model the error landscape directly. We demonstrate the efficiency and effectiveness of our approach on two synthetic benchmarks and two specific experimental applications of photonic surface inverse design targets. By calculating the average performance of our algorithm compared to other state of the art optimization methods, we show that our algorithm performs, on average, twice as well across all benchmarks. Additionally, a warm starting inverse design technique for changed target optical characteristics enhances the performance of the introduced approach.
97 MATHEMATICS AND COMPUTING↗
Optimizing the optimizer for physics-informed neural networks and Kolmogorov-Arnold networks
Physics-Informed Neural Networks (PINNs) have revolutionized the computation of PDE solutions by integrating partial differential equations (PDEs) into the neural network’s training process as soft constraints, becoming an important component of the scientific machine learning (SciML) ecosystem. More recently, physics-informed Kolmogorv-Arnold networks (PIKANs) have also shown to be effective and comparable in accuracy with PINNs. In their current implementation, both PINNs and PIKANs are mainly optimized using first-order methods like Adam, as well as quasi-Newton methods such as BFGS and its low-memory variant, L-BFGS. However, these optimizers often struggle with highly nonlinear and non-convex loss landscapes, leading to challenges such as slow convergence, local minima entrapment, and (non)degenerate saddle points. In this study, we investigate the performance of Self- Scaled BFGS (SSBFGS), Self-Scaled Broyden (SSBroyden) methods and other advanced quasi-Newton schemes, including BFGS and L-BFGS with different line search strategies. These methods dynamically rescale updates based on historical gradient information, thus enhancing training efficiency and accuracy. We systematically compare these optimizers – using both PINNs and PIKANs – on key challenging PDEs, including the Burgers, Allen-Cahn, Kuramoto-Sivashinsky, Ginzburg-Landau, and Stokes equations. Additionally, we evaluate the performance of SSBFGS and SSBroyden for Deep Operator Network (DeepONet) architectures, demonstrating their effectiveness for data-driven operator learning. Our findings provide state-of-the-art results with orders-of-magnitude accuracy improvements without the use of adaptive weights or any other enhancements typically employed in PINNs. More broadly, our work reveal insights into the effectiveness of quasi-Newton optimization strategies in significantly improving the convergence and accurate generalization of PINNs and PIKANs.
97 MATHEMATICS AND COMPUTING↗
Developing Drag Models for Non-Spherical Particles through Machine Learning
The overarching goal of this project is to produce comprehensive experimental and numerical datasets for gas-solid flows in well-controlled settings to understand the aerodynamic drag of non-spherical particles in the dense regime. The datasets and the gained knowledge will be utilized to train deep neural networks in TensorFlow to formulate a general drag model for use directly in NETL MFiX-DEM module in order to help to advance the accuracy and prediction fidelity of the computational tools that will be used in designing and optimizing fluidized beds and chemical looping reactors.
42 ENGINEERING↗
Digital Twinning and Predictive Modeling of Traffic for Safe, Efficient, and Reliable Intersections
Over the last decade, the advances in connected and autonomous vehicles (CAVs) have far surpassed the technological realm of transportation infrastructure. There is a growing need to have a technologically commensurate transportation infrastructure to enable safe and reliable movement of goods and people. The recent creation of Advanced Research Projects Agency - Infrastructure (ARPA-I) through the Infrastructure Investment and Jobs Act by the U.S. Department of Transportation (USDOT) has further amplified the need to revolutionize the transportation infrastructure system in the US. This need is perhaps felt most at traffic intersections, as more than 50 percent of the combined total of fatal and injury crashes occur at or near intersections. The proposed concept of Infrastructure Perception and Control (IPC) is aimed at bridging this technological gap by building a real-time digital twin of traffic by fusing detections from sensors installed at the intersection. This digital twin can then empower a wide variety of applications such as smart traffic signals or infrastructure-to-everything (I2X) communications. Smart signaling can help avoid crashes through early-prediction, while I2X can augment the CAV sensors under uncertain driving conditions and provide connected vehicles (CVs) with traffic information they can use to optimize their travel.
connected vehicles↗
Analysis of the weighted shifted boundary method for the Poisson and Stokes problems
The Shifted Boundary Method (SBM) belongs to the class of unfitted (or immersed, or embedded) finite element methods, and relies on reformulating the original boundary value problem over a surrogate (approximate) computational domain. Accuracy is maintained by properly shifting the location and values of the boundary conditions. This avoids integration over cut cells and the associated implementation issues. Recently, the Weighted SBM (WSBM) was proposed for the Navier-Stokes equations with free surfaces and the Stokes flow with moving boundaries. The attribute “weighted” in the name WSBM stems from the fact that its variational form is weighted with the elemental volume fraction of active fluid. The motivation for the development of the WSBM was the preservation of the volume of active fluid to a higher degree of accuracy, which in turn resulted in improved stability and robustness characteristics in moving-boundary, time-dependent simulations. In this article, we present the numerical analysis of the WSBM formulations for the Poisson and Stokes problems. We give mathematical conditions under which the bilinear forms defining the discrete variational formulations are uniformly coercive (Poisson problem) or inf-sup stable (Stokes problem). By these results, stability and optimal convergence is proven in the natural norm; L2-error estimates can also be derived.
Approximate domain boundaries↗
MatCal Users Guide: Release 1.3.0
Any continuum mechanics model will require three components: (1) a discretized geometry of the boundary value problem being studied, (2) the partial differential equations to be solved, and (3) the initial conditions and boundary conditions for the problem. To describe material behavior in these computational models, material models contribute to (2) the underlying equations and, occasionally, to (3) the initial conditions for the simulation. These material models can exhibit a mathematical form that is empirically based, based on first principles, or developed from both empirical observations and known physics. In general, these models are meant to represent a class of materials with well understood behavior. As a result, material models have parameters that must be tuned or calibrated so that the model response matches characterization data available for the specific material it is intended to represent when used to simulate a specific system. For simple models, such as isotropic, linear elastic materials in solid mechanics, this calibration process can be a simple analytical calculation directly extracting the parameters from experimental measurements. For complex models that have many inputs and require many characterization datasets to adequately identify the material behavior, the model calibration process can require an inverse problem approach where an optimization is performed to tune the model parameters to the available data.
36 MATERIALS SCIENCE↗
Architecture and performance of Perlmutter's 35 PB ClusterStor E1000 all-flash file system
NERSC's newest system, Perlmutter, features a 35 PB all-flash Lustre file system built on HPE Cray ClusterStor E1000. Here, we present its architecture, early performance figures, and performance considerations unique to this architecture. We demonstrate the performance of E1000 OSSes through low-level Lustre tests that achieve over 90% of the theoretical bandwidth of the SSDs at the OST and LNet levels. We also show end-to-end performance for both traditional dimensions of I/O performance (peak bulk-synchronous bandwidth) and nonoptimal workloads endemic to production computing (small, incoherent I/Os at random offsets) and compare them to NERSC's previous system, Cori, to illustrate that Perlmutter achieves the performance of a burst buffer and the resilience of a scratch file system. Finally, we discuss performance considerations unique to all-flash Lustre and present ways in which users and HPC facilities can adjust their I/O patterns and operations to make optimal use of such architectures.
97 MATHEMATICS AND COMPUTING↗
Design of Hopfield Networks Based on Superconducting Coupled Oscillators
The global energy shortage has driven the development of many energy-efficient computational platforms beyond Moore's law, among which brain-inspired neuromorphic computing is one of the promising solutions. Associative memory and pattern recognition are important computations solved by brain-inspired Hopfield networks. Classical Hopfield networks store memories via fixed point attractors of their dynamics. In oscillatory Hopfield networks, these attractors are replaced by periodic orbits. Here, we design an oscillatory Hopfield network based on coupled superconducting oscillators. We first employ a mathematical phase reduction approach to map networks of coupled superconducting rapid single flux quantum (RSFQ) ring oscillators to coupled Kuramoto phase-oscillator networks. We use this theory to numerically optimize the hardware's mutual inductances in order to directly match the phase-reduced superconducting oscillators to a model of phase-oscillator-based Hopfield networks. The resulting network can store multiple oscillatory phase-locked memory patterns and recover the patterns based on the initial phase conditions. As different pattern recognition tasks, or learning, require tunable connectivity strengths between the oscillatory nodes, we further employ a coupler circuit that enables tuning the coupling strength between two oscillators by applying an external flux. We demonstrate the functionality of our design through numerical simulations of a small example network with oscillators operating at 86 GHz and recognizing patterns within 10 ns. Our approach enables the learning and retrieval of dynamical memory patterns with a wide range of applications where rhythmic dynamic output is beneficial.
Cheng, Ran↗
Complete Demonstration of a Prototype Version of FORCE User Interface and Conduct Analyst Survey Collecting Feedback on Interface Features and Usability
In 2024 the US Department of Energy (DOE) Office of Nuclear Energy (NE) Integrated Energy System (IES) program continued to develop the Framework for Optimization of Resources and Economics (FORCE) analysis ecosystem into a more traditional toolset with simplified software installation, automated workflows, and interactive results visualization. The DOE-NE Nuclear Energy Advanced Modeling and Simulation (NEAMS) Workbench continued to be leveraged for user input, application workflow and runtime environment, and interactive results visualization capabilities. This report documents the demonstration of a FORCE User Interface (UI) prototype and the results of a survey of analysts’ using the Holistic Energy Resource Optimization Network (HERON) tool in FORCE with the prototype UI.
97 MATHEMATICS AND COMPUTING↗
Leveraging prior mean models for faster Bayesian optimization of particle accelerators
Tuning particle accelerators is a challenging and time-consuming task that can be automated and carried out efficiently using suitable optimization algorithms, such as model-based Bayesian optimization techniques. One of the major advantages of Bayesian algorithms is the ability to incorporate prior information about beam physics and historical behavior into the model used to make control decisions. In this work, we examine incorporating prior accelerator physics information into Bayesian optimization algorithms by utilizing fast executing, neural network models trained on simulated or historical datasets as prior mean functions in Gaussian process models. We show that in ideal cases, this technique substantially increases convergence speed to optimal solutions in high-dimensional tuning parameter spaces. Additionally, we demonstrate that even in non-ideal cases, where prior models of beam dynamics do not exactly match experimental conditions, the use of this technique can still enhance convergence speed. Finally, we demonstrate how these methods can be used to improve optimization in practical applications, such as transferring information gained from beam dynamics simulations to online control of the LCLS injector, and transferring knowledge gained from experimental measurements across different operating modes, such as accelerating different ion species at the ATLAS heavy ion accelerator.
43 PARTICLE ACCELERATORS↗
Generative AI in Supply Chain Management: Applications, Challenges, and Future Directions
Supply chain management (SCM) is undergoing rapid transformation due to increasing global complexity, demand volatility, and operational disruptions. Generative Artificial Intelligence (GenAI) has emerged as a powerful paradigm capable of synthesizing data, simulating operational scenarios, and enabling adaptive decision-making across supply chain networks. This paper presents a survey of GenAI’s role in SCM, focusing on its applications in predictive analytics, autonomous logistics, and fraud detection. Unlike traditional AI systems that rely primarily on predictive analytics, GenAI models, including large language models, generative adversarial networks, and diffusion-based architectures, enable the creation of synthetic supply chain scenarios and autonomous optimization strategies. This survey provides (1) a taxonomy of GenAI techniques for supply chain applications, (2) a comparative analysis of generative AI approaches with traditional machine learning, reinforcement learning, and blockchain-based methods, and (3) a discussion of key challenges such as data privacy, interpretability, and integration with legacy enterprise systems. Furthermore, we outline open research problems and propose directions for future research toward autonomous, resilient, and sustainable AI-driven supply chains.
15 - GEOTHERMAL ENERGY↗