Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “dynamic graph”

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 667 records · Page 37

Image-based model of the spectrin cytoskeleton for red blood cell simulation

We simulate deformable red blood cells in the microcirculation using the immersed boundary method with a cytoskeletal model that incorporates structural details revealed by tomographic images. The elasticity of red blood cells is known to be supplied by both their lipid bilayer membranes, which resist bending and local changes in area, and their cytoskeletons, which resist in-plane shear. The cytoskeleton consists of spectrin tetramers that are tethered to the lipid bilayer by ankyrin and by actin-based junctional complexes. We model the cytoskeleton as a random geometric graph, with nodes corresponding to junctional complexes and with edges corresponding to spectrin tetramers such that the edge lengths are given by the end-to-end distances between nodes. The statistical properties of this graph are based on distributions gathered from three-dimensional tomographic images of the cytoskeleton by a segmentation algorithm. We show that the elastic response of our model cytoskeleton, in which the spectrin polymers are treated as entropic springs, is in good agreement with the experimentally measured shear modulus. By simulating red blood cells in flow with the immersed boundary method, we compare this discrete cytoskeletal model to an existing continuum model and predict the extent to which dynamic spectrin network connectivity can protect against failure in the case of a red cell subjected to an applied strain. As a result, the methods presented here could form the basis of disease- and patient-specific computational studies of hereditary diseases affecting the red cell cytoskeleton.

59 BASIC BIOLOGICAL SCIENCES↗

A neurocomputer based on an analog-digital hybrid architecture

A novel analog-digital hybrid architecture based on the utilization of high density digital random access memories for the storage of the synaptic weights of a neural network, and high speed analog hardware to perform neural computation is described. An electronic neurocomputer based on such an architecture is ideally suited for investigating the dynamics, associative recall properties, and computational capabilities of neural networks and provides significant speed improvement in comparison to conventional software based neural network simulations. As a demonstration of the feasibility of the hybrid architectural concept, a prototype breadboard hybrid neurocomputer system with 32 neurons has been designed and fabricated with off-the-shelf hardware components. The performance of the breadboard system has been tested for variety of applications including associative memory and combinatorial problem solving such as Graph Coloring, and is discussed in this paper.

Moopenn, A.↗

The Mathematics of Dispatchability Revisited

Dispatchability is an important property for the efficient execution of temporal plans where the temporal constraints are represented as a Simple Temporal Network (STN). It has been shown that every STN may be reformulated as a dispatchable STN, and dispatchability ensures that the temporal constraints need only be satisfied locally during execution. Recently it has also been shown that Simple Temporal Networks with Uncertainty, augmented with wait edges, are Dynamically Controllable provided every projection is dispatchable. Thus, the dispatchability property has both theoretical and practical interest. One thing that hampers further work in this area is the underdeveloped theory. The existing definitions are expressed in terms of algorithms, and are less suitable for mathematical proofs. In this paper, we develop a new formal theory of dispatchability in terms of execution sequences. We exploit this to prove a characterization of dispatchability involving the structural properties of the STN graph. This facilitates the potential application of the theory to uncertainty reasoning.

control↗

Evaluation of Methods for Causal Discovery in Hydrometeorological Systems

Understanding causal relations is of utmost importance in hydrology and climate research for systems identification, prediction, and understanding systems behavior in a changing climate. Traditionally, researchers in hydrometeorology attempted to study causal questions by conducting controlled experiments using numerical models. This approach, however, in most cases of interest provides uncertain results because the models are approximate representation of the natural system. An alternative approach that has recently drawn significant attention in several fields is to infer causal relations from purely observational data. It possesses several traits to its utility particularly in hydrometeorology due to the rapid accumulation of in situ and remotely sensed data records. The first objective of this study is to present a brief description of four causal discovery methods (Granger causality, Transfer Entropy, graph-based algorithms, and Convergent Cross Mapping) with special emphasis on the assumptions on which they are built. Second, using synthetic data generated from a hydrological model, we assess their performance in retrieving causal information taking into account sensitivity to sample size and presence of noise. Last, we use causal analysis to examine and formulate hypotheses on causal drivers of evapotranspiration in a shrubland region during summer and winter seasons. An interpretation of the hypotheses based on canopy seasonal dynamics and evapotranspiration processes is presented. It is hoped that the results presented here can be useful in guiding researchers studying hydrometeorological systems as to which causal method is most appropriate to the characteristics of the system under study.

