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 253 records · Page 14

Statistical mechanics of graphity models

Graphity models are characterized by configuration spaces in which states correspond to graphs and Hamiltonians that depend on local properties of graphs such as the degrees of vertices and numbers of short cycles. As statistical systems, graphity models can be studied analytically by estimating their partition functions or numerically by Monte Carlo simulations. Results presented here are based on both of these approaches and give new information about the high- and low-temperature behavior of the models and the transitions between them. In particular, it is shown that matter degrees of freedom must play an important role in order for the low-temperature regime to be described by graphs resembling interesting extended geometries.

79 ASTRONOMY AND ASTROPHYSICS↗

Graph-state basis for Pauli channels

Quantum capacities of Pauli channels are not additive, a degenerate quantum code may improve the hashing bound of the capacity. The difficulty in approaching the capacity is how to calculate the coherent information of a generic degenerate quantum code. Using graph state basis, we greatly reduce the problem for the input of quantum error-correcting code. We show that for a graph diagonal state passing through a Pauli channel the output state is diagonalizable and the joint output state of the system and ancilla is block diagonalizable. When the input state is an equal probable mixture of codewords of a stabilizer code, the coherent information can be analytically obtained.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

STRUCTURAL ANNOTATION OF EM IMAGES BY GRAPH CUT

Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective analytical method is to characterize the composition of a specimen based on user-defined patterns of texture and contrast formation. However, such a simple requirement demands an improved model for stability and robustness. Here, an interactive computational model is introduced for learning patterns of interest by example. The learned patterns bound an active contour model in which the traditional gradient descent optimization is replaced by the more efficient optimization of the graph cut methods. First, the energy function is defined according to the curve evolution. Next, a graph is constructed with weighted edges on the energy function and is optimized with the graph cut algorithm. As a result, the method combines the advantages of the level set method and graph cut algorithm, i.e.,"topological" invariance and computational efficiency. The technique is extended to the multi-phase segmentation problem; the method is validated on synthetic images and then applied to specimens imaged by transmission electron microscopy(TEM).

60 APPLIED LIFE SCIENCES↗

Evaluation of Visualization Heuristics

Heuristics have been used since the early 1990's in the Human Computer Interaction (HCI) domain, for evaluating user interfaces. Most notably, heuristics developed by Nielsen and Molich (1990) have been used by the HCI community. Forsell and Johansson (2010) used the same methodology as Nielsen and Molich and developed a set of 10 heuristics for information visualization. Currently, neither the information visualization or the visual analytics community has adopted these heuristics. However, several studies have been conducted using heuristics. Hearst et al. (2015) found that using the heuristics for visualizations along with asking questions about the data resulted in complementary results as the questions about the data could compensate for heuristics that were difficult to understand and apply. Heli Väätäjä et al. (2016) found that heuristics related to interaction, veracity, and aesthetics needed to be added to the Forsell and Johansson (2010) set. They also noted that a lack of domain knowledge caused the evaluators issues in conducting a heuristic evaluation. We conducted a controlled experiment to determine what factors might impact the expert evaluators' capability to conduct a heuristic evaluation of a static information visualization. In particular, we wanted to understand how their familiarity with the visualizations and their experience in conducting heuristic evaluations impacted their evaluations of visualizations. We recruited 10 participants who were domain experts in the visualization field each having experience with one of more of the following: user experience design or research, user interface development, and human computer interaction research. We used a heuristic set proposed by Forsell and Johansson. Participants were also asked to complete a demographic survey in which they rated their experience with each visualization type generally, their experience conducting heuristic evaluations, their experience using each visualization type to extract information, and their experience developing and creating each visualization type. The participants were shown a series of 5 common visualizations (Scatterplots, Sunbursts, Tree Maps, Parallel Sets, and Area Graphs) all displaying the VAST 2008 Mini Challenge Two- Migrant Boats data . Participants were given a suggested analytical question related to each visualization to keep in mind as they applied the 10 heuristics to each visualization. They were asked if they could find any usability problems in the visualizations and which heuristic(s) helped them to identify these problems. The participants were asked to rate how relevant each heuristic was for evaluating each visualization along with rating how confident they felt in their ability to apply the heuristic to evaluate each visualization. At the conclusion of the study, participants provided qualitative feedback on the usability issues of each visualization. Additionally, we collected eye tracking data on 6 of the 10 participants. We will be using this data to determine how long participants looked at the various visualizations and what parts of the visualizations they focused on. We had two hypotheses for this empirical evaluation: 1.The Forsell and Johansson heuristics of Orientation and help, Data set reduction, and Prompting are less useful for static visualizations because they require some interaction in order to test completely. 2.Participants that do not have experience with heuristic evaluation will provide lower evaluation scores for the heuristics compared to those that have experience. Related to hypothesis 1, as our study used only static visualizations, interaction-related usability challenges should be harder to identify. This should result in lower usefulness ratings for those heuristics. Preliminary results indicate that participants found it more difficult to apply heuristics to unfamiliar visualizations.

