Search NASA⌕ Search

SEARCH · Search NASA

Results for “dynamic network”

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 109 records · Page 6

Aggregated Residential Load Modeling Using Dynamic Bayesian Networks

Abstract—It is already obvious that the future power grid will have to address higher demand for power and energy, and to incorporate renewable resources of different energy generation patterns. Demand response (DR) schemes could successfully be used to manage and balance power supply and demand under operating conditions of the future power grid. To achieve that, more advanced tools for DR management of operations and planning are necessary that can estimate the available capacity from DR resources. In this research, a Dynamic Bayesian Network (DBN) is derived, trained, and tested that can model aggregated load of Heating, Ventilation, and Air Conditioning (HVAC) systems. DBNs can provide flexible and powerful tools for both operations and planing, due to their unique analytical capabilities. The DBN model accuracy and flexibility of use is demonstrated by testing the model under different operational scenarios.

Bayesian↗

Direct Adaptive Aircraft Control Using Dynamic Cell Structure Neural Networks

A Dynamic Cell Structure (DCS) Neural Network was developed which learns topology representing networks (TRNS) of F-15 aircraft aerodynamic stability and control derivatives. The network is integrated into a direct adaptive tracking controller. The combination produces a robust adaptive architecture capable of handling multiple accident and off- nominal flight scenarios. This paper describes the DCS network and modifications to the parameter estimation procedure. The work represents one step towards an integrated real-time reconfiguration control architecture for rapid prototyping of new aircraft designs. Performance was evaluated using three off-line benchmarks and on-line nonlinear Virtual Reality simulation. Flight control was evaluated under scenarios including differential stabilator lock, soft sensor failure, control and stability derivative variations, and air turbulence.

Jorgensen, Charles C.↗

Neural network with dynamically adaptable neurons

This invention is an adaptive neuron for use in neural network processors. The adaptive neuron participates in the supervised learning phase of operation on a co-equal basis with the synapse matrix elements by adaptively changing its gain in a similar manner to the change of weights in the synapse IO elements. In this manner, training time is decreased by as much as three orders of magnitude.

Tawel, Raoul↗

Wide-frequency range, dynamic matching network and power system for the “Shoelace” radio frequency antenna on the Alcator C-Mod tokamak

A wide-frequency range (50–300 kHz) power system has been implemented for use with a new RF antenna – the “Shoelace” antenna – built to drive coherent plasma fluctuations in the edge of the Alcator C-Mod tokamak. A custom, dynamically tunable matching network allows two commercial 1 kW, 50-Ω RF amplifiers to drive the low-impedance, inductive load presented by the antenna. This is accomplished by a discretely variable L-match network, with 81 independently selected steps available for each of the series and parallel legs of the matching configuration. A compact programmable logic device provides a control system that measures the frequency with better than 1 kHz accuracy and transitions to the correct tuning state in less than 1 ms. At least 85% of source power is dissipated in the antenna across the operational frequency range, with a minimum frequency slew rate of 1 MHz/s; the best performance is achieved in the narrower band from 80 to 150 kHz which is of interest in typical experiments. The RF frequency can be run with open-loop control, following a pre-programmed analog waveform, or phase-locked to track a plasma fluctuation diagnostic signal in real time with programmable phase delay; the amplitude control is always open-loop. The control waveforms and phase delay are programmed remotely. These tools have enabled first-of-a-kind measurements of the tokamak edge plasma system response in the frequency range and at the wave number at which coherent fluctuations regulate heat and particle transport through the plasma boundary.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Catch bond kinetics are instrumental to cohesion of fire ant rafts under load

