Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Guaranteed performance”

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 415 records · Page 23
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

DIF3D-VARIANT 12.0: Updates and New Features

The DIF3D code has been a workhorse of fast reactor analysis work at Argonne National Laboratory for over 40 years. In 1995, a transport option called VARIANT was added to DIF3D to improve the flux solutions for fast reactor problems which we term DIF3D-VARIANT today. DIF3D-VARIANT performs nodal neutron transport calculations using P N or SP N theory in Cartesian and hexagonal two- and three-dimensional geometries. The limited computing capabilities of the time restricted DIF3D-VARIANT to use at most a 6 th order spatial approximation combined with a P3 flux approximation and P1 scattering kernel for a 33 group structure on most studied reactor problems. Computer capabilities have increased steadily since 1995 and today much larger space-angle-energy approximations are possible. This manuscript serves as an update to the theory section of the original DIF3D-VARIANT manual and details more than twenty years of changes made to DIF3D to make version 12 which was released on November 1 st , 2024. The primary focus of the initial work was to extend the space-angle approximations available in DIF3D-VARIANT such that the error due to transport approximations could be better understood. This work was started and completed in 2002 and marked the official version 10. Unfortunately, those higher order approximations could not be used at that time due to the memory constraints of the BPOINTER part of DIF3D (limited to 2 GB). In version 11, completed in 2012, BPOINTER was circumvented in DIF3D-VARIANT for the largest arrays by introducing a Fortran 90 module called LMA (Large Memory Array). This seamlessly replaces all of the functionality of the BPOINTER concept, but it allows 64 bit addressing for every array such that they can be larger than 2 GB. It is now common for DIF3D-VARIANT jobs to consume 50 GB of memory on modern workstations when using high order space-angle approximations and a large number of groups. Many improvements were made to version 11 from 2012 to 2022 when work to create version 12 started. For version 12, several parts of DIF3D were updated to improve performance and thread parallelism was introduced to further reduce the runtime. Numerous minor bugs were discovered in DIF3D-VARIANT as part of the process of creating the perturbation and sensitivity code PERSENT. All of these algorithmic problems were identified in the transition from version 10 to version 11 which prevented DIF3D-VARIANT from running efficiently and reliably. Firstly, the coarse mesh rebalance scheme would routinely diverge and a study detailed in this report demonstrates how it was also typically not effective. This is not a failure of the coarse mesh rebalance methodology, but a failure of its implementation in DIF3D-VARIANT for hexagonal geometries. The fission source extrapolation algorithm was also found to be unreliable on larger group structure problems, leading to divergence in some cases and a negligible improvement in performance overall. Finally, the “Omega” acceleration applied to the partial current solver routine of DIF3D-VARIANT was found to cause DIF3D-VARIANT to converge to the wrong answer. To resolve these issues, both the coarse mesh rebalance and fission source extrapolation were permanently disabled in version 11. The Tchebychev acceleration was put in as a temporary reliable alternative but it is generally inferior to coarse mesh rebalance or coarse mesh finite difference. For the Omega acceleration, the factor was restricted to guarantee that it would not cause follow-on errors in PERSENT. Due to limited funding to support maintenance and development of DIF3D in the last 10 years, no effort was spent since to resolve the outer iteration acceleration. Except for the threading work, all of the changes discussed in this manuscript refer to changes made between version 10 and version 11. Performance comparisons are done to demonstrate the improvements from version 9 to version 12. As will be demonstrated, the updated versi

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

Sparse Control Synthesis for Uncertain Responsive Loads With Stochastic Stability Guarantees

