Search NASA⌕ Search

SEARCH · Search NASA

Results for “Backtracking”

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.

9 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Performance Improvements Through Advanced PV Backtracking on Uneven Terrain

The climatic sensitivity of new terrain-aware backtracking algorithms is evaluated across 800 locations in the continental USA on a representative synthetic rolling terrain. We find that a global optimization approach to backtracking results in climate-specific annual energy gains of 2.4%–3.2% relative to a traditional backtracking algorithm baseline. We identify a strong logarithmic correlation between local diffuse fraction and yield improvement, and highlight the effect of seasonal precipitation on performance gains. We also find that a backtracking approach, which approximates the terrain as constant, does not offer significant annual energy gains over the baseline on the synthetic terrain. Our findings suggest that specific yield from backtracking in the USA can be improved by as much as 88 kWh/kW by considering terrain when selecting a backtracking algorithm.

Backtracking↗
DOE OSTI2026

A Linear Programming Approach to Backtracking for Single-Axis Trackers on Rolling Terrain

In this article, we present a computationally efficient method for determining optimal backtracking rotations for single-axis solar trackers on nonuniform terrain. The method allows for ganged tracking, mechanical rotation constraints, uneven row spacing, and arbitrary maximum allowable shaded fractions (to enable “fractional backtracking”). As with previous 2-D approaches, the method is suitable for terrain that varies in the transverse direction with respect to the rotation axis of the trackers. The novelty of the method lies in formulating the problem of shade avoidance as a linear problem, which is achieved by using the row interception width as the optimization variable instead of rotation angles. Formulating backtracking as a linear problem enables the use of extremely efficient linear programming algorithms, making the method highly scalable, requiring less than 1 min to compute optimal rotation schedules for hundreds of trackers. It also produces more effective backtracking rotations, reducing the frequency of shading by 4× and improving system energy output by 1%–2%.

Optimization↗
DOE OSTI2024

Shaded fraction and backtracking in single-axis trackers on rolling terrain

A generalized closed-form equation for the shaded collector fraction in solar arrays on rolling or undulating terrain is provided for single-axis tracking and fixed-tilt systems. The equation accounts for different rotation angles between the shaded and shading trackers, cross-axis slope between the two trackers, and offset between the collector plane and axis of rotation. The validity of the equation is demonstrated through comparison with numerical ray-tracing simulations and remaining minor sources of error are quantified. Additionally, a simple procedure to determine backtracking rotations for each row in an array installed on the rolling terrain (varying in the direction perpendicular to the tracker axes) is provided. The backtracking equation accounts for a desired shaded fraction (including complete shade avoidance) as well as an axis-collector offset. Test cases are provided to facilitate implementation of these equations.

14 SOLAR ENERGY↗
DOE OSTI2025

Analysis of the SiMPL Method for Density-Based Topology Optimization

We present a rigorous convergence analysis of a new method for density-based topology optimization that provides pointwise bound-preserving design updates and faster convergence than other popular first-order topology optimization methods. Due to its strong bound preservation, the method is exceptionally robust, as demonstrated in numerous examples here and in the companion article [D. Kim et al., Struct. Multidiscip. Optim., 68 (2025), 74]. Furthermore, it is easy to implement with clear structure and analytical expressions for the updates. Our analysis covers two versions of the method, characterized by the employed line search strategies. We consider a modified Armijo backtracking line search and a Bregman backtracking line search. For both line search algorithms, our algorithm delivers a strict monotone decrease in the objective function and further intuitive convergence properties, e.g., strong and pointwise convergence of the density variables on the active sets, norm convergence to zero of the increments, convergence of the Lagrange multipliers, and more. In addition, the numerical experiments demonstrate apparent mesh-independent convergence of the algorithm. Here, we refer to the new algorithm as the SiMPL method (pronounced “simple”), which stands for Sigmoidal Mirror descent with a Projected Latent variable.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Inverse aqueous transport modeling for emergency response

ALGE is a three-dimensional, finite-difference aqueous transport model that simulates pollutant fate and transport in lakes, rivers, bays, and estuaries by solving the prognostic equations of mass, momentum, and energy. Its current modeling capabilities include transport of dissolved tracer for a series of predefined basins across the continental United States. Recently, an inverse method (also known as backtracking) has been added to ALGE to provide a possible source of a pollutant should one be detected by a sensor in a body of water and a source is not known. This inverse method is a three step process that uses an algorithm to inverse the flow. We demonstrate the new model’s capabilities through simulating the 2021 Piney Point spill in Tampa Bay, Florida (USA). This involves moving tracer backwards from its detection points, encompassing a potential source area, and applying Bayes’ Theorem and $\frac{𝜒}{𝑄}$ to reduce the area within which the true source could be located.

hydrological modeling↗
DOE OSTI2023

Structural basis for DNA proofreading

DNA polymerase (DNAP) can correct errors in DNA during replication by proofreading, a process critical for cell viability. However, the mechanism by which an erroneously incorporated base translocates from the polymerase to the exonuclease site and the corrected DNA terminus returns has remained elusive. Here, we present an ensemble of nine high-resolution structures representing human mitochondrial DNA polymerase Gamma, Polγ, captured during consecutive proofreading steps. The structures reveal key events, including mismatched base recognition, its dissociation from the polymerase site, forward translocation of DNAP, alterations in DNA trajectory, repositioning and refolding of elements for primer separation, DNAP backtracking, and displacement of the mismatched base into the exonuclease site. Altogether, our findings suggest a conserved ‘bolt-action’ mechanism of proofreading based on iterative cycles of DNAP translocation without dissociation from the DNA, facilitating primer transfer between catalytic sites. Functional assays and mutagenesis corroborate this mechanism, connecting pathogenic mutations to crucial structural elements in proofreading steps.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

ProvSec: Open Cybersecurity System Provenance Analysis Benchmark Dataset with Labels

System provenance forensic analysis has been studied by a large body of research work. This area needs fine granularity data such as system calls along with event fields to track the dependencies of events. While prior work on security datasets has been proposed, we found a useful dataset of realistic attacks and details that are needed for high-quality provenance tracking is lacking. We created a new dataset of eleven vulnerable cases for system forensic analysis. It includes the full details of system calls including syscall parameters. Realistic attack scenarios with real software vulnerabilities and exploits are used. For each case, we created two sets of benign and adversary scenarios which are manually labeled for supervised machine-learning analysis. In addition, we present an algorithm to improve the data quality in the system provenance forensic analysis. We demonstrate the details of the dataset events and dependency analysis of our dataset cases.

97 MATHEMATICS AND COMPUTING↗