Search NASA⌕ Search

SEARCH · Search NASA

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 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

EnviroNET: On-line information for LDEF

EnviroNET is an on-line, free-form database intended to provide a centralized repository for a wide range of technical information on environmentally induced interactions of use to Space Shuttle customers and spacecraft designers. It provides a user-friendly, menu-driven format on networks that are connected globally and is available twenty-four hours a day - every day. The information, updated regularly, includes expository text, tabular numerical data, charts and graphs, and models. The system pools space data collected over the years by NASA, USAF, other government research facilities, industry, universities, and the European Space Agency. The models accept parameter input from the user, then calculate and display the derived values corresponding to that input. In addition to the archive, interactive graphics programs are also available on space debris, the neutral atmosphere, radiation, magnetic fields, and the ionosphere. A user-friendly, informative interface is standard for all the models and includes a pop-up help window with information on inputs, outputs, and caveats. The system will eventually simplify mission analysis with analytical tools and deliver solutions for computationally intense graphical applications to do 'What if...' scenarios. A proposed plan for developing a repository of information from the Long Duration Exposure Facility (LDEF) for a user group is presented.

Lauriente, Michael↗
DOE OSTI2025

Role of the chiral anomaly in polarized deeply inelastic scattering. III. Wess-Zumino-Witten contributions and chiral Ward identities for finite quark mass

We extend our prior results on the worldline computation of the axial vector-vector-vector (AVV) triangle anomaly in polarized deeply inelastic scattering (DIS) to the finite mass case by computing in addition the pseudoscalar-vector-vector (PVV) triangle graph. For the well-studied QED case, we show explicitly how the off-forward AVV pole exactly cancels an identical PVV pole. We then demonstrate the dramatic difference in QCD due to the chiral condensate, which qualitatively modifies anomalous Ward identities. As in the massless case, the anomaly pole in QCD is canceled by the dynamics of a primordial isosinglet pseudoscalar η ¯ -meson, whose Wess-Zumino-Witten coupling to the topological charge density shifts the pole to the physical η ′ mass, with the finite quark mass contribution differing by O ( 10 % ) from the Witten-Veneziano formula. We obtain a compact analytic expression for the finite mass corrections to Shore and Veneziano’s result that the proton’s net quark helicity Δ Σ ∝ χ QCD ′ | m = 0 ( 0 ) , the forward slope of the topological susceptibility in the chiral limit, and show they are of the order of a few percentages. Our prior prediction that the polarized DIS structure function g 1 is quenched by sphaleronlike topological transitions at small x is unaffected by quark mass effects. Our results illustrate how worldline computations of anomalous processes, in synergy with lattice computations and nonet chiral perturbation theory, can uncover novel nonperturbative features of QCD at the Electron-Ion Collider. Published by the American Physical Society 2025

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1985

Information content in spectral calculations

Analytical procedures for extracting piecewise smooth solutions of hyperbolic systems from raw oscillatory data obtained by pseudospectral methods are developed. The validity of the approach is demonstrated for the case of linear problems with constant coefficients, and plausibility arguments are presented which indicate its applicability to nonlinear operators when the steady state has been achieved. Numerical results for the development of an oblique shock when a wedge is inserted at zero angle of attack into a uniform supersonic flow of an ideal gas (the time-dependent two-dimensional Euler equations discretized in space by the pseudospectral Chebyshev method) are presented in tables and graphs.

Abarbanel, S.↗
NASA NTRS1989

Computation of rarefied hypersonic flows

Numerical techniques for the simulation of hypersonic flows of rarefied gases are examined in an analytical review. The direct-simulation Monte Carlo (DSMC) method developed to interpret measurement data obtained by the Space Shuttle in the SUMS project is described; the fundamental limitations of the DMSC approach are discussed; and modifications to improve the physical plausibility of DSMC predictions are proposed. Particular attention is given to the use of a double-peaked molecular distribution function for the internal flow in the SUMS probe, a downstream vacuum-reservoir condition as a simplifying assumption, and an explicit forward-time centered-space differencing scheme for the discretization of the SUMS problem. Typical simulation results are presented in extensive graphs and briefly characterized.

Cheng, Sin-I↗
DOE OSTI2025

A physical basis for cosmological correlators from cuts