In this report, recent studies have demonstrated the potential of flexible loads in providing frequency response services, predominantly due to their availability and cost-effectiveness. However, uncertainty and variability in various weather-related and end-use behavioral factors often impact the reliability of demand-side control performance. This work addresses this problem with the design of a demand-side control to achieve frequency response under load uncertainties. Our approach involves modeling the load uncertainties via stochastic processes that appear as both multiplicative and additive in the power system dynamics. Recently developed mean square exponential stability (MSES) results for continuous-time linear stochastic systems are applied to pose the control synthesis problem which results in an LMI-based optimization problem. Additional costs and constraints are added to the LMI-based controller synthesis to ensure MSES, improve closed-loop transient performance, maximize tolerable uncertainties, and promote sparsity in the controller. Additionally, the fundamental limitations between the tolerable uncertainties and control efforts while ensuring MSES are discussed. Further, the control synthesis problem for the case of the full-state measurement is generalized to the case of partial-state measurements. The proposed control synthesis is illustrated on an IEEE 39 bus system with rigorous studies to demonstrate the role of sparsity, closed-loop transient performance, tolerable uncertainties, and control efforts while ensuring MSES and achieving frequency response.

42 ENGINEERING↗
DOE OSTI2024

DS-GL: Advancing Graph Learning via Harnessing the Power of Nature within Dynamic Systems

With the rapid digitization of the world, an increasing number of real-world applications are turning to nonEuclidean data, modeled as graphs. Due to their intrinsic high complexity and irregularity, learning from graph data demands tremendous computational power. Recently, CMOS-compatible Ising machines, i.e., dynamic systems composed of CMOS components, have emerged as a new approach that harnesses the inherent power of natural annealing within dynamic systems to efficiently resolve binary optimization problems and have been adopted for traditional graph computation, such as max-cut. However, when performing complex Graph Learning (GL) tasks, Ising machines face significant hurdles: (i) they are inherently binary and thus ill-suited for real-valued problems; (ii) their expensive all-to-all coupling network that guarantees effective natural annealing poses daunting scalability concerns. To address these challenges, this paper proposes a nature-powered graph learning framework dubbed DS-GL, which is the first effort to transform the process of solving graph learning problems into the natural annealing process within a parameterized dynamic system embodied as a CMOS chip. To tackle the two major hurdles, DS-GL first augments the Ising machine architecture to modify the self-reaction term of its Hamiltonian function from linear to quadratic, effectively serving as an energy regulator. This adjustment maintains the system’s original physical interpretation while enabling it to process continuous, real-valued data. Second, to address the scaling issue, DS-GL further upgrades the real-valued dense Ising machine by decomposing it into a mesh-based multi-PE dynamic system that supports efficient distributed spatial-temporal co-annealing across different PEs through sparse interconnects. By exploiting the inherent sparsity and component structures in real-world graphs, DS-GL is able to map complex graph learning tasks onto the scalable dynamic system while maintaining high accuracy. Evaluations with three diverse GL applications across six real-world datasets, including traffic flow and COVID-19 prediction, show that DS-GL can deliver from 102× to 106× speedups and 500× energy reduction over Graph Neural Networks on GPUs, with 5% - 20% accuracy enhancement.

Song, Ruibing↗
DOE OSTI2023

Methods for Analysis and Quantification of Power System Resilience

This paper summarizes the report prepared by an IEEE PES Task Force. Resilience is a fairly new technical concept for power systems, and it is important to precisely delineate this concept for actual applications. As a critical infrastructure, power systems have to be prepared to survive rare but extreme incidents (natural catastrophes, extreme weather events, physical/cyber-attacks, equipment failure cascades, etc.) to guarantee power supply to the electricity-dependent economy and society. Thus, resilience needs to be integrated into planning and operational assessment to design and operate adequately resilient power systems. Quantification of resilience as a key performance indicator is important, together with costs and reliability. Quantification can analyze existing power systems and identify resilience improvements in future power systems. Given that a 100% resilient system is not economic (or even technically achievable), the degree of resilience should be transparent and comprehensible. Several gaps are identified to indicate further needs for research and development.

42 ENGINEERING↗
NASA NTRS2009

Compositional Verification of a Communication Protocol for a Remotely Operated Vehicle

