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 343 records · Page 19

Advancing Tassel Detection and Counting: Annotation and Algorithms

Tassel counts provide valuable information related to flowering and yield prediction in maize, but are expensive and time-consuming to acquire via traditional manual approaches. High-resolution RGB imagery acquired by unmanned aerial vehicles (UAVs), coupled with advanced machine learning approaches, including deep learning (DL), provides a new capability for monitoring flowering. In this article, three state-of-the-art DL techniques, CenterNet based on point annotation, task-aware spatial disentanglement (TSD), and detecting objects with recursive feature pyramids and switchable atrous convolution (DetectoRS) based on bounding box annotation, are modified to improve their performance for this application and evaluated for tassel detection relative to Tasselnetv2+. The dataset for the experiments is comprised of RGB images of maize tassels from plant breeding experiments, which vary in size, complexity, and overlap. Results show that the point annotations are more accurate and simpler to acquire than the bounding boxes, and bounding box-based approaches are more sensitive to the size of the bounding boxes and background than point-based approaches. Overall, CenterNet has high accuracy in comparison to the other techniques, but DetectoRS can better detect early-stage tassels. The results for these experiments were more robust than Tasselnetv2+, which is sensitive to the number of tassels in the image.

54 ENVIRONMENTAL SCIENCES↗

Factors Controlling a Synthetic Aperture Radar (SAR) Derived Root-Zone Soil Moisture Product over The Seward Peninsula of Alaska

Root-zone soil moisture exerts a fundamental control on vegetation, energy balance, and the carbon cycle in Arctic ecosystems, but it is still not well understood in vast, remote, and understudied regions of discontinuous permafrost. The root-zone soil moisture product (30 m resolution) used in this analysis was retrieved from a time-series P-Band (420–440 MHz) synthetic aperture radar (SAR) backscatter observations (August 2017 & October 2017). While similar approaches have been taken to retrieve surface (0 cm to 5 cm) soil moisture from L-Band (1.2 GHz) SAR backscatter, this is one of the first known attempts at reaching the root-zone in permafrost regions. Here, we analyze secondary factors (excluding primary factors, such as precipitation) controlling summer (August) soil moisture at depths of 6 cm, 12 cm, and 20 cm over a 4500 km2 area on the Seward Peninsula of Alaska. Using a random forest model, we quantify the impact of topography, vegetation, and meteorological factors on soil moisture distributions. In developing the random forest model, we explore a variety of feature scales (30 m, 60 m, 90 m, 120 m, 180 m, and 240 m), tune hyperparameters (the structure of individual decision trees making up the ensemble including the number and depth of trees), and perform the final feature selection using cross-validated recursive feature elimination. Results suggest that root-zone soil moisture on the Seward Peninsula is primarily controlled by vegetation at 6 cm, but deeper in the soil column topography and meteorological factors, such as predominant winter wind direction and summer insolation, play a larger role. The random forest model accounts for 40% to 60% of the variation observed (R2 = 0.44 at 6 cm, R2 = 0.52 at 12 cm, R2 = 0.58 at 20 cm). These results indicate that vegetation is the dominant control on soil moisture shallow in the soil column, but the impact of vegetation does not extend to deeper layers retrieved from P-Band SAR backscatter.

Dann, Julian↗

Impacts of U.S. Carbon Tariffs on China’s Foreign Trade and Social Welfare

A recursive multisector dynamic computable general equilibrium (DCGE) model simulates the economic impacts of carbon tariffs, as proposed by the USA, ranging from $\$40/t to $\$60/t CO 2 . We examine a carbon tax and export subsidy as response policies to the U.S. carbon tariff, respectively. The dynamic model shows the possible impacts of these policies on China’s economic structure, carbon emissions, and social welfare from 2020 to 2030. Simulations show that a carbon tariff changes the structure of China’s exports and promotes trade diversion from the USA to other countries and regions. A domestic carbon tax and subsidy policy can dampen the adverse impacts of carbon tariffs on trade. A carbon tax shows an effective impact on increasing clean energy use, decreasing the carbon intensity of output, and reducing carbon emissions. A subsidy on exports to the USA reduces the adverse impact of a carbon tariff on China’s social welfare in the short term.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Quantum Circuits for the Preparation of Spin Eigenfunctions on Quantum Computers

