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 685 records · Page 38

Coarse-Grain Bandwidth Estimation Scheme for Large-Scale Network

A large-scale network that supports a large number of users can have an aggregate data rate of hundreds of Mbps at any time. High-fidelity simulation of a large-scale network might be too complicated and memory-intensive for typical commercial-off-the-shelf (COTS) tools. Unlike a large commercial wide-area-network (WAN) that shares diverse network resources among diverse users and has a complex topology that requires routing mechanism and flow control, the ground communication links of a space network operate under the assumption of a guaranteed dedicated bandwidth allocation between specific sparse endpoints in a star-like topology. This work solved the network design problem of estimating the bandwidths of a ground network architecture option that offer different service classes to meet the latency requirements of different user data types. In this work, a top-down analysis and simulation approach was created to size the bandwidths of a store-and-forward network for a given network topology, a mission traffic scenario, and a set of data types with different latency requirements. These techniques were used to estimate the WAN bandwidths of the ground links for different architecture options of the proposed Integrated Space Communication and Navigation (SCaN) Network. A new analytical approach, called the "leveling scheme," was developed to model the store-and-forward mechanism of the network data flow. The term "leveling" refers to the spreading of data across a longer time horizon without violating the corresponding latency requirement of the data type. Two versions of the leveling scheme were developed: 1. A straightforward version that simply spreads the data of each data type across the time horizon and doesn't take into account the interactions among data types within a pass, or between data types across overlapping passes at a network node, and is inherently sub-optimal. 2. Two-state Markov leveling scheme that takes into account the second order behavior of the store-and-forward mechanism, and the interactions among data types within a pass. The novelty of this approach lies in the modeling of the store-and-forward mechanism of each network node. The term store-and-forward refers to the data traffic regulation technique in which data is sent to an intermediate network node where they are temporarily stored and sent at a later time to the destination node or to another intermediate node. Store-and-forward can be applied to both space-based networks that have intermittent connectivity, and ground-based networks with deterministic connectivity. For groundbased networks, the store-and-forward mechanism is used to regulate the network data flow and link resource utilization such that the user data types can be delivered to their destination nodes without violating their respective latency requirements.

Cheung, Kar-Ming↗

Computational catalyst screening: Scaling, bond-order and catalysis

Here, the design of new and better heterogeneous catalysts needed to accommodate the growing demand for energy from renewable sources is an important challenge for coming generations. Most surface catalyzed processes involve a large number of complex reaction networks and the energetics ultimately defines the turn-over-frequency and the selectivity of the process. In order not to get lost in the large quantities of data, simplification schemes that still contain the key elements of the reaction are required. Adsorption and transition state scaling relations constitutes such a scheme that not only maps the reaction relevant information in terms of few parameters but also provides an efficient way of screening for new materials in a continuous multi-dimensional energy space. As with all relations they impose certain restrictions on what can be achieved and in this paper, I show why these limitations exist and how we can change the behavior through an energy-resolved approach that still maintains the screening capabilities needed in computational catalysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Improving High-Energy Particle Detectors with Machine Learning

Microseconds after the Big Bang, the universe existed in a state called the quark-gluon plasma (QGP). To experimentally study its properties, the QGP is recreated in high-energy nuclear collisions at the LHC, and the particles produced from the QGP are reconstructed from their energy deposition in the ATLAS calorimeter. This requires both classifying the particles and calibrating their deposited energy. The objective of this project is to improve the reconstruction by using machine learning techniques, where the energy depositions of clusters of cells, formed by ATLAS topo-clustering methods, are treated as three-dimensional images when inputted to neural networks. This approach significantly improves the calibration of deposited energies when cross-validating while training, and models trained on idealized data predict the calibrated energies of particles in more complex data sets well. Additionally, implementation of a data generator using uproot allows the program to load input data into memory as needed while training or predicting, significantly reducing the amount of memory used. The data generator also allows for use of multiprocessing to speed up training and evaluating. This work illustrates that using machine learning methods for both classification and calibration has the potential to significantly improve particle reconstruction.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DECAL MDN Resolution Calibration

The simulated pixelated calorimeter uses 0.1 mm × 0.1 mm silicon pixels (0.0001 cm²) silicon pixels as active layers — far finer than current concepts like HGCAL (~0.5 cm²) — improving energy resolution through much finer segmentation. While the standard resolution formalism fits three numbers to a handful of discrete test-beam energies, this work is a first try at a more data-efficient alternative: learning the full response shape continuously in energy with a mixture density network. This continuous, differentiable surrogate is a natural building block for fast simulation of extremely complex calorimeters.

