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 325 records · Page 18

Multiscale flat norm signatures for shapes and images

In this paper we begin to explore the application of the multiscale flat norm introduced in Morgan and Vixie to shape and image analysis. In particular, we look at the use of the multiscale flat norm signature for the identification of shapes. After briefly reviewing the multiscale flat norm, the L{sup 1}TV functional and the relation between these two, we introduce multiscale signatures that naturally follow from the multiscale flat norm and its components. A numerical method based on the min-cut, max-flow graph-cut is briefly recalled. We suggest using L{sup 2} minimization, rather than the usual Crofton's formula based approximation, for choosing the required weights. The resulting weights have the dual benefits of being analytically computable and of giving more accurate approximations to the anisotropic TV energy. Finally, we demonstrate the usefulness of the signatures on simple shape classification tasks.

99 GENERAL AND MISCELLANEOUS↗

Accelerating network layouts using graph neural networks

Graph layout algorithms used in network visualization represent the first and the most widely used tool to unveil the inner structure and the behavior of complex networks. Current network visualization software relies on the force-directed layout (FDL) algorithm, whose high computational complexity makes the visualization of large real networks computationally prohibitive and traps large graphs into high energy configurations, resulting in hard-to-interpret “hairball” layouts. Here we use Graph Neural Networks (GNN) to accelerate FDL, showing that deep learning can address both limitations of FDL: it offers a 10 to 100 fold improvement in speed while also yielding layouts which are more informative. We analytically derive the speedup offered by GNN, relating it to the number of outliers in the eigenspectrum of the adjacency matrix, predicting that GNNs are particularly effective for networks with communities and local regularities. Finally, we use GNN to generate a three-dimensional layout of the Internet, and introduce additional measures to assess the layout quality and its interpretability, exploring the algorithm’s ability to separate communities and the link-length distribution. The novel use of deep neural networks can help accelerate other network-based optimization problems as well, with applications from reaction-diffusion systems to epidemics.

97 MATHEMATICS AND COMPUTING↗

The role of the Kubo number in two-component turbulence

We explore the random walk of magnetic field lines in two-component turbulence by using computer simulations. It is often assumed that the two-component model provides a good approximation for solar wind turbulence. We explore the dependence of the field line diffusion coefficient on the Kubo number which is a fundamental and characteristic quantity in the theory of turbulence. We show that there are two transport regimes. One is the well-known quasilinear regime in which the diffusion coefficient is proportional to the Kubo number squared, and the second one is a nonlinear regime in which the diffusion coefficient is directly proportional to the Kubo number. The so-called percolative transport regime which is often discussed in the literature cannot be found. The numerical results obtained in the present paper confirm analytical theories for random walking field lines developed in the past.

79 ASTRONOMY AND ASTROPHYSICS↗

Numerical simulation of quasi-multifractal diffusion process

The properties of quasi-multifractal diffusion process are discussed. A discrete model of the process is constructed, and a method is proposed for calculating the quasi-multifractal spectrum, based on statistical processing of its realizations. An analysis of multifractal properties performed by numerical simulation of the quasi-multifractal spectrum is qualitatively substantiated by examining realizations of the simulated process. The results of numerical simulations suggest that there are three distinct scaling regions. Special attention is given to comparative analyses between numerical and analytical results and between realizations of the proposed process and the well-known multifractal random walk.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A criterion based on computational singular perturbation for the identification of quasi steady state species: A reduced mechanism for methane oxidation with NO chemistry

A criterion based on computational singular perturbation (CSP) is proposed to effectively distinguish the quasi steady state (QSS) species from the fast species induced by reactions in partial equilibrium. Together with the method of directed relation graph (DRG), it was applied to the reduction of GRI-Mech 3.0 for methane oxidation, leading to the development of a 19-species reduced mechanism with 15 lumped steps, with the concentrations of the QSS species solved analytically for maximum computational efficiency. Compared to the 12-step and 16-species augmented reduced mechanism (ARM) previously developed by Sung, Law and Chen, three species, namely O, CH{sub 3}OH, and CH{sub 2}CO, are now excluded from the QSS species list. The reduced mechanism was validated with a variety of phenomena including perfectly stirred reactors, auto-ignition, and premixed and non-premixed flames, with the worst-case error being less than 10% over a wide range of parameters. This mechanism was then supplemented with the reactions involving NO formation, followed by validations in both homogeneous and diffusive systems. (author)

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Micro-Crater Laser Induced Breakdown Spectroscopy--an Analytical approach in metals samples

