Search NASA⌕ Search

SEARCH · Search NASA

Results for “Complex Network Data”

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 955 records · Page 53

Building Scalable PGAS Communication Subsystem on Blue Gene/Q

This paper presents a design of scalable Partitioned Global Address Space (PGAS) communication subsystems on recently proposed Blue Gene/Q architecture. The proposed design provides an in-depth modeling of communication infrastructure using Parallel Active Messaging Interface (PAMI). The communication infrastructure is used to design time-space efficient communication protocols for frequently used data-types (contiguous, uniformly non-contiguous) using Remote Direct Memory Access (RDMA) get/put primitives. The proposed design accelerates load balance counters by using asynchronous threads, which are required due to the missing network hardware support for Atomic Memory Operations (AMOs). Under the proposed design, the synchronization traffic is reduced by tracking conflicting memory accesses in distributed space with slightly increment in space complexity. An evaluation with simple communication benchmarks show a adjacent node get latency of 2.89$\mu$s and peak bandwidth of 1775 MB/s resulting in $\approx$ 99\% communication efficiency.The evaluation shows a reduction in the execution time by up to 30\% for NWChem self consistent field calculation on 4096 processes using the proposed asynchronous thread based design.

Vishnu, Abhinav↗

Building Modelling Methodologies for Virtual District Heating and Cooling Networks

District heating and cooling systems (DHC) are a proven energy solution that has been deployed for many years in a growing number of urban areas worldwide. They comprise a variety of technologies that seek to develop synergies between the production and supply of heat, cooling, domestic hot water and electricity. Although the benefits of DHC systems are significant and have been widely acclaimed, yet the full potential of modern DHC systems remains largely untapped. There are several opportunities for development of energy efficient DHC systems, which will enable the effective exploitation of alternative renewable resources, waste heat recovery, etc., in order to increase the overall efficiency and facilitate the transition towards the next generation of DHC systems. This motivated the need for modelling these complex systems. Large-scale modelling of DHC-networks is challenging, as it has several components interacting with each other. In this paper we present two building methodologies to model the consumer buildings. These models will be further integrated with network model and the control system layer to create a virtual test bed for the entire DHC system. The model is validated using data collected from a real life DHC system located at Lulea, a city on the coast of northern Sweden. The test bed will be then used for simulating various test cases such as peak energy reduction, overall demand reduction etc.

Saurav, Kumar↗

Full-field imaging learning machine (FILM)

A method of determining dynamic properties of a structure (linear or nonlinear) includes receiving spatio-temporal inputs, generating mode shapes and modal components corresponding to the spatio-temporal inputs using a trained deep complexity coding artificial neural network, and subsequently generating the dynamic properties by analyzing each modal component using a trained learning machine. A computing system for non-contact determination of dynamic properties of a structure includes a camera, a processor, and a memory including computer-executable instructions. When the instructions are executed, the system is caused to receive spatio-temporal image data, decompose the spatio-temporal image data into constituent manifold components using an autoencoder, and analyze the constituent manifold components using a trained learning machine to determine the dynamic properties.

Yang, Yongchao↗

Synchrophasors-based Master State Awareness Estimator for Cybersecurity in Power Grid: Testbed Implementation & Field Demonstration

The integration of distributed energy resources(DERs) and expansion of complex network in the distribution grid requires an advanced distributed state estimator to monitor the grid health at micro-level. The distribution state estimator will improve the situational awareness and resiliency of distributed power system. This paper proposes a synchrophasors-based master state awareness (MSA) estimator to enhance the cybersecurity in distribution grid by providing a real-time estimation of system operating states to control center operators. In this paper, the proposed MSA estimator utilizes only phasor measurements, bus magnitudes and angles, from phasor measurement units (PMUs),deployed in local substations, to estimate the system states and also detects data integrity attacks, such as load tripping attack that disconnects the load. To validate the proof of concept, we implement the proposed methodology in cyber-physical testbed environment at the Idaho National Laboratory (INL) Electric Grid Security Testbed. Further, to address the “valley of death” and support technology commercialization, field demonstration is also performed at the Critical Infrastructure Test Range Complex(CITRC) at the INL. Our experimental results reveal a promising performance in detecting load tripping attack and providing an accurate situational awareness through an alert visualization dashboard in real-time

