Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational paradigms”

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 613 records · Page 34

MAX - An advanced parallel computer for space applications

MAX is a fault-tolerant multicomputer hardware and software architecture designed to meet the needs of NASA spacecraft systems. It consists of conventional computing modules (computers) connected via a dual network topology. One network is used to transfer data among the computers and between computers and I/O devices. This network's topology is arbitrary. The second network operates as a broadcast medium for operating system synchronization messages and supports the operating system's Byzantine resilience. A fully distributed operating system supports multitasking in an asynchronous event and data driven environment. A large grain dataflow paradigm is used to coordinate the multitasking and provide easy control of concurrency. It is the basis of the system's fault tolerance and allows both static and dynamical location of tasks. Redundant execution of tasks with software voting of results may be specified for critical tasks. The dataflow paradigm also supports simplified software design, test and maintenance. A unique feature is a method for reliably patching code in an executing dataflow application.

Lewis, Blair F.↗

Cybersecurity Considerations for Emerging Energy Technologies

AI, cloud computing, post-quantum cryptography, zero-trust architectures, microgrids, and virtual power plants. What do these things have in common? They are all emerging technologies in the clean energy space that will be a critical part of grid modernization efforts. As we work towards clean energy and decarbonization targets, these technologies, developed to solve real-world problems, will help us reach goals and achieve new efficiencies as the paradigm of grid operation shifts. However, there are growing concerns about the cybersecurity risks associated with these trending topics as they are used in critical infrastructure applications. This talk will cover gaps, challenges, and opportunities for the secure implementation of grid modernization solutions and novel energy applications of state-of-the-art networking and communications. Proactive risk mitigation strategies, including the application of cyber-informed engineering, will be discussed. Practical applications of these techniques will help provide countermeasures to the impact of cyberattacks on critical infrastructure technologies in a new, digitized grid landscape.

14 SOLAR ENERGY↗

Compiler and Runtime Approaches to Enable Large-Scale Irregular Programs. Final report, July 2013 - July 2019

While regular algorithms, characterized by operations on dense matrices and arrays, have long been the mainstay of scientific, high-performance computing, irregular algorithms, which feature unpredictable accesses to pointer-based data structures, are becoming increasingly common in high performance computing, arising in graph analysis, data mining and visualization, among other domains. Unfortunately, the defining characteristics of irregular applications, their dynamic, unpredictable, data-dependent access patterns and data layouts, make achieving high performance on large scale systems difficult. Scaling applications to peta- and exa-scale requires carefully controlling communication and data movement and placement, an inherently difficult task when access patterns and data layouts are unpredictable! Most irregular applications that attain high performance must be painstakingly hand-written and hand-tuned, with few common principles or paradigms uniting various implementations and easing future development. Despite the increasing importance of irregular applications, there is little programmer knowledge, and even less compiler ability, devoted to optimizing them. This project aims to solve these problems. By allowing programmers to write irregular applications in high level forms, with at most a few annotations highlighting key structural properties, programmers can focus on developing their algorithms and methods. The compiler and run-time system can take on the tedious task of optimizing the application for execution at large scales, and can automatically provide efficient implementations. This will provide portability and ease maintenance for existing irregular applications, but, more importantly, open up whole new domains of computational science to large-scale, high-performance simulation codes.

97 MATHEMATICS AND COMPUTING↗

Advances in Kriging-Based Autonomous X-Ray Scattering Experiments

Autonomous experimentation is an emerging paradigm for scientific discovery, wherein measurement instruments are augmented with decision-making algorithms, allowing them to autonomously explore parameter spaces of interest. We have recently demonstrated a generalized approach to autonomous experimental control, based on generating a surrogate model to interpolate experimental data, and a corresponding uncertainty model, which are computed using a Gaussian process regression known as ordinary Kriging (OK). We demonstrated the successful application of this method to exploring materials science problems using x-ray scattering measurements at a synchrotron beamline. Here, we report several improvements to this methodology that overcome limitations of traditional Kriging methods. The variogram underlying OK is global and thus insensitive to local data variation. We augment the Kriging variance with model-based measures, for instance providing local sensitivity by including the gradient of the surrogate model. As with most statistical regression methods, OK minimizes the number of measurements required to achieve a particular model quality. However, in practice this may not be the most stringent experimental constraint; e.g. the goal may instead be to minimize experiment duration or material usage. We define an adaptive cost function, allowing the autonomous method to balance information gain against measured experimental cost. We provide synthetic and experimental demonstrations, validating that this improved algorithm yields more efficient autonomous data collection.