54 ENVIRONMENTAL SCIENCES↗

Multiprincipal Component P2-Na 0.6 (Ti 0.2 Mn 0.2 Co 0.2 Ni 0.2 Ru 0.2 )O 2 as a High-Rate Cathode for Sodium-Ion Batteries

Mixing transition metal cations in nearly equiatomic proportions in layered oxide cathode materials is a new strategy for improving the performances of Na-ion batteries. The mixing of cations not only offers entropic stabilization of the crystal structure but also benefits the diffusion of Na ions with tuned diffusion activation energy barriers. In light of this strategy, a high-rate Na 0.6 (Ti 0.2 Mn 0.2 Co 0.2 Ni 0.2 Ru 0.2 )O 2 cathode was designed, synthesized, and investigated, combining graph-based deep learning calculations and complementary experimental characterizations. This new cathode material delivers high discharge capacities of 164 mA g –1 at 0.1 C and 68 mAh g –1 at a very high rate of 86 C, demonstrating an outstanding high rate capability. Ex situ and operando synchrotron X-ray diffraction were used to reveal the detailed structural evolution of the cathode upon cycling. Using the climbing-image nudged elastic-band calculation and Ab initio molecular dynamics simulations, we show that the optimal transition metal composition enables a percolating network of low barrier pathways for fast, macroscopic Na diffusion, resulting in the observed high rate performance.

25 ENERGY STORAGE↗

Graphical methods for quantifying macromolecules through bright field imaging

Bright field imaging of biological samples stained with antibodies and/or special stains provides a rapid protocol for visualizing various macromolecules. However, this method of sample staining and imaging is rarely employed for direct quantitative analysis due to variations in sample fixations, ambiguities introduced by color composition and the limited dynamic range of imaging instruments. We demonstrate that, through the decomposition of color signals, staining can be scored on a cell-by-cell basis. We have applied our method to fibroblasts grown from histologically normal breast tissue biopsies obtained from two distinct populations. Initially, nuclear regions are segmented through conversion of color images into gray scale, and detection of dark elliptic features. Subsequently, the strength of staining is quantified by a color decomposition model that is optimized by a graph cut algorithm. In rare cases where nuclear signal is significantly altered as a result of sample preparation, nuclear segmentation can be validated and corrected. Finally, segmented stained patterns are associated with each nuclear region following region-based tessellation. Compared to classical non-negative matrix factorization, proposed method: (i) improves color decomposition, (ii) has a better noise immunity, (iii) is more invariant to initial conditions and (iv) has a superior computing performance.

59 BASIC BIOLOGICAL SCIENCES↗

Search for Stable and Low-Energy Ce–Co–Cu Ternary Compounds Using Machine Learning

Cerium-based intermetallics have garnered significant research attention as potential new permanent magnets. In this study, we explore the compositional and structural landscape of Ce−Co−Cu ternary compounds using a machine learning (ML)- guided framework integrated with first-principles calculations. We employ a crystal graph convolutional neural network (CGCNN), which enables efficient screening for promising candidates, significantly accelerating the material discovery process. With this approach, we predict five stable compounds, Ce 3 Co 3 Cu, CeCoCu 2 , Ce 12 Co 7 Cu, Ce 11 Co 9 Cu, and Ce 10 Co 11 Cu 4 , with formation energies below the convex hull, along with hundreds of low-energy (possibly metastable) Ce−Co−Cu ternary compounds. Firstprinciples calculations reveal that several structures are both energetically and dynamically stable. Notably, two Co-rich low-energy compounds, Ce 4 Co 33 Cu and Ce 4 Co 31 Cu 3 , are predicted to have high magnetizations.

