Search NASA⌕ Search

SEARCH · Search NASA

Results for “Recursion”

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 OSTI2023

Pileup and Infrared Radiation Annihilation (PIRANHA): a paradigm for continuous jet grooming

Jet grooming is an important strategy for analyzing relativistic particle collisions in the presence of contaminating radiation. Most jet grooming techniques introduce hard cutoffs to remove soft radiation, leading to discontinuous behavior and associated experimental and theoretical challenges. In this paper, we introduce Pileup and Infrared Radiation Annihilation (Piranha), a paradigm for continuous jet grooming that overcomes the discontinuity and infrared sensitivity of hard-cutoff grooming procedures. We motivate Piranha from the perspective of optimal transport and the Energy Mover’s Distance and review Apollonius Subtraction and Iterated Voronoi Subtraction as examples of Piranha-style grooming. We then introduce a new tree-based implementation of Piranha, Recursive Subtraction, with reduced computational costs. Finally, we demonstrate the performance of Recursive Subtraction in mitigating sensitivity to soft distortions from hadronization and detector effects, and additive contamination from pileup and the underlying event.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2018

Jet charge and machine learning

Modern machine learning techniques, such as convolutional, recurrent and recursive neural networks, have shown promise for jet substructure at the Large Hadron Collider. For example, they have demonstrated effectiveness at boosted top or W boson identification or for quark/gluon discrimination. We explore these methods for the purpose of classifying jets according to their electric charge. We find that both neural networks that incorporate distance within the jet as an input and boosted decision trees including radial distance information can provide significant improvement in jet charge extraction over current methods. Specifically, convolutional, recurrent, and recursive networks can provide the largest improvement over traditional methods, in part by effectively utilizing distance within the jet or clustering history. Furthermore, the advantages of using a fixed-size input representation (as with the CNN) or a small input representation (as with the RNN) suggest that both convolutional and recurrent networks will be essential to the future of modern machine learning at colliders.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2019

Soft bootstrap and effective field theories

The soft bootstrap program aims to construct consistent effective field theories (EFT’s) by recursively imposing the desired soft limit on tree-level scattering amplitudes through on-shell recursion relations. A prime example is the leading two-derivative operator in the EFT of SU(N) × SU(N)/SU(N) nonlinear sigma model (NLSM), where O(p 2 ) amplitudes with an arbitrary multiplicity of external particles can be soft-bootstrapped. We extend the program to O(p 4 ) operators and introduce the “soft blocks,” which are the seeds for soft bootstrap. The number of soft blocks coincides with the number of independent operators at a given order in the derivative expansion and the incalculable Wilson coefficient emerges naturally. We also uncover a new soft-constructible EFT involving the “multi-trace” operator at the leading two-derivative order, which is matched to SO(N + 1)/SO(N) NLSM. In addition, we consider Wess-Zumino-Witten (WZW) terms, the existence of which, or the lack thereof, depends on the number of flavors in the EFT, after a novel application of Bose symmetry. Remarkably, we find agreements with grouptheoretic considerations on the existence of WZW terms in SU(N) NLSM for N ≥ 3 and the absence of WZW terms in SO(N) NLSM for N 6= 5.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Open associahedra and scattering forms

We continue the study of open associahedra associated with bi-color scattering amplitudes initiated in ref. [1]. We focus on the facet geometries of the open associahedra, uncovering many new phenomena such as fiber-product geometries. We then provide novel recursion procedures for calculating the canonical form of open associahedra, generalizing recursion relations for bounded polytopes to unbounded polytopes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2018

A Refined Global Segmentation of X-Ray CT Images for Multi-phase Geomaterials

X-ray computed tomography images of three-phase silica sand and glass bead specimens are analyzed and used to evaluate the segmentation performances of Otsu-, and recursion-based multilevel algorithms. A global image segmentation technique that combines iterative and recursive algorithms, namely a refined statistics-based global segmentation is proposed for segmenting multi-phase granular geomaterials. The performance of the proposed algorithm is tested by segmenting partially saturated silica sand and glass bead specimens. For the tested silica sand specimen, the refined statistics method estimated void ratio and degree of saturation were 0.67 and 39.35%. The estimates for the glass bead specimen yielded 0.64 and 43.49%, respectively. The true void ratio (0.66) and degree of saturation (37.71%) were determined with a user-controlled Image processing software package—Image-Pro. It was found that the proposed method estimated the void ratio and the degree of saturation with 1.52 and 4.35 percent errors for the silica sand and with 15.63 and 0.34 percent errors for the glass bead, respectively. The computational time of the proposed method was found to be shorter than other methods considered. Overall, it is concluded that the proposed technique performed better in segmenting three-phase granular geomaterials.