36 MATERIALS SCIENCE↗

Sound propagation in realistic interactive 3D scenes with parameterized sources using deep neural operators

We address the challenge of acoustic simulations in three-dimensional (3D) virtual rooms with parametric source positions, which have applications in virtual/augmented reality, game audio, and spatial computing. The wave equation can fully describe wave phenomena such as diffraction and interference. However, conventional numerical discretization methods are computationally expensive when simulating hundreds of source and receiver positions, making simulations with parametric source positions impractical. To overcome this limitation, we propose using deep operator networks to approximate linear wave-equation operators. This enables the rapid prediction of sound propagation in realistic 3D acoustic scenes with parametric source positions, achieving millisecond-scale computations. By learning a compact surrogate model, we avoid the offline calculation and storage of impulse responses for all relevant source/listener pairs. Our experiments, including various complex scene geometries, show good agreement with reference solutions, with root mean squared errors ranging from 0.02 to 0.10 Pa. Notably, our method signifies a paradigm shift as—to our knowledge—no prior machine learning approach has achieved precise predictions of complete wave fields within realistic domains.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Performance Evaluation of Peer-to-Peer Distributed Microgrids Coordination for Voltage Regulation

This paper presents the performance evaluation of a peer-to-peer microgrids coordination algorithm for sub-transmission systems. As distributed energy resources (DERs) in distribution system start to show negative impact to the bulk power system, a paradigm shift is needed for transmission planning and operation. Because distribution substations are located far from the sub-transmission system, and it is hard to use traditional centralized control for real-time control and coordination. Thus, distributed control is a natural choice because it requires less communication and central computation. In this paper, each distribution substation is treated as a microgrid, and the peer-to-peer distributed microgrids control is formulated as a real-time optimal power flow problem to reduce the negative impact in sub-transmission systems. A distributed primal-dual optimization algorithm is adopted to solve the problem. Validation of the peer-to-peer algorithm is performed through the simulation of a real-world sub-transmission system composing of many distribution systems with high renewable penetration. Simulation results show that the peer-to-peer algorithm can achieve satisfactory performance (e.g., voltage regulation) in sub-transmission system by coordinating and controlling DERs in distribution systems.

distributed control↗

Fan Noise Predictions of the NASA Source Diagnostic Test Using Unsteady Simulations with LAVA Part I: Near-Field Aerodynamics and Turbulence

A sliding mesh technique within the Launch, Ascent, and Vehicle Aerodynamics (LAVA) computational framework is validated using the experimental dataset collected as part of the NASA Source Diagnostic Test (SDT) campaign. Two modeling approaches are explored: the unsteady Reynolds-Averaged Navier Stokes (URANS) with Spalart-Allmaras (SA) turbulence model closure, and a hybrid Reynolds-Averaged Navier Stokes/Large Eddy Simulation (RANS/LES) paradigm employing a Zonal Detached Eddy Simulation (ZDES) closure with enhanced shielding protection. Fan stage performance metrics, aerodynamic quantities and turbulent flow structures are analyzed in this work. Initial studies focusing on grid and time-step sensitivity are presented. Sensitivity to different variants of the SA turbulence model is analyzed, supporting the use of the baseline SA model in the production runs. Two conditions are analyzed in detail using URANS and hybrid RANS/LES (HRLES). Mean flow quantities are well-captured by both methods in the low-speed (approach) regime. While URANS misses all the upstream-propagating noise in the inlet due to the rotor-locked tones being evanescent in nature at subsonic fan tip speeds, HRLES captures this broadband component in its pressure field. At the high-speed (sideline) condition, URANS shows better agreement with the SDT data than HRLES in the interstage flow-field. In this regime, URANS captures the tonal content propagating through the inlet, since the tones are now cut-on. Both methods are suitable to capture fan stage performance metrics and mean flow quantities, but only HRLES is able to resolve the fine turbulent structures responsible for broadband noise. The results support the use of the sliding mesh technique implemented in this work for future turbomachinery applications within the LAVA solver framework.

AATT↗

Fan Noise Predictions of the NASA Source Diagnostic Test Using Unsteady Simulations with LAVA Part I: Near-Field Aerodynamics and Turbulence

