Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computer algorithms”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,225 records · Page 68
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Practical Three-Dimensional Curvilinear Aperture Monopulse Synthetic Aperture Radar

When collected over a curved path, Synthetic Aperture Radar (SAR) contains information about the three-dimensional content of a scene that can aid interpretation of this difficult imaging modality. In a point scatterer simulation with amplitudes and heights derived from a real SAR image pair, we supplement confocal processing with a monopulse-based algorithm to compute heights of certain bright points, which we find automatically. In SAR, bright points often reflect man-made infrastructure central to scene interpretation.

Story, Mark [ORNL] (ORCID:0000000289148911)↗
DOE OSTI2020

Optimization-Based Fast-Frequency Estimation and Control of Low-Inertia Microgrids

The lack of inertial response from non-synchronous, inverter-based generation in microgrids makes the power system vulnerable to a large rate of change of frequency (ROCOF) and frequency excursions. Energy storage systems (ESSs) can be utilized to provide fast-frequency support to prevent such large excursions in the system. However, fast-frequency support is a power-intensive application that has a significant impact on the ESS lifetime. In this paper, a framework that allows the ESS operator to provide fast-frequency support as a service is proposed. The framework maintains the desired quality-of-service (limiting the ROCOF and frequency) while taking into account the ESS lifetime and physical limits. The framework utilizes moving horizon estimation (MHE) to estimate the frequency deviation and ROCOF from noisy phase-locked loop (PLL) measurements. These estimates are employed by a model predictive control (MPC) algorithm that computes control actions by solving a finite-horizon, online optimization problem. Additionally, this approach avoids oscillatory behavior induced by delays that are common when using low-pass filters as with traditional derivative-based (virtual inertia) controllers. MATLAB/Simulink simulations on a test system from Cordova, Alaska, show the effectiveness of the MHE-MPC approach to reduce frequency deviations and ROCOF of a low-inertia microgrid.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Distribution System Behind-the-Meter DERs: Estimation, Uncertainty Quantification, and Control

This paper summarizes the three-year technical activities of the IEEE Task Force (TF) on behind-the-meter (BTM) distributed energy resources (DERs): estimation, uncertainty quantification, and control. The potential grid services from BTM DERs are discussed in detail. The paper also reviews the state-of-the-art for BTM DERs visibility, uncertainty quantification, and, optimization and control. Furthermore, different aspects of the market structures associated with BTM DERs are covered, including emerging market and business models. Finally, needs and recommendations are provided for additional areas such as system protection, computing capabilities, algorithm development, market structure design, cyberinfrastructure and security, and hardware and software developments.

behind-the-meter↗
DOE OSTI2020

Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM

We analyze an expansion of the generalized block Krylov subspace framework of [Electron. Trans. Numer. Anal., 47 (2017), pp. 100--126]. This expansion allows the use of low-rank modifications of the matrix projected onto the block Krylov subspace and contains, as special cases, the block GMRES method and the new block Radau--Arnoldi method. Within this general setting, we present results that extend the interpolation property from the nonblock case to a matrix polynomial interpolation property for the block case, and we relate the eigenvalues of the projected matrix to the latent roots of these matrix polynomials. Some error bounds for these modified block FOM methods for solving linear systems are presented. We then show how cospatial residuals can be preserved in the case of families of shifted linear block systems. This result is used to derive computationally practical restarted algorithms for block Krylov approximations that compute the action of a matrix function on a set of several vectors simultaneously. Finally, we prove some error bounds and present numerical results showing that two modifications of FOM, the block harmonic and the block Radau--Arnoldi methods for matrix functions, can significantly improve the convergence behavior.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Estimating Higher-Order Moments Using Symmetric Tensor Decomposition

In this paper, we consider the problem of decomposing higher-order moment tensors, i.e., the sum of symmetric outer products of data vectors. Such a decomposition can be used to estimate the means in a Gaussian mixture model and for other applications in machine learning. The dth-order empirical moment tensor of a set of p observations of n variables is a symmetric d-way tensor. Our goal is to nd a low-rank tensor approximation comprising r $\ll$ p symmetric outer products. The challenge is that forming the empirical moment tensor costs O(pn d ) operations and O(n d ) storage, which may be prohibitively expensive; additionally, the algorithm to compute the low-rank approximation costs O(n d ) per iteration. Our contribution is avoiding formation of the moment tensor, computing the low-rank tensor approximation of the moment tensor implicitly using O(pnr) operations per iteration and no extra memory. This advance opens the door to more applications of higher-order moments since they can now be efficiently computed. We present numerical evidence of the computational savings and show an example of estimating the means for higher-order moments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Trajectory-Driven Algorithm for Differentiating SRB Measures on Unstable Manifolds