The laser ablation has been increasing its popularity like as technique of chemical analysis. This is due to its great potentiality in the analysis of solid samples. On the way to contributing to the development of the technique, we in this work studied the laser induced breakdown spectroscopy (LIBS) in conditions of micro ablation for future studies of coverings and micro crates analysis. Craters between 2 and 7 micrometers of diameter were made using an Nd-YAG nanosecond laser in their fundamental emission of 1064 nm. In order to create these craters we use an objective lens of long distance work and 0.45 of numerical aperture. The atomic emission versus the energy of the laser and its effect on the size of craters was study. We found that below 3 micrometers although there was evidence of material removal by the formation of a crater, it was no detectable atomic emission for our instruments. In order to try to understand this, curves of size of crater versus plasma temperature using the Boltzmann distribution graphs taking the Copper emission lines in the visible region were made. In addition calibration curves for Copper and aluminum were made in two different matrices; one of it was a Cu/Zn alloy and the other a Zinc Matrix. The atomic lines Cu I (521.78 nm) and Al I (396.15 nm) was used. From the Calibration curve the analytical limit of detection and other analytical parameters were obtained.

36 MATERIALS SCIENCE↗

Designing alloys with process-mapping AI pre-trained on empirical knowledge

<span style="font-family: Calibri, sans-serif; font-size: 12pt;">Accelerated materials design should match the recent trends in the product development cycles. Materials data analytics can be used to significantly shorten development time of specialized alloys needed for next generation energy applications. However, it faces a challenge of scarce data available for training ML models. Incorporation of the domain knowledge into deep-learning graph structure via fuzzy pre-training and causal process imitation presents a viable approach to developing accurate data-driven models and reliable alloy design tools, with limited datasets. Artificial Intelligence (AI) was used in this study to incorporate such knowledge in the domain-specific computational tool, pyroMind. The tool provides not only novel design ideas but also their interpretation via physics and engineering concepts.</span>

Romanov, Vyacheslav↗

Maximum Kolmogorov-Sinai Entropy Versus Minimum Mixing Time in Markov Chains

We establish a link between the maximization of Kolmogorov Sinai entropy (KSE) and the minimization of the mixing time for general Markov chains. Since the maximisation of KSE is analytical and easier to compute in general than mixing time, this link provides a new faster method to approximate the minimum mixing time dynamics. It could be interesting in computer sciences and statistical physics, for computations that use random walks on graphs that can be represented as Markov chains.

97 MATHEMATICS AND COMPUTING↗

Graph representation of protein free energy landscape

The thermodynamics and kinetics of protein folding and protein conformational changes are governed by the underlying free energy landscape. However, the multidimensional nature of the free energy landscape makes it difficult to describe. We propose to use a weighted-graph approach to depict the free energy landscape with the nodes on the graph representing the conformational states and the edge weights reflecting the free energy barriers between the states. Our graph is constructed from a molecular dynamics trajectory and does not involve projecting the multi-dimensional free energy landscape onto a low-dimensional space defined by a few order parameters. The calculation of free energy barriers was based on transition-path theory using the MSMBuilder2 package. We compare our graph with the widely used transition disconnectivity graph (TRDG) which is constructed from the same trajectory and show that our approach gives more accurate description of the free energy landscape than the TRDG approach even though the latter can be organized into a simple tree representation. The weighted-graph is a general approach and can be used on any complex system.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Publication and Retrieval of Computational Chemical-Physical Data Via the Semantic Web. Final Technical Report

This research showed the feasibility of applying the concepts of the Semantic Web to Computation Chemistry. We have created the first web portal (www.chemsem.com) that allows data created in the calculations of quantum chemistry, and other such chemistry calculations to be placed on the web in a way that makes the data accessible to scientists in a semantic form never before possible. The semantic web nature of the portal allows data to be searched, found, and used as an advance over the usual approach of a relational database. The semantic data on our portal has the nature of a Giant Global Graph (GGG) that can be easily merged with related data and searched globally via a SPARQL Protocol and RDF Query Language (SPARQL) that makes global searches for data easier than with traditional methods. Our Semantic Web Portal requires that the data be understood by a computer and hence defined by an ontology (vocabulary). This ontology is used by the computer in understanding the data. We have created such an ontology for computational chemistry (purl.org/gc) that encapsulates a broad knowledge of the field of computational chemistry. We refer to this ontology as the Gainesville Core. While it is perhaps the first ontology for computational chemistry and is used by our portal, it is only a start of what must be a long multi-partner effort to define computational chemistry. In conjunction with the above efforts we have defined a new potential file standard (Common Standard for eXchange – CSX for computational chemistry data). This CSX file is the precursor of data in the Resource Description Framework (RDF) form that the semantic web requires. Our portal translates CSX files (as well as other computational chemistry data files) into RDF files that are part of the graph database that the semantic web employs. We propose a CSX file as a convenient way to encapsulate computational chemistry data.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Modeling Complex Relationships in Large-Scale Data using Hypergraphs (LDRD Final Report)

