Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Edge computing”

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 1,171 records · Page 65

Method and apparatus for shape-based energy analysis of solids

A computer-readable medium stores instructions including storing a model of a physical structure and defining a mesh for the model. The mesh includes finite elements, each defined by a respective set of edges. The instructions include, for each finite element, identifying a governing differential equation and a set of complementary functions that exactly satisfy the governing differential equation. The instructions include determining an applied physical stimulus for the physical structure. The instructions include generating an energy optimization model that minimizes a difference between internal energy and external energy of the finite elements in response to the applied physical stimulus. The model includes a matrix of respective scalar multipliers for the complementary functions for each finite element. The instructions include transforming the matrix and calculating a physical parameter of interest. The instructions include, in response to the physical parameter not satisfying a design parameter, updating the model of the physical structure.

Spears, Robert E.↗

Compact Graph Representations and Parallel Connectivity Algorithms for Massive Dynamic Network Analysis

Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication traffic, and scientific computing can be intuitively modeled as graphs. We present the first study of novel high-performance combinatorial techniques for analyzing large-scale information networks, encapsulating dynamic interaction data in the order of billions of entities. We present new data structures to represent dynamic interaction networks, and discuss algorithms for processing parallel insertions and deletions of edges in small-world networks. With these new approaches, we achieve an average performance rate of 25 million structural updates per second and a parallel speedup of nearly28 on a 64-way Sun UltraSPARC T2 multicore processor, for insertions and deletions to a small-world network of 33.5 million vertices and 268 million edges. We also design parallel implementations of fundamental dynamic graph kernels related to connectivity and centrality queries. Our implementations are freely distributed as part of the open-source SNAP (Small-world Network Analysis and Partitioning) complex network analysis framework.

97 MATHEMATICS AND COMPUTING↗

Cosmic Reionization On Computers. Mean and fluctuating redshifted 21 cm signal

We explore the mean and fluctuating redshifted 21 cm signal in numerical simulations from the Cosmic Reionization On Computers project. We find that the mean signal varies between about ±25 mK. Most significantly, we find that the negative pre-reionization dip at z ∼ 10–15 only extends to 〈ΔT{sub B}〉∼−25 mK, requiring substantially higher sensitivity from global signal experiments that operate in this redshift range (EDGES-II, LEDA, SCI-HI, and DARE) than has often been assumed previously. We also explore the role of dense substructure (filaments and embedded galaxies) in the formation of the 21 cm power spectrum. We find that by neglecting the semi-neutral substructure inside ionized bubbles, the power spectrum can be misestimated by 25%–50% at scales k ∼ 0.1–1h Mpc{sup −1}. This scale range is of particular interest, because the upcoming 21 cm experiments (Murchison Widefield Array, Precision Array for Probing the Epoch of Reionization, Hydrogen Epoch of Reionization Array) are expected to be most sensitive within it.

79 ASTRONOMY AND ASTROPHYSICS↗

Deadlock-free class routes for collective communications embedded in a multi-dimensional torus network

A computer implemented method and a system for routing data packets in a multi-dimensional computer network. The method comprises routing a data packet among nodes along one dimension towards a root node, each node having input and output communication links, said root node not having any outgoing uplinks, and determining at each node if the data packet has reached a predefined coordinate for the dimension or an edge of the subrectangle for the dimension, and if the data packet has reached the predefined coordinate for the dimension or the edge of the subrectangle for the dimension, determining if the data packet has reached the root node, and if the data packet has not reached the root node, routing the data packet among nodes along another dimension towards the root node.

97 MATHEMATICS AND COMPUTING↗

A discrete dislocation dynamics study of precipitate bypass mechanisms in nickel-based superalloys