Sinai-Ruelle-Bowen (SRB) measures are limiting stationary distributions describing the statistical behavior of chaotic dynamical systems. Directional derivatives of SRB measure densities conditioned on unstable manifolds are critical in the sensitivity analysis of hyperbolic chaos. These derivatives, known as the SRB density gradients, are by-products of the regularization of Lebesgue integrals appearing in the original linear response expression. In this paper, we propose a novel trajectory- driven algorithm for computing the SRB density gradient defined for systems with high-dimensional unstable manifolds. We apply the concept of measure preservation together with the chain rule on smooth manifolds. Due to the recursive one-step nature of our derivations, the proposed procedure is memory-efficient and can be naturally integrated with existing Monte Carlo schemes widely used in computational chaotic dynamics. Here, we numerically show the exponential convergence of our scheme, analyze the computational cost, and present its use in the context of Monte Carlo integration.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

SDE_quark

This program provides a fixed-grid quadrature algorithm to compute integrals in the self-energy of the quark propagator within the Maris-Tandy model. The quark propagator both on t he spacelike real axis and at complex-valued momenta is determined from its Schwinger-Dyson equation (SDE). We first apply an iterative solver to find the quark propagator on the spacelike real axis. The propagator at complex-valued momenta is then computed from its self-energy based on this solution, where demanding integrals are encountered. In order to compute of these integrals, we apply customized variable transformations for the radial integral after subtracting the asymptotics. We subsequently apply an optional compound of quadrature rules for the angular integral.

Jia, Shaoyang↗
DOE OSTI2025

Advancing 3D surface imaging: single-axis structured light illumination plenoptic camera with machine learning integration

Structured light illumination (SLI) is a configurable 3D surface imaging modality that can function largely independently of surface texture. At the same time, machine learning (ML) approaches are providing new ways to capture relevant information from SLI patterns, avoiding the need to develop advanced computer vision algorithms. By projecting an optical pattern onto a surface and measuring the apparent distortion of that pattern, one can determine surface topography from a single image. Common realizations of SLI 3D imaging use off-axis SLI to allow for parallax-based determination of depth; however, in constrained geometries, the ability to make single-axis measurements can be of major benefit. While plenoptic imaging (PI) cameras have long been developed for the purpose of single-axis 3D imaging, they are generally reliant on the surface texture of the measured object, thus making them unreliable in certain experimental conditions. Therefore, we present a single-axis 3D SLI plenoptic camera, which combines the single-axis benefits of PI technology while using coaxial SLI to maintain indifference to surface conditions. We also present a study of the camera capabilities paired with the development of several algorithms, including traditional feature tracking methods as well as ML methods, which are found to enhance resolution and range. We report depth sensitivity down to 0.2% $\frac{dz}{z_0}$. The single-axis SLI 3D plenoptic camera demonstrates potential applicability for in-situ topographical measurements under a wide range of conditions including, but not limited to, objects without trackable surface texture, high temperatures, and constrained geometry environments.

Imaging systems↗
DOE OSTI2024

Spinning metasurface stack for spectro-polarimetric thermal imaging

Spectro-polarimetric imaging in the long-wave infrared (LWIR) region plays a crucial role in applications from night vision and machine perception to trace gas sensing and thermography. However, the current generation of spectro-polarimetric LWIR imagers suffers from limitations in size, spectral resolution, and field of view (FOV). While meta-optics-based strategies for spectro-polarimetric imaging have been explored in the visible spectrum, their potential for thermal imaging remains largely unexplored. In this work, we introduce an approach for spectro-polarimetric decomposition by combining large-area stacked meta-optical devices with advanced computational imaging algorithms. The co-design of a stack of spinning dispersive metasurfaces along with compressive sensing and dictionary learning algorithms allows simultaneous spectral and polarimetric resolution without the need for bulky filter wheels or interferometers. Our spinning-metasurface-based spectro-polarimetric stack is compact (<10×10×10cm) and robust, and it offers a wide field of view (20.5°). We show that the spectral resolving power of our system substantially enhances performance in machine learning tasks such as material classification, a challenge for conventional panchromatic thermal cameras. Our approach represents a significant advance in the field of thermal imaging for a wide range of applications including heat-assisted detection and ranging (HADAR).

Optics↗
DOE OSTI2024

UNNT: A novel Utility for comparing Neural Net and Tree-based models

