Search NASA⌕ Search

SEARCH · Search NASA

Results for “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 901 records · Page 50

National Geothermal Data System: Case Studies on Exploration and Development of Potential Geothermal Sites Through Distributed Data Sharing

The NGDS released version 1 of the system on April 30, 2014 using the US Geoscience Information Network (USGIN) as its data integration platform. NGDS supports the 2013 Open Data Policy, and as such, the launch was featured at the 2014 Energy Datapalooza. Currently, the NGDS features a comprehensive user interface for searching and accessing nearly 41,000 documents and more than 9 million data points shared by scores of data providers across the U.S. The NGDS supports distributed data sharing, permitting the data owners to maintain the raw data that is made available to the consumer. Researchers and industry have been utilizing the NGDS as a mechanism for promoting geothermal development across the country, from hydrothermal to ground source heat pump applications. Case studies in geothermal research and exploration from across the country are highlighted.

15 GEOTHERMAL ENERGY↗

A graph signal processing‐based multiple model Kalman filter ( GSP‐MMKF ) tool for predictive analytics: An air separation unit process application

Abstract The industrial Air Separations Unit (ASU) is a complicated and tightly operated process. The use of dynamic process analytics is also a key element of safe and economic operation of these processes, with increasing focus on predictive analytics to take preemptive actions. With the availability of real‐time data from hundreds of sensors, the data analysis process should also consider the topology of the data, as seen in sensor networks. In this paper, a novel tool is presented that considers the complex connectivity patterns in the sensor network and uses local adaptive disturbance estimations to predict global network‐scale trends. The paper introduces the emerging field of Graph Signal Processing (GSP) and presents a rigorous derivation of the tool starting from the extraction of the sensor‐network (in a graph theoretical sense) from the data. This network, which is in the form of a matrix, is then used to derive a Kalman‐filter type of state‐space model driven by input disturbances. Multiple disturbance models (e.g., step, ramp, periodic) are included to allow the model to have different kinds of disturbance propagation. Each graph node (representing the sensors used) dynamically adapts to the most recent detected disturbance individually. These estimated disturbances are propagated to the global network using the graph. Modifications to ensure stability are also discussed. The fidelity of the tool is tested on certain downtime events and the paper concludes by discussing the advantages of the method and planned future improvements.

Ghosh, Sambit↗

Stochastic fracture generation and thermo-hydro-mechanical modeling in an equivalent continuum framework for enhanced geothermal systems

Enhanced geothermal systems (EGS) involve fracturing low permeability material to establish well connectivity and then injecting and circulating fluid into the fractured subsurface for geothermal power production. Changes in fracture aperture from contraction of the cooling matrix rock may alter network connectivity and risk thermal short-circuiting. Thermo-hydro-mechanical (THM) models are a useful tool to study these processes. However, as fracture networks are complex, and data may be limited, fracture networks in THM models are often stochastically generated. Given reliance on stochastic fracture networks and THM modeling to represent the subsurface and assess productivity of EGS, increased understanding of the influence of such statistically derived fracture networks on flow and heat transport in THM models is needed. Here, a new fracture process model is developed in the reactive transport code PFLOTRAN to stochastically generate fracture families and simulate changes in fracture aperture over time due to temperature changes of the rock matrix. Sixty-four different fracture networks ranging from well to poorly-connected, are modeled in PFLOTRAN with and without mechanical processes (THM vs TH). Results indicate that for well-connected fracture networks, thermal short-circuiting is less of a concern due to the abundance of available alternative flowpaths. For poorly-connected fracture networks, inclusion of mechanical processes showed steep thermal drawdown coincident with increase in fracture aperture along developing colder flowpaths, demonstrating the risk of thermal short-circuiting. Simulations with additional, larger fractures engineered to establish connectivity in a poorly-fractured subsurface, indicate that while stochastic variation of fracture orientation of the background network had limited influence, such variation in the engineered fractures significantly affected flow and heat transport.

Discrete fracture networks (DFN)↗

Network traffic control for multi-homed end-hosts via SDN

