SEARCH · Engineering Papers

Results for “optimization 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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 937 records · Page 52

All sources NASA NTRS DOE OSTI

DOE OSTI2020

Automated detector simulation and reconstruction parametrization using machine learning

Rapidly applying the effects of detector response to physics objects (e.g. electrons, muons, showers of particles) is essential in high energy physics. Presently available tools for the transformation from truth-level physics objects to reconstructed detector-level physics objects involve manually defining resolution functions. These resolution functions are typically derived in bins of variables that are correlated with the resolution (e.g. pseudorapidity and transverse momentum). This process is time consuming, requires manual updates when detector conditions change, and can miss important correlations. Machine learning offers a way to automate the process of building these truth-to-reconstructed object transformations and can capture complex correlation for any given set of input variables. Such machine learning algorithms, with sufficient optimization, could have a wide range of applications: improving phenomenological studies by using a better detector representation, allowing for more efficient production of Geant4 simulation by only simulating events within an interesting part of phase space, and studies on future experimental sensitivity to new physics.

47 OTHER INSTRUMENTATION↗

DOE OSTI2020

Short-depth circuits for efficient expectation-value estimation

The evaluation of expectation values Tr[$\rho \mathcal{O}$] for some pure state $\rho$ and Hermitian operator $\mathcal{O}$ is of central importance in a variety of quantum algorithms. Near-optimal techniques have been developed in the past and require a number of measurements N approaching the Heisenberg limit N = O(1/ ε) as a function of target accuracy ε. The use of quantum phase estimation (QPE) requires, however, long circuit depths C = O(1/ ε) making its implementation difficult on near-term noisy devices. The more direct strategy of operator averaging is usually preferred as it can be performed using N = O(1/ε 2 ) measurements and no additional gates aside from those needed for the state preparation. In this work we use a simple but realistic model to describe the bound state of a neutron and a proton (the deuteron) to show that the latter strategy can require an overly large number of measurements in order to achieve a prefixed relative target accuracy ε r . Further, we propose to overcome this problem using a single step of QPE and classical postprocessing. This approach leads to a circuit depth C = O (ε μ ) (with μ ≥ 0) and to a number of measurements N = O (1/ε 2 + ν ) for 0 < ν ≤ 1 and a much smaller prefactor. We provide detailed descriptions of two implementations of our strategy for ν = 1 and ν ≈ 0.5 and derive appropriate conditions that a particular problem instance has to satisfy in order for our method to provide an advantage.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Local chromatic correction optics for Future Circular Collider e + e −

Local chromatic correction optics are proposed for the Future Circular e + − e − Collider. These new optics assume an identical layout of the magnets at all operation energies and include a new design for the arcs, for the straight sections, and for the final focus. The arcs design is a step forward from the classic FODO lattice that achieves near cancellation up to the fourth order of chromatic and geometric aberrations. Straight sections and the final focus benefit from the application of transparency conditions and are thus minimally impacting the global beam dynamics. The final focus design includes both vertical and horizontal chromaticity correction sections, crab sextupoles, and additional specific sextupoles and decapoles for the optimization of the dynamics off-energy. Decapoles are very effective in mitigating the reduction of dynamic aperture due to synchrotron radiation. Nonlinear magnet settings are further optimized with multiobjective algorithms. The overall properties of the new optics proposed are analyzed in the presence of errors and compared to other optics designs.

43 PARTICLE ACCELERATORS↗

DOE OSTI2026

Active learning emulators for nuclear two-body scattering in momentum space

