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 451 records · Page 25

First-principles treatment of Mott insulators: linearized QSGW+DMFT approach

The theoretical understanding of emergent phenomena in quantum materials is one of the greatest challenges in condensed matter physics. In contrast to simple materials such as noble metals and semiconductors, macroscopic properties of quantum materials cannot be predicted by the properties of individual electrons. One of the examples of scientific importance is strongly correlated electron system. Neither localized nor itinerant behaviors of electrons in partially filled 3d, 4f, and 5f orbitals give rise to rich physics such as Mott insulators, high-temperature superconductors, and superior thermoelectricity, but hinder quantitative understanding of low-lying excitation spectrum. Here we present a new first-principles approach to strongly correlated solids. It is based on a combination of the quasiparticle self-consistent GW approximation and the dynamical mean-field theory. The sole input in this method is the projector to the set of correlated orbitals for which all local Feynman graphs are being evaluated. For that purpose, we choose very localized quasiatomic orbitals spanning large energy window, which contains most strongly hybridized bands, as well as upper and lower Hubbard bands. The self-consistency is carried out on the Matsubara axis. This method enables the first-principles study of Mott insulators in both their paramagnetic and antiferromagnetic phases. We illustrate the method on the archetypical charge transfer correlated insulators La 2 CuO 4 and NiO, and obtain spectral properties and magnetic moments in good agreement with experiments.

36 MATERIALS SCIENCE↗

Studying CPU and memory utilization of applications on Fujitsu A64FX and Nvidia Grace Superchip

ARM-based manycore CPU architectures are well-positioned to provide the rising memory throughput requirements of modern data intensive scientific applications in High Performance Computing (HPC). The Fujitsu A64FX CPU platform is based on the ARM v8.2A architecture, and is the processor of the flagship Japanese supercomputer - "Fugaku", which was previously ranked as the #1 supercomputer in the world according to the Top500 list. The Nvidia Grace superchip features 144 Neoverse V2 cores based on the ARMv9 architecture with 4x128b SVE2, providing exceptional computational power. The chip supports up to 480GB of memory, making it ideal for AI, machine learning, and scientific computing workloads. In this paper, we conduct a thorough performance exploration of a variety of parallel bandwidth-sensitive benchmarks and applications compiled with the native Fujitsu compiler on a Fugaku A64FX compute node and ARM (LLVM) Compiler on an NVIDIA Grace superchip compute node, engaging all the computational cores per cluster using OpenMP multithreading (assuming the cores can drive the available bandwidth). Our ultimate goals are to study the resource utilization of scientific applications and benchmarks on A64FX and Grace superchip, considering graph application scenarios ( GAP Benchmark suite) and eleven appli- cation proxies from the Rodinia heterogeneous benchmark suite (considering domains such as Data Mining, Bioinformatics, Fluid Dynamics, Pattern Recognition, etc.). Through exhaustive performance monitoring, we quantify the resource utilization of diverse OpenMP-based HPC applications on both the Fujitsu A64FX and the Nvidia Grace Superchip platforms.

benchmarking, Performance Analysis, High performan↗

Prototyping user displays using CLIPS

CLIPS is being used as an integral module of a rapid prototyping system. The prototyping system consists of a display manager for object browsing, a graph program for displaying line and bar charts, and a communications server for routing messages between modules. A CLIPS simulation of a physical model provides dynamic control of the user's display. Currently, a project is well underway to prototype the Advanced Automation System (AAS) for the Federal Aviation Administration.

Kosta, Charles P.↗

Voyager infrared observations of Uranus' atmosphere - Thermal structure and dynamics

The temperature structure of the Uranus atmosphere is investigated on the basis of 325/cm and 225/cm Voyager 2 IRIS observations of a layer between 60 and 200 mbar (including the tropopause). The data are presented in graphs and analyzed in detail. The latitudinal variations of the temperature near the tropopause and the inferred thermal winds are shown to be in good agreement with the findings reported for lower altitudes by Hanel et al. (1986), although greater in amplitude. A linear zonally symmetric circulation model with no solar and condensation heating, a frictional damping time 1-2 times the radiative damping time, a subrotating atmosphere at low latitudes, and zonal winds decaying with altitude is proposed to account for the observed structures.

Flasar, F. M.↗

A nonrecursive order N preconditioned conjugate gradient: Range space formulation of MDOF dynamics