The use of deep learning (DL) is steadily gaining traction in scientific challenges such as cancer research. Advances in enhanced data generation, machine learning algorithms, and compute infrastructure have led to an acceleration in the use of deep learning in various domains of cancer research such as drug response problems. In our study, we explored tree-based models to improve the accuracy of a single drug response model and demonstrate that tree-based models such as XGBoost (eXtreme Gradient Boosting) have advantages over deep learning models, such as a convolutional neural network (CNN), for single drug response problems. However, comparing models is not a trivial task. To make training and comparing CNNs and XGBoost more accessible to users, we developed an open-source library called UNNT (A novel Utility for comparing Neural Net and Tree-based models). The case studies, in this manuscript, focus on cancer drug response datasets however the application can be used on datasets from other domains, such as chemistry.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Replacing non-biomedical concepts improves embedding of biomedical concepts

Embeddings are semantically meaningful representations of words in a vector space, commonly used to enhance downstream machine learning applications. Traditional biomedical embedding techniques often replace all synonymous words representing biological or medical concepts with a unique token, ensuring consistent representation and improving embedding quality. However, the potential impact of replacing non-biomedical concept synonyms has received less attention. Embedding approaches often employ concept replacement to replace concepts that span multiple words, such as non-small-cell lung carcinoma, with a single concept identifier (e.g., D002289). Also, all synonyms of each concept are merged into the same identifier. Here, we additionally leveraged WordNet to identify and replace sets of non-biomedical synonyms with their most common representatives. This combined approach aimed to reduce embedding noise from non-biomedical terms while preserving the integrity of biomedical concept representations. We applied this method to 1,055 biomedical concept sets representing molecular signatures or medical categories and assessed the mean pairwise distance of embeddings with and without non-biomedical synonym replacement. A smaller mean pairwise distance was interpreted as greater intra-cluster coherence and higher embedding quality. Embeddings were generated using the Word2Vec algorithm applied to a corpus of 10 million PubMed abstracts. Our results demonstrate that the addition of non-biomedical synonym replacement reduced the mean intra-cluster distance by an average of 8%, suggesting that this complementary approach enhances embedding quality. Future work will assess its applicability to other embedding techniques and downstream tasks. Python code implementing this method is provided under an open-source license.

algorithms↗
DOE OSTI2022

Novel Proppant Logging Technique for Infill Drilling of Unconventional Shale Wells

Summary During the development of an unconventional play, wells are drilled and completed in batches, and depending on the development plans, current and expected energy market trends, as well as other developmental considerations, new wells are drilled and hydraulically fractured later near existing producing laterals. This creates challenges in terms of optimizing resource recovery and reducing interwell communication. A novel approach is proposed that utilizes systematic composite sampling and analysis of drilling mud returns to look for and quantitatively identify sand particles. The workflow involves cleaning, drying, and segregation of samples into sizes of interest to us (size distribution of pumped proppant in offset parent wells). These samples are imaged at a very high resolution and analyzed for grains using characteristic optical imaging properties to classify proppant sand particles using computer vision algorithms. Further analysis, such as elemental compositional analysis, is used to validate the results from the imaging workflow. We present a case study from the Permian Basin, where a new child well was used as a test case to prove this technology at the Hydraulic Fracturing Test Site (HFTS-2) in Delaware Basin. We introduce new proppant parameters that help identify sustained proppant zones vs. localized propped fractures. We have used additional diagnostics and data collected at the test site to validate observations from the proppant log and have successfully interpreted significantly propped vs. unpropped zones. A key finding from this test has been the significant proppant transport distances observed away from parent wells. Observable proppant was found at a lateral distance of approximately 425 m for one set of parent wells and more than 915 m for another set of parent wells. While a major limitation of this technique is the sampling rate, given adequate sampling, the proposed technology represents a systematic and one-of-a-kind interpretation of spatial proppant distribution while drilling infill wells. It provides us with unique opportunities to better understand the current state of the reservoir being targeted, including zones that are likely highly drained relative to others, and how the planned hydraulic fracturing of child wells can be improved.

Energy & Fuels↗
DOE OSTI2024

Error-correcting codes for fermionic quantum simulation

Utilizing the framework of \mathbb{Z}_2 ℤ 2 lattice gauge theories in the context of Pauli stabilizer codes, we present methodologies for simulating fermions via qubit systems on a two-dimensional square lattice. We investigate the symplectic automorphisms of the Pauli module over the Laurent polynomial ring. This enables us to systematically increase the code distances of stabilizer codes while fixing the rate between encoded logical fermions and physical qubits. We identify a family of stabilizer codes suitable for fermion simulation, achieving code distances of d=2,3,4,5,6,7, allowing correction of any \lfloor \frac{d-1}{2} \rfloor ⌊ d − 1 2 ⌋ -qubit error. In contrast to the traditional code concatenation approach, our method can increase the code distances without decreasing the (fermionic) code rate. In particular, we explicitly show all stabilizers and logical operators for codes with code distances of d=3,4,5. We provide syndromes for all Pauli errors and invent a syndrome-matching algorithm to compute code distances numerically.