The application of quantum algorithms to the study of many-particle quantum systems requires the ability to prepare wave functions that are relevant in the behavior of the system under study. Hamiltonian symmetries are important instruments used to classify relevant many-particle wave functions and to improve the efficiency of numerical simulations. In this work, quantum circuits for the exact and approximate preparation of total spin eigenfunctions on quantum computers are presented. Two different strategies are discussed and compared: exact recursive construction of total spin eigenfunctions based on the addition theorem of angular momentum, and heuristic approximation of total spin eigenfunctions based on the variational optimization of a suitable cost function. The construction of these quantum circuits is illustrated in detail, and the preparation of total spin eigenfunctions is demonstrated on IBM quantum devices, focusing on three- and five-spin systems on graphs with triangle connectivity.

97 MATHEMATICS AND COMPUTING↗

Automated Detection of Instability-Inducing Channel Geometry Transitions in Saint-Venant Simulation of Large-Scale River Networks

A new sweep-search algorithm (SSA) is developed and tested to identify the channel geometry transitions responsible for numerical convergence failure in a Saint-Venant equation (SVE) simulation of a large-scale open-channel network. Numerical instabilities are known to occur at “sharp” transitions in discrete geometry, but the identification of problem locations has been a matter of modeler’s art and a roadblock to implementing large-scale SVE simulations. The new method implements techniques from graph theory applied to a steady-state 1D shallow-water equation solver to recursively examine the numerical stability of each flowpath through the channel network. The SSA is validated with a short river reach and tested by the simulation of ten complete river systems of the Texas–Gulf Coast region by using the extreme hydrological conditions recorded during hurricane Harvey. The SSA successfully identified the problematic channel sections in all tested river systems. Subsequent modification of the problem sections allowed stable solution by an unsteady SVE numerical solver. The new SSA approach permits automated and consistent identification of problem channel geometry in large open-channel network data sets, which is necessary to effectively apply the fully dynamic Saint-Venant equations to large-scale river networks or for city-wide stormwater networks.

54 ENVIRONMENTAL SCIENCES↗

Counting abelian squares efficiently for a problem in quantum computing

Here, I describe how the number of abelian squares of given length relates to a certain problem in theoretical quantum computing, and I present a recursive formula for calculating the number of abelian squares of length t+t over an alphabet of size d. The presented formula is similar to previously known formula but has substantially lower complexity for large d, a key improvement resulting in a practical solution to the original application.

97 MATHEMATICS AND COMPUTING↗

Mind the crosscap: $τ$-scaling in non-orientable gravity and time-reversal-invariant systems

Spectral statistics of quantum chaotic systems are governed by random matrix universality. In many cases of interest, time-reversal symmetry selects the Gaussian Orthogonal Ensemble (GOE) as the relevant universality class. In holographic CFTs, this is mirrored by the presence of non-orientable geometries in the dual gravitational path integral. In this work, we analyze general properties of these matrix models and their gravitational counterparts. First, we develop a formalism to express the universal level statistics in the canonical ensemble for arbitrary spectral curves, leading to a topological expansion with finite radius of convergence in the late-time $τ$-scaling limit. Then, we focus on topological gravity and study topological recursion on the moduli space of non-orientable surfaces. We find that the Weil-Petersson volumes display non-analytic behaviour multiplying polynomials in the boundary lengths. The volumes give rise to wormholes with late-time divergences, in contrast with the orientable case, which is finite. We identify systematic cancellations among WP volumes implied by the consistency and finiteness of the $τ$-scaling limit. In particular, the cancellation of late-time divergences requires a nontrivial genus resummation. Working in the gravitational microcanonical ensemble, we derive and resum all orders of the topological expansion matching the GOE matrix model in the high-energy regime.

Chaotic Dynamics (nlin.CD)↗

Stochastic Short-term High-resolution Prediction of Solar Irradiance and Photovoltaic Power Output

The increased penetration of solar photovoltaic (PV) energy sources into electric grids has increased the need for accurate modeling and prediction of solar irradiance and power production. Existing modeling and prediction techniques focus on long-term low-resolution prediction over minutes to years. This paper examines the stochastic modeling and short-term high-resolution prediction of solar irradiance and PV power output. We propose a stochastic state-space model to characterize the behaviors of solar irradiance and PV power output. This prediction model is suitable for the development of optimal power controllers for PV sources. A filter-based expectation-maximization and Kalman filtering mechanism is employed to estimate the parameters and states in the state-space model. The mechanism results in a finite dimensional filter which only uses the first and second order statistics. The structure of the scheme contributes to a direct prediction of the solar irradiance and PV power output without any linearization process or simplifying assumptions of the signal’s model. This enables the system to accurately predict small as well as large fluctuations of the solar signals. The mechanism is recursive allowing the solar irradiance and PV power to be predicted online from measurements. The mechanism is tested using solar irradiance and PV power measurement data collected locally in our lab.

