SEARCH · Engineering Papers
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.
This presentation provides an overview of the laboratory evaluation of federated, hierarchical controls for distribution power system management.
For the last several years and in collaboration with CARILEC, USAID and NREL have been working to support cyber resilience at power sector utilities in Latin America and the Caribbean. Direct technical assistance with regional utilities has been a key component of USAID-NREL Partnership activities, and technical assistance has typically included a foundational cybersecurity assessment using NREL's Distributed Energy Resource Cybersecurity Framework (DER-CF) tool. The DER-CF allows organizations to benchmark and evaluate their cybersecurity posture across the areas of Governance, Technical Management, and Physical Security. To complement the activities of the newly created CAREC IT/OT and Cybersecurity Team, this webinar on cybersecurity assessment tools includes an overview of the DER-CF tool and a discussion with regional stakeholders and NREL experts on the DER-CF assessment process and other resources for cybersecurity assessments.
As a participant in the Cyclotron Road Lab-Embedded Entrepreneurship Program (LEEP), Vellex Computing, Inc. has successfully validated the "Vellex Computing Stack," a breakthrough Analog Neural Computer (ANC) specifically designed for high-performance edge optimization. This project achieved critical milestones in mixed-signal circuit stability and software-hardware co-design, directly addressing national priorities in semiconductor resiliency. The success of this work is deeply rooted in the support from the Cyclotron Road LEEP, which provided the essential "hard tech" runway—funding, mentorship, and access to Lawrence Berkeley National Laboratory’s world-class characterization facilities—allowing Vellex to overcome the "Valley of Death" often faced by deep-tech hardware startups. By leveraging LBNL’s advanced testing infrastructure, Vellex was able to rigorously benchmark the ANC architecture against state-of-the-art digital solutions, a feat that would have been resource-prohibitive independently. This collaboration has not only advanced American leadership in analog computing but has also matured Vellex’s technology to a stage ripe for private sector commercialization.
In this paper I will take a close look at a statistical crack model (SCM) as is used in engineering computer codes to simulate fracture at high strain rates. My general goal is to understand the macroscopic behavior effected by the microphysical processes incorporated into an SCM. More specifically, I will assess the importance of including local interactions between cracks into the growth laws of an SCM. My strategy will be to construct a numerical laboratory that represents a single computational cell containing a realization of a statistical distribution of cracks. The cracks will evolve by the microphysical models of the SCM, leading to quantifiable damage and failure of the computational cell. I will use the numerical data generated by randomly generated ensembles of the fracture process to establish scaling laws that will modify and simplify the implementation of the SCM into large scale engineering codes.
This report examines cybersecurity standards for Distributed Energy Resources (DERs) in light of their rapid growth and increasing integration into energy systems. It identifies critical gaps in existing frameworks, including inadequate coverage of DER-specific challenges, complexities in implementing comprehensive standards, integration issues with legacy systems, adoption hurdles for newer standards, and a lack of harmonization across regulatory landscapes. The analysis highlights vulnerabilities such as data integrity risks, unauthorized device control, and denial-of-service attacks across various DER technologies like solar PV, wind turbines, energy storage systems, and hydrogen fuel cells. The report proposes a harmonization strategy to address these deficiencies by developing unified cybersecurity requirements, certification programs, and training resources while fostering collaboration among stakeholders such as government agencies, industry groups, DER operators, manufacturers, and research institutions. A phased roadmap is outlined to refine and implement these measures through pilot testing and widespread adoption. Ultimately, the report underscores the urgent need for coordinated efforts to enhance DER cybersecurity and ensure the reliable operation of future energy systems.
Recent advancements in high performance computing platforms and computational workflow for regional-scale simulations are enabling unprecedented modeling of fault-to-structure earthquake processes. Regional simulations resolving ground motions at frequencies relevant to engineered systems are becoming computationally viable and provide a new capability to improve understanding of the geographical distribution and intensity of risk to buildings and critical infrastructure. As computational capabilities advance, it is essential to move beyond illustrative single rupture realizations for scenario earthquake events towards the development of a full suite of rupture realizations that appropriately characterize the range of risk to building systems. The work described in this article investigates the application of a suite of fault rupture realizations with the objective of assessing near-fault, site-specific seismic demand variability for building structures. A representative high-performance regional-scale computational model is utilized to execute ground motion and building response simulations based on 18 kinematic rupture realizations of an M7 strike-slip scenario earthquake. The fault rupture models for the scenario earthquake are created by systematically perturbing the hypocenter location and stochastically generating rupture parameters (slip, rise time, rake angle) to represent a breadth of ground motion intensities resulting from the spatial and temporal variabilities of an earthquake rupture process. The resulting seismic demand variability for three-story (short period) and forty-story (long period) steel moment-resisting frame buildings is characterized in terms of the median and distribution of peak inter-story drift ratio for a range of near-fault sites. The full suite of 18 fault rupture realizations and approximately 280,000 nonlinear dynamic building simulations indicate that the three-story building undergoes higher median seismic demand and significantly greater variability of demand at a given site than the forty-story building, which has important implications for the level of certainty in predicting building performance during an earthquake. The simulations performed provide deeper insight into the relationship between fault rupture parameterization and building response, which is essential information for developing a representative suite of rupture realizations for specific earthquake scenarios.
As the number of submodules rapidly increase, control architecture of Modular Multilevel Converters (MMCs) is transforming from centralized to distributed in order to address the challenges of tremendous computational burden and massive wiring. In this digest, we propose a modulation scheme for the MMCs with distributed controls, where each submodule is able to handle both controls and modulation in a decentralized manner. It enables the distributed controllers to synchronize in terms of fast-switching pulse width modulation (PWM). Aiming at this key technical challenge, this research develops a physics-informed PWM control strategy of mirroring the spontaneous synchronization feature of coupled oscillator’s behavior at switching frequency. Thanks to less reliance on wirings and communications, the proposed approach has the potential of i) improving reliability of MMC systems, and ii) reducing cost and space requirements for MMCs. The proposed approach has been preliminarily verified through a simulation tool for power electronics systems.
After a century of relative stability of the electricity industry, extensive deployment of distributed energy resources and recent advances in computation and communication technologies have changed the nature of how we consume, trade, and apply energy. The power system is facing a transition from its traditional hierarchical structure to a more deregulated model by introducing new energy distribution models such as peer-to- peer (P2P) sharing for connected communities. The proven effectiveness of P2P sharing in benefiting both prosumers and the grid has been demonstrated in many studies and pilot projects. However, there is still no extensive implementation of such sharing models in today’s electricity markets. This paper aims to shed some light on this gap through a comprehensive overview of recent advances in the P2P energy system and an insightful discussion of the challenges that need to be addressed in order to establish P2P sharing as a viable energy management option in today’s electricity market. To this end, in this article, we provide some background on different aspects of P2P sharing. Then, we discuss advances in P2P sharing through a systematic domain-based classification. We also review different pilot projects on P2P sharing across the globe. Finally, we identify and discuss a number of challenges that need to be addressed for scaling up P2P sharing in the electricity market followed by concluding remarks at the end of the paper.
Amorphous bulk metallic glasses with the composition Fe 48 Cr 15 Mo 14 C 15 B 6 Y 2 have been of interest due to their special mechanical and electronic properties, including corrosion resistance, high yield-strength, large elasticity, catalytic performance, and soft ferromagnetism. Here, we apply a reverse Monte Carlo technique to unravel the atomic structure of these glasses. The pair-distribution functions for various atomic pairs are computed based on the high-energy x-ray diffraction data we have taken from an amorphous sample. Monte Carlo cycles are used to move the atomic positions until the model reproduces the experimental pair-distribution function. The resulting fitted model is consistent with our ab initio simulations of the metallic glass. Our study contributes to the understanding of functional properties of Fe-based bulk metallic glasses driven by disorder effects.
Convection‐permitting models (CPMs) explicitly resolve deep convection yet under‐resolve the organized lateral exchanges among drafts and their environment that control entrainment/detrainment, precipitation efficiency, and mesoscale structure. In this work, we introduce the Optimized Advection Scheme (OAS), which introduces a small rotation of the Cartesian frame of reference for the horizontal winds relative to other variables used in advection that induces cross‐gradient transport to mimic under‐resolved convective mixing. The rotation angle is selected to minimize the Kullback–Leibler divergence between the simulated and satellite observed precipitation intensity distributions, yielding a physically consistent perturbation that is computationally inexpensive and portable. Optimized Advection Scheme is implemented in WRF and evaluated over Amazon (April 2014). It shifts precipitation–precipitable‐water joint distributions toward lighter rain, reduces overly intense rates, and improves mesoscale convective system (MCS) lifetime and propagation. Mechanistically, the added cross‐gradient transport promotes convective detrainment and environmental mixing, which cools and moistens the mid‐troposphere, weakens downward momentum transport, alleviates excessive downwelling shortwave biases, and warms the surface temperature. The optimized rotation angle yields comparable improvements at 4‐km and 1‐km grid spacing, demonstrating resolution‐independent benefits across the CPM gray zone. By targeting the dynamical root of under‐mixed convective circulations, rather than tuning model microphysics or closures, OAS delivers robust, scale‐aware improvements in precipitation statistics, cloud vertical structure, and characteristics of MCS (MCSs), offering a practical pathway to more reliable CPM simulations for weather and climate applications.
Increasing catalytic activity and durability of atomically dispersed metal–nitrogen–carbon (M–N–C) catalysts for the oxygen reduction reaction (ORR) cathode in proton-exchange-membrane fuel cells remains a grand challenge. In this study, a high-power and durable Co–N–C nanofiber catalyst synthesized through electrospinning cobalt-doped zeolitic imidazolate frameworks into selected polyacrylonitrile and poly(vinylpyrrolidone) polymers is reported. The distinct porous fibrous morphology and hierarchical structures play a vital role in boosting electrode performance by exposing more accessible active sites, providing facile electron conductivity, and facilitating the mass transport of reactant. The enhanced intrinsic activity is attributed to the extra graphitic N dopants surrounding the CoN 4 moieties. The highly graphitized carbon matrix in the catalyst is beneficial for enhancing the carbon corrosion resistance, thereby promoting catalyst stability. The unique nanoscale X-ray computed tomography verifies the well-distributed ionomer coverage throughout the fibrous carbon network in the catalyst. The membrane electrode assembly achieves a power density of 0.40 W cm –2 in a practical H 2 /air cell (1.0 bar) and demonstrates significantly enhanced durability under accelerated stability tests. The combination of the intrinsic activity and stability of single Co sites, along with unique catalyst architecture, provide new insight into designing efficient PGM-free electrodes with improved performance and durability.
Scientific computations are expected to be increasingly distributed across wide-area networks, and Message Passing Interface (MPI) has been shown to scale to support their communications over long distances. Application-level measurements of MPI operations reflect the connection Round-Trip Time (RTT) and loss rate, and machine learning methods have been previously developed to estimate them under deterministic periodic losses. In this paper, we consider more complex, random losses with unform, Poisson and Gaussian distributions. We study five disparate machine leaning methods, with linear and non-linear, and smooth and non-smooth properties, to estimate RTT and loss rate over 10Gbps connections with 0-366ms RTT. The diversity and complexity of these estimators combined with the randomness of losses and TCP’s non-linear response together rule out the selection of a single best among them; instead, we fuse them to retain their design diversity. Overall, the results show that accurate estimates can be generated at low loss rates but become inaccurate at loss rates 10% and higher, thereby illustrating both their strengths and limitations.
We develop a holographic framework for describing the experience of bulk observers in AdS/CFT, that allows us to compute the proper time and energy distribution measured along any bulk worldline. Our method is formulated directly in the CFT language and is universal: it does not require knowledge of the bulk geometry as an input. When used to propagate operators along the worldline of an observer falling into an eternal black hole, our proposal resolves a conceptual puzzle raised by Marolf and Wall. Notably, the prescription does not rely on an external dynamical Hamiltonian or the AdS boundary conditions and is, therefore, outlining a general framework for the emergence of time.
Non-local games provide a versatile framework for probing quantum correlations and for benchmarking the power of entanglement. In finite dimensions, the standard method for playing several games in parallel requires a tensor product of the local Hilbert spaces, which scales additively in the number of qubits. In this work, we show that this additive cost can be reduced by exploiting algebraic embeddings. We introduce two forms of compressions. First, when a referee selects one game from a finite collection of games at random, the game quantum strategy can be implemented using a maximally entangled state of dimension equal to the largest individual game, thereby eliminating the need for repeated state preparations. Second, we establish conditions under which several games can be played simultaneously in parallel on fewer qubits than the tensor product baseline. These conditions are expressed in terms of commuting embeddings of the game algebras. Moreover, we provide a constructive framework for building such embeddings. Using tools from Lie theory, we show that aligning the various game algebras into a common Cartan decomposition enables such a qubit reduction. Beyond the theoretical contribution, our framework casts NLGs as algebraic primitives for distributed and resource-constrained quantum computations and suggested NLGs as a comparable device-independent dimension witness.
Probabilistic scenarios of renewable energy production, such as wind, have been gaining popularity for use in stochastic variants of power systems operations scheduling problems, allowing for optimal decision-making under uncertainty. The quality of the scenarios has a direct impact on the value of the resulting decisions, but until now, methods for creating scenarios have not been compared under realistic operational conditions. Here, we compare the quality of scenario sets created using three different methods, based on a simulated re-enactment of stochastic day-ahead unit commitment and subsequent dispatch for a realistic test system. We create scenarios using a dataset of forecasted and actual wind power values, scaled to evaluate the effects of increasing wind penetration levels. We show that the choice of scenario set can significantly impact system operating cost, renewable energy use, and the ability of the system to meet demand. This result has implications for the ability of system operators to efficiently integrate renewable production into their day-ahead planning, highlighting the need for the use of performance-based assessments for scenario evaluation.
Here, this work presents processing silicon carbide (SiC) with the laser-induced slip casting (LIS) additive manufacturing (AM). SiC was stabilized in water with polyethyleneimine (PEI) dispersant, and SiC slurries were made with rheology for LIS printing. High-density ceramic parts were printed, followed by single-step binder burnout and sintering. The printed parts achieved 93–95 % of theoretical density. X-ray computed tomography (XCT) revealed a small distribution of flaws exceeding 100 microns. The mechanical properties were measured in both parallel and perpendicular to the printing layers, and the orientation with layers perpendicular to the bending moment resulted in higher strength compared to the parallel direction. Porosity resulting from processing and large inclusions of boron carbide (B4C) were the root cause of failure in the measured samples. Despite these defects through this effort, this new approach demonstrates promise for green forming of SiC with densities greater than 95 % theoretical and tensile strengths above 250 MPa.
The Partitioned Global Address Space (PGAS) model is well suited for executing irregular applications on cluster-based systems, due to its efficient support for short, one-sided messages. Separately, the actor model has been gaining popularity as a productive asynchronous message-passing approach for distributed objects in enterprise and cloud computing platforms, typically implemented in languages such as Erlang, Scala or Rust. To the best of our knowledge, there has been no past work on using the actor model to deliver both productivity and scalability to irregular PGAS applications with large number of small messages. In this paper, we introduce a new programming system for PGAS applications, in which point-to-point remote operations can be expressed as fine-grained asynchronous actor messages. In our approach, the programmer does not need to worry about programming complexities related to message aggregation and termination detection. Our approach can be viewed as extending the classical Bulk Synchronous Parallelism model with fine-grained asynchronous communications within a phase or superstep. Here, we believe that our approach offers a desirable point in the productivity-performance space for PGAS applications, with more scalable performance and higher productivity relative to past approaches. Specifically, for seven irregular mini-applications from the Bale Kernels and three graph kernels executed using 2048 cores in the NERSC Cori system, our approach shows geometric mean performance improvements of ≥ 20X relative to standard PGAS versions (UPC and OpenSHMEM) while maintaining comparable productivity to those versions.
Finding connected components is one of the most widely used operations on a graph. Optimal serial algorithms for the problem have been known for half a century, and many competing parallel algorithms have been proposed over the last several decades under various different models of parallel computation. This paper presents a class of parallel connected-component algorithms designed using linear-algebraic primitives. These algorithms are based on a PRAM algorithm by Shiloach and Vishkin and can be designed using standard GraphBLAS operations. Here, we demonstrate two algorithms of this class, one named LACC for Linear Algebraic Connected Components, and the other named FastSV which can be regarded as LACC’s simplification. With the support of the highly-scalable Combinatorial BLAS library, LACC and FastSV outperform the previous state-of-the-art algorithm by a factor of up to 12x for small to medium scale graphs. For large graphs with more than 50B edges, LACC and FastSV scale to 4K nodes (262K cores) of a Cray XC40 supercomputer and outperform previous algorithms by a significant margin. This remarkable performance is accomplished by (1) exploiting sparsity that was not present in the original PRAM algorithm formulation, (2) using high-performance primitives of Combinatorial BLAS, and (3) identifying hot spots and optimizing them away by exploiting algorithmic insights.