Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Embedded 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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Dimensionality reduction of the many-body problem using coupled-cluster subsystem flow equations: classical and quantum computing perspective

We discuss reduced-scaling strategies employing recently introduced sub-system embedding sub-algebras coupled-cluster formalism (SES-CC) to describe many-body systems. These strategies utilize properties of the SES-CC formulations where the equations describing certain classes of sub- systems can be integrated into a computational flows composed coupled eigenvalue problems of reduced dimensionality. Additionally, these flows can be defined at the level of the CC Ansatz defined by selected classes of cluster amplitudes, which define the wave function ”memory” of possible partitionings of the many-body system into constituent sub-systems. One of the possible ways of solving these coupled problems is through implementing procedures, where the information is passed between the sub-systems in a self-consistent manner. As a special case, we consider local flow formulations where the so-called local character of correlation effects can be closely related to properties of sub-system embedding sub-algebras employing localized molecular basis. We also generalize flow equations to the time domain and to downfolding methods utilizing double exponential unitary CC Ansatz (DUCC), where reduced dimensionality of constituent sub-problems offer a possibility of efficient utilization of limited quantum resources in modeling realistic systems.

Electron correlation, quantum chemistry, quantum c↗
DOE OSTI2025

Comparative Analysis of DNA LLM Classification Techniques Using Intra-Layer Feature Extraction with Autoencoder Stacks [Poster]

This project conducts a comparative analysis of DNA LLM classification techniques using Evo2, Grover, and UTRML, focusing on intra-layer feature extraction in Evo2. By extracting features from multiple layers of Evo2 and integrating them into an autoencoder stack with a binary classification head, we evaluate its effectiveness in classifying genomic sequences compared to smaller DNA language models. My findings demonstrate that Evo2 outperforms Grover and UTRML in classification accuracy on a dataset provided by department 08625, CAO2021, while UTRML offers competitive performance with lower computational costs. This study highlights the potential of advanced embedding techniques in enhancing genomic data analysis and informs future research in bioinformatics.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

An integrated numerical model for coupled poro-hydro-mechanics and fracture propagation using embedded meshes

Integrated models for fluid-driven fracture propagation and general multiphase flow in porous media are valuable to the study and engineering of several systems, including hydraulic fracturing, underground disposal of waste, and geohazard mitigation across such applications. This work extends the coupled model multiphase flow and poromechanical model of Ren et al. (2018) to admit fracture propagation (FP). The coupled XFEM-EDFM scheme utilizes a separate fracture mesh that is embedded on a static background mesh. The onset and dynamics of fracture propagation are governed by the equivalent stress intensity factor (SIF) criterion. A domain-integral method (J integral) is applied to compute this information. Additionally, an adaptive time-marching scheme is proposed to rapidly restrict and grow temporal resolution to match the underlying time-scales. The proposed model is verified with analytical solutions, and shows the capability to accurately and adaptively co-simulate fluid transport and deformation as well as the propagation of multiple fractures.

42 ENGINEERING↗
DOE OSTI2025

Fusion Model for Metagenomics

This work highlights the use of an embeddings approach that can encode multiple features and create efficient contextualization of profiled metagenomes derived from microbiome samples using computer vision models and image representations of the abundance profiles. The model's embeddings can be used to cluster existing samples based on multiple conditions and interpretations, and new embeddings can be quickly created for new samples and fitted to existing clusters to characterize them. This has practical applications for unknown, unlabeled microbiome samples. The model's embeddings can be used to cluster existing samples based on multiple conditions and interpretations, and new embeddings can be quickly created for new samples and fitted to existing clusters to characterize them. This has practical applications for unknown, unlabeled microbiome samples.