A sliding mesh technique within the Launch, Ascent, and Vehicle Aerodynamics (LAVA) computational framework is validated using the experimental dataset collected as part of the NASA Source Diagnostic Test (SDT) campaign. Two modeling approaches are explored: the unsteady Reynolds-Averaged Navier Stokes (URANS) with Spalart-Allmaras (SA) turbulence model closure, and a hybrid Reynolds-Averaged Navier Stokes/Large Eddy Simulation (RANS/LES) paradigm employing a Zonal Detached Eddy Simulation (ZDES) closure with enhanced shielding protection. Fan stage performance metrics, aerodynamic quantities and turbulent flow structures are analyzed in this work. Initial studies focusing on grid and time-step sensitivity are presented. Sensitivity to different variants of the SA turbulence model is analyzed, supporting the use of the baseline SA model in the production runs. Two conditions are analyzed in detail using URANS and hybrid RANS/LES (HRLES). Mean flow quantities are well-captured by both methods in the low-speed (approach) regime. While URANS misses all the upstream-propagating noise in the inlet due to the rotor-locked tones being evanescent in nature at subsonic fan tip speeds, HRLES captures this broadband component in its pressure field. At the high-speed (sideline) condition, URANS shows better agreement with the SDT data than HRLES in the interstage flow-field. In this regime, URANS captures the tonal content propagating through the inlet, since the tones are now cut-on. Both methods are suitable to capture fan stage performance metrics and mean flow quantities, but only HRLES is able to resolve the fine turbulent structures responsible for broadband noise. The results support the use of the sliding mesh technique implemented in this work for future turbomachinery applications within the LAVA solver framework.

AATT↗

Performance Evaluation of Peer-to-Peer Distributed Microgrids Coordination for Voltage Regulation: Preprint

This paper presents the performance evaluation of a peer-to-peer microgrids coordination algorithm for sub-transmission systems. As distributed energy resources (DERs) in distribution system start to show negative impact to the bulk power system, a paradigm shift is needed for transmission planning and operation. Because distribution substations are located far from the sub-transmission system, and it is hard to use traditional centralized control for real-time control and coordination. Thus, distributed control is a natural choice because it requires less communication and central computation. In this paper, each distribution substation is treated as a microgrid, and the peer-to-peer distributed microgrids control is formulated as a real-time optimal power flow problem to reduce the negative impact in sub-transmission systems. A distributed primal-dual optimization algorithm is adopted to solve the problem. Validation of the peer-to-peer algorithm is performed through the simulation of a real-world sub-transmission system composing of many distribution systems with high renewable penetration. Simulation results show that the peer-to-peer algorithm can achieve satisfactory performance (e.g., voltage regulation) in sub-transmission system by coordinating and controlling DERs in distribution systems.

distributed control↗

Display Sharing: An Alternative Paradigm

The current Johnson Space Center (JSC) Mission Control Center (MCC) Video Transport System (VTS) provides flight controllers and management the ability to meld raw video from various sources with telemetry to improve situational awareness. However, maintaining a separate infrastructure for video delivery and integration of video content with data adds significant complexity and cost to the system. When considering alternative architectures for a VTS, the current system's ability to share specific computer displays in their entirety to other locations, such as large projector systems, flight control rooms, and back supporting rooms throughout the facilities and centers must be incorporated into any new architecture. Internet Protocol (IP)-based systems also support video delivery and integration. IP-based systems generally have an advantage in terms of cost and maintainability. Although IP-based systems are versatile, the task of sharing a computer display from one workstation to another can be time consuming for an end-user and inconvenient to administer at a system level. The objective of this paper is to present a prototype display sharing enterprise solution. Display sharing is a system which delivers image sharing across the LAN while simultaneously managing bandwidth, supporting encryption, enabling recovery and resynchronization following a loss of signal, and, minimizing latency. Additional critical elements will include image scaling support, multi -sharing, ease of initial integration and configuration, integration with desktop window managers, collaboration tools, host and recipient controls. This goal of this paper is to summarize the various elements of an IP-based display sharing system that can be used in today's control center environment.

Brown, Michael A.↗

A hybrid data-driven and model-based approach for computationally efficient stochastic unit commitment and economic dispatch under wind and solar uncertainty