Chemical structure↗

THE HALO MASS FUNCTION FROM EXCURSION SET THEORY. I. GAUSSIAN FLUCTUATIONS WITH NON-MARKOVIAN DEPENDENCE ON THE SMOOTHING SCALE

A classic method for computing the mass function of dark matter halos is provided by excursion set theory, where density perturbations evolve stochastically with the smoothing scale, and the problem of computing the probability of halo formation is mapped into the so-called first-passage time problem in the presence of a barrier. While the full dynamical complexity of halo formation can only be revealed through N-body simulations, excursion set theory provides a simple analytic framework for understanding various aspects of this complex process. In this series of papers we propose improvements of both technical and conceptual aspects of excursion set theory, and we explore up to which point the method can reproduce quantitatively the data from N-body simulations. In Paper I of the series, we show how to derive excursion set theory from a path {integral} formulation. This allows us both to derive rigorously the absorbing barrier boundary condition, that in the usual formulation is just postulated, and to deal analytically with the non-Markovian nature of the random walk. Such a non-Markovian dynamics inevitably enters when either the density is smoothed with filters such as the top-hat filter in coordinate space (which is the only filter associated with a well-defined halo mass) or when one considers non-Gaussian fluctuations. In these cases, beside 'Markovian' terms, we find 'memory' terms that reflect the non-Markovianity of the evolution with the smoothing scale. We develop a general formalism for evaluating perturbatively these non-Markovian corrections, and in this paper we perform explicitly the computation of the halo mass function for Gaussian fluctuations, to first order in the non-Markovian corrections due to the use of a top-hat filter in coordinate space. In Paper II of this series we propose to extend excursion set theory by treating the critical threshold for collapse as a stochastic variable, which better captures some of the dynamical complexity of the halo formation phenomenon, while in Paper III we use the formalism developed in this paper to compute the effect of non-Gaussianities on the halo mass function.

79 ASTRONOMY AND ASTROPHYSICS↗

Runtime Systems for Energy Efficiency in Advanced Computing Systems

As heterogeneous systems become increasingly popular for both mobile and high-performance computing, conventional efficiency techniques such as dynamic voltage and frequency scaling (DVFS) fail to account for the tightly coupled and varied nature of systems on a chip (SoCs). In this work, we explore the impact of system unaware DVFS techniques on a mobile SoC under three benchmark suites: Chai, Rodinia, and Antutu. We then analyze performance trends across the suites to identify a set of consistent operating points that optimally balance power and performance across the system. The consistent operating points are then constructed into a dependency graph which can be leveraged to produce a more effective, SoC-wide governor.

97 MATHEMATICS AND COMPUTING↗

Graphical Methods for Quantifying Macromolecules through Bright Field Imaging

Bright ?eld imaging of biological samples stained with antibodies and/or special stains provides a rapid protocol for visualizing various macromolecules. However, this method of sample staining and imaging is rarely employed for direct quantitative analysis due to variations in sample fixations, ambiguities introduced by color composition, and the limited dynamic range of imaging instruments. We demonstrate that, through the decomposition of color signals, staining can be scored on a cell-by-cell basis. We have applied our method to Flbroblasts grown from histologically normal breast tissue biopsies obtained from two distinct populations. Initially, nuclear regions are segmented through conversion of color images into gray scale, and detection of dark elliptic features. Subsequently, the strength of staining is quanti?ed by a color decomposition model that is optimized by a graph cut algorithm. In rare cases where nuclear signal is significantly altered as a result of samplepreparation, nuclear segmentation can be validated and corrected. Finally, segmented stained patterns are associated with each nuclear region following region-based tessellation. Compared to classical non-negative matrix factorization, proposed method (i) improves color decomposition, (ii) has a better noise immunity, (iii) is more invariant to initial conditions, and (iv) has a superior computing performance

