Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Graph Analytics”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Data Validation Package December 2015 Groundwater Sampling at the Ambrosia Lake, New Mexico, Disposal Site March 2016

The Long-Term Surveillance Plan for the Ambrosia Lake, New Mexico, Disposal Site does not require groundwater monitoring because groundwater in the uppermost aquifer is of limited use, and supplemental standards have been applied to the aquifer. However, at the request of the New Mexico Environment Department, the U.S. Department of Energy conducts annual monitoring at three locations: monitoring wells 0409, 0675, and 0678. Sampling and analyses were conducted as specified in the Sampling and Analysis Plan for US. Department of Energy Office of Legacy Management Sites (LMS/PRO/S04351, continually updated). Monitoring Well 0409 was not sampled during this event because it was dry. Water levels were measured at each sampled well. One duplicate sample was collected from location 0675. Groundwater samples from the two sampled wells were analyzed for the constituents listed in Table 1. Time-concentration graphs for selected analytes are included in this report. At well 0675, the duplicate results for total dissolved solids and for most metals (magnesium, molybdenum, potassium, selenium, sodium, and uranium) were outside acceptance criteria, which may indicate non-homogeneous conditions at this location. November 2014 results for molybdenum and uranium at well 0675 also were outside acceptance criteria. The well condition will be evaluated prior to the next sampling event.

2015 Sampling Ambrosia Lake West, New Mexico↗
DOE OSTI2016

Utilizing Semantic Big Data for realizing a National-scale Infrastructure Vulnerability Analysis System

Critical Infrastructure systems(CIs) such as energy, water, transportation and communication are highly interconnected and mutually dependent in complex ways. Robust modeling of CIs interconnections is crucial to identify vulnerabilities in the CIs. We present here a national-scale Infrastructure Vulnerability Analysis System (IVAS) vision leveraging Se- mantic Big Data (SBD) tools, Big Data, and Geographical Information Systems (GIS) tools. We survey existing ap- proaches on vulnerability analysis of critical infrastructures and discuss relevant systems and tools aligned with our vi- sion. Next, we present a generic system architecture and discuss challenges including: (1) Constructing and manag- ing a CI network-of-networks graph, (2) Performing analytic operations at scale, and (3) Interactive visualization of ana- lytic output to generate meaningful insights. We argue that this architecture acts as a baseline to realize a national-scale network based vulnerability analysis system.

Chinthavali, Supriya↗
DOE OSTI2024

Data-Driven Unit Commitment Refinement - a Scalable Approach for Complex Modern Power Grids

Integration of renewable generation, which is often intermittent and decentralized, substantially increases the stochasticity and complexity of power grid operations. Future power systems planning will require significant computational capability to evaluate balance between demand and supply under varying conditions, both temporally and spatially. The standard approach for generation unit commitment is to use mixed-integer linear programming to find the optimal generation schedule considering ramping and generator constraints. In the future grid this poses computational scalability challenges because generation and demand are not known with certainty due to stochasticity in weather and complexity of the grid. To address this challenge, we present a data-driven unit commitment approach that can efficiently include stochastic weather impacts and contingency considerations to improve unit commitment. Our approach uses graph-based data analytics techniques on solutions to the security constrained (and possibly stochastic) economic dispatch problem to identify potential improvements to a given unit commitment. Recent breakthroughs in fully-parallel stochastic economic dispatch software allow this approach to be scalably deployed. Simulations on synthetic South Carolina and Texas grids show this method can improve grid reliability with security constraints over a set of contingencies, while also meaningfully lowering total generation cost.

Holt, Timothy↗
DOE OSTI2015

Scenario driven data modelling: a method for integrating diverse sources of data and data streams

A system and method of integrating diverse sources of data and data streams is presented. The method can include selecting a scenario based on a topic, creating a multi-relational directed graph based on the scenario, identifying and converting resources in accordance with the scenario and updating the multi-directed graph based on the resources, identifying data feeds in accordance with the scenario and updating the multi-directed graph based on the data feeds, identifying analytical routines in accordance with the scenario and updating the multi-directed graph using the analytical routines and identifying data outputs in accordance with the scenario and defining queries to produce the data outputs from the multi-directed graph.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Development of Ambient Mass Spectrometry Rapid Analysis Methods for Trace Inorganics