Melin, Alexander M.↗

Control of Networked Traffic Flow Distribution - A Stochastic Distribution System Perspective

Networked traffic flow is a common scenario for urban transportation, where the distribution of vehicle queues either at controlled intersections or highway segments reflect the smoothness of the traffic flow in the network. At signalized intersections, the traffic queues are controlled by traffic signal control settings and effective traffic lights control would realize both smooth traffic flow and minimize fuel consumption. Funded by the Energy Efficient Mobility Systems (EEMS) program of the Vehicle Technologies Office of the US Department of Energy, we performed a preliminary investigation on the modelling and control framework in context of urban network of signalized intersections. In specific, we developed a recursive input-output traffic queueing models. The queue formation can be modeled as a stochastic process where the number of vehicles entering each intersection is a random number. Further, we proposed a preliminary B-Spline stochastic model for a one-way single-lane corridor traffic system based on theory of stochastic distribution control.. It has been shown that the developed stochastic model would provide the optimal probability density function (PDF) of the traffic queueing length as a dynamic function of the traffic signal setting parameters. Based upon such a stochastic distribution model, we have proposed a preliminary closed loop framework on stochastic distribution control for the traffic queueing system to make the traffic queueing length PDF follow a target PDF that potentially realizes the smooth traffic flow distribution in a concerned corridor.

Wang, Hong↗

System for detecting objects in streaming 3D images formed from data acquired with a medium penetrating sensor

A detection system that detects subsurface objects within a medium and estimates various features of the objects is provided. The detection system receives a streaming sequence of image frames of the medium at various along-medium locations. An image frame contains voxel values (intensities) representing characteristics of the medium across the medium and in the depth (range) direction. The detection system depth-compensates the intensities for determining which voxels are part of an object using an unsupervised binary classifier. The detection system then connects object voxels into distinct objects and recursively estimates the features of those objects as the image frames stream based on the locations and intensities of the object voxels.

Paglieroni, David W.↗

Methods for generating barcoded combinatorial libraries

Provided herein are methods and composition for trackable genetic variant libraries. Further provided herein are methods and compositions for recursive engineering. Further provided herein are methods and compositions for multiplex engineering. Further provided herein are methods and compositions for enriching for editing and trackable engineered sequences and cells using nucleic acid-guided nucleases.

59 BASIC BIOLOGICAL SCIENCES↗

Development and Calibration of an Online Energy Model for AHU Fan

The model development is necessary for the study of the energy consumption of Heating, Ventilation, and Air Conditioning (HVAC) systems. To predict the HVAC energy consumption accurately, one needs to model the individual HVAC components either from the measured data or based on the knowledge of the underlying physical phenomenon. Online model characterization is critical for improving the performance of real-time model-based fault detection and diagnosis (FDD) strategies. For HVAC control, models can be used to optimize the supervisory and local feedback control strategies to improve the energy consumption efficiency, or for providing ancillary services to the grid. It has been reported that, fans in HVAC systems of commercial buildings alone can provide substantial frequency regulation service, with little change in the indoor environment. In this paper, a real-time data-driven Air Handling Unit (AHU) fan model was developed based on recursive multi regression model. A generic nonlinear polynomial model has been studied to cover scenarios with different combinations of measurement variables, variable orders as well as different training and prediction horizons. Typical measurements including static pressure, mass flow rate, and damper positions are utilized as inputs to model the power consumption of the fan. The developed models have been validated both with simulation data from EnergyPlus-Dymola co-simulation model and with field measurement data for small to medium commercial buildings. The validation results show that the online model proposed can provide an effective prediction of the AHU fan power consumption.

Dong, Jin↗

Methods for generating barcoded combinatorial libraries

Provided herein are methods and composition for trackable genetic variant libraries. Further provided herein are methods and compositions for recursive engineering. Further provided herein are methods and compositions for multiplex engineering. Further provided herein are methods and compositions for enriching for editing and trackable engineered sequences and cells using nucleic acid-guided nucleases.

59 BASIC BIOLOGICAL SCIENCES↗

Methods for generating barcoded combinatorial libraries

Provided herein are methods and composition for trackable genetic variant libraries. Further provided herein are methods and compositions for recursive engineering. Further provided herein are methods and compositions for multiplex engineering. Further provided herein are methods and compositions for enriching for editing and trackable engineered sequences and cells using nucleic acid-guided nucleases.

59 BASIC BIOLOGICAL SCIENCES↗

Efficient track-before detect algorithm with minimal prior knowledge

