Engineering Papers⌕ Search

SEARCH · Engineering Papers

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

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

At least 73 records · Page 4

Complexity Reduction Methods for Large-Scale Spatially Explicit Biofuels Network Design

The size and complexity of energy system optimization models have increased significantly in recent years, driven by the availability of high-resolution spatial data. We present complexity reduction and solution methods that enable us to efficiently represent high-resolution spatial data in the network design of large-scale energy systems. We aim to reduce the size and enhance the computational efficiency of network design models without sacrificing solution accuracy. Specifically, we first present how to aggregate highly granular data into larger resolutions without averaging out their specific properties through a composite-curve-based approach and then develop a method to linearly represent these curves. Second, we utilize a general clustering method to determine groups of geographically proximate biomass fields and establish a single transportation arc for all of them, reducing the number of transportation-related variables while maintaining an accurate representation of the system. Finally, we introduce a two-step algorithm that decomposes large-scale network design problems into two smaller, more manageable subproblems. We demonstrate the application of our methods using a case study of switchgrass-to-biofuels network design in the eight states of the U.S. Midwest, using realistic and highly explicit spatial data.

09 BIOMASS FUELS↗

Cylinders and jets in crossflow: Wake formations as a result of varying geometric proximities

The combined flow physics of several canonical flow configurations is experimentally studied. Here, we analyze an array of jets issuing into a crossflow, then immediately navigating past an array of cylinders. This is achieved with a 2 × 3 triangular pattern of jets and symmetric cylinders at three jets to crossflow velocity ratios, enabling near-complete optical access of each jet, with velocities measured by time-resolved particle image velocimetry. Jet trajectories reveal that each configuration adheres to a power-law trend and that greater penetration is achieved by the downstream and confined jets compared to the more conventional upstream one. Recirculation regions of the upstream and downstream jets are nearly independent, with the confined jet encompassing regions of overlap with both. Turbulent statistics reveal the influence of geometric placement and velocity ratio on the time-averaged velocity, anisotropy, and Reynolds stresses incurred by each jet. Galilean decomposition utilizes a supplemental crossflow-only velocity field to delineate the influence of each jet's low- and high-pressure regions on the otherwise uniform stream. Proper orthogonal decomposition suggests that increased jet penetration decreases the number of modes required for truncation in the investigated spanwise plane. Vortex identification algorithms are applied to the reconstructed flow fields, reaffirming that with increasing velocity ratio, the jets generate vortices of their own in similar statistical formations as the cylinders. This investigation provides a foundation to aid future modeling efforts toward characterizing flow physics of importance in designing and passively controlling transverse jets with varying blockage proximities in a crossflow.

Kristo, Paul J. (ORCID:0000000225605175)↗

Distributed Optimization Approaches with Discrete Variables in the Power Distribution Systems

Traditionally, centralized approaches have predominantly been used for the power system operation and control. With increasing penetration of small-scale distributed energy resources (DERs) in the distribution network, especially independently owned renewable resources, distributed algorithms can serve as a potential alternative for improving scalability, resiliency and addressing privacy concerns. However, the complexity of distributed algorithms significantly increases with the integration of the legacy devices, the operation of which depend on discrete control variables. This paper aims to provide a review of the distributed optimization algorithms incorporating discrete control variables for the power distribution system. While the research in this domain is still at its nascence, an extensive comparison of the approaches in the literature for applying quadratic penalty, branch and bound,ordinal optimization and proximal operator to handle discrete variables in the framework of ADMM and dual decomposition have been addressed. Future research direction in this field have been also provided.

Adan, Jannatul↗

A high-order Shifted Interface Method for Lagrangian shock hydrodynamics

Here, we present a new method for two-material Lagrangian hydrodynamics, which combines the Shifted Interface Method (SIM) with a high-order Finite Element Method. Our approach relies on an exact (or sharp) material interface representation, that is, it uses the precise location of the material interface. The interface is represented by the zero level-set of a continuous high-order finite element function that moves with the material velocity. This strategy allows to evolve curved material interfaces inside curved elements. By reformulating the original interface problem over a surrogate (approximate) interface, located in proximity of the true interface, the SIM avoids cut cells and the associated problematic issues regarding implementation, numerical stability, and matrix conditioning. Accuracy is maintained by modifying the original interface conditions using Taylor expansions. We demonstrate the performance of the proposed algorithms on established numerical benchmarks in one, two and three dimensions.