Ambient mass spectrometry is being investigated as a new method for rapidly characterizing trace inorganic species, including nuclear materials. SRNL is currently developing electrospray ionization (ESI) and paper spray ionization (PSI) methods for mass spectrometry for the detection of trace inorganic compounds JEOL AccuTOF™-DART ® LP 4G mass spectrometer. Sample analysis generates a complex three-dimensional data set with 10 2 -10 3 individual mass spectra spread temporally. To improve the quality and ease of data extraction from this amount of information, a simple data analysis pipeline written in R/R Studio has been improved and expanded upon. Specifically, the software now has header inputs to set base input/output filenames, isotopes of interest, and a list of concentrations analyzed on the instrument. Using list-based structures to enable batch processing of many concentrations at once, it then loads each file, extracts the relevant intensities for masses of interest from each spectrum, and iterates through each concentration to generate graphs of internal standard & analyte correlations, measured isotope ratios, and total ion chromatograms. It then filters the data to remove points at background levels or at the detector saturation limit. Using this filtered data, the pipeline re-creates the graphs to reveal high-quality information from a low-quality raw dataset. All graphs of the R software then output to PowerPoint format. Additionally, faster 3D visualization functionality was added to the pipeline for viewing the entire data file produced by the instrument as an intensity map. With these data analysis tools ready, samples of strontium nitrate/yttrium nitrate as an analyte/internal standard combination were measured on the AccuTOF. From the filtered data, calibration curves were prepared and limits of detection (LOD) of 1 ppb for ESI-MS and 20 ppb for PSI-MS were obtained. The quality available from the calibration curves and the low limits of detection demonstrate the value of the instrument/analysis pipeline system in characterizing trace inorganics.

47 OTHER INSTRUMENTATION↗
DOE OSTI2021

Visual Understanding of COVID-19 Knowledge Graph for Predictive Analysis

This study aims to effectively analyze and visualize the concept to concept network derived from the COVID-19 Open Research Dataset (CORD-19) dataset, where we have more than 48,000 concepts with more than 300,000 relationships between concepts. In analyzing networks, we focus on finding relationship patterns between the coronavirus disease 2019 (COVID-19) concepts and other concepts. Given the node and edge datasets, we construct directional graphs and calculate all pair shortest paths based on multiple edge weight schemes. However, statistical metrics are not sufficient to identify specific relationships represented in the network. Therefore, we also propose a visual analytics approach to effectively understand the knowledge graph. Our highly interactive visual analytics allows users to effectively analyze the evolving graphs and (COVID-19) concept nodes and other nodes related to the COVID-19 nodes. We envision that this study will pave the path to develop strategies to provide more accurate and scalable predictive analysis on knowledge graphs related to CORD19 and other biomedical knowledge graphs.

Lim, Seung-Hwan↗
DOE OSTI2020

Geometry-Driven Detection, Tracking and Visual Analysis of Viscous and Gravitational Fingers

Viscous and gravitational flow instabilities cause a displacement front to break up into finger-like fluids. The detection and evolutionary analysis of these fingering instabilities are critical in multiple scientific disciplines such as fluid mechanics and hydrogeology. However, previous detection methods of the viscous and gravitational fingers are based on density thresholding, which provides limited geometric information of the fingers. The geometric structures of fingers and their evolution are important yet little studied in the literature. In this work, we explore the geometric detection and evolution of the fingers in detail to elucidate the dynamics of the instability. Additionally, we propose a ridge voxel detection method to guide the extraction of finger cores from three-dimensional (3D) scalar fields. After skeletonizing finger cores into skeletons, we design a spanning tree based approach to capture how fingers branch spatially from the finger skeletons. Finally, we devise a novel geometric-glyph augmented tracking graph to study how the fingers and their branches grow, merge, and split over time. Feedback from earth scientists demonstrates the usefulness of our approach to performing spatio-temporal geometric analyses of fingers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Structure-aware graph neural network based deep transfer learning framework for enhanced predictive analytics on diverse materials datasets

Abstract Modern data mining methods have demonstrated effectiveness in comprehending and predicting materials properties. An essential component in the process of materials discovery is to know which material(s) will possess desirable properties. For many materials properties, performing experiments and density functional theory computations are costly and time-consuming. Hence, it is challenging to build accurate predictive models for such properties using conventional data mining methods due to the small amount of available data. Here we present a framework for materials property prediction tasks using structure information that leverages graph neural network-based architecture along with deep-transfer-learning techniques to drastically improve the model’s predictive ability on diverse materials (3D/2D, inorganic/organic, computational/experimental) data. We evaluated the proposed framework in cross-property and cross-materials class scenarios using 115 datasets to find that transfer learning models outperform the models trained from scratch in 104 cases, i.e., ≈90%, with additional benefits in performance for extrapolation problems. We believe the proposed framework can be widely useful in accelerating materials discovery in materials science.

