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 523 records · Page 29
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

FAIR Ecosystems for Science at Scale

High Performance Computing (HPC) centers provide resources to users who require greater scale to “get science done”. They deploy infrastructure with singular hardware architectures, cutting-edge software environments, and stricter security measures as compared with users’ own resources. As a result, users often create and configure digital artifacts in ways that are specialized for the unique infrastructure at a given HPC center. Each user of that center will face similar challenges as they develop specialized solutions to take full advantages of the center’s resources, potentially resulting in significant duplication of effort. Much duplicated effort could be avoided, however, if users of these centers found it easier to discover others’ solutions and artifacts as well as share their own. The FAIR principles address this problem by presenting guidelines focused around metadata practices to be implemented by vaguely defined “communities”; in practice, these tend to gather by domain (e.g. bioinformatics, geosciences, agriculture). Domain-based communities can unfortunately end up functioning as silos that tend both to inhibit sharing of solutions and best practices as well as to encourage fragile and unsustainable improvised solutions in the absence of best-practice guidance. We propose that these communities pursuing “science at scale” be nurtured both individually and collectively by HPC centers so that users can take advantage of shared challenges across disciplines and potentially across HPC centers. We describe an architecture based on the EOSC-Life FAIR Workflows Collaboratory, specialized for use with and inside HPC centers such as the Oak Ridge Leadership Computing Facility (OLCF), and we speculate on user incentives to encourage adoption. We note that a focus on FAIR workflow components rather than FAIR workflows is more likely to benefit the users of HPC centers.

Wilkinson, Sean [ORNL] (ORCID:0000000214437479)↗
DOE OSTI2022

Aerodynamic Analysis of Wind Loading on Parabolic Trough Collectors Using High-Fidelity CFD Modeling

Wind loading on parabolic solar collector support structures is the key driver for material costs. As identified by NREL's CSP Best Practices project [1], ability to predict wind-loading in deep-arrays and the impact of edge effects has potential to decrease levelized cost of electricity (LCoE) by 15%. In this study, we present a high-fidelity computational model that can model the flow around deep arrays of parabolic troughs under varying turbulent inflow conditions. Ability to accurately reproduce atmospheric boundary layer (ABL) profiles is first demonstrated through Large Eddy Simulation (LES) simulations and compared against wind tunnel measurements. Thereafter, unsteady turbulent flow past single row and six row configurations is computed using hybrid RANS/LES simulations. Investigations of wind loading, through parametric tilt angle variations of single row and on waked collectors in six-row configuration, are used to highlight design considerations for parabolic troughs only possible through high-fidelity unsteady calculations.

aerodynamics↗
DOE OSTI2021

Cell-Edge Detection via Selective Cooperation and Generalized Canonical Correlation

Improving the uplink quality of service for users located around the boundaries between cells is a key challenge in cellular systems. Existing approaches relying on power control throttle the rates of cell-center users, while multi-user detection requires accurate channel estimates for the cell-edge users, which is another challenge due to their low received signal-to-noise ratio (SNR). Utilizing the fact that cell-edge user signals are weak but common (received at roughly equal power) at different base stations (BSs), this paper establishes a connection between cell-edge user detection and generalized canonical correlation analysis (GCCA). It puts forth a GCCA-based method that leverages selective BS cooperation to recover the cell-edge user signal subspace even at low SNR. The cell-edge user signals can then be extracted from the resulting mixture via algebraic signal processing techniques. The paper includes theoretical analysis showing why GCCA recovers the correct subspace containing the cell-edge user signals under mild conditions. The proposed method can also identify the number of cell-edge users in the system, i.e., the common subspace dimension. Simulations reveal significant performance improvement relative to various multiuser detection techniques. Cell-edge detection performance is further studied as a function of how many / which BSs are selected, and it is shown that using the closest three BS is always the best choice.

base station cooperation↗
DOE OSTI2021

Spectral Threshold for Extremal Cyclic Edge-Connectivity

In this report, the cyclic edge-connectivity of a graph G is the least k such that there exists a set of k edges whose removal disconnects G into components where every component contains a cycle. We show that for graphs of minimum degree at least 3 and girth g at least 4, the cyclic edge-connectivity is bounded above by (Δ-2)g where Δ is the maximum degree. We then prove that if the second eigenvalue of the adjacency matrix of a d-regular graph of girth g ≥ 4 is sufficiently small, then the cyclic edge-connectivity is (d-2)g, providing a spectral condition for when this upper bound on cyclic edge-connectivity is tight.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Solving the Grad–Shafranov equation using spectral elements for tokamak equilibrium with toroidal rotation