Williams, Ryan G.↗

Multilayer spectral graph clustering via convex layer aggregation

Multilayer graphs are commonly used for representing different relations between entities and handling heterogeneous data processing tasks. New challenges arise in multilayer graph clustering for assigning clusters to a common multilayer node set and for combining information from each layer. This paper presents a theoretical framework for multilayer spectral graph clustering of the nodes via convex layer aggregation. Under a novel multilayer signal plus noise model, we provide a phase transition analysis that establishes the existence of a critical value on the noise level that permits reliable cluster separation. The analysis also specifies analytical upper and lower bounds on the critical value, where the bounds become exact when the clusters have identical sizes. Numerical experiments on synthetic multilayer graphs are conducted to validate the phase transition analysis and study the effect of layer weights and noise levels on clustering reliability.

97 MATHEMATICS AND COMPUTING↗

Improvements to the APBS biomolecular solvation software suite: Improvements to the APBS Software Suite

The Adaptive Poisson-Boltzmann Solver (APBS) software was developed to solve the equations of continuum electrostatics for large biomolecular assemblages that has provided impact in the study of a broad range of chemical, biological, and biomedical applications. APBS addresses three key technology challenges for understanding solvation and electrostatics in biomedical applications: accurate and efficient models for biomolecular solvation and electrostatics, robust and scalable software for applying those theories to biomolecular systems, and mechanisms for sharing and analyzing biomolecular electrostatics data in the scientific community. To address new research applications and advancing computational capabilities, we have continually updated APBS and its suite of accompanying software since its release in 2001. In this manuscript, we discuss the models and capabilities that have recently been implemented within the APBS software package including: a Poisson-Boltzmann analytical and a semi-analytical solver, an optimized boundary element solver, a geometry-based geometric flow solvation model, a graph theory based algorithm for determining pKa values, and an improved web-based visualization tool for viewing electrostatics.

Biomedical applications↗

Hopping approach towards exciton dissociation in conjugated polymers

By employing random walk an analytic theory for the dissociation of singlet excitons in a random organic solid, for instance, a conjugated polymer, has been developed. At variance of conventional three-dimensional Onsager theory, it is assumed that an exciton with finite lifetime can first transfer endothermically an electron to an adjacent site, thereby generating a charge transfer state whose energy is above the energy of that of the initial exciton. In a second step the latter can fully dissociate in accordance with Onsager's concept Brownian motion. The results indicate that, depending of the energy required for the first jump, the first jump contributes significantly to the field dependence of the dissociation yield. Disorder weakens the temperature dependence of the yield dramatically and precludes extracting information on the exciton binding energy from it.

36 MATERIALS SCIENCE↗

Graph-Based Modeling for the Detection and Tracking of Sarin-Surrogate-Induced Neurotoxicity Using a Human-Relevant, In-Vitro Brain Model

Organophosphorus (OP) nerve agents are a chemical threat to the United States, to the civilian population (e.g., pesticides) and historically weaponized (e.g., sarin) as chemical warfare agents. The unprecedented, accelerated process from “bench-to-bedside” during the SARSCov2 pandemic has made it clear that technology and tools need to be readily available for immediate response. Advances in human organ tissue mimetic systems are a promising technology to evaluate the human-relevant response in vitro for basic and applied research and drug screening. In particular, current brain microphysiological systems (MPS) have the capability to monitor and detect changes in engineered human neural circuit activity. However, current data analytics approaches for these systems lack the granularity to functionally detect and distinguish the different mechanisms that occur in the brain following neurotoxicity, injury, and disease. The goal of this project was to advance the computational analytical capabilities of the brain MPS to detect functional changes in neural circuit structure at different stages of Sarin surrogate-induced neurotoxicity. We developed graph-based models to (1) identify the composition of the neural circuit structure; (2) detect and monitor how this structure changes following sarin-induced neurotoxicity; and (3) evaluate the analytical pipeline using known/promising oxime reactivators. Through experiments on the bMPS where in vitro neuronal cultures were exposed to a sarin surrogate, we demonstrated the capabilities of our computational pipeline to identify different responses in the functional networks of brain cells exposed to low and high concentrations of the nerve agent. We identified a biphasic response of human neural network activity following exposure to a sarin-surrogate that had not been reported in the literature before. The graph-based models and software developed in this project can be used for future studies that leverage the brain MPS technology, such as treatment efficacy assessment.