Physics↗
DOE OSTI2020

Algorithms and Statistical Models for Scientific Discovery in the Petabyte Era

The field of astronomy has arrived at a turning point in terms of size and complexity of both datasets and scientific collaboration. Commensurately, algorithms and statistical models have begun to adapt --- e.g., via the onset of artificial intelligence --- which itself presents new challenges and opportunities for growth. This white paper aims to offer guidance and ideas for how we can evolve our technical and collaborative frameworks to promote efficient algorithmic development and take advantage of opportunities for scientific discovery in the petabyte era. We discuss challenges for discovery in large and complex data sets; challenges and requirements for the next stage of development of statistical methodologies and algorithmic tool sets; how we might change our paradigms of collaboration and education; and the ethical implications of scientists' contributions to widely applicable algorithms and computational modeling. We start with six distinct recommendations that are supported by the commentary following them. This white paper is related to a larger corpus of effort that has taken place within and around the Petabytes to Science Workshops (https://petabytestoscience.github.io/).

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2020

In-Situ Inference: Bringing Advanced Data Science Into Exascale Simulations

As simulations generate ever-increasing amounts of data, there are correspondingly richer opportunities for analysis and scientific discovery - discoveries that will be missed if most of the data must be discarded before it is analyzed. Because future exascale architectures will be increasingly storage-limited, it will not be possible to save the vast majority of simulation data for later analysis, requiring analysis to occur “in-situ” within the simulation. However, existing in-situ data analysis frameworks provide little or no support for one of the most sophisticated forms of data science: probabilistic statistical modeling or uncertainty quantification (UQ), and the accompanying challenge of inference - fitting those statistical models to massive simulation output. Our goal is to develop the fundamental statistical algorithms and computer science needed to perform statistical inference in-situ (in HPC simulations) to the full stream of data those simulations generate.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Electronic Structure Theories of Singlet Fission and Multiple Exciton Generation (Final Report)

This DOE grant supported the development of electronic structure theory, algorithms, and computer programs for simulating singlet fission and multiple excision generation processes from Sept. 2013 to Aug. 2018 (which was terminated due to the PI’s departure from Northwestern University to industry). One of the main achievements is the development of the so-called active space decomposition (ASD) method hat describes exciton dynamics in organic semiconductors and spin dynamics in strongly correlated materials. The resulting software was interfaced with the Brilliantly Advanced General Electronic-structure Library (BAGEL) package and widely disseminated to the research community.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Review of Literature Related to Nuclear Data Mini-Apps

his document reviews nuclear data mini-apps prevalent in the published scientific literature. It is intended to identify algorithmic and computer architecture considerations of relevance to optimizing GIDI/MCGIDI for GPU-based architectures. While some of the works considered here focus on CPU-based architectures, the performance-limiting factors and mitigating strategies identified often extend to GPU-based architectures, particularly in the context of latency-bound performance. A brief overview of the cross section (XS) lookup process is given in Section 1 and a detailed analysis of nuclear data mini-apps follows in Section 2. Concluding remarks are offered in Section 3.

42 ENGINEERING↗
DOE OSTI2021

Analysis and Optimization of Seismo-Acoustic Monitoring Networks with Bayesian Optimal Experimental Design

The Bayesian optimal experimental design (OED) problem seeks to identify data, sensor configurations, or experiments which can optimally reduce uncertainty. The goal of OED is to find an experiment that maximizes the expected information gain (EIG) about quantities of interest given prior knowledge about expected data. Therefore, within the context of seismic monitoring, we can use Bayesian OED to configure sensor networks by choosing sensor locations, types, and fidelity in order to improve our ability to identify and locate seismic sources. In this work, we develop the framework necessary to use Bayesian OED to optimize the ability to locate seismic events from arrival time data of detected seismic phases. In order to do utilize Bayesian OED we must develop four elements:1. A likelihood function that describes the uncertainty of detection and travel times; 2. A Bayesian solver that takes a prior and likelihood to identify the posterior; 3. An algorithm to compute EIG; and, 4. An optimizer that finds a sensor network which maximizes EIG. Once we have developed this framework, we can explore many relevant questions to monitoring such as: how and what multiphenomenology data can be used to optimally reduce uncertainty, how to trade off sensor fidelity and earth model uncertainty, and how sensor types, number, and locations influence uncertainty

47 OTHER INSTRUMENTATION↗