Stochastic unit commitment (UC) and economic dispatch (ED) are imperative in dealing with uncertainty in renewable forecast for power system operation and planning such that the overall expected production cost is minimized over the planning horizon. However, accurate calculation of the expected production cost requires assessment of a very large number of different scenarios of uncertain renewable resources, such as solar and wind, which is practically infeasible to simulate in real time. This article proposes a hybrid datadriven and physics-based model-predictive paradigm to efficiently solve for stochastic unit commitment and economic dispatch considering uncertainty in wind and solar power forecasts. Here, the novelty of the approach lies in decoupling the production cost estimation from the unit commitment and economic dispatch optimization problems under uncertainty without compromising on the fidelity of the solutions. A data-driven machine learning model is first developed to predict the mean optimal production cost. A physics-based inverse problem is then solved to get the stochastic UC and ED profiles from the expected cost. The presented approach considers, for the first time, solar uncertainty in UC/ED determination and enables efficient and accurate propagation of wind and solar uncertainty to estimate the statistics of the production cost. The effectiveness of the developed approach is demonstrated systematically on a stylized RTS-GMLC single-node system. The overall framework predicts the expected cost 62.5% more accurately than the existing state-of-the-art, on unforeseen days during the entire year, and yields, for the first time, the associated physically consistent UC and ED profiles. The solutions are also shown to be flexible in providing adequate daily reserves to address any statistical deviations from probabilistic power forecasts. The computational time associated with the presented method is only about 10 s compared to over 24 h needed for a conventional stochastic UC/ED determination under uncertainty on an Intel Core i9 processor with 32 GB of RAM.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

A Computational Review of Privacy-Preserving Mechanisms for the Smart Grid

Smart grid technologies have rapidly become one of the largest and most comprehensive sources of data for the modern utility. For the most part, data streams are seen as an essential tool that enable utilities to carry their day-to-day business operations, but they also create the need for efficient and secure data management strategies. In the context of the smart grid, ensuring data privacy is becoming an increasing concern due to a combination of factors that range from shifts in operational paradigms and rapid technology evolution to changes in legislation. Furthermore, researchers have highlighted the risks associated with improperly protected energy records. For example, energy consumption data from homes could be used to infer the behaviors and habits of home occupants through activity recognition or user profiling (Fan, 2017), which may lead to unfair service pricing, targeted advertising, or other personal security violations. Similarly, Electric Vehicles’ (EVs) charging metadata could be used to reveal private information about the owner such as their payment methods, preferred charging stations, and other locational and timing information that could be used to reconstruct the vehicle owner’s behaviors. The privacy of user data, even when used for statistical analysis or machine learning training processes, also needs to be carefully considered, as an individual’s private traits may still be vulnerable if their inclusion/exclusion greatly impacts the result or could be linked to a public dataset through cross-reference. The breach of user privacy also has severe impacts for organizations that store, transmit, or work on the data in the form of diminishing the public’s trust in them while potentially incurring legal consequences (e.g., fines and suspensions under the European Union General Data Protection Regulation, Health Insurance Portability and Accountability Act, etc.). Because of these risks, several privacy-preserving mechanisms are available to help organizations comply with privacy legislations and prevent the unauthorized and malicious use of user data. In light of these concerns, this report focuses on performing a computational review of privacy-preserving mechanisms that have received a significant amount of interest in literature. It specifically focuses on 1) homomorphic encryption, 2) zero-knowledge proofs, 3) differential privacy, and 4) federated learning. It is worth noting that although many of the methods presented in this document rely on cryptographic primitives, their intent is not to provide perfect secrecy, but rather to enable users to maintain privacy, and thus they shall not be compared or equated to other constructs that are aimed to address cybersecurity constructs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Increased accuracy of multiphysics simulations through flexible execution, transient algorithms, and modular physics

The MOOSE framework is a foundational capability used by the NEAMS program to create over 15 different simulation tools for advanced nuclear reactors. Due to MOOSE’s broad use, improvements to the framework in support of modeling and simulation goals are critical to the program. Such improvements can take many forms, including optimization, improved user experience, streamlined application programming interfaces (APIs), parallelism, and new capabilities. The work described in this report was conducted in direct support of the simulation tools and has already been deployed. The capabilities were implemented in the same order as they are covered in this report: multiple time integrators in the same input file, initial design of framework Components, an input file Application block, extension of NetGen to 3D geometries in MOOSE, and deployment of executors in the multi-system paradigm. These five additions are fundamental capabilities that will be leveraged by many NEAMS applications.