60 APPLIED LIFE SCIENCES↗

A path flux analysis method for the reduction of detailed chemical kinetic mechanisms

A direct path flux analysis (PFA) method for kinetic mechanism reduction is proposed and validated by using high temperature ignition, perfect stirred reactors, and steady and unsteady flame propagations of n-heptane and n-decane/air mixtures. The formation and consumption fluxes of each species at multiple reaction path generations are analyzed and used to identify the important reaction pathways and the associated species. The formation and consumption path fluxes used in this method retain flux conservation information and are used to define the path indexes for the first and the second generation reaction paths related to a targeted species. Based on the indexes of each reaction path for the first and second generations, different sized reduced chemical mechanisms which contain different number of species are generated. The reduced mechanisms of n-heptane and n-decane obtained by using the present method are compared to those generated by the direct relation graph (DRG) method. The reaction path analysis for n-decane is conducted to demonstrate the validity of the present method. The comparisons of the ignition delay times, flame propagation speeds, flame structures, and unsteady spherical flame propagation processes showed that with either the same or significantly less number of species, the reduced mechanisms generated by the present PFA are more accurate than that of DRG in a broad range of initial pressures and temperatures. The method is also integrated with the dynamic multi-timescale method and a further increase of computation efficiency is achieved. (author)

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Network analysis uncovers the communication structure of SARS-CoV-2 spike protein identifying sites for immunogen design

The COVID-19 pandemic, caused by the SARS-CoV-2 virus, has triggered myriad efforts to understand the structure and dynamics of this complex pathogen. The spike glycoprotein of SARS-CoV-2 is a significant target for immunogens as it is the means by which the virus enters human cells, while simultaneously sporting mutations responsible for immune escape. These functional and escape processes are regulated by complex molecular-level interactions. Our study presents quantitative insights on domain and residue contributions to allosteric communication, immune evasion, and local- and global-level control of functions through the derivation of a weighted graph representation from all-atom MD simulations. Focusing on the ancestral form and the D614G-variant, we provide evidence of the utility of our approach by guiding the selection of a mutation that alters the spike’s stability. Taken together, the network approach serves as a valuable tool to evaluate communication “hot-spots” in proteins to guide design of stable immunogens.

60 APPLIED LIFE SCIENCES↗

Machine learning assisted search for Fe–Co–C ternary compounds with high magnetic anisotropy

We employ a machine learning (ML)-guided framework to explore rare earth free magnetic materials, specifically focusing on Fe–Co–C ternary compounds for potential use in permanent magnets. Utilizing a specifically trained crystal graph convolutional neural network model, we efficiently screen a vast space of nearly a million substitutional structures to select 620 promising structures for further investigation by first-principles calculation. We predict five low-energy metastable Fe–Co–C compounds with formation energy less than 150 meV/atom above the convex hull. These compounds exhibit high magnetization (Js > 1.0 T) and significant magnetic anisotropy (K1 > 1.0 MJ/m3), making them promising candidates for permanent magnet applications. The phonon calculations indicate these compounds are dynamically stable. Our ML-guided framework demonstrates the utility of rapidly identifying novel materials with tailored magnetic properties.

36 MATERIALS SCIENCE↗

Localization and Criticality in Antiblockaded Two-Dimensional Rydberg Atom Arrays

Controllable Rydberg atom arrays have provided new insights into fundamental properties of quantum matter both in and out of equilibrium. In this work, we study the effect of experimentally relevant positional disorder on Rydberg atoms trapped in a 2D square lattice under antiblockade (facilitation) conditions. We show that the facilitation conditions lead the connectivity graph of a particular subspace of the full Hilbert space to form a 2D Lieb lattice, which features a singular flat band. Remarkably, we find three distinct regimes as the disorder strength is varied: a critical regime, a delocalized but nonergodic regime, and a regime with a disorder-induced flat band. The critical regime’s existence depends crucially upon the singular flat band in our model, and is absent in any 1D array or ladder system. We propose to use quench dynamics to probe the three different regimes experimentally.