While excellent progress has been made in deriving algorithms that are efficient for certain combinations of system topologies and concurrent multiprocessing hardware, several issues must be resolved to incorporate transient simulation in the control design process for large space structures. Specifically, strategies must be developed that are applicable to systems with numerous degrees of freedom. In addition, the algorithms must have a growth potential in that they must also be amenable to implementation on forthcoming parallel system architectures. For mechanical system simulation, this fact implies that algorithms are required that induce parallelism on a fine scale, suitable for the emerging class of highly parallel processors; and transient simulation methods must be automatically load balancing for a wider collection of system topologies and hardware configurations. These problems are addressed by employing a combination range space/preconditioned conjugate gradient formulation of multi-degree-of-freedom dynamics. The method described has several advantages. In a sequential computing environment, the method has the features that: by employing regular ordering of the system connectivity graph, an extremely efficient preconditioner can be derived from the 'range space metric', as opposed to the system coefficient matrix; because of the effectiveness of the preconditioner, preliminary studies indicate that the method can achieve performance rates that depend linearly upon the number of substructures, hence the title 'Order N'; and the method is non-assembling. Furthermore, the approach is promising as a potential parallel processing algorithm in that the method exhibits a fine parallel granularity suitable for a wide collection of combinations of physical system topologies/computer architectures; and the method is easily load balanced among processors, and does not rely upon system topology to induce parallelism.

Kurdila, Andrew J.↗

E(3)-equivariant graph neural networks for data-efficient and accurate interatomic potentials

Abstract This work presents Neural Equivariant Interatomic Potentials (NequIP), an E(3)-equivariant neural network approach for learning interatomic potentials from ab-initio calculations for molecular dynamics simulations. While most contemporary symmetry-aware models use invariant convolutions and only act on scalars, NequIP employs E(3)-equivariant convolutions for interactions of geometric tensors, resulting in a more information-rich and faithful representation of atomic environments. The method achieves state-of-the-art accuracy on a challenging and diverse set of molecules and materials while exhibiting remarkable data efficiency. NequIP outperforms existing models with up to three orders of magnitude fewer training data, challenging the widely held belief that deep neural networks require massive training sets. The high data efficiency of the method allows for the construction of accurate potentials using high-order quantum chemical level of theory as reference and enables high-fidelity molecular dynamics simulations over long time scales.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Knowledge Graph Approach for the Secondary Use of Cancer Registry Data

Population-based central cancer registries collect valuable structured and unstructured data primarily for cancer surveillance and research, enhancing insights into clinical features associated with cancer occurrence, cancer treatment, and cancer outcomes to guide interventions which reduce the cancer burden. Cancer registries primarily collect data on (1) cancer type (case or tumor); (2) patient demographics such as age, gender, and residential address at time of diagnosis; (3) planned first course of treatment; and (4) date of last contact, vital status, and cause of death. Cancer registry data is dynamic, structured data, which is extracted from many unstructured sources such as electronic healthcare records, and consolidated for reporting and other purposes. While available advanced analytic tools such as SEER*Stat have the ability to build SAS queries, we, however, explore an innovative knowledge graph approach to organizing cancer registry data for advanced analytics and visualization, which has unique advantages over approaches of existing tools. This innovative knowledge graph approach semantically enriches the data and easily enables linkage with third-party data, which can better explain variation in outcomes. We have developed a prototype knowledge graph based on data from the Louisiana Tumor Registry and other publicly available datasets including Behavioral Risk Factor Surveillance System, Clinical Trials, DBpedia, GeoNames, Rural-Urban Continuum Codes, and Semantic MEDLINE. The resource description framework (RDF) data model was selected to represent our knowledge graph, which contains more than 25 billion triples and is ~4TB in storage size. To exhibit the benefits of the knowledge graph approach, we used scenario specific queries, which find the relationships between cancer treatment sequences and outcomes. To illustrate its ease of use in iterative analysis, the knowledge graph was linked to external datasets for performing complex queries across multiple datasets. In addition, we used knowledge graphs to identify data discrepancies and to handle schema changes. Finally, we visualized the knowledge graph to discover data patterns. Our results demonstrate this graph-based solution enables cancer researchers to execute complex queries and more easily perform iterative analyses to improve understanding of cancer registry data. In the future, we would like to use high-performance computing (HPC) resources for faster-generating hypotheses with clinical potential from our knowledge graph.

Hasan, S M Shamimul↗

Fast GPU-Based Generation of Large Graph Networks From Degree Distributions

