Search NASA⌕ Search

SEARCH · Search NASA

Results for “temporal 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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Identification of the connections in biologically inspired neural networks

We developed an identification method to find the strength of the connections between neurons from their behavior in small biologically-inspired artificial neural networks. That is, given the network external inputs and the temporal firing pattern of the neurons, we can calculate a solution for the strengths of the connections between neurons and the initial neuron activations if a solution exists. The method determines directly if there is a solution to a particular neural network problem. No training of the network is required. It should be noted that this is a first pass at the solution of a difficult problem. The neuron and network models chosen are related to biology but do not contain all of its complexities, some of which we hope to add to the model in future work. A variety of new results have been obtained. First, the method has been tailored to produce connection weight matrix solutions for networks with important features of biological neural (bioneural) networks. Second, a computationally efficient method of finding a robust central solution has been developed. This later method also enables us to find the most consistent solution in the presence of noisy data. Prospects of applying our method to identify bioneural network connections are exciting because such connections are almost impossible to measure in the laboratory. Knowledge of such connections would facilitate an understanding of bioneural networks and would allow the construction of the electronic counterparts of bioneural networks on very large scale integrated (VLSI) circuits.

Demuth, H.↗
DOE OSTI2021

Improving the performance of first- and last-mile mobility services through transit coordination, real-time demand prediction, advanced reservations, and trip prioritization

Socio-demographic trends and recent economic development patterns have resulted in travel behavior changes that call for more flexible and accessible public transit options. Because flexible transit services vary in scope, size, and service type, new data-informed methods are useful to optimize services based on the specific needs of local communities and riders. In this study, real-world demand and vehicle trajectory data were used to evaluate and optimize system performance for an existing first-mile–last-mile (FMLM) service in Robinson Township, PA. A general FMLM model for arbitrary demand and service supply was then developed to quantify system performance—both travel time costs and day-to-day reliability—for various operational polices considering spatio-temporal demand variation and transportation network dynamics. Heuristics were used for optimal real-time vehicle routing in sizable real-world networks accommodating various service types and scopes. In this case study, total user costs were reduced by 18.6% when rides were coordinated with mainline fixed-route transit. Predictive routing strategies were shown to marginally improve system performance under sparse and variable spatio-temporal demand. The case study also highlights potentially large travel time and user reliability improvements—reductions of 51% and 53.8%, respectively—when trip requests were made in advance of their desired pickup time. Finally, we show that travel time reliability can be improved for time-inflexible trips with trip prioritization without increasing total user costs. These results were stable to changes in demand density.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
NASA NTRS2003

Using Neural Networks to Describe Tracer Correlations

Neural networks are ideally suited to describe the spatial and temporal dependence of tracer-tracer correlations. The neural network performs well even in regions where the correlations are less compact and normally a family of correlation curves would be required. For example, the CH4-N2O correlation can be well described using a neural network trained with the latitude, pressure, time of year, and CH4 volume mixing ratio (v.m.r.). In this study a neural network using Quickprop learning and one hidden layer with eight nodes was able to reproduce the CH4-N2O correlation with a correlation co- efficient of 0.9995. Such an accurate representation of tracer-tracer correlations allows more use to be made of long-term datasets to constrain chemical models. Such as the dataset from the Halogen Occultation Experiment (HALOE) which has continuously observed CH4, (but not N2O) from 1991 till the present. The neural network Fortran code used is available for download.

Lary, D. J.↗
NASA NTRS2004

Using an Extended Kalman Filter Learning Algorithm for Feed-Forward Neural Networks to Describe Tracer Correlations

In this study a new extended Kalman filter (EKF) learning algorithm for feed-forward neural networks (FFN) is used. With the EKF approach, the training of the FFN can be seen as state estimation for a non-linear stationary process. The EKF method gives excellent convergence performances provided that there is enough computer core memory and that the machine precision is high. Neural networks are ideally suited to describe the spatial and temporal dependence of tracer-tracer correlations. The neural network performs well even in regions where the correlations are less compact and normally a family of correlation curves would be required. For example, the CH4-N2O correlation can be well described using a neural network trained with the latitude, pressure, time of year, and CH4 volume mixing ratio (v.m.r.). The neural network was able to reproduce the CH4-N2O correlation with a correlation coefficient between simulated and training values of 0.9997. The neural network Fortran code used is available for download.

