Search NASA⌕ Search

SEARCH · Search NASA

Results for “recursive”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Hybrid quantum-classical algorithms for approximate graph coloring

We show how to apply the recursive quantum approximate optimization algorithm (RQAOA) to MAX- k -CUT, the problem of finding an approximate k -vertex coloring of a graph. We compare this proposal to the best known classical and hybrid classical-quantum algorithms. First, we show that the standard (non-recursive) QAOA fails to solve this optimization problem for most regular bipartite graphs at any constant level p : the approximation ratio achieved by QAOA is hardly better than assigning colors to vertices at random. Second, we construct an efficient classical simulation algorithm which simulates level- 1 QAOA and level- 1 RQAOA for arbitrary graphs. In particular, these hybrid algorithms give rise to efficient classical algorithms, and no benefit arising from the use of quantum mechanics is to be expected. Nevertheless, they provide a suitable testbed for assessing the potential benefit of hybrid algorithm: We use the simulation algorithm to perform large-scale simulation of level- 1 QAOA and RQAOA with up to 300 qutrits applied to ensembles of randomly generated 3 -colorable constant-degree graphs. We find that level- 1 RQAOA is surprisingly competitive: for the ensembles considered, its approximation ratios are often higher than those achieved by the best known generic classical algorithm based on rounding an SDP relaxation. This suggests the intriguing possibility that higher-level RQAOA may be a potentially useful algorithm for NISQ devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Analysis of Random Forest Modeling Strategies for Multi-Step Wind Speed Forecasting

Although the random forest (RF) model is a powerful machine learning tool that has been utilized in many wind speed/power forecasting studies, there has been no consensus on optimal RF modeling strategies. This study investigates three basic questions which aim to assist in the discernment and quantification of the effects of individual model properties, namely: (1) using a standalone RF model versus using RF as a correction mechanism for the persistence approach, (2) utilizing a recursive versus direct multi-step forecasting strategy, and (3) training data availability on model forecasting accuracy from one to six hours ahead. These questions are investigated utilizing data from the FINO1 offshore platform and Atmospheric Radiation Measurement (ARM) Southern Great Plains (SGP) C1 site, and testing results are compared to the persistence method. At FINO1, due to the presence of multiple wind farms and high inter-annual variability, RF is more effective as an error-correction mechanism for the persistence approach. The direct forecasting strategy is seen to slightly outperform the recursive strategy, specifically for forecasts three or more steps ahead. Finally, increased data availability (up to ~8 equivalent years of hourly training data) appears to continually improve forecasting accuracy, although changing environmental flow patterns have the potential to negate such improvement. We hope that the findings of this study will assist future researchers and industry professionals to construct accurate, reliable RF models for wind speed forecasting.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Enhancing Multi-Step Reservoir Inflow Forecasting: A Time-Variant Encoder–Decoder Approach

Accurate reservoir inflow forecasting is vital for effective water resource management. Reliable forecasts enable operators to optimize storage and release strategies to meet competing sectoral demands—such as water supply, irrigation, and hydropower scheduling—while also mitigating flood and drought risks. To address this need, in this study, we propose a novel time-variant encoder–decoder (ED) model designed specifically to improve multi-step reservoir inflow forecasting, enabling accurate predictions of reservoir inflows up to seven days ahead. Unlike conventional ED-LSTM and recursive ED-LSTM models, which use fixed encoder parameters or recursively propagate predictions, our model incorporates an adaptive encoder structure that dynamically adjusts to evolving conditions at each forecast horizon. Additionally, we introduce the Expected Baseline Integrated Gradients (EB-IGs) method for variable importance analysis, enhancing interpretability of inflow by incorporating multiple baselines to capture a broader range of hydrometeorological conditions. The proposed methods are demonstrated at several diverse reservoirs across the United States. Our results show that they outperform traditional methods, particularly at longer lead times, while also offering insights into the key drivers of inflow forecasting. These advancements contribute to enhanced reservoir management through improved forecasting accuracy and practical decision-making insights under complex hydroclimatic conditions.

58 GEOSCIENCES↗
DOE OSTI2020

Decomposition Algorithms for Scalable Quantum Annealing