Order strengthening in nickel-based superalloys is associated with the extra stress required for dislocations to bypass the $\gamma'$ precipitates distributed in the $\gamma$ matrix. Depending on the operating conditions and microstructure, a rich variety of bypass mechanism has been identified, with various shearing and Orowan looping processes gradually giving way to climb bypass as the operating conditions change from the low/intermediate temperatures and high stress regime, to the high temperature and low stress regime. When anti phase boundary (APB) shearing and Orowan looping mechanisms operate, the classical picture is that, at for a given volume fraction, the bypass mechanism changes from shearing to looping with increased particle size and within a broad coexistence size window. Another possibility, which is supported by indirect experimental evidence, is that a third “hybrid” transition mechanism may operate. Here, in this paper we use discrete dislocation dynamics (DDD) simulations to study dislocation bypass mechanisms in Ni-based superalloys. We develop a new method to compute generalized stacking fault forces in DDD simulations, based on a concept borrowed from complex analysis and known as the winding number of a closed curve about a point. We use this method to study the mechanisms of bypass of a square lattice of spherical $\gamma'$ precipitates by $a/2\langle110\rangle$ {111} edge dislocations, as a function of the precipitates volume fraction and size. We show that not only the hybrid mechanism is possible, but also that it operates as the transition mechanism between the shearing and looping regimes over a wide range of precipitates volume fraction and radii. Based on our simulation results, we propose a simple model for the strength of this mechanism. We also consider the effects of a $\gamma$/$\gamma'$ lattice misfit on the bypass mechanisms, which we approximate by an additional precipitate stress computed according to Eshelby’s inclusion theory. We show that in the shearing and hybrid looping-shearing regimes, a lattice misfit generally results in an increased bypass stress. For sufficiently high lattice misfit, the critical bypass configuration in attractive dislocation-precipitates interactions changes dramatically, and the bypass stress is controlled by the pinning of the trailing dislocation on the exit side of the precipitates, similar to what has been reported in the high-temperature creep literature.

36 MATERIALS SCIENCE↗

Second Target Station Computer Science and Math Workshop Report

Discovery science drives innovation and underpins the technological advances that will solve some of society’s most challenging issues, including clean energy technologies, better medicines, safe potable water, and addressing aging infrastructures, including transportation. Many of these advances will result from basic research into new materials and new ways to optimize our use of existing materials. Oak Ridge National Laboratory’s neutron sources provide cutting-edge scientific tools to probe the structure and dynamics of matter in unique ways. This insight is fundamental to advancing our ability to discover, design, control, and use new materials to address society’s most pressing needs.

97 MATHEMATICS AND COMPUTING↗

Plasma Simulation Program

Many others in the fusion energy and advanced scientific computing communities participated in the development of this plan. The core planning team is grateful for their important contributions. This summary is meant as a quick overview the Fusion Simulation Program's (FSP's) purpose and intentions. There are several additional documents referenced within this one and all are supplemental or flow down from this Program Plan. The overall science goal of the DOE Office of Fusion Energy Sciences (FES) Fusion Simulation Program (FSP) is to develop predictive simulation capability for magnetically confined fusion plasmas at an unprecedented level of integration and fidelity. This will directly support and enable effective U.S. participation in International Thermonuclear Experimental Reactor (ITER) research and the overall mission of delivering practical fusion energy. The FSP will address a rich set of scientific issues together with experimental programs, producing validated integrated physics results. This is very well aligned with the mission of the ITER Organization to coordinate with its members the integrated modeling and control of fusion plasmas, including benchmarking and validation activities. [1]. Initial FSP research will focus on two critical Integrated Science Application (ISA) areas: ISA1, the plasma edge; and ISA2, whole device modeling (WDM) including disruption avoidance. The first of these problems involves the narrow plasma boundary layer and its complex interactions with the plasma core and the surrounding material wall. The second requires development of a computationally tractable, but comprehensive model that describes all equilibrium and dynamic processes at a sufficient level of detail to provide useful prediction of the temporal evolution of fusion plasma experiments. The initial driver for the whole device model will be prediction and avoidance of discharge-terminating disruptions, especially at high performance, which are a critical impediment to successful operation of machines like ITER. If disruptions prove unable to be avoided, their associated dynamics and effects will be addressed in the next phase of the FSP.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Resolving local structural motifs across the phase evolution of zinc titanates with computational x-ray absorption spectroscopy