This SAND report documents the findings of the LDRD project, "Modeling Complex Relationships in Large-Scale Data using Hypergraphs". The project ran from October 2017 through September 2019. The focus of the project was the development and application of hypergraph data analytics to Sandia relational data applications. In this project, we attempted to apply a hypergraph data analysis method—specifically, hypergraph eigenvector centrality—to Sandia mission problems to identify influential entities (people, location, times, etc.) in the data. Unfortunately, the application data led to graph and hypergraph representations containing disconnected components. To date, there are no well-established techniques for applying eigenvector centrality to such graphs and hypergraphs. In this report, we present several heuristics for computing eigenvector centrality for disconnected graphs. We believe this is an important start to understanding how to approach the similar problem for hypergraphs, but this project concluded before we made progress on that problem. The ideas, methods, and suggestions presented here can be used for further research into this challenging problem. We also present our ideas for generating graphs with known degree and centrality distributions. The goal in presenting this work is to identify a procedure for analyzing such graphs once the problem of addressing disconnected components has been addressed. When working with a single data set, this generator can be used to create many instances of graphs that can be used to analyze the robustness of the centrality computations for the original data set. Although the results did not match perfectly in the case of the Facebook Ego dataset used in the experiments presented here, this again represents a good start in the direction of a graph generator for such problems. We note that there are potential trade-offs between how the degree and centrality distributions are fit to the original data and suggested several possible avenues for follow-on research efforts.

97 MATHEMATICS AND COMPUTING↗

HOOVER

HOOVER is a distributed framework for solving streaming/dynamic graph problems where the structure of a graph changes over time based on the state of its vertices.

97 MATHEMATICS AND COMPUTING↗

KINETIC MONTE CARLO STUDIES OF H{sub 2} FORMATION ON GRAIN SURFACES OVER A WIDE TEMPERATURE RANGE

We have used the continuous-time random-walk Monte Carlo technique to study the formation of H{sub 2} from two hydrogen atoms on the surface of interstellar dust grains with both physisorption and chemisorption sites on olivine and carbonaceous material. In our standard approach, atoms must first enter the physisorption site before chemisorption can occur. We have considered hydrogen atom mobility due to both thermal hopping and quantum mechanical tunneling. The temperature range between 5 K and 825 K has been explored for different incoming H fluxes representative of interstellar environments with atomic hydrogen number density ranging between 0.1 cm{sup -3} and 100 cm{sup -3} and dust grain sizes ranging from 100 sites to 10{sup 6} sites, the latter corresponding roughly to olivine grains of radius 0.2 {mu}m. In addition, we have also considered rough surfaces with multiple binding sites. Tunneling is found to dominate the surface chemistry at low temperature, but as the temperature increases, the scenario changes. The inclusion of chemisorption sites can provide a meaningful efficiency for H{sub 2} production up to temperatures as high as 700 K depending upon the depth of the chemisorption well. We found that over virtually the entire temperature range studied, the use of rate equations overestimates the H{sub 2} formation rate to some extent. This overestimate is large at high temperatures, due to very low surface residence times. We have also considered models in which chemisorption sites are entered directly and diffusion proceeds only to other chemisorption sites.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Building near-real-time processing pipelines with the spark-MPI platform

Advances in detectors and computational technologies provide new opportunities for applied research and the fundamental sciences. Concurrently, dramatic increases in the three V's (Volume, Velocity, and Variety) of experimental data and the scale of computational tasks produced the demand for new real-time processing systems at experimental facilities. Recently, this demand was addressed by the Spark-MPI approach connecting the Spark data-intensive platform with the MPI high-performance framework. In contrast with existing data management and analytics systems, Spark introduced a new middleware based on resilient distributed datasets (RDDs), which decoupled various data sources from high-level processing algorithms. The RDD middleware significantly advanced the scope of data-intensive applications, spreading from SQL queries to machine learning to graph processing. Spark-MPI further extended the Spark ecosystem with the MPI applications using the Process Management Interface. The paper explores this integrated platform within the context of online ptychographic and tomographic reconstruction pipelines.

