Engineering Papers⌕ Search

SEARCH · Engineering Papers

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

At least 739 records · Page 41

Direction-optimizing Label Propagation and its Application for Community Detection

Label Propagation is a machine learning algorithm typically used for classification. It has also been found to be an effective method for detecting communities in networks. It has two attractive features as a community detection method: it has nearly linear runtime and it requires no \textit{a priori} community information. We propose a new Direction Optimizing Label Propagation Algorithm (DOLPA) that relies on the use of {\em frontiers} and alternates between label {\em push} and label {\em pull} operations to enhance the performance of LPA. Specifically, DOLPA has parameters for tuning the processing order of vertices in a graph. This reduces the number of edges visited and improves the quality of solution. We apply DOLPA to community detection and present the design and implementation of the algorithm as well as its shared-memory parallelization using OpenMP. Empirically, we evaluate our algorithm using synthetic graphs as well as real-world networks. Compared with the state-of-art \textit{Parallel Label Propagation} algorithm, we achieve at least two times the F-Score while reducing the runtime by 50\% for synthetic graphs with overlapping communities. We also compare DOLPA against the state-of-art parallel implementation of the Louvain method using the same graphs and show that DOLPA achieves about three times the F-Score at 10\% the runtime. On real-world graphs, we get a speedup of up to $10\times$ using 64 threads.

Liu, X↗

Situational Awareness of Grid Anomalies (SAGA)

The modern power industry becomes more vulnerable to cyber events due to the growing interconnectivity, interdependence, and complexity of the electric power grid. High-fidelity modeling and simulation tools that support the preventative risk analysis on potential cyber-relevant events is essential for ensuring the situational awareness of the system operator as it provides an inexpensive and risk-free environment to test the system responses under various cyber-relevant events and hereby can support research on cyber anomaly detection, optimal protective resource allocation, and mitigation measures. In this webinar, we will share NREL's cybersecurity research capabilities by highlighting the development of a scalable cyber-physical event test bed and demonstration with real hardware in the loop. The developed cyber-physical event test bed is backboned by an integrated transmission, distribution, and communication dynamic co-simulation framework and a plug-and-play cyber event generation module. It is designed to be modular and compatible with parallel computing, and thereby supports large-scale system simulations at an affordable computation cost. The test bed can capture millisecond-to-minutes dynamic frequency and voltage responses under cyber events from the bulk transmission system to the active distribution systems and distributed energy resources at the grid edge.

co-simulation↗

Initial position optimization in molecular dynamics simulations for a Coulomb system

A new algorithm for molecular dynamics (MD) simulations is developed to optimize plasma particle distributions at given initial temperatures. By combining velocity scaling and reassignment, the method effectively eliminates the initial rise and oscillation in temperatures observed with randomly distributed positions. These rises and oscillations are undesired numerical artifacts observed in conventional plasma MD simulations, arising from unoptimized particle positions. The algorithm demonstrates temperature relaxation without initial rises or oscillations, as well as precise flow velocity relaxation, enabling accurate measurement of relaxation times. The code is accelerated using graphics processing units for parallel processing, enhancing the study of plasma dynamics. The proposed method for distributing physically valid particles in MD simulations enables accurate studies of intrinsic collision processes in plasmas, including the dynamics of strongly coupled plasmas, plasma–wave interactions, and transport phenomena in magnetized plasmas. The paper concludes with a discussion of potential applications and future enhancements to the algorithm.

Jo, Jawon (ORCID:0009000924193285)↗

Pufferscale: Rescaling HPC Data Services for High Energy Physics Applications

User-space HPC data services are emerging as an appealing alternative to traditional parallel file systems, because of their ability to be tailored to application needs while eliminating unnecessary overheads incurred by POSIX compliance. The High Energy Physics (HEP) community is progressively turning towards such services to enable high-throughput accesses under heavy concurrency to billions of event data produced by instruments and consumed by subsequent analysis workflows. Such services would benefit from the possibility to be rescaled up and down to adapt to changing workloads, as experimental campaigns progress, in order to optimize resource usage. This paper formalizes rescaling a distributed storage system as a multi objective optimization problem considering three criteria: load balance, data balance, and duration of the rescaling operation. We propose a heuristic for rapidly finding a good approximate solution, while allowing users to weight the criteria as needed. The heuristic is evaluated with Pufferscale, a new rescaling manager for microservice-based distributed storage systems. To validate our approach in a real-world ecosystem, we showcase the use of Pufferscale as a means to enable storage malleability in the HEPnOS storage system for HEP applications.