42 ENGINEERING↗

Parameter Estimation and Model Validation of Nonlinear Dynamical Networks

In the performance period of this work under a DOE contract, the co-PIs, Philip Gill and Henry Abarbanel, developed new methods for statistical data assimilation for problems of DOE interest, including geophysical and biological problems. This included numerical optimization algorithms for variational principles, new parallel processing Monte Carlo routines for performing the path integrals of statistical data assimilation. These results have been summarized in the monograph: “Predicting the Future: Completing Models of Observed Complex Systems” by Henry Abarbanel, published by Spring-Verlag in June 2013. Additional results and details have appeared in the peer reviewed literature.

42 ENGINEERING↗

Intermolecular Network Theory:A General Approach for Understanding the Structural and Dynamic Properties of Liquids and Solutions

Graph theory applications within the physical sciences have a long history. However, it has never moved to the forefront of analytical techniques employed by the computational chemistry community. Though much of the earliest work leveraged percolation theory as a backdrop for understanding critical phenomena and phase transitions within statistical mechanical simulations, modern data science has much to contribute. Here in this paper, we focus on the realm of intermolecular networks, where vertices represent molecules or particles, and an edge represents an intermolecular or interparticle interaction. These interactions are widely understood to dictate many of the physical properties of soft matter, and for liquids in particular, understanding this network is essential. Consider the sheer volume of ~70 years of literature associated with the hydrogen bond network of water, a topic that remains an active area of research even today. The aim of this work is twofold: first, to put into context prior algorithms and analyses that employed “connectedness theory” or lattice-based models to understand the intermolecular networks of chemical systems; and second to discuss a more general strategy for analyzing the multiscale structural and dynamic properties of chemical systems—intermolecular network theory. This approach encompasses foundational methods such as percolation theory, but also utilizes contemporary graph theoretical analyses that have evolved alongside the development of the World Wide Web, cloud computing, and big data. It is the realm of intermolecular network theory to determine the relationships between the essential physics of a system and the topological properties of the network and to derive new techniques in graph theory that can be related to the underlying physico-chemical or reactive properties of a system. Examples are used throughout this chapter that demonstrate applications to a wide variety of complex chemical systems, including ion association within electrolytes, mass transport and the properties of liquid–liquid phase boundaries, and multicomponent solutions.

Complex networks↗

Leveraging public AI tools to explore systems biology resources in mathematical modeling

Predictive mathematical modeling is an essential part of systems biology and is interconnected with information management. Systems biology information is often stored in specialized formats to facilitate data storage and analysis. These formats are not designed for easy human readability and thus require specialized software to visualize and interpret results. Therefore, comprehending modeling and underlying networks and pathways is contingent on mastering systems biology tools, which is particularly challenging for users with no or little background in data science or system biology. To address this challenge, we investigated the usage of public Artificial Intelligence (AI) tools in exploring systems biology resources in mathematical modeling. We tested public AI’s understanding of mathematics in models, related systems biology data, and the complexity of model structures. Our approach can enhance the accessibility of systems biology for non-system biologists and help them understand systems biology without a deep learning curve.

59 BASIC BIOLOGICAL SCIENCES↗

Data-driven discovery of coordinates and governing equations

The discovery of governing equations from scientific data has the potential to transform data-rich fields that lack well-characterized quantitative descriptions. Advances in sparse regression are currently enabling the tractable identification of both the structure and parameters of a nonlinear dynamical system from data. The resulting models have the fewest terms necessary to describe the dynamics, balancing model complexity with descriptive ability, and thus promoting interpretability and generalizability. This provides an algorithmic approach to Occam’s razor for model discovery. However, this approach fundamentally relies on an effective coordinate system in which the dynamics have a simple representation. In this work, we design a custom deep autoencoder network to discover a coordinate transformation into a reduced space where the dynamics may be sparsely represented. Thus, we simultaneously learn the governing equations and the associated coordinate system. We demonstrate this approach on several example high-dimensional systems with low-dimensional behavior. The resulting modeling framework combines the strengths of deep neural networks for flexible representation and sparse identification of nonlinear dynamics (SINDy) for parsimonious models. This method places the discovery of coordinates and models on an equal footing.