This paper presents the specification and verification in the Prototype Verification System (PVS) of a protocol intended to facilitate communication in an experimental remotely operated vehicle used by NASA researchers. The protocol is defined as a stack-layered com- position of simpler protocols. It can be seen as the vertical composition of protocol layers, where each layer performs input and output message processing, and the horizontal composition of different processes concurrently inhabiting the same layer, where each process satisfies a distinct requirement. It is formally proven that the protocol components satisfy certain delivery guarantees. Compositional techniques are used to prove these guarantees also hold in the composed system. Although the protocol itself is not novel, the methodology employed in its verification extends existing techniques by automating the tedious and usually cumbersome part of the proof, thereby making the iterative design process of protocols feasible.

Goodloe, Alwyn E.↗
NASA NTRS2016

Comparison of Simultaneous PIV and Hydroxyl Tagging Velocimetry in Low Velocity Flows

Hydroxyl tagging velocimetry (HTV) is a molecular tagging velocimetry (MTV) technique that relies on the photo- dissociation of water vapor into OH radicals and their subsequent tracking using laser-induced fluorescence. At ambient temperature in air, the OH species lifetime is about 50 micro-s. The feasibility of using HTV for probing low- speed flows (a few m/s) is investigated by using an inert, heated gas as a means to increase the OH species lifetime. Unlike particle-based techniques, MTV does not suffer from tracer settling, which is particularly problematic at low speeds. Furthermore, the flow needs to be seeded with only a small mole fraction of water vapor, making it safer for both the user and facilities than other MTV techniques based on corrosive or toxic chemical tracers. HTV is demonstrated on a steam-seeded nitrogen jet at approximately 75 C in the laminar (Umean=3.31 m/s, Re=1,540), transitional (Umean=4.48 m/s, Re=2,039), and turbulent (Umean=6.91 m/s, Re=3,016) regimes at atmospheric pressure. The measured velocity profiles are compared with particle image velocimetry (PIV) measurements performed simultaneously with a second imager. Seeding for the PIV is achieved by introducing micron-sized water droplets into the flow with the steam; the same laser sheet is used for PIV and HTV to guarantee spatial and temporal overlap of the data. Optimizing each of these methods, however, requires conflicting operating conditions: higher temperatures benefit the HTV signals but reduce the available seed density for the PIV through evaporation. Nevertheless, data are found to agree within 10% for the instantaneous velocity profiles and within 5% for the mean profiles and demonstrate the feasibility of HTV for low-speed flows at moderate to high temperatures.

Andre, Matthieu A.↗
NASA NTRS2024

Generating Dominating Sets Using Locally Defined Centrality Measures

The dominating set problem has many practical applications but is well-known to be NP-hard. Therefore, there is a need for efficient heuristic algorithms, especially in applications such as ad hoc wireless networks. Most distributed algorithms proposed in the literature assume that each node has knowledge of the network structure. We propose a distributed heuristic algorithm that uses two rounds of communication, and where each node has only local information, both in terms of network structure and dominating set assignment. First, each node calculates a local centrality measure to determine whether it is part of the dominating set D. The second round guarantees D is a dominating set by adding any non-dominated nodes. We compare several centrality measures and show that the Shapley centrality, derived from the Shapley value in game theory, is theoretically motivated and performs well in practice on several synthetic and real-world networks.

Network↗
DOE OSTI2023

Complementarity and the unitarity of the black hole S -matrix

Recently, Akers et al. proposed a non-isometric holographic map from the interior of a black hole to its exterior. Within this model, we study properties of the black hole S-matrix, which are in principle accessible to observers who stay outside the black hole. Specifically, we investigate a scenario in which an infalling agent interacts with radiation both outside and inside the black hole. Because the holographic map involves postselection, the unitarity of the S-matrix is not guaranteed in this scenario, but we find that unitarity is satisfied to very high precision if suitable conditions are met. If the internal black hole dynamics is described by a pseudorandom unitary transformation, and if the operations performed by the infaller have computational complexity scaling polynomially with the black hole entropy, then the S-matrix is unitary up to corrections that are superpolynomially small in the black hole entropy. Furthermore, while in principle quantum computation assisted by postselection can be very powerful, we find under similar assumptions that the S-matrix of an evaporating black hole has polynomial computational complexity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2027