Synthetically generated, large graph networks serve as useful proxies to real-world networks for many graph-based applications. The ability to generate such networks helps overcome several limitations of real-world networks regarding their number, availability, and access. Here, we present the design, implementation, and performance study of a novel network generator that can produce very large graph networks conforming to any desired degree distribution. The generator is designed and implemented for efficient execution on modern graphics processing units (GPUs). Given an array of desired vertex degrees and number of vertices for each desired degree, our algorithm generates the edges of a random graph that satisfies the input degree distribution. Multiple runtime variants are implemented and tested: 1) a uniform static work assignment using a fixed thread launch scheme, 2) a load-balanced static work assignment also with fixed thread launch but with cost-aware task-to-thread mapping, and 3) a dynamic scheme with multiple GPU kernels asynchronously launched from the CPU. The generation is tested on a range of popular networks such as Twitter and Facebook, representing different scales and skews in degree distributions. Results show that, using our algorithm on a single modern GPU (NVIDIA Volta V100), it is possible to generate large-scale graph networks at rates exceeding 50 billion edges per second for a 69 billion-edge network. GPU profiling confirms high utilization and low branching divergence of our implementation from small to large network sizes. For networks with scattered distributions, we provide a coarsening method that further increases the GPU-based generation speed by up to a factor of 4 on tested input networks with over 45 billion edges.

97 MATHEMATICS AND COMPUTING↗

Percolated Ionic Aggregate Morphologies and Decoupled Ion Transport in Precise Sulfonated Polymers Synthesized by Ring-Opening Metathesis Polymerization

Here, we describe a set of precise single-ion conducting polymers that form self-assembled percolated ionic aggregates in glassy polymer matrices and have decoupled transport of metal cations. These precise single-ion conductors (SICs), synthesized by a scalable ring-opening metathesis polymerization, consist of a polyethylene backbone with a sulfonated phenyl group pendant on every fifth carbon and are fully neutralized by a counterion X + (Li + , Na + , or Cs + ). Experimental X-ray scattering measurements and fully atomistic molecular dynamics (MD) simulations are in good agreement. The MD simulations show that the ionic groups nanophase separate from the polymer backbone to form percolating ionic aggregates. Using graph theory, we find that within the Li + - and Na + -neutralized polymers the percolated aggregates exhibit planar and ribbon-like configurations at intermediate length scales, while the percolated aggregates within the Cs + -neutralized polymers are more isotropic. Electrical impedance spectroscopy measurements show that the ionic conductivities exhibit Arrhenius behavior, with conductivities of 10 –7 to 10 –6 S/cm at 180 °C. In the MD simulations, the cations move between sulfonate groups in the percolated aggregates, larger ions travel further, and overall cations travel further than the polymer backbones, indicating a decoupled ion-transport mechanism. Thus, the percolated ionic aggregates in these polymers can serve as pathways to facilitate decoupled ion motion through a glassy polymer matrix.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DAGSENS: Directed Acyclic Graph Based Direct and Adjoint Transient Sensitivity Analysis for Event-Driven Objective Functions

We present DAGSENS, a new theory for parametric transient sensitivity analysis of Differential Algebraic Equation systems (DAEs), such as SPICE-level circuits. The key ideas behind DAGSENS are, (1) to represent the entire sequence of computations, starting from DAE parameters, all the way up to the objective function whose sensitivity is needed, as a Directed Acyclic Graph (DAG) called the "sensitivity DAG", and (2) to compute the required sensitivities efficiently (with time complexity linear in the size of the sensitivity DAG) by leveraging dynamic programming techniques to traverse the DAG. DAGSENS is simple, elegant, and easy-to-understand compared to existing sensitivity analysis approaches; for example, in DAGSENS, one can switch between direct and adjoint transient sensitivities just by changing the direction of DAG traversal (i.e., topological order vs. reverse topological order). Also, DAGSENS is significantly more powerful than existing sensitivity analysis approaches because it allows one to compute the sensitivities of a much more general class of objective functions, including those defined based on "events" that occur during a transient simulation (e.g., a node voltage crossing a particular threshold, a phase-locked loop (PLL) achieving lock, a signal reaching its maximum/minimum value during a transient run, etc.). In this paper, we apply DAGSENS to compute the sensitivities of important event-driven performance metrics in several real-world electronic and biological applications, including high-speed communication (featuring sub-systems such as I/0 links and PLLs), statistical cell library characterization, and gene expression in Drosophila embryos.

42 ENGINEERING↗

Exact Coherent Structures and Phase Space Geometry of Preturbulent 2D Active Nematic Channel Flow

Confined active nematics exhibit rich dynamical behavior, including spontaneous flows, periodic defect dynamics, and chaotic “active turbulence.” Here, we study these phenomena using the framework of exact coherent structures, which has been successful in characterizing the routes to high Reynolds number turbulence of passive fluids. Exact coherent structures are stationary, periodic, quasiperiodic, or traveling wave solutions of the hydrodynamic equations that, together with their invariant manifolds, serve as an organizing template of the dynamics. We compute the dominant exact coherent structures and connecting orbits in a preturbulent active nematic channel flow, which enables a fully nonlinear but highly reduced-order description in terms of a directed graph. Using this reduced representation, we compute instantaneous perturbations that switch the system between disparate spatiotemporal states occupying distant regions of the infinite-dimensional phase space. Overall, our results lay the groundwork for a systematic means of understanding and controlling active nematic flows in the moderate- to high-activity regime.