Wang, Peter [U. Chicago (main)]↗

Simultaneous Ka-Band Site Characterization: Goldstone, CA, White Sands, NM, and Guam, USA

To statistically characterize atmospheric effects on Ka-band links at NASA operational sites, NASA has constructed site test interferometers (STI s) which directly measure the tropospheric phase stability and rain attenuation. These instruments observe an unmodulated beacon signal broadcast from a geostationary satellite (e.g., Anik F2) and measure the phase difference between the signals received by the two antennas and its signal attenuation. Three STI s have been deployed so far: the first one at the NASA Deep Space Network Tracking Complex in Goldstone, California (May 2007); the second at the NASA White Sands Complex, in Las Cruses, New Mexico (February 2009); and the third at the NASA Tracking and Data Relay Satellite (TDRS) Remote Ground Terminal (GRGT) complex in Guam (May 2010). Two station-years of simultaneous atmospheric phase fluctuation data have been collected at Goldstone and White Sands, while one year of data has been collected in Guam. With identical instruments operating simultaneously, we can directly compare the phase stability and rain attenuation at the three sites. Phase stability is analyzed statistically in terms of the root-mean-square (rms) of the tropospheric induced time delay fluctuations over 10 minute blocks. For two years, the time delay fluctuations at the DSN site in Goldstone, CA, have been better than 2.5 picoseconds (ps) for 90% of the time (with reference to zenith), meanwhile at the White Sands, New Mexico site, the time delay fluctuations have been better than 2.2 ps with reference to zenith) for 90% of time. For Guam, the time delay fluctuations have been better than 12 ps (reference to zenith) at 90% of the time, the higher fluctuations are as expected from a high humidity tropical rain zone. This type of data analysis, as well as many other site quality characteristics (e.g., rain attenuation, infrastructure, etc.) will be used to determine the suitability of all the sites for NASA s future communication services at Ka-band.

Acosta, Roberto↗

Temperature-dependent multi-k magnetic structure in multiferroic Co{sub 3}TeO{sub 6}

Highlights: Black-Right-Pointing-Pointer Co{sub 3}TeO{sub 6} with corundum-related structure orders antiferromagnetically below 26 K. Black-Right-Pointing-Pointer A field-driven electrical polarization was observed in the antiferromagnetic state. Black-Right-Pointing-Pointer NPD data was collected and refined for ceramics and crushed single crystals. Black-Right-Pointing-Pointer Successive magnetic phase transformations are observed as a function of temperature. Black-Right-Pointing-Pointer The complex magnetic structure reflects the competing interactions in Co{sub 3}TeO{sub 6}. -- Abstract: A complex magnetic order of the multiferroic compound Co{sub 3}TeO{sub 6} has been revealed by neutron powder diffraction studies on ceramics and crushed single crystals. The compound adopts a monoclinic structure (s.g. C2/c) in the studied temperature range 2-300 K but exhibits successive antiferromagnetic transitions at low temperature. Incommensurate antiferromagnetic order with the propagation vector k{sub 1} = (0, 0.485, 0.055) sets in at 26 K. A transition to a second antiferromagnetic structure with k{sub 2} = (0, 0, 0) takes place at 21.1 K. Moreover, a transition to a commensurate antiferromagnetic structure with k{sub 3} = (0, 0.5, 0.25) occurs at 17.4 K. The magnetic structures have been determined by neutron powder diffraction using group theory analysis as a preliminary tool. Different coordinations of the Co{sup 2+} ions involved in the low-symmetry C2/c structure of Co{sub 3}TeO{sub 6} render the exchange-interaction network very complex by itself. The observed magnetic phase transformations are interpreted as an evidence of competing magnetic interactions. The temperature dependent changes in the magnetic structure, derived from refinements of high-resolution neutron data, are discussed and possible mechanisms connected with the spin reorientations are described.

36 MATERIALS SCIENCE↗

On the impact of communication complexity in the design of parallel numerical algorithms

This paper describes two models of the cost of data movement in parallel numerical algorithms. One model is a generalization of an approach due to Hockney, and is suitable for shared memory multiprocessors where each processor has vector capabilities. The other model is applicable to highly parallel nonshared memory MIMD systems. In the second model, algorithm performance is characterized in terms of the communication network design. Techniques used in VLSI complexity theory are also brought in, and algorithm independent upper bounds on system performance are derived for several problems that are important to scientific computation.