Nodal capacity expansion planning with flexible large-scale load siting

We propose explicitly incorporating large-scale load siting into a stochastic nodal power system capacity expansion planning model that concurrently co-optimizes generation, transmission, and storage expansion. The potential operational flexibility of some of these large loads is also taken into account by considering them as consisting of a set of tranches with different reliability requirements, which are modeled as a constraint on expected served energy across operational scenarios. We implement our model as a two-stage stochastic mixed-integer optimization problem with cross-scenario expectation constraints. To overcome the challenge of scalability, we build upon existing work to implement this model on a high performance computing platform and exploit scenario parallelization using an augmented Progressive Hedging Algorithm. The algorithm is implemented using the bounding features of mpisppy, which have shown to provide satisfactory provable optimality gaps despite the absence of theoretical guarantees of convergence. We test our approach and assess the value of this proactive planning framework on total system cost and reliability metrics using realistic testcases geographically assigned to San Diego and South Carolina, with datacenter and direct air capture facilities as large loads.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1990

Ridge Regression Signal Processing

The introduction of the Global Positioning System (GPS) into the National Airspace System (NAS) necessitates the development of Receiver Autonomous Integrity Monitoring (RAIM) techniques. In order to guarantee a certain level of integrity, a thorough understanding of modern estimation techniques applied to navigational problems is required. The extended Kalman filter (EKF) is derived and analyzed under poor geometry conditions. It was found that the performance of the EKF is difficult to predict, since the EKF is designed for a Gaussian environment. A novel approach is implemented which incorporates ridge regression to explain the behavior of an EKF in the presence of dynamics under poor geometry conditions. The basic principles of ridge regression theory are presented, followed by the derivation of a linearized recursive ridge estimator. Computer simulations are performed to confirm the underlying theory and to provide a comparative analysis of the EKF and the recursive ridge estimator.

Kuhl, Mark R.↗
NASA NTRS2015

Evaluation of the 7-km GEOS-5 Nature Run

This report documents an evaluation by the Global Modeling and Assimilation Office (GMAO) of a two-year 7-km-resolution non-hydrostatic global mesoscale simulation produced with the Goddard Earth Observing System (GEOS-5) atmospheric general circulation model. The simulation was produced as a Nature Run for conducting observing system simulation experiments (OSSEs). Generation of the GEOS-5 Nature Run (G5NR) was motivated in part by the desire of the OSSE community for an improved high-resolution sequel to an existing Nature Run produced by the European Centre for Medium-Range Weather Forecasts (ECMWF), which has served the community for several years. The intended use of the G5NR in this context is for generating simulated observations to test proposed observing system designs regarding new instruments and their deployments. Because NASA's interest in OSSEs extends beyond traditional weather forecasting applications, the G5NR includes, in addition to standard meteorological components, a suite of aerosol types and several trace gas concentrations, with emissions downscaled to 10 km using ancillary information such as power plant location, population density and night-light information. The evaluation exercise described here involved more than twenty-five GMAO scientists investigating various aspects of the G5NR performance, including time mean temperature and wind fields, energy spectra, precipitation and the hydrological cycle, the representation of waves, tropical cyclones and midlatitude storms, land and ocean surface characteristics, the representation and forcing effects of clouds and radiation, dynamics of the stratosphere and mesosphere, and the representation of aerosols and trace gases. Comparisons are made with observational data sets when possible, as well as with reanalyses and other long model simulations. The evaluation is broad in scope, as it is meant to assess the overall realism of basic aspects of the G5NR deemed relevant to the conduct of OSSEs. However, because of the relatively short record and other practical considerations, these comparisons cannot provide a definitive, statistically sound assessment of all model deficiencies, or guarantee the G5NR's suitability for all OSSE applications. Differences between the observed and simulated behavior also must be judged in the context of basic internal atmospheric variability which can introduce variations that are not necessarily controlled by the prescribed sea surface temperatures used in generating the G5NR. The results show that the G5NR performs well as measured by the majority of metrics applied in this evaluation. Particular benefits derived from the 7-km resolution of G5NR include realistic representations of extreme weather events in both the tropics and extratropics including tropical cyclones, Nor'easters and mesoscale convective complexes; improved representation of the diurnal cycle of precipitation over land; well-resolved surface-atmosphere interactions such as katabatic wind flows over Antarctica and Greenland; and resolution of orographically generated gravity waves that propagate into the upper atmosphere and influence the large scale circulation. Obvious deficiencies in the G5NR include a "splitting" of the inter-tropical convergence zone, which leads to a weaker-than-observed Hadley circulation and related deficiencies in the depiction of stationary wave patterns. Also, while the G5NR captures global cloud features and radiative effects well in general, close comparison with observations reveals higher-than-observed cloud brightness, likely due to an overabundance of cloud condensate; less distinct cloud minima in subtropical subsidence zones, consistent with a weak Hadley circualtion; and too few near-coastal marine stratocumulus clouds.