97 MATHEMATICS AND COMPUTING↗

A novel digital pulse processing architecture for nuclear instrumentation

The field of nuclear instrumentation covers a wide range of applications, including counting, spectrometry, pulse shape discrimination and multi-channel coincidence. These applications are the topic of many researches, new algorithms and implementations are constantly proposed thanks to advances in digital signal processing. However, these improvements are not yet implemented in instrumentation devices. This is especially true for neutron-gamma discrimination applications which traditionally use charge comparison method while literature proposes other algorithms based on frequency domain or wavelet theory which show better performances. Another example is pileups which are generally rejected while pileup correction algorithms also exist. These processes are traditionally performed offline due to two issues. The first is the Poissonian characteristic of the signal, composed of random arrival pulses which requires to current architectures to work in data flow. The second is the real-time requirement, which implies losing pulses when the pulse rate is too high. Despite the possibility of treating the pulses independently from each other, current architectures paralyze the acquisition of the signal during the processing of a pulse. This loss is called dead-time. These two issues have led current architectures to use dedicated solutions based on re-configurable components like Field Programmable Gate Arrays (FPGAs) to overcome the need of performance necessary to deal with dead-time. However, dedicated hardware algorithm implementations on re-configurable technologies are complex and time-consuming. For all these reasons, a programmable Digital pulse Processing (DPP) architecture in a high level language such as Cor C++ which can reduce dead-time would be worthwhile for nuclear instrumentation. This would reduce prototyping and test duration by reducing the level of hardware expertise to implement new algorithms. However, today's programmable solutions do not meet the need of performance to operate online and not allow scaling with the increase in the number of measurement channel. That is why an innovative DPP architecture is proposed in this paper. This architecture is able to overcome dead-time while being programmable and is flexible with the number of measurement channel. Proposed architecture is based on an innovative execution model for pulse processing applications which can be summarized as follow. The signal is not composed of pulses only, consequently, pulses processing does not have to operate on the entire signal. Therefore, the first step of our proposal is pulse extraction by the use of dedicated components named pulse extractors. The triggering step can be achieved after the analog-to-digital conversion without any signal shaping or filtering stages. Pileup detection and accurate pulse time stamping are done at this stage. Any application downstream this step can work on adaptive variable-sized array of samples simplifying pulse processing methods. Then, once the data flow is broken, it is possible to distribute pulses on Functional Units (FUs) which perform processing. As the date of each pulse is known, they can be processed individually out-of-order to provide the results. To manage the pulses distribution, a scheduler and an interconnection network are used. pulses are distributed on the first FU which is not busy without congesting the interconnection network. For this reason, the process duration does not result anymore in dead-time if there are enough FUs. FUs are designed to be standalone and to comprises at least a programmable general purpose processor (ARM, Microblaze) allowing the implementation of complex algorithms without any modification of the hardware. An acquisition chain is composed of a succession of algorithms which lead to organize our FUs as a software macro-pipeline, A simple approach consists in assigning one algorithm per FU. Consequently, the global latency becomes the worst latency of algorithms execution on FU. Moreover, as algorithms are executed locally - i.e. on a FU - this approach limits shared memory requirement. To handle multichannel, we propose FUs sharing, this approach maximize the chance to find a non-busy FU to process an incoming pulse. This is possible since each channel receive random event independently, the pulse extractors associated to them do not necessarily need to access simultaneously to all Computing resources at the same time to distribute their pulses. The major contribution of this paper is the proposition of an execution model and its associated hardware programmable architecture for digital pulse processing that can handle multiple acquisition channels while maintaining the scalability thanks to the use of shared resources. This execution model and associated architecture are validated by simulation of a cycle accurate architecture SystemC model. Proposed architecture shows promising results in terms of scalability while maintaining zero dead-time. This work also permit the sizing of hardware resources requirement required for a predefined set of applications. Future work will focus on the interconnection network and a scheduling policy that can exploit the variable-length of pulses. Then, the hardware implementation of this architecture will be performed and tested for a representative set of application.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

EvoGraph: On-The-Fly Efficient Mining of Evolving Graphs on GPU