Dynamic networks composed of constituents that break and reform bonds reversibly are ubiquitous in nature owing to their modular architectures that enable functions like energy dissipation, self-healing, and even activity. While bond breaking depends only on the current configuration of attachment in these networks, reattachment depends also on the proximity of constituents. Therefore, dynamic networks composed of macroscale constituents (not benefited by the secondary interactions cohering analogous networks composed of molecular-scale constituents) must rely on primary bonds for cohesion and self-repair. Toward understanding how such macroscale networks might adaptively achieve this, we explore the uniaxial tensile response of 2D rafts composed of interlinked fire ants ( S. invicta ). Through experiments and discrete numerical modeling, we find that ant rafts adaptively stabilize their bonded ant-to-ant interactions in response to tensile strains, indicating catch bond dynamics. Consequently, low-strain rates that should theoretically induce creep mechanics of these rafts instead induce elastic-like response. Our results suggest that this force-stabilization delays dissolution of the rafts and improves toughness. Nevertheless, above 35 % strain low cohesion and stress localization cause nucleation and growth of voids whose coalescence patterns result from force-stabilization. These voids mitigate structural repair until initial raft densities are restored and ants can reconnect across defects. However mechanical recovery of ant rafts during cyclic loading suggests that—even upon reinstatement of initial densities—ants exhibit slower repair kinetics if they were recently loaded at faster strain rates. These results exemplify fire ants’ status as active agents capable of memory-driven, stimuli-response for potential inspiration of adaptive structural materials.

Science & Technology - Other Topics↗

Dynamics of a network of phase oscillators with plastic couplings

The processes of synchronization and phase cluster formation are investigated in a complex network of dynamically coupled phase oscillators. Coupling weights evolve dynamically depending on the phase relations between the oscillators. It is shown that the network exhibits several types of behavior: the globally synchronized state, two-cluster and multi-cluster states, different synchronous states with a fixed phase relationship between the oscillators and chaotic desynchronized state.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Odd–Even Structural Sensitivity on Dynamics in Network-Forming Ionic Liquids

As a compelling case of sensitive structure–property relationship, an odd–even effect refers to the alternating trend of physical or chemical properties on odd/even number of repeating structural units. In crystalline or semicrystalline materials, such odd–even effects emerge as manifestations of differences in the periodic packing patterns of molecules. Therefore, due to the lack of long-range order, such an odd–even phenomenon is not expected for dynamic properties in amorphous state. Herein, we report the discovery of a remarkable odd–even effect of dynamical properties in the liquid phase. In a class of glass-forming diammonium citrate ionic liquids, using incoherent quasi-elastic neutron scattering measurements, we measured the dynamical properties including diffusion coefficient and rotational relaxation time. These directly measured molecular dynamics showed pronounced alternating trends with increased number of methylene (-CH2-) groups in the backbone. Meanwhile, the structure factor S(Q) showed no long-range periodic packing of molecules, while the pair distribution function G(r) revealed subtle differences in the local molecular morphology. The observed dynamical odd–even phenomenon in liquids showed that profound dynamical changes originate from subtle local structural differences.

36 MATERIALS SCIENCE↗

User Role Identification in Software Vulnerability Discussions over Social Networks

Understanding and early awareness of software vulnerabilities is vital for preventing and mitigating potential impacts from cybersecurity events. One step toward early characterization of software vulnerabilities may involve analyzing discussion and spread of information in online social networks. Prior work has used information from such discussions over multiple online forums to develop dynamic networks among users followed by analysis of structure, spread, and information evolution. In this work, we advance the state-of-the-art by focusing on data-driven learning of types, roles, and transition of roles exhibited by users over time. In social networks, users take on particular roles based on their actions and structure of the network. Identifying “meaningful” roles can help separate potential users of interest from the larger community, and identify patterns in a network. We will identify and compare roles found in online forums (e.g., Twitter) using techniques such as feature-based Non-negative Matrix Factorization coupled with topological and influence-based measures of centrality. Since users’ activities change over time, we also analyze role evolution in dynamic networks.

Jones, Rebecca D.↗

Aladyn - Adaptive Neural Network Molecular Dynamics Simulation Code: Computational Materials Mini-Application