GEOS-5↗
DOE OSTI2025

Randomized Preconditioned Solvers for Strong Constraint 4D-Var Data Assimilation

The Strong Constraint 4D Variational (SC-4DVAR) data assimilation method is widely used in climate and weather applications. SC-4DVAR involves solving a minimization problem to compute the maximum a posteriori estimate, which we tackle using the Gauss-Newton method. The computation of the descent direction is expensive since it involves the solution of a large-scale and potentially ill-conditioned linear system, solved using the preconditioned conjugate gradient (PCG) method. Here, to address this cost, we efficiently construct scalable preconditioners using three different randomization techniques, which all rely on a certain low-rank structure involving the Gauss-Newton Hessian. The proposed techniques come with theoretical guarantees on the condition number, and at the same time, are amenable to parallelization. We also develop an adaptive approach to estimate the sketch size and choose between the reuse or recomputation of the preconditioner. We demonstrate the performance and effectiveness of our methodology on two representative model problems—the Burgers and barotropic vorticity equation—showing a drastic reduction in both the number of PCG iterations and the number of Gauss-Newton Hessian products after including the preconditioner construction cost.

Gauss-Newton↗
NASA NTRS1992

A simple, effective media access protocol system for integrated, high data rate networks

The operation and performance of a dual media access protocol for integrated, gigabit networks are described. Unlike other dual protocols, each protocol supports a different class of traffic. The Carrier Sensed Multiple Access-Ring Network (CSMA/RN) protocol and the Circulating Reservation Packet (CRP) protocol support asynchronous and synchronous traffic, respectively. The two protocols operate with minimal impact upon each other. Performance information demonstrates that they support a complete range of integrated traffic loads, do not require call setup/termination or a special node for synchronous traffic control, and provide effective pre-use and recovery. The CRP also provides guaranteed access and fairness control for the asynchronous system. The paper demonstrates that the CSMA-CRP system fulfills many of the requirements for gigabit LAN-MAN networks most effectively and simply. To accomplish this, CSMA-CRP features are compared against similar ring and bus systems, such as Cambridge Fast Ring, Metaring, Cyclic Reservation Multiple Access, and Distributed Dual Queue Data Bus (DQDB).

Foudriat, E. C.↗
DOE OSTI2022

A Data-Driven Algorithm for Enabling Delay Tolerance in Resilient Microgrid Controls Using Dynamic Mode Decomposition