In this work we extend the active learning emulators for two-body scattering in coordinate space with error estimation, recently developed by Maldonado et al. [Phys. Rev. C 112, 024002], to coupled-channel scattering in momentum space. Our full-order model (FOM) solver is based on the Lippmann-Schwinger integral equation for the scattering t-matrix as opposed to the radial Schrödinger equation. We use (Petrov-)Galerkin projections and high-fidelity calculations at a few snapshots across the parameter space of the interaction to construct efficient reduced-order models (ROMs), trained by a greedy algorithm for locally optimal snapshot selection. Both the FOM solver and the corresponding ROMs are implemented efficiently in Python using Google's JAX library. We present results for emulating scattering phase shifts in coupled and uncoupled channels and cross sections, and assess the accuracy of the developed ROMs and their computational speedup factors. We also develop emulator error estimation for both the t-matrix and the total cross section. The software framework for reproducing and extending our results is publicly available. Together with our recent advances in developing active-learning emulators for three-body scattering, these emulator frameworks set the stage for full Bayesian calibrations of chiral nuclear interactions and optical models against scattering data with quantified emulator errors.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2025

Massive compression for high data rate macromolecular crystallography (HDRMX): impact on diffraction data and subsequent structural analysis

New higher-count-rate, integrating, large-area X-ray detectors with framing rates as high as 17400 images per second are beginning to be available. These will soon be used for specialized macromolecular crystallography experiments but will require optimal lossy compression algorithms to enable systems to keep up with data throughput. Some information may be lost. Can we minimize this loss with acceptable impact on structural information? To explore this question, we have considered several approaches: summing short sequences of images, binning to create the effect of larger pixels, use of JPEG-2000 lossy wavelet-based compression, and use of Hcompress, which is a Haar-wavelet-based lossy compression borrowed from astronomy. We also explore the effect of the combination of summing, binning, and Hcompress or JPEG-2000. In each of these last two methods one can specify approximately how much one wants the result to be compressed from the starting file size. These provide particularly effective lossy compressions that retain essential information for structure solution from Bragg reflections.

47 OTHER INSTRUMENTATION↗

DOE OSTI2021

Scaling Out a Combinatorial Algorithm for Discovering Carcinogenic Gene Combinations to Thousands of GPUs

Cancer is a leading cause of death in the US, second only to heart disease. It is primarily a result of a combination of an estimated two-nine genetic mutations (multi-hit combinations). Although a body of research has identified hundreds of cancer-causing genetic mutations, we don’t know the specific combination of mutations responsible for specific instances of cancer for most cancer types. An approximate algorithm for solving the weighted set cover problem was previously adapted to identify combinations of genes with mutations that may be responsible for individual instances of cancer. However, the algorithm’s computational requirement scales exponentially with the number of genes, making it impractical for identifying more than three-hit combinations, even after the algorithm was parallelized and scaled up to a V100 GPU. Since most cancers have been estimated to require more than three hits, we scaled out the algorithm to identify combinations of four or more hits using 1000 nodes (6000 V100 GPUs with ≈48×106 processing cores) on the Summit supercomputer at Oak Ridge National Laboratory. Efficiently scaling out the algorithm required a series of algorithmic innovations and optimizations for balancing an exponentially divergent workload across processors and for minimizing memory latency and inter-node communication. We achieved an average strong scaling efficiency of 90.14% (80.96%–97.96% for 200 to 1000 nodes), compared to a 100 node run, with 84.18% scaling efficiency for 1000 nodes. With experimental validation, the multi-hit combinations identified here could provide further insight into the etiology of different cancer subtypes and provide a rational basis for targeted combination therapy.

Dash, Sajal↗

DOE OSTI2026

An Adaptive Multiparameter Penalty Selection Method for Multiconstraint and Multiblock ADMM

This work presents a new method for online selection of multiple penalty parameters for the alternating direction method of multipliers (ADMM) algorithm applied to optimization problems with multiple constraints or functions with block matrix components. ADMM is widely used for solving constrained optimization problems in a variety of fields, including signal and image processing. Implementations of ADMM often utilize a single hyperparameter, referred to as the penalty parameter, which needs to be tuned to control the rate of convergence. However, in problems with multiple constraints, ADMM may demonstrate slow convergence regardless of penalty parameter selection due to scale differences between constraints. Accounting for scale differences between constraints to improve convergence in these cases requires introducing a penalty parameter for each constraint. The proposed method is able to adaptively account for differences in scale between constraints, providing robustness with respect to problem transformations and initial selection of penalty parameters. It is also simple to understand and implement. Our numerical experiments demonstrate that the proposed method performs favorably compared to a variety of existing penalty parameter selection methods.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Distributed Intrusion Detection System using Semantic-based Rules for SCADA in Smart Grid