97 MATHEMATICS AND COMPUTING↗

Chemically Separable Ruthenium Hydride Isomers with Distinct Hydride Transfer Properties

Transition metal hydrides are key intermediates in biological and industrial catalysis, where control over hydride donor ability (hydricity) is essential for optimizing reactivity. Herein, we report a series of isomeric ruthenium hydrides in which the ligand trans to the ruthenium hydride bond–either an N-heterocyclic carbene or pyridine–modulates the thermodynamic hydricity by up to 8 kcal mol –1 . These hydrides exhibited distinct reactivity toward CO 2 and various organic hydride acceptors, enabling detailed kinetic and mechanistic analysis. Stopped-flow experiments, isotopic labeling, and computational studies supported an outer-sphere hydride transfer mechanism. Linear free energy relationships (LFERs) and Marcus relationships were utilized to correlate the changes in thermodynamics and kinetics, revealing that ligands with strong trans effects and trans influence can disrupt conventional scaling relationships, which can be a powerful strategy for promoting new reactivity paradigms in hydride transfer reactions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Stability analysis of multiple-robot control systems

In a space telerobotic service scenario, cooperative motion and force control of multiple robot arms are of fundamental importance. Three paradigms to study this problem are proposed. They are distinguished by the set of variables used for control design. They are joint torques, arm tip force vectors, and an accelerated generalized coordinate set. Control issues related to each case are discussed. The latter two choices require complete model information, which presents practical modeling, computational, and robustness problems. Therefore, focus is on the joint torque control case to develop relatively model independent motion and internal force control laws. The rigid body assumption allows the motion and force control problems to be independently addressed. By using an energy motivated Lyapunov function, a simple proportional derivative plus gravity compensation type of motion control law is always shown to be stabilizing. The asymptotic convergence of the tracing error to zero requires the use of a generalized coordinate with the contact constraints taken into account. If a non-generalized coordinate is used, only convergence to a steady state manifold can be concluded. For the force control, both feedforward and feedback schemes are analyzed. The feedback control, if proper care has been taken, exhibits better robustness and transient performance.

Wen, John T.↗

Dataflow Design Tool: User's Manual

The Dataflow Design Tool is a software tool for selecting a multiprocessor scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. The software tool implements graph-search algorithms and analysis techniques based on the dataflow paradigm. Dataflow analyses provided by the software are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool provides performance optimization through the inclusion of artificial precedence constraints among the schedulable tasks. The user interface and tool capabilities are described. Examples are provided to demonstrate the analysis, scheduling, and optimization functions facilitated by the tool.

Jones, Robert L., III↗

Feedback density and causal complexity of simulation model structure

Measures of simulation model complexity generally focus on outputs; we propose measuring the complexity of a model’s causal structure to gain insight into its fundamental character. This article introduces tools for measuring causal complexity. First, we introduce a method for developing a model’s causal structure diagram, which characterises the causal interactions present in the code. Causal structure diagrams facilitate comparison of simulation models, including those from different paradigms. Next, we develop metrics for evaluating a model’s causal complexity using its causal structure diagram. We discuss cyclomatic complexity as a measure of the intricacy of causal structure and introduce two new metrics that incorporate the concept of feedback, a fundamental component of causal structure. The first new metric introduced here is feedback density, a measure of the cycle-based interconnectedness of causal structure. The second metric combines cyclomatic complexity and feedback density into a comprehensive causal complexity measure. Finally, we demonstrate these complexity metrics on simulation models from multiple paradigms and discuss potential uses and interpretations. These tools enable direct comparison of models across paradigms and provide a mechanism for measuring and discussing complexity based on a model’s fundamental assumptions and design.

97 MATHEMATICS AND COMPUTING↗

Stabilizer Scars

Quantum many-body scars are eigenstates in nonintegrable isolated quantum systems that defy typical thermalization paradigms, violating the eigenstate thermalization hypothesis and quantum ergodicity. Here, we identify exact analytic scar solutions in a 2+1 dimensional lattice gauge theory in a quasi-1D limit as zero-magic resource stabilizer states. Our results also highlight the importance of magic resources for gauge theory thermalization, revealing a connection between computational complexity and quantum ergodicity.

eigenstate thermalization↗