97 MATHEMATICS AND COMPUTING↗

Database development and exploration of process–microstructure relationships using variational autoencoders

The paper demonstrates graphical representation of a large database containing process–microstructure relationships using an unsupervised machine learning algorithm. Correlating microstructural features to processing is an essential first step to answer the difficult problem of process sequence design. Here, a large database of 346,200 orientation distribution functions resulting from a variety of process sequences is constructed, where each sequence comprises up to four stages of tension, compression and rolling along different directions in various permutations. This open-source database is constructed for collaborative development of process design algorithms. The paper demonstrates a novel application of the large database: graphical representation of texture–process relationships. A variational autoencoder is used to reduce the entire database to a two dimensional latent space where variations in processes and properties can be visualized. Using proximity analysis in this latent space, we can quickly unearth multiple process solutions to the problem of texture or property design.

36 MATERIALS SCIENCE↗

Analysis of Waste Material Feedstocks Using Laser-Induced Breakdown Spectroscopy and Machine Learning

Predicting properties such as heating value, ash fusion temperature, and mineral ash composition from Laser-Induced Breakdown Spectroscopy (LIBS) data can make gasifiers more flexible to different feedstocks. Understanding these feedstock properties in-situ improves feedstock conversion modelling methods that allow for consistent operation, higher carbon conversion, and reduced fouling and erosion rates. The purpose of this study is to demonstrate methods for model creation that take LIBS data as predictor features and estimate higher order material properties as a function of feedstock material properties. Six samples were chosen to represent a mixture of abundant and carbon rich waste materials. LIBS measurements were performed on these samples for elemental wavelengths and intensity values. Laboratory analytical results were obtained for each sample’s heating value, proximate and ultimate analysis, mineral ash composition, ash fusion temperatures, and viscosity temperatures. Thermal conductivity was measured using a HotDisk TPS 2500S. LIBS measurements were processed and used as predictor features for machine learning (ML) models to predict the sample’s material properties. Predictor feature selection algorithms, particularly minimum redundancy maximum relevance (mRMR), reduced the dimensionality of ML models. Many modelling methods such as Gaussian process regression (GPR), regression tree, neural networks (NN), and support vector machines (SVM) were demonstrated to be effective at predicting higher order properties; however, mRMR with GPR stood out as a clear winning combination.

01 COAL, LIGNITE, AND PEAT↗

Model-based Hierarchical Reinforcement Learning for Improved Physical Security Design: A Prototype

Prior work in FY24 developed an adversarial AI agent aid in path analysis of physical protection systems. This agent, trained using a model-based reinforcement learning algorithm, was able to successfully learn the most vulnerable path in facilities. It was able to extend the current state of practice for physical protection design by exhibiting dynamic behavior based on current environmental conditions. Whereas PathTrace largely performs a static, graph-based analysis, the AI agent was able to make decisions based on relative position in the facility, current conditions (was the adversarial agnet discovered?), and proximity to secondary targets. The agent demonstrated some novel capabilities, but had limitations that need to be resolved before it can be used for production purposes. For example, the adversarial agent generalizes poorly and takes a relatively long time to train. Nonetheless, there is still considerable promise for developing the adversarial agent further in order to explore even richer, more dynamic behaviors (e.g., adversary motivations, environmental debris, and more). This work considers a complementary idea; development of a planning agent. The planning agent is envisioned as an auto-complete-like tool that can help accelerate security system design by human experts. The agent would respect existing barriers and sensors placed by a human expert while offering cost-effective suggestions (i.e., implicitly balancing effectiveness with cost) to improve the design. The goal is for this agent to be part of an expert’s toolbox, not to totally upend the current state-of-practice, or to displace human experts. The ultimate goal would be concurrent training of both the adversarial and planning agent together, to learn entirely through self-play. This would represent an entirely new way of performing system deign. We selected a hierarchical, model-based reinforcement learning algorithm to serve as the planning agent. This is an extension of concepts used in the prior FY24 adversarial agent work. There, we had a single agent acting an environment. Here, we have two different sub-agents (policies), working together, to form a complete agent. There is a manager policy, which can select abstract goals on slower time scales, and a worker, which performs primitive actions to reach goals selected by the manager. It is worth noting that this class of algorithm is challenging to work with. From our understanding, our work is one of the first successful uses of model-based reinforcement learning (MBRL) in nuclear energy1 , and likely the first hierarchical model-based reinforcement learning application in nuclear energy. Further, this work is one of the first known attempts to apply AI to perform a design tasks in nuclear energy. Consequently, there were significant implementation challenges and the bulk of the work was focused on successful implementation and algorithm design. The results presented here are very low technology readiness level as a consequence of the lack of related literature, but still represent a significant step forward in the pursuit of applied AI for design.