42 ENGINEERING↗
DOE OSTI2020

Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer

NP-hard problems such as the maximum clique or minimum vertex cover problems, two of Karp’s 21 NP-hard problems, have several applications in computational chemistry, biochemistry and computer network security. Adiabatic quantum annealers can search for the optimum value of such NP-hard optimization problems, given the problem can be embedded on their hardware. However, this is often not possible due to certain limitations of the hardware connectivity structure of the annealer. This paper studies a general framework for a decomposition algorithm for NP-hard graph problems aiming to identify an optimal set of vertices. Our generic algorithm allows us to recursively divide an instance until the generated subproblems can be embedded on the quantum annealer hardware and subsequently solved. Furthermore, the framework is applied to the maximum clique and minimum vertex cover problems, and we propose several pruning and reduction techniques to speed up the recursive decomposition. The performance of both algorithms is assessed in a detailed simulation study.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Optimization of collision-free paths in a differential-drive robot by a smoothing piecewise-linear approach

This paper presents a methodology for optimizing pre-calculated collision-free paths of differential-drive wheeled robots. The main advantage of this methodology is that optimization is done by considering the kinematics and mechanical constraints of the mobile robot. In accordance to this proposal, the optimized path is achieved by applying recursively a local smoothing on an initial path which is originally modeled as a one-dimensional piecewise linear function. By this recursive smoothing, it can be ensured that the original piecewise linear function can be transformed into a smooth one that fulfill the constraints established by the kinematic equations of the wheeled mobile in terms of a minimum radius of curvature. As a result of this, a trajectory which guarantees lower power consumption and lower mechanical wear, is obtained. To show the better performance of the proposed approach, numerical simulation results are contrasted to those obtained from other reported methods with regards to path length, minimum radius of curvature, cross track error, continuity and resulting acceleration.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Green’s functions on a renormalized lattice: An improved method for the integer quantum Hall transition

Highlights: • Speed up of numerical calculations by exact renormalization group steps. • Practical approach to handle delicate scaling analysis. • Absence of evidence to prefer marginal corrections over power-law corrections. We introduce a performance-optimized method to simulate localization problems on bipartite tight-binding lattices. It combines an exact renormalization group step to reduce the sparseness of the original problem with the recursive Green’s function method. We apply this framework to investigate the critical behavior of the integer quantum Hall transition of a tight-binding Hamiltonian defined on a simple square lattice. In addition, we employ an improved scaling analysis that includes two irrelevant exponents to characterize the shift of the critical energy as well as the corrections to the dimensionless Lyapunov exponent. We compare our findings with the results of a conventional implementation of the recursive Green’s function method, and we put them into broader perspective in view of recent development in this field.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

A systematic comparison of machine learning methods for modeling of dynamic processes applied to combustion emission rate modeling

Ten established, data-driven dynamic algorithms are surveyed and a practical guide for understanding these methods generated. Existing Python programming packages for implementing each algorithm are acknowledged, and the model equations necessary for prediction are presented. A case study on a coal-fired power plant’s NO x emission rates is performed, directly comparing each modeling method’s performance on a mutual system. Each model is evaluated by its root mean squared error (RMSE) on out-of-sample future horizon predictions. Optimal hyperparameters are identified using either an exhaustive search or genetic algorithm. The top five model structures of each method are used to recursively predict future NO x emission rates over a 60-step time horizon. The RMSE at each future timestep is determined, and the recursive output prediction trends compared against measurements in time. The GRU neural network is identified as the best candidate for representing the system, demonstrating accurate and stable predictions across the future horizon by all considered models, while satisfactory performance was observed in several of the ARX/NARX formulations. Finally, these efforts have contributed 1) a concise resource of multiple proven dynamic machine learning methods, 2) a practical guide explaining the use of these methods, effectively lowering the “barrier-to-entry” of deploying such models in control systems, 3) a comparison study evaluating each method’s performance on a mutual system, 4) demonstration of accurate multi-timestep emissions modeling suitable for systems-level control, and 5) generalizable results demonstrating the suitability of each method for prediction over a multi-step future horizon to other complex dynamic systems.

42 ENGINEERING↗
DOE OSTI2020

Time-series machine-learning error models for approximate solutions to parameterized dynamical systems

This work proposes a machine-learning framework for modeling the error incurred by approximate solutions to parameterized dynamical systems. In particular, we extend the machine-learning error models (MLEM) framework proposed in Ref. Freno and Carlberg (2019) to dynamical systems. The proposed Time-Series Machine-Learning Error Modeling (T-MLEM) method constructs a regression model that maps features – which comprise error indicators that are derived from standard a posteriori error-quantification techniques – to a random variable for the approximate-solution error at each time instance. The proposed framework considers a wide range of candidate features, regression methods, and additive noise models. We consider primarily recursive regression techniques developed for time-series modeling, including both classical time-series models (e.g., autoregressive models) and recurrent neural networks (RNNs), but also analyze standard non-recursive regression techniques (e.g., feed-forward neural networks) for comparative purposes. Finally, numerical experiments conducted on multiple benchmark problems illustrate that the long short-term memory (LSTM) neural network, which is a type of RNN, outperforms other methods and yields substantial improvements in error predictions over traditional approaches.