Valdes, CamiloA [Lawrence Livermore National Labor↗
DOE OSTI2020

Faster Johnson–Lindenstrauss transforms via Kronecker products

The Kronecker product is an important matrix operation with a wide range of applications in signal processing, graph theory, quantum computing and deep learning. In this work, we introduce a generalization of the fast Johnson–Lindenstrauss projection for embedding vectors with Kronecker product structure, the Kronecker fast Johnson–Lindenstrauss transform (KFJLT). The KFJLT reduces the embedding cost by an exponential factor of the standard fast Johnson–Lindenstrauss transform’s cost when applied to vectors with Kronecker structure, by avoiding explicitly forming the full Kronecker products. Here, we prove that this computational gain comes with only a small price in embedding power: consider a finite set of $p$ points in a tensor product of $d$ constituent Euclidean spaces $\bigotimes _{k=d}^{1}{\mathbb{R}}^{n_k}$, and let $N = \prod _{k=1}^{d}n_k$. With high probability, a random KFJLT matrix of dimension $m \times N$ embeds the set of points up to multiplicative distortion $(1\pm \varepsilon )$ provided $m \gtrsim \varepsilon ^{-2} \, \log ^{2d - 1} (p) \, \log N$. We conclude by describing a direct application of the KFJLT to the efficient solution of large-scale Kronecker-structured least squares problems for fitting the CP tensor decomposition.

Kronecker structure↗
DOE OSTI2020

Application of Quantum Computing to Biochemical Systems: A Look to the Future

Chemistry is considered as one of the more promising applications to science of near-term quantum computing. Recent work in transitioning classical algorithms to a quantum computer has led to great strides in improving quantum algorithms and illustrating their quantum advantage. Because of the limitations of near-term quantum computers, the most effective strategies split the work over classical and quantum computers. There is a proven set of methods in computational chemistry and materials physics that has used this same idea of splitting a complex physical system into parts that are treated at different levels of theory to obtain solutions for the complete physical system for which a brute force solution with a single method is not feasible. These methods are variously known as embedding, multi-scale, and fragment techniques and methods. We review these methods and then propose the embedding approach as a method for describing complex biochemical systems, with the parts not only treated with different levels of theory, but computed with hybrid classical and quantum algorithms. Such strategies are critical if one wants to expand the focus to biochemical molecules that contain active regions that cannot be properly explained with traditional algorithms on classical computers. While we do not solve this problem here, we provide an overview of where the field is going to enable such problems to be tackled in the future.

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

An introduction to neuromorphic computing and its potential impact for unattended ground sensors

Neuromorphic computers are hardware systems that mimic the brain’s computational process phenomenology. This is in contrast to neural network accelerators, such as the Google TPU or the Intel Neural Compute Stick, which seek to accelerate the fundamental computation and data flows of neural network models used in the field of machine learning. Neuromorphic computers emulate the integrate and fire neuron dynamics of the brain to achieve a spiking communication architecture for computation. While neural networks are brain-inspired, they drastically oversimplify the brain’s computation model. Neuromorphic architectures are closer to the true computation model of the brain (albeit, still simplified). Neuromorphic computing models herald a 1000x power improvement over conventional CPU architectures. Sandia National Labs is a major contributor to the research community on neuromorphic systems by performing design analysis, evaluation, and algorithm development for neuromorphic computers. Space-based remote sensing development has been a focused target of funding for exploratory research into neuromorphic systems for their potential advantage in that program area; SNL has led some of these efforts. Recently, neuromorphic application evaluation has reached the NA-22 program area. This same exploratory research and algorithm development should penetrate the unattended ground sensor space for SNL’s mission partners and program areas. Neuromorphic computing paradigms offer a distinct advantage for the SWaP-constrained embedded systems of our diverse sponsor-driven program areas.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

DriveSense: A Noise-Resilient Framework for Driving Mode Identification

Accurate drive mode classification is essential for enhancing the reliability and predictive maintenance of heavy-duty electric trucks. This study proposes a novel fuzzy logic-based framework, DriveSense, for real-time drive mode classification, addressing key challenges such as sensor noise, transitional behaviors, and computational efficiency. The proposed approach integrates a two-stage filtering pipeline, combining adaptive outlier removal and a dynamic Kalman filter to enhance data quality. A fuzzy inference system with smoothened trapezoidal membership functions is then applied to classify driving modes into standstill, constant speed, acceleration, and deceleration while mitigating the effects of noise and edge cases. Performance evaluation using real-world and simulated drive cycles demonstrates significant improvements in classification accuracy (up to 97.8%), F1-score (up to 0.97), and robustness against noise, while reducing false positives. Comparative analysis against baseline models, demonstrates DriveSense’s superior accuracy and generalizability across diverse driving patterns. The framework’s lightweight and interpretable fuzzy inference engine operates with low computational latency, ensuring compatibility with real-time embedded systems typical of heavy-duty electric trucks. Moreover, DriveSense models transitional behaviors through overlapping fuzzy sets and adaptive borderline classification logic, enabling smooth identification of subtle shifts such as rolling stops or gradual deceleration. These results highlight DriveSense’s potential to enhance predictive maintenance strategies, reduce downtime, and support scalable, fleet-wide diagnostics.

Kumar, Praveen [Oak Ridge National Laboratory (ORN↗
DOE OSTI2022

PeleLMeX [SWR-22-48]

PeleLMeX is a solver for high fidelity reactive flow simulations, namely direct numerical simulation (DNS) and large eddy simulation (LES). The solver combines a low Mach number approach, adaptive mesh refinement (AMR), embedded boundary (EB) geometry treatment and high performance computing (HPC) to provide a flexible tool to address research questions on platforms ranging from small workstations to the world's largest GPU-accelerated supercomputers. PeleLMeX has been used to study complex flame/turbulence interactions in RCCI engines and hydrogen combustion or the effect of sustainable aviation fuel on gas turbine combustion. PeleLMeX is part of the Pele combustion Suite (https://amrex-combustion.github.io/)

Day, Marcus↗
DOE OSTI2020

Advanced Methods for Immersed Domain Multi-physics Computations

This is the final report on the project, and describes the main accomplishments in the development of the Shifted Boundary Method (SBM), a new computational framework for embedded/immersed computational mechanics applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Physical Yukawa couplings in heterotic string compactifications

One of the challenges of heterotic compactification on a CalabiYau threefold is to determine the physical (27) 3 Yukawa couplings of the resulting four-dimensional $\mathcal{N}$ = 1 theory. In general, the calculation necessitates knowledge of the Ricci-flat metric. However, in the standard embedding, which references the tangent bundle, we can compute normalized Yukawa couplings from the Weil-Petersson metric on the moduli space of complex structure deformations of the Calabi-Yau manifold. In various examples (the Fermat quintic, the intersection of two cubics in $\mathbb{P}$ 5 , and the TianYau manifold), we calculate the normalized Yukawa couplings for (2,1)-forms using the Weil-Petersson metric obtained from the Kodaira-Spencer map. In cases where $h^{1,1}$ = 1 , this is compared to a complementary calculation based on performing period integrals. A third expression for the normalized Yukawa couplings is obtained from a machine learned approximate Ricci-flat metric making use of explicit harmonic representatives. Finally, the excellent agreement between the different approaches opens the door to precision string phenomenology.

Butbaia, Giorgi↗
DOE OSTI2022

Hierarchical Model-Free Transactional Control of Building Loads to Support Grid Services

A transition from generation on demand to consumption on demand is one of the solutions to overcome the many limitations associated with the higher penetration of renewable energy sources. Such a transition, however, requires a considerable amount of load flexibility in the demand side. Demand response (DR) programs can reveal and utilize this demand flexibility by enabling the participation of a large number of grid-interactive efficient buildings (GEB). Existing approaches on DR require significant modelling or training efforts, are computationally expensive, and do not guarantee the satisfaction of end users. To address the aforementioned limitations, this software code considers a scalable hierarchical model-free transactional control approach that incorporates elements of virtual battery, game theory, and model-free control (MFC) mechanisms. The developed approach separates the control mechanism into upper and lower levels. The MFC modulates the flexible GEB in the lower level with guaranteed thermal comfort of end users in response to the optimal pricing and power signals determined in the upper layer using a Stackelberg game integrated with aggregate virtual battery constraints. Additionally, the usage of MFC necessitates less burdensome computational and communication requirements, thus, it is easily deployable even on small, embedded devices. This software code enables the use of residential and small-size commercial buildings to offer a potentially substantial source of ancillary grid services that are currently underutilized. A hierarchical, model-free transactive building control provides a smooth interface between the grid service requests of utilities and the reliable control required by participating buildings. Model-free control, which supports distributed control architecture, will be a more scalable solution that can be deployed in neighborhood-size systems as well as individual buildings. The proposed approach contributes to the body of knowledge on two main aspects. First, it couples the MFC with the game-theoretic control and proposes a scalable model-free transactive control approach. MFC does not require any modeling effort or model training for the various building loads. This is very beneficial since deriving an accurate model for every single unit participating in DR programs and obtaining all the parameters about the units (e.g., thermal coefficients, standby losses) are infeasible. Also, MFC is computationally efficient, easily deployable even on small, embedded devices, and can be implemented in real time. Second, it integrates the concept of virtual battery into DR via the Stackelberg game. The concept of virtual battery enables efficient coordination and aggregation of a large number of flexible GEB with guaranteed thermal comfort of end users.

Olama, Mohammed [Oak Ridge National Lab. (ORNL), O↗
DOE OSTI2022

Design and Challenges of Edge Computing ASICs on Front-End Electronics

In situ or hardware-embedded data processing of raw signals, close to their source, in radiation detectors is expected to provide dramatic improvements in data quality and volumes. However, the implementation of artificial neural networks (ANNs) in the front-end electronics, and the design of custom integrated circuits (ASICs), comes with challenges. In addition, detectors have to operate with limited power budget and implement complex functionalities in a very dense space. They often are exposed to extreme conditions as they work in high-radiation environments and/or cryogenic temperatures. This paper presents examples of applications and design methodologies for in-situ ANNs, along with the challenges of retaining the fidelity of the trained networks. For illustration, we use the problem of estimating the energy deposited by the radiation from digitized waveforms. The proposed implementation starts with an ML algorithm trained in Qkeras and eventually leads to an equivalent ASIC implementation. The associated design challenges in realizing energy and area efficient implementations in CMOS processes are reviewed. Novel approaches that employ hybrid technologies (combination of CMOS with memristors), in-memory computing models, and bio-inspired spiking neural networks are also highlighted

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Impacts of Spatial Resolution in a High-Fidelity Capacity Expansion Model: An ERCOT Case Study

Capacity expansion models are important tools in examining the evolution of the electric power sector. Embedded in these tools are many modeling choices with consequential impacts on computational burden and associated analysis. In this study, we adjust the spatial resolution of the Regional Energy Deployment System (ReEDS) to understand the implications of higher-fidelity modeling on energy system projections and model solve times. The native ReEDS regions capture the contiguous United States in 134 balancing areas whereas the regions in the higher-resolution version are defined by over 3,000 U.S. counties. Using both resolutions, we conduct a case study of the Texas Interconnection (The Electric Reliability Council of Texas [ERCOT]) to explore differences in model projections and to inform appropriate applications of high spatial resolution in a large-scale, applied capacity expansion model.

county↗
DOE OSTI2024

Gradient Coding With Iterative Block Leverage Score Sampling

Gradient coding is a method for mitigating straggling servers in a centralized computing network that uses erasure-coding techniques to distributively carry out first-order optimization methods. Randomized numerical linear algebra uses randomization to develop improved algorithms for large-scale linear algebra computations. In this study, we propose a method for distributed optimization that combines gradient coding and randomized numerical linear algebra. The proposed method uses a randomized ℓ 2 -subspace embedding and a gradient coding technique to distribute blocks of data to the computational nodes of a centralized network, and at each iteration the central server only requires a small number of computations to obtain the steepest descent update. The novelty of our approach is that the data is replicated according to importance scores, called block leverage scores, in contrast to most gradient coding approaches that uniformly replicate the data blocks. Furthermore, we do not require a decoding step at each iteration, avoiding a bottleneck in previous gradient coding schemes. We show that our approach results in a valid ℓ 2 -subspace embedding, and that our resulting approximation converges to the optimal solution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

DFT-based QM/MM with Particle-Mesh Ewald for Direct, Long-Range Electrostatic Embedding

In this work, we present a DFT-based, QM/MM implementation with long-range electrostatic embedding achieved by direct real-space integration of the particle mesh Ewald (PME) computed electrostatic potential. The key transformation is the interpolation of the electrostatic potential from the PME grid to the DFT quadrature grid, from which integrals are easily evaluated utilizing standard DFT machinery. We provide benchmarks of the numerical accuracy with choice of grid size and real-space corrections, and demonstrate that good convergence is achieved while introducing nominal computational overhead. Furthermore, the approach requires only small modification to existing software packages, as is demonstrated with our implementation in the OpenMM and Psi 4 software. After presenting convergence benchmarks, we evaluate the importance of long-range electrostatic embedding in three solute/solvent systems modeled with QM/MM. Water and BMIM/BF 4 ionic liquid were considered as "simple" and "complex" solvents respectively, with water and p-phenylenediamine (PPD) solute molecules treated at QM level of theory. While electrostatic embedding with standard real-space truncation may introduce negligible error for simple systems such as water solute in water solvent, errors become more significant when QM/MM is applied to complex solvents such as ionic liquids. An extreme example is the electrostatic embedding energy for oxidized PPD in BMIM/BF 4 for which real-space truncation produces severe error even at 2-3 nm cutoff distances. This latter example illustrates that utilization of QM/MM to compute redox potentials within concentrated electrolytes/ionic media requires carefully chosen long-range electrostatic embedding algorithms, with our presented algorithm providing a general and robust approach.

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

Non-local corrections to the typical medium theory of Anderson localization

We use the recently developed finite cluster typical medium approach to study the Anderson localization transition in three dimensions. Applying our method to the box and binary alloy disorder distributions, we find a fast convergence with the cluster size. We demonstrate the importance of the typical medium environment and the non-local spatial correlations for the proper characterization of the localization transition. As the cluster size increases, our typical medium cluster method recovers the correct critical disorder strength for the transition. Our findings highlight the importance of the non-local cluster corrections for capturing the localization behavior of the mobility edge trajectories. Our results demonstrate that the typical medium cluster approach developed here provides a consistent and systematic description of the Anderson localization transition in the framework of the effective medium embedding schemes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Ab Initio Many Body Quantum Embedding and Local Correlation in Crystalline Materials using Interpolative Separable Density Fitting

We present an efficient implementation of ab initio many-body quantum embedding and local correlation methods for infinite periodic systems through translational symmetry adapted interpolative separable density fitting, an approach which reduces the scaling of the calculations to only linear with the number of k-points. Employing this methodology, we compute correlated ground-state coupled cluster energies within density matrix embedding and local natural orbital correlation frameworks for both weakly and strongly correlated solids, using up to 1000 k-points. By extrapolating the local correlation domains and k-point sampling we further obtain estimates of the full coupled cluster with singles, doubles, and perturbative triples ground-state energies in the thermodynamic limit.

Chemical Physics (physics.chem-ph)↗