42 ENGINEERING↗

RAVEN Theory Manual

RAVEN is a software framework able to perform parametric and stochastic analysis based on the response of complex system codes. The initial development was aimed at providing dynamic risk analysis capabilities to the thermohydraulic code RELAP-7, currently under development at Idaho National Laboratory (INL). Although the initial goal has been fully accomplished, RAVEN is now a multi-purpose stochastic and uncertainty quantification platform, capable of communicating with any system code. In fact, the provided Application Programming Interfaces (APIs) allow RAVEN to interact with any code as long as all the parameters that need to be perturbed are accessible by input files or via python interfaces. RAVEN is capable of investigating system response and explore input space using various sampling schemes such as Monte Carlo, grid, or Latin hypercube. However, RAVEN strength lies in its system feature discovery capabilities such as: constructing limit surfaces, separating regions of the input space leading to system failure, and using dynamic supervised learning techniques. The development of RAVEN started in 2012 when, within the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program, the need to provide a modern risk evaluation framework arose. RAVEN’s principal assignment is to provide the necessary software and algorithms in order to employ the concepts developed by the Risk Informed Safety Margin Characterization (RISMC) program. RISMC is one of the pathways defined within the Light Water Reactor Sustainability (LWRS) program. In the RISMC approach, the goal is not just to identify the frequency of an event potentially leading to a system failure, but the proximity (or lack thereof) to key safety-related events. Hence, the approach is interested in identifying and increasing the safety margins related to those events. A safety margin is a numerical value quantifying the probability that a safety metric (e.g. peak pressure in a pipe) is exceeded under certain conditions. Most of the capabilities, implemented having RELAP-7 as a principal focus, are easily deployable to other system codes. For this reason, several side activates have been employed (e.g. RELAP5-3D, any MOOSE-based App, etc.) or are currently ongoing for coupling RAVEN with several different software. The aim of this document is to provide a set of commented examples that can help the user to become familiar with the RAVEN code usage.

97 MATHEMATICS AND COMPUTING↗

Biexciton Condensation in Electron-Hole-Doped Hubbard Bilayers: A Sign-Problem-Free Quantum Monte Carlo Study

The bilayer Hubbard model with electron-hole doping is an ideal platform to study excitonic orders due to suppressed recombination via spatial separation of electrons and holes. However, suffering from the sign problem, previous quantum Monte Carlo studies could not arrive at an unequivocal conclusion regarding the presence of phases with clear signatures of excitonic condensation in bilayer Hubbard models. Here, we develop a determinant quantum Monte Carlo algorithm for the bilayer Hubbard model that is sign-problem-free for equal and opposite doping in the two layers and study excitonic order and charge and spin density modulations as a function of chemical potential difference between the two layers, on-site Coulomb repulsion, and interlayer interaction. In the intermediate coupling regime and in proximity to the SU(4)-symmetric point, we find a biexcitonic condensate phase at finite electron-hole doping, as well as a competing (π, π) charge density wave state. In this study, we extract the Berezinskii-Kosterlitz-Thouless transition temperature from superfluid density and a finite-size scaling analysis of the correlation functions and explain our results in terms of an effective biexcitonic hard-core boson model.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