Cyber-physical system (CPS) security for the smart grid enables secure communication for the SCADA and wide-area measurement system data. Power utilities world-wide use various SCADA protocols, namely DNP3, Modbus, and IEC 61850, for the data exchanges across substation field devices, remote terminal units (RTUs), and control center applications. Adversaries may exploit compromised SCADA protocols for the reconnaissance, data exfiltration, vulnerability assessment, and injection of stealthy cyberattacks to affect power system operation. In this paper, we propose an efficient algorithm to generate robust rule sets. We integrate the rule sets into an intrusion detection system (IDS), which continuously monitors the DNP3 data traffic at a substation network and detects intrusions and anomalies in real-time. To enable CPS-aware wide-area situational awareness, we integrated the methodology into an open-source distributed-IDS (D-IDS) framework. The D-IDS facilitates central monitoring of the detected anomalies from the geographically distributed substations and to the control center. The proposed algorithm provides an optimal solution to detect network intrusions and abnormal behavior. Different types of IDS rules based on packet payload, packet flow, and time threshold are generated. Further, IDS testing and evaluation is performed with a set of rules in different sequences. The detection time is measured for different IDS rules, and the results are plotted. All the experiments are conducted at Power Cyber Lab, Iowa State University, for multiple power grid models. After successful testing and evaluation, knowledge and implementation are transferred to field deployment.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2022

Inference for Nonparanormal Partial Correlation via Regularized Rank-Based Nodewise Regression

Abstract Partial correlation is a common tool in studying conditional dependence for Gaussian distributed data. However, partial correlation being zero may not be equivalent to conditional independence under non-Gaussian distributions. In this paper, we propose a statistical inference procedure for partial correlations under the high-dimensional nonparanormal (NPN) model where the observed data are normally distributed after certain monotone transformations. The NPN partial correlation is the partial correlation of the normal transformed data under the NPN model, which is a more general measure of conditional dependence. We estimate the NPN partial correlations by regularized nodewise regression based on the empirical ranks of the original data. A multiple testing procedure is proposed to identify the nonzero NPN partial correlations. The proposed method can be carried out by a simple coordinate descent algorithm for lasso optimization. It is easy-to-implement and computationally more efficient compared to the existing methods for estimating NPN graphical models. Theoretical results are developed to show the asymptotic normality of the proposed estimator and to justify the proposed multiple testing procedure. Numerical simulations and a case study on brain imaging data demonstrate the utility of the proposed procedure and evaluate its performance compared to the existing methods. Data used in preparation of this article were obtained from the Alzheimer's Disease Neuroimaging Initiative (ADNI) database.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Feed the fish: A review of aquaculture feeders and their strategic implementation

Automatic feeders are revolutionizing aquaculture by enabling precise and controlled feeding regimens that optimize growth, reduce feed waste, and enhance the overall efficiency of farming operations. Demand feeders provide some similar benefits but with feeding tailored to fish appetites and, in some cases, feed dispersal without electricity. This review explores the evolution, technological advancements, and applications of these feeders with a survey of recent research. It looks at common feeder designs and compares the pros and cons of five automatic feeder configurations in commercial use today. The article contrasts feeders and feed sizes for farmed species in different life stages and facilities, from hatcheries to ponds and offshore cages. It discusses the importance of species-tailored feeding strategies as well as impacts on fish behavior and health, nutrient delivery, and environmental sustainability. Incorporating sensors and on-site computing enables optimization in feeding algorithms that feeders then implement precisely and reliably. The review compiles results from multiple studies comparing growth rate, weight, and feed conversion ratio (FCR) outcomes from automatic feeders and demand feeders versus traditional hand-feeding regimens. The integration of feeders with real-time monitoring and data analytics is also discussed, highlighting future directions for research and adoption across the industry.

42 ENGINEERING↗

