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 289 records · Page 16

Solving independent set problems with photonic quantum circuits

An independent set (IS) is a set of vertices in a graph such that no edge connects any two vertices. In adiabatic quantum computation [E. Farhi, et al ., Science 292, 472–475 (2001); A. Das, B. K. Chakrabarti, Rev. Mod. Phys. 80, 1061–1081 (2008)], a given graph G ( V , E ) can be naturally mapped onto a many-body Hamiltonian H IS G ( V , E ) , with edges E being the two-body interactions between adjacent vertices V . Thus, solving the IS problem is equivalent to finding all the computational basis ground states of H IS G ( V , E ) . Very recently, non-Abelian adiabatic mixing (NAAM) has been proposed to address this task, exploiting an emergent non-Abelian gauge symmetry of H IS G ( V , E ) [B. Wu, H. Yu, F. Wilczek, Phys. Rev. A 101, 012318 (2020)]. Here, we solve a representative IS problem G ( 8 , 7 ) by simulating the NAAM digitally using a linear optical quantum network, consisting of three C-Phase gates, four deterministic two-qubit gate arrays (DGA), and ten single rotation gates. The maximum IS has been successfully identified with sufficient Trotterization steps and a carefully chosen evolution path. Remarkably, we find IS with a total probability of 0.875(16), among which the nontrivial ones have a considerable weight of about 31.4%. Our experiment demonstrates the potential advantage of NAAM for solving IS-equivalent problems.

Science & Technology - Other Topics↗

Fast-ion physics in SPARC

Potential loss of energetic ions including alphas and radio-frequency tail ions due to classical orbit effects and magnetohydrodynamic instabilities (MHD) are central physics issues in the design and experimental physics programme of the SPARC tokamak. The expected loss of fusion alpha power due to ripple-induced transport is computed for the SPARC tokamak design by the ASCOT and SPIRAL orbit-simulation codes, to assess the expected surface heating of plasma-facing components. We find good agreement between the ASCOT and SPIRAL simulation results not only in integrated quantities (fraction of alpha power loss) but also in the spatial, temporal and pitch-angle dependence of the losses. If the toroidal field (TF) coils are well-aligned, the SPARC edge ripple is small (0.15–0.30 %), the computed ripple-induced alpha power loss is small ( ~0.25% ) and the corresponding peak surface power density is acceptable ( 244 kW m -2 ). However, the ripple and ripple-induced losses increase strongly if the TF coils are assumed to suffer increasing magnitudes of misalignment. Surface heat loads may become problematic if the TF coil misalignment approaches the centimetre level. Ripple-induced losses of the energetic ion tail driven by ion cyclotron range of frequency (ICRF) heating are not expected to generate significant wall or limiter heating in the nominal SPARC plasma scenario. Because the expected classical fast-ion losses are small, SPARC will be able to observe and study fast-ion redistribution due to MHD including sawteeth and Alfvén eigenmodes (AEs). SPARC's parameter space for AE physics even at moderate Q is shown to reasonably overlap that of the demonstration power plant ARC (Sorbom et al., Fusion Engng Des., vol. 100, 2015, p. 378), and thus measurements of AE mode amplitude, spectrum and associated fast-ion transport in SPARC would provide relevant guidance about AE behaviour expected in ARC.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Structural and electronic changes in L⁢i 2 ⁢Ru⁢O 3 induced by lithium intercalation

Despite extensive research on oxide battery cathodes that transcend classical cationic redox activity, the detailed interplay between structural transformations and electronic redox processes remains insufficiently understood. We report a detailed study of the sequential structural and electronic changes in Li 2 RuO 3 upon lithium intercalation, characterized by powder x-ray and neutron diffraction alongside Ru and O K-edge x-ray absorption spectroscopy (XAS), and guided by operando synchrotron x-ray diffraction. During delithiation, Li 2 RuO 3 evolves from a well-defined monoclinic state to a complex trigonal phase via multiple intermediate structures, marked by significant changes in Ru-O bond distances that closely track the transition from a classical cationic redox to an unconventional process centered at oxygen states. Armed with high-quality atomic structural descriptions, computational models of the O K-edge XAS closely reproduce the experimentally observed spectral shifts. Lastly, we relate observations of electrochemical hysteresis with concurrent changes in the pathways of structural and electronic transitions. In conclusion, our results not only clarify the mechanisms underpinning voltage hysteresis in a model for lattice oxygen redox but also underscore the importance of structural fidelity in modeling redox behavior when this type of complex reactivity is present.