Distributed Storage System↗

PREEMPT: Scalable Epidemic Interventions Using Submodular Optimization on Multi-GPU Systems

Preventing and slowing the spread of epidemics is achieved through techniques such as vaccination and social distancing. Given practical limitations on the number of vaccines and cost of administration, optimization becomes a necessity. Previous approaches using mathematical programming methods have shown to be effective but are limited by computational costs. In this work, we make several contributions: First, we present a new approach for intervention via maximizing the influence of vaccinated nodes on the network. We call this method \preempt. Next, we prove submodular properties associated with the objective function of our method so that it aids in construction of an efficient greedy approximation strategy. Consequently, we present a new parallel algorithm based on greedy hill climbing for \preempt, and present an efficient parallel implementation for distributed CPU-GPU heterogeneous platforms. Our results demonstrate that \preempt{} is able to achieve a significant reduction (up to 6.75$\times$) in the percentage of people infected on a city-scale network. We also show strong scaling results of \preempt{} on 128 nodes of the Summit supercomputer. Our parallel implementation is able to significantly reduce time to solution, from hours to minutes on large networks. This work represents a first-of-its-kind effort in parallelizing greedy hill climbing and applying it toward devising effective interventions for epidemics.

Minutoli, Marco↗

A Modeling Tool to Analyze the Performance of Industrial Cooling Towers

Energy efficiency and energy savings have become an important factor as industries look for ways to save energy and minimize their energy consumption while reducing their carbon footprint. Cooling towers are utilized significantly in industries for either serving chillers or process cooling. Depending on the size of the cooling tower, it can use a surprising amount of energy and water, which is why it is crucial to make sure that the facility has optimized their cooling tower.A modeling tool has been developed to perform a thorough analysis of a cooling tower and its various operations to ensure that the facility has optimized its cooling tower. This model analyzes an annual base case in comparison with the revised case of a cooling tower operation. This modeling tool simulates 8,760 hourly calculations for fan power for various fan controls, water consumption, and pumping energy consumption and demand based on the user’s location and its corresponding Typical Meteorological Year 3 (TMY3) weather data. This model is capable to simulate up to five cooling tower cells as one large tower utilizing one pump or parallel pumping. The successful validated cooling tower model should assist industry to save energy at their facility through their cooling tower, whether they use it for process cooling or heating, ventilation and air conditioning (HVAC) applications. The entering/leaving water temperatures based on a monthly operating schedule or a wet-bulb temperature schedule will be used as inputs, and the model can calculate savings in energy for various conditions including variable-frequency drive (VFD) on the fan/pump, drift eliminators, number of cycles of concentration, reduced water flow rate, etc.

Hooper, Josh↗

Enhanced accuracy through ensembling of randomly initialized auto-regressive models for dynamical systems