59 BASIC BIOLOGICAL SCIENCES↗

Percolator: Scalable Pattern Discovery in Dynamic Graphs

We demonstrate Percolator, a distributed system for graph pattern discovery in dynamic graphs. In contrast to conventional mining systems, Percolator advocates efficient pattern mining schemes that (1) support pattern detection with keywords; (2) integrate incremental and parallel pattern mining; and (3) support analytical queries such as trend analysis. The core idea of Percolator is to dynamically decide and verify a small fraction of patterns and their in- stances that must be inspected in response to buffered updates in dynamic graphs, with a total mining cost independent of graph size. We demonstrate a) the feasibility of incremental pattern mining by walking through each component of Percolator, b) the efficiency and scalability of Percolator over the sheer size of real-world dynamic graphs, and c) how the user-friendly GUI of Percolator inter- acts with users to support keyword-based queries that detect, browse and inspect trending patterns. We also demonstrate two user cases of Percolator, in social media trend analysis and academic collaboration analysis, respectively.

Choudhury, Sutanay↗

Alternative trajectories of electron density to plot the atomic connectivity graph in the region of nondirectional interactions

Model supramolecular associates possessing nondirectional intermolecular interactions were investigated in order to demonstrate the opportunity of plotting of an atomic connectivity graph based on trajectories of Hessian eigenvector of electron density corresponding to the largest eigenvalue. Such trajectories are a reasonable alternative to the gradient bond paths in the case of proximity of the latter to the T-shaped form upon the presence of parallel surface of the zero-flux of electron density in the neighborhood of gradient-based trajectory.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A graph embedding‐based approach for automatic cyber‐physical power system risk assessment to prevent and mitigate threats at scale

Abstract Power systems are facing an increasing number of cyber incidents, potentially leading to damaging consequences to both physical and cyber aspects. However, the development of analytical methods for the study of large‐scale power infrastructures as cyber‐physical systems is still in its early stages. Drawing inspiration from machine‐learning techniques, the authors introduce a method inspired by the principles of graph embedding that is tailored for quantitative risk assessment and the exploration of possible mitigation strategies of large‐scale cyber‐physical power systems. The primary advantage of the graph embedding approach lies in its ability to generate numerous random walks on a graph, simulating potential access paths. Meanwhile, it enables capturing high‐dimensional structures in low‐dimensional spaces, facilitating advanced machine‐learning applications, and ensuring scalability and adaptability for comprehensive network analysis. By employing this graph embedding‐based approach, the authors present a structured and methodical framework for risk assessment in cyber‐physical systems. The proposed graph embedding‐based risk analysis framework aims to provide a more insightful perspective on cyber‐physical risk assessment and situation awareness for power systems. To validate and demonstrate its applicability, the method has been tested on two cyber‐physical power system models: the Western System Coordinating Council (WSCC) 9‐Bus System and the Illinois 200‐Bus System , thereby showing its advantages in enhancing the accuracy of risk analysis and comprehensiveness of situational awareness.

Sun, Shining↗

Graph neural networks for CO 2 solubility predictions in Deep Eutectic Solvents

Deep Eutectic Solvents (DESs) are a promising class of solvents for CO 2 capture. DESs are complex mixtures that can be designed to optimize CO solubility and overall capture process efficiency. However, the vast design landscape of DES mixtures makes experimental investigation prohibitive; as such, there is a need for computational models that can quickly and efficiently navigate the design space and inform data collection efforts. In this work, we propose Graph Neural Network (GNN) models for predicting CO 2 solubility for DESs; the GNN leverages a mixture graph representation that captures the molecular structure of the DES components as well as their intermolecular interactions. Here, we compare the GNN framework against alternative architectures (neural networks, graph convolution networks, and random forests) and data representations (molecular fingerprints, sigma profiles, and graphs). We show that the proposed approach offers superior predictive performance; specifically, we show that solubility can be predicted reliably directly from molecular structure (without the need of using sigma profiles as proposed in previous studies). This result is important, as obtaining sigma profiles requires expensive density functional theory computations. We also explored the ability of GNNs to predict solubility for new DES mixtures and operating conditions. We found that the model extrapolates across temperature reliably. However, we also found deficiencies in the ability of the model to predict solubility for DES mixtures, pressures, and molar ratio not included in the training sets; we show that this is due to an inherent lack of chemical diversity in datasets available in the literature. The proposed computational capabilities can thus help navigate the design space of DES and inform data collection efforts. Our models, data, and benchmarks are shared as Python code implemented in Jupyter notebooks.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Enhanced memory performance thanks to neural network assortativity