Chemistry↗
DOE OSTI2016

Quantum Graph Analysis

In recent years, advanced network analytics have become increasingly important to na- tional security with applications ranging from cyber security to detection and disruption of ter- rorist networks. While classical computing solutions have received considerable investment, the development of quantum algorithms to address problems, such as data mining of attributed relational graphs, is a largely unexplored space. Recent theoretical work has shown that quan- tum algorithms for graph analysis can be more efficient than their classical counterparts. Here, we have implemented a trapped-ion-based two-qubit quantum information proces- sor to address these goals. Building on Sandia's microfabricated silicon surface ion traps, we have designed, realized and characterized a quantum information processor using the hyperfine qubits encoded in two 171 Yb + ions. We have implemented single qubit gates using resonant microwave radiation and have employed Gate set tomography (GST) to characterize the quan- tum process. For the first time, we were able to prove that the quantum process surpasses the fault tolerance thresholds of some quantum codes by demonstrating a diamond norm distance of less than 1 . 9 x 10 [?] 4 . We used Raman transitions in order to manipulate the trapped ions' motion and realize two-qubit gates. We characterized the implemented motion sensitive and insensitive single qubit processes and achieved a maximal process infidelity of 6 . 5 x 10 [?] 5 . We implemented the two-qubit gate proposed by Molmer and Sorensen and achieved a fidelity of more than 97 . 7%.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Considerations on the Use of Custom Accelerators for Big Data Analytics

Accelerators, including Graphic Processing Units (GPUs) for gen- eral purpose computation, many-core designs with wide vector units (e.g., Intel Phi), have become a common component of many high performance clusters. The appearance of more stable and reliable tools tools that can automatically convert code written in high-level specifications with annotations (such as C or C++) to hardware de- scription languages (High-Level Synthesis - HLS), is also setting the stage for a broader use of reconfigurable devices (e.g., Field Pro- grammable Gate Arrays - FPGAs) in high performance system for the implementation of custom accelerators, helped by the fact that new processors include advanced cache-coherent interconnects for these components. In this chapter, we briefly survey the status of the use of accelerators in high performance systems targeted at big data analytics applications. We argue that, although the progress in the use of accelerators for this class of applications has been sig- nificant, differently from scientific simulations there still are gaps to close. This is particularly true for the ”irregular” behaviors exhibited by no-SQL, graph databases. We focus our attention on the limits of HLS tools for data analytics and graph methods, and discuss a new architectural template that better fits the requirement of this class of applications. We validate the new architectural templates by mod- ifying the Graph Engine for Multithreaded System (GEMS) frame- work to support accelerators generated with such a methodology, and testing with queries coming from the Lehigh University Benchmark (LUBM). The architectural template enables better supporting the task and memory level parallelism present in graph methods by sup- porting a new control model and a enhanced memory interface. We show that out solution allows generating parallel accelerators, pro- viding speed ups with respect to conventional HLS flows. We finally draw conclusions and present a perspective on the use of reconfig- urable devices and Design Automation tools for data analytics.

Data Analytics↗
DOE OSTI2023

Interaction energy and isosteric heat of adsorption between hydrogen and magnesium diboride

Hydrogen storage materials form a crucial research topic for future energy utilization employing hydrogen and among those of interest magnesium diboride (MgB 2 ) has shown its prevalence. In this study, a first-principles analytical adsorption model of one hydrogen molecule in the vicinity of various magnesium diboride crystal surfaces was developed in order to obtain surface thermodynamic properties as a function of molecular and lattice properties. Henry's law constant (K H ) and isosteric heat of adsorption (ΔH ads ) indicators of the affinity between a gaseous molecule and a solid surface are thus calculated. The results in this paper not only address questions pertaining to the first stage of hydrogen storage processes but also advance the understanding of physisorption thermodynamics of a neutral molecule (H 2 ) coming in contact with a layered metallic-like surface (MgB 2 ). Although the model is built from a framework of classical calculations, quantum effects are incorporated as the fractional charge of the ions on the free surfaces, which is essential for the calculation of analytic thermodynamic values that approximate calculations from other methods. To benchmark our theoretical models, periodic density functional calculations were performed to determine the interactions between H 2 and different MgB 2 surfaces from first-principles. By considering both the top and sublayers of MgB 2 in calculating interaction energy, we have analytically and computationally calculated the interaction energies of H 2 molecules and MgB 2 's terminated planes, and witnessed the strong dependence of interaction energies on surface charges. We have also observed a dipole flipping phenomenon which explains the discontinuity seen in the interaction energy graph of Mg(0001). Both analytical and computational results showed heat of adsorption at zero coverage varying at a very low range (<7 kJ mol -1 ).

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

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↗
DOE OSTI2021

