Search NASA⌕ Search

Engineering topics

Ward, Rachel

Publications and source records attributed to Ward, Rachel.

Model-ready benchmarks for NPP, ANPP, litter fluxes, and recruitment into the 1 cm dbh size class

The intended use of this dataset is to serve as an observational benchmark to evaluate model predictions of NPP, ANPP, litter fluxes, and recruitment at Barro Colorado Island, Panama. This dataset contains four CSV files and one text file. “Benchmarks-NPP-ANPP-R-L.csv” provides estimates of annual ecosystem-level reproductive litter flux (R), leaf litter flux (L), aboveground net primary productivity (ANPP), and net primary productivity (NPP) for 61 field plots throughout tropical, temperate, and boreal forest biomes. An additional 499 plots (n = 550) include estimates of just R, L, and R/L. Each row reports a distinct set of estimates for one sampling interval at one plot. “Metadata-Benchmarks-NPP-ANPP-R-L.csv” contains field descriptions for all data fields in “Benchmarks-NPP-ANPP-R-L.csv”. “References-Benchmarks-NPP-ANPP-R-L.txt” contains full references to the original studies used to produce the observations at each plot included in the data. “Benchmarks-Recruitment.csv” provides estimates of species-level recruitment rates into the 1 cm dbh size class at four CTFS-ForestGeo sites using methods that account for unobserved mortality of new recruits between census intervals (Kohyama et al., 2018). “Metadata-Benchmarks-Recruitment.csv” contains field descriptions for all data fields in “Benchmarks-Recruitment.csv”.

54 ENVIRONMENTAL SCIENCES↗

Faster Johnson–Lindenstrauss transforms via Kronecker products

The Kronecker product is an important matrix operation with a wide range of applications in signal processing, graph theory, quantum computing and deep learning. In this work, we introduce a generalization of the fast Johnson–Lindenstrauss projection for embedding vectors with Kronecker product structure, the Kronecker fast Johnson–Lindenstrauss transform (KFJLT). The KFJLT reduces the embedding cost by an exponential factor of the standard fast Johnson–Lindenstrauss transform’s cost when applied to vectors with Kronecker structure, by avoiding explicitly forming the full Kronecker products. Here, we prove that this computational gain comes with only a small price in embedding power: consider a finite set of $p$ points in a tensor product of $d$ constituent Euclidean spaces $\bigotimes _{k=d}^{1}{\mathbb{R}}^{n_k}$, and let $N = \prod _{k=1}^{d}n_k$. With high probability, a random KFJLT matrix of dimension $m \times N$ embeds the set of points up to multiplicative distortion $(1\pm \varepsilon )$ provided $m \gtrsim \varepsilon ^{-2} \, \log ^{2d - 1} (p) \, \log N$. We conclude by describing a direct application of the KFJLT to the efficient solution of large-scale Kronecker-structured least squares problems for fitting the CP tensor decomposition.

Kronecker structure↗