Li, Haifeng [Univ. of Illinois, Chicago, IL (Unite↗

Integer Sequences from Configurations in the Hausdorff Metric Geometry via Edge Covers of Bipartite Graphs

The Hausdorff metric provides a way to measure the distance between nonempty compact sets in $\mathbb{R}^N$, from which we can build a geometry of sets. This geometry is very different than the standard Euclidean geometry and provides many interesting results. In this paper we focus on line segments in this geometry, where pairs of disjoint sets $A$ and $B$ satisfying certain distance conditions have the property that there are exactly $m$ different sets on the line segment $\overline{AB}$ at every distance from $A$, where $m$ can assume many values different than one. We provide new families of sets that generate previously unrecorded integer sequences via these values of $m$ by connecting the values of $m$ to the number of edge coverings of a graph corresponding to the sets $A$ and $B$.

97 MATHEMATICS AND COMPUTING↗

Understanding the dynamic evolution of atomically dispersed Cu catalyst for CO 2 electrochemical conversion using integrated XANES analysis and mechanistic studies

Direct electrochemical conversion of CO 2 to ethanol (CH 3 CH 2 OH) offers a promising strategy to lower CO 2 emission while storing energy from renewable electricity. Our recent study reported a carbon-supported atomically dispersed Cu catalyst that achieved the highest reported selectivity for CH 3 CH 2 OH formation (91%) at a relatively low potential (-0.6 V), however, the active site structure that is responsible for such high activity and selectivity has yet to be understood. Here, in this paper, we demonstrate a computational investigation combining X-ray absorption near edge structure (XANES) simulations and a mechanistic study via density functional theory (DFT) to understand the catalyst structures of this Cu catalyst during electrocatalysis and the corresponding reaction mechanisms of the key products. An integrated computational and experimental XANES analysis depicted the dynamic evolution of the catalytic site during electrocatalysis. The as-prepared, atomically dispersed Cu catalyst aggregates and forms metallic clusters/nanoparticles under electrochemical condition, which then break down to smaller oxidized clusters after electrocatalysis. The formed Cu clusters/nanoparticles showed distinct catalytic activity and selectivity as a function of particle size based on the mechanistic investigation using DFT, which is consistent with experimental observations for catalyst samples with different Cu loadings. This comprehensive study which combines experimental and computational XANES investigation, mechanistic study via DFT calculations, and experimental performance of the catalysts, provides unprecedented dynamic and mechanistic insights into the supported atomically dispersed metal catalysts for CO 2 reduction. Such strategy and details gained can further guide discovery of novel catalyst materials for CO 2 electrochemical reduction.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Elucidating the Discharge Behavior of Aqueous Zinc Sulfur Batteries in the Presence of Molybdenum(IV) Chalcogenide Catalyst: The Criticality of Interfacial Electrochemistry

The aqueous zinc-sulfur battery holds promise for significant capacity and energy density with low cost and safe operation based on environmentally benign materials. However, it suffers from the sluggish kinetics of the conversion reaction. Here, we highlight the efficacy of molybdenum(IV) sulfide (MoS 2 ) to reduce the overpotential of S-ZnS conversion in aqueous electrolytes and study the discharge products formed at the solid-solid and solid-liquid interfaces using experimental and theoretical approaches. Specifically, the MoS 2 -catalyzed electrochemical conversion reaction is characterized via ex situ X-ray diffraction (XRD), transmission electron microscopy (TEM) with energy dispersive spectroscopy (EDS), Raman spectroscopy, synchrotron-based Mo K-edge X-ray absorption spectroscopy (XAS), and in situ synchrotron-based X-ray computed tomography (XCT). Additionally, operando synchrotron-based S K-edge XAS and X-ray fluorescence (XRF) maps are collected to determine the spatial evolution of sulfur-based species at the electrode-electrolyte interface. Further, coupling the operando S K-edge XAS data with the simulated spectra and fitting the data suggested a possible ZnS 2 intermediate phase.

25 ENERGY STORAGE↗

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

PANDORA: A Parallel Dendrogram Construction Algorithm for Single Linkage Clustering on GPU

This paper introduces Pandora, a parallel algorithm for computing dendrograms, the hierarchical cluster trees for single linkage clustering (SLC). Current parallel approaches construct dendrograms by partitioning a minimum spanning tree and removing edges. However, they struggle with skewed, hard-to-parallelize real-world dendrograms. Consequently, computing dendrograms is the sequential bottleneck in HDBSCAN*[21], a popular SLC variant. Pandora uses recursive tree contraction to address this limitation. Pandora contracts nodes to construct progressively smaller trees. It computes the smallest contracted dendrogram and expands it by inserting contracted edges. This recursive strategy is highly parallel, skew-independent, work-optimal, and well-suited for GPUs and multicores. We develop a performance portable implementation of Pandora in Kokkos[31] and evaluate its performance on multicore CPUs and multi-vendor GPUs (e.g., Nvidia, AMD) for dendrogram construction in HDBSCAN*. Multithreaded Pandora is 2.2x faster than the current best-multithreaded implementation. Our GPU version achieves 6-20x speedup on AMD GPUs and 10-37x on NVIDIA GPUs over multithreaded Pandora. Pandora removes HDBSCAN*’s sequential bottleneck, greatly boosting efficiency, particularly with GPUs.

Sao, Piyush↗

Distributed, Intelligent Edge-Sensing for a Smarter Grid

The electric grid is undergoing major transformations and developments resulting in unprecedented levels of volatility, uncertainty, and stress on grid infrastructure. Smart sensors and methods aiding in advanced visibility and situational awareness are key for tackling these issues. In this work, a decentralized architecture is proposed, where sensing, local computation and control capability are embedded in the edge devices, communicating with a set of trusted 'data mules' in a 'delay-tolerant' manner, while functioning autonomously. This system has been designed and implemented as an overall platform – called Global Asset Monitoring, Management and Analytics (GAMMA) Platform intended to provide the backbone for a global array of sensors and actuators. Further, as a building block for advanced current sensing solutions, a smart, low-cost ‘clip-on’ current sensor based on PCB-embedded Rogowski coil has been developed. The sensor hosts a novel signal conditioning stage allowing an 'auto-tuning' feature, resulting in a universal current sensor design for measuring a wide range of currents, including faults for smart grid applications. Finally, the research proposes a method to instrument and monitor key parameters for the most common electric utility asset – the pole-top distribution transformer. The work done in this research enables scalable, edge-intelligent sensing solutions for monitoring grid infrastructure, allowing utility operators to gain advanced visibility in an economical way.

Kulkarni, Shreyas Bhalchandra↗

Efficient, Predictive Tomography of Multi-Qubit Quantum Processors

After decades of R&D, quantum computers comprising more than 2 qubits are appearing. If this progress is to continue, the research community requires a capability for precise characterization (“tomography”) of these enlarged devices, which will enable benchmarking, improvement, and finally certification as mission-ready. As world leaders in characterization -- our gate set tomography (GST) method is the current state of the art – the project team is keenly aware that every existing protocol is either (1) catastrophically inefficient for more than 2 qubits, or (2) not rich enough to predict device behavior. GST scales poorly, while the popular randomized benchmarking technique only measures a single aggregated error probability. This project explored a new insight: that the combinatorial explosion plaguing standard GST could be avoided by using an ansatz of few-qubit interactions to build a complete, efficient model for multi-qubit errors. We developed this approach, prototyped it, and tested it on a cutting-edge quantum processor developed by Rigetti Quantum Computing (RQC), a US-based startup. We implemented our new models within Sandia’s PyGSTi open-source code, and tested them experimentally on the RQC device by probing crosstalk. We found two major results: first, our schema worked and is viable for further development; second, while the Rigetti device is indeed a “real” 8-qubit quantum processor, its behavior fluctuated significantly over time while we were experimenting with it and this drift made it difficult to fit our models of crosstalk to the data.

97 MATHEMATICS AND COMPUTING↗

Globus service enhancements for exascale applications and facilities

Many extreme-scale applications require the movement of large quantities of data to, from, and among leadership computing facilities, as well as other scientific facilities and the home institutions of facility users. These applications, particularly when leadership computing facilities are involved, can touch upon edge cases (e.g., terabyte files) that had not been a focus of previous Globus optimization work, which had emphasized rather the movement of many smaller (megabyte to gigabyte) files. We report here on how automated client-driven chunking can be used to accelerate both the movement of large files and the integrity checking operations that have proven to be essential for large data transfers. In conclusion, we present detailed performance studies that provide insights into the benefits of these modifications in a range of file transfer scenarios.

97 MATHEMATICS AND COMPUTING↗

HDBind: encoding of molecular structure with hyperdimensional binary representations

Traditional methods for identifying “hit” molecules from a large collection of potential drug-like candidates rely on biophysical theory to compute approximations to the Gibbs free energy of the binding interaction between the drug and its protein target. These approaches have a significant limitation in that they require exceptional computing capabilities for even relatively small collections of molecules. Increasingly large and complex state-of-the-art deep learning approaches have gained popularity with the promise to improve the productivity of drug design, notorious for its numerous failures. However, as deep learning models increase in their size and complexity, their acceleration at the hardware level becomes more challenging. Hyperdimensional Computing (HDC) has recently gained attention in the computer hardware community due to its algorithmic simplicity relative to deep learning approaches. The HDC learning paradigm, which represents data with high-dimension binary vectors, allows the use of low-precision binary vector arithmetic to create models of the data that can be learned without the need for the gradient-based optimization required in many conventional machine learning and deep learning methods. This algorithmic simplicity allows for acceleration in hardware that has been previously demonstrated in a range of application areas (computer vision, bioinformatics, mass spectrometery, remote sensing, edge devices, etc.). To the best of our knowledge, our work is the first to consider HDC for the task of fast and efficient screening of modern drug-like compound libraries. We also propose the first HDC graph-based encoding methods for molecular data, demonstrating consistent and substantial improvement over previous work. We compare our approaches to alternative approaches on the well-studied MoleculeNet dataset and the recently proposed LIT-PCBA dataset derived from high quality PubChem assays. We demonstrate our methods on multiple target hardware platforms, including Graphics Processing Units (GPUs) and Field Programmable Gate Arrays (FPGAs), showing at least an order of magnitude improvement in energy efficiency versus even our smallest neural network baseline model with a single hidden layer. Our work thus motivates further investigation into molecular representation learning to develop ultra-efficient pre-screening tools. We make our code publicly available at https://github.com/LLNL/hdbind.

59 BASIC BIOLOGICAL SCIENCES↗

Climatic clustering and longitudinal analysis with impacts on food, bioenergy, and pandemics

Predicted growth in world population will put unparalleled stress on the need for sustainable energy and global food production, as well as increase the likelihood of future pandemics. In this work, we identify high-resolution environmental zones in the context of a changing climate and predict longitudinal processes relevant to these challenges. We do this using exhaustive vector comparison methods that measure the climatic similarity between all locations on earth at high geospatial resolution relative to global-scale analyses. The results are captured as networks, in which edges between geolocations are defined if their historical climate similarities exceed a threshold. We apply Markov clustering and our novel Correlation of Correlations method to the resulting climatic networks, which provides unprecedented agglomerative and longitudinal views of climatic relationships across the globe. The methods performed here resulted in the fastest (9.37x10 18 operations/sec) and one of the largest (168.7x10 21 operations) scientific computations ever performed, with more than 100 quadrillion edges considered for a single climatic network. Our climatic analysis reveals areas of the world experiencing rapid environmental changes, which can have important implications for global carbon fluxes and zoonotic spillover events. Correlation and network analyses of this kind are widely applicable across computational and predictive biology domains, including systems biology, ecology, carbon cycles, biogeochemistry, and zoonosis research.

59 BASIC BIOLOGICAL SCIENCES↗

Interactive Quantum Chemistry Enabled by Machine Learning, Graphical Processing Units, and Cloud Computing

Modern quantum chemistry algorithms are increasingly able to accurately predict molecular properties that are useful for chemists in research and education. Despite this progress, performing such calculations is currently unattainable to the wider chemistry community, as they often require domain expertise, computer programming skills, and powerful computer hardware. In this review, we outline methods to eliminate these barriers using cutting-edge technologies. We discuss the ingredients needed to create accessible platforms that can compute quantum chemistry properties in real time, including graphical processing units–accelerated quantum chemistry in the cloud, artificial intelligence–driven natural molecule input methods, and extended reality visualization. We end by highlighting a series of exciting applications that assemble these components to create uniquely interactive platforms for computing and visualizing spectra, 3D structures, molecular orbitals, and many other chemical properties.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Liquid lithium divertor analysis using coupled plasma material interaction model

A liquid lithium divertor can improve performance of future fusion devices by creating efficient power exhaust and improving the energy confinement via pumping of the hydrogen isotopes. In addition, significantly higher heat fluxes can be handled if controlled vapor shielding is used to redistribute the divertor heat flux over a wider area. Design and optimization of such a system calls for an analysis model which includes a strong two-way coupling between the plasma and divertor material. The incoming plasma heat and particle flux will affect the divertor surface temperature, which is a defining factor of the lithium evaporative and sputtered flux going into the plasma. Results of the coupled model based on the plasma edge code SOLPS-ITER and the computational fluid dynamics (CFD) code ANSYS-CFX will be presented for different configurations. An analytical slab flow model is used as a heat transfer boundary condition for SOLPS, defining particle flux from the wall via calculation of the surface temperature. At the final step, results of the SOLPS analysis are verified using a 3D CFD magnetohydrodynamics (MHD) analysis which uses heat and particle flux from SOLPS as a boundary condition. In addition to plasma heat flux, both analytical and CFD temperature models include several plasma material interaction effects, such as lithium evaporation, condensation and sputtering based on deuterium target flux. New adatom sputtering model based on the available experimental data is presented. Analytical model is expanded to include free surface axisymmetric configurations. Results of parametric studies of the divertor configurations with different lithium inlet temperature and velocity will be presented leading to the optimal design resulting in the lowest possible lithium contamination in the core.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

The Heterogeneous Integration of Electronic Components

Heterogeneous integration (HI) of electronics components is broadly recognized as a powerful and crucial enabler for the continued growth of computing and communication. From 2010 onwards, the value of HI is increasingly visible in the advanced packaging used in artificial intelligence, high-performance computing, smartphones and communications product implementations. In this Perspective, we argue that HI is crucial to semiconductors and more broadly to the continued evolution of computing and communications. We use leading-edge advanced packaging examples to represent the value, advancements and opportunities for HI. To succeed, it is critical to develop comprehensive HI roadmaps that inform collaborations across the design, manufacturing and reliability spectrum between systems architects, packaging and semiconductor technologists to common goals. Although this article does not provide a full roadmap, we instead detail additional parameters for artificial intelligence, smartphone and other cellular communication devices, and their constituent building blocks including interconnects, power electronics, photonics, thermal management, reliability, modelling and co-design, to foster greater collaboration opportunities among academia, research laboratories and industry.

42 ENGINEERING↗

Cyclically symmetric radially self-similar phononic pseudocrystal isolator for broadband, ultrasonic vibration bandstop filtering

A 2D phononic pseudocrystal isolator exhibiting cyclic symmetry and radial self-similarity is measured and demonstrated to block a wide range of ultrasonic vibration. Measurements of longitudinal and shear wave blocking effects are made and compared with computational results. The use of the bandgap edge ratio is recommended for quantifying suppression in very-wide-bandgap materials. In conclusion, the upper-to-lower suppression edge frequency ratios of 3–4 are remarkably large for shear waves and even larger for longitudinal waves upper-to-lower suppression ratio (13 at 5 dB), such that 92.5% of frequencies in that range experience ≥ 5 dB of suppression.

Acoustic metamaterial↗