The Grad–Shafranov equation is solved using spectral elements for tokamak equilibrium with toroidal rotation. The Grad–Shafranov solver builds upon and extends the NIMEQ code (Howell and Sovinec, 2014) previously developed for static tokamak equilibria. Both geometric and algebraic convergence are achieved as the polynomial degree of the spectral-element basis increases. A new analytical solution to the Grad–Shafranov equation is obtained for Solov’ev equilibrium in presence of rigid toroidal rotation, in addition to a previously obtained analytical solution for a different set of equilibrium and rotation profiles. The numerical solutions from the extended NIMEQ are benchmarked with the analytical solutions, with good agreements. Besides, the extended NIMEQ code is benchmarked with the FLOW code (Guazzotto et al., 2004). The modification of pressure profile induced by toroidal flow is investigated. The relative change of pressure profile is found significant around the edge.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

DyG-DPCD: A Distributed Parallel Community Detection Algorithm for Large-Scale Dynamic Graphs

Dynamic (Temporal) graphs capture the valuable evolution of real-world systems, from the continuously evolving patterns of social interactions and genetic pathways to the dynamic fluctuations of economic forces. Detecting communities for such evolving networks poses unique challenges. Detecting and analyzing the evolution of communities within dynamic graphs unlocks valuable insights into the underlying structural and temporal patterns of real-world systems. However, the sheer volume of modern graph data and the inherent complexity of the temporal dimension pose significant challenges to scalable community detection algorithms. Addressing this gap, our work explores the limited landscape of scalable distributed-memory parallel methods specifically designed for dynamic network community detection. We propose a novel parallel algorithm, DyG-DPCD (Dynamic Graph Distributed Parallel Community Detection), to detect communities in dynamic networks using the Message Passing Interface (MPI) framework. We present a vertex-centric approach, allowing us to detect communities through local optimization. Furthermore, we enhance our baseline algorithm by incorporating three heuristics, which improve the algorithm’s performance significantly while maintaining the quality of the solutions. We demonstrate the efficiency of our algorithm by experimenting on several real-world large-scale networks with hundreds of millions of edges spanning diverse domains. Notably, DyG-DPCD achieves speedups between 25× and 30× for large networks that we experimented on using NERSC compute nodes. In conclusion, our algorithm outperforms the STINGER parallel re-agglomeration algorithm by 30×.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Recent Advances in X-ray Absorption Near Edge Structure (XANES) Simulation for Catalysis: Theories and Applications

X-ray absorption spectroscopy (XAS) is a powerful spectroscopic technique for characterizing catalytic active sites. In particular, X-ray Absorption Near Edge Structure (XANES) provides insights into the oxidation state and local coordination environment of the absorbing atom, shedding light on the catalytic structure. Computational XANES simulations provide one-on-one correspondence between the molecular structure and their corresponding spectra, making them an effective approach for interpreting experimental XANES features. This work outlines various theories used to simulate XANES spectra and highlights recent advancements in computational XANES applications for homogeneous, heterogeneous, and single-atom catalysts focusing on identifying the active site structures, the site heterogeneity, and the dynamic evolution of catalysts.

Xu, Jiayi↗
DOE OSTI2023

Designing transparent conductors using forbidden optical transitions

Many semiconductors present weak or forbidden transitions at their fundamental band gaps, inducing a widened region of transparency. This occurs in high-performing n-type transparent conductors (TCs) such as Sn-doped In 2 O 3 (ITO); however, thus far, the presence of forbidden transitions has been neglected in the search for new p-type TCs. To address this, we first compute high-throughput absorption spectra across ~18, 000 semiconductors, showing that over half exhibit forbidden or weak optical transitions at their band edges. Next, we demonstrate that compounds with highly localized band-edge states are more likely to present forbidden transitions. Lastly, we search this set for p-type and n-type TCs with forbidden transitions and, by performing defect calculations, propose unexplored TC candidates such as ambipolar BeSiP 2 , p-type wurtzite BAs, and n-type Ba 2 InGaO 5 , among others. In conclusion, we share our dataset and recommend that future screenings for optical properties consider the impact of forbidden transitions.

36 MATERIALS SCIENCE↗
DOE OSTI2024

De novo design of proteins housing excitonically coupled chlorophyll special pairs

Natural photosystems couple light harvesting to charge separation using a ‘special pair’ of chlorophyll molecules that accepts excitation energy from the antenna and initiates an electron-transfer cascade. To investigate the photophysics of special pairs independently of the complexities of native photosynthetic proteins, and as a first step toward creating synthetic photosystems for new energy conversion technologies, we designed C 2 -symmetric proteins that hold two chlorophyll molecules in closely juxtaposed arrangements. X-ray crystallography confirmed that one designed protein binds two chlorophylls in the same orientation as native special pairs, whereas a second designed protein positions them in a previously unseen geometry. Spectroscopy revealed that the chlorophylls are excitonically coupled, and fluorescence lifetime imaging demonstrated energy transfer. The cryo-electron microscopy structure of a designed 24-chlorophyll octahedral nanocage with a special pair on each edge closely matched the design model. The results suggest that the de novo design of artificial photosynthetic systems is within reach of current computational methods.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