36 MATERIALS SCIENCE↗

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↗

Some physical applications of random hierarchical matrices

The investigation of spectral properties of random block-hierarchical matrices as applied to dynamic and structural characteristics of complex hierarchical systems with disorder is proposed for the first time. Peculiarities of dynamics on random ultrametric energy landscapes are discussed and the statistical properties of scale-free and polyscale (depending on the topological characteristics under investigation) random hierarchical networks (graphs) obtained by multiple mapping are considered.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A measurement of the hyperfine structure of CO-17

It is pointed out that the isotope of carbon monoxide, CO-17, has appreciable hyperfine structure caused by the electric quadrupole and the magnetic dipole interactions of the O-17 nucleus which has a spin of 5/3. During a radioastronomical study of the structure and dynamics of cold interstellar clouds, it was found that the Bok globule B335 had an extremely small velocity dispersion such that the hyperfine components are clearly resolved. A graph is provided which shows the antenna temperature (a measure of intensity) of the CO-17 emission as a function of frequency. The hyperfine constants and line frequencies were redetermined for the CO-17 J=1 yields 0 rational transition. The observation of CO-17 was carried out with a 7 meter Cassegrain antenna during 1979 and 1980. The CO-17 molecular line parameters are listed in a table.

Frerking, M. A.↗

The dynamics and control of large flexible space structures, 6

The controls analysis based on a truncated finite element model of the 122m. Hoop/Column Antenna System focuses on an analysis of the controllability as well as the synthesis of control laws. Graph theoretic techniques are employed to consider controllability for different combinations of number and locations of actuators. Control law synthesis is based on an application of the linear regulator theory as well as pole placement techniques. Placement of an actuator on the hoop can result in a noticeable improvement in the transient characteristics. The problem of orientation and shape control of an orbiting flexible beam, previously examined, is now extended to include the influence of solar radiation environmental forces. For extremely flexible thin structures modification of control laws may be required and techniques for accomplishing this are explained. Effects of environmental torques are also included in previously developed models of orbiting flexible thin platforms.

Bainum, P. M.↗

The nature of comets

The large-scale structure, dynamics, and chemical composition of comets are examined on the basis of preliminary ground-based and space-probe data from the Halley return of 1986. Diagrams, graphs, photographs, and false-color images are provided, and data on Comet Giacobini-Zinner are included for comparison. Features noted include solar-wind interaction with magnetic-field draping around the head region, dramatic disconnection events, an irregularly shaped monolithic primarily water-ice nucleus and a dark surface, and dust with chemical composition like that of (H, C, N, O)-enriched carbonaceous chondrites.

Brandt, J. C.↗

Flight investigation of variations in rotorcraft control and display dynamics for hover

Results are presented from a flight test of experimental control/display systems for the U.S. Army/NASA CH-47B variable-stability research helicopter in hovering maneuvers, supplementing the preliminary report of Eshow et al. (1987). The display format was a simplified version of the pilot night-vision system for the Apache AH-64, and the tests measured pilot performance in hover-pad capture and hover-pad tracking tasks (under simulated zero visibility) using displays based on (1) gainlike and (2) integratorlike controlled-element responses to control inputs. The implementation of the vehicle-response dynamics through an explicit model-following control system and the derivation of the display laws are described, and the test results are presented in extensive tables and graphs. Display type (1) was found to be preferred by the pilots and to give generally better performance than type (2).

Eshow, Michelle M.↗

Streaming data analytics via message passing with application to graph algorithms

The need to process streaming data, which arrives continuously at high-volume in real-time, arises in a variety of contexts including data produced by experiments, collections of environmental or network sensors, and running simulations. Streaming data can also be formulated as queries or transactions which operate on a large dynamic data store, e.g. a distributed database. We describe a lightweight, portable framework named PHISH which enables a set of independent processes to compute on a stream of data in a distributed-memory parallel manner. Datums are routed between processes in patterns defined by the application. PHISH can run on top of either message-passing via MPI or sockets via ZMQ. The former means streaming computations can be run on any parallel machine which supports MPI; the latter allows them to run on a heterogeneous, geographically dispersed network of machines. We illustrate how PHISH can support streaming MapReduce operations, and describe streaming versions of three algorithms for large, sparse graph analytics: triangle enumeration, subgraph isomorphism matching, and connected component finding. Lastly, we also provide benchmark timings for MPI versus socket performance of several kernel operations useful in streaming algorithms.

97 MATHEMATICS AND COMPUTING↗