Significant progress has been made in our understanding of the analytic structure of FRW wavefunction coefficients, facilitated by the development of efficient algorithms to derive the differential equations they satisfy. Moreover, recent findings indicate that the twisted cohomology of the associated hyperplane arrangement defining FRW integrals overestimates the number of integrals required to define differential equations for the wave-function coefficient. We demonstrate that the associated dual cohomology is automatically organized in a way that is ideal for understanding and exploiting the cut/residue structure of FRW integrals. Utilizing this understanding, we develop a systematic approach to organize compatible sequential residues, which dictates the physical subspace of FRW integrals for any n -site, ℓ-loop graph. In particular, the physical subspace of tree-level FRW wavefunction coefficients is populated by differential forms associated to cuts/residues that factorize the integrand of the wavefunction coefficient into only flat space amplitudes. After demonstrating the validity of our construction using intersection theory, we develop simple graphical rules for cut tubings that enumerate the space of physical cuts and, consequently, differential forms without any calculation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Analyzing inference workloads for spatiotemporal modeling

Ensuring power grid resiliency, forecasting climate conditions, and optimization of transportation infrastructure are some of the many application areas where data is collected in both space and time. Spatiotemporal modeling is about modeling those patterns for forecasting future trends and carrying out critical decision-making by leveraging machine learning/deep learning. Once trained offline, field deployment of trained models for near real-time inference could be challenging because performance can vary significantly depending on the environment, available compute resources and tolerance to ambiguity in results. Users deploying spatiotemporal models for solving complex problems can benefit from analytical studies considering a plethora of system adaptations to understand the associated performance-quality trade-offs. To facilitate the co-design of next-generation hardware architectures for field deployment of trained models, it is critical to characterize the workloads of these deep learning (DL) applications during inference and assess their computational patterns at different levels of the execution stack. In this paper, we develop several variants of deep learning applications that use spatiotemporal data from dynamical systems. We study the associated computational patterns for inference workloads at different levels, considering relevant models (Long short-term Memory, Convolutional Neural Network and Spatio-Temporal Graph Convolution Network), DL frameworks (Tensorflow and PyTorch), precision (FP16, FP32, AMP, INT16 and INT8), inference runtime (ONNX and AI Template), post-training quantization (TensorRT) and platforms (Nvidia DGX A100 and Sambanova SN10 RDU). Overall, our findings indicate that although there is potential in mixed-precision models and post-training quantization for spatiotemporal modeling, extracting efficiency from contemporary GPU systems might be challenging. Instead, co-designing custom accelerators by leveraging optimized High Level Synthesis frameworks (such as SODA High-Level Synthesizer for customized FPGA/ASIC targets) can make workload-specific adjustments to enhance the efficiency.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

The all configuration mean energy multiconfiguration self-consistent-field method. I. Equal configuration weights

The All Configuration Mean Energy (ACME) conditions are a special case of state averaging for Multiconfigurational Self-Consistent-Field (MCSCF) orbital optimisation. The method is formulated using the Graphical Unitary Group Approach (GUGA) in which the Configuration State Function (CSF) basis is represented as walks within a Shavitt graph. This graphical formulation leads to efficient recursive algorithms for the energy and reduced density matrices (RDM) that are independent of the CSF dimension and that scale only as O(n2) where n is the number of occupied orbitals. The Hamiltonian matrix diagonalization step is obviated and the CSF expansion coefficients are neither referenced nor required. This allows MCSCF orbital optimisation to be performed for essentially unlimited numbers of active orbitals and arbitrarily large CSF expansions. The discussion includes various types of CSF expansion spaces, the partitioning of the essential and redundant orbital optimisation parameters, the computation of the spin-density, and the formulation of state-specific analytic gradients and nonadiabatic coupling for high-level electronic structure methods that use the ACME MCSCF orbitals.

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

Postdisaster Routing of Movable Energy Resources for Enhanced Distribution System Resilience: A Deep Reinforcement Learning-Based Approach

The deployment of movable energy resources (MERs) can be an effective strategy to restore critical loads to enhance power system resilience when no other energy sources are available after the occurrence of an extreme event. Since the optimal locations of MERs following an extreme event are dependent on system operating states (e.g., the loads at each node, on/off status of system branches, and so on), existing analytical and population-based approaches must repeat the entire analysis and calculation when the system operating states change. On the contrary, if deep reinforcement learning (DRL)-based algorithms are sufficiently trained with a wide range of scenarios, they can quickly find optimal or near-optimal locations irrespective of changes in system states. A deep Q-learning-based approach is proposed for optimal MER deployment to enhance power system resilience. MERs can be also utilized to complement other types of resources, if available. The proposed approach operates in two stages after the occurrence of extreme events. In the first stage, the distribution network is represented as a graph, and the network is then reconfigured using tie switches by using Kruskal’s spanning forest search algorithm (KSFSA). To maximize critical load recovery, the optimal or near-optimal locations of MERs are chosen in the second stage. Further, case studies on a 33-node distribution system and a modified IEEE 123-node system demonstrate the effectiveness of the proposed approach for postdisaster routing of MERs.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1988