Operando structural and chemical evolutions of TiS 2 in Na-ion batteries

Titanium disulfide (TiS 2 ) with high electric conductivity, fast rate capability, and good cycling performance is a promising candidate for electrode material in sodium (Na)-ion batteries. Despite the well-studied electrochemical behaviors of TiS 2 in Li-ion batteries, the detailed reaction mechanism of TiS 2 in Na-ion batteries is not yet fully understood due to a more complex multi-phase conversion process. In this work, reactions of TiS 2 in Na-ion batteries are investigated via a multi-modal synchrotron approach: operando X-ray Absorption Spectroscopy (XAS) – including X-ray Absorption Near-Edge Structure (XANES) and Extended X-ray Absorption Fine Structure (EXAFS) – and ex situ X-ray Powder Diffraction (XPD), coupled with computational modeling. Operando XANES spectra indicate that the redox reactions occur in both Ti and S during the electrochemically driven phase transformation. Multivariate Curve Resolution-Alternating Least Squares (MCR-ALS) analysis of XAS suggests that different numbers of components are involved in the lithiation and sodiation of TiS 2 , with the sodiation including at least one intermediate phase in addition to the starting material and the final sodiation product. Ex situ XPD and Rietveld refinement further determined and quantified the unknown phases, showing that three phases, TiS 2 , Na 0.55 TiS 2 , and NaTiS 2 , participate in the sodiation of TiS 2 . Operando EXAFS results show the changes in the Ti–Ti coordination number and interatomic distance. This explains the coulombic efficiency decay due to the incomplete recovery of the coordination number of Ti after cycling. Overall, this work reveals the reaction mechanism occurring in Na–TiS 2 batteries with a greater quantitative understanding of the structural evolution. By combining the multi-modal synchrotron approach and computational work, this study provides a framework for studying a broader range of electrochemically driven phase-transformation systems towards advanced energy storage and conversion applications.

25 ENERGY STORAGE↗
DOE OSTI2025

End-to-end deep learning pipeline for real-time Bragg peak segmentation: from training to large-scale deployment

X-ray crystallography reconstruction, which transforms discrete X-ray diffraction patterns into three-dimensional molecular structures, relies critically on accurate Bragg peak finding for structure determination. As X-ray free electron laser (XFEL) facilities advance toward MHz data rates (1 million images per second), traditional peak finding algorithms that require manual parameter tuning or exhaustive grid searches across multiple experiments become increasingly impractical. While deep learning approaches offer promising solutions, their deployment in high-throughput environments presents significant challenges in automated dataset labeling, model scalability, edge deployment efficiency, and distributed inference capabilities. We present an end-to-end deep learning pipeline with three key components: (1) a data engine that combines traditional algorithms with our peak matching algorithm to generate high-quality training data at scale, (2) a modular architecture that scales from a few million to hundreds of million parameters, enabling us to train large expert-level models offline while deploying smaller, distilled models at the edge, and (3) a decoupled producer-consumer architecture that separates specialized data source layer from model inference, enabling flexible deployment across diverse computing environments. Using this integrated approach, our pipeline achieves accuracy comparable to traditional methods tuned by human experts while eliminating the need for experiment-specific parameter tuning. Although current throughput requires optimization for MHz facilities, our system's scalable architecture and demonstrated model compression capabilities provide a foundation for future high-throughput XFEL deployments.

Wang, Cong↗
DOE OSTI2024

Ergodicity, lack thereof, and the performance of reservoir computing with memristive networks

Abstract Networks composed of nanoscale memristive components, such as nanowire and nanoparticle networks, have recently received considerable attention because of their potential use as neuromorphic devices. In this study, we explore ergodicity in memristive networks, showing that the performance on machine leaning tasks improves when these networks are tuned to operate at the edge between two global stability points. We find this lack of ergodicity is associated with the emergence of memory in the system. We measure the level of ergodicity using the Thirumalai-Mountain metric, and we show that in the absence of ergodicity, two different memristive network systems show improved performance when utilized as reservoir computers (RC). We highlight that it is also important to let the system synchronize to the input signal in order for the performance of the RC to exhibit improvements over the baseline.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Multinode Multi-GPU Two-Electron Integrals: Code Generation Using the Regent Language