cuAlign: Scalable Network Alignment on GPU Accelerators

Given two graphs, the objective of network alignment is to find the best one-to-one mapping of vertices in one graph (??) to vertices in the other (??), such that the number of overlaps is maximized. We say that edges(??, ??) ???and(??', ??') ??? are overlapped if ?? is mapped to ??' and ?? is mapped to??'. Network alignment is an important optimization problem with several applications in bioinformatics, computer vision and ontology matching. Since it is an NP-hard problem, efficient heuristics and scalable implementations are necessary. In this work, we introduce a new framework that combines the concepts of intra-network proximity using vertex embedding,Belief Propagation (BP) and approximate weighted matching, and provides qualitative improvements up to22%over state-of-the-art approaches. We also provide scalable implementations on GPU accelerators, demonstrating up to19×speedup for Belief Propagation and 3× speedup for approximate weighted matching relative to previous multithreaded implementation. A combination of combinatorial and algebraic kernels within the network alignment algorithm poses significant hurdles for parallelization. Load imbalance and irregular DRAM traffic limit achievable performance on GPUs. Our novel approach identifies and exploits unique structural proper-ties of the BP-based algorithm and employs code fusion to reduce data movement between different steps of the algorithm. Using a diverse set of inputs, we demonstrate qualitative improvements of our algorithms, and performance gains of our GPU-accelerated implementation. We believe that our work will enable algorithmic improvements and practical applications of network alignment.

Xiang, Lizhi↗

Nonlinear Matrix Approximation with Radial Basis Function Components

We introduce and investigate matrix approximation by decomposition into a sum of radial basis function (RBF) components. An RBF component is a generalization of the outer product between a pair of vectors, where an RBF function replaces the scalar multiplication between individual vector elements. Even though the RBF functions are positive definite, the summation across components is not restricted to convex combinations and allows us to compute the decomposition for any real matrix that is not necessarily symmetric or positive definite. We formulate the problem of seeking such a decomposition as an optimization problem with a nonlinear and non-convex loss function. Several modern versions of the gradient descent method, including their scalable stochastic counterparts, are used to solve this problem. We provide extensive empirical evidence of the effectiveness of the RBF decomposition and that of the gradient-based fitting algorithm. While being conceptually motivated by singular value decomposition (SVD), our proposed nonlinear counterpart outperforms SVD by drastically reducing the memory required to approximate a data matrix with the same L2 error for a wide range of matrix types. For example, it leads to 2 to 6 times memory save for Gaussian noise, graph adjacency matrices, and kernel matrices. Moreover, this proximity-based decomposition can offer additional interpretability in applications that involve, e.g., capturing the inner low-dimensional structure of the data, retaining graph connectivity structure, and preserving the acutance of images.

Rebrova, Elizaveta↗

Testing and Design of Discriminants for Local Seismic Events Recorded during the Redmond Salt Mine Monitoring Experiment

The Redmond Salt Mine (RSM) Monitoring Experiment in Utah was designed to record seismoacoustic data at distances less than 50 km for algorithm testing and development. During the experiment from October 2017 to July 2019, six broadband seismic stations were operating at a time, with three of them having fixed locations for the duration, whereas the three other stations were moved to different locations every one-and-half to two-and-half months. RSM operations consist of nighttime underground blasting several times per week. The RSM is located in proximity to a belt of active seismicity, allowing direct comparison of natural and anthropogenic sources. Using the recorded data set, we built 1373 events with local magnitude (M L ) of -2.4 and lower to 3.3. For 75 blasts (RMEs) from the Redmond Salt Mine and 206 tectonic earthquakes (EQs), both M L and the coda duration magnitude (MC) are well constrained. We used these events to test and design discriminants that separate the RMEs from the EQs and are effective at local distances. The discriminants consist of M L -M C , low-frequency Sg to high-frequency Sg, Pg/Sg phase-amplitude ratios, and Rg/Sg spectral amplitude ratios, as well as different combinations of two or more of these classifiers. The areas under the receiver operating characteristic curves (AUCs) of 0.92–1.0 for M L -M C , low-frequency Sg to high-frequency Sg, and Rg/Sg indicate that these discriminants are very effective. Conversely, the AUC of only 0.57 for Pg/Sg suggests that this discriminant is only slightly better than a random classifier. Among the effective classifiers, Rg/Sg, shows the lowest likelihood of misclassification (4.3%) for the populations. In conclusion, results of joint discriminant analyses suggest that even the arguably ineffective single classifier, like Pg/Sg in this case, can provide some value when used in combination with others.