Gannon, D.↗

On the impact of communication complexity on the design of parallel numerical algorithms

This paper describes two models of the cost of data movement in parallel numerical alorithms. One model is a generalization of an approach due to Hockney, and is suitable for shared memory multiprocessors where each processor has vector capabilities. The other model is applicable to highly parallel nonshared memory MIMD systems. In this second model, algorithm performance is characterized in terms of the communication network design. Techniques used in VLSI complexity theory are also brought in, and algorithm-independent upper bounds on system performance are derived for several problems that are important to scientific computation.

Gannon, D. B.↗

The Underground Test Area Project of the Nevada Test Site: Building Confidence in Groundwater Flow and Transport Models at Pahute Mesa Through Focused Characterization Studies

Pahute Mesa at the Nevada Test Site contains about 8.0E+07 curies of radioactivity caused by underground nuclear testing. The Underground Test Area Subproject has entered Phase II of data acquisition, analysis, and modeling to determine the risk to receptors from radioactivity in the groundwater, establish a groundwater monitoring network, and provide regulatory closure. Evaluation of radionuclide contamination at Pahute Mesa is particularly difficult due to the complex stratigraphy and structure caused by multiple calderas in the Southwestern Nevada Volcanic Field and overprinting of Basin and Range faulting. Included in overall Phase II goals is the need to reduce the uncertainty and improve confidence in modeling results. New characterization efforts are underway, and results from the first year of a three-year well drilling plan are presented.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗

Probabilistic Classification Using Elemental Abundance Distributions and Lossless Image Compression in Apollo 17 Lunar Dust Samples from Mare Serenitatis