97 MATHEMATICS AND COMPUTING↗

Fishnet four-point integrals: integrable representations and thermodynamic limits

In this work, we consider four-point integrals arising in the planar limit of the conformal “fishnet” theory in four dimensions. They define a two-parameter family of higher-loop Feynman integrals, which extend the series of ladder integrals and were argued, based on integrability and analyticity, to admit matrix-model-like integral and determinantal representations. In this paper, we prove the equivalence of all these representations using exact summation and integration techniques. We then analyze the large-order behaviour, corresponding to the thermodynamic limit of a large fishnet graph. The saddle-point equations are found to match known two-cut singular equations arising in matrix models, enabling us to obtain a concise parametric expression for the free-energy density in terms of complete elliptic integrals. Interestingly, the latter depends non-trivially on the fishnet aspect ratio and differs from a scaling formula due to Zamolodchikov for large periodic fishnets, suggesting a strong sensitivity to the boundary conditions. We also find an intriguing connection between the saddle-point equation and the equation describing the Frolov-Tseytlin spinning string in AdS 3 × S 1 , in a generalized scaling combining the thermodynamic and short-distance limits.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Synthesis and Molecular Structure of 2-(4-Chlorophenyl)-3-(phenyl-amino)-5-(thiophen-2-ylmethylidene)-3,5-dihydro-4H-imidazol-4-one

2-(4-Chlorophenyl)-3-(phenylamino)-5-(thiophen-2-ylmethylidene)-3,5-dihydro-4H-imidazol-4-one, C{sub 20}H{sub 14}N{sub 3}OSCl was synthesized and its crystal structure was determined by single crystal X-ray diffraction. The crystals are triclinic, sp. gr. P1, Z = 2. All three rings are planar, and imidazole ring is almost perpendicular to the phenyl ring with the dihedral angle of 88.65(2)°. In the crystal, pairs of O–H···O hydrogen bonds link molecules into inversion dimers, featuring R{sub 22}(10) graph set motif. Crystal structure is further stabilized by π···π interactions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Topology-Dependent Performance of Free-Space Photonic Quantum Networks Under Noise

Photonic quantum communication enables secure and high-fidelity information transfer beyond classical limits, with direct relevance to emerging quantum networks operating in free-space environments. While physical-layer models of depolarizing noise, Gamma–Gamma turbulence statistics, entanglement swapping, and decoy-state QKD security bounds are individually well established, prior work typically treats these components in isolation or under fixed network assumptions. In this work, we develop a unified topology-aware analytical framework that simultaneously integrates free-space optical link budgets, turbulence-induced visibility degradation, depolarizing qubit noise, multi-hop entanglement cascade dynamics, teleportation fidelity thresholds, CHSH nonlocality certification, and asymptotic decoy-state secret key rate bounds across star, mesh, and ring graph structures. Rather than introducing new physical channel models, we demonstrate that identical physical links exhibit fundamentally different end-to-end performance once embedded within different network topologies. Mesh architectures minimize visibility cascade through hop-count reduction but incur quadratic hardware scaling. Star topologies minimize link count but concentrate noise and synchronization overhead at the hub. Ring configurations offer linear hardware scaling with multiplicative fidelity degradation. The results establish topology as a first-order design parameter in near-term free-space quantum networks operating without full quantum repeater infrastructures. While motivated by distributed multi-agent architectures, the framework applies broadly to terrestrial, airborne, and satellite-assisted photonic quantum communication systems.

QKD↗

Generating Performance Models for Irregular Applications

Many applications have irregular behavior --- non-uniform input data, input-dependent solvers, irregular memory accesses, unbiased branches --- that cannot be captured using today's automated performance modeling techniques. We describe new hierarchical critical path analyses for the \Palm model generation tool. To create a model's structure, we capture tasks along representative MPI critical paths. We create a histogram of critical tasks with parameterized task arguments and instance counts. To model each task, we identify hot instruction-level sub-paths and model each sub-path based on data flow, instruction scheduling, and data locality. We describe application models that generate accurate predictions for strong scaling when varying CPU speed, cache speed, memory speed, and architecture. We present results for the Sweep3D neutron transport benchmark; Page Rank on multiple graphs; Support Vector Machine with pruning; and PFLOTRAN's reactive flow/transport solver with domain-induced load imbalance.

analytical performance models↗