The presented python code provides wrapper functions for two decomposition algorithms: One algorithm to decompose Maximum Clique problems and one to decompose Minimum Vertex Cover problems. The functions take as input a networkx graph object, and decompose either problem on the input graph recursively into subproblems such that the optimal solution can be constructed from the optimal solutions of both subproblems. The recursion ends as soon as the subproblems reach a pre-specified size limit by the user, and they can be solved using any method provided in advance by the user as external function. This includes exact solvers or an adiabatic quantum annealer.

Pelofske, Elijah↗
DOE OSTI2023

Predicting chatter using machine learning and acoustic signals from low-cost microphones

Machining chatter is a phenomenon resulting from self-oscillation between a machining tool and workpiece. This self-oscillation results in variation on the machined product that reduces the ability to meet desired specifications. Chatter is a widely studied topic as it directly relates to the quality of machined products. Here, this study details the application of a Random Forest (RF) classifier with Recursive Feature Elimination (RFE) to machining audio collected by a single microphone during down-milling operations. This approach allows straightforward feature elimination that results in an easily understood set of analyzed dimensions. Stability is predicted solely based on the classification output of the RF classifier. Our approach proves highly predictive with consistent machining setup and a small sample set. We also review transferability between machining setups and present key findings. Our RF approach demonstrates the ability to analyze and classify chatter through a low-cost approach with limited training data required. The motivation for using a single microphone is to enable detection on machines without other sensors, such as accelerometers, present in the machining setup. The value of the in-process sensor and chatter classifier is highlighted because the machining setup included asymmetric dynamics that reduced the accuracy of the traditional analytical stability solution. We see a natural progression to deploying this audio-only methodology with real-time processing and classification using either a laptop or smartphone. This progression will allow visual indicators during the machining process that can alert machinists of progression into unstable machining processes.

42 ENGINEERING↗
DOE OSTI2025

Recurrent features of amplitudes in planar $\mathcal{N}$ = 4 super Yang-Mills theory

The planar three-gluon form factor for the chiral stress tensor operator in planar maximally supersymmetric Yang-Mills theory is an analog of the Higgs-to-three-gluon scattering amplitude in QCD. The amplitude (symbol) bootstrap program has provided a wealth of high-loop perturbative data about this form factor, with results up to eight loops available. The symbol of the form factor at L loops is given by words of length 2L in six letters with associated integer coefficients. In this paper, we analyze this data, describing patterns of zero coefficients and relations between coefficients. We find many sequences of words whose coefficients are given by closed-form expressions which we expect to be valid at any loop order. Moreover, motivated by our previous machine-learning analysis, we identify simple recursion relations that relate the coefficient of a word to the coefficients of particular lower-loop words. These results open an exciting door for understanding scattering amplitudes at all loop orders.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

An uncertainty-focused database approach to extract spatiotemporal trends from qualitative and discontinuous lake-status histories

Changes in lake status are often interpreted as palaeoclimate indicators due to their dependence on precipitation and evaporation. The Global Lake Status Database (GLSDB) has since long provided a standardised synopsis of qualitative lake status over the last 30,000 14C years. Potential sources of uncertainty however are not recorded in the GLSDB. Here we present an updated and improved relational-database framework that incorporates uncertainty in both chronology and the interpretation of palaeoenvironmental data. The database uses peer-reviewed palaeolimnological studies to produce a consensus on qualitative lake-status histories, whose chronologies are revised and standardized through the recalibration of radiocarbon dates and the application of Bayesian age-depth modelling for stratigraphic archives. Quantitative information on absolute water-level elevation is preserved if available from geomorphological sources. We also propose a new probabilistic analytical framework that accounts for these uncertainties to reconstruct synoptic, integrated environmental signals. The process is based on a Monte Carlo algorithm that iteratively samples individual lake-status histories within the limits of their uncertainties to produce many possible scenarios. We then use Recursively-Subtracted Empirical Orthogonal Function analysis to extract dominant patterns of lake-status variability from these scenarios. As a proof of concept, we apply this framework to 67 sites in eastern and southern Africa whose lake-status histories cover part of the late Pleistocene and/or Holocene. We show that, despite the sometimes large temporal and interpretation uncertainties, and the inclusion of highly discontinuous lake-status time series, identifying the major known millennial-scale climatic phases during the last 20,000 years is possible. Our framework was also able to identify an antiphased response between the lake basins in eastern and interior southern Africa to these changes. Here, we propose that our new database and methodology framework serves as a template for efficient lake-status data synthesis, encourages the incorporation of lake-status data in palaeoclimate syntheses, and expands the possibilities for the use of such data in the evaluation of climate models.

