Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 523 records · Page 29

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↗

ZONAL TOROIDAL HARMONIC EXPANSIONS OF EXTERNAL GRAVITATIONAL FIELDS FOR RING-LIKE OBJECTS

We present an expression of the external gravitational field of a general ring-like object with axial and plane symmetries such as oval toroids or annular disks with an arbitrary density distribution. The main term is the gravitational field of a uniform, infinitely thin ring representing the limit of zero radial width and zero vertical height of the object. The additional term is derived from a zonal toroidal harmonic expansion of a general solution of Laplace’s equation outside the Brillouin toroid of the object. The special functions required are the point value and the first-order derivative of the zonal toroidal harmonics of the first kind, namely, the Legendre function of the first kind of half integer degree and an argument that is not less than unity. We developed a recursive method to compute them from two pairs of seed values explicitly expressed by some complete elliptic integrals. Numerical experiments show that appropriately truncated expansions converge rapidly outside the Brillouin toroid. The truncated expansion can be evaluated so efficiently that, for an oval toroid with an exponentially damping density profile, it is 3000–10,000 times faster than the two-dimensional numerical quadrature. A group of the Fortran 90 programs required in the new method and their sample outputs are available electronically.

79 ASTRONOMY AND ASTROPHYSICS↗

Stochastic Modeling and Power Control of Time-Varying Wireless Communication Networks

Wireless networks are characterized by nodes mobility, which makes the propagation environment time-varying and subject to fading. As a consequence, the statistical characteristics of the received signal vary continuously, giving rise to a Doppler power spectral density (DPSD) that varies from one observation instant to the next. This paper is concerned with dynamical modeling of time-varying wireless fading channels, their estimation and parameter identification, and optimal power control from received signal measurement data. The wireless channel is characterized using a stochastic state-space form and derived by approximating the time-varying DPSD of the channel. The expected maximization and Kalman filter are employed to recursively identify and estimate the channel parameters and states, respectively, from online received signal strength measured data. Moreover, we investigate a centralized optimal power control algorithm based on predictable strategies and employing the estimated channel parameters and states. The proposed models together with the estimation and power control algorithms are tested using experimental measurement data and the results are presented.

Doppler Power Spectral Density↗

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)↗

Hydrologic calibration of paired watersheds using a MOSUM approach

Paired watershed studies have historically been used to quantify hydrologic effects of land use and management practices by concurrently monitoring two neighboring watersheds (a control and a treatment) during the calibration (pre-treatment) and post-treatment periods. This study characterizes seasonal water table and flow response to rainfall during the calibration period and tests a change detection technique of moving sums of recursive residuals (MOSUM) to select calibration periods for each control-treatment watershed pair when the regression coefficients for daily water table elevation (WTE) were most stable to reduce regression model uncertainty. The control and treatment watersheds included 1–3 year intensively managed loblolly pine ( Pinus taeda L. ) with natural understory, same age loblolly pine intercropped with switchgrass ( Panicum virgatum ), 14–15 year thinned loblolly pine with natural understory (control), and switchgrass only. Although monitoring during the calibration period spanned 2009 to 2012, silvicultural operational practices that occurred during this period such as harvesting of existing stand and site preparation for pine and switchgrass establishment may have acted as external factors, potentially shifting hydrologic calibration relationships between control and treatment watersheds. Results indicated that MOSUM was able to detect significant changes in regression parameters for WTE due to silvicultural operations. This approach also minimized uncertainty of calibration relationships which could otherwise mask marginal treatment effects. All calibration relationships developed using this MOSUM method were quantifiable, strong, and consistent with Nash–Sutcliffe Efficiency (NSE) greater than 0.97 for WTE and NSE greater than 0.92 for daily flow, indicating its applicability for choosing calibration periods of paired watershed studies.

54 ENVIRONMENTAL SCIENCES↗

Simplifying Multi-Jet QCD Computation

These lectures give a pedagogical discussion of the computation of QCD tree amplitudes for collider physics. The tools reviewed are spinor products, color ordering, MHV amplitudes, and the Britto-Cachazo-Feng-Witten recursion formula.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Natural Language for AdS/CFT Correlators

We provide dramatic evidence that 'Mellin space' is the natural home for correlation functions in CFTs with weakly coupled bulk duals. In Mellin space, CFT correlators have poles corresponding to an OPE decomposition into 'left' and 'right' sub-correlators, in direct analogy with the factorization channels of scattering amplitudes. In the regime where these correlators can be computed by tree level Witten diagrams in AdS, we derive an explicit formula for the residues of Mellin amplitudes at the corresponding factorization poles, and we use the conformal Casimir to show that these amplitudes obey algebraic finite difference equations. By analyzing the recursive structure of our factorization formula we obtain simple diagrammatic rules for the construction of Mellin amplitudes corresponding to tree-level Witten diagrams in any bulk scalar theory. We prove the diagrammatic rules using our finite difference equations. Finally, we show that our factorization formula and our diagrammatic rules morph into the flat space S-Matrix of the bulk theory, reproducing the usual Feynman rules, when we take the flat space limit of AdS/CFT. Throughout we emphasize a deep analogy with the properties of flat space scattering amplitudes in momentum space, which suggests that the Mellin amplitude may provide a holographic definition of the flat space S-Matrix.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Assessing the Performance and Scalability of a Novel Multilevel K-Nomial Allgather on CORE-Direct Systems