Strategies for concurrent processing of complex algorithms in data driven architectures

Research directed at developing a graph theoretical model for describing data and control flow associated with the execution of large grained algorithms in a special distributed computer environment is presented. This model is identified by the acronym ATAMM which represents Algorithms To Architecture Mapping Model. The purpose of such a model is to provide a basis for establishing rules for relating an algorithm to its execution in a multiprocessor environment. Specifications derived from the model lead directly to the description of a data flow architecture which is a consequence of the inherent behavior of the data and control flow described by the model. The purpose of the ATAMM based architecture is to provide an analytical basis for performance evaluation. The ATAMM model and architecture specifications are demonstrated on a prototype system for concept validation.

Stoughton, John W.↗
NASA NTRS1985

Shock associated noise of inverted-profile coannular jets. II - Condition for minimum noise. III - Shock structure and noise characteristic

The generation of noise by the shock-turbulence interaction with shock cells in an inverted-profile coannular jet with nozzle exit velocity aligned with the jet axis is investigated analytically, interpreting the optical measurements of Tanna et al. (1985). The noise-intensity minimum at slightly supersonic primary-flow velocities is related to the weakness of the primary-stream shock-cell structure and the lack of such a pattern in the outer fan stream. The discrepancies between this finding and those of Dosanjh et al. (1977 and 1978) are attributed to nozzle design, the definition of minimum noise, and different interpretative approaches. A first-order shock-cell model is then developed to derive formulas for the peak frequencies and the scaling of noise intensity. The results of computations using these formulas are presented in graphs and found to be in good agreement with the experimental data.

Tam, C. K. W.↗
NASA NTRS1987

Quasi-steady flight to quasi-steady flight transition in a windshear - Trajectory guidance

The control (via the angle of attack) of the vertical flight of an aircraft taking off at maximum power in a horizontal wind shear with downdraft is investigated analytically. Optimal trajectories to recover the initial path inclination or to recover quasi-steady flight (the relative values of the velocity, path inclination, and angle of attack) are derived using a Chebyshev approach and shown to be nearly identical in the shear but divergent after the shear. These results are then applied to construct a trajectory-guidance control comprising a variable-gamma guidance scheme for the shear trajectory, a constant-gamma guidance scheme for the immediate postshear trajectory, and a constant-rate-of-climb guidance scheme for the aftershear trajectory. Numerical results demonstrating the near-optimal performance of the control are presented in tables and graphs.

Miele, A.↗
DOE OSTI2020

Almost-Rigidity of Frameworks

Here, we extend the mathematical theory of rigidity of frameworks (graphs embedded in d-dimensional space) to consider nonlocal rigidity and flexibility properties. We provide conditions on a framework under which (I) as the framework flexes continuously it must remain inside a small ball, a property we call “almost-rigidity”; (II) any other framework with the same edge lengths must lie outside a much larger ball; (III) if the framework deforms by some given amount, its edge lengths change by a minimum amount; (IV) there is a nearby framework that is prestress stable, and thus rigid. The conditions can be tested efficiently using semidefinite programming. The test is a slight extension of the test for prestress stability of a framework, and gives analytic expressions for the radii of the balls and the edge length changes. Examples illustrate how the theory may be applied in practice, and we provide an algorithm to test for rigidity or almost-rigidity. We briefly discuss how the theory may be applied to tensegrities. © 2020 Wiley Periodicals LLC.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

ARENA: Asynchronous Reconfigurable Accelerator Ring to Enable Data-Centric Parallel Computing

The next generation HPC and data centers are likely to be reconfigurable and data-centric due to the trend of hardware specialization and the emergence of data-driven applications. In this work, we propose ARENA – an asynchronous reconfigurable accelerator ring architecture as a potential scenario on how the future HPC and data centers will be like. Despite using the coarse-grained reconfigurable arrays (CGRAs) as the substrate platform, our key contribution is not only the CGRA-cluster design itself, but also the ensemble of a new architecture and programming model that enables asynchronous tasking across a cluster of reconfigurable nodes, so as to bring specialized computation to the data rather than the reverse. We presume distributed data storage without asserting any prior knowledge on the data distribution. Hardware specialization occurs at runtime when a task finds the majority of data it requires are available at the present node. In other words, we dynamically generate specialized CGRA accelerators where the data reside. The asynchronous tasking for bringing computation to data is achieved by circulating the task token, which describes the dataflow graphs to be executed for a task, among the CGRA cluster connected by a fast ring network. Evaluations on a set of HPC and data-driven applications across different domains show that ARENA can provide better parallel scalability with reduced data movement (53.9 percent). Compared with contemporary compute-centric parallel models, ARENA can bring on average 4.37× speedup. The synthesized CGRAs and their task-dispatchers only occupy 2.93mm 2 chip area under 45nm process technology and can run at 800MHz with on average 759.8mW power consumption. ARENA also supports the concurrent execution of multi-applications, offering ideal architectural support for future high-performance parallel computing and data analytics systems.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1987