Lary, David J.↗
NASA NTRS1991

A search for clustering among the meteoroid impacts detected by the Apollo lunar seismic network

A difference is noted between meteoroids whose masses lie above and below 1 kg in temporal meteoroid-impact clusterings detected by the Apollo lunar seismic network; while the former exhibit little temporal clustering, small ones show strong clusterings identifiable with terrestrial meteor showers. This finding suggests a different type and origin for the two meteoroid sizes; the small may be primarily cometary, while the large may derive from near-earth asteroids and short-period comets. It is speculated that the June, 1975, and January, 1977 swarms of large meteoroids may contain high-density meteoritic objects interpretable as meteorite streams.

Oberst, Juergen↗
NASA NTRS1992

Learning a trajectory using adjoint functions and teacher forcing

A new methodology for faster supervised temporal learning in nonlinear neural networks is presented which builds upon the concept of adjoint operators to allow fast computation of the gradients of an error functional with respect to all parameters of the neural architecture, and exploits the concept of teacher forcing to incorporate information on the desired output into the activation dynamics. The importance of the initial or final time conditions for the adjoint equations is discussed. A new algorithm is presented in which the adjoint equations are solved simultaneously (i.e., forward in time) with the activation dynamics of the neural network. We also indicate how teacher forcing can be modulated in time as learning proceeds. The results obtained show that the learning time is reduced by one to two orders of magnitude with respect to previously published results, while trajectory tracking is significantly improved. The proposed methodology makes hardware implementation of temporal learning attractive for real-time applications.

Toomarian, Nikzad B.↗
DOE OSTI2023

Evaluation of global teleconnections in CMIP6 climate projections using complex networks

In climatological research, the evaluation of climate models is one of the central research subjects. As an expression of large-scale dynamical processes, global teleconnections play a major role in interannual to decadal climate variability. Their realistic representation is an indispensable requirement for the simulation of climate change, both natural and anthropogenic. Therefore, the evaluation of global teleconnections is of utmost importance when assessing the physical plausibility of climate projections. We present an application of the graph-theoretical analysis tool δ-MAPS, which constructs complex networks on the basis of spatio-temporal gridded data sets, here sea surface temperature and geopotential height at 500 hPa. Complex networks complement more traditional methods in the analysis of climate variability, like the classification of circulation regimes or empirical orthogonal functions, assuming a new non-linear perspective. While doing so, a number of technical tools and metrics, borrowed from different fields of data science, are implemented into the δ-MAPS framework in order to overcome specific challenges posed by our target problem. Those are trend empirical orthogonal functions (EOFs), distance correlation and distance multicorrelation, and the structural similarity index. δ-MAPS is a two-stage algorithm. In the first place, it assembles grid cells with highly coherent temporal evolution into so-called domains. In a second step, the teleconnections between the domains are inferred by means of the non-linear distance correlation. We construct 2 unipartite and 1 bipartite network for 22 historical CMIP6 climate projections and 2 century-long coupled reanalyses (CERA-20C and 20CRv3). Potential non-stationarity is taken into account by the use of moving time windows. The networks derived from projection data are compared to those from reanalyses. Our results indicate that no single climate projection outperforms all others in every aspect of the evaluation. But there are indeed models which tend to perform better/worse in many aspects. Differences in model performance are generally low within the geopotential height unipartite networks but higher in sea surface temperature and most pronounced in the bipartite network representing the interaction between ocean and atmosphere.

58 GEOSCIENCES↗
NASA NTRS1997

64x64 Analog Input Array for 3-Dimensional Neural Network Processor

In pattern recognition and classification for spatio-temporal problems, one of the most challenging tasks is to provide a good and valid solution in real-time. Because of time constraints, software-based neural network approaches may not be suitable for practical use. Hardware solutions seem to be good candidates for this class of problems. Currently, the Three Dimensional Analog Neural Network (3-DANN) is an effective approach to solving spatio-temporal problems in three-dimensional hardware.