With the prevalence of the World Wide Web and social networks, there has been a growing interest in high performance analytics for constantly-evolving dynamic graphs. Modern GPUs provide massive AQ1 amount of parallelism for efficient graph processing, but the challenges remain due to their lack of support for the near real-time streaming nature of dynamic graphs. Specifically, due to the current high volume and velocity of graph data combined with the complexity of user queries, traditional processing methods by first storing the updates and then repeatedly running static graph analytics on a sequence of versions or snapshots are deemed undesirable and computational infeasible on GPU. We present EvoGraph, a highly efficient and scalable GPU- based dynamic graph analytics framework.

dynamic graphs↗

Robust deep learning framework for constitutive relations modeling

Modeling the full-range deformation behaviors of materials under complex loading and materials conditions is a significant challenge for constitutive relations (CRs) modeling. Here, we propose a general encoder-decoder deep learning framework that can model high-dimensional stress-strain data and complex loading histories with robustness and universal capability. The framework employs an encoder to project high-dimensional input information (e.g., loading history, loading conditions, and materials information) to a lower-dimensional hidden space and a decoder to map the hidden representation to the stress of interest. We evaluated various encoder architectures, including gated recurrent unit (GRU), GRU with attention, temporal convolutional network (TCN), and the Transformer encoder, on two complex stress-strain datasets that were designed to include a wide range of complex loading histories and loading conditions. All architectures achieved excellent test results with an root-mean-square error (RMSE) below 1 MPa. Additionally, we analyzed the capability of the different architectures to make predictions on out-of-domain applications, with an uncertainty estimation based on deep ensembles. The proposed approach provides a robust alternative to empirical/semi-empirical models for CRs modeling, offering the potential for more accurate and efficient materials design and optimization.

36 MATERIALS SCIENCE↗

A survey of unsupervised learning methods for high-dimensional uncertainty quantification in black-box-type problems

Constructing surrogate models for uncertainty quantification (UQ) on complex partial differential equations (PDEs) having inherently high-dimensional O(10 n ), n ≥ 2, stochastic inputs (e.g., forcing terms, boundary conditions, initial conditions) poses tremendous challenges. The “curse of dimensionality” can be addressed with suitable unsupervised learning techniques used as a pre-processing tool to encode inputs onto lower-dimensional subspaces while retaining its structural information and meaningful properties. In this work, we review and investigate thirteen dimension reduction methods including linear and nonlinear, spectral, blind source separation, convex and non-convex methods and utilize the resulting embeddings to construct a mapping to quantities of interest via polynomial chaos expansions (PCE). Here, we refer to the general proposed approach as manifold PCE (m-PCE), where manifold corresponds to the latent space resulting from any of the studied dimension reduction methods. To investigate the capabilities and limitations of these methods we conduct numerical tests for three physics-based systems (treated as black-boxes) having high-dimensional stochastic inputs of varying complexity modeled as both Gaussian and non-Gaussian random fields to investigate the effect of the intrinsic dimensionality of input data. We demonstrate both the advantages and limitations of the unsupervised learning methods and we conclude that a suitable m-PCE model provides a cost-effective approach compared to alternative algorithms proposed in the literature, including recently proposed expensive deep neural network-based surrogates and can be readily applied for high-dimensional UQ in stochastic PDEs.

42 ENGINEERING↗

Recovering network topologies via Taylor expansion and compressive sensing

Gaining knowledge of the intrinsic topology of a complex dynamical network is the precondition to understand its evolutionary mechanisms and to control its dynamical and functional behaviors. In this article, a general framework is developed to recover topologies of complex networks with completely unknown node dynamics based on Taylor expansion and compressive sensing. Numerical simulations illustrate the feasibility and effectiveness of the proposed method. Moreover, this method is found to have good robustness to weak stochastic perturbations. Finally, the impact of two major factors on the topology identification performance is evaluated. This method provides a natural and direct point to reconstruct network topologies from measurable data, which is likely to have potential applicability in a wide range of fields.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Living on the edge: A continental-scale assessment of forest vulnerability to drought

