Security Constrained Uncertainty Interval Estimation using Sensitivity Trajectories in Dynamical Systems
Explore the source record for details and available documents.
SEARCH · Search NASA
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.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
A generative modeling framework is proposed that combines diffusion models and manifold learning to efficiently sample data densities on manifolds. The approach utilizes Diffusion Maps to uncover possible low-dimensional underlying (latent) spaces in the high-dimensional data (ambient) space. Two approaches for sampling from the latent data density are described. The first is a score-based diffusion model, which is trained to map a standard normal distribution to the latent data distribution using a neural network. The second one involves solving an Itô stochastic differential equation in the latent space. Additional realizations of the data are generated by lifting the samples back to the ambient space using Double Diffusion Maps , a recently introduced technique typically employed in studying dynamical system reduction; here the focus lies in sampling densities rather than system dynamics. The proposed approaches enable sampling high dimensional data densities restricted to low-dimensional, a priori unknown manifolds. The efficacy of the proposed framework is demonstrated through a benchmark problem and a material with multiscale structure.
Off-road vehicles, such as wheel loaders, excavators, and harvesters, are extensively utilized across a wide range of industries, including construction, agriculture, and mining. These machines have become indispensable in supporting the day-to-day operational needs of a nation, playing a critical role in various sectors' infrastructure and productivity. However, despite their utility, off-road vehicles are significant consumers of fossil fuels, resulting in substantial emissions that contribute to environmental degradation. This highlights the pressing need for research and technological advancements aimed at improving their energy efficiency and reducing their carbon footprint. There are, however, two primary challenges that must be addressed to achieve these goals. First, off-road vehicles typically perform both driving and working tasks simultaneously, which introduces a high level of complexity into their overall dynamic systems. Analysis the interactions between these functions is challenging. Second, research into off-road vehicles is inherently interdisciplinary, demanding expertise across several domains such as fluid power systems, vehicle dynamics, control theory, optimization techniques, and real-world implementation. Recognizing these challenges, we proposed the project titled "Optimization and Evaluation of Energy Savings for Connected and Autonomous Off-Road Vehicles" as a comprehensive solution to enhance fuel efficiency while simultaneously improving productivity. This project specifically focuses on autonomous off-road vehicles, with particular attention to wheel loaders, and seeks to develop novel methods to optimize energy consumption without sacrificing operational performance. The project integrates real-time control algorithms, vehicle dynamics modeling, and co-optimization of powertrain system and vehicle system to achieve these goals. Our optimization strategy dynamically co-optimizes critical parameters at both the powertrain and vehicle levels, including vehicle speed, working tool movements, powertrain dynamics, and engine operations in real-time. To streamline this optimization process, we developed a vehicle model that captures the key dynamics while significantly enhancing computational efficiency. This allows the system to intelligently minimize fuel consumption, all while maintaining or even improving productivity through real-time calculations during various off-road operations. To validate the effectiveness of this energy optimization method, we introduced a state-of-the-art Hardware-in-the-Loop (HIL) testbed. This reconfigurable testbed seamlessly integrates the actual engine with virtual models of the wheel loader's subsystems, allowing for accurate emulation of real-world operational loads and environments. By simulating these conditions, the HIL testbed enables us to evaluate the wheel loader’s performance under diverse working scenarios, ensuring the developed solution is applicable in real-world operations. This testbed proved to be instrumental in validating the optimization algorithms and demonstrating the system's practical effectiveness. During the evaluation and testing phase, we employed the HIL testbed to rigorously assess the energy savings and productivity improvements generated by the optimized system. The results were highly encouraging, revealing that the automated wheel loader achieved over 30% fuel savings compared to traditional, human-operated cycles, with comparable or even enhanced levels of productivity. The insights gained from this HIL-based testing provided critical validation of our approach and highlighted the potential for deploying these optimized autonomous technologies in real-world off-road vehicles.
Industrial control systems (ICSs) increasingly rely on digital technologies vulnerable to cyber attacks. Cyber attackers can infiltrate ICSs and execute malicious actions. Individually, each action seems innocuous. But taken together, they cause the system to enter an unsafe state. These attacks have resulted in dramatic consequences such as physical damage, economic loss, and environmental catastrophes. This paper introduces a methodology that restricts actions using protocols. These protocols only allow safe actions to execute. Protocols are written in a domain specific language we have embedded in an interactive theorem prover (ITP). The ITP enables formal, machine-checked proofs to ensure protocols maintain safety properties. We use dynamic attestation to ensure ICSs conform to their protocol even if an adversary compromises a component. Since protocol conformance prevents unsafe actions, the previously mentioned cyber attacks become impossible. We demonstrate the effectiveness of our methodology using an example from the Fischertechnik Industry 4.0 platform. We measure dynamic attestation's impact on latency and throughput. Our approach is a starting point for studying how to combine formal methods and protocol design to thwart attacks intended to cripple ICSs.
Traffic congestion has substantially induced significant mobility and energy inefficiency. Many research challenges are identified in traffic signal control and management associated with artificial intelligence (AI)-based models. For example, developing AI-driven dynamic traffic system models that accurately capture high-resolution traffic attributes and formulate robust control algorithms for traffic signal optimization is difficult. Additionally, uncertainties in traffic system modeling and control processes can further complicate traffic signal system controllability. To partially address these challenges, this study presents a novel, hybrid neural network model enhanced with a probability density function kernel shaping technique to formulate traffic system dynamics better and improve comprehensive traffic network modeling and control. The numerical experimental tests were conducted, and the results demonstrate that the proposed control approach outperforms the baseline control strategies and reduces overall average delays by 11.64% on average. By leveraging the capabilities of this innovative model, this study aims to address major challenges related to traffic congestion and energy inefficiency toward more effective and adaptable AI-based traffic control systems.
Dynamic programming algorithms within the NUPACK software suite enable analysis of equilibrium base-pairing properties for complex and test tube ensembles containing arbitrary numbers of interacting nucleic acid strands. Currently, calculations are limited to single-material systems that are either all-RNA or all-DNA. Here, to enable analysis of mixed-material systems that are critical for modern applications in vitro, in situ, and in vivo, we develop physical models and dynamic programming algorithms that allow the material of the system to be specified at nucleotide resolution. Free energy parameter sets are constructed for both RNA/DNA and RNA/2'OMe-RNA mixed-material systems by combining available empirical mixed-material parameters with single-material parameter sets to enable treatment of the full complex and test tube ensembles. New dynamic programming recursions account for the material of each nucleotide throughout the recursive process. For a complex with N nucleotides, the mixed-material dynamic programming algorithms maintain the O(N 3 ) time complexity of the single-material algorithms, enabling efficient calculation of diverse physical quantities over complex and test tube ensembles (e.g., complex partition function, equilibrium complex concentrations, equilibrium base-pairing probabilities, minimum free energy secondary structure(s), and Boltzmann-sampled secondary structures) at a cost increase of roughly 2.0-3.5×. The results of existing single-material algorithms are exactly reproduced when applying the new mixed-material algorithms to single-material systems. Accuracy is significantly enhanced using mixed-material models and algorithms to predict RNA/DNA and RNA/2'OMe-RNA duplex melting temperatures from the experimental literature as well as RNA/DNA melt profiles from new experiments. In conclusion, mixed-material analyses can be performed online using the NUPACK web app (www.nupack.org) or locally using the NUPACK Python module.
Dynamic electrochemical impedance spectroscopy (dEIS) utilizes a superimposed multi-sinusoidal waveform and enables temporally resolved investigations on various electrochemical processes; however, the signal-to-noise ratio must be maximized while retaining linearity and stationarity within the system. In the present work, we probe the impact of the waveform’s total amplitude as well as the waveform and phase profiles. The equal amplitude multi-sinusoidal waveform with 35 mV total amplitude (<1 mV per frequency) and random phase profile exhibits the lowest impedance noise. This input signal is sufficient in avoiding the high frequency signal attenuation from the potentiostat’s low-pass filter. Additionally, we demonstrate the optimized dEIS waveform’s utility in investigating surface passivation within thin-film and composite silicon (Si) anodes. Within a two-electrode Si-lithium metal coin cell, the charge transfer resistance (RCT) associated with alloying kinetics dominates the overall impedance. RCT increases with state of charge indicating a kinetic bottleneck at higher lithiation states. To explore this further, we utilize a three-electrode Si-LiNi0.8Mn0.1Co0.1O2 pouch cell to deconvolute the Si impedance contributions. The evolution of the solid electrolyte interphase (SEI) and charge transfer resistances correlate to specific Li–Si alloy phases. We attribute this to the influence of Si particle volume expansion on SEI instabilities and a kinetic bottleneck at higher lithiation states.
Dynamic optimization problems arise in many applications including flow control, full waveform inversion, and medical imaging. These problems are plagued by significant computational challenges. One such challenge — and the focus of this work — is the memory limitation induced by the size of the underlying dynamical system. In particular, the entire dynamic trajectory is required for derivative computation and therefore must be stored or recomputed using, e.g., checkpointing. Although recent work demonstrated the use of adaptive randomized sketching to overcome the memory challenge, that work only applies to smooth unconstrained problems, prohibiting its use for nonsmooth regularized and constrained problems. The inclusion of nonsmooth regularizers and constraints is critical as they often arise in an attempt to preserve certain physical properties or to promote sparsity. To solve these problems, we introduce a trust-region algorithm for minimizing the sum of a smooth nonconvex function and a nonsmooth convex function that leverages randomized sketching to compress the dynamical system trajectories and adaptively adjust the sketch rank to satisfy a gradient inexactness condition. We prove convergence of this algorithm and demonstrate that it achieves substantial memory reduction on three discretized PDE-constrained optimization applications.
This report summarizes the activities of this project, which aims at design and testing a scalable, robust, and online framework that provides secure monitoring of photovoltaic generation in the face of potential cyber-attacks.
A new helium recapture and reliquefaction system, consisting of a gas bag, recapture manifold, cooling chiller, cryogenic purifier and, a gas storage cylinder banks, has been installed in the dynamic nuclear polarized target lab at the University of New Hampshire. This new system has the capability to improve the efficiency of our capacity to do target polarization runs by recycling our cryogenic helium which would otherwise be lost during polarization operations. Our helium liquefier is rated upto 40 L/Day under normal full-capacity operations, and is rated for a capacity of 500 liquid liters of helium. I explain the initial installation process followed by a discussion of the challenges with installation, including issues of impurities which appeared during the initial operation of the system. Then I discuss how we overcame these difficulties. Finally, I discuss the function of the system during normal operation and the present situation of the helium recapture and reliquefaction processing in the UNH Lab.
The operation of instruments and detectors in laboratory or beamline environments presents a complex challenge, requiring stable operation of multiple concurrent devices, often controlled by separate hardware and software solutions. These environments frequently undergo modifications, such as the inclusion of different auxiliary devices depending on the experiment or facility, adding further complexity. The successful management of such dynamic configurations demands a flexible and robust system capable of controlling data acquisition, monitoring experimental setups, enabling seamless reconfiguration, and integrating new devices with limited effort. This paper presents Constellation, a flexible and network-distributed control and data acquisition software framework tailored to laboratory and beamline environments, that addresses the limitations of existing solutions. The framework is designed with a focus on extensibility, providing a streamlined interface for instrument integration. It supports efficient system setup via network discovery mechanisms, promotes stability through autonomous operational features, and provides comprehensive documentation and supporting tools for operators and application developers such as controllers and logging interfaces. At the core of the architectural design is the autonomy of the individual components, called satellites, which can make independent decisions about their operation and communicate these decisions to other components. This paper introduces the design principles and framework architecture of Constellation, presents the available graphical user interfaces, shares insights from initial successful deployments, and provides an outlook on future developments and applications.
Abstract The effective inclusion of a priori knowledge when embedding known data in physics‐based models of dynamical systems can ensure that the reconstructed model respects physical principles, while simultaneously improving the accuracy of the solution in the previously unseen regions of state space. This paper presents a physics‐constrained data‐driven discrepancy modeling method that variationally embeds known data in the modeling framework. The hierarchical structure of the method yields fine scale variational equations that facilitate the derivation of residuals which are comprised of the first‐principles theory and sensor‐based data from the dynamical system. The embedding of the sensor data via residual terms leads to discrepancy‐informed closure models that yield a method which is driven not only by boundary and initial conditions, but also by measurements that are taken at only a few observation points in the target system. Specifically, the data‐embedding term serves as residual‐based least‐squares loss function, thus retaining variational consistency. Another important relation arises from the interpretation of the stabilization tensor as a kernel function, thereby incorporating a priori knowledge of the problem and adding computational intelligence to the modeling framework. Numerical test cases show that when known data is taken into account, the data driven variational (DDV) method can correctly predict the system response in the presence of several types of discrepancies. Specifically, the damped solution and correct energy time histories are recovered by including known data in the undamped situation. Morlet wavelet analyses reveal that the surrogate problem with embedded data recovers the fundamental frequency band of the target system. The enhanced stability and accuracy of the DDV method is manifested via reconstructed displacement and velocity fields that yield time histories of strain and kinetic energies which match the target systems. The proposed DDV method also serves as a procedure for restoring eigenvalues and eigenvectors of a deficient dynamical system when known data is taken into account, as shown in the numerical test cases presented here.
Direct statistical simulation (DSS) of nonlinear dynamical systems bypasses the traditional route of accumulating statistics by lengthy direct numerical simulations by solving the equations that govern the statistics themselves. DSS suffers, however, from the curse of dimensionality as the statistics (such as correlations) generally have higher dimensions than the underlying dynamical variables. Here we investigate two approaches to reduce the dimensionality of DSS, illustrating each method with numerical experiments with the Lorenz96 dynamical system. The forms of DSS chosen here involve approximate closures at second and third order in the equal-time cumulants. We demonstrate significant reduction in computational effort that can be achieved without sacrificing the accuracy of DSS. The methods developed here can be applied to turbulent fluid and magnetohydrodynamical systems. Published by the American Physical Society 2025
We investigate the limitations of quantum computers for solving nonlinear dynamical systems. In particular, we tighten the worst-case bounds of the quantum Carleman linearisation (QCL) algorithm answering one of their open questions. We provide a further significant limitation for any quantum algorithm that aims to output a quantum state that approximates the normalized solution vector. Given a natural choice of coordinates for a dynamical system with one or more positive Lyapunov exponents and solutions that grow sub-exponentially, we prove that any such algorithm has complexity scaling at least exponentially in the integration time. As such, an efficient quantum algorithm for simulating chaotic systems or regimes is likely not possible.
Data assimilation aims to estimate the states of a dynamical system by optimally combining sparse and noisy observations of the physical system with uncertain forecasts produced by a computational model. The states of many dynamical systems of interest obey nonlinear physical constraints, and the corresponding dynamics is confined to a certain sub-manifold of the state space. Standard data assimilation techniques applied to such systems yield posterior states lying outside the manifold, violating the physical constraints. This work focuses on particle flow filters which use stochastic differential equations to evolve state samples from a prior distribution to samples from an observation-informed posterior distribution. The variational Fokker-Planck (VFP)—a generic particle flow filtering framework—is extended to incorporate non-linear, equality state constraints in the analysis. To this end, two algorithmic approaches that modify the VFP stochastic differential equation are discussed: (i) VFPSTAB, to inexactly preserve constraints with the addition of a stabilizing drift term, and (ii) VFPDAE, to exactly preserve constraints by treating the VFP dynamics as a stochastic differential-algebraic equation (SDAE). Additionally, an implicit-explicit time integrator is developed to evolve the VFPDAE dynamics. The strength of the proposed approach for constraint preservation in data assimilation is demonstrated on three test problems: the double pendulum, Korteweg-de-Vries, and the incompressible Navier-Stokes equations.
The dynamics of Lagrangian particles in turbulence play a crucial role in mixing, transport, and dispersion in complex flows. Their trajectories exhibit highly nontrivial statistical behavior, motivating the development of surrogate models that can reproduce these trajectories without incurring the high computational cost of direct numerical simulations of the full Eulerian field. This task is particularly challenging because reduced-order models typically lack access to the full set of interactions with the underlying turbulent field. Novel data-driven machine learning techniques can be powerful in capturing and reproducing complex statistics of the reduced-order/surrogate dynamics. In this work, we show how one can learn a surrogate dynamical system that is able to evolve a turbulent Lagrangian trajectory in a way that is point-wise accurate for short-time predictions (with respect to Kolmogorov time) and stable and statistically accurate at long times. This approach is based on the Mori–Zwanzig formalism, which prescribes a mathematical decomposition of the full dynamical system into resolved dynamics that depend on the current state and the past history of a reduced set of observables, and the unresolved orthogonal dynamics due to unresolved degrees of freedom of the initial state. We show how by training this reduced order model on a point-wise error metric on short time-prediction, we are able to correctly learn the dynamics of Lagrangian turbulence, such that also the long-time statistical behavior is stably recovered at test time. This opens up a range of applications, for example, for the control of active Lagrangian agents in turbulence.