SEARCH · Search NASA

Results for “rank”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 397 records · Page 22

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Geometry-aware training of factorized layers in tensor Tucker format

Reducing parameter redundancies in neural network architectures is crucial for achieving feasible computational and memory requirements during train and inference of large networks. Given its easy implementation and flexibility, one promising approach is layer factorization, which reshapes weight tensors into a matrix format and parameterizes it as the product of two rank-r matrices. However, this family of approaches often requires an initial full-model warm-up phase, prior knowledge of a feasible rank, and it is sensitive to parameter initialization.In this work, we introduce a novel approach to train the factors of a Tucker decomposition of the weight tensors. Our training proposal proves to be optimal in locally approximating the original unfactorized dynamics and stable for the initialization. Furthermore, the rank of each mode is dynamically updated during training.We provide a theoretical analysis of the algorithm, showing convergence, approximation and local descent guarantees. The method's performance is further illustrated through a variety of experiments, showing remarkable training compression rates and comparable or even better performance than the full baseline and alternative layer factorization strategies.

Zangrando, Emanuele [Gran Sasso Science Institute ↗

DOE OSTI2020

Pass-efficient methods for compression of high-dimensional turbulent flow data

The future of high-performance computing, specifically on future Exascale computers, will presumably see memory capacity and bandwidth fail to keep pace with data generated, for instance, from massively parallel partial differential equation (PDE) systems. Current strategies proposed to address this bottleneck entail the omission of large fractions of data, as well as the incorporation of in situ compression algorithms to avoid overuse of memory. To ensure that post-processing operations are successful, this must be done in a way that a sufficiently accurate representation of the solution is stored. Moreover, in situations where the input/output system becomes a bottleneck in analysis, visualization, etc., or the execution of the PDE solver is expensive, the number of passes made over the data must be minimized. In the interest of addressing this problem, this work focuses on the utility of pass-efficient, parallelizable, low-rank, matrix decomposition methods in compressing high-dimensional simulation data from turbulent flows. Additionally, a particular emphasis is placed on using coarse representation of the data – compatible with the PDE discretization grid – to accelerate the construction of the low-rank factorization. This includes the presentation of a novel single-pass matrix decomposition algorithm for computing the so-called interpolative decomposition. The methods are described extensively and numerical experiments on two turbulent channel flow data are performed. In the first (unladen) channel flow case, compression factors exceeding 400 are achieved while maintaining accuracy with respect to first- and second-order flow statistics. In the particle-laden case, compression factors of 100 are achieved and the compressed data is used to recover particle velocities. These results show that these compression methods can enable efficient computation of various quantities of interest in both the carrier and disperse phases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2023

Predicting future well performance for environmental remediation design using deep learning

Here in this study, we developed a deep learning (DL) framework with a multi-channel three-dimensional convolutional neural network (MC3D-CNN) to predict well performance and thereby assist future environmental remediation design. Such prediction of extraction well performance at designated locations is critical for configuring pump-and-treat (P&T) well network design and operation, setting reasonable target closure dates for overall remedying, and estimating remedy costs. The framework is developed with operational and monitoring data routinely collected during P&T remedy operations, including well extraction and injection rates as well as in situ contaminant concentrations. Traditionally, the collected data were rarely used for purposes other than assessing past well performance and the accuracy of the conceptual site model. However, recent advances in data-driven computational approaches enable better use of the large datasets to inform future well performance, enhance site characterization, and improve remediation planning. In this study, we established a DL framework to integrate transient three-dimensional contaminant plumes and multiple aquifer properties (e.g., hydraulic conductivity and hydrostratigraphic maps) to identify characteristic patterns controlling and representing extraction well mass recovery, aiming at providing future mass recovery estimates for existing wells and candidate wells at any proposed locations. We evaluated our framework by using a realistic synthetic dataset generated from a well-calibrated flow and transport model used in the 200 West Area of the U.S. Department of Energy’s Hanford Site in southeastern Washington state. The multi-channel feature in our framework allows integration of various types and temporal densities of training datasets for DL model development. Overall, we found that the trained DL model achieved an accuracy of over 90% in ranking extraction well performance in validation datasets, and over 80% in predicting high-performance-ranking well locations. This data-informed approach provides a flexible tool to support adaptive site management, streamline decision-making, and potentially reduce remediation time and costs. Our DL framework can be used as a filtering tool to improve the current P&T network optimization design by reducing the number of candidate well locations.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2024

A flexible class of priors for orthonormal matrices with basis function-specific structure

Statistical modeling of high-dimensional matrix-valued data motivates the use of a low-rank representation that simultaneously summarizes key characteristics of the data and enables dimension reduction. Low-rank representations commonly factor the original data into the product of orthonormal basis functions and weights, where each basis function represents an independent feature of the data. However, the basis functions in these factorizations are typically computed using algorithmic methods that cannot quantify uncertainty or account for basis function correlation structure a priori. While there exist Bayesian methods that allow for a common correlation structure across basis functions, empirical examples motivate the need for basis function-specific dependence structure. We propose a prior distribution for orthonormal matrices that can explicitly model basis function-specific structure. The prior is used within a general probabilistic model for singular value decomposition to conduct posterior inference on the basis functions while accounting for measurement error and fixed effects. We discuss how the prior specification can be used for various scenarios and demonstrate favorable model properties through synthetic data examples. Finally, we apply our method to two-meter air temperature data from the Pacific Northwest, enhancing our understanding of the Earth system’s internal variability.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Proof-of-concept chemometric approach for environmental forensic sourcing of crude oil samples using SPME-GC-MS

Environmental exposure to crude oil through seepage and spillage poses risks to the immediate environment and the broader ecosystem as areas along the oil distribution path are affected by the influx of crude petroleum as well as the environmental, economic, and civil unrest that accompanies it. There is a large financial burden associated with the lost resources, including the cost of rehabilitation, and the affected sources of revenue for communities affected by oil spills. As such, it is crucial to determine the responsible parties. This work outlines an environmental forensics approach to determining the source of an un-weathered crude oil sample. The researchers employed solid phase microextraction coupled with gas chromatography mass spectrometry (SPME-GC-MS) to capture and analyze the gaseous components emitted by crude oil samples sourced from five locations. Samples were analyzed using Spearman's rank correlation and 3D covariance analysis. Both chemometric approaches yielded optimal performance results with no misclassifications, true positive rate (TPR) = 100 % and false positive rate (FPR) = 0 %. The similarity metrics calculated by each test noted clear delineations between the values of same-source and differently sourced samples. The Spearman's rank correlation test and 3D covariance calculations both demonstrated the ability to correctly identify sample source origin in this dataset. Finally, the authors outline an approach to the future application of these tests and suggest their joint use in future crude oil sourcing endeavors.

3D covariance mapping↗

DOE OSTI2024

An Incremental Tensor Train Decomposition Algorithm

We present a new algorithm for incrementally updating the tensor train decomposition of a stream of tensor data. This new algorithm, called the tensor train incremental core expansion (TT-ICE) improves upon the current state-of-the-art algorithms for compressing in tensor train format by developing a new adaptive approach that incurs significantly slower rank growth and guarantees compression accuracy. This capability is achieved by limiting the number of new vectors appended to the TT-cores of an existing accumulation tensor after each data increment. These vectors represent directions orthogonal to the span of existing cores and are limited to those needed to represent a newly arrived tensor to a target accuracy. We provide two versions of the algorithm: TT-ICE and TT-ICE accelerated with heuristics (TT-ICE*). Here, we provide a proof of correctness for TT-ICE and empirically demonstrate the performance of the algorithms in compressing large-scale video and scientific simulation datasets. Compared to existing approaches that also use rank adaptation, TT-ICE* achieves 57× higher compression and up to 95% reduction in computational time.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Bayesian Tensor Decompositions for Scalable Supervised Learning of Scientific Data (Final Report)

In this document we highlight the detailed accomplishments and progress that we have made in this period. This progress seeks to address the three main objectives to provide new algorithms for quantifying uncertainty in low-multilinear-rank models and to leverage them for data analysis. These include: (1) develop probabilistic models for low-multilinear-rank functions; (2) develop a suite of Bayesian learning approaches to learn the probabilistic models from data; (3) apply the techniques on challenging problems arising in DOE-relevant applications.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2014

Fixing Dataset Search

Three current search engines are queried for ozone data at the GES DISC. The results range from sub-optimal to counter-intuitive. We propose a method to fix dataset search by implementing a robust relevancy ranking scheme. The relevancy ranking scheme is based on several heuristics culled from more than 20 years of helping users select datasets.

science data↗

DOE OSTI2020

Benchmark Dose Analysis of DNA Damage Biomarker Responses Provides Compound Potency and Adverse Outcome Pathway Information for the Topoisomerase II Inhibitor Class of Compounds

Genetic toxicology data have traditionally been utilized for hazard identification to provide a binary call for a compound's risk. Recent advances in the scientific field, especially with the development of high‐throughput methods to quantify DNA damage, have influenced a change of approach in genotoxicity assessment. The in vitro MultiFlow® DNA Damage Assay is one such method which multiplexes γH2AX, p53, phospho‐histone H3 biomarkers into a single‐flow cytometric analysis (Bryce et al., [2016]: Environ Mol Mutagen 57:546–558). This assay was used to study human TK6 cells exposed to each of eight topoisomerase II poisons for 4 and 24 hr. Using PROAST v65.5, the Benchmark Dose approach was applied to the resulting flow cytometric datasets. With “compound” serving as covariate, all eight compounds were combined into a single analysis, per time point and endpoint. The resulting 90% confidence intervals, plotted in Log scale, were considered as the potency rank for the eight compounds. The in vitro MultiFlow data showed a maximum confidence interval span of 1Log, which indicates data of good quality. Patterns observed in the compound potency rank were scrutinized by using the expert rule‐based software program Derek Nexus, developed by Lhasa Limited. Compound sub‐classification and structural alerts were considered contributory to the potencies observed for the topoisomerase II poisons studied herein. The Topo II poison Adverse Outcome Pathway was evaluated with MultiFlow endpoints serving as Key Events. The step‐wise approach described herein can be considered as a foundation for risk assessment of compounds within a specific mode of action of interest. Environ. Mol. Mutagen. 2020. © 2020 Wiley Periodicals, Inc.

Wheeldon, Ryan P.↗

DOE OSTI2021

The impact of coupled air–sea interaction on extreme East Asian summer monsoon simulation in CMIP5 models

Abstract In this study, the relationship between the ability to simulate air–sea interactions over the western North Pacific (WNP), and to reproduce the extreme East Asian summer monsoon (EASM), were investigated by comparing the performances of several global climate models (GCMs). High ranked in air–sea interaction simulation (HRA) and low ranked in air–sea interaction simulation (LRA) models were selected, according to their performance in simulating relations between sea surface temperature (SST) and precipitation over the WNP, from the ensemble of models that participated in the third and fifth phases of the Coupled Model Intercomparison Project (CMIP3, CMIP5). Compared with CMIP3 models, CMIP5 models exhibited improved simulations of the distinctive air–sea interaction over the WNP, namely, the strong atmospheric forcing on the ocean. Among CMIP5 models, HRA models, which reproduced intrinsic negative correlations between precipitation and SST over the WNP, could simulate the extreme EASM better than LRA models. In particular, HRA models generated a more realistic spatial distribution of the extreme EASM compared with LRA models. The defects of the LRA models resulted from distorted synoptic fields, including underestimated geopotential height and overestimated low‐level wind over the WNP, inducing unrealistic moisture supply and convection due to the exaggerated SST forcing. In contrast, reasonable air–sea interactions represented in HRA models lead to realistic synoptic fields over the WNP, and proper simulation of the extreme EASM.

Kim, Taehyung↗

DOE OSTI2022

Nonnegative canonical tensor decomposition with linear constraints: nnCANDELINC

Abstract There is an emerging interest for tensor factorization applications in big‐data analytics and machine learning. To speed up the factorization of extra‐large datasets, organized in multidimensional arrays (also known as tensors), easy to compute compression‐based tensor representations, such as, Tucker and tensor train formats, are used to approximate the initial large‐tensor. Further, tensor factorization is used to extract latent features that can facilitate discoveries of new mechanisms and signatures hidden in the data, where the explainability of the latent features is of principal importance. Nonnegative tensor factorization extracts latent features that are naturally sparse and parts of the data, which makes them easily interpretable. However, to take into account available domain knowledge and subject matter expertise, often additional constraints need to be imposed, which lead us to canonical decomposition with linear constraints (CANDELINC), a canonical polyadic decomposition with rank deficient factors. In CANDELINC, Tucker compression is used as a preprocessing step, which lead to a larger residual error but to more explainable latent features. Here, we propose a nonnegative CANDELINC (nnCANDELINC) accomplished via a specific nonnegative Tucker decomposition; we refer to as minimal or canonical nonnegative Tucker. We derive several results required to understand the specificity of nnCANDELINC, focusing on the difficulties of preserving the nonnegative rank of a tensor to its Tucker core and comparing the real valued to nonnegative case. Finally, we demonstrate nnCANDELINC performance on synthetic and real‐world examples.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Improving protein tertiary structure prediction by deep learning and distance prediction in CASP14

Abstract Substantial progresses in protein structure prediction have been made by utilizing deep‐learning and residue‐residue distance prediction since CASP13. Inspired by the advances, we improve our CASP14 MULTICOM protein structure prediction system by incorporating three new components: (a) a new deep learning‐based protein inter‐residue distance predictor to improve template‐free (ab initio) tertiary structure prediction, (b) an enhanced template‐based tertiary structure prediction method, and (c) distance‐based model quality assessment methods empowered by deep learning. In the 2020 CASP14 experiment, MULTICOM predictor was ranked seventh out of 146 predictors in tertiary structure prediction and ranked third out of 136 predictors in inter‐domain structure prediction. The results demonstrate that the template‐free modeling based on deep learning and residue‐residue distance prediction can predict the correct topology for almost all template‐based modeling targets and a majority of hard targets (template‐free targets or targets whose templates cannot be recognized), which is a significant improvement over the CASP13 MULTICOM predictor. Moreover, the template‐free modeling performs better than the template‐based modeling on not only hard targets but also the targets that have homologous templates. The performance of the template‐free modeling largely depends on the accuracy of distance prediction closely related to the quality of multiple sequence alignments. The structural model quality assessment works well on targets for which enough good models can be predicted, but it may perform poorly when only a few good models are predicted for a hard target and the distribution of model quality scores is highly skewed. MULTICOM is available at https://github.com/jianlin-cheng/MULTICOM_Human_CASP14/tree/CASP14_DeepRank3 and https://github.com/multicom-toolbox/multicom/tree/multicom_v2.0 .

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2023

Combining pairwise structural similarity and deep learning interface contact prediction to estimate protein complex model accuracy in CASP15

Abstract Estimating the accuracy of quaternary structural models of protein complexes and assemblies (EMA) is important for predicting quaternary structures and applying them to studying protein function and interaction. The pairwise similarity between structural models is proven useful for estimating the quality of protein tertiary structural models, but it has been rarely applied to predicting the quality of quaternary structural models. Moreover, the pairwise similarity approach often fails when many structural models are of low quality and similar to each other. To address the gap, we developed a hybrid method (MULTICOM_qa) combining a pairwise similarity score (PSS) and an interface contact probability score (ICPS) based on the deep learning inter‐chain contact prediction for estimating protein complex model accuracy. It blindly participated in the 15th Critical Assessment of Techniques for Protein Structure Prediction (CASP15) in 2022 and performed very well in estimating the global structure accuracy of assembly models. The average per‐target correlation coefficient between the model quality scores predicted by MULTICOM_qa and the true quality scores of the models of CASP15 assembly targets is 0.66. The average per‐target ranking loss in using the predicted quality scores to rank the models is 0.14. It was able to select good models for most targets. Moreover, several key factors (i.e., target difficulty, model sampling difficulty, skewness of model quality, and similarity between good/bad models) for EMA are identified and analyzed. The results demonstrate that combining the multi‐model method (PSS) with the complementary single‐model method (ICPS) is a promising approach to EMA.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2026

A multi‐variable framework for selecting WRF physics configurations at convection‐permitting scales: An Amazon wet‐season case study

Tropical convection over rainforests modulates atmospheric circulation and the energy and hydrological cycles across multiple scales. However, the scarcity of observations still limits our understanding of these processes. Although numerical models are utilized to investigate atmospheric physical processes, their performance depends on the choice of parameterizations and grid resolution. Here, in this work, we introduce and apply a multi‐variable, multi‐physics framework to evaluate and rank the Advanced Research Weather Research and Forecasting (WRF–ARW) configurations at 1‐km resolution over the central Amazon during the wet season. A 48‐member ensemble combines three land‐surface models (LSMs), four planetary boundary layer (PBL), and four microphysics (MP) schemes. Model performance for seven convection‐related near‐surface and boundary‐layer variables is assessed using Taylor diagrams and the Taylor skill score (TSS), analysis of variance (ANOVA)‐based sensitivity metrics, and non‐parametric rank tests. We then construct a combined, weighted TSS to identify configurations that are comparatively robust across variables. Results showed that most configurations reproduce near‐surface temperature, sensible and latent heat fluxes, and boundary‐layer height reasonably well, whereas humidity and rainfall remain challenging. LSM choice has the strongest impact on the surface fluxes and a secondary influence on near‐surface temperature and humidity, PBL schemes dominate boundary‐layer height, and MP schemes exert the largest control on rainfall. No single configuration is optimal for all variables, but the combination of Noah (LSM), Yonsei University (PBL), and Morrison (MP) emerges as the most robust configuration for this case, with the WRF single‐moment six‐class scheme (WSM6) providing a competitive, computationally cheaper MP alternative. The framework is general and can be applied to other regions, seasons, and convective regimes.

Amazon rainforest↗

DOE OSTI2023

Opportunistic CP violation

In the electroweak sector of the Standard Model, CP violation arises through a very particular interplay between the three quark generations, as described by the Cabibbo-Kobayashi-Maskawa (CKM) mechanism and the single Jarlskog invariant J 4 . Once generalized to the Standard Model Effective Field Theory (SMEFT), this peculiar pattern gets modified by higher-dimensional operators, whose associated Wilson coefficients are usually split into CP-even and odd parts. However, CP violation at dimension four, i.e., at the lowest order in the EFT expansion, blurs this distinction: any Wilson coefficient can interfere with J 4 and mediate CP violation. In this paper, we study such interferences at first order in the SMEFT expansion, $\mathcal{O}(1/Λ^2)$, and we capture their associated parameter space via a set of 1551 linear CP-odd flavor invariants. This construction describes both new, genuinely CP-violating quantities as well as the interference between J 4 and CP-conserving ones. We call this latter possibility opportunistic CP violation. Relying on an appropriate extension of the matrix rank to Taylor expansions, which we dub Taylor rank, we define a procedure to organize the invariants in terms of their magnitude, so as to retain only the relevant ones at a given precision. We explore how this characterization changes when different assumptions are made on the flavor structure of the SMEFT coefficients. Interestingly, some of the CP-odd invariants turn out to be less suppressed than J 4 , even when they capture opportunistic CPV, demonstrating that CP-violation in the SM, at dimension 4, is accidentally small.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2021

Separability in consistent truncations

The separability of the Hamilton-Jacobi equation has a well-known connection to the existence of Killing vectors and rank-two Killing tensors. This paper combines this connection with the detailed knowledge of the compactification metrics of consistent truncations on spheres. The fact that both the inverse metric of such compactifications, as well as the rank-two Killing tensors can be written in terms of bilinears of Killing vectors on the underlying “round metric,” enables us to perform a detailed analyses of the separability of the Hamilton-Jacobi equation for consistent truncations. We introduce the idea of a separating isometry and show that when a consistent truncation, without reduction gauge vectors, has such an isometry, then the Hamilton-Jacobi equation is always separable. When gauge vectors are present, the gauge group is required to be an abelian subgroup of the separating isometry to not impede separability. We classify the separating isometries for consistent truncations on spheres, S n , for n = 2, …, 7, and exhibit all the corresponding Killing tensors. These results may be of practical use in both identifying when supergravity solutions belong to consistent truncations and generating separable solutions amenable to scalar probe calculations. Finally, while our primary focus is the Hamilton-Jacobi equation, we also make some remarks about separability of the wave equation.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2023

Quantum error correction in the black hole interior

We study the quantum error correction properties of the black hole interior in a toy model for an evaporating black hole: Jackiw-Teitelboim gravity entangled with a non-gravitational bath. After the Page time, the black hole interior degrees of freedom in this system are encoded in the bath Hilbert space. We use the gravitational path integral to show that the interior density matrix is correctable against the action of quantum operations on the bath which (i) do not have prior access to details of the black hole microstates, and (ii) do not have a large, negative coherent information with respect to the maximally mixed state on the bath, with the lower bound controlled by the black hole entropy and code subspace dimension. Thus, the encoding of the black hole interior in the radiation is robust against generic, low-rank quantum operations. For erasure errors, gravity comes within an O (1) distance of saturating the Singleton bound on the tolerance of error correcting codes. For typical errors in the bath to corrupt the interior, they must have a rank that is a large multiple of the bath Hilbert space dimension, with the precise coefficient set by the black hole entropy and code subspace dimension.

2D gravity↗

DOE OSTI2025

Direct interpolative construction of the discrete Fourier transform as a matrix product operator

The quantum Fourier transform (QFT), which can be viewed as a reindexing of the discrete Fourier transform (DFT), has been shown to be compressible as a low-rank matrix product operator (MPO) or quantized tensor train (QTT) operator. However, the original proof of this fact does not furnish a construction of the MPO with a guaranteed error bound. Meanwhile, the existing practical construction of this MPO, based on the compression of a quantum circuit, is not as efficient as possible. We present a simple closed-form construction of the QFT MPO using the interpolative decomposition, with guaranteed near-optimal compression error for a given rank. This construction can speed up the application of the QFT and the DFT, respectively, in quantum circuit simulations and QTT applications. We also connect our interpolative construction to the approximate quantum Fourier transform (AQFT) by demonstrating that the AQFT can be viewed as an MPO constructed using a different interpolation scheme.

97 MATHEMATICS AND COMPUTING↗