Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Graph properties”

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

ITeM: Independent temporal motifs to summarize and compare temporal networks

We report networks are a fundamental and flexible way of representing various complex systems. Many domains such as communication, citation, procurement, biology, social media, and transportation can be modeled as a set of entities and their relationships. Temporal networks are a specialization of general networks where every relationship occurs at a discrete time. The temporal evolution of such networks is as important to understand as the structure of the entities and relationships. We present the Independent Temporal Motif (ITeM) to characterize temporal graphs from different domains. ITeMs can be used to model the structure and the evolution of the graph. In contrast to existing work, ITeMs are edge-disjoint directed motifs that measure the temporal evolution of ordered edges within the motif. For a given temporal graph, we produce a feature vector of ITeM frequencies and the time it takes to form the ITeM instances. We apply this distribution to measure the similarity of temporal graphs. We show that ITeM has higher accuracy than other motif frequency-based approaches. We define various ITeM-based metrics that reveal salient properties of a temporal network. We also present importance sampling as a method to efficiently estimate the ITeM counts. We present a distributed implementation of the ITeM discovery algorithm using Apache Spark and GraphFrame. We evaluate our approach on both synthetic and real temporal networks.

97 MATHEMATICS AND COMPUTING↗

Neutron powder diffraction and magnetic study of perovskites Pb(Mn{sub 1/2}Nb{sub 1/2})O{sub 3} and Pb(Mn{sub 1/4}Fe{sub 1/4}Nb{sub 1/2})O{sub 3}

The structural and magnetic properties of the complex metal oxides Pb(Mn{sub 1/2}Nb{sub 1/2})O{sub 3} (PMNO) and Pb(Mn{sub 1/4}Fe{sub 1/4}Nb{sub 1/2})O{sub 3} (PMFNO), which belong to a class of disordered perovskites have been studied. The magnetic susceptibilities of PMNO showed hysteresis between field cooled and zero-field cooled conditions below the transition of 15 K, suggesting that the material has a spin-glass feature. Neutron diffraction patterns of PMNO showed no evidence of a long-range magnetic ordering at 1.5 K, which is consistent with spin-glass behavior. Rietveld refinements of neutron powder diffraction data collected at different temperatures between 1.5 and 700 K have been carried out in order to extract structural information. The crystal structure of this compound is cubic (space group Pm3-barm) within the whole temperature interval. The Mn and Nb ions were found to be disordered over the perovskite B-sites. The main feature of this structure is the positional disorder at the Pb site, the importance of which in connection with the ferroic transitions is briefly discussed. The Pb cations show a positional disorder shifting from their high-symmetry positions along the [1 1 1] direction. The effect of Fe-doping on PMNO has been studied. The substitution of Fe at the Mn site in PMFNO results in a small changes of the magnetic properties without significant differences in the crystal structures. The factors governing the observed structural and magnetic properties of PMNO and PMFNO are discussed and compared with those of other quaternary Mn-containing perovskites. For the PbB{sup 3+}{sub 1/2}Nb{sub 1/2}O{sub 3} series with the isomorphous substitution B{sup 3+}, graphs of average lattice parameters of the perovskite phase and the temperatures of ferroelectric and magnetic phase transitions as functions of the B{sup 3+} cation radius were constructed and are discussed. Influence of A-cation sublattice on magnetic properties is also considered.

36 MATERIALS SCIENCE↗

Gradient-based optimization of complex nanoparticle heterostructures enabled by deep learning on heterogeneous graphs

Applications of deep learning (DL) to design nanomaterials are hampered by a lack of suitable data representations and training data. Here, in this study, we report efforts to overcome these limitations and leverage DL to optimize the nonlinear optical properties of core–shell upconverting nanoparticles (UCNPs). UCNPs, which have applications in fields such as biosensing, super-resolution microscopy and three-dimensional printing, can emit visible and ultraviolet light from near-infrared excitations. We report a large-scale dataset of UCNP emission spectra based on accurate but expensive kinetic Monte Carlo simulations (N > 6,000) and use these data to train a heterogeneous graph neural network using a physically motivated representation of UCNP nanostructure. Applying gradient-based optimization on the trained graph neural network, we identify structures with 6.5× higher predicted emission under 800-nm illumination than any UCNP in our training set. Our work reveals design principles for UCNP heterostructures and presents a roadmap for DL-based inverse design of nanomaterials.