spatio-temporal 3-DANN Three Dimensional Analog Ne↗
DOE OSTI2020

Physics-guided Deep Learning for Power System State Estimation

In the past decade, dramatic progress has been made in the field of machine learning. This paper explores the possibility of applying deep learning in power system state estimation. Traditionally, physics-based models are used including weighted least square (WLS) or weighted least absolute value (WLAV). These models typically consider a single snapshot of the system without capturing temporal correlations of system states. In this paper, a physics-guided deep learning (PGDL) method is proposed. Specifically, inspired by autoencoders, deep neural networks (DNNs) are used to learn the temporal correlations. The estimated system states from DNNs are then checked against physics laws by running through a set of power flow equations. Hence, the proposed PGDL is both data-driven and physics-guided. The accuracy and robustness of the proposed PGDL method are compared with traditional methods in standard IEEE cases. Simulations show promising results and the applicability is further discussed.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

ThunderSecure: deploying real-time intrusion detection for 100G research networks by leveraging stream-based features and one-class classification network

Nowadays, data generated by large-scale scientific experiments are on the scale of petabytes per month. These data are transferred through dedicated high-bandwidth networks (40/100G) across distributed sites for processing, storage, and analysis. Like general purpose networks, research networks experience intrusions. However, monitoring anomalies in such high-speed network traffics is challenging given current cyber-infrastructure. Moreover, traditional network intrusion detection systems (NIDS) are signature based. However, anomaly patterns are difficult to define and that rulesets are often not updated frequently enough to reflect the changes of attack behaviors. We present ThunderSecure, a high-throughput, unsupervised learning-based intrusions detection system for 100G research networks. ThunderSecure implements an efficient packet processing and detection pipeline using multi-cores and GPUs. It extracts statistical and temporal features from real-time network data streams and feeds them to a one-class anomaly detection network. A baseline of normal distribution will be created based on the training observation. Testing traffic deviated from the learned profile will be marked as anomalies. We trained ThunderSecure on hundreds of billions of science data packets mirrored from two 100G network connections at Fermi National Accelerator Laboratory. The detection performance was evaluated on traffic captured from the same research network days and weeks after the training with different types of attack flows injected. Results show that ThunderSecure can recognize science data traffic captured long after the training and made nearly certain detection on the segment of the streams where anomalous flows were injected.

100G research network↗
DOE OSTI2022

Characterizing vertical upper ocean temperature structures in the European Arctic through unsupervised machine learning

In-situ observations of subsurface ocean temperatures are, in many regions, inconsistently distributed in time and space. These spatio-temporal inconsistencies in the observational network lead to difficulties in utilizing those observations effectively for ocean model evaluation or understanding larger-scale ocean characteristics. Model accuracy of subsurface ocean characteristics is especially important within regions that contain complex ocean structures. One such region is the European Arctic which not only contains several types of water masses with unique characteristics, but also wintertime sea ice coverage and complex bathymetry. This study presents an unsupervised neural networking technique that can be used in combination with traditional ocean model evaluation techniques to provide additional information on the accuracy of modeled vertical ocean temperature profiles. Self-organizing maps is an unsupervised machine learning technique that we apply to approximately twenty thousand Argo and CTD temperature profiles from 2012 to 2020 in the European Arctic to categorize the observed vertical ocean temperature structures in the top 150 m. The observed ocean profile categories, or neurons, defined by the self-organizing map show strong spatial and temporal dependencies. We then use the neuron weights, or the learned temperature profile structure of each neuron, to validate the spatial and temporal variability of modeled vertical temperature structures. This analysis gives us new insights about the model’s capabilities to reproduce specific vertical structures of the top-most ocean layer within different regions and seasons. Mapping modeled ocean temperature profiles onto the neuron-space of the observationally-defined self organized map highlights the potential of this method to advance our understanding of model deficiencies in that region.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2018

Abiotic stress networks converging on FT2 to control growth in Populus