58 GEOSCIENCES↗
DOE OSTI2020

Online Parameter Estimation Methods for Adaptive Cruise Control Systems

Modeling Adaptive Cruise Control (ACC) vehicles enables the understanding of the impact of these vehicles on traffic flow. In this work, two online methods are used to provide real time system identification of ACC enabled vehicles. The first technique is a recursive least squares (RLS) approach, while the second method solves a nonlinear joint state and parameter estimation problem via particle filtering (PF). We provide a parameter identifiability analysis for both methods to analytically show that the model parameters are not identifiable using equilibrium driving. The accuracy and computational runtime of the online methods are compared to a commonly used offline simulation-based optimization (i.e., batch optimization) approach. The methods are tested on synthetic data as well as on empirical data collected directly from a 2019 model year ACC vehicle using data from sensors that are part of the stock ACC system. The online methods are scalable and provide comparable accuracy to the batch method. RLS runs in real time and is two orders of magnitude faster than the batch method for modest sized (e.g., 15 min) datasets. The particle filter also runs in real- time, and is also suitable in streaming applications in which the datasets can grow arbitrarily large.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2020

Reduce Operations: Send Volume Balancing While Minimizing Latency

Communication hypergraph model was introduced in a two-phase setting for encapsulating multiple communication cost metrics (bandwidth and latency), which are proven to be important in parallelizing irregular applications. In the first phase, computational-task-to-processor assignment is performed with the objective of minimizing total volume while maintaining computational load balance. In the second phase, communication-task-to-processor assignment is performed with the objective of minimizing total number of messages while maintaining communication-volume balance. The reduce-communication hypergraph model suffers from failing to correctly encapsulate send-volume balancing. We propose a novel vertex weighting scheme that enables part weights to correctly encode send-volume loads of processors for send-volume balancing. The model also suffers from increasing the total communication volume during partitioning. To decrease this increase, we propose a method that utilizes the recursive bipartitioning framework and refines each bipartition by vertex swaps. For performance evaluation, we consider column-parallel SpMV, which is one of the most widely known applications in which the reduce-task assignment problem arises. Extensive experiments on 313 matrices show that, compared to the existing model, the proposed models achieve considerable improvements in all communication cost metrics. Furthermore, these improvements lead to an average decrease of 30% in parallel SpMV time on 512 processors for 70 matrices with high irregularity.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Distributed Data-Driven Optimization for Voltage Regulation in Distribution Systems

Here, this paper proposes a distributed data-driven optimization framework for voltage regulation in distribution systems. The recursive kernel regression and alternating direction method of multipliers (ADMM) are selected to cover the system learning and distributed optimization tasks. The proposed distributed data-driven framework is capable of having a rapid response to system or load changes while considering the operation optimality. Besides, the distributed algorithm parallels the computation tasks and reduces the computational expense of a single agent. To validate the performance of the proposed method, a hypothetical 7-Bus system and the IEEE 123-Bus system are selected to show the effectiveness of the proposed data-driven framework. According to the numerical study results, the proposed method offers great flexibility for selecting customized kernel models for different regions and can effectively improve the system voltage profile in a distributed manner.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Game-Theoretic Strategies for Cyber-Physical Infrastructures Under Component Disruptions

In this work, networked infrastructures of recursively defined systems composed of discrete cyber and physical components are considered. The components of basic systems at the finest levels can be disrupted by cyber or physical means, and can be reinforced to survive at certain costs. A problem of ensuring the infrastructure performance is formulated as a game between a provider and an attacker, who probabilistically choose components to reinforce and attack, respectively. The disruptions of this infrastructure are characterized using the aggregate failure correlation function that specifies the conditional failure probability of the infrastructure given the failure of an individual system at that level. The survival probabilities of basic systems satisfy simple product-form, first-order differential equations expressed in terms of the multiplier functions. The utility functions of the provider and attacker are composed of the reward and cost terms, both expressed in terms of the component reinforcement and attack probabilities. The Nash equilibrium of this game is characterized, along with the sensitivity functions of the survival probabilities of basic systems that highlight their dependence individually on the cost-benefit terms, the correlation functions, and the multiplier functions. These results are illustrated using simplified models of a distributed cloud servers infrastructure, a 5G data network infrastructure, a high performance computing federation, and a smart energy grid infrastructure.