Sivonxay, Eric [Lawrence Berkeley National Laborat↗

CEGANN: CRYSTAL EDGE GRAPH ATTENTION NEURAL NETWORK

SF-22-156 Machine learning (ML) models and applications in materials design and discovery typically involve the use of feature representations or descriptors followed by a learning algorithm that maps them to user desired properties of interest. Most popular mathematical formulation-based descriptors are not unique across atomic environments and suffer from transferability issues across different application domains and/or material classes. The CEGANN code provides a unified interface to facilitate material characterization across materials across multiple scales (from atomic to mesoscale) and diverse classes of materials ranging from metals oxides, non-metals, and even hierarchical materials such as zeolites and semi ordered materials such as mesophases. CEGANN implements a Graph Attention Network (GAT) type convolution architecture. The details of network architecture can be found in the paper https://doi.org/10.48550/arXiv.2207.10168. The software comes with pretrained examples and dataset for the classification of the following representative systems: (1) Structure-level representation such as space group (2) Structural dimensionality (e.g., bulk, 2D, clusters etc.) (3) Grain boundary identification (4) Nucleation and growth of a zeolite polymorph (5) Characterization of binary mesophases and their phase transitions (6) Growth of ice. The code is written in python programming language.

CHAN, HENRYT↗

Self-imaging of transparent objects and structures in focusing of spatially phase-modulated laser radiation into a weakly absorbing medium

Self-imaging of transparent objects and structures in focusing of a spatially phase-modulated laser beam into an extended weakly absorbing medium is described. The laser power level that is necessary for effective imaging corresponds to the illuminating beam power when thermal self-defocusing starts evolving in the medium. The effect can be described in terms of the ideology of Zernike's classical phase-contrast method. Edge enhancement in visualised images of transparent objects is experimentally demonstrated. Self-imaging of a microscopic object in the form of transparent letters and long-lived refractive-index fluctuations in liquid glycerol is shown. Due to the adaptivity of the process under consideration, unlike the classical case, self-imaging occurs also in the situations where a beam is displaced (undergoes random walk) as a whole in the Fourier plane, for example, in the presence of thermal flows. (image processing)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Developing a complete AI-accelerated workflow for superconductor discovery

The quest to identify new superconducting materials with enhanced properties is hindered by the prohibitive cost of computing electron-phonon spectral functions, severely limiting the materials space that can be explored. Here, we introduce a Bootstrapped Ensemble of Equivariant Graph Neural Networks (BEE-NET), a machine-learning model trained to predict the Eliashberg spectral function and superconducting critical temperature with a mean-absolute-error of 0.87 K relative to DFT-based Allen-Dynes calculations. Intriguingly, BEE-NET achieves a true-negative-rate of 99.4%, enabling highly efficient screening for the rare property of superconductivity. Integrated into a multi-stage, AI-accelerated discovery pipeline that incorporates elemental-substitution strategies and machine-learned interatomic potentials, our workflow reduced over 1.3 million candidate structures to 741 dynamically and thermodynamically stable compounds with DFT-confirmed T c > 5 K. We report the successful synthesis and experimental confirmation of superconductivity in two of these previously unreported compounds. This study establishes a data-driven framework that integrates machine learning, quantum calculations, and experiments to systematically accelerate superconductor discovery.

Gibson, Jason B. [Quantum Formatics, Cambridge, MA↗

Degree-preserving graph dynamics: a versatile process to construct random networks

Real-world networks evolve over time via the addition or removal of vertices and edges. In current network evolution models, vertex degree varies or grows arbitrarily. A recently introduced degree-preserving network growth (DPG) family of models preserves vertex degree, resulting in structures significantly different from and more diverse than previous models. Despite its degree preserving property, the DPG model is able to replicate the output of several well-known real-world network growth models. Simulations showed that many real-world networks can also be constructed from small seed graphs via the DPG process. Here, we start the development of a rigorous mathematical theory underlying the DPG family of network growth models. We prove that the degree sequence of the output of some of the well-known, real-world network growth models can be reconstructed via the DPG process, using proper parametrization. We also show that the general problem of deciding whether a simple graph can be obtained via the DPG process from a small seed (DPG feasibility) is, however, NP-complete. In conclusion, it is an intriguing open problem to uncover whether there is a structural reason behind the DPG-constructability of real-world networks.

97 MATHEMATICS AND COMPUTING↗

Optical properties of IR-emitting centres in Pb-doped silica fibres

The first fibre preforms with a Pb-doped silica core, free of other dopants, have been produced using chemical vapour deposition. The preforms have been used to fabricate holey optical fibres. The spectroscopic properties of the fibres have been studied in detail in the range 400 - 1700 nm: we have measured the optical loss, constructed a three-dimensional luminescence excitation - emission graph and determined the decay time for the major luminescence peaks.

36 MATERIALS SCIENCE↗

Towards a Multiscale Approach to Cybersecurity Modeling

We propose a multiscale approach to modeling cyber networks, with the goal of capturing a view of the network and overall situational awareness with respect to a few key properties--- connectivity, distance, and centrality--- for a system under an active attack. We focus on theoretical and algorithmic foundations of multiscale graphs, coming from an algorithmic perspective, with the goal of modeling cyber system defense as a specific use case scenario. We first define a notion of \emph{multiscale} graphs, in contrast with their well-studied single-scale counterparts. We develop multiscale analogs of paths and distance metrics. As a simple, motivating example of a common metric, we present a multiscale analog of the all-pairs shortest-path problem, along with a multiscale analog of a well-known algorithm which solves it. From a cyber defense perspective, this metric might be used to model the distance from an attacker's position in the network to a sensitive machine. In addition, we investigate probabilistic models of connectivity. These models exploit the hierarchy to quantify the likelihood that sensitive targets might be reachable from compromised nodes. We believe that our novel multiscale approach to modeling cyber-physical systems will advance several aspects of cyber defense, specifically allowing for a more efficient and agile approach to defending these systems.

Cybersecurity↗

Contributions of vegetation heterogeneity within tower footprint to CO 2 flux estimations through graph neural network modeling

Net ecosystem exchange of CO 2 (Fc) measured directly by eddy covariance towers is based on various assumptions, including large, flat and homogenous land cover type. In reality, often a tower site is not large enough for flux measurements, and landscapes consist of patches of different land cover types within the flux footprint. In addition, some portions of fluxes are contributed by different cover types when a footprint exceeds the size of the target ecosystem. The contributions of non-dominant patches to Fc are often ignored. Here, in this study, we propose a novel integrated modeling framework that combines random forest (RF) and XGBoost with a residual correction module based on a deep graph convolutional network (DeeperGCN) to simulate Fc for seven flux measurement sites in southwest Michigan. High-resolution remote sensing vegetation indices, soil properties, meteorological variables, and footprint-weighted spatial features were used as model inputs at three spatial resolutions (10 m, 20 m, 30 m), and their importance in predicting Fc with DeeperGCN was assessed. We found that residual correction using DeeperGCN significantly improved prediction accuracy, with the R 2 increasing from 0.9098 to 0.9479 for RF and from 0.9235 to 0.9433 for XGBoost. At site level, the maximum improvement in R 2 reached 0.1617. Paired t-tests confirmed that these improvements were statistically significant (p < 0.05). Among all predictors, leaf area index and incoming shortwave radiation emerged as the dominant drivers of spatial residual variation, followed by precipitation, relative humidity, and selected vegetation indices. The 20 m resolution yielded the best balance between model performance and computational efficiency. In conclusion, our modeling framework effectively captures both spatial heterogeneity and nonlinear interactions, offering a robust solution for spatially explicit flux modeling in structurally diverse ecosystems beyond the study sites.

footprint model↗

Representations and strategies for transferable machine learning improve model performance in chemical discovery

Strategies for machine-learning (ML)-accelerated discovery that are general across material composition spaces are essential, but demonstrations of ML have been primarily limited to narrow composition variations. By addressing the scarcity of data in promising regions of chemical space for challenging targets such as open-shell transition-metal complexes, general representations and transferable ML models that leverage known relationships in existing data will accelerate discovery. Over a large set (~1000) of isovalent transition-metal complexes, we quantify evident relationships for different properties (i.e., spin-splitting and ligand dissociation) between rows of the Periodic Table (i.e., 3d/4d metals and 2p/3p ligands). We demonstrate an extension to the graph-based revised autocorrelation (RAC) representation (i.e., eRAC) that incorporates the group number alongside the nuclear charge heuristic that otherwise overestimates dissimilarity of isovalent complexes. To address the common challenge of discovery in a new space where data are limited, we introduce a transfer learning approach in which we seed models trained on a large amount of data from one row of the Periodic Table with a small number of data points from the additional row. We demonstrate the synergistic value of the eRACs alongside this transfer learning strategy to consistently improve model performance. Analysis of these models highlights how the approach succeeds by reordering the distances between complexes to be more consistent with the Periodic Table, a property we expect to be broadly useful for other material domains.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Chemical reaction enhanced graph learning for molecule representation

Abstract Motivation Molecular representation learning (MRL) models molecules with low-dimensional vectors to support biological and chemical applications. Current methods primarily rely on intrinsic molecular information to learn molecular representations, but they often overlook effectively integrating domain knowledge into MRL. Results In this article, we develop a reaction-enhanced graph learning (RXGL) framework for MRL, utilizing chemical reactions as domain knowledge. RXGL introduces dual graph learning modules to model molecule representation. One module employs graph convolutions on molecular graphs to capture molecule structures. The other module constructs a reaction-aware graph from chemical reactions and designs a novel graph attention network on this graph to integrate reaction-level relations into molecular modeling. To refine molecule representations, we design a reaction-based relation learning task, which considers the relations between the reactant and product sides in reactions. In addition, we introduce a cross-view contrastive task to strengthen the cooperative associations between molecular and reaction-aware graph learning. Experiment results show that our RXGL achieves strong performance in various downstream tasks, including product prediction, reaction classification, and molecular property prediction. Availability and implementation The code is publicly available at https://github.com/coder-ACAC/RLM.

Biochemistry & Molecular Biology↗

Virtuous trees at five- and six-point levels for Yang-Mills theory and gravity

We present a particularly nice D-dimensional graph-based representation of the full color-dressed five-point tree-level gluon amplitude. It possesses the following virtues: (1) it satisfies the color-kinematic correspondence, and thus trivially generates the associated five-point graviton amplitude, (2) all external-state information is encoded in color-ordered partial amplitudes, and (3) one function determines the kinematic contribution of all graphs in the Yang-Mills amplitude, so the associated gravity amplitude is manifestly permutation symmetric. The third virtue, while shared among all known loop-level correspondence-satisfying representations, is novel for tree-level representations sharing the first two virtues. This new D-dimensional representation makes contact with the recently found multiloop five-point representations, suggesting all-loop, all-multiplicity ramifications through unitarity. Additionally we present a slightly less virtuous representation of the six-point maximally helicity-violating (MHV) and MHV amplitudes that holds only in four dimensions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DeepClone: Lightweight State Replication of Deep Learning Models for Data Parallel Training

Training modern deep neural network (DNN) models involves complex workflows triggered by model exploration, sensitivity analysis, explainability, etc. A key primitive in this context is the ability to clone a model training instance, i.e. “fork” the training process in a potentially different direction, which enables comparisons of different evolution paths using variations of training data and model parameters. However, in a quest improve the training throughput, a mix of data parallel, model parallel, pipeline parallel and layer-wise parallel approaches are making the problem of cloning highly complex. In this paper, we explore the problem of efficient cloning under such circumstances. To this end, we leverage several properties of data-parallel training and layer-wise parallelism to design DeepClone, a cloning approach based on augmenting the execution graph to gain direct access to tensors, which are then sharded and reconstructed asynchronously in order to minimize runtime overhead, standby duration, readiness duration. Compared with state-of-art approaches, DeepClone shows orders of magnitude improvement for several classes of DNN models.

data-parallel training↗

Power Flow Geometry and Approximation

Here, the power flow equations are important in numerous power systems problems of practical interest which consider alternating current power flow (ACPF) physics. Perhaps the most well studied being the alternating current optimal power flow problem (ACOPF), seeking to optimize the operation of an electric power system. Due to their non-linearity, problems which include the power flow equations are typically challenging, particularly in optimization. Interestingly, the set of solutions to the power flow equations forms a smooth manifold. As a result, differential geometry can be used to describe and analyze this set of equations. This approach has proven effective in several engineering applications (e.g., solving ACOPF and analyzing the solution space boundary). Central to the success of this approach is an understanding of the power flow manifold's geometry. In this work, we develop the geometric and topological properties of this manifold using concepts from differential geometry. After demonstrating the convenience of this manifold's representation as a function's graph, computational methods are emphasized: we develop retractions, error bounds for linear approximation, and formulas for evaluating the Riemannian metric (including associated objects such as geodesics and the curvature tensor). Scalar curvature and the second fundamental form play a new role in quantifying the quality of linear approximations, like the popular direct current approximation. All functions are implemented in Julia and available in an online repository. Proofs are included for completeness.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Generative Design for Resilience of Interdependent Network Systems

Abstract Interconnected complex systems usually undergo disruptions due to internal uncertainties and external negative impacts such as those caused by harsh operating environments or regional natural disaster events. To maintain the operation of interconnected network systems under both internal and external challenges, design for resilience research has been conducted from both enhancing the reliability of the system through better designs and improving the failure recovery capabilities. As for enhancing the designs, challenges have arisen for designing a robust system due to the increasing scale of modern systems and the complicated underlying physical constraints. To tackle these challenges and design a resilient system efficiently, this study presents a generative design method that utilizes graph learning algorithms. The generative design framework contains a performance estimator and a candidate design generator. The generator can intelligently mine good properties from existing systems and output new designs that meet predefined performance criteria while the estimator can efficiently predict the performance of the generated design for a fast iterative learning process. Case studies results based on synthetic supply chain networks and power systems from the IEEE dataset have illustrated the applicability of the developed method for designing resilient interdependent network systems.

Engineering↗

The Structure and Tra c Flow Anatomy of the Planet-Scale Urban Vehicular Mobility

A data-driven realistic design and evalua- tion of vehicular mobility has been particularly chal- lenging due to a lack of large-scale real-world mea- surements in the research community. Current research methodologies rely on articial scenarios, random con- nectivity, and use small and biased samples. In this pa- per, we perform a combined study to learn the struc- ture and connectivity of urban streets and modeling and characterization of vehicular trac densities on them. Our dataset is a collection of more than 222 thousand routes and 25 million vehicular mobility images from 1091 online web cameras located in six dierent re- gions of the world. Our results centered around four major observations: i. study shows that driving routes and visiting locations of regions demonstrate power-law distribution, indicating a planned or recently designed road infrastructure; ii. we represent regions by network graphs in which nodes are camera locations and edges are urban streets that connect the nodes. Such represen- tation exhibits small world properties with short path lengths and large clustering coecient; iii. trac densi- ties show 80% temporal correlation during several hours of a day; iv. modeling trac densities against known theoretical distributions show less than 5% deviation for heavy-trailed models such as log-logistic and log- gamma distributions. We believe this work will provide a much-needed contribution to the research community for design and evaluation of future vehicular networks and smart cities.

Thakur, Gautam↗