The computation of two-electron repulsion integrals (ERIs) is often the most expensive step of integral-direct self-consistent field methods. Formally it scales as O(N 4 ), where N is the number of Gaussian basis functions used to represent the molecular wave function. In practice, this scaling can be reduced to O(N 2 ) or less by neglecting small integrals with screening methods. The contributions of the ERIs to the Fock matrix are of Coulomb (J) and exchange (K) type and require separate algorithms to compute matrix elements efficiently. We previously implemented highly efficient GPU-accelerated J-matrix and K-matrix algorithms in the electronic structure code TeraChem. Although these implementations supported the use of multiple GPUs on a node, they did not support the use of multiple nodes. This presents a key bottleneck to cutting-edge ab initio simulations of large systems, e.g., excited state dynamics of photoactive proteins. We present our implementation of multinode multi-GPU J- and K-matrix algorithms in TeraChem using the Regent programming language. Regent directly supports distributed computation in a task-based model and can generate code for a variety of architectures, including NVIDIA GPUs. We demonstrate multinode scaling up to 45 GPUs (3 nodes) and benchmark against hand-coded TeraChem integral code. Finally, we also outline our metaprogrammed Regent implementation, which enables flexible code generation for integrals of different angular momenta.

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

Enhancing the accuracy of XPS calculations: Exploring hybrid basis set schemes for CVS-EOMIP-CCSD calculations

Reliable computational methodologies and basis sets for modeling x-ray spectra are essential for extracting and interpreting electronic and structural information from experimental x-ray spectra. In particular, the trade-off between numerical accuracy and computational cost due to the size of the basis set is a major challenge, since molecular orbitals undergo extreme relaxation in the core-hole state. To gain clarity on the changes in electronic structure induced by the formation of a core-hole, the use of sufficiently flexible basis for expanding the orbitals, particularly for the core region, has been shown to be essential. This work focuses on the refinement of core-hole ionized state calculations using the equation-of-motion coupled cluster family of methods through an extensive analysis on the effectiveness of “hybrid” and mixed basis sets. In this investigation, we utilize the CVS-EOMIP-CCSD method in combination and construct hybrid basis sets piecewise from readily available Dunning’s correlation consistent basis sets in order to calculate x-ray ionization energies (IEs) for a set of small gas phase molecules. Our results provide insights into the impact of basis sets on the CVS-EOMIP-CCSD calculations of K-edge IEs of first-row p-block elements. Furthermore, these insights enable us to understand more about the basis set dependence of the core IEs computed and allow us to establish a protocol for deriving reliable and cost-effective theoretical estimates for computing IEs of small molecules containing such elements.

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

Fuzzy cyber detection pattern matching

Mechanisms for identifying a pattern of computing resource activity of interest, in activity data characterizing activities of computer system elements, are provided. A temporal graph of the activity data is generated and a filter is applied to the temporal graph to generate one or more first vector representations, each characterizing nodes and edges within a moving window defined by the filter. The filter is applied to a pattern graph representing a pattern of entities and events indicative of the pattern of interest, to generate a second vector representation. The second vector representation is compared to the one or more first vector representations to identify one or more nearby vectors, and one or more corresponding subgraph instances are output to an intelligence console computing system as inexact matches of the temporal graph.

Shu, Xiaokui↗
DOE OSTI2024

Ergodicity, lack thereof, and the performance of reservoir computing with memristive networks and nanowire

Networks composed of nanoscale memristive components, such as nanowire and nanoparticle networks, have recently received considerable attention because of their potential use as neuromorphic devices. In this study, we explore ergodicity in memristive networks, showing that the performance on machine leaning tasks improves when these networks are tuned to operate at the edge between two global stability points. We find this lack of ergodicity is associated with the emergence of memory in the system. We measure the level of ergodicity using the Thirumalai-Mountain metric, and we show that in the absence of ergodicity, two different memristive network systems show improved performance when utilized as reservoir computers (RC). We highlight that it is also important to let the system synchronize to the input signal in order for the performance of the RC to exhibit improvements over the baseline.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Classical eikonal from Magnus expansion

In a classical scattering problem, the classical eikonal is defined as the generator of the canonical transformation that maps in-states to out-states. It can be regarded as the classical limit of the log of the quantum S-matrix. In a classical analog of the Born approximation in quantum mechanics, the classical eikonal admits an expansion in oriented tree graphs, where oriented edges denote retarded/advanced worldline propagators. The Magnus expansion, which takes the log of a time-ordered exponential integral, offers an efficient method to compute the coefficients of the tree graphs to all orders. We exploit a Hopf algebra structure behind the Magnus expansion to develop a fast algorithm which can compute the tree coefficients up to the 12th order (over half a million trees) in less than an hour. In a relativistic setting, our methods can be applied to the post-Minkowskian (PM) expansion for gravitational binaries in the worldline formalism. We demonstrate the methods by computing the 3PM eikonal and find agreement with previous results based on amplitude methods. Importantly, the Magnus expansion yields a finite eikonal, while the naïve eikonal based on the time-symmetric propagator is infrared-divergent from 3PM on.

Black Holes↗