Resolving the local structure motifs that characterize phase evolution as a function of composition is a key challenge in structure characterization of complex materials. Here, in this study, we combine first-principles simulations and x-ray absorption near-edge structures (XANES) analysis to gain insights into the structure evolution revealed by measurements across a combinatorial zinc titanate thin film, which was grown with smoothly varying composition over a wide range of the Ti:Zn ratio. Specifically, we propose a cluster blind-signal-separation (cBSS) method for XANES spectral analysis based on a library of the structures and spectra of representative local motifs. In addition to motifs from zinc titanate crystals, two types of Ti-defect models constructed in this study are key to the understanding of the structure characteristics in the Zn-rich region. The cBSS method makes use of both spectral clustering of the simulated site-XANES spectra library and the BSS procedure to construct high-fidelity spectral basis functions from an experimental spectral sequence. The method provides a rigorous measure of the spectral sensitivity and basis completeness. The results of the XANES analysis are corroborated with other experimental modalities, including x-ray diffraction and spectroscopic ellipsometry, to validate the cBSS method. The calculated motif weights resulting from fitting the XANES spectra with the cBSS basis probe the atomic structure characteristics of both crystalline and amorphous phases as a function of the Ti/Zn composition. The insights of the local structure motif evolution are pivotal to the understanding of the nonmonotonic trend in the optical gap, which may lead to potential applications through tuning the optical properties of zinc titanate. The workflow of the XANES spectral analysis developed in this work can be generalized to construct the structure-property relationship in a broad material space.

36 MATERIALS SCIENCE↗

A Faster Parallel Algorithm and Efficient Multithreaded Implementations for Evaluating Betweenness Centrality on Massive Datasets

We present a new lock-free parallel algorithm for computing betweenness centralityof massive small-world networks. With minor changes to the data structures, ouralgorithm also achieves better spatial cache locality compared to previous approaches. Betweenness centrality is a key algorithm kernel in HPCS SSCA#2, a benchmark extensively used to evaluate the performance of emerging high-performance computing architectures for graph-theoretic computations. We design optimized implementations of betweenness centrality and the SSCA#2 benchmark for two hardware multithreaded systems: a Cray XMT system with the Threadstorm processor, and a single-socket Sun multicore server with the UltraSPARC T2 processor. For a small-world network of 134 million vertices and 1.073 billion edges, the 16-processor XMT system and the 8-core Sun Fire T5120 server achieve TEPS scores (an algorithmic performance count for the SSCA#2 benchmark) of 160 million and 90 million respectively, which corresponds to more than a 2X performance improvement over the previous parallel implementations. To better characterize the performance of these multithreaded systems, we correlate the SSCA#2 performance results with data from the memory-intensive STREAM and RandomAccess benchmarks. Finally, we demonstrate the applicability of our implementation to analyze massive real-world datasets by computing approximate betweenness centrality for a large-scale IMDb movie-actor network.

97 MATHEMATICS AND COMPUTING↗

A Faster Parallel Algorithm and Efficient Multithreaded Implementations for Evaluating Betweenness Centrality on Massive Datasets

We present a new lock-free parallel algorithm for computing betweenness centrality of massive small-world networks. With minor changes to the data structures, our algorithm also achieves better spatial cache locality compared to previous approaches. Betweenness centrality is a key algorithm kernel in the HPCS SSCA#2 Graph Analysis benchmark, which has been extensively used to evaluate the performance of emerging high-performance computing architectures for graph-theoretic computations. We design optimized implementations of betweenness centrality and the SSCA#2 benchmark for two hardware multithreaded systems: a Cray XMT system with the ThreadStorm processor, and a single-socket Sun multicore server with the UltraSparc T2 processor. For a small-world network of 134 million vertices and 1.073 billion edges, the 16-processor XMT system and the 8-core Sun Fire T5120 server achieve TEPS scores (an algorithmic performance count for the SSCA#2 benchmark) of 160 million and 90 million respectively, which corresponds to more than a 2X performance improvement over the previous parallel implementations. To better characterize the performance of these multithreaded systems, we correlate the SSCA#2 performance results with data from the memory-intensive STREAM and RandomAccess benchmarks. Finally, we demonstrate the applicability of our implementation to analyze massive real-world datasets by computing approximate betweenness centrality for a large-scale IMDb movie-actor network.