In this paper, we propose a novel allgather algorithm, Reindexed Recursive K-ing (RRK), which leverages flexibility in the algorithm's tree topology and ability to make asynchronous progress coupled with Core-Direct communication offload capability to optimize the MPI-Allgather for Core-Direct enabled systems. In particular, the RRK introduces a reindexing scheme which ensures contiguous data transfers while adding only a single additional send and receive operation for any radix, k, or communicator size, N. This allows us to improve algorithm scalability by avoiding the use of a scatter/gather elements (SGE) list on InfiniBand networks. The implementations of the RRK algorithm and its evaluation shows that it performs and scales well on Core-Direct systems for a wide range of message sizes and various communicator configurations.

99 GENERAL AND MISCELLANEOUS↗

Edge Detection and Shape Recognition in Neutron Transmission Images

Neutron transmission measurements are a valuable tool for nondestructively imaging special nuclear materials. Analysis of these images, however, tends to require significant user interaction to determine the sizes, shapes, and likely compositions of measured objects. Computer vision (CV) techniques can be a useful approach to automatically extracting important information from either neutron transmission images or fission-site-mapping images. An automatable approach has been developed that processes an input image and, through recursive application of CV techniques, produces a set of basic shapes that define surfaces observed in the image. These shapes can then be compared to a library of known shape configurations to determine if the measured object matches its expected configuration, as could be done behind an information barrier for arms control treaty verification inspections.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Technique for converting non-conforming hexahedral-to-hexahedral interfaces into conforming interfaces

A technique for conforming an interface between a first mesh and a second mesh is disclosed. A first interface surface in the first mesh and a second interface surface in the second mesh residing along the interface are identified. The first and second interface surfaces are initially non-conforming along the interface. Chords within the first and second interface surfaces that fall within a threshold separation distance of each other are paired. Sheets having chords that reside within the first or second interface surfaces are recursively inserted into or extracted from one or both of the first and second meshes until all remaining chords within the first interface surface are paired with corresponding chords in the second interface surface and all remaining chords within the second interface surface are paired with corresponding chords in the first interface surface.

Staten, Matthew L.↗

Technique for converting non-conforming hexahedral-to-hexahedral interfaces into conforming interfaces

A technique for conforming an interface between a first mesh and a second mesh is disclosed. A first interface surface in the first mesh and a second interface surface in the second mesh residing along the interface are identified. The first and second interface surfaces are initially non-conforming along the interface. Chords within the first and second interface surfaces that fall within a threshold separation distance of each other are paired. Sheets having chords that reside within the first or second interface surfaces are recursively inserted into or extracted from one or both of the first and second meshes until all remaining chords within the first interface surface are paired with corresponding chords in the second interface surface and all remaining chords within the second interface surface are paired with corresponding chords in the first interface surface.

42 ENGINEERING↗

High-resolution wave-theory-based ultrasound reflection imaging using the split-step fourier and globally optimized fourier finite-difference methods

Methods for enhancing ultrasonic reflection imaging are taught utilizing a split-step Fourier propagator in which the reconstruction is based on recursive inward continuation of ultrasonic wavefields in the frequency-space and frequency-wave number domains. The inward continuation within each extrapolation interval consists of two steps. In the first step, a phase-shift term is applied to the data in the frequency-wave number domain for propagation in a reference medium. The second step consists of applying another phase-shift term to data in the frequency-space domain to approximately compensate for ultrasonic scattering effects of heterogeneities within the tissue being imaged (e.g., breast tissue). Results from various data input to the method indicate significant improvements are provided in both image quality and resolution.

47 OTHER INSTRUMENTATION↗

Forensic Signature Detection of Yersinia Pestis Culturing Practices Across Institutions Using a Bayesian Network

The field of bioforensics is focused on the analysis of evidence from a biocrime. Existing laboratory analyses can identify the specific strain of an organism in the evidence, as well signatures of the specific culture batch of organisms, such as low-frequency contaminants or indicators of growth and processing methods. To link these disparate types of physical data to potential suspects, investigators may need to identify institutions or individuals whose access to strains and culturing practices match those identified from the evidence. In this work we present a Bayesian statistical network to fuse different types of analytical measurements that predict the production environment of a Yersinia pestis sample under investigation with automated test processing of scientific publications to identify institutions with a history of growing Y. pestis under similar conditions. Furthermore, the textual and experimental signatures were evaluated recursively to determine the overall sensitivity of the network across all levels of false positives. We illustrate that institutions associated with several specific culturing practices can be accurately selected based on the experimental signature from only a few analytical measurements. These findings demonstrate that similar Bayesian networks can be generated generically for many organisms of interest and their deployment is not prohibitive due to either computational or experimental factors.

Bayesian networks↗

Constructing a logical, regular axis topology from an irregular topology

Constructing a logical regular topology from an irregular topology including, for each axial dimension and recursively, for each compute node in a subcommunicator until returning to a first node: adding to a logical line of the axial dimension a neighbor specified in a nearest neighbor list; calling the added compute node; determining, by the called node, whether any neighbor in the node's nearest neighbor list is available to add to the logical line; if a neighbor in the called compute node's nearest neighbor list is available to add to the logical line, adding, by the called compute node to the logical line, any neighbor in the called compute node's nearest neighbor list for the axial dimension not already added to the logical line; and, if no neighbor in the called compute node's nearest neighbor list is available to add to the logical line, returning to the calling compute node.

97 MATHEMATICS AND COMPUTING↗