58 GEOSCIENCES↗

Multi-channel, multi-template event reconstruction for SuperCDMS data using machine learning

SuperCDMS SNOLAB uses kilogram-scale germanium and silicon detectors to search for dark matter. Each detector has Transition Edge Sensors (TESs) patterned on the top and bottom faces of a large crystal substrate, with the TESs electrically grouped into six phonon readout channels per face. Noise correlations are expected among a detector's readout channels, in part because the channels and their readout electronics are located in close proximity to one another. Moreover, owing to the large size of the detectors, energy deposits can produce vastly different phonon propagation patterns depending on their location in the substrate, resulting in a strong position dependence in the readout-channel pulse shapes. Both of these effects can degrade the energy resolution and consequently diminish the dark matter search sensitivity of the experiment if not accounted for properly. We present a new algorithm for pulse reconstruction, mathematically formulated to take into account correlated noise and pulse shape variations. This new algorithm fits N readout channels with a superposition of M pulse templates simultaneously - hence termed the N$\times$M filter. We describe a method to derive the pulse templates using principal component analysis (PCA) and to extract energy and position information using a gradient boosted decision tree (GBDT). We show that these new N$\times$M and GBDT analysis tools can reduce the impact from correlated noise sources while improving the reconstructed energy resolution for simulated mono-energetic events by more than a factor of three and for the 71Ge K-shell electron-capture peak recoils measured in a previous version of SuperCDMS called CDMSlite to $<$ 50 eV from the previously published value of $\sim$100 eV. These results lay the groundwork for position reconstruction in SuperCDMS with the N$\times$M outputs.

Albakry, M. F. [British Columbia U.; TRIUMF]↗

Optimized Tandem Catalyst Patterning for CO 2 Reduction Flow Reactors

Tandem catalysis involves two or more catalysts arranged in proximity within a single reaction vessel, with the aim of synergistically aligning the catalysts’ reaction pathways to maximize overall system performance. This study presents a proof of concept showing the integration of continuum transport modeling with design optimization in a simplified two-dimensional flow reactor setup for electrochemical CO 2 reduction. Ag catalysts provide the CO 2 ⟶ CO reaction capability, and Cu catalysts provide the CO ⟶ high-value products reaction capability. Given a set of input parameters, the optimization algorithm uses adjoint methods to modify the Ag/Cu surface patterning in order to maximize the current density toward high-value products, such as ethylene. The optimized designs yield significant performance enhancement especially at more negative applied voltages (i.e., stronger surface reactions) and for larger numbers of patterning sections. For an applied voltage of −1.7 V vs. SHE, the 12-section optimized design increases the current density toward ethylene by up to 65% compared to the unoptimized 2-section design. For the optimized cases, observed differences in the production and consumption of CO (the key intermediate species) and minimized zones of low CO reactant surface concentration on Cu sections explain the improved reactor performance.

CO2 reduction↗

Stochastic reconstruction of fracture network pattern using spatial point processes

Fracture spatial patterns can strongly affect fluid flow in the subsurface. Proximity and distribution of fractures control reservoir flow behavior over various length scales. In many studies, however, simplified geometrical patterns are generated for fractures which may lead to unrealistic subsurface models. Here we introduce a new method for characterization and modeling of fracture spatial patterns based on outcrop observations. We use Ripley's K-function to characterize the arrangement of fracture barycenters and intersection points over various length scales. In addition, we use semivariograms to quantify spatial correlation in fracture intensity maps. Using this information, we develop a stochastic algorithm that generates two-dimensional fracture network realizations with spatial properties similar to those of a real fracture network measured in the field. Numerical simulation models indicate that the generated fracture realizations exhibit similar flow behaviors as that of the original fracture network. Furthermore, such modeling tools expand and improve our capability in building representative fracture models and in quantification of uncertainty in naturally and hydraulically fractured reservoirs.