architecture comparison↗

Exact two-point resistance, and the simple random walk on the complete graph minus N edges

An analytical approach is developed to obtain the exact expressions for the two-point resistance and the total effective resistance of the complete graph minus N edges of the opposite vertices. These expressions are written in terms of certain numbers that we introduce, which we call the Bejaia and the Pisa numbers; these numbers are the natural generalizations of the bisected Fibonacci and Lucas numbers. The correspondence between random walks and the resistor networks is then used to obtain the exact expressions for the first passage and mean first passage times on this graph. - Highlights: Black-Right-Pointing-Pointer We obtain exact formulas for the two-point resistance of the complete graph minus N edges. Black-Right-Pointing-Pointer We obtain also the total effective resistance of this graph. Black-Right-Pointing-Pointer We modified Schwatt's formula on trigonometrical power sum to suit our computations. Black-Right-Pointing-Pointer We introduced the generalized bisected Fibonacci and Lucas numbers: the Bejaia and the Pisa numbers. Black-Right-Pointing-Pointer The first passage and mean first passage times of the random walks have exact expressions.

97 MATHEMATICS AND COMPUTING↗

Excited-State Dynamics of a CsPbBr 3 Nanocrystal Terminated with Binary Ligands: Sparse Density of States with Giant Spin–Orbit Coupling Suppresses Carrier Cooling

Fully inorganic lead halide perovskite nanocrystals (NCs) are of interest for photovoltaic and light-emitting devices due to optoelectronic properties that can be tuned/optimized via halide composition, surface passivation, doping, and confinement. Compared to bulk materials, certain excited-state properties in NCs can be adjusted by electronic confinement effects such as suppressed hot carrier cooling and enhanced radiative recombination. In this paper, we use spinor Kohn–Sham orbitals (SKSOs) with spin–orbit coupling (SOC) interaction as a basis to compute excited-state dissipative dynamics simulations on a fully passivated CsPbBr 3 NC atomistic model. Redfield theory in the density matrix formalism is used to describe electron–phonon interactions which drive hot carrier cooling and nonradiative recombination ( k nonrad ). Radiative recombination ( k rad ) is calculated through oscillator strengths using SKSO basis. From k rad and k rad + k nonrad , we compute a theoretical photoluminescence quantum yield (PLQY) of 53%. Computed rates of hot carrier cooling ( k cooling ≈ 10 –1 1/ps) compare favorably with what has been reported in the literature. Interestingly, we observe that hot electron cooling slows down near the band edge, which we attribute to large SOC in the conduction band combined with strong confinement, which creates subgaps above the band edge. This slow carrier cooling could potentially impact hot carrier extraction before complete thermalization in photovoltaics (PVs). Implications of this work suggest that strong/intermediate confined APbX 3 NCs are better suited to applications in PVs due to slower carrier cooling near the conduction band edge, while intermediate/weak confined NCs are more appropriate for light-emitting applications, such as LEDs.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Vibrationally resolved NEXAFS at C and N K-edges of pyridine, 2-fluoropyridine and 2,6-difluoropyridine: A combined experimental and theoretical assessment