Software-defined networking (SDN) is an emerging technology of efficiently controlling and managing computer networks, such as in data centres, wide-area networks, as well as in ubiquitous communication. In this study, the authors explore the idea of embedding the SDN components, represented by SDN controller and virtual switch, in end-hosts to improve network performance. In particular, the authors consider load balancing across multiple network interfaces on end-hosts with different link capacity scenarios. The authors have explored and implemented different SDN-based load-balancing approaches based on OpenFlow software switches, and have demonstrated the feasibility and the potential of this approach. The proposed system has been evaluated with MultiPath transmission control protocol (MPTCP). Furthermore, the proposed results demonstrated the potential of applying the SDN concepts on multi-homed devices resulting in an increase in achieved throughput of 55% compared to the legacy single network approach and 10% compared to the MPTCP.

97 MATHEMATICS AND COMPUTING↗

OUTGASSING BEHAVIOR OF C/2012 S1 (ISON) FROM 2011 SEPTEMBER TO 2013 JUNE

We report photometric observations for comet C/2012 S1 (ISON) obtained during the time period immediately after discovery (r = 6.28 AU) until it moved into solar conjunction in mid-2013 June using the UH2.2 m, and Gemini North 8 m telescopes on Mauna Kea, the Lowell 1.8 m in Flagstaff, the Calar Alto 1.2 m telescope in Spain, the VYSOS-5 telescopes on Mauna Loa Hawaii and data from the CARA network. Additional pre-discovery data from the Pan STARRS1 survey extends the light curve back to 2011 September 30 (r = 9.4 AU). The images showed a similar tail morphology due to small micron sized particles throughout 2013. Observations at submillimeter wavelengths using the James Clerk Maxwell Telescope on 15 nights between 2013 March 9 (r = 4.52 AU) and June 16 (r = 3.35 AU) were used to search for CO and HCN rotation lines. No gas was detected, with upper limits for CO ranging between 3.5-4.5 × 10{sup 27} molecules s{sup –1}. Combined with published water production rate estimates we have generated ice sublimation models consistent with the photometric light curve. The inbound light curve is likely controlled by sublimation of CO{sub 2}. At these distances water is not a strong contributor to the outgassing. We also infer that there was a long slow outburst of activity beginning in late 2011 peaking in mid-2013 January (r ∼ 5 AU) at which point the activity decreased again through 2013 June. We suggest that this outburst was driven by CO injecting large water ice grains into the coma. Observations as the comet came out of solar conjunction seem to confirm our models.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Integrating Deep Learning and Hydrodynamic Modeling to Improve the Great Lakes Forecast

The Laurentian Great Lakes, one of the world’s largest surface freshwater systems, pose a modeling challenge in seasonal forecast and climate projection. While physics-based hydrodynamic modeling is a fundamental approach, improving the forecast accuracy remains critical. In recent years, machine learning (ML) has quickly emerged in geoscience applications, but its application to the Great Lakes hydrodynamic prediction is still in its early stages. This work is the first one to explore a deep learning approach to predicting spatiotemporal distributions of the lake surface temperature (LST) in the Great Lakes. Our study shows that the Long Short-Term Memory (LSTM) neural network, trained with the limited data from hypothetical monitoring networks, can provide consistent and robust performance. The LSTM prediction captured the LST spatiotemporal variabilities across the five Great Lakes well, suggesting an effective and efficient way for monitoring network design in assisting the ML-based forecast. Furthermore, we employed an explainable artificial intelligence (XAI) technique named SHapley Additive exPlanations (SHAP) to uncover how the features impact the LSTM prediction. Our XAI analysis shows air temperature is the most influential feature for predicting LST in the trained LSTM. The relatively large bias in the LSTM prediction during the spring and fall was associated with substantial heterogeneity of air temperature during the two seasons. In contrast, the physics-based hydrodynamic model performed better in spring and fall yet exhibited relatively large biases during the summer stratification period. Finally, we developed a statistical integration of the hydrodynamic modeling and deep learning results based on the Best Linear Unbiased Estimator (BLUE). The integration further enhanced prediction accuracy, suggesting its potential for next-generation Great Lakes forecast systems.

Xue, Pengfei (ORCID:000000025702421X)↗

Design of Accelerator Online Simulator Server Using Structured Data

Model based control plays an important role for a modern accelerator during beam commissioning, beam study, and even daily operation. With a realistic model, beam behaviour can be predicted and therefore effectively controlled. The approach used by most current high level application environments is to use a built-in simulation engine and feed a realistic model into that simulation engine. Instead of this traditional monolithic structure, a new approach using a client-server architecture is under development. An on-line simulator server is accessed via network accessible structured data. With this approach, a user can easily access multiple simulation codes. This paper describes the design, implementation, and current status of PVData, which defines the structured data, and PVAccess, which provides network access to the structured data.

43 PARTICLE ACCELERATORS↗

Segmentation of nanotomographic cortical bone images for quantitative characterization of the osteoctyte lacuno-canalicular network

A newly developed data processing method able to characterize the osteocytes lacuno-canalicular network (LCN) is presented. Osteocytes are the most abundant cells in the bone, living in spaces called lacunae embedded inside the bone matrix and connected to each other with an extensive network of canals that allows for the exchange of nutrients and for mechanotransduction functions. The geometrical three-dimensional (3D) architecture is increasingly thought to be related to the macroscopic strength or failure of the bone and it is becoming the focus for investigating widely spread diseases such as osteoporosis. To obtain 3D LCN images non-destructively has been out of reach until recently, since tens-of-nanometers scale resolution is required. Ptychographic tomography was validated for bone imaging in [1], showing clearly the LCN. The method presented here was applied to 3D ptychographic tomographic images in order to extract morphological and geometrical parameters of the lacuno-canalicular structures.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Physics-informed graph neural networks for predicting cetane number with systematic data quality analysis

Designing alternative fuels for advanced compression ignition engines necessitates a predictive model for cetane number (CN). In this study, the physics-informed graph neural networks are introduced for a reliable CN prediction by considering molecular features pertinent to the physical properties of molecules that affect CN. The reliability of measured data is another key factor to consider for improving the predictive model. Various experimental instruments for measuring CN exist, including standard and non-standard methods. In this regard, a systematic data quality analysis was carried out for the total 630 CNs collected from literature and new measurements in this study using Advanced Fuel Ignition Delay Analyzer (AFIDA). The results from this data curation process were reflected in the model by imposing lower sample weights on the data coming from less reliable measurement techniques. This approach effectively maximized the prediction accuracy while incorporating data from all available sources. Using the sample weights decreased the mean absolute error (MAE) up to 0.8 CN units. The accuracy was also improved by introducing the CN-related physical properties (the number of hydrogen bond donors and acceptors); the test set MAE is 5.74 and 7.01 for the model with and without such properties, respectively. Investigating molecular structural effects on CN was also carried out to gain chemical insights into factors used to design new fuel candidates. The dimensionality reduction analysis of feature vectors showed a clear clustering in terms of functional groups and CN and the structural effect derived from the model was consistent with the physicochemical insights. Finally, this physics-informed model and data curation would be helpful for accurate CN prediction and inform rational fuel design.

97 MATHEMATICS AND COMPUTING↗

Geometric algorithm for efficient coincident detection of gravitational waves

Data from a network of gravitational-wave detectors can be analyzed in coincidence to increase detection confidence and reduce nonstationarity of the background. We propose and explore a geometric algorithm to combine the data from a network of detectors. The algorithm makes optimal use of the variances and covariances that exist among the different parameters of a signal in a coincident detection of events. The new algorithm essentially associates with each trigger ellipsoidal regions in parameter space defined by the covariance matrix. Triggers from different detectors are deemed to be in coincidence if their ellipsoids have a nonzero overlap. Compared to an algorithm that uses uncorrelated windows separately for each of the signal parameters, the new algorithm greatly reduces the background rate thereby increasing detection efficiency at a given false alarm rate.

79 ASTRONOMY AND ASTROPHYSICS↗

Development of Steady-State and Dynamic Mass and Energy Constrained Neural Networks for Distributed Chemical Systems Using Noisy Transient Data

The paper presents the development of algorithms for mass and energy constrained neural network models that can exactly conserve the overall mass and energy of distributed chemical process systems, even though the noisy transient data used for optimal model training violate the same. In contrast to approximately satisfying mass and energy balance constraints of a system by soft penalization of objective function, algorithms have been developed for solving equality-constrained nonlinear optimization problems, thus providing the guarantee of exactly satisfying the system mass and energy conservation laws. For developing dynamic mass-energy constrained network models for distributed systems, hybrid series and parallel dynamic-static neural networks have been leveraged. The developed algorithms for solving both the training and forward problems are validated using both steady-state and dynamic data in the presence of various noise characteristics. The developed data-driven algorithms are flexible to exactly satisfy mass and energy balance constraints for dynamic chemical processes if the system holdup information is available. The proposed network structures and algorithms are applied to the development of data-driven lumped and distributed models of an adiabatic superheater/reheater system, a nonisothermal continuous stirred tank reactor, as well as an electrically heated plug-flow reactor system where one form of energy gets transformed to another. It has been observed that the mass-energy constrained neural networks yield a root mean squared error of <1% with respect to the system truth for the case studies evaluated in this work.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Machine Learning Eliminates Reanalysis Warm Bias and Reveals Weaker Winter Surface Cooling Over Arctic Sea Ice

The surface energy budget governs Arctic sea-ice growth/melt, yet observations are sparse, and reanalysis data sets suffer from systematic biases. Here, we train a neural network with observational data to bias-correct hourly ERA5 fluxes over Arctic ice-covered regions (≥70°N; sea-ice concentration >80%) for 1994–2024. Training data cover two full seasonal cycles and different sea-ice regimes. The neural network reduces RMSE for net shortwave radiation by ∼40%, downward longwave radiation by ∼16% and the total surface energy budget by ∼55%, eliminating the wintertime warm bias of ∼4 K in ERA5. Wintertime surface cooling is reduced by ∼50%, yielding thermodynamic ice-growth estimates of ∼80–120 cm, consistent with SMOS–CryoSat satellite thickness increases and in contrast to the 150–200 cm growth implied by ERA5. Our bias-corrected data capture the observed clear/cloudy states of the winter boundary layer and can be used to study Arctic climatology, evaluate climate models and drive sea-ice-ocean models.

Hossain, Akil [Alfred Wegener Institute for Polar ↗

Social Sensor Analytics: Making Sense of Network Models in Social Media

Social networks can be thought of as noisy sensor networks mapping real world information to the web. Owing to the extensive body of literature in sensor network analysis, this work sought to apply several novel and traditional methods in sensor network analysis for the purposes of efficiently interrogating social media data streams from raw data. We carefully revisit our definition of a social media signal from previous work both in terms of time-varying features within the data and the networked nature of the medium. Further, we detail our analysis of global patterns in Twitter over the months of November 2013 and June 2014, detect and categorize events, and illustrate how these analyses can be used to inform graph-based models of Twitter, namely using a recent network influence model called PhySense: similar to PageRank but tuned to behavioral analysis by leveraging a sociologically inspired probabilistic model. We ultimately identify forms of information dissemination via analysis of time series and dynamic graph spectra and corroborate these findings through manual investigation of the data as a requisite step in modeling the diffusion process with PhySense. We hope to sufficiently characterize global behavior in a medium such as Twitter as a means of learning global model parameters one may use to predict or simulate behavior on a large scale. We have made our time series and dynamic graph analytical code available via a GitHub repository https://github.com/cpatdowling/salsa and our data are available upon request.

event detection↗

Deep Reinforcement Learning for Distribution System Operations: A Tutorial and Survey

Here, the rapid evolution of modern electric power distribution systems into complex networks of interconnected active devices, distributed generation (DG), and storage poses increasing difficulties for system operators. The large-scale integration of distributed energy resources (DERs) and the rapid exchange of measurement data via communication networks present major opportunities for advancing grid operations but also introduce greater uncertainty, higher data dimensionality, more complex network and device models, and challenging control and optimization problems. Deep reinforcement learning (DRL) algorithms are promising in addressing these challenges. However, they have not been effectively adapted for power systems applications, requiring extensive customization for implementation and evaluation. This has resulted in reproducibility challenges and a steep learning curve for researchers new to applying DRL algorithms to the power systems domain. To bridge these gaps, this tutorial aims to serve as a valuable resource for researchers interested in exploring learning-based algorithms to operate active power distribution networks. Specifically, this work presents a generalized process for translating sequential decision-making problems in power distribution systems into Markov decision process (MDP) formulations, illustrated through concrete grid service examples. Additionally, we introduce a simple environment design strategy to develop and evaluate example DRL algorithms for distribution system applications, complete with an included code repository to guide users through environment construction.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Review of Graph Databases for Big Data Dynamic Entity Scoring

Modeling data as a graph enables users to quickly analyze networked phenomenon, such as social network-based marketing data (e.g., linking entities in social media based on their friends and their "likes", their friend-of-a-friend's "likes", etc.) and scientific data, such as in biology to assess a gene's proximity in a graph to particular disease phenotype. Numerous purpose-built graph databases (DBs) called “NoSQL” or “Not Only SQL” DBs are emerging to support this type of graph analysis. These DBs differ from traditional relational DBs in that they are optimized to improve storage and query performance across large, complex graphs. This document reviews the state of the art in graph DBs and identifies potential DBs that show promise for dynamic entity-scoring algorithms. Dynamic entity scoring is a new area of research that allows analysis of data within graphs using undirected methods to weigh the edges of the graph based on the proximity or ambient influence of near-by nodes. The EntityScore (eScore) methodology developed at Lawrence Livermore National Laboratory (LLNL) is one application of these emerging graph-analysis algorithms to help analysts identify and prioritize entities, based on complex, analyst-defined weighting criteria. Our review examines a wide range of different, well-known graph DBs in use since at least 2010 and identifies unique advantages and disadvantages that may impact eScore-specific requirements. Specifically, we review data structures employed, query features employed, load times, query calculation times, memory usage and several other important attributes reported in the literature. We limited our considerations for eScore to Blueprints-compliant graph DBs (https://github.com/tinkerpop/blueprints/) because they provide a standard, java application programming interface (API) based on the property graph model.

42 ENGINEERING↗

Network Scale Ubiquitous Volume Estimation Using Tree-Based Ensemble Learning Methods

Currently real-time, ubiquitous volume data for roadway networks remains the key missing dimension in traffic operations. Most volume data are average annual daily traffic (AADT) measures derived from the Highway Performance Monitoring System (HPMS). Although methods to factor the AADT to hourly averages for typical day of week exist, actual volume data is limited to a sparse collection of locations in which volumes are continuously recorded. This paper explores the use of state-of-art machine learning techniques to estimate accurate real-time volume measures that span the highway network providing ubiquitous coverage in space, and point-in-time measures for a specific date and time. Three tree-based ensemble learning models, random forest (RF), gradient boost machine (GBM), and extreme gradient boost (XGBoost), were tested for volume estimation by learning from combined dataset of commercial probe data provided by TomTom, the FHWA's Travel Monitoring Analysis System (TMAS) data, and other infrastructure attributes such as number of lanes, speed limit, and weather. The methods were tested on major corridors and freeways in the metropolitan area of Denver. All three machine learning methods were able to provide hourly volume estimates 24 hours a day, 7 days a week, and 365 days a year with around 18% mean absolute error to true volume and about 5% of error with respect to roadway capacity. The low error measures allow the potential application by transportation agencies.

33 ADVANCED PROPULSION SYSTEMS↗

Reconstructing parton distribution functions from Ioffe time data: from Bayesian methods to neural networks

The computation of the parton distribution functions (PDF) or distribution amplitudes (DA) of hadrons from first principles lattice QCD constitutes a central open problem in high energy nuclear physics. In this study, we present and evaluate the efficiency of several numerical methods, well established in the study of inverse problems, to reconstruct the full x-dependence of PDFs. Our starting point are the so called Ioffe time PDFs, which are accessible from Euclidean time simulations in conjunction with a matching procedure. Using realistic mock data tests, we find that the ill-posed incomplete Fourier transform underlying the reconstruction requires careful regularization, for which both the Bayesian approach as well as neural networks are efficient and flexible choices.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Understanding data motion in the modern HPC data center

The utilization and performance of storage, compute, and network resources within HPC data centers have been studied extensively, but much less work has gone toward characterizing how these resources are used in conjunction to solve larger scientific challenges. To address this gap, we present our work in characterizing workloads and workflows at a data-center-wide level by examining all data transfers that occurred between storage, compute, and the external network at the National Energy Research Scientific Computing Center over a three-month period in 2019. Using a simple abstract representation of data transfers, we analyze over 100 million transfer logs from Darshan, HPSS user interfaces, and Globus to quantify the load on data paths between compute, storage, and the wide-area network based on transfer direction, user, transfer tool, source, destination, and time. We show that parallel I/O from user jobs, while undeniably important, is only one of several major I/O workloads that occurs throughout the execution of scientific workflows. We also show that this approach can be used to connect anomalous data traffic to specific users and file access patterns, and we construct time-resolved user transfer traces to demonstrate that one can systematically identify coupled data motion for individual workflows.

Lockwood, GK↗