The increased implementation of smart grid technologies in the power distribution grid presents unique opportunities that enable resiliency, but also brings challenges motivating needs for novel solutions and mitigation techniques. The bi-directional power and data flow allow for the grid to operate with increased resiliency, which is the ability to avoid discontinuity of service to end-use loads during extreme events. However, in applications where control of the distribution grid or microgrid relies on communication networks, the degradation of communication systems in the form of loss or high latency can cause maloperation and result in loss of end-use loads. Here this paper presents a novel framework to enable delay tolerance of centralized microgrid control schemes to mitigate communication system latency impacts and guarantee successful control action. We demonstrate the delay tolerance on a control scheme that operates a battery energy storage system (BESS) to offset the sudden loss of generation and maintain system frequency. During periods of severely degraded communication system performance, the proposed delay-tolerant algorithm compensates for the latency by utilizing a data-driven model generated at the device level using dynamic mode decomposition (DMD) to determine the performance of the communications. The DMD technique predicts the system’s frequency using device-level terminal measurements and provides updated control signals. The HELICS cosimulation platform evaluates the cyber-physical interaction of the power system model in GridLAB-D, the centralized control agent in Python, and the discrete network model in NS-3. The framework is tested and validated on the IEEE-123 node system modified to represent a networked remote microgrid model, and the results show an improvement in the dynamic performance

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1987

Software reliability perspectives

Software which is used in life critical functions must be known to be highly reliable before installation. This requires a strong testing program to estimate the reliability, since neither formal methods, software engineering nor fault tolerant methods can guarantee perfection. Prior to the final testing software goes through a debugging period and many models have been developed to try to estimate reliability from the debugging data. However, the existing models are poorly validated and often give poor performance. This paper emphasizes the fact that part of their failures can be attributed to the random nature of the debugging data given to these models as input, and it poses the problem of correcting this defect as an area of future research.

Wilson, Larry↗
NASA NTRS1992

A method for planning collision free trajectories for two cooperating robots

Robotic systems designed specifically for space applications often exhibit a high level of autonomy to reduce the costs associated with having humans in space. This paper presents a method for autonomously planning collision free paths for two cooperating robots in a static environment. The method performs selective mapping of configuration space while attempting to locate a safe path. The method is based around an algorithm aimed at transversing a space of arbitrary dimension which contains both safe and unsafe regions. While the procedure cannot guarantee finding a solution even if one may exist, it is intended to find a solution to many practical path planning problems within a reasonable amount of time. Results are presented for applying the procedure to two cooperating six degree of freedom manipulators (Puma 560s).

Weaver, Jonathan M.↗
NASA NTRS1989

Application of statistical distribution theory to launch-on-time for space construction logistic support

The ability to launch-on-time and to send payloads into space has progressed dramatically since the days of the earliest missile and space programs. Causes for delay during launch, i.e., unplanned 'holds', are attributable to several sources: weather, range activities, vehicle conditions, human performance, etc. Recent developments in space program, particularly the need for highly reliable logistic support of space construction and the subsequent planned operation of space stations, large unmanned space structures, lunar and Mars bases, and the necessity of providing 'guaranteed' commercial launches have placed increased emphasis on understanding and mastering every aspect of launch vehicle operations. The Center of Space Construction has acquired historical launch vehicle data and is applying these data to the analysis of space launch vehicle logistic support of space construction. This analysis will include development of a better understanding of launch-on-time capability and simulation of required support systems for vehicle assembly and launch which are necessary to support national space program construction schedules. In this paper, the author presents actual launch data on unscheduled 'hold' distributions of various launch vehicles. The data have been supplied by industrial associate companies of the Center for Space Construction. The paper seeks to determine suitable probability models which describe these historical data and that can be used for several purposes such as: inputs to broader simulations of launch vehicle logistic space construction support processes and the determination of which launch operations sources cause the majority of the unscheduled 'holds', and hence to suggest changes which might improve launch-on-time. In particular, the paper investigates the ability of a compound distribution probability model to fit actual data, versus alternative models, and recommends the most productive avenues for future statistical work.

Morgenthaler, George W.↗
NASA NTRS1994

Control of the SCOLE configuration using distributed parameter models

A continuum model for the SCOLE configuration has been derived using transfer matrices. Controller designs for distributed parameter systems have been analyzed. Pole-assignment controller design is considered easy to implement but stability is not guaranteed. An explicit transfer function of dynamic controllers has been obtained and no model reduction is required before the controller is realized. One specific LQG controller for continuum models had been derived, but other optimal controllers for more general performances need to be studied.

Hsiao, Min-Hung↗