58 GEOSCIENCES↗

MemFriend: Understanding Memory Performance with Spatial-Temporal Affinity

In HPC applications, memory access behavior is one of the main factors affecting performance. Improving an application’s memory access behavior involves optimizing data layout and/or restructuring code, and requires studying spatial-temporal data locality. Existing data locality analyses focus on single-location metrics and are restricted to evaluating temporal locality. We introduce spatial-temporal affinity metrics that quantify temporal access proximity, forward access correlation, and nearby access correlation between pairs of memory locations. We describe methods for distinguishing between potential vs. realized affinity and for reasoning about affinity at multiple resolutions (3D, 2D, 1D). Finally, we construct spatial-temporal affinity signatures that classify memory behavior and that be used to reason about changes in software (data relayout, code refactoring) or hardware (caching, prefetching). We describe methods for signature visualization, interpretation, and quantitative comparison of signatures. We evaluate our methodology using applications with variants that contrast data structures, data layouts and algorithms. We show that spatial-temporal affinity analysis provides novel insights and enables predictive reasoning about application performance when contrasted with reuse distance analysis.

Suriyakumar, Yasodhadevi↗

Acoustic Travel-Time Tomography for Wind Energy

New remote sensing technologies for direct observation of the atmospheric flow in the proximity of operating wind turbines are necessary for the advancement of wind turbine design, wind plant control, and the validation of high-fidelity numerical models; fundamental goals of the DOE Wind Energy Technology Office's (WETO's) A2e program. Modern remote sensing technologies for commercial and research applications rely on the backscatter of light or sound waves, which limits spatial and temporal resolution and cannot produce reliable flow estimates near solid bodies or reflective surfaces. Acoustic tomography (AT) is an innovative sensing technology based on fundamental thermodynamic properties of the atmosphere and an inverse algorithm that can reconstruct both velocity and temperature fields within a network of acoustic transducers. AT relies on the direct travel path of acoustic signals between speakers and microphones in the network and can achieve much higher resolutions than conventional backscatter technologies. For wind energy R&D applications, AT represents an extremely economical option over other remote sensing technologies, integrating mature and commonly available acoustic and signal processing hardware. This report is intended as an update on the development of the AT array on the NREL Flatirons Campus (FC) and includes a brief review of the instrumentation, the calibration of equipment, signal processing, and resulting flow field estimates. Designs for future AT systems and applications are detailed in this report, including summaries of new capabilities, engineering and theoretical challenges, and anticipated costs help to outline future directions for AT technology R\&D. The potential for application of AT to utility-scale turbines is also discussed. Investing in the development of the proposed instrument will establish AT as a transformational RS technique that represents a significant advance in measurement instrumentation, enabling new fundamental insights into the structure of the atmospheric boundary layer and supporting applications for wind energy, pollution transport, and resource characterization. AT is also an extremely economical option over other RS instruments, integrating mature and commonly available acoustic and signal processing hardware.

17 WIND ENERGY↗

Model validation for inferred hot-spot conditions in National Ignition Facility experiments

Progress toward ignition requires accurately diagnosing current conditions and assessing proximity metrics for implosion experiments on the National Ignition Facility. Hot-spot conditions are not directly measured, but rather inferred, often using simple 0- and 1D models [P. Patel et al., Phys. Plasmas 27, 050901 (2020)]. In this work, we present a detailed accuracy validation exercise using a set of ~20,000 2D simulations encompassing a variety of performance and degradation levels. We find good agreement between the model-inferred pressure and the simulated burn-weighted pressure at peak neutron production and also present results on the precision of inferred quantities using a Markov-Chain Monte Carlo algorithm.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