Apparatus, system and method for tracking an image target in a system, wherein a system receives an image comprising a plurality of pixels. The received image is processed via a plurality of different recursive motion model kernels in parallel to provide a plurality of kernel outputs, wherein each of the motion model kernels may include a respective pixel mask. Per-pixel energy is estimated of at least some of the plurality of kernel outputs. Velocity of at least one of the image pixels may also be estimated by generating a directional energy vector for each motion model kernel. The per-pixel energy and velocity estimates are fused to produce a fused estimate representing at least some of the motion model kernels for the image.

42 ENGINEERING↗

Graph Partitioning and Sparse Matrix Ordering using Reinforcement Learning and Graph Neural Networks

We present a novel method for graph partitioning, based on reinforcement learning and graph convolutional neural networks. Our approach is to recursively partition coarser representations of a given graph. The neural network is implemented using SAGE graph convolution layers, and trained using an advantage actor critic (A2C) agent. We present two variants, one for finding an edge separator that minimizes the normalized cut or quotient cut, and one that finds a small vertex separator. The vertex separators are then used to construct a nested dissection ordering to permute a sparse matrix so that its triangular factorization will incur less fill-in. The partitioning quality is compared with partitions obtained using METIS and SCOTCH, and the nested dissection ordering is evaluated in the sparse solver SuperLU. Our results show that the proposed method achieves similar partitioning quality as METIS and SCOTCH. Furthermore, the method generalizes across different classes of graphs, and works well on a variety of graphs from the SuiteSparse sparse matrix collection.

97 MATHEMATICS AND COMPUTING↗

Reverse-mode differentiation in arbitrary tensor network format: with application to supervised learning.

This paper describes an efficient reverse-mode differentiation algorithm for contraction operations of tensor networks that may have arbitrary and unconventional network topologies. The approach leverages the tensor contraction tree of Evenbly and Pfeifer (2014), which provides an instruction set for the contraction sequence of a network. We show that this tree can be efficiently leveraged for differentiation of a full tensor network contraction using a recursive scheme that exploits (1) the bilinear property of contraction and (2) the property that trees have single path from root to leaves. While differentiation of tensor-tensor contraction is already possible in most automatic differentiation packages, we show that exploiting these two additional properties in the specific context of contraction sequences can improve efficiency. Following a description of the algorithm and computational complexity analysis, we investigate its utility for gradient-based supervised learning for low-rank function recovery and for fitting real-world unstructured datasets. We demonstrate improved performance over alternating least-squares optimization approaches and the capability to handle heterogeneous and arbitrary tensor network formats. When compared to alternating minimization algorithms, we find that the gradient-based approach requires a smaller oversampling ratio (number of samples compared to number model parameters) for recovery. This increased efficiency extends to fitting unstructured data of varying dimensionality and when employing a variety of tensor network formats. Here, we show improved learning using the hierarchical Tucker method over the tensor-train in high-dimensional settings on a number of benchmark problems.

97 MATHEMATICS AND COMPUTING↗

The HUNTER Dynamic Human Reliability Analysis Tool: Coupling an External Plant Code

The Human Unimodel for Nuclear Technology to Enhance Reliability (HUNTER) is a framework to support dynamic human reliability analysis (HRA) with the aim to develop standalone software to perform the dynamic HRA calculations. Within the HRA, human actions in nuclear power plants (NPPs) are predicated by plant states, and human actions influence the plant. In other words, plant operations are necessarily recursive, and it becomes challenging to model complex human-plant interactions. Consequently, we have linked two software simulations that complement those shortcomings. RELAP5-3D—the Reactor Excursion and Leak Analysis Program (RELAP; Aumiller, Tomlinson, and Bauer 2001) is the foundational thermal-hydraulic software used to model nuclear systems. Using RELAP5-3D, we have simulated the plant operations proceeding according to procedures developed to address emergent situations in NPPs. Plant operations include various actions such as the operator checking plant parameters, as well as actions that are continuously performed over time until a specific parameter reaches certain criteria. That means that HUNTER and RELAP5-3D exchange information with each other and should be carried out simultaneously over time. To simulate plant operations, which represent the actual operator checks of plant parameters and corresponding manual control actions, changes in plant status are identified through simulation and performed according to the criteria and order of the procedure. Thus, the goal of coupling HUNTER with RELAP5-3D is to facilitate synchronous coupling, where human and plant models provide iterative feedback loops that drive the course of actions. The advantage of coupling with RELAP5-3D to serve as the external environment module in HUNTER is the ability to customize the plant model and streamline for particular model applications. In this paper, we will address the key features of the coupling and the coupling structure built to perform the feedback loops.

99 GENERAL AND MISCELLANEOUS↗