42 ENGINEERING↗
DOE OSTI2022

Resident and transient coyotes exhibit differential patterns of movement behavior across heterogeneous landscapes in the southeastern United States

Coyotes (Canis latrans) are a highly adaptable canid species whose behavioral plasticity has allowed them to persist in a wide array of habitats throughout North America. As generalists, coyotes can alter movement patterns and change territorial strategies between residency (high site fidelity) and transiency (low site fidelity) to maximize fitness. Uncertainty remains about resident and transient coyote movement patterns and habitat use because research has reached conflicting conclusions regarding patterns of habitat use by both groups. We quantified effects of habitat on resident and transient coyote movement behavior using first passage time (FPT) analysis, which assesses recursive movement along an individual's movement path to delineate where they exhibit area-restricted search (ARS) behaviors relative to habitat attributes. We quantified monthly movement rates for 171 coyotes (76 residents and 53 transients) and then used estimated FPT values in generalized linear mixed models to quantify monthly habitat use for resident and transient coyotes. Transients had greater movement rates than residents across all months except January. Resident FPT values were positively correlated with agricultural land cover during fall and winter, but negatively correlated with agriculture during spring. Resident FPT values were also negatively correlated with developed habitats during May–August, deciduous land cover during June–August, and wetlands during September–January except November. FPT values of transient coyotes were positively correlated with developed areas throughout much of the year and near wetlands during July–September. Transient FPT values were negatively correlated with agriculture during all months except June and July. High FPT values (ARS behavior) of residents and transients were generally correlated with greater densities of edge habitat. Although we observed high individual variation in space use, our study found substantive differences in habitat use between residents and transients, providing further evidence that complexity and plasticity of coyote habitat use is influenced by territorial strategy.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Celestial operator product expansions and w 1+∞ symmetry for all spins

The operator product expansion of massless celestial primary operators of arbitrary spin is investigated. Poincaré symmetry is found to imply a set of recursion relations on the operator product expansion coefficients of the leading singular terms at tree-level in a holomorphic limit. The symmetry constraints are solved by an Euler beta function with arguments that depend simply on the right-moving conformal weights of the operators in the product. These symmetry-derived coefficients are shown not only to match precisely those arising from momentum-space tree-level collinear limits, but also to obey an infinite number of additional symmetry transformations that respect the algebra of w 1+∞ . In tree-level minimally-coupled gravitational theories, celestial currents are constructed from light transforms of conformally soft gravitons and found to generate the action of w 1+∞ on arbitrary massless celestial primaries. Results include operator product expansion coefficients for fermions as well as those arising from higher-derivative non-minimal couplings of gluons and gravitons.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Efficiently evaluating loop integrals in the EFTofLSS using QFT integrals with massive propagators

We develop a new way to analytically calculate loop integrals in the Effective Field Theory of Large Scale-Structure. Previous available methods show severe limitations beyond the one-loop power spectrum due to analytical challenges and computational and memory costs. Our new method is based on fitting the linear power spectrum with cosmology-independent functions that resemble integer powers of quantum field theory massive propagators with complex masses. A remarkably small number of them is sufficient to reach enough accuracy. Similarly to former approaches, the cosmology dependence is encoded in the coordinate vector of the expansion of the linear power spectrum in our basis. We first produce cosmology-independent tensors where each entry is the loop integral evaluated on a given combination of basis vectors. For each cosmology, the evaluation of a loop integral amounts to contracting this tensor with the coordinate vector of the linear power spectrum. The 3-dimensional loop integrals for our basis functions can be evaluated using techniques familiar to particle physics, such as recursion relations and Feynman parametrization. We apply our formalism to evaluate the one-loop bispectrum of galaxies in redshift space. The final analytical expressions are quite simple and can be evaluated with little computational and memory cost. We show that the same expressions resolve the integration of all one-loop N-point function in the EFTofLSS. This method, which is originally presented here, has already been applied in the first one-loop bispectrum analysis of the BOSS data to constraint ΛCDM parameters and primordial non-Gaussianities [1, 2].

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Decomposition of Feynman integrals by multivariate intersection numbers