Discrete Green’s functions and spectral graph theory for computationally efficient thermal modeling

Here, this work concerns solutions of the heat equation with the spectral graph method, for which the temperature is defined at discrete points in the domain and the spatial relationship among the points is described by a graph. The heat equation on the graph is solved using matrix techniques involving the eigenvectors and eigenvalues of the Laplacian matrix. The spectral graph approach precludes the computationally intensive meshing and numerous time-integration steps of the finite element method. In the present work, the spectral graph method is extended to include heat loss at the boundaries with a generalized boundary condition, and physics-based edge weights are introduced which simplify the calibration process. From this approach a discrete Green’s function is defined which allows for solutions under a variety of heating conditions including: space-varying initial conditions; time-and-space varying internal heating; and, time-and-space-varying heating at boundaries of type 1 (Dirichlet), type 2 (Neumann) and type 3 (Robin). Results are provided for benchmark heat transfer problems in one spatial dimension and in three spatial dimensions, and verification is provided by comparison with exact analytical solutions and finite difference solutions. The spectral graph method converges within 0.4% error of the analytical solution. The practical utility of the approach is demonstrated by thermal simulation of a multilayer additive manufacturing process. The spectral graph results are compared to experimentally-obtained temperature data for two metal parts, with error less than 5% of the experimental measurements, with computation time less than one minute on a desktop computer.

36 MATERIALS SCIENCE↗
DOE OSTI2015

PANTHER. Pattern ANalytics To support High-performance Exploitation and Reasoning.

Sandia has approached the analysis of big datasets with an integrated methodology that uses computer science, image processing, and human factors to exploit critical patterns and relationships in large datasets despite the variety and rapidity of information. The work is part of a three-year LDRD Grand Challenge called PANTHER (Pattern ANalytics To support High-performance Exploitation and Reasoning). To maximize data analysis capability, Sandia pursued scientific advances across three key technical domains: (1) geospatial-temporal feature extraction via image segmentation and classification; (2) geospatial-temporal analysis capabilities tailored to identify and process new signatures more efficiently; and (3) domain- relevant models of human perception and cognition informing the design of analytic systems. Our integrated results include advances in geographical information systems (GIS) in which we discover activity patterns in noisy, spatial-temporal datasets using geospatial-temporal semantic graphs. We employed computational geometry and machine learning to allow us to extract and predict spatial-temporal patterns and outliers from large aircraft and maritime trajectory datasets. We automatically extracted static and ephemeral features from real, noisy synthetic aperture radar imagery for ingestion into a geospatial-temporal semantic graph. We worked with analysts and investigated analytic workflows to (1) determine how experiential knowledge evolves and is deployed in high-demand, high-throughput visual search workflows, and (2) better understand visual search performance and attention. Through PANTHER, Sandia's fundamental rethinking of key aspects of geospatial data analysis permits the extraction of much richer information from large amounts of data. The project results enable analysts to examine mountains of historical and current data that would otherwise go untouched, while also gaining meaningful, measurable, and defensible insights into overlooked relationships and patterns. The capability is directly relevant to the nation's nonproliferation remote-sensing activities and has broad national security applications for military and intelligence- gathering organizations.

58 GEOSCIENCES↗
DOE OSTI2015

SU-F-BRB-16: A Spreadsheet Based Automatic Trajectory GEnerator (SAGE): An Open Source Tool for Automatic Creation of TrueBeam Developer Mode Robotic Trajectories