We have previously outlined a strategy for the detection of fossils [Storrie-Lombardi and Hoover, 2004] and extant microbial life [Storrie-Lombaudi and Hoover, 20051 during robotic missions to Mars using co-registered structural and chemical signatures. Data inputs included image lossless compression indices to estimate relative textural complexity and elemental abundance distributions. Two exploratory classification algorithms (principal component analysis and hierarchical cluster analysis) provide an initial tentative classification of all targets. Nonlinear stochastic neural networks are then trained to produce a Bayesian estimate of algorithm classification accuracy. The strategy previously has been successful in distinguishing regions of biotic and abiotic alteration of basalt glass from unaltered samples. [Storrie-Lombardi and Fisk, 2004; Storrie-Lombardi and Fisk, 2004] Such investigations of abiotic versus biotic alteration of terrestrial mineralogy on Earth are compromised by .the difficulty finding mineralogy completely unaffected by the ubiquitous presence of microbial life on the planet. The renewed interest in lunar exploration offers an opportunity to investigate geological materials that may exhibit signs of aqueous alteration, but are highly unlikely to contain contaminating biological weathering signatures. We here present an extension of our earlier data set to include lunar dust samples obtained during the Apollo 17 mission. Apollo 17 landed in the Taurus-Littrow Valley in Mare Serenitatis. Most of the rock samples from this region of the lunar highlands are basalts comprised primarily of plagioclase and pyroxene and selected examples of orange and black volcanic glass. SEM images and elemental abundances (C6, N7, O8, Na11, Mg12, Al13, Si14, P15, S16, Cll7, K19, Ca20, Fe26) for a series of targets in the lunar dust samples are compared to the extant cyanobacteria, fossil trilobites, Orgueil meteorite, and terrestrial basalt targets previously discussed. The data set provides a first step in producing a quantitative probabilistic methodology for geobiological analysis of returned lunar samples or in situ exploration.

Storrie-Lombardi, Michael C.↗

Wabash CarbonSAFE. Final Report

This document summarizes work detailed in separate Wabash CarbonSAFE reports; the report describes the data collection efforts of the project and consolidates the geologic characterization, well testing, and storage complex modeling results for the Mt. Simon Sandstone and Potosi Dolomite, two distinct reservoirs characterized at the Wabash CarbonSAFE project site. Also presented are summaries of work to characterize the CO 2 source and infrastructure network, as well as summaries of reports analyzing stakeholder engagement options, policy, regulatory and legal considerations, and risk assessment associated with the Wabash CarbonSAFE project site. The report then presents recommendations for the next steps for site characterization, identifies data gaps for future activities, and provides an overall assessment of site potential.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Inpainting radar missing data regions with deep learning

Abstract. Missing and low-quality data regions are a frequent problem for weather radars. They stem from a variety of sources: beam blockage, instrument failure, near-ground blind zones, and many others. Filling in missing data regions is often useful for estimating local atmospheric properties and the application of high-level data processing schemes without the need for preprocessing and error-handling steps – feature detection and tracking, for instance. Interpolation schemes are typically used for this task, though they tend to produce unrealistically spatially smoothed results that are not representative of the atmospheric turbulence and variability that are usually resolved by weather radars. Recently, generative adversarial networks (GANs) have achieved impressive results in the area of photo inpainting. Here, they are demonstrated as a tool for infilling radar missing data regions. These neural networks are capable of extending large-scale cloud and precipitation features that border missing data regions into the regions while hallucinating plausible small-scale variability. In other words, they can inpaint missing data with accurate large-scale features and plausible local small-scale features. This method is demonstrated on a scanning C-band and vertically pointing Ka-band radar that were deployed as part of the Cloud Aerosol and Complex Terrain Interactions (CACTI) field campaign. Three missing data scenarios are explored: infilling low-level blind zones and short outage periods for the Ka-band radar and infilling beam blockage areas for the C-band radar. Two deep-learning-based approaches are tested, a convolutional neural network (CNN) and a GAN that optimize pixel-level error or combined pixel-level error and adversarial loss respectively. Both deep-learning approaches significantly outperform traditional inpainting schemes under several pixel-level and perceptual quality metrics.

54 ENVIRONMENTAL SCIENCES↗

A general-purpose method for Pareto optimal placement of flow rate and concentration sensors in networked systems – With application to wastewater treatment plants

The advent of affordable computing, low-cost sensor hardware, and high-speed and reliable communications have spurred installation of ubiquitous sensors in complex engineered systems. However, ensuring reliable data quality remains a challenge. Exploitation of redundancy among sensor signals can help improving the precision of measured variables, detecting the presence of gross errors, and identifying faulty sensors. The cost of sensor ownership, maintenance efforts in particular, can still be cost-prohibitive however. Maximizing the ability to assess and control data quality while minimizing the cost of ownership thus requires a careful sensor placement. To solve this challenge, in this work we develop a generally applicable method to solve the multi-objective sensor placement problem in systems governed by linear and bilinear balance equations. Importantly, the method computes all Pareto-optimal sensor layouts with conventional computational resources and requires no information about the expected sensor quality.

42 ENGINEERING↗

Performance Prediction of Big Data Transfer Through Experimental Analysis and Machine Learning

Big data transfer in next-generation scientific applications is now commonly carried out over connections with guaranteed bandwidth provisioned in High-performance Networks (HPNs) through advance bandwidth reservation. To use HPN resources efficiently, provisioning agents need to carefully schedule data transfer requests and allocate appropriate bandwidths. Such reserved bandwidths, if not fully utilized by the requesting user, could be simply wasted or cause extra overhead and complexity in management due to exclusive access. This calls for the capability of performance prediction to reserve bandwidth resources that match actual needs. Towards this goal, we employ machine learning algorithms to predict big data transfer performance based on extensive performance measurements, which are collected over a span of several years from a large number of data transfer tests using different protocols and toolkits between various end sites on several real-life physical or emulated HPN testbeds. We first identify a comprehensive list of attributes involved in a typical big data transfer process, including end host system configurations, network connection properties, and control parameters of data transfer methods. We then conduct an in-depth exploratory analysis of their impacts on application-level throughput, which provides insights into big data transfer performance and motivates the use of machine learning. We also investigate the applicability of machine learning algorithms and derive their general performance bounds for performance prediction of big data transfer in HPNs. Experimental results show that, with appropriate data preprocessing, the proposed machine learning-based approach achieves 95% or higher prediction accuracy in up to 90% of the cases with very noisy real-life performance measurements.

Yun, Daqing↗

Constructing Neural Network Based Models for Simulating Dynamical Systems

Dynamical systems see widespread use in natural sciences like physics, biology, and chemistry, as well as engineering disciplines such as circuit analysis, computational fluid dynamics, and control. For simple systems, the differential equations governing the dynamics can be derived by applying fundamental physical laws. However, for more complex systems, this approach becomes exceedingly difficult. Data-driven modeling is an alternative paradigm that seeks to learn an approximation of the dynamics of a system using observations of the true system. In recent years, there has been an increased interest in applying data-driven modeling techniques to solve a wide range of problems in physics and engineering. Here this article provides a survey of the different ways to construct models of dynamical systems using neural networks. In addition to the basic overview, we review the related literature and outline the most significant challenges from numerical simulations that this modeling paradigm must overcome. Based on the reviewed literature and identified challenges, we provide a discussion on promising research areas.

97 MATHEMATICS AND COMPUTING↗

MetaboDirect: an analytical pipeline for the processing of FT-ICR MS-based metabolomic data

Background: Microbiomes are now recognized as the main drivers of ecosystem function ranging from the oceans and soils to humans and bioreactors. However, a grand challenge in microbiome science is to characterize and quantify the chemical currencies of organic matter (i.e., metabolites) that microbes respond to and alter. Critical to this has been the development of Fourier transform ion cyclotron resonance mass spectrometry (FT-ICR MS), which has drastically increased molecular characterization of complex organic matter samples, but challenges users with hundreds of millions of data points where readily available, user-friendly, and customizable software tools are lacking. Results: Here, we build on years of analytical experience with diverse sample types to develop MetaboDirect, an open-source, command-line-based pipeline for the analysis (e.g., chemodiversity analysis, multivariate statistics), visualization (e.g., Van Krevelen diagrams, elemental and molecular class composition plots), and presentation of direct injection high-resolution FT-ICR MS data sets after molecular formula assignment has been performed. When compared to other available FT-ICR MS software, MetaboDirect is superior in that it requires a single line of code to launch a fully automated framework for the generation and visualization of a wide range of plots, with minimal coding experience required. Among the tools evaluated, MetaboDirect is also uniquely able to automatically generate biochemical transformation networks (ab initio) based on mass differences (mass difference network-based approach) that provide an experimental assessment of metabolite connections within a given sample or a complex metabolic system, thereby providing important information about the nature of the samples and the set of microbial reactions or pathways that gave rise to them. Finally, for more experienced users, MetaboDirect allows users to customize plots, outputs, and analyses. Conclusion: Application of MetaboDirect to FT-ICR MS-based metabolomic data sets from a marine phage-bacterial infection experiment and a Sphagnum leachate microbiome incubation experiment showcase the exploration capabilities of the pipeline that will enable the research community to evaluate and interpret their data in greater depth and in less time. It will further advance our knowledge of how microbial communities influence and are influenced by the chemical makeup of the surrounding system. The source code and User’s guide of MetaboDirect are freely available through (https://github.com/Coayala/MetaboDirect) and (https://metabodirect.readthedocs.io/en/latest/), respectively.

54 ENVIRONMENTAL SCIENCES↗

Unveiling the hidden structure of complex stochastic biochemical networks

Complex Markov models are widely used and powerful predictive tools to analyze stochastic biochemical processes. However, when the network of states is unknown, it is necessary to extract information from the data to partially build the network and estimate the values of the rates. The short-time behavior of the first-passage time distributions between two states in linear chains has been shown recently to behave as a power of time with an exponent equal to the number of intermediate states. For a general Markov model we derive the complete Taylor expansion of the first-passage time distribution between two arbitrary states. By combining algebraic methods and graph theory approaches it is shown that the first term of the Taylor expansion is determined by the shortest path from the initial state to the final state. When this path is unique, we prove that the coefficient of the first term can be written in terms of the product of the transition rates along the path. It is argued that the application of our results to first-return times may be used to estimate the dependence of rates on external parameters in experimentally measured time distributions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

IL-Net: Using Expert Knowledge to Guide the Design of Furcated Neural Networks

Deep neural networks (DNN) excel at extracting patterns. Through representation learning and automated feature engineering on large datasets, such models have been highly successful in computer vision and natural language applications. Designing optimal network architectures from a principled or rational approach however has been less than successful, with the best successful approaches utilizing an additional machine learning algorithm to tune the network hyperparameters. However, in many technical fields, there exist established domain knowledge and understanding about the subject matter. In this work, we develop a novel furcated neural network architecture that utilizes domain knowledge as high-level design principles of the network. We demonstrate proof-of-concept by developing IL-Net, a furcated network for predicting the properties of ionic liquids, which is a class of complex multi-chemicals entities. Compared to existing state-of-the-art approaches, we show that furcated networks can improve model accuracy by approximately 20-35%, without using additional labeled data. Lastly, we distill two key design principles for furcated networks that can be adapted to other domains.

Sakloth, Khushmeen↗