The behaviour of many complex dynamical systems has been found to depend crucially on the structure of the underlying networks of interactions. An intriguing feature of empirical networks is their assortativity--i.e., the extent to which the degrees of neighbouring nodes are correlated. However, until very recently it was difficult to take this property into account analytically, most work being exclusively numerical. We get round this problem by considering ensembles of equally correlated graphs and apply this novel technique to the case of attractor neural networks. Assortativity turns out to be a key feature for memory performance in these systems - so much so that for sufficiently correlated topologies the critical temperature diverges. We predict that artificial and biological neural systems could significantly enhance their robustness to noise by developing positive correlations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Many-body expansion based machine learning models for octahedral transition metal complexes

Abstract Graph-based machine learning (ML) models for material properties show great potential to accelerate virtual high-throughput screening of large chemical spaces. However, in their simplest forms, graph-based models do not include any 3D information and are unable to distinguish stereoisomers such as those arising from different orderings of ligands around a metal center in coordination complexes. In this work we present a modification to revised autocorrelation descriptors, a molecular graph featurization method, for predicting spin state dependent properties of octahedral transition metal complexes (TMCs). Inspired by analytical semi-empirical models for TMCs, the new modeling strategy is based on the many-body expansion (MBE) and allows one to tune the captured stereoisomer information by changing the truncation order of the MBE. We present the necessary modifications to include this approach in two commonly used ML methods, kernel ridge regression and feed-forward neural networks. On a test set composed of all possible isomers of binary TMCs, the best MBE models achieve mean absolute errors (MAEs) of 2.75 kcal mol −1 on spin-splitting energies and 0.26 eV on frontier orbital energy gaps, a 30%–40% reduction in error compared to models based on our previous approach. We also observe improved generalization to previously unseen ligands where the best-performing models exhibit MAEs of 4.00 kcal mol −1 (i.e. a 0.73 kcal mol −1 reduction) on the spin-splitting energies and 0.53 eV (i.e. a 0.10 eV reduction) on the frontier orbital energy gaps. Because the new approach incorporates insights from electronic structure theory, such as ligand additivity relationships, these models exhibit systematic generalization from homoleptic to heteroleptic complexes, allowing for efficient screening of TMC search spaces.

Meyer, Ralf (ORCID:0000000322360261)↗

Metall: A persistent memory allocator for data-centric analytics

Data analytics applications transform raw input data into analytics-specific data structures before performing analytics. Unfortunately, such data ingestion steps are often more expensive than analytics. In addition, various types of NVRAM devices are already used in many HPC systems today. Such devices will be useful for storing and reusing data structures beyond a single process life cycle. We developed Metall, a persistent memory allocator built on top of the memory-mapped file mechanism. Metall enables applications to transparently allocate custom C++ data structures into various types of persistent memories. Metall incorporates a concise and high-performance memory management algorithm inspired by Supermalloc and the rich C++ interface developed by Boost.Interprocess library. On a dynamic graph construction workload, Metall achieved up to 11.7x and 48.3x performance improvements over Boost.Interprocess and memkind (PMEM kind), respectively. We also demonstrate Metall’s high adaptability by integrating Metall into a graph processing framework, GraphBLAS Template Library. Here this study’s outcomes indicate that Metall will be a strong tool for accelerating future large-scale data analytics by allowing applications to leverage persistent memory efficiently.

97 MATHEMATICS AND COMPUTING↗

Transient flow modeling in fractured media using graphs

In this work, we describe a method to simulate transient fluid flows in fractured media using an approach based on graph theory. Our approach builds on past work where the graph-based approach was successfully used to simulate steady-state fluid flows in fractured media. We find a mean computational speedup of the order of 1400 from an ensemble of a 100 discrete fracture networks in contrast to the O(10 4 ) speedup that was obtained for steady-state flows earlier. However, the transient flows considered here involve an additional degree of complexity that was not present in the steady-state flows considered previously with a graph-based approach, that of time marching and solution of the flow equations within a time-stepping scheme. We verify our method with an analytical test case and demonstrate its use on a practical problem related to fluid flows in hydraulically fractured reservoirs. By enabling the study of transient flows, we create an opportunity for a wide set of possibilities where a steady-state approximation is not sufficient, such as the example motivated by hydraulic fracturing that we present here. This work validates the concept that graphs are able to reliably capture the topological properties of the fracture network and serve as effective surrogates in an uncertainty-quantification framework.

58 GEOSCIENCES↗