DOE OSTI2020

waveSZ: A Hardware-Algorithm Co-Design of Efficient Lossy Compression for Scientific Data

Error-bounded lossy compression is critical to the success of extreme-scale scientific research because of ever-increasing volumes of data produced by today's high-performance computing (HPC) applications. Not only can error-controlled lossy compressors significantly reduce the I/O and storage burden but they can retain high data fidelity for post analysis. Existing state-of-the-art lossy compressors, however, generally suffer from relatively low compression and decompression throughput (up to hundreds of megabytes per second on a single CPU core), which considerably restrict the adoption of lossy compression by many HPC applications especially those with a fairly high data production rate. In this paper, we propose a highly efficient lossy compression approach based on field programmable gate arrays (FPGAs) under the state-of-the-art lossy compression model SZ. Our contributions are fourfold. (1) We adopt a wavefront memory layout to alleviate the data dependency during the prediction for higher-dimensional predictors, such as the Lorenzo predictor. (2) We propose a co-design framework named WAVESZ based on the wavefront memory layout and the characteristics of SZ algorithm and carefully implement it by using high-level synthesis. (3) We propose a hardware-algorithm co-optimization method to improve the performance. (4) We evaluate our proposed WAVESZ on three real-world HPC simulation datasets from the Scientific Data Reduction Benchmarks and compare it with other state-of-the-art methods on both CPUs and FPGAs. Experiments show that our WAVESZ can improve SZ's compression throughput by 6.9x similar to 8.7x over the production version running on a state-of-the-art CPU and improve the compression ratio and throughput by 2.1x and 5.8x on average, respectively, respectively, compared with the state-of-the-art FPGA design.

Compression Ratio↗

DOE OSTI2024

RAP: Resource-aware Automated GPU Sharing for Multi-GPU Recommendation Model Training and Input Preprocessing

Ensuring high-quality recommendations for newly onboarded users requires the continuous retraining of Deep Learning Recommendation Models (DLRMs) with freshly generated data. To serve the online DLRM retraining, existing solutions use hundreds of CPU computing nodes designated for input preprocessing, causing significant power consumption that surpasses even the power usage of GPU trainers. To this end, we propose RAP, an end-to-end DLRM training framework that supports Resource-aware Automated GPU sharing for DLRM input Preprocessing and Training. The core idea of RAP is to accurately capture the remaining GPU computing resources during DLRM training for input preprocessing, achieving superior training efficiency without requiring additional resources. Specifically, RAP utilizes a co-running cost model to efficiently assess the costs of various input preprocessing operations, and it implements a resource-aware horizontal fusion technique that adaptively merges smaller kernels according to GPU availability, circumventing any interference with DLRM training. In addition, RAP leverages a heuristic searching algorithm that jointly optimizes both the input preprocessing graph mapping and the co-running schedule to maximize the end-to-end DLRM training throughput. The comprehensive evaluation shows that RAP achieves 78.3× speedup on average over CPU-based DLRM input preprocessing frameworks. In addition, the end-to-end training throughput of RAP is only 2.04% lower than the ideal case, which has no input preprocessing overhead.

Wang, Zheng↗

DOE OSTI2026

BLING

The Bounded Linearized Iteration for Natural Gas (BLING) algorithm solves an optimization problem for gas pipeline flow scheduling that maximizes economic surplus and minimizes the energy used for gas compression subject to pressure, flow, and engineering constraints.

Zlotnik, Anatoly↗

DOE OSTI2026

FAD-Toolset (Floating Array Design Toolset) [SWR-26-056]