Strategies for concurrent processing of complex algorithms in data driven architectures

The results of ongoing research directed at developing a graph theoretical model for describing data and control flow associated with the execution of large grained algorithms in a spatial distributed computer environment is presented. This model is identified by the acronym ATAMM (Algorithm/Architecture Mapping Model). The purpose of such a model is to provide a basis for establishing rules for relating an algorithm to its execution in a multiprocessor environment. Specifications derived from the model lead directly to the description of a data flow architecture which is a consequence of the inherent behavior of the data and control flow described by the model. The purpose of the ATAMM based architecture is to optimize computational concurrency in the multiprocessor environment and to provide an analytical basis for performance evaluation. The ATAMM model and architecture specifications are demonstrated on a prototype system for concept validation.

Stoughton, John W.↗
DOE OSTI2018

Dynamic Workflows for Routine Materials Discovery in Surface Science

The rising application of informatics and data science tools for studying inorganic crystals and small molecules has revolutionized approaches to materials discovery and driven the development of accurate machine learning structure/property relationships. In this paper, we discuss how informatics tools can accelerate research, and we present various combinations of workflows, databases, and surrogate models in the literature. This paradigm has been slower to infiltrate the catalysis community due to larger configuration spaces, difficulty in describing necessary calculations, and thermodynamic/kinetic quantities that require many interdependent calculations. We present our own informatics tool that uses dynamic dependency graphs to share, organize, and schedule calculations to enable new, flexible research workflows in surface science. This approach is illustrated for the large-scale screening of intermetallic surfaces for electrochemical catalyst activity. Similar approaches will be important to bring the benefits of informatics and data science to surface science research. Lastly, we provide our perspective on when to use these tools and considerations when creating them.

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

Prediction of organic homolytic bond dissociation enthalpies at near chemical accuracy with sub-second computational cost

Bond dissociation enthalpies (BDEs) of organic molecules play a fundamental role in determining chemical reactivity and selectivity. However, BDE computations at sufficiently high levels of quantum mechanical theory require substantial computing resources. In this paper, we develop a machine learning model capable of accurately predicting BDEs for organic molecules in a fraction of a second. We perform automated density functional theory (DFT) calculations at the M06-2X/def2-TZVP level of theory for 42,577 small organic molecules, resulting in 290,664 BDEs. A graph neural network trained on a subset of these results achieves a mean absolute error of 0.58 kcal mol-1 (vs DFT) for BDEs of unseen molecules. We further demonstrate the model on two applications: first, we rapidly and accurately predict major sites of hydrogen abstraction in the metabolism of drug-like molecules, and second, we determine the dominant molecular fragmentation pathways during soot formation.

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

State-based network similarity visualization

We introduce an approach for the interactive visual analysis of weighted, dynamic networks. These networks arise in areas such as computational neuroscience, sociology, and biology. Network analysis remains challenging due to complex time-varying network behavior. For example, edges disappear/reappear, communities grow/vanish, or overall network topology changes. Our technique, TimeSum, detects the important topological changes in graph data to abstract the dynamic network and visualize one summary representation for each temporal phase, a state. We define a network state as a graph with similar topology over a specific time interval. To enable a holistic comparison of networks, we use a difference network to depict edge and community changes. Here, we present case studies to demonstrate that our methods are effective and useful for extracting and exploring complex dynamic behavior of networks.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2021

InteraChem: Virtual Reality Visualizer for Reactive Interactive Molecular Dynamics

Interactive molecular dynamics in virtual reality (IMD-VR) simulations provide a digital molecular playground for students as an alternative or complement to traditional molecular modeling kits or 2D illustrations. Previous IMD-VR studies have used molecular mechanics to enable simulations of macromolecules such as proteins and nanostructures for the classroom setting with considerable success. Here, we present the InteraChem molecular visualizer, intended for reactive IMD-VR simulation using semiempirical and ab initio methods. InteraChem visualizes not only the molecular geometry but also (1) isosurfaces such as molecular orbitals and electrostatic potentials and (2) two-dimensional graphs of time-varying simulation quantities such as kinetic/potential energy, internal coordinates, and user-applied force. Additionally, InteraChem employs speech recognition to facilitate user interaction and introduces a novel “atom happiness” visualization using emojis to indicate the energetic feasibility of a particular bonding arrangement. Furthermore, we include a set of accompanying exercises that we have used to teach chemical reactivity in small molecular systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