Computational mechanics simulations using traditional finite element methods (FEM) require prohibitively expensive computational resources for real-time engineering applications, design optimization, and digital twin implementations. While machine learning (ML) surrogate models offer significant computational speedups, autoregressive ML models for time-dependent mechanical systems suffer from error accumulation that compromises long-term prediction reliability - a critical concern for engineering applications where accuracy over extended time horizons is essential for safety and performance assessments. Here, we propose a deep ensemble framework specifically designed to address this challenge in computational mechanics applications, where multiple ML surrogate models with random weight initializations are trained in parallel and their predictions aggregated during inference. This approach leverages statistical diversity to maximize information gain from a fixed set of training data and to mitigate error propagation, while maintaining the computational efficiency that makes ML surrogates attractive for engineering practice. We validate the framework on three representative problems spanning critical areas of computational mechanics: stress field evolution in heterogeneous microstructures under complex loading (relevant to advanced materials design and composite analysis), planetary-scale shallow water dynamics (applicable to environmental and geotechnical engineering), and Gray-Scott reaction-diffusion systems (relevant to mass transport and chemical process engineering). Across all test cases, the ensemble approach demonstrates consistent error reduction of 15-33% compared to individual models. The codes for this work are available on GitHub (https://github.com/Graham-Brady-Research-Group/AutoregressiveEnsemble_SpatioTemporal_Evolution).

autoregressive prediction↗

Hydropower Value Drivers

Conventional hydro resources generate the majority of their value by providing energy under most conditions, but the relative fraction of value generated by providing ancillary services and capacity increases with increasing penetration of resources with zero fuel costs. Pumped storage hydropower resources generate the majority of their value by providing capacity under most conditions, but the relative fraction of value generated by providing energy increases with increasing penetration of resources with zero fuel costs. The total value of conventional hydropower generally decreases in systems with increasing penetration of resources with zero fuel costs; this is largely due to the associated decrease in average energy prices. The total value of pumped storage generally increases in systems with increasing penetration of resources with zero fuel costs, largely due to opportunities to operate in pumping mode when energy prices are low or even negative. Energy storage representation must be enhanced to ensure that models accurately capture system value streams for these resources. Current power system models have a limited ability to capture the price dynamics of ancillary services, and it is still challenging to assess the role and magnitude of ancillary service value streams in future systems. Power systems are currently in a state of rapid and dramatic evolution due to a number of different factors, including the increasing penetration of variable renewable energy (VRE) sources, such as wind and solar, and battery energy storage systems (BESS). This evolution will change the way power systems are fundamentally planned and operated. Some of these changes may be incremental, while others may be more significant, but the result will likely be parallel evolution in the definition and requirement of different grid services and therefore a subsequent shift in their relative values. This report presents a framework developed to identify such system value drivers and quantify their relative impact on several different value streams, with a specific focus on implications for conventional hydropower and pumped storage hydropower (PSH) resources. This value drivers framework (VDF) encompasses five core analytical steps: 1. Identify potential drivers and develop scenarios, 2. Execute production cost models, 3. Calibrate prices, 4. Optimize hydropower operations, and 5. Quantify value drivers.

13 HYDRO ENERGY↗

Cryogenic light detectors with thermal signal amplification for 0 νββ search experiments

As a step towards the realization of cryogenic-detector experiments to search for neutrinoless double-beta decay (such as CROSS, BINGO, and CUPID), we investigated a batch of 10 Ge light detectors (LDs) assisted by Neganov-Trofimov-Luke (NTL) signal amplification. Each LD was assembled with a large cubic light-emitting crystal (45 mm side) using the recently developed CROSS mechanical structure. The detector array was operated at milli-Kelvin temperatures in a pulse-tube cryostat at the Canfranc underground laboratory in Spain. We achieved good performance with scintillating bolometers from CROSS, made of Li 2 100 MoO 4 crystals and used as reference detectors of the setup, and with all LDs tested (except for a single device that encountered an electronics issue). No leakage current was observed for 8 LDs with an electrode bias up to 100 V. Operating the LDs at an 80 V electrode bias applied in parallel, we obtained a gain of around 9 in the signal-to-noise ratio of these devices, allowing us to achieve a baseline noise RMS of O(10 eV). Thanks to the strong current polarization of the temperature sensors, the time response of the devices was reduced to around half a millisecond in rise time. The achieved performance of the LDs was extrapolated via simulations of pile-up rejection capability for several configurations of the CUPID detector structure. Despite the sub-optimal noise conditions of the LDs (particularly at high frequencies), we demonstrated that the NTL technology provides a viable solution for background reduction in CUPID.

47 OTHER INSTRUMENTATION↗

Efficient First-Order Algorithms for Large-Scale, Non-Smooth Maximum Entropy Models with Application to Wildfire Science

Maximum entropy (MaxEnt) models are a class of statistical models that use the maximum entropy principle to estimate probability distributions from data. Due to the size of modern data sets, MaxEnt models need efficient optimization algorithms to scale well for big data applications. State-of-the-art algorithms for MaxEnt models, however, were not originally designed to handle big data sets; these algorithms either rely on technical devices that may yield unreliable numerical results, scale poorly, or require smoothness assumptions that many practical MaxEnt models lack. In this paper, we present novel optimization algorithms that overcome the shortcomings of state-of-the-art algorithms for training large-scale, non-smooth MaxEnt models. Our proposed first-order algorithms leverage the Kullback–Leibler divergence to train large-scale and non-smooth MaxEnt models efficiently. For MaxEnt models with discrete probability distribution of n elements built from samples, each containing m features, the stepsize parameter estimation and iterations in our algorithms scale on the order of O(mn) operations and can be trivially parallelized. Moreover, the strong ℓ1 convexity of the Kullback–Leibler divergence allows for larger stepsize parameters, thereby speeding up the convergence rate of our algorithms. To illustrate the efficiency of our novel algorithms, we consider the problem of estimating probabilities of fire occurrences as a function of ecological features in the Western US MTBS-Interagency wildfire data set. Our numerical results show that our algorithms outperform the state of the art by one order of magnitude and yield results that agree with physical models of wildfire occurrence and previous statistical analyses of wildfire drivers.

Physics↗

DESIGN & DEVELOPMENT OF A SECURE SELF-LEVELING WIRELESS RECHARGING PLATFORM FOR AN AERIAL DRONE ON AN UNMANNED SURFACE VESSEL

The Design and Development of an automated recharging station for an aerial drone, onboard a small, unmanned surface vessel, is described. Drones require a landing surface that is level within five degrees of the surrounding terrain for repeated reliable landing and takeoff. System constraints and at-sea application necessitate a compact, lightweight, and secure solution. A passive self-leveling platform and an accompanying automated parallel-pusher drone restraint mechanism have been designed and fabricated to aid in achieving a level landing surface and holding the drone in place while it charges. The self-leveling mechanism has been analyzed and subjected to initial laboratory tests. The testing of the drone restraint mechanism to verify its weight capacity and closing time, and the integration of the platform with a custom conductive contact wireless charging pad are identified as future work. The resulting cohesive unit will be tested for performance optimization and implementation onboard the unmanned surface vehicle.

McKinney, Adriana↗

Herbicide, fertilization, and planting density effects on intensively managed loblolly pine early stand development

Production forestry in the southeast US has been partially transitioned to intensively managed short rotations (~10 years), in which multiple silvicultural interventions are performed during forest development. Understanding the responses to silvicultural practices and continued refinement of site-specific recommendations is critical to sustainably maximize forest production. We evaluated the effects of silvicultural practices (herbicide, fertilization, and planting density) on growth, stand homogeneity, and above- and belowground biomass accumulation and partitioning of loblolly pine (Pinus taeda) throughout early stand development (age 5 years) in the southeastern US. Five treatments with eight replications each were tested: no herbicide and no fertilization (C); herbicide only (H); herbicide and half-reduced fertilization rate (R); herbicide and full fertilization (F); and increased stand density (60+ %; 1346 vs. 2152 trees per hectare) with herbicide and full fertilization rate (D). Allometric equations generated from destructive harvests were applied to annual diameter measurements to estimate plot-level biomass and allocation. Herbicide was crucial to promote stand uniformity and increase yield (~600+ % stem biomass compared with C at age 5). Aboveground biomass was similar in R and F treatments, which was ~25% higher than in H at age 5. Increasing planting density along with multiple herbicide and fertilizer applications yielded higher biomass without compromising individual tree size (diameter and height). There was little effect of silviculture practices on allocation patterns. Our results parallel what was found for fertilization with herbicide from a number of loblolly stands under similar conditions and indicate a ~28% volume gain with fertilization during early stand development. Similarly, our results were consistent with other studies implementing similar differences in planting density and suggest a ~26% volume gain through early stand development with an initial 60% increase in planting density. Furthermore, our study helps to understand complex relationships between production and silvicultural practices during early stand development and demonstrates that silvicultural prescriptions can be optimized to increase sustainability of production forestry

59 BASIC BIOLOGICAL SCIENCES↗

Self-potential tomography preconditioned by particle swarm optimization—Self-potential monitoring and streamflow data acquired March 26–September 14, 2023 at East Fork Poplar Creek near Oak Ridge Tennessee

This data release contains self-potential (SP) monitoring data measured on the flood plain of East Fork Poplar Creek (East Fork) in Oak Ridge, Tennessee and streamflow data measured at streamgage EFK5.4 about 310 meters upstream from the SP monitoring site. Additionally, forward and inverse numerical modeling scripts used to model the electrical-potential field on the East Fork flood plain are provided. SP monitoring data included in this data release were measured at 39 different data-collection points on the east flood plain; 30 points were spaced 3-m apart along an 87-m profile parallel to the edge of the streambank, and 9 points were spaced 5-m apart along a 40-m profile approximately perpendicular to the streambank. The two profiles of SP data-collection points intersected at the approximate midpoint of the profile parallel to the streambank. Transient voltages were measured at each data-collection point every 60 seconds between 16:13 Eastern Standard Time (EST) on March 26, 2023, and 11:41 EST on September 14, 2023. Streamflow data included in this data release overlap the time-period of self-potential monitoring and were measured every 900 seconds between 16:23 on March 26, 2023, and 23:53 on September 14, 2023.

54 ENVIRONMENTAL SCIENCES↗

Direction-optimizing Label Propagation Framework for Structure Detection in Graphs: Design, Implementation, and Experimental Analysis

Label Propagation is not only a well-known machine learning algorithm for classification but also an effective method for discovering communities and connected components in networks. We propose a new Direction-optimizing Label Propagation Algorithm (DOLPA) framework that enhances the performance of the standard Label Propagation Algorithm (LPA), increases its scalability, and extends its versatility and application scope. As a central feature, the DOLPA framework relies on the use of frontiers and alternates between label push and label pull operations to attain high performance. It is formulated in such a way that the same basic algorithm can be used for finding communities or connected components in graphs by only changing the objective function used. Additionally, DOLPA has parameters for tuning the processing order of vertices in a graph to reduce the number of edges visited and improve the quality of solution obtained. We present the design and implementation of the enhanced algorithm as well as our shared-memory parallelization of it using OpenMP. We also present an extensive experimental evaluation of our implementations using the LFR benchmark and real-world networks drawn from various domains. Compared with an implementation of LPA for community detection available in a widely used network analysis software, we achieve at most five times the F-Score while maintaining similar runtime for graphs with overlapping communities. We also compare DOLPA against an implementation of the Louvain method for community detection using the same LFR-graphs and show that DOLPA achieves about three times the F-Score at just 10% of the runtime. For connected component decomposition, our algorithm achieves orders of magnitude speedups over the basic LP-based algorithm on large-diameter graphs, up to 13.2× speedup over the Shiloach-Vishkin algorithm, and up to 1.6× speedup over Afforest on an Intel Xeon processor using 40 threads.

97 MATHEMATICS AND COMPUTING↗

Jacobian-free Newton–Krylov method for the simulation of non-thermal plasma discharges with high-order time integration and physics-based preconditioning

A preconditioning framework for the numerical simulation of non-thermal streamer discharges is developed using the Jacobian-free Newton-Krylov (JFNK) method. A reduced plasma fluid model is considered, consisting of electrons, one positive ion, one negative ion, and the electrostatic potential. Here, the plasma kinetics model includes ionization, electron-ion recombination, electron attachment, electron detachment, and ion-ion recombination. The governing equations are made dimensionless, discretized in space with finite differences, and integrated in time with a fully implicit method based on high-order backward differentiation formulas. The preconditioning framework is based on a linearized form of the governing equations and physics-based operator splitting. The efficiency of the preconditioning strategy is assessed through two test cases: streamer propagation between parallel plates and an axisymmetric pin-to-pin discharge. The fully implicit approach overcomes traditional restrictions in the time step size due to processes such as electron drift, electron diffusion, and dielectric relaxation. Excellent performance is observed through relevant statistics of the JFNK solver, although the number of linear iterations increases for the pin-to-pin discharge when nonlinear numerical boundary conditions are imposed at the electrodes. Performance studies show scalability with O(100-1000) processors for O(10M) unknowns with ample room for optimization.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

One Beam, Dual Insights: Simultaneous Chemical and Structural Changes in Nanopatterned Ceria under Reaction Conditions

Ceria’s interaction with hydrogen can proceed through multiple chemical forms (hydride, hydroxyl, and oxyhydroxide-like), with consequences for the oxidation state, density, and morphology that are rarely tracked in the same evolving state. Here, in this work, we show that under mild H 2 (and H 2 and CO 2 ) environments nanopatterned ceria undergoes oxidation-state changes accompanied by hydrogen incorporation that increases the effective electron density, establishing the following order: CeO 2 Hy > CeO 2 > CeO 2–x Hy > CeO 2–x . In parallel, the surface roughens in a chemically specific manner, with the largest changes coinciding with conditions where incorporated hydrogen is driven to react with oxygen supplied either by air exposure between experiments or by added CO 2 . We obtained these insights by using a single X-ray beam to simultaneously perform ambient-pressure X-ray photoelectron spectroscopy and grazing-incidence X-ray scattering on the same sample spot. Single-mode measurements can miss key ceria–H 2 transformations relevant to optimizing ceria-based hydrogenation catalysts and supports.

anions↗

A High-Current Pulsed Prototype Power Supply

The Accelerator Controls Operations Research Network (ACORN) project aims to modernize the accelerator control system and replace aging power supplies at Fermilab. As part of this effort, outdated RF ferrite bias power supplies will be redesigned. These power supplies are essential for tuning the resonant frequency of RF cavities by delivering programmable current outputs of up to 2500 A and voltages ranging from −10 V to +35 V. They operate at a repetition rate of 15 Hz in the Booster ring, and 1 Hz at the Main Injector ring. The power supplies utilize a bank of transistors in the linear region, connected in parallel with the load, to actively regulate the output current from a 12-pulse SCR bridge. To support this upgrade, a new bias power supply topology was developed as proof of concept. The design utilizes an IGBT Hbridge operating in Pulse Width Modulation (PWM) mode, controlled by a microcontroller. A prototype, constructed using spare components, successfully delivered an output current of 500 A at a repetition rate of 15 Hz during initial testing. The circuit's bandwidth was measured at 480 Hz, highlighting opportunities for further optimization in the controller design to achieve the target bandwidth of 2 kHz.

Bullman, Austin [ORNL]↗

ARPA-E Grid Optimization (GO) Competition Challenge 1

The ARPA-E Grid Optimization (GO) Competition Challenge 1, from 2018 to 2019, focused on the basic Security Constrained AC Optimal Power Flow problem (SCOPF) for a single time period. The Challenge utilized sets of unique datasets generated by the ARPA-E GRID DATA program. Each dataset consisted of a collection of power system network models of different sizes with associated operating scenarios (snapshots in time defining instantaneous power demand, renewable generation, generator and line availability, etc.). The datasets were of two types: Real-Time, which included starting-point information, and Online, which did not. Week-Ahead data is also provided for some cases but was not used in the Competition. Although most datasets were synthetic and generated by GRIDDATA, a few came from industry and were only used in the Final Event. All synthetic Input Data and Team Results for the GO Competition Challenge 1 for the Sandbox, Trial Events 1 to 3, and the Final Event along with problem, format, scoring and rules descriptions are available here. Data for industry scenarios will not be made public. Challenge 1, a minimization problem, required two computational steps. Solver 1 or Code 1 solved the base SCOPF problem under a strict wall clock time limit, as would be the case in industry, and reported the base case operating point as output, which was used to compute the Objective Function value that was used as the scenario score. The feasibility of the solution was provided by the Solver 2 or Code 2, which solves the power flow problem for all contingencies based on the results from Solver 1. This is not normally done in industry, so the time limits were relaxed. In fact, there were no time limits for Trial Event 1. This proved to be a mistake, with some codes running for more than 90 hours, and a time limit of 2 seconds per contingency was imposed for all other events. Entrants were free to use their own Solver 2 or use an open-source version provided by the Competition. Containers, such as Docker, were considered to improve the portability of codes, but none that could reliably support a multi-node parallel computing environment, e.g., MPI, could be found. For more information on the competition and challenge see the "GO Competition Challenge 1 Information" and "GO Competition Challenge 1 Additional Information" resources below.

ACOPF↗