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.
A new neural network architecture is proposed based upon effects of non-Lipschitzian dynamics. The network is fully connected, but these connections are active only during vanishingly short time periods. The advantages of this architecture are discussed.
A new neural network architecture is proposed based upon effects of non-Lipschitzian dynamics. The network is fully connected, but these connections are active only during vanishingly short time periods. The advantages of this architecture are discussed.
This paper considers a collection of networked nonlinear dynamical systems, and addresses the synthesis of feedback controllers that seek optimal operating points corresponding to the solution of pertinent network-wide optimization problems. Particular emphasis is placed on the solution of semidefinite programs (SDPs). The design of the feedback controller is grounded on a dual e-subgradient approach, with the dual iterates utilized to dynamically update the dynamical-system reference signals. Global convergence is guaranteed for diminishing stepsize rules, even when the reference inputs are updated at a faster rate than the dynamical-system settling time. The application of the proposed framework to the control of power-electronic inverters in AC distribution systems is discussed. The objective is to bridge the time-scale separation between real-time inverter control and network-wide optimization. Optimization objectives assume the form of SDP relaxations of prototypical AC optimal power flow problems.
A procedure for the design and training of artificial neural networks, used for rapid and efficient controls and dynamics design and analysis for flexible space systems, has been developed. Artificial neural networks are employed, such that once properly trained, they provide a means of evaluating the impact of design changes rapidly. Specifically, two-layer feedforward neural networks are designed to approximate the functional relationship between the component/spacecraft design changes and measures of its performance or nonlinear dynamics of the system/components. A training algorithm, based on statistical sampling theory, is presented, which guarantees that the trained networks provide a designer-specified degree of accuracy in mapping the functional relationship. Within each iteration of this statistical-based algorithm, a sequential design algorithm is used for the design and training of the feedforward network to provide rapid convergence to the network goals. Here, at each sequence a new network is trained to minimize the error of previous network. The proposed method should work for applications wherein an arbitrary large source of training data can be generated. Two numerical examples are performed on a spacecraft application in order to demonstrate the feasibility of the proposed approach.
Networks-of-networks (NoN) is a graph-theoretic model of interdependent networks that have distinct dynamics at each network (layer). By adding special edges to represent relationships between nodes in different layers, NoN provides a unified mechanism to study interdependent systems intertwined in a complex relationship. While NoN based models have been proposed for cyber-physical systems, in this paper we build towards a three-layer NoN model for an enterprise cyber system. Each layer captures a different facet of a cyber system. We then discuss the potential benefits of graph-theoretic analysis enabled from such a model. Our goal is to provide a novel and powerful tool for modeling and analyzing problems in cyber security.
Many scientific applications need support from a communication infrastructure that provides predictable performance, which requires effective algorithms for bandwidth reservations. Network reservation systems such as ESnet's OSCARS, establish guaranteed bandwidth of secure virtual circuits for a certain bandwidth and length of time. However, users currently cannot inquire about bandwidth availability, nor have alternative suggestions when reservation requests fail. In general, the number of reservation options is exponential with the number of nodes n, and current reservation commitments. We present a novel approach for path finding in time-dependent networks taking advantage of user-provided parameters of total volume and time constraints, which produces options for earliest completion and shortest duration. The theoretical complexity is only O(n2r2) in the worst-case, where r is the number of reservations in the desired time interval. We have implemented our algorithm and developed efficient methodologies for incorporation into network reservation frameworks. Performance measurements confirm the theoretical predictions.
In this work, we propose a novel method to transform a time series into a weighted and directed network. For a given time series, we first generate a set of segments via a sliding window, and then use a doubly symbolic scheme to characterize every windowed segment by combining absolute amplitude information with an ordinal pattern characterization. Based on this construction, a network can be directly constructed from the given time series: segments corresponding to different symbol-pairs are mapped to network nodes and the temporal succession between nodes is represented by directed links. With this conversion, dynamics underlying the time series has been encoded into the network structure. We illustrate the potential of our networks with a well-studied dynamical model as a benchmark example. Results show that network measures for characterizing global properties can detect the dynamical transitions in the underlying system. Moreover, we employ a random walk algorithm to sample loops in our networks, and find that time series with different dynamics exhibits distinct cycle structure. That is, the relative prevalence of loops with different lengths can be used to identify the underlying dynamics.
Vehicular Ad hoc Network (VANET) is a special subset of multi-hop Mobile Ad hoc Networks in which vehicles can not only communicate with each other but also with the fixed equipments along the roads through wireless interfaces. Recently, it has been discovered that essential systems in real world share similar properties. When they are regarded as networks, among which the dynamic topology structure of VANET system is an important issue. Many real world networks are actually growing with preferential attachment like Internet, transportation system and telephone network. Those phenomena have brought great possibility in finding a strategy to calibrate and control the topology parameters which can help find VANET topology change regulation to relieve traffic jam, prevent traffic accident and improve traffic safety. VANET is a typical complex network which has its basic characteristics. In this paper, we focus on the macroscopic Vehicle-to-Infrastructure (V2I) and Vehicle-to-Vehicle (V2V) inter-vehicle communication network with complex network theory. In particular, this paper is the first one to propose a method analyzing the topological structure and performance of VANET and present the communications in VANET from a new perspective. Accordingly, we propose degree distribution, clustering coefficient and the short path length of complex network to implement our strategy by numerical example and simulation. All the results demonstrate that VANET shows small world network features and is characterized by a truncated scale-free degree distribution with power-law degree distribution. The average path length of the network is simulated numerically, which indicates that the network shows small-world property and is rarely affected by the randomness. What’s more, we carry out extensive simulations of information propagation and mathematically prove the power law property when γ > 2. The results of this study provide useful information for VANET optimization from a macroscopic perspective.
An important issue for temporal planners is the ability to handle temporal uncertainty. We revisit the question of how to determine whether a given set of temporal requirements are feasible in the light of uncertain durations of some processes. In particular, we consider how best to determine whether a network is Dynamically Controllable, i.e., whether a dynamic strategy exists for executing the network that is guaranteed to satisfy the requirements. Previous work has shown the existence of a pseudo-polynomial algorithm for testing Dynamic Controllability. Here, we greatly simplify the previous framework, and present a true polynomial algorithm with a cutoff based only on the number of nodes.
This study explores the viability of using counterfactual reasoning for impact analyses when understanding and responding to “beyond-design-basis” nuclear power plant accidents. Currently, when a severe nuclear power plant accident occurs, plant operators rely on Severe Accident Management Guidelines. However, the current guidelines are limited in scope and depth: for certain types of accidents, plant operators would have to work to mitigate the damage with limited experience and guidance for the particular situation. We aim to fill the need for comprehensive accident support by using a dynamic Bayesian network to aid in the diagnosis of a nuclear reactor’s state and to analyze the impact of possible response measures.
This paper investigates chaos control for the brushless DC motor (BLDCM) system by adaptive dynamic surface approach based on neural network with the minimum weights. The BLDCM system contains parameter perturbation, chaotic behavior, and uncertainty. With the help of radial basis function (RBF) neural network to approximate the unknown nonlinear functions, the adaptive law is established to overcome uncertainty of the control gain. By introducing the RBF neural network and adaptive technology into the dynamic surface control design, a robust chaos control scheme is developed. It is proved that the proposed control approach can guarantee that all signals in the closed-loop system are globally uniformly bounded, and the tracking error converges to a small neighborhood of the origin. Simulation results are provided to show that the proposed approach works well in suppressing chaos and parameter perturbation.
Due to the high penetration of power-electronic-interfaced distributed energy resources (DERs), a microgrid's inertia is significantly reduced, making it sensitive to cyberand physical operational changes. When multiple microgrids are interconnected to form networked microgrids for improving system's resilience, the changes of one microgrid can quickly escalate to the overall system. In cyber-physical networked microgrids, the communication latency varies a lot. To efficiently quantify the impact of the communication latency on the dynamics of networked microgrids, a scalable distributed reachability analysis approach is presented in this paper. Reachable sets are calculated for each microgrid and then composited for the overall system dynamics evaluation. Extensive tests in the full paper will demonstrate the influence of communication latency on system dynamics and validate reachable sets can bound a system's all dynamic trajectories subject to latency changes. The test results also offer an insight into designing and managing the communication network for enhancing the system's resilience.
The use of artificial neural network (ANN) potentials trained with first-principles calculations has emerged as a promising approach for molecular dynamics (MD) simulations encompassing large space and time scales while retaining first-principles accuracy. To date, however, the application of ANN-MD has been limited to near-equilibrium processes. Here we combine first-principles-trained ANN-MD with multiscale shock theory (MSST) to successfully describe far-from-equilibrium shock phenomena. Overall, our ANN-MSST-MD approach describes shock-wave propagation in solids with first-principles accuracy but a 5000 times shorter computing time. Accordingly, ANN-MD-MSST was able to resolve fine, long-time elastic deformation at low shock speed, which was impossible with first-principles MD because of the high computational cost. This work thus lays a foundation of ANN-MD simulation to study a wide range of far-from-equilibrium processes.
Microgrids rely on communication networks for reliable operation, which makes them inherently vulnerable to cyberattacks. Such attacks can destabilise system dynamics and drive states away from their nominal operating trajectories. Although several physics-informed and machine learning-based strategies have been developed to counter these threats, the rapidly evolving cyber landscape enables adversaries to bypass static defences or rules-based mitigation approaches. This paper proposes a dynamic, online-trained and fully decentralised reinforcement learning (RL)-based cyberattack response framework to protect microgrids from evolving cyberattacks. The proposed framework deploys multiple deep Q-networks (DQNs), each associated with a distributed energy resource (DER), to enable localised and adaptive attack mitigation. In this framework, each DQN processes local voltage and frequency measurements—combined with intrusion detection system (IDS) alerts—as observations and rewards to guide decision-making. Extensive simulation studies demonstrate the robustness of the proposed framework under diverse attack scenarios and varying IDS-induced detection delays. Comparative analysis highlights its superiority over existing static or preexisting rules-based mitigation approaches. Finally, we present an analysis that shows the framework's scalability to real-life microgrids with more interacting agents.
This study proposes a data‐driven approach for identifying switch actions in power distribution networks. Simulated micro‐phasor measurement unit data is utilised to train a convolutional neural network (CNN) model. The trained CNN model can identify multi‐phase multi‐switch actions. Instead of working as a blackbox, the proposed approach extracts the features from the hidden layers of the trained CNN for engineering interpretation and error check. In addition, a random‐forest‐based feature ranking algorithm is proposed to identify the most important features. The proposed approach is validated on the IEEE 123‐node feeder modelled in GridLAB‐D. The CNN model is built and trained using TensorFlow. The proposed approach achieves 96.57% identification accuracy.
Increasing use of digital technology in nuclear power plants (NPPs) poses cyber-security as a crucial threat to public safety and to continuous energy production. Cyber-security risks are comprised of complex known and unknown interactions between various entities, system vulnerabilities, network protocols, human users and malicious attacks. There is little understanding or research geared towards plant operators’ response under cyber-security threats and operational procedures to cope with such threats. This is particularly critical when a cyber-security event masquerades as a safety incident or an evolving accident. Instead of leading operators to the remediation of the accident, the masked cyber event may lead them to circumvent the safety mechanisms of the plant. Given these challenges, the objective of this project is to develop a tool to characterize abnormal NPP events as “cyber” or “safety” incidents, and to further develop this tool as a real-time operator aid to assist in response to the incident. This NEUP Final Report summarizes the research efforts towards the above goals and the results in the following three aspects. First, a methodology for classifying abnormal NPP events as cyber-attacks or safety incidents was developed. This provides the basis for responding to potential cyber-attacks. In this methodology, the causal relationships between various variables (i.e., physical variables, network variables, and control variables) for a nuclear system under consideration are modeled using dynamic Bayesian networks. Based on observations of certain variables (i.e., the evidence), inference is performed to identify the state of hidden variables, which helps indicate the occurrence of cyber-attacks or safety incidents. The proposed methodology was applied to the full scope NPP simulator system at The Ohio State University as a case study. The result shows that the proposed methodology is capable of distinguishing between cyber-attacks and safety incidents. Second, a game-theoretic approach for responding to cyber-attacks on nuclear power plants was developed. This is the second major goal of the project, and the method is used to recommend optimal responses to reactor operators in the case of cyber-attacks. We consider two cases in this research. In the first case, the interaction between the defender (i.e., the reactor operator) and the attacker is modeled as a two-player, nonzero-sum, Markov game with an infinite time horizon. In the second case, we consider a semi-Markov game between the defender and the attacker within a finite time horizon. The model in the second case enables us to consider the time sensitive response of the defender. In each case, the method for deriving the Nash equilibrium is developed. The Nash Equilibrium of the game provides the valid prediction of both players’ actions because no single player can benefit from unilaterally deviating from the equilibrium policy if the other player adheres to his/hers, hence it provides the best response of the defender to cyber-attacks. The proposed method in each case is demonstrated through a simplified benchmark digital feedwater control system. Third, a prototype display is developed to integrate the above information. The prototype display depicts the communication information to the operator and incorporates the cyber-security tool developed by the team into the interface. It consists of the regular display in current control rooms, as well as a panel used to indicate the occurrence of cyber-attacks or safety events and a panel used to guide the operator’s response to detected cyber-attacks.
To enable communication between spacecraft operating in a formation or small constellation, a mesh network architecture was developed and tested using a time division multiple access (TDMA) communication scheme. The network is designed to allow for the exchange of telemetry and other data between spacecraft to enable collaboration between small spacecraft. The system uses a peer-to-peer topology with no central router, so that it does not have a single point of failure. The mesh network is dynamically configurable to allow for addition and subtraction of new spacecraft into the communication network. Flight testing was performed using an unmanned aerial system (UAS) formation acting as a spacecraft analogue and providing a stressing environment to prove mesh network performance. The mesh network was primarily devised to provide low latency, high frequency communication but is flexible and can also be configured to provide higher bandwidth for applications desiring high data throughput. The network includes a relay functionality that extends the maximum range between spacecraft in the network by relaying data from node to node. The mesh network control is implemented completely in software making it hardware agnostic, thereby allowing it to function with a wide variety of existing radios and computing platforms..
Calcium-calmodulin-dependent kinase II (CaMKII) has an important role in dendritic spine remodeling upon synaptic stimulation. Using fluorescence video microscopy and image analysis, we investigated the architectural dynamics of rhodamine-phalloidin stabilized filamentous actin (F-actin) networks cross-linked by CaMKII. We used automated image analysis to identify F-actin bundles and crossover junctions and developed a dimensionless metric to characterize network architecture. Similar networks were formed by three different CaMKII species with a 10-fold length difference in the linker region between the kinase domain and holoenzyme hub, implying linker length is not a primary determinant of F-actin cross-linking. Electron micrographs showed that at physiological molar ratios, single CaMKII holoenzymes cross-linked multiple F-actin filaments at random, whereas at higher CaMKII/F-actin ratios, filaments bundled. Light microscopy established that the random network architecture resisted macromolecular crowding with polyethylene glycol and blocked ATP-powered compaction by myosin-II miniature filaments. Importantly, the networks disassembled after the addition of calcium-calmodulin and were then spaced within 3 min into compacted foci by myosin motors or more slowly (30 min) aggregated by crowding. Single-molecule total internal reflection fluorescence microscopy showed CaMKII dissociation from surface-immobilized globular actin exhibited a monoexponential dwell-time distribution, whereas CaMKII bound to F-actin networks had a long-lived fraction, trapped at crossover junctions. Release of CaMKII from F-actin, triggered by calcium-calmodulin, was too rapid to measure with flowcell exchange (<20 s). The residual bound fraction was reduced substantially upon addition of an N-methyl-D-aspartate receptor peptide analog but not ATP. These results provide mechanistic insights to CaMKII-actin interactions at the collective network and single-molecule level. Our findings argue that CaMKII-actin networks in dendritic spines maintain spine size against physical stress. Upon synaptic stimulation, CaMKII is disengaged by calcium-calmodulin, triggering network disassembly, expansion, and subsequent compaction by myosin motors with kinetics compatible with the times recorded for the poststimulus changes in spine volume.