42 ENGINEERING↗
DOE OSTI2023

Moving-horizon false data injection attack design against cyber–physical systems

Systematic attack design is essential to understanding the vulnerabilities of cyber–physical systems (CPSs), to better design for resiliency. In particular, false data injection attacks (FDIAs) are well-known and have been shown to be capable of bypassing bad data detection (BDD) while causing targeted biases in resulting state estimates. However, their effectiveness against moving horizon estimators (MHE) is not well understood. In fact, this paper shows that conventional FDIAs are generally ineffective against MHE. One of the main reasons is that the moving window renders the static FDIA recursively infeasible. Here, this paper proposes a new attack methodology, moving-horizon FDIA (MH-FDIA), by considering both the performance of historical attacks and the current system’s status. Theoretical guarantees for successful attack generation and recursive feasibility are given. Numerical simulations on the IEEE-14 bus system further validate the theoretical claims and show that the proposed MH-FDIA outperforms state-of-the-art counterparts in both stealthiness and effectiveness. In addition, an experiment on a path-tracking control system of an autonomous vehicle shows the feasibility of the MH-FDIA in real-world nonlinear systems.

42 ENGINEERING↗
DOE OSTI2023

Fast approximation to supershell partition functions: Explicit forms of the coefficients

In a previous work, we derived a formula for supershell partition functions, which are the cornerstone of the Super-Transition-Array approach to radiative-opacity calculations. The new expression takes the form of a functional of the distribution of energies within the supershell and allows for fast and accurate computations, truncating the number of terms in the expansion. The latter involves coefficients (denoted Γ $k$ ) for which we obtained a recursion relation. In the present short paper, as a complement of the previous one, we give an explicit formula for the coefficients Γ $k$ . Another recursion relation is also provided, as well as an alternative expression involving Bell polynomials. In conclusion, the connections with cycle indexes of permutation groups and with elementary symmetric polynomials are outlined.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Active Suspension Parameters Identification: An Algebraic Approach and its Application to Suspension Travel Control

The parameters of an active suspension need to be identified online, such that the suspension control system can be adapted to mechanical wear and load change. Recursive least squares and observer-based methods are frequently utilized to fulfill this purpose. However, they can yield slow parameter identification due to their asymptotic nature. We propose an algebraic identifier to estimate the parameters of an active suspension online, which does not maintain an asymptotic convergence phase. Simulation results demonstrate the effectiveness of the proposed algebraic approach.

Wang, Zejiang↗
DOE OSTI2022

High-dimensional methods for quantum homodyne tomography

We provide optimized recursion relations for homodyne tomography. We improve previous methods by mitigating the divergences intrinsic in the calculation of the pattern functions used previously, and detail how to implement the data analysis through Monte Carlo simulations. Our refinements are necessary for the reconstruction of excited quantum states which populate a high-dimensional subspace of the electromagnetic field Hilbert space. •Stabilization of numerics for quantum homodyne tomography reconstructions.•High dimensional quantum homodyne tomography reconstruction.•Monte Carlo simulations of quantum homodyne tomography.•Quantum Homodyne tomography simulations.

Mosco, Nicola↗
DOE OSTI2023

Machine Learning Prediction of the Experimental Transition Temperature of Fe(II) Spin-Crossover Complexes

Spin-crossover (SCO) complexes are materials that exhibit changes in the spin state in response to external stimuli, with potential applications in molecular electronics. It is challenging to know a priori how to design ligands to achieve the delicate balance of entropic and enthalpic contributions needed to tailor a transition temperature close to room temperature. Here, we leverage the SCO complexes from the previously curated SCO-95 data set [Vennelakanti et al. J. Chem. Phys. 159, 024120 (2023)] to train three machine learning (ML) models for transition temperature (T 1/2 ) prediction using graph-based revised autocorrelations as features. We perform feature selection using random forest-ranked recursive feature addition (RF-RFA) to identify the features essential to model transferability. Of the ML models considered, the full feature set RF and recursive feature addition RF models perform best, achieving moderate correlation to experimental T 1/2 values. We then compare ML T 1/2 predictions to those from three previously identified best-performing density functional approximations (DFAs) which accurately predict SCO behavior across SCO-95, finding that the ML models predict T 1/2 more accurately than the best-performing DFAs. In addition, we study ML model predictions for a set of 18 SCO complexes for which only estimated T 1/2 values are available. Upon excluding outliers from this set, the RF-RFA RF model shows a strong correlation to estimated T 1/2 values with a Pearson’s r of 0.82. In contrast, DFA-predicted T 1/2 values have large errors and show no correlation to estimated T 1/2 values over the same set of complexes. Overall, our study demonstrates slightly superior performance of ML models in comparison with some of the best-performing DFAs, and we expect ML models to improve further as larger data sets of SCO complexes are curated and become available for model training.

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