In the present work, the near edge X-ray absorption spectroscopy (NEXAFS) spectra at both C and N K-edges of pyridine, 2-fluoropyridine, and 2,6-difluoropyridine have been studied both experimentally and theoretically. From an electronic point of view, both transition potential density functional theory and time-dependent density functional theory approaches lead to reliable results provided that suitable basis sets and density functionals are employed. In this connection, the global hybrid B3LYP functional in conjunction with the EPR-III basis set appears particularly suitable after constant scaling of the band positions. For the N K-edge, vertical energies obtained at these levels and broadened by symmetric Gaussian distributions provide spectra in reasonable agreement with the experiment. Vibronic contributions further modulate the band-shapes leading to a better agreement with the experimental results, but are not strictly necessary for semi-quantitative investigations. On the other hand, vibronic contributions are responsible for strong intensity redistribution in the NEXAFS C K-edge spectra, and their inclusion is thus mandatory for a proper description of experiments. In this connection, the simple vertical gradient model is particularly appealing in view of its sufficient reliability and low computational cost. For more quantitative results, the more refined vertical Hessian approach can be employed, and its effectiveness has been improved thanks to a new least-squares fitting approach.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Increasing the applicability of density functional theory. V. X-ray absorption spectra with ionization potential corrected exchange and correlation potentials

Core excitation energies are computed with time-dependent density functional theory (TD-DFT) using the ionization energy corrected exchange and correlation potential QTP(0,0). QTP(0,0) provides C, N, and O K-edge spectra to about an electron volt. A mean absolute error (MAE) of 0.77 and a maximum error of 2.6 eV is observed for QTP(0,0) for many small molecules. TD-DFT based on QTP (0,0) is then used to describe the core-excitation spectra of the 22 amino acids. TD-DFT with conventional functionals greatly underestimates core excitation energies, largely due to the significant error in the Kohn-Sham occupied eigenvalues. To the contrary, the ionization energy corrected potential, QTP(0,0), provides excellent approximations (MAE of 0.53 eV) for core ionization energies as eigenvalues of the Kohn-Sham equations. As a consequence, core excitation energies are accurately described with QTP(0,0), as are the core ionization energies important in X-ray photoionization spectra or electron spectroscopy for chemical analysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Non-Abelian Topological Order in s-Wave Superfluids of Ultracold Fermionic Atoms

It is proposed that in s-wave superfluids of cold fermionic atoms with laser-field-generated effective spin-orbit interactions, a topological phase with gapless edge states and Majorana fermion quasiparticles obeying non-Abelian statistics is realized in the case with a large Zeeman magnetic field. Our scenario provides a promising approach to the realization of quantum computation based on the manipulation of non-Abelian anyons via an s-wave Feshbach resonance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multi-level Layout Optimization for Efficient Spatio-temporal Queries on ISABELA-compressed Data

The size and scope of cutting-edge scientific simulations are growing much faster than the I/O subsystems of their runtime environments, not only making I/O the primary bottleneck, but also consuming space that pushes the storage capacities of many computing facilities. These problems are exacerbated by the need to perform data-intensive analytics applications, such as querying the dataset by variable and spatio-temporal constraints, for what current database technologies commonly build query indices of size greater than that of the raw data. To help solve these problems, we present a parallel query-processing engine that can handle both range queries and queries with spatio-temporal constraints, on B-spline compressed data with user-controlled accuracy. Our method adapts to widening gaps between computation and I/O performance by querying on compressed metadata separated into bins by variable values, utilizing Hilbert space-filling curves to optimize for spatial constraints and aggregating data access to improve locality of per-bin stored data, reducing the false positive rate and latency bound I/O operations (such as seek) substantially. We show our method to be efficient with respect to storage, computation, and I/O compared to existing database technologies optimized for query processing on scientific data.

Computer Science↗

Spike-based graph centrality measures

We derive several spike-based routines that compute or establish bounds on radial centrality measures for undirected graphs and trees without the use of matrix multiplication. These spike-based centrality measures utilize a direct embedding of graph nodes and edges into neurons and synapses, can be implemented with static synapses or plastic synapses, and rely on minimal post-processing of spike rasters. This work contributes to the growing set of graphical applications for neuromorphic hardware.

Hamilton, Kathleen↗