Regulation of growth, quiescence and dormancy by seasonally recurring and episodic environmental factors is of central importance to the productivity of woody plants. Woody biomass feedstock plants such as Populus show substantial natural variation in growth responses to various environmental conditions; however, the complex genetic nature of these traits slows breeding for optimal biomass production in specific climates and on marginal lands. These growth responses are controlled by complex gene regulatory networks that are poorly understood. Elucidating the mechanisms that determine periods of growth and quiescence will identify specific genes and modules that can be manipulated to maximize growth in different environments. The main goal of the project was to develop transcriptional networks that describe spatially and temporally explicit regulatory relationships for both daylength and nutrient-mediated quiescence. We used next generation sequencing to characterize genome-wide gene expression changes to these two abiotic signals in shoot apices, leaf, root and vascular cambium. Overall, we sequenced 270 mRNAseq libraries and 54 smallRNAseq libraries from Populus trichocarpa and 58 RNAseq libraries from Populus nigra. We found both organ-specific transcriptional responses as well as responses common to multiple organs. Similarly, we uncovered both divergent and convergent gene regulatory networks that control growth responses to changes in daylength and nutrient stress. Thus, this work provides a foundation for developing approaches to optimize tree growth and biomass yield in response to specific as well as multiple abiotic conditions. Finally, we validated the functions of candidate regulators of growth in response to photoperiod and nutrient availability by introducing mutations via gene editing and transgenic methods. This data will be available to the public through journal publications and national/international genomic data archives.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Physics-inspired spatiotemporal-graph AI ensemble for the detection of higher order wave mode signals of spinning binary black hole mergers

We present a new class of AI models for the detection of quasi-circular, spinning, non-precessing binary black hole mergers whose waveforms include the higher order gravitational wave modes ($\ell$, |m|) = {(2,2), (2,1), (3,3), (3,2), (4,4)}, and mode mixing effects in the $\ell$ = 3, |m| = 2 harmonics. These AI models combine hybrid dilated convolution neural networks to accurately model both short- and long-range temporal sequential information of gravitational waves; and graph neural networks to capture spatial correlations among gravitational wave observatories to consistently describe and identify the presence of a signal in a three detector network encompassing the Advanced LIGO and Virgo detectors. We first trained these spatiotemporal-graph AI models using synthetic noise, using 1.2 million modeled waveforms to densely sample this signal manifold, within 1.7 h using 256 NVIDIA A100 GPUs in the Polaris supercomputer at the Argonne Leadership Computing Facility. This distributed training approach exhibited optimal classification performance, and strong scaling up to 512 NVIDIA A100 GPUs. With these AI ensembles we processed data from a three detector network, and found that an ensemble of 4 AI models achieves state-of-the-art performance for signal detection, and reports two misclassifications for every decade of searched data. We distributed AI inference over 128 GPUs in the Polaris supercomputer and 128 nodes in the Theta supercomputer, and completed the processing of a decade of gravitational wave data from a three detector network within 3.5 h. Finally, we fine-tuned these AI ensembles to process the entire month of February 2020, which is part of the O3b LIGO/Virgo observation run, and found 6 gravitational waves, concurrently identified in Advanced LIGO and Advanced Virgo data, and zero false positives. This analysis was completed in one hour using one NVIDIA A100 GPU.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Faster network disruption from layered oscillatory dynamics

Nonlinear complex network-coupled systems typically have multiple stable equilibrium states. Following perturbations or due to ambient noise, the system is pushed away from its initial equilibrium, and, depending on the direction and the amplitude of the excursion, it might undergo a transition to another equilibrium. It was recently demonstrated [M. Tyloo, J. Phys. Complex. 3 03LT01 (2022)] that layered complex networks may exhibit amplified fluctuations. Here, I investigate how noise with system-specific correlations impacts the first escape time of nonlinearly coupled oscillators. Interestingly, I show that, not only the strong amplification of the fluctuations is a threat to the good functioning of the network but also the spatial and temporal correlations of the noise along the lowest-lying eigenmodes of the Laplacian matrix. Finally, I analyze first escape times on synthetic networks and compare noise originating from layered dynamics to uncorrelated noise.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2012