Globally, forests are facing an increasing risk of mass tree mortality events associated with extreme droughts and higher temperatures. Hydraulic dysfunction is considered a key mechanism of drought-triggered dieback. By leveraging the climate breadth of the Australian landscape and a national network of research sites (Terrestrial Ecosystem Research Network), we conducted a continental-scale study of physiological and hydraulic traits of 33 native tree species from contrasting environments to disentangle the complexities of plant response to drought across communities. Here, we found strong relationships between key plant hydraulic traits and site aridity. Leaf turgor loss point and xylem embolism resistance were correlated with minimum water potential experienced by each species. Across the data set, there was a strong coordination between hydraulic traits, including those linked to hydraulic safety, stomatal regulation and the cost of carbon investment into woody tissue. These results illustrate that aridity has acted as a strong selective pressure, shaping hydraulic traits of tree species across the Australian landscape. Hydraulic safety margins were constrained across sites, with species from wetter sites tending to have smaller safety margin compared with species at drier sites, suggesting trees are operating close to their hydraulic thresholds and forest biomes across the spectrum may be susceptible to shifts in climate that result in the intensification of drought.

59 BASIC BIOLOGICAL SCIENCES↗

Deep Spatiotemporal Feature Learning with Application to Image Classification

Deep machine learning is an emerging framework for dealing with complex high-dimensionality data in a hierarchical fashion which draws some inspiration from biological sources. Despite the notable progress made in the field, there remains a need for an architecture that can represent temporal information with the same ease that spatial information is discovered. In this work, we present new results using a recently introduced deep learning architecture called Deep Spatio-Temporal Inference Network (DeSTIN). DeSTIN is a discriminative deep learning architecture that combines concepts from unsupervised learning for dynamic pattern representation together with Bayesian inference. In DeSTIN the spatiotemporal dependencies that exist within the observations are modeled inherently in an unguided manner. Each node models the inputs by means of clustering and simple dynamics modeling while it constructs a belief state over the distribution of sequences using Bayesian inference. We demonstrate that information from the different layers of this hierarchical system can be extracted and utilized for the purpose of pattern classification. Earlier simulation results indicated that the framework is highly promising, consequently in this work we expand DeSTIN to a popular problem, the MNIST data set of handwritten digits. The system as a preprocessor to a neural network achieves a recognition accuracy of 97.98% on this data set. We further show related experimental results pertaining to automatic cluster adaptation and termination.

99 GENERAL AND MISCELLANEOUS↗

Software-defined network abstractions and configuration interfaces for building programmable quantum networks

Well-defined and stable quantum networks are essential to realize functional quantum applications. Quantum networks are complex and must use both quantum and classical channels to support quantum applications like QKD, teleportation, and superdense coding. In particular, the no-cloning theorem prevents the reliable copying of quantum signals such that the quantum and classical channels must be highly coordinated using robust and extensible methods. We develop new network abstractions and interfaces for building programmable quantum networks. Our approach leverages new OpenFlow data structures and table type patterns to build programmable quantum networks and to support quantum applications.

quantum communiction↗

Data Structures for Extreme Scale Computing

As computing problems of national importance grow, the government meets the increased demand by funding the development of ever larger systems. The overarching goal of the work supported in part by this grant is to increase efficiency of programming and performing computations on these large computing systems. In past work, we have demonstrated that some of these computations once thought to require expensive hardware designs and/or complex, special-purpose programming may be executed efficiently on low-cost commodity cluster computing systems using a general-purpose “latency-tolerant” programming framework. One important developed application of the ideas underlying this framework is graph database technology supporting social network pattern matching used by US intelligence agencies to more quickly identify potential terrorist threats. This database application has been spun out by the Pacific Northwest National Laboratory, a Department of Energy Laboratory, into a commercial start-up, Trovares Inc. We explore an alternative application of the same underlying ideas to a well-studied challenge arising in engineering: solving unstructured sparse linear equations. Solving these equations is key to predicting the behavior of large electronic circuits before they are fabricated. Predicting that behavior ahead of fabrication means that designs can optimized and errors corrected ahead of the expense of manufacture.

42 ENGINEERING↗

Demonstrate new plasticity models for doped UO 2 that capture dislocation mechanisms