2-dimensional systems↗

Element-by-element and implicit-explicit finite element formulations for computational fluid dynamics

Preconditioner algorithms to reduce the computational effort in FEM analyses of large-scale fluid-dynamics problems are presented. A general model problem is constructed on the basis of the convection-diffusion equation and the two-dimensional vorticity/stream-function formulation of the Navier-Stokes equations; this problem is then analyzed using element-by-element, implicit-explicit, and adaptive implicit-explicit approximation schemes. Numerical results for the two-dimensional advection and rigid-body rotation of a cosine hill, flow past a circular cylinder, and driven cavity flow are presented in extensive graphs and shown to be in good agreement with those obtained using implicit methods.

Tezduyar, T. E.↗

Quantum Adiabatic Optimization and Combinatorial Landscapes

In this paper we analyze the performance of the Quantum Adiabatic Evolution (QAE) algorithm on a variant of Satisfiability problem for an ensemble of random graphs parametrized by the ratio of clauses to variables, gamma = M / N. We introduce a set of macroscopic parameters (landscapes) and put forward an ansatz of universality for random bit flips. We then formulate the problem of finding the smallest eigenvalue and the excitation gap as a statistical mechanics problem. We use the so-called annealing approximation with a refinement that a finite set of macroscopic variables (verses only energy) is used, and are able to show the existence of a dynamic threshold gamma = gammad, beyond which QAE should take an exponentially long time to find a solution. We compare the results for extended and simplified sets of landscapes and provide numerical evidence in support of our universality ansatz.

Smelyanskiy, V. N.↗

Contributions on the Subject of Longitudinal Movements of Aircraft in Wind Shears

The effect of downburst-type wind shears on the longitudinal dynamic behavior of an unguided aircraft is simulated numerically on the basis of published meteorological data and the flight characteristics of an A300-B passenger jet. The nonlinear differential equations of the aircraft motion are linearized by conventional methods, and the wind effects are introduced via the linear derivatives of the wind components referred to the wind gradients to obtain simplified technical models of the longitudinal response to all possible types of constant-gradient wind shears during the first 20-60 sec. Graphs, maps, and diagrams are provided, and a number of accidents presumed to have involved wind shears are analyzed in detail.

Krauspe, P.↗

On the Marriage of Asynchronous Many Task Runtimes and Big Data: A Glance

The rise of the accelerator-based architectures and reconfigurable computing have showcased the weakness of software stack toolchains that still maintain a static view of the hardware instead of relying on a symbiotic relationship between static (e.g., compilers) and dynamic tools (e.g., runtimes). In the past decades, this need has given rise to adaptive runtimes with increasingly finer computational tasks. These finer tasks help to take advantage of the hardware by switching out when a long latency operation is encountered (because of the deeper memory hierarchies and new memory technologies that might target streaming instead of random access), thus trading off idle time for unrelated work. Examples of these finer task runtimes are Asynchronous Many Task (AMT) runtimes, in which highly efficient computational graphs run on a variety of hardware. Due to its inherent latency tolerant characteristics, Latency-sensitive applications, such as Graph Analytics and Big Data can effectively use these runtimes. This paper aims to present an example of how the careful design of an AMT can exploit the hardware substrate when faced with high latency applications such as the ones given in the Big Data domain. Moreover, with its introspection and adaptive capabilities, we aim to show the power of these runtimes when facing the changing requirements of the application workloads. We use the Performance Open Community Runtime (P-OCR) as our vehicle to demonstrate the concepts presented here.

adaptive runtime, big data analysis↗