Models and Algorithms for Equilibrium Analysis of Mixed-Material Nucleic Acid Systems

Dynamic programming algorithms within the NUPACK software suite enable analysis of equilibrium base-pairing properties for complex and test tube ensembles containing arbitrary numbers of interacting nucleic acid strands. Currently, calculations are limited to single-material systems that are either all-RNA or all-DNA. Here, to enable analysis of mixed-material systems that are critical for modern applications in vitro, in situ, and in vivo, we develop physical models and dynamic programming algorithms that allow the material of the system to be specified at nucleotide resolution. Free energy parameter sets are constructed for both RNA/DNA and RNA/2'OMe-RNA mixed-material systems by combining available empirical mixed-material parameters with single-material parameter sets to enable treatment of the full complex and test tube ensembles. New dynamic programming recursions account for the material of each nucleotide throughout the recursive process. For a complex with N nucleotides, the mixed-material dynamic programming algorithms maintain the O(N 3 ) time complexity of the single-material algorithms, enabling efficient calculation of diverse physical quantities over complex and test tube ensembles (e.g., complex partition function, equilibrium complex concentrations, equilibrium base-pairing probabilities, minimum free energy secondary structure(s), and Boltzmann-sampled secondary structures) at a cost increase of roughly 2.0-3.5×. The results of existing single-material algorithms are exactly reproduced when applying the new mixed-material algorithms to single-material systems. Accuracy is significantly enhanced using mixed-material models and algorithms to predict RNA/DNA and RNA/2'OMe-RNA duplex melting temperatures from the experimental literature as well as RNA/DNA melt profiles from new experiments. In conclusion, mixed-material analyses can be performed online using the NUPACK web app (www.nupack.org) or locally using the NUPACK Python module.

2′OMe-RNA↗
DOE OSTI2019

Non-iterative characteristics analysis for high-pressure ramp loading

Here in the canonical ramp compression experiment, a smoothly increasing load is applied to the surface of the sample, and the particle velocity history is measured at two or more different distances into the sample, at interfaces where the surface of the sample can be probed. The velocity histories are used to deduce a stress-density relation, usually using iterative Lagrangian analysis to account for the perturbing effect of the impedance mismatch at the interface. In that technique, a stress-density relation is assumed in order to correct for the perturbation and is adjusted until it becomes consistent with the deduced stress-density relation. This process is subject to the usual difficulties of nonlinear optimization, such as the existence of local minima (sensitivity to the initial guess), possible failure to converge, and relatively large computational effort. We show that, by considering the interaction of successive characteristics reaching a free surface, the stress-density relation can be deduced directly by recursion rather than iteration. This calculation is orders of magnitude faster than iterative analysis and does not require an initial guess. Direct recursion may be less suitable for very noisy data, but it was robust when applied to trial data. The stress-density relation deduced was identical to the result from iterative Lagrangian analysis.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Distribution of centrality measures on undirected random networks via the cavity method

The Katz centrality of a node in a complex network is a measure of the node’s importance as far as the flow of information across the network is concerned. For ensembles of locally tree-like undirected random graphs, this observable is a random variable. Its full probability distribution is of interest but difficult to handle analytically because of its “global” character and its definition in terms of a matrix inverse. Leveraging a fast Gaussian Belief Propagation-Cavity algorithm to solve linear systems on tree-like structures, we show that i) the Katz centrality of a single instance can be computed recursively in a very fast way, and ii) the probability P ( K ) that a random node in the ensemble of undirected random graphs has centrality K satisfies a set of recursive distributional equations, which can be analytically characterized and efficiently solved using a population dynamics algorithm. We test our solution on ensembles of Erdős-Rényi and Scale Free networks in the locally tree-like regime, with excellent agreement. The analytical distribution of centrality for the configuration model conditioned on the degree of each node can be employed as a benchmark to identify nodes of empirical networks with over- and underexpressed centrality relative to a null baseline. We also provide an approximate formula based on a rank- 1 projection that works well if the network is not too sparse, and we argue that an extension of our method could be efficiently extended to tackle analytical distributions of other centrality measures such as PageRank for directed networks in a transparent and user-friendly way.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