In light water reactors, fuel vendors are investigating the use of dopants to modify the properties of UO 2 pellets, with the goal of improving pellet-cladding mechanical interactions during operation. Dopants are expected to ‘soften’ the pellets; that is, the doped pellets have higher plastic deformation than conventional UO 2 . This leads to a reduction in the severity of mechanical pellet-cladding interactions, helping to reduce the hoop strain on the cladding. By minimizing the strain exerted by the pellet on the cladding, it is anticipated that cladding performance under accident conditions can be enhanced (i.e., lowering the risk of burst during a LOCA). Dopants such as chromium (Cr) promote grain growth during pellet fabrication, leading to larger grains; therefore, understanding the link between chemistry, microstructure and mechanical deformation (enhanced creep rates) behavior of UO 2 is critical to helping operators further substantiate the benefits of doping UO 2 . Historically, the nuclear energy industry has relied on empirical models to make assessments of performance. Compared to empirical models, mechanistic physics-based models provide benefits, such as, fewer data points for validation and better extrapolation where experimental data is scarce or non-existent. In this report, Bayesian inference techniques have been applied to a previously developed lower length-scale-informed diffusional creep model. The objective is to i) infer lower-length-scale parameter distributions from available experiment and then ii) determine the uncertainties in the measurable quantity (in this case creep rates) after propagating the inferred lower length scale parameter uncertainties. The approach requires many evaluations of the model, which becomes computationally insurmountable; therefore, a neural-network model is trained to data obtained by sampling the full model over the most important parameters. This neural-network is then used in the Bayesian inference approach to determine probability distributions in the parameter values that represent the uncertainty in the model given what is known from the experiments (posterior). A significant reduction compared to conservative initial (prior) uncertainties is achieved through inference against the experimental data, demonstrating the efficacy of this approach. Furthermore, by accounting for uncertainties in the experimental conditions and sample non-stoichiometry, it is possible to resolve apparent discrepancies in experimental measurements within a self-consistent grain boundary (Coble) creep model that is sensitive to chemistry. This work has been written up and submitted to Nuclear Technology for a special issue on accelerated fuel qualification (AFQ). This uncertainty quantification (UQ) work not only improves the diffusional model, while accounting for uncertainty, but also establishes a framework which can readily be applied to the mechanistic models of dislocation deformation developed in this study. The most likely values from the Bayesian analysis are incorporated into our UO 2 diffusional creep model and a lower length scale-informed irradiation UO 2 creep mechanistic model to generate a dataset. This dataset has been provided to our INL collaborators for training an artificial neural network surrogate model, which will be implemented in the BISON fuel performance code to assess how the results differ from those currently obtained using a fully empirical model and that of using the nominal (uncalibrated) atomic scale parameters in our mechanistic model. Plastic deformation (creep and glide) in UO 2 is a complex phenomenon, governed by multiple underlying processes such as local defect concentrations, applied stresses, and microstructural characteristics. Consequently, there is a need for a meso-scale model with polycrystalline resolution capable of extrapolating to large grain sizes applicable to doped UO 2 , where data is limited and the model can help bridge the knowledge gap. By integrating atomistic data into the polycrystal LApx code, it becomes possible to predict dislocation climb and glide plasticity that simple analytical models cannot accurately represent. The application of atomic-scale data within LApx demonstrated the importance of climb and glide mechanisms in reproducing high-stress UO 2 behavior. Behaviors such as this are crucial to capture and implement in BISON, as parts of the fuel pellet can reach temperatures where glide can occur before pellet cracking. This model which captures dislocation based mechanisms for UO 2 is then used to stand up the doped model accounting for larger grain sizes. It was found that larger grain sizes can lead to enhanced deformation rates in the glide regime, and therefore can help with the pellet cladding mechanical interaction. Therefore if the fuel pellet reaches conditions (stress/temperature) where glide is active, the enhanced creep rates for larger grains in the glide regime (doped UO 2 ) can help with pellet cladding mechanical interactions. Plastic deformation in UO 2 involves multiple mechanisms, including diffusional creep, dislocation climb, and glide. This milestone contains two parts: (1) UQ of a pre-existing lower length scale informed mechanistic diffusional creep model, and (2) development of a new LApx based model for dislocation-mediated creep mechanisms in UO 2 , with application to large-grain doped UO 2 .

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