Inference of Causal Networks from Time-Varying Transcriptome Data via Sparse Coding

Temporal analysis of genome-wide data can provide insights into the underlying mechanism of the biological processes in two ways. First, grouping the temporal data provides a richer, more robust representation of the underlying processes that are co-regulated. The net result is a significant dimensional reduction of the genome-wide array data into a smaller set of vocabularies for bioinformatics analysis. Second, the computed set of time-course vocabularies can be interrogated for a potential causal network that can shed light on the underlying interactions. The method is coupled with an experiment for investigating responses to high doses of ionizing radiation with and without a small priming dose. From a computational perspective, inference of a causal network can rapidly become computationally intractable with the increasing number of variables. Additionally, from a bioinformatics perspective, larger networks always hinder interpretation. Therefore, our method focuses on inferring the simplest network that is computationally tractable and interpretable. The method first reduces the number of temporal variables through consensus clustering to reveal a small set of temporal templates. It then enforces simplicity in the network configuration through the sparsity constraint, which is further regularized by requiring continuity between consecutive time points. We present intermediate results for each computational step, and apply our method to a time-course transcriptome dataset for a cell line receiving a challenge dose of ionizing radiation with and without a prior priming dose. Our analyses indicate that (i) the priming dose increases the diversity of the computed templates (e.g., diversity of transcriptome signatures); thus, increasing the network complexity; (ii) as a result of the priming dose, there are a number of unique templates with delayed and oscillatory profiles; and (iii) radiation-induced stress responses are enriched through pathway and subnetwork studies.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1993

The Earth Viewed as a Deforming Polyhedron: Method and Results

GPS is quite unlike any other geodetic technique, because we can use it to look at the Earth with high spatial and temporal resolution. For example, the GPS global network provides us with a daily snapshot of the Earth, allowing us to look with high temporal resolution at the motion of sites before, during, and after a large earthquake.The main focus of this paper is to view the Earth as an evolving polyhedron, whose vertices are defined by the GPS sites.

GPS global network GPS GPS sites deforming polyhed↗
DOE OSTI2017

Understanding the Hierarchy of Dense Subgraphs in Stationary and Temporally Varying Setting

Graphs are widely used to model relationships in a wide variety of domains such as sociology, bioinformatics, infrastructure, the WWW, to name a few. One of the key observations is that while real-world graphs are often globally sparse, they are locally dense. In other words, the average degree is often quite small (say at most 10 in a million vertex graph), but vertex neighborhoods are often dense. Finding dense subgraphs is a critical aspect of graph mining It has been used for finding communities and spam link farms in web graphs, graph visualization, real-time story identification, DNA motif detection in biological networks, finding correlated genes, epilepsy prediction, finding price value motifs in financial data, graph compression, distance query indexing, and increasing the throughput of social networking site servers. However, most standard formulations of this problem (like clique, quasi-clique, k-densest subgraph) are NP-hard. Furthermore, current dense subgraph finding algorithms usually optimize some objective, and only find a few such subgraphs without providing any structural relations, whereas the goal is rarely to find the "true optimum," but to identify many (if not all) dense substructures, understand their distribution in the graph, and ideally determine relationships among them. In this project, we first aim to devise algorithms and provide 3 implementations with nice visualizations to find the hierarchy between dense subgraphs, and then understand the structure of the hierarchy to gain more insight on the hidden patterns in real-world networks. Another important aspects in graph analysis is the temporal nature of networks. Networks evolve over time and in many applications data arrives at a high velocity, and thus it is important to design algorithms that can process data efficiently. We report three main results towards identifying dense structures in large evolving graphs. First, we will show how the hierarchical connectedness structure can be maintained efficiently, where connectedness is defined by increasing levels of connectivity strength. Next, we present dense structure can be identified in bipartite graphs without building projection graphs. And finally, we present a new method for peeling algorithms This new approach avoids sequential nature of peeling algorithms and is amenable to parallelization, which is crucial for processing high velocity data.

97 MATHEMATICS AND COMPUTING↗