A high order cut-cell method for solving the shallow-shelf equations
Not Available
97 MATHEMATICS AND COMPUTING↗
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.
Biomedical Integration of Metal–Organic Frameworks
Metal–organic frameworks (MOFs) have recently been demonstrated to be excellent platforms for biomedical applications. On account of their porous nature and modular structure, MOFs have served as bioactive-compound carriers, cell-imaging materials, and therapeutic agents. MOF cavities allow the encapsulation of a variety of guest molecules, facilitating controllable drug release and optical imaging. The metal components of MOFs make them suitable for magnetic resonance imaging (MRI) and computed tomography (CT). Further, MOF-embedded therapeutic agents have demonstrated promise in photodynamic and photothermal therapies. In this review, we describe several advanced examples that utilize MOFs in these cutting-edge applications. Investigation of the relationship between their structure and designated application will enable future, informed exploration of MOFs for biomedical applications.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Causally‐Informed Deep Learning to Improve Climate Models and Projections
Abstract Climate models are essential to understand and project climate change, yet long‐standing biases and uncertainties in their projections remain. This is largely associated with the representation of subgrid‐scale processes, particularly clouds and convection. Deep learning can learn these subgrid‐scale processes from computationally expensive storm‐resolving models while retaining many features at a fraction of computational cost. Yet, climate simulations with embedded neural network parameterizations are still challenging and highly depend on the deep learning solution. This is likely associated with spurious non‐physical correlations learned by the neural networks due to the complexity of the physical dynamical system. Here, we show that the combination of causality with deep learning helps removing spurious correlations and optimizing the neural network algorithm. To resolve this, we apply a causal discovery method to unveil causal drivers in the set of input predictors of atmospheric subgrid‐scale processes of a superparameterized climate model in which deep convection is explicitly resolved. The resulting causally‐informed neural networks are coupled to the climate model, hence, replacing the superparameterization and radiation scheme. We show that the climate simulations with causally‐informed neural network parameterizations retain many convection‐related properties and accurately generate the climate of the original high‐resolution climate model, while retaining similar generalization capabilities to unseen climates compared to the non‐causal approach. The combination of causal discovery and deep learning is a new and promising approach that leads to stable and more trustworthy climate simulations and paves the way toward more physically‐based causal deep learning approaches also in other scientific disciplines.
Meteorology & Atmospheric Sciences↗
IRIS: A Portable Runtime System Exploiting Multiple Heterogeneous Programming Systems
Across embedded, mobile, enterprise, and HPC systems, computer architectures are becoming more heterogeneous and complex. This complexity is causing a crisis in programming systems and performance portability. Several programming systems are working to address these challenges, but the increasing architectural diversity is forcing software stacks and applications to specialize for each architecture. As we show, all of these approaches critically depend on their runtime system for discovery, execution, scheduling, and data orchestration. To address this challenge, we believe that a more agile and proactive runtime system is essential to increase performance portability and improve user productivity. In this regard, we have designed and implemented IRIS: a portable runtime system exploiting multiple heterogeneous programming systems. IRIS can discover available resources, manage multiple diverse programming systems (e.g., CUDA, Hexagon, HIP, Level Zero, OpenCL, OpenMP) simultaneously in the same execution, respect data dependencies, orchestrate data movement proactively, and provide for user-configurable scheduling. Our evaluation on three architectures, ranging from Qualcomm Snapdragon to a Summit supercomputer node, shows that IRIS improves portability across a wide range of diverse heterogeneous architectures with negligible overhead.
Kim, Jungwon↗
Netload Range Cost Curves for Coordinated Transmission-Distribution Planning Under DER Growth Uncertainty
The increasing penetration of distributed energy resources (DERs) requires better coordination between transmission and distribution (T&D) planning to ensure system security and cost efficiency. However, misaligned planning horizons, computational burdens, and privacy concerns hinder effective coordination, leading to either underutilized resources caused by overinvestments or reliability risks due to underinvestment. To address this challenge, we introduce netload range cost curves (NRCCs), a novel approach for managing long-term DER growth uncertainty through T&D coordination, while preserving existing data-sharing and regulatory structures. NRCCs provide pairs of (i) peak substation netload guarantees and (ii) corresponding distribution upgrade options and costs, enabling their seamless integration into transmission planning workflows. To compute NRCCs efficiently, we develop a transmission-aware distribution network planning (TADNP), which is subsequently integrated to an iterative computation procedure. These NRCCs are then embedded into an NRCC-informed transmission planning model to enable resource-efficient coordination. We illustrate our proposed approach with a case study based on realistic distribution and transmission systems in the San Francisco Bay Area, California. Our results indicate the possibility of dramatic savings in transmission investments by incorporating the proposed NRCC-integrated T&D coordination framework.
Li, Yujia↗
Generating Euler Diagrams Through Combinatorial Optimization
Abstract Can a given set system be drawn as an Euler diagram? We present the first method that correctly decides this question for arbitrary set systems if the Euler diagram is required to represent each set with a single connected region. If the answer is yes, our method constructs an Euler diagram. If the answer is no, our method yields an Euler diagram for a simplified version of the set system, where a minimum number of set elements have been removed. Further, we integrate known wellformedness criteria for Euler diagrams as additional optimization objectives into our method. Our focus lies on the computation of a planar graph that is embedded in the plane to serve as the dual graph of the Euler diagram. Since even a basic version of this problem is known to be NP‐hard, we choose an approach based on integer linear programming (ILP), which allows us to compute optimal solutions with existing mathematical solvers. For this, we draw upon previous research on computing planar supports of hypergraphs and adapt existing ILP building blocks for contiguity‐constrained spatial unit allocation and the maximum planar subgraph problem. To generate Euler diagrams for large set systems, for which the proposed simplification through element removal becomes indispensable, we also present an efficient heuristic. We report on experiments with data from MovieDB and Twitter. Over all examples, including 850 non‐trivial instances, our exact optimization method failed only for one set system to find a solution without removing a set element. However, with the removal of only a few set elements, the Euler diagrams can be substantially improved with respect to our wellformedness criteria.
Computer Science↗
Challenges in Firmware Re-Hosting, Emulation, and Analysis
System emulation and firmware re-hosting have become popular techniques to answer various security and performance related questions, such as determining whether a firmware contain security vulnerabilities or meet timing requirements when run on a specific hardware platform. While this motivation for emulation and binary analysis has previously been explored and reported, starting to either work or research in the field is difficult. To this end, we provide a comprehensive guide for the practitioner or system emulation researcher. Here, we layout common challenges faced during firmware re-hosting, explaining successive steps and surveying common tools used to overcome these challenges. We provide classification techniques on five different axes, including emulator methods, system type, fidelity, emulator purpose, and control. These classifications and comparison criteria enable the practitioner to determine the appropriate tool for emulation. We use our classifications to categorize popular works in the field and present 28 common challenges faced when creating, emulating, and analyzing a system from obtaining firmwares to post emulation analysis.
97 MATHEMATICS AND COMPUTING↗
Manifold Learning-Based Polynomial Chaos Expansions for High-Dimensional Surrogate Models
In this work we introduce a manifold learning-based method for uncertainty quantification (UQ) in systems describing complex spatiotemporal processes. Our first objective is to identify the embedding of a set of high-dimensional data representing quantities of interest of the computational or analytical model. For this purpose, we employ Grassmannian diffusion maps, a two-step nonlinear dimension reduction technique which allows us to reduce the dimensionality of the data and identify meaningful geometric descriptions in a parsimonious and inexpensive manner. Polynomial chaos expansion is then used to construct a mapping between the stochastic input parameters and the diffusion coordinates of the reduced space. An adaptive clustering technique is proposed to identify an optimal number of clusters of points in the latent space. The similarity of points allows us to construct a number of geometric harmonic emulators which are finally utilized as a set of inexpensive pretrained models to perform an inverse map of realizations of latent features to the ambient space and thus perform accurate out-of-sample predictions. Thus, the proposed method acts as an encoder-decoder system which is able to automatically handle very high-dimensional data while simultaneously operating successfully in the small-data regime. The method is demonstrated on two benchmark problems and on a system of advection-diffusion-reaction equations which model a first-order chemical reaction between two species. In all test cases, the proposed method is able to achieve highly accurate approximations which ultimately lead to the significant acceleration of UQ tasks.
42 ENGINEERING↗
Cutting the Deployment Costs of Physics-Based MPC in Buildings by Simulation-Based Imitation Learning
It has been shown that model predictive control (MPC) is a promising solution for energy-efficient building operations. However, the deployment of MPC in a large portion of the building stock has not been possible partially because of high installation costs. Every building is unique and requires a tailored MPC solution. The best performing solutions are often based on physics-based modeling, which is, however, computationally expensive and requires dedicated software. A promising direction that tackles this problem is to train a neural network-based optimal control policy to imitate the behavior of physics-based MPC from the simulation data generated offline. The neural networks give control actions that closely approximate those produced by physics-based MPC, but with a fraction of the computational and memory requirements and without the need for licensed software. The main advantage of the proposed approach stems from simple evaluation at execution time, leading to low computational footprints and easy deployment on embedded HW platforms. In the case study, we present the energy savings potential of physics-based MPC applied to an office building in Belgium. We demonstrate how neural network approximators can be used to cut the implementation and maintenance costs of MPC deployment without compromising performance. We also critically assess the presented approach by pointing out the remaining challenges and open research questions.
Drgona, Jan↗
Charting C–C coupling pathways in electrochemical CO 2 reduction on Cu(111) using embedded correlated wavefunction theory
The electrochemical CO 2 reduction reaction (CO 2 RR) powered by excess zero-carbon-emission electricity to produce especially multicarbon (C 2+ ) products could contribute to a carbon-neutral to carbon-negative economy. Foundational to the rational design of efficient, selective CO 2 RR electrocatalysts is mechanistic analysis of the best metal catalyst thus far identified, namely, copper (Cu), via quantum mechanical computations to complement experiments. Here, we apply embedded correlated wavefunction (ECW) theory, which regionally corrects the electron exchange-correlation error in density functional theory (DFT) approximations, to examine multiple C–C coupling steps involving adsorbed CO (*CO) and its hydrogenated derivatives on the most ubiquitous facet, Cu(111). We predict that two adsorbed hydrogenated CO species, either *COH or *CHO, are necessary precursors for C–C bond formation. The three kinetically feasible pathways involving these species yield all three possible products: *COH–CHO, *COH–*COH, and *OCH–*OCH. The most kinetically favorable path forms *COH–CHO. In contrast, standard DFT approximations arrive at qualitatively different conclusions, namely, that only *CO and *COH will prevail on the surface and their C–C coupling paths produce only *COH–*COH and *CO–*CO, with a preference for the first product. This work demonstrates the importance of applying qualitatively and quantitatively accurate quantum mechanical method to simulate electrochemistry in order ultimately to shed light on ways to enhance selectivity toward C 2+ product formation via CO 2 RR electrocatalysts.
30 DIRECT ENERGY CONVERSION↗
On the structure of isometrically embeddable metric spaces
Since its popularization in the 1970s, the Fiedler vector of a graph has become a standard tool for clustering of the vertices of the graph. Recently, Mendel and Noar, Dumitriu and Radcliffe, and Radcliffe and Williamson have introduced geometric generalizations of the Fiedler vector. Motivated by questions stemming from their work, we provide structural characterizations for when a finite metric space can be isometrically embedded in a Hilbert space.
97 MATHEMATICS AND COMPUTING↗
How Well Can Quantum Embedding Method Predict the Reaction Profiles for Hydrogenation of Small Li Clusters?
Quantum computing leverages the principles of quantum mechanics in novel ways to tackle complex chemistry problems that cannot be accurately addressed using traditional quantum chemistry methods. However, the high computational cost and available number of physical qubits with high fidelity limit its application to small chemical systems. This work employed a quantum-classical framework which features a quantum active space-embedding approach to perform simulations of chemical reactions that require up to 14 qubits. This framework was applied to prototypical example metal hydrogenation reactions: the coupling between hydrogen and Li 2 , Li 3 , and Li 4 clusters. Particular attention was paid to the computation of barriers and reaction energies. The predicted reaction profiles compare well with advanced classical quantum chemistry methods, demonstrating the potential of the quantum embedding algorithm to map out reaction profiles of realistic gas-phase chemical reactions to ascertain qualitative energetic trends. Additionally, the predicted potential energy curves provide a benchmark to compare against both current and future quantum embedding approaches.
36 MATERIALS SCIENCE↗
Scalable semidefinite programming approach to variational embedding for quantum many-body problems
In quantum embedding theories, a quantum many-body system is divided into localized clusters of sites which are treated with an accurate ‘high-level’ theory and glued together self-consistently by a less accurate ‘low-level’ theory at the global scale. The recently introduced variational embedding approach for quantum many-body problems combines the insights of semidefinite relaxation and quantum embedding theory to provide a lower bound on the ground-state energy that improves as the cluster size is increased. The variational embedding method is formulated as a semidefinite program (SDP), which can suffer from poor computational scaling when treated with black-box solvers. Here, we exploit the interpretation of this SDP as an embedding method to develop an algorithm which alternates parallelizable local updates of the high-level quantities with updates that enforce the low-level global constraints. Moreover, we show how translation invariance in lattice systems can be exploited to reduce the complexity of projecting a key matrix to the positive semidefinite cone.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Quantum-classical embedding via ghost Gutzwiller approximation for enhanced simulations of correlated electron systems
Simulating correlated materials on present-day quantum hardware remains challenging due to limited quantum resources. Quantum embedding methods offer a promising route by reducing computational complexity through the mapping of bulk systems onto effective impurity models, allowing more feasible simulations on pre- and early-fault-tolerant quantum devices. Here, this work develops a quantum-classical embedding framework based on the ghost Gutzwiller approximation to enable quantum-enhanced simulations of ground-state properties and spectral functions of correlated electron systems. Circuit complexity is analyzed using an adaptive variational quantum algorithm on a statevector simulator, applied to the infinite-dimensional Hubbard model with increasing ghost mode numbers from 3 to 5, resulting in circuit depths growing from 16 to 104. Noise effects are examined using a realistic error model, revealing significant impact on the spectral weight of the Hubbard bands. To mitigate these effects, the Iceberg quantum error detection code is employed, achieving up to 40% error reduction in simulations. Finally, the accuracy of the density matrix estimation and the derived spectral function is benchmarked on IBM and Quantinuum quantum hardware, featuring distinct qubit-connectivity and employing multiple levels of error mitigation techniques.
Chen, I-Chi [Ames Laboratory (AMES), Ames, IA (Uni↗
Performance Characteristics of the BlueField-2 SmartNIC
High-performance computing (HPC) researchers have long envisioned scenarios where application workflows could be improved through the use of programmable processing elements embedded in the network fabric. Recently, vendors have introduced programmable Smart Network Interface Cards (SmartNICs) that enable computations to be offloaded to the edge of the network. There is great interest in both the HPC and high-performance data analytics (HPDA) communities in understanding the roles these devices may play in the data paths of upcoming systems. This paper focuses on characterizing both the networking and computing aspects of NVIDIA’s new BlueField-2 SmartNIC when used in a 100Gb/s Ethernet environment. For the networking evaluation we conducted multiple transfer experiments between processors located at the host, the SmartNIC, and a remote host. These tests illuminate how much effort is required to saturate the network and help estimate the processing headroom available on the SmartNIC during transfers. For the computing evaluation we used the stress-ng benchmark to compare the BlueField-2 to other servers and place realistic bounds on the types of offload operations that are appropriate for the hardware. Our findings from this work indicate that while the BlueField-2 provides a flexible means of processing data at the network’s edge, great care must be taken to not overwhelm the hardware. While the host can easily saturate the network link, the SmartNIC’s embedded processors may not have enough computing resources to sustain more than half the expected bandwidth when using kernel-space packet processing. From a computational perspective, encryption operations, memory operations under contention, and on-card IPC operations on the SmartNIC perform significantly better than the general-purpose servers used for comparisons in our experiments. Therefore, applications that mainly focus on these operations may be good candidates for offloading to the SmartNIC.
97 MATHEMATICS AND COMPUTING↗
Efficient and flexible multirate temporal adaptivity
In this work we present two new families of multirate time step adaptivity controllers, that are designed to work with embedded multirate infinitesimal (MRI) time integration methods for adapting time steps when solving problems with multiple time scales. We compare these controllers against competing approaches on two benchmark problems, showing that the proposed methods offer dramatically improved performance and flexibility. The combination of embedded MRI methods and the proposed controllers enable adaptive simulations of problems with a potentially arbitrary number of time scales, achieving high accuracy while maintaining low computational cost. Additionally, we introduce a new set of embeddings for the family of explicit multirate exponential Runge–Kutta (MERK) methods of orders 2 through 5, resulting in the first-ever fifth-order embedded MRI method. Finally, we compare the performance of a wide range of embedded MRI methods on our benchmark problems to provide guidance on how to select an appropriate MRI method and multirate controller.
97 MATHEMATICS AND COMPUTING↗
Multi-site reaction dynamics through multi-fragment density matrix embedding
The practical description of disordered chemical reactions, where the reactions involve multiple species at multiple sites, is presently a challenge using correlated electronic structure methods due to their high computational cost and steep scaling. Here, we describe the gradient theory of multi-fragment density matrix embedding theory, which potentially provides a minimal computational framework to model such processes at the correlated electron level. We present the derivation and implementation of the gradient theory, its validation on model systems and chemical reactions using density matrix embedding, and its application to a molecular dynamics simulation of proton transport in a small water cluster, a simple example of multi-site reaction dynamics.
Chemistry↗
Propagation of positive discharges in an air bubble having an embedded water droplet
Low temperature plasmas generated inside gas bubbles immersed in water is an effective method of rapidly transferring plasma generated reactive species to the water for applications in biomedicine, agriculture and environment. Reactive species are generally produced in the gas phase plasma and then solvate into the liquid. The large surface-to-volume ratio (SVR) of the bubble accelerates this process. In generating bubbles in water, aerosols and droplets are also contained within the bubble. These droplets also have a large SVR and so can be rapidly plasma activated. However, the presence of the droplets can also impact the propagation of the plasma in the bubble. In this paper, results are discussed from computational and experimental investigations of the formation and evolution of discharges in an air bubble immersed in water with an embedded water droplet. The computations were performed with a two-dimensional plasma hydrodynamics model. Experiments were performed with a quasi-2D bubble apparatus. In bubbles having a droplet, a plasma filament typically bridges from the powered electrode to the droplet, and then from the droplet to the bubble surface. A surface-hugging streamer also occurs on the inner bubble surface and on the surface of the droplet. Both surface streamers result in part from surface charge accumulation and can dominate the formation of reactive species that transport into the droplet. Increasing droplet conductivity suppresses propagation of the surface discharge and leads to a lower density of aqueous reactive species. Increasing conductivity of the surrounding water does not change the overall structure of the discharge but does slightly elevate the discharge intensity. Finally, the size and shape of the embedded droplet can significantly affect the formation and propagation of the streamer.
2D fluid modelling↗