The Floating Array Design (FAD) Toolset is a collection of tools for modeling and designing arrays of floating offshore structures. It was originally designed for floating wind systems but has applicability for many offshore applications. A core part of the FAD Toolset is the floating array model, which serves as a high-level library for efficiently modeling a floating array, such as a floating wind array. It combines site condition information and a description of the floating array design, and contains functions for evaluating the array's behavior considering the site conditions. For example, it combines information about site soil conditions, mooring line loads, and an array's anchor characteristics to estimate the holding capacity of each anchor. The library works in conjunction with the tools RAFT, MoorPy, and FLORIS to model floating platforms, wind turbines, mooring systems, power cables, and array wakes respectively. Layered on top of the floating array model is a set of design tools that can be used for algorithmically adjusting or optimizing parts of the a floating array. Specific tools existing for mooring lines, shared mooring systems, dynamic power cables, static power cable routing, and overall array layout. These capabilities work with the design representation and evaluation functions in the floating array model, and they can be applied by users in various combinations to suit different purposes. In addition to standalone uses of the FAD Toolset, a coupling has been made with Ard, (https://github.com/NLRWindSystems/Ard) a sophisticated and flexible wind farm optimization tool. This coupling allows Ard to use certain mooring system capabilities from FAD to perform layout optimization of floating wind farms with Ard's more advanced layout optimization capabilities. The FAD Toolset works with the IEA Wind Task 49 Ontology (https://github.com/IEAWindTask49/Ontology), which provides a standardized format for describing floating wind farm sites and designs. See example use cases in our examples folder (https://github.com/NLRWindSystems/FAD-Toolset/blob/main/examples/README.md) For working with the library, it is important to understand the floating array model structure, which is described more here: https://github.com/NLRWindSystems/FAD-Toolset/blob/main/fad/README.md.

Sirkis, Leah [National Laboratory of the Rockies (↗

DOE OSTI2025

Effect of Time Window and Spectral Measurement Options on Empirical Green’s Function Analysis Using DAS Array and Seismic Stations

The recorded seismic waveform is a convolution of event source term, path term, and station term. Removing high-frequency attenuation due to path effect is a challenging problem. Empirical Green’s function (EGF) method uses nearly collocated small earthquakes to correct the path and station terms for larger events recorded at the same station. However, this method is subject to variability due to many factors. Here, we focus on three events that were well recorded by the seismic network and a rapid response distributed acoustic sensing (DAS) array. Using a suite of high-quality EGF events, we assess the influence of time window, spectral measurement options, and types of data on the spectral ratio and relative source time function (RSTF) results. Increased number of tapers (from 2 to 16) tends to increase the measured corner frequency and reduce the source complexity. Extended long time window (e.g., 30 s) tends to produce larger variability of corner frequency. The multitaper algorithm that simultaneously optimizes both target and EGF spectra produces the most stable corner-frequency measurements. The stacked spectral ratio and RSTF from the DAS array are more stable than two nearby seismic stations, and are comparable to stacked results from the seismic network, suggesting that DAS array has strong potential in source characterization.

58 GEOSCIENCES↗

DOE OSTI2025

Twinac: initiation of a community-driven accelerator digital twin framework

We present the initiation of a community-driven framework for the integration of accelerator digital twins into control systems: Twinac. Few facilities have fully integrated accelerator digital twins like at Cornell’s CHESS. Many facilities have active research to employ surrogate models to aid in operational decisions like at Argonne’s ALS, MSU’s FRIB, SLAC’s LCLS-II, and Fermilab’s FAST/IOTA, PIP-II, and main complex. To lower the barrier to entry for all accelerator facilities to build and benefit from a digital twin of their own accelerators, we propose the following software framework. Twinac will provide the capability to compose one’s own digital twin using reusable components engineered at other facilities. With this model in place, Twinac will also support tools for (1) predictive maintenance systems; (2) discovery of correlated but uncontrolled environmental factors, like seasonal temperature variations causing performance changes on power supplies, magnets, etc.; and (3) prototyping and updating sophisticated optimization and controls algorithms. The Twinac framework will enable sharing and simplified deployment of modeled components and control algorithms at all facilities. With an inter-facility team to build and support the Twinac framework, it will be easy to publish and try out the latest advancements at one’s own facility.

Miceli, Tia [Fermilab]↗

DOE OSTI2021

(U) Validation and Optimization of a 1-Dimensional Quasi-Isentropic Compression Model Using a Functionally Graded Material Flyer Plate

The fields studying highly compressed materials have been around for many years. These fields have given birth to better understandings of the solar fusion cycle and the liquid-metallic core of Jupiter. The highest pressures achieved have been at the National Ignition Facility (NIF) and more recently, the Z-Machine. One method to achieve higher levels of compression is to use quasi-isentropic (QI) compression. In practice, this means minimizing the amount of temperature increase of the target material. In their paper, J.H. Nguyen et. al. manufactured a functionally graded material (FGM) in order to help them achieve QI compression. The aim of the study described in this paper is to validate a 1-dimensional (1D) FLAG model that uses an FGM flyer to compress a copper (Cu) target. Once validated, the density/composition profile of the FGM is varied and optimized using Markov Chain Monte Carlo, specifically using a Metropolis-Hastings algorithm to find the optimal FGM profile that minimizes the temperature increase in the copper.

36 MATERIALS SCIENCE↗

DOE OSTI2024

Leveraging Existing Assets for Long Duration Energy Storage

Increased renewables penetration to electrical grid is necessary to reduce overall emissions from the electrical power generation sector. Nonetheless, its integration creates challenges to grid operators who must match the power being generated by intermittent renewables and other traditional energy sources with the demand from consumers, while ensuring the reliability and power quality for the entire system. Energy storage has been proposed as an alternative to natural gas peaking plants and a form to deliver excess renewable energy generation at times of peak demand. For energy storage to provide benefits to end customers (energy consumers), it must be reliable, efficient, and cost effective. The Illinois Sustainable Technology Center (ISTC), one of the surveys that integrate the Prairie Research Institute (PRI), aims to develop a Center for Energy Storage at Existing Assets (CESEA) at UIUC with the participation of Waste Pressure Corp and Ecotek Engineering USA LLC. CESEA will focus on LDES systems that can integrate to existing infrastructure in a manner that reduces the initial capital expenditure and demonstrates the ability to repurpose fossil assets that would otherwise become stranded, to serve the energy transition. CESEA aims to leverage UIUC’s unique facilities to validate LDES systems performance at a relevant operating environment. UIUC’s facilities include a 85-MW combined heat and power (CHP) power plant, two (2) solar PV plants totaling over 18 MWdc of installed capacity, an electrical grid along with a substation at transmission and distribution voltages, a 22-mile gas pipeline network operating at two pressure levels, along with steam and chilled water distribution networks. The new LDES systems will connect to the existing UIUC grid through a new test electrical station, which will have the capacity to accommodate additional connections to test new devices and technologies as part of future CESEA R&D activities. The test electrical station will contain meters, instrumentation, and controls to accurately capture data and allow optimization of control algorithms. CESEA will initially focus on technologies that: i) utilize existing equipment or facilities to perform at least one of the process steps in LDES (charging, storage, or discharging), ii) leverage mature or commercially available components or controls, iii) show potential for cost-leadership in 10+ hour storage at a commercial scale. Initial technologies that were identified to meet these criteria include Compressed Gas Energy Storage (CGES), and TES. CGES stores electricity by raising the pressure of a compressible gas inside a control volume and converting the stored energy to electricity via expansion-generation. CGES is a generalization of CAES that covers any working gas (not just air). A successful CGES demo will help to circumvent many challenges faced by CAES (long development times due to site prospecting, high cost of compression and storage, heat recovery management, etc.) by: 1) utilizing existing infrastructure (compressors, pipelines, underground storage or pressure vessels) used in the transportation and storage of industrial gases for LDES charging and storage; 2) deploying over sites already-developed for industrial applications with minor additional work; 3) leveraging the price structure of commercial industrial gas to cover the costs of electricity used during charging. A previous DOE-sponsored conceptual study (DE-FE-0032018) estimated the levelized cost of energy of a 1.1 MW / 17 MWh CGES system at $0.08/kWh, with a commercial 10x scale system cost estimated at <$0.04/kWh (Giardinella, 2022). The pilot-sized system was estimated to avoid up to 2693 tons of CO2/year.

25 ENERGY STORAGE↗