We present a detailed description of the recent idea for a direct decomposition of Feynman integrals onto a basis of master integrals by projections, as well as a direct derivation of the differential equations satisfied by the master integrals, employing multivariate intersection numbers. We discuss a recursive algorithm for the computation of multivariate intersection numbers, and provide three different approaches for a direct decomposition of Feynman integrals, which we dub the straight decomposition, the bottom-up decomposition, and the top-down decomposition. These algorithms exploit the unitarity structure of Feynman integrals by computing intersection numbers supported on cuts, in various orders, thus showing the synthesis of the intersection-theory concepts with unitarity-based methods and integrand decomposition. We perform explicit computations to exemplify all of these approaches applied to Feynman integrals, paving a way towards potential applications to generic multi-loop integrals.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Electromagnetic duality and D3-brane scattering amplitudes beyond leading order

We use on-shell methods to study the non-supersymmetric and supersymmetric low-energy S-matrix on a probe D3-brane, including both the 1-loop contributions of massless states as well as the effects of higher-derivative operators. Our results include: (1) A derivation of the duality invariance of Born-Infeld electrodynamics as the dimensional oxidation of the group of spatial rotations transverse to a probe M2-brane; this is done using a novel implementation of subtracted on-shell recursion. (2) The first explicit loop-level BCJ double-copy in a non-gravitational model, namely the calculation of the 4-point self-dual amplitude of non-supersymmetric Born-Infeld. (3) From previous results for n-point self-dual 1-loop BI amplitudes and the conjectured dimension-shifting relations in Yang-Mills, we obtain an explicit all-multiplicity, at all orders in E, expression for the 1-loop integrand of the MHV sector of N = 4 DBI. (4) For all n > 4, the explicitly integrated duality-violating 1-loop amplitudes (self-dual and next-to-self-dual in pure BI as well as MHV in N = 4 DBI) are shown to be removable at O(ε 0 ) by adding finite local counterterms; we propose that this may be true more generally at 1-loop order. (5) We find that in non-supersymmetric Born-Infeld, not all finite local counterterms needed to restore electromagnetic duality can be constructed using the double-copy with higher-derivative corrections, suggesting a fundamental tension between electromagnetic duality and color-kinematics duality at loop-level. Finally we comment on oxidation of duality symmetries in supergravity and the parallels it has to the M2-brane to D3-brane oxidation demonstrated in this paper.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Geometric soft theorems

We derive a universal soft theorem for every scattering amplitude with at least one massless particle in an arbitrary theory of scalars. Our results follow from the geometry of field space and are valid for any choice of mass spectrum, potential terms, and higher-derivative interactions. For a vanishing potential, the soft limit of every amplitude is equal to the field-space covariant derivative of an amplitude with one fewer particle. Furthermore, the Adler zero and the dilaton soft theorem are special cases of our results. We also discuss more exotic scenarios in which the soft limit is non-trivial but still universal. Last but not least, we derive new theorems for multiple-soft limits which directly probe the field-space curvature, as well as on-shell recursion relations applicable to two-derivative scalar field theories exhibiting no symmetries whatsoever.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Open string amplitudes: singularities, asymptotics and new representations

Open string amplitudes at tree level have been studied for over fifty years. However, there is no known analytic form for general n-point amplitudes, and their conventional representation in terms of worldsheet integrals does not make many of their most basic physical properties manifest. Recently, a formulation of these amplitudes exposing the underlying “binary geometry” via the use of “u” variables has given us many insights into their basic features. In this paper, we initiate a systematic exploration of fundamental aspects of open string amplitudes from this new point of view. We begin by finding explicit expressions for the factorization of amplitudes at general massive levels, which are seen to be determined by products of lower-point massless amplitudes with shifted kinematics. We then study the asymptotic behavior when subsets of kinematic variables become large, delineating regimes with exponential (generalized hard scattering) and power-law (generalized Regge) behavior. We also give precise expressions for the asymptotics, which reveal another example of the recently observed property of factorization away from poles. We derive new recursion relations for the amplitude, which when repeatedly applied reduce to infinite series representations with a wider domain of convergence than the usual integral representations. For the five-point case, we present a new closed-form expression for the amplitude that for the first time gives its analytic continuation to all of kinematic space. We also discuss novel relations between amplitudes at different kinematic points following from the recently observed “split” factorizations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