This report provides an overview and commands description of the Computational Materials mini-application, Aladyn. Aladyn is a simple molecular dynamics code written in FORTRAN 2008, which is designed to demonstrate the use of adaptive neural networks (ANNs) in atomistic simulations. The role of ANNs is to reproduce the very complex energy landscape resulting from the atomic interactions in materials with the accuracy of quantum mechanics-based energy calculations. The ANN is trained on a large set of atomic structures calculated using the density functional theory (DFT) method. The Aladyn code is being released to serve as a training testbed for students and professors in academia to explore possible optimization algorithms for parallel computing on multicore central processing unit (CPU) computers or computers utilizing many core architectures based on graphic processing units (GPUs). The effort is related to the High Performance Computing Incubator (HPCI) project at NASA Langley Research Center.

Yamakov, Vesselin I.↗

High-Performance Computing Optimization for Aladyn – Adaptive Neural Network Molecular Dynamics Mini-Application

This report provides a description and performance evaluation of the optimization techniques for high performance computing (HPC) implementation of the open source Computational Materials mini-application Aladyn (https://github.com/nasa/aladyn). Aladyn is a basic molecular dynamics code written in FORTRAN 2003, which is designed to demonstrate the use of adaptive neural networks (ANNs) in atomistic simulations. The role of ANNs is to efficiently reproduce the very complex energy landscape resulting from the atomic interactions in materials with the accuracy of the more expensive quantum mechanics-based calculations. The ANN is trained on a large set of atomic structures calculated using the density functional theory (DFT) method. While achieving orders of magnitude faster computational performance than DFT, the ANN-based approach was still very computationally demanding compared to the conventional approach of using empirically fitted energy functions. After its initial development, Aladyn was evaluated and optimized by experts at the NASA Advanced Supercomputing (NAS) division to exploit modern supercomputer architectures. The code has been optimized for execution on multicore central processing units (CPUs), including Intel® Skylake microarchitecture, and on graphic accelerators, such as Nvidia® V100 graphic processing units (GPUs), using Open Multi-Processing (OpenMP) and Open Accelerators (OpenACC) programming interfaces. The optimization achieved a speedup of 4.7 times the baseline version on CPU performance and an additional 2.4 times on CPU+GPU performance. Atomistic computer simulations are a fundamental tool in materials research to model material properties form physics-based first principles. Atomic interaction, governed by Quantum Mechanics (QM) require sophisticated and highly computationally demanding mathematical models to calculate [1]. Classical methods use approximate functional forms, empirically fitted through a set of variable parameters to emulate atomic energies as direct functions of atomic coordinates [2]. While empirical potentials are computationally much simpler, allowing simulations of large-scale systems of up to a trillion (1012) atoms [3], they are substantially less accurate compared to quantum calculations and applicable only to very specific atomic configurations or predefined crystallographic phases. A recently suggested approach is to use heuristic machine learning methods [4], such as those based on Adaptive Neural Networks (ANNs) to predict atomic energies, after being trained on a sufficiently large database of QM-calculated structures [5,6]. This approach reduces significantly the computational complexity, allowing for simulations of orders of magnitude larger systems compared to QM-based methods without compromising accuracy. Still, compared to classical methods using empirical energy functions, ANN methods remain two- to three orders of magnitude more computationally demanding. Hence, the computational cost of simulations, together with the need for extensive training of ANNs, still makes the practical implementation of ANN-based methods quite challenging. The purpose of the Aladyn mini-application software [7], available as open source at https://github.com/nasa/aladyn, is to be a testbed for exploring possible optimization strategies to develop highly scalable parallel algorithms for ANN-based atomistic simulations. Aladyn is aimed at utilizing the architecture of the high-end modern highperformance computing (HPC) hardware based on multicore central processing units (CPUs) equipped with graphic processing unit (GPU) accelerators. Specifically, the goal is to optimize the performance on a single HPC compute node, before implementing scaling to multi-node parallelization using message passing interface (MPI). At the same time, the open source code of Aladyn can serve as a training model for students and professors in academia.

Yamakov, Vesselin I.↗

AladynPi – Adaptive Neural Network Molecular Dynamics Simulation Code with Physically Informed Potential: Computational Materials Mini-Application

This report provides an overview and description of commands used in the Computational Materials mini-application, AladynPi. AladynPi is an extension of a previously released mini-application, Aladyn (https://github.com/nasa/aladyn; Yamakov, V.I., and Glaessgen, E.H., NASA/TM-2018-220104). Aladyn and AladynPi are basic molecular dynamics codes written in FORTRAN 2003, which are designed to demonstrate the use of adaptive neural networks (ANNs) in atomistic simulations. The role of ANNs is to efficiently reproduce the very complex energy landscape resulting from the atomic interactions in materials with the accuracy of the more expensive quantum mechanics-based calculations. The ANN is trained on a large set of atomic structures calculated using the density functional theory method. An input for the ANN is a set of structure coefficients, characterizing the local atomic environment of each atom, for which the atomic energy is obtained in the ANN inference process. In Aladyn, the ANN gives directly the energy of interatomic interactions. In AladynPi, the ANN gives optimized parameters for a predefined empirical function, known as bond-order-potential (BOP). The parameterized BOP function is then used to calculate the energy. AladynPi code is being released to serve as a training testbed for students and professors in academia to explore possible optimization algorithms for parallel computing on multicore central processing unit (CPU) computers or computers utilizing manycore architectures based on graphic processing units (GPUs). The effort is supported by the High Performance Computing incubator (HPCi) project at NASA Langley Research Center.

Yamakov, Vesselin I.↗

Determining the Reaction Kinetics and Thermodynamics of a Diels–Alder Network Using Dynamic Gel Criteria

We undertook a detailed rheological investigation to evaluate the kinetic parameters of the forward and reverse Diels–Alder (DA) reactions of a model network cross-linked using a furan prepolymer and a common aromatic bismaleimide. At high temperature where the Winter–Chambon’s criterion of frequency-independence was more applicable, a multiwave technique permitted van’t Hoff analysis and calculation of the reaction thermodynamic parameters, specifically the enthalpy and entropy of the reaction: ΔH° = –38.3 ± 5.2 kJ mol –1 and ΔS° = –94.3 ± 13.4 J mol –1 . At mild temperatures where the G'–G" crossover point is experimentally convenient to measure gelation, isothermal tests were used to obtain reasonable fDA kinetic parameters from Eyring analysis such as the apparent activation enthalpy and entropy of ΔH$^{‡}_{fDA}$ = 76.8 ± 6.9 kJ mol –1 and ΔS$^{‡}_{fDA}$= –82.8 ± 22.2 J mol –1 K –1 . Comparable rheokinetic methods include cross-linking density measurements and stress relaxation tests to calculate effective kinetics, whereas the critical gel conversion was consistently applied here. As a result, rate data are fitted with the Arrhenius equation for comparison purposes and the Eyring equation to demonstrate its broader utility.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Short-Term Load Forecasting-Based Automatic Distribution Network Reconfiguration

In a traditional dynamic network reconfiguration study, the optimal topology is determined at every scheduled time point by using the real load data measured at that time. The development of the load forecasting technique can provide an accurate prediction of the load power that will happen in a future time and provide more information about load changes. With the inclusion of load forecasting, the optimal topology can be determined based on the predicted load conditions during a longer time period instead of using a snapshot of the load at the time when the reconfiguration happens; thus, the distribution system operator can use this information to better operate the system reconfiguration and achieve optimal solutions. This paper proposes a short-term load forecasting approach to automatically reconfigure distribution systems in a dynamic and pre-event manner. Specifically, a short-term and high-resolution distribution system load forecasting approach is proposed with a forecaster based on support vector regression and parallel parameters optimization. The network reconfiguration problem is solved by using the forecasted load continuously to determine the optimal network topology with the minimum amount of loss at the future time. The simulation results validate and evaluate the proposed approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Quantitative Assessment of Transportation Network Vulnerability with Dynamic Traffic Simulation Methods

Transportation networks are critical to the social and economic function of nations. Given the continuing increase in the populations of cities throughout the world, the criticality of transportation infrastructure is expected to increase. Thus, it is ever more important to mitigate congestion as well as to assess the impact disruptions would have on individuals who depend on transportation for their work and livelihood. Moreover, several government organizations are responsible for ensuring transportation networks are available despite the constant threat of natural disasters and terrorist activities. Most of the previous transportation network vulnerability research has been performed in the context of static traffic models, many of which are formulated as traditional optimization problems. However, transportation networks are dynamic because their usage varies over time. Thus, more appropriate methods to characterize the vulnerability of transportation networks should consider their dynamic properties. This paper presents a quantitative approach to assess the vulnerability of a transportation network to disruptions with methods from traffic simulation. Our approach can prioritize the critical links over time and is generalizable to the case where both link and node disruptions are of concern. We illustrate the approach through a series of examples. Our results demonstrate that the approach provides quantitative insight into the time varying criticality of links. Such an approach could be used as the objective function of less traditional optimization methods that use simulation and other techniques to evaluate the relative utility of a particular network defense to reduce vulnerability and increase resilience.

Shekar, Venkateswaran↗

The design and networking of dynamic satellite constellations for global mobile communication systems

Various design factors for mobile satellite systems, whose aim is to provide worldwide voice and data communications to users with hand-held terminals, are examined. Two network segments are identified - the ground segment (GS) and the space segment (SS) - and are seen to be highly dependent on each other. The overall architecture must therefore be adapted to both of these segments, rather than each being optimized according to its own criteria. Terrestrial networks are grouped and called the terrestrial segment (TS). In the SS, of fundamental importance is the constellation altitude. The effect of the altitude on decisions such as constellation design choice and on network aspects like call handover statistics are fundamental. Orbit resonance is introduced and referred to throughout. It is specifically examined for its useful properties relating to GS/SS connectivities.

Cullen, Cionaith J.↗

Dynamic neural networks based on-line identification and control of high performance motor drives

In the automated and high-tech industries of the future, there wil be a need for high performance motor drives both in the low-power range and in the high-power range. To meet very straight demands of tracking and regulation in the two quadrants of operation, advanced control technologies are of a considerable interest and need to be developed. In response a dynamics learning control architecture is developed with simultaneous on-line identification and control. the feature of the proposed approach, to efficiently combine the dual task of system identification (learning) and adaptive control of nonlinear motor drives into a single operation is presented. This approach, therefore, not only adapts to uncertainties of the dynamic parameters of the motor drives but also learns about their inherent nonlinearities. In fact, most of the neural networks based adaptive control approaches in use have an identification phase entirely separate from the control phase. Because these approaches separate the identification and control modes, it is not possible to cope with dynamic changes in a controlled process. Extensive simulation studies have been conducted and good performance was observed. The robustness characteristics of neuro-controllers to perform efficiently in a noisy environment is also demonstrated. With this initial success, the principal investigator believes that the proposed approach with the suggested neural structure can be used successfully for the control of high performance motor drives. Two identification and control topologies based on the model reference adaptive control technique are used in this present analysis. No prior knowledge of load dynamics is assumed in either topology while the second topology also assumes no knowledge of the motor parameters.

Rubaai, Ahmed↗

A Dynamic Reduction Network for Point Clouds

Classifying whole images is a classic problem in machine learning, and graph neural networks are a powerful methodology to learn highly irregular geometries. It is often the case that certain parts of a point cloud are more important than others when determining overall classification. On graph structures this started by pooling information at the end of convolutional filters, and has evolved to a variety of staged pooling techniques on static graphs. In this paper, a dynamic graph formulation of pooling is introduced that removes the need for predetermined graph structure. It achieves this by dynamically learning the most important relationships between data via an intermediate clustering. The network architecture yields interesting results considering representation size and efficiency. It also adapts easily to a large number of tasks from image classification to energy regression in high energy particle physics.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