Purpose: To automate creation and delivery of robotic linac trajectories with TrueBeam Developer Mode, an open source spreadsheet-based trajectory generation tool has been developed, tested and made freely available. The computing power inherent in a spreadsheet environment plus additional functions programmed into the tool insulate users from the underlying schema tedium and allow easy calculation, parameterization, graphical visualization, validation and finally automatic generation of Developer Mode XML scripts which are directly loadable on a TrueBeam linac. Methods: The robotic control system platform that allows total coordination of potentially all linac moving axes with beam (continuous, step-and-shoot, or combination thereof) becomes available in TrueBeam Developer Mode. Many complex trajectories are either geometric or can be described in analytical form, making the computational power, graphing and programmability available in a spreadsheet environment an easy and ideal vehicle for automatic trajectory generation. The spreadsheet environment allows also for parameterization of trajectories thus enabling the creation of entire families of trajectories using only a few variables. Standard spreadsheet functionality has been extended for powerful movie-like dynamic graphic visualization of the gantry, table, MLC, room, lasers, 3D observer placement and beam centerline all as a function of MU or time, for analysis of the motions before requiring actual linac time. Results: We used the tool to generate and deliver extended SAD “virtual isocenter” trajectories of various shapes such as parameterized circles and ellipses. We also demonstrated use of the tool in generating linac couch motions that simulate respiratory motion using analytical parameterized functions. Conclusion: The SAGE tool is a valuable resource to experiment with families of complex geometric trajectories for a TrueBeam Linac. It makes Developer Mode more accessible as a vehicle to quickly translate research ideas into machine readable scripts without programming knowledge. As an open source initiative, it also enables researcher collaboration on future developments. I am a full time employee at Varian Medical Systems, Palo Alto, California.

43 PARTICLE ACCELERATORS↗
DOE OSTI2018

EGBTER: Capturing Degree Distribution, Clustering Coefficients, and Community Structure in a Single Random Graph Model

Random graph models are important constructs for data analytic applications as well as pure mathematical developments, as they provide capabilities for network synthesis and principled analysis. Several models have been developed with the aim of faithfully preserving important graph metrics and substructures. With the goal of capturing degree distribution, clustering coefficient, and communities in a single random graph model, we propose a new model to address shortcomings in a progression of network modeling capabilities. The Block Two-Level Erdos-Rényi (BTER) model of Seshadhri et aI., designed to allow prescription of expected degree and clustering coefficient distributions, neglects community modeling, while the Generalized BTER (GBTER) model of Bridges et aI., designed to add community modeling capabilities to BTER, struggles to faithfully represent all three characteristics simultaneously. In this work, we fit BTER and two GBTER configurations to several real-world networks and compare the results with that of our new model, the Extended GBTER (EGBTER) model. Our results support that EBGTER adds a community-modeling flexibility to BTER, while retaining a satisfactory level of accuracy in terms of degree and clustering coefficient. Our insights and empirical testing of previous models as well as the new model are novel contributions to the literature.

El-Daghar, Omar↗
DOE OSTI2021

Enabling Scalable and Extensible Memory-mapped Datastores in Userspace

Exascale workloads are expected to incorporate data-intensive processing in close coordination with traditional physics simulations. These emerging scientific, data-analytics and machine learning applications need to access a wide variety of datastores in flat files and structured databases. Programmer productivity is greatly enhanced by mapping datastores into the application process's virtual memory space to provide a unified “in-memory” interface. Currently, memory mapping is provided by system software primarily designed for generality and reliability. However, scalability at high concurrency is a formidable challenge on exascale systems. Also, there is a need for extensibility to support new datastores potentially requiring HPC data transfer services. In this article, we present UMap , a scalable and extensible userspace service for memory-mapping datastores. Furthermore, through decoupled queue management, concurrency aware adaptation, and dynamic load balancing, UMap enables application performance to scale even at high concurrency. We evaluate UMap in data-intensive applications, including sorting, graph traversal, database operations, and metagenomic analytics. Our results show that UMap as a userspace service outperforms an optimized kernel-based service across a wide range of intra-node concurrency by 1.22-1.9 × . We performed two case studies to demonstrate UMap 's extensibility. First, a new datastore residing in remote memory is incorporated into UMap as an application-specific plugin. Second, we present a persistent memory allocator Metall built atop UMap for unified storage/memory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Exits in order: How crowding affects particle lifetimes

Diffusive processes are often represented using stochastic random walk frameworks. The amount of time taken for an individual in a random walk to intersect with an absorbing boundary is a fundamental property that is often referred to as the particle lifetime, or the first passage time. The mean lifetime of particles in a random walk model of diffusion is related to the amount of time required for the diffusive process to reach a steady state. Mathematical analysis describing the mean lifetime of particles in a standard model of diffusion without crowding is well known. However, the lifetime of agents in a random walk with crowding has received much less attention. Since many applications of diffusion in biology and biophysics include crowding effects, here we study a discrete model of diffusion that incorporates crowding. Using simulations, we show that crowding has a dramatic effect on agent lifetimes, and we derive an approximate expression for the mean agent lifetime that includes crowding effects. Our expression matches simulation results very well, and highlights the importance of crowding effects that are sometimes overlooked.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