Search NASA⌕ Search

SEARCH · Search NASA

Results for “ranking”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

A Preconditioned Low-Rank Projection Method with a Rank-Reduction Scheme for Stochastic Partial Differential Equations

Herein, we consider the numerical solution of large systems of linear equations obtained from the stochastic Galerkin formulation of stochastic partial differential equations. We propose an iterative algorithm that exploits the Kronecker product structure of the linear systems. The proposed algorithm efficiently approximates the solutions in low-rank tensor format. Using standard Krylov subspace methods for the data in tensor format is computationally prohibitive due to the rapid growth of tensor ranks during the iterations. To keep tensor ranks low over the entire iteration process, we devise a rank-reduction scheme that can be combined with the iterative algorithm. The proposed rank-reduction scheme identifies an important subspace in the stochastic domain and compresses tensors of high rank on-the-fly during the iterations. The proposed reduction scheme is a coarse-grid method in that the important subspace can be identified inexpensively in a coarse spatial grid setting. The efficiency of the present method is displayed by numerical experiments on benchmark problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Efficient tree decomposition of high-rank tensors [Efficient decomposition of high-rank tensors]

Tensors are a natural way to express correlations among many physical variables, but storing tensors in a computer naively requires memory which scales exponentially in the rank of the tensor. This is not optimal, as the required memory is actually set not by the rank but by the mutual information amongst the variables in question. Representations such as the tensor tree perform near-optimally when the tree decomposition is chosen to reflect the correlation structure in question, but making such a choice is non-trivial and good heuristics remain highly context-specific. In this work I present two new algorithms for choosing efficient tree decompositions, independent of the physical context of the tensor. The first is a brute-force algorithm which in most cases produces optimal decompositions but is generally impractical for high-rank tensors, as the number of possible choices grows exponentially in rank. Here, the second is a greedy algorithm, and while it is not optimal it performs extremely well in numerical experiments while having runtime which makes it practical even for tensors of very high rank.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations

Rank-revealing matrix decompositions provide an essential tool in spectral analysis of matrices, including the Singular Value Decomposition (SVD) and related low-rank approximation techniques. QR with Column Pivoting (QRCP) is usually suitable for these purposes, but it can be much slower than the unpivoted QR algorithm. For large matrices, the difference in performance is due to increased communication between the processor and slow memory, which QRCP needs in order to choose pivots during decomposition. Our main algorithm, Randomized QR with Column Pivoting (RQRCP), uses randomized projection to make pivot decisions from a much smaller sample matrix, which we can construct to reside in a faster level of memory than the original matrix. This technique may be understood as trading vastly reduced communication for a controlled increase in uncertainty during the decision process. Furthermore, for rank-revealing purposes, the selection mechanism in RQRCP produces results that are the same quality as the standard algorithm, but with performance near that of unpivoted QR (often an order of magnitude faster for large matrices). Additionally, we also propose two formulas that facilitate further performance improvements. The first efficiently updates sample matrices to avoid computing new randomized projections. The second avoids large trailing updates during the decomposition in truncated low-rank approximations. Our truncated version of RQRCP also provides a key initial step in our truncated SVD approximation, TUXV. These advances open up a new performance domain for large matrix factorizations that will support efficient problem-solving techniques for challenging applications in science, engineering, and data analysis.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

On the Quasi-Endomorphism Rings of Quasi-Decomposable Torsion-Free Abelian Groups of Rank 4 with a Strongly Indecomposable Quasi-Summand of Rank 2

We obtain a description of quasi-endomorphism rings of torsion-free Abelian groups G of rank 4 that are quasi-decomposable into a direct sum of groups A{sub 1} and A{sub 2} of rank 1 and a strongly indecomposable group B of rank 2 in the case where the quasi-homomorphism group ℚ ⨂ Hom(B,A{sub 2}) has rank 2.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

A Low-Rank Multigrid Method for the Stochastic Steady-State Diffusion Problem

We study a multigrid method for solving large linear systems of equations with tensor product structure here. Such systems are obtained from stochastic finite element discretization of stochastic partial differential equations such as the steady-state diffusion problem with random coefficients. When the variance in the problem is not too large, the solution can be well approximated by a low-rank object. In the proposed multigrid algorithm, the matrix iterates are truncated to low rank to reduce memory requirements and computational effort. The technique is proved convergent with an analytic error bound. Numerical experiments show its effectiveness in solving the Galerkin systems compared to the original multigrid solver, especially when the number of degrees of freedom associated with the spatial discretization is large.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Improving Traditional Registrational Trial End Points: Development and Application of a Desirability of Outcome Ranking End Point for Complicated Urinary Tract Infection Clinical Trials

Abstract Background Traditional end points used in registrational randomized, controlled trials (RCTs) often do not allow for complete interpretation of the full range of potential clinical outcomes. Desirability of outcome ranking (DOOR) is an approach to the design and analysis of clinical trials that incorporates benefits and risks of novel treatment strategies and provides a global assessment of patient experience. Methods Through a multidisciplinary committee of experts in infectious diseases, clinical trial design, drug regulation, and patient experience, we developed a DOOR end point for infectious disease syndromes and demonstrated how this could be applied to 3 registrational drug trials (ZEUS, APEKS-cUTI, and DORI-05) for complicated urinary tract infections (cUTIs). ZEUS compared fosfomycin to piperacillin/tazobactam, APEKS-cUTI compared cefiderocol to imipenem, and DORI-05 compared doripenem to levofloxacin. Using DOOR, we estimated the probability of a more desirable outcome with each investigational antibacterial drug. Results In each RCT, the DOOR distribution was similar and the probability that a patient in the investigational arm would have a more desirable outcome than a patient in the control arm had a 95% confidence interval containing 50%, indicating no significant difference between treatment arms. DOOR facilitated improved understanding of potential trade-offs between clinical efficacy and safety. Partial credit and subgroup analyses also highlight unique attributes of DOOR. Conclusions DOOR can effectively be used in registrational cUTI trials. The DOOR end point presented here can be adapted for other infectious disease syndromes and prospectively incorporated into future clinical trials.

Immunology↗
DOE OSTI2023

Moving Beyond Mortality: Development and Application of a Desirability of Outcome Ranking (DOOR) Endpoint for Hospital-Acquired Bacterial Pneumonia and Ventilator-Associated Bacterial Pneumonia

Abstract Background Hospital-acquired and ventilator-associated bacterial pneumonia (HABP/VABP) are frequently caused by multidrug-resistant organisms. Patient-centered endpoints in clinical trials are needed to develop new antibiotics for HABP/VABP. Desirability of outcome ranking (DOOR) is a paradigm for the design, analysis, and interpretation of clinical trials based on a patient-centered, benefit-risk evaluation. Methods A multidisciplinary committee created an infectious diseases DOOR endpoint customized for HABP/VABP, incorporating infectious complications, serious adverse events, and mortality. We applied this to 2 previously completed, large randomized controlled trials for HABP/VABP. ZEPHyR compared vancomycin to linezolid and VITAL compared linezolid to tedizolid. For each trial, we evaluated the DOOR distribution and probability, including DOOR component and partial credit analyses. We also applied DOOR in subgroup analyses. Results In both trials, the HABP/VABP DOOR demonstrated similar overall clinical outcomes between treatment groups. In ZEPHyR, the probability that a participant treated with linezolid would have a more desirable outcome than a participant treated with vancomycin was 50.2% (95% confidence interval [CI], 45.1%­−55.3%). In VITAL, the probability that a participant treated with tedizolid would have a more desirable outcome than a participant treated with linezolid was 48.7% (95% CI, 44.8%–52.6%). The DOOR component analysis revealed that participants treated with tedizolid had a less desirable outcome than those treated with linezolid when considering clinical response alone. However, participants with decreased renal function had improved overall outcomes with tedizolid. Conclusions The HABP/VABP DOOR provided more granular information about clinical outcomes than is typically presented in clinical trials. HABP/VABP trials would benefit from prospectively using DOOR.

Immunology↗
DOE OSTI2022

Decomposition of high-rank factorized unitary coupled-cluster operators using ancilla and multiqubit controlled low-rank counterparts

The factorized form of the unitary coupled-cluster (UCC) approximation is one of the most promising methodologies to prepare trial states for strongly correlated systems within the variational quantum eigensolver framework. The factorized form of the UCC Ansatz can be systematically applied to a reference state to generate the desired entanglement. The difficulty associated with such an approach is the requirement of simultaneously entangling a growing number of qubits, which quickly exceeds the hardware limitations of today's quantum machines. In particular, while circuits for singles and double excitations can be performed on current hardware, higher-rank excitations require too many gate operations. In this work, we propose a set of schemes that trade off using extra qubits for a reduced gate depth to decompose high-rank UCC excitation operators into significantly lower depth circuits. These results will remain useful even when fault-tolerant machines are available to reduce the overall state-preparation circuit depth.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Learning to Rank in the Age of Muppets: Effectiveness–Efficiency Tradeoffs in Multi-Stage Ranking

It is well known that rerankers built on pretrained transformer models such as BERT have dramatically improved retrieval effectiveness in many tasks. However, these gains have come at substantial costs in terms of efficiency, as noted by many researchers. In this work, we show that it is possible to retain the benefits of transformer-based rerankers in a multi-stage reranking pipeline by first using feature-based learning-to-rank techniques to reduce the number of candidate documents under consideration without adversely affecting their quality in terms of recall. Applied to the MS MARCO passage and document ranking tasks, we are able to achieve the same level of effectiveness, but with up to 18 increase in efficiency. Furthermore, our techniques are orthogonal to other methods focused on accelerating transformer inference, and thus can be combined for even greater efficiency gains. A higher-level message from our work is that, even though pretrained transformers dominate the modern IR landscape, there are still important roles for “traditional” LTR techniques, and that we should not forget history.

catalysis↗
DOE OSTI2025

Developing a Prototype Methodology to Rank CO2-EOR Wells and Assess Their Reuse Potential for Geologic Carbon Storage

This paper presents a prototype methodology to assess the possible transition of Class II carbon dioxide-enhanced oil recovery (CO2-EOR) wells to Class VI wells. The focus is on wellbore construction materials—casing, cement, tubing, and the packer—and includes comprehensive workflows to evaluate these materials, with primary emphasis on compliance with Environmental Protection Agency (EPA) Class VI well construction and conversion guidelines. These workflows systematically assess material properties and performance criteria to ensure regulatory compliance and optimize long-term wellbore integrity and functionality. Utilizing Python scripts and JavaScript Object Notation (JSON) representations, the study automates checks on digitized Texas Railroad Commission (TRRC) data to rank wells based on workflow criteria. By emphasizing critical factors such as casing integrity, cementing techniques, tubing compatibility, and packer selection, the methodology helps well owners and operators prioritize wells for potential reuse as CO2 injection wells. Given limitations in digitized data, manual user verification is required in some sections. Future improvements include integrating non-digitized data through web scraping and machine learning techniques. This research serves as a practical guide for stakeholders, supporting environmental compliance and sustainable well operations.

geologic carbon sequestration↗
DOE OSTI2021

Development of phenomena identification and ranking table for Westinghouse lead fast reactor’s safety

The Westinghouse Lead-cooled Fast Reactor (LFR) is a medium-size, passively safe, economic, Gen-IV nuclear reactor. An important effort within the Westinghouse LFR program is the development of the safety analysis methodology, which comprises computer code development, model development, and experimental testing. A key initial task associated with the development of the safety analysis methodology is the identification of processes and phenomena that affect the plant's capability to meet selected safety performance indicators. This is accomplished through the development of a Phenomena Identification and Ranking Table (PIRT) for selected accident scenarios which, for this specific PIRT effort, included selected postulated design basis accidents and hypothetical beyond design basis accidents in LFRs. This paper describes the role of PIRT in the development of the Westinghouse LFR safety analysis methodology and the process used in the PIRT development. Specifically, the Westinghouse LFR PIRT assessed importance of pertinent phenomena and identified gaps in their knowledge-base by evaluating current modeling capabilities and data available for validation. The ultimate goal was to provide guidance on computer code development and validation efforts and to prioritize testing to support LFR design and licensing. The key phenomena and processes that are deemed highly important for the safety performance indicators, but for which the state of knowledge is low, are presented. The testing program and analyses development are planned to address significant phenomena in the PIRT.

Lead fast reactor↗
DOE OSTI2023

A Predictor-Corrector Strategy for Adaptivity in Dynamical Low-Rank Approximations

Here, in this paper, we present a predictor-corrector strategy for constructing rank-adaptive, dynamical low-rank approximations (DLRAs) of matrix-valued ODE systems. The strategy is a compromise between (i) low-rank step-truncation approaches that alternately evolve and compress solutions and (ii) strict DLRA approaches that augment the low-rank manifold using subspaces generated locally in time by the DLRA integrator. The strategy is based on an analysis of the error between a forward temporal update into the ambient full-rank space, which is typically computed in a step-truncation approach before recompressing, and the standard DLRA update, which is forced to live in a low-rank manifold. We use this error, without requiring its full-rank representation, to correct the DLRA solution. A key ingredient for maintaining a low-rank representation of the error is a randomized SVD, which introduces some degree of stochastic variability into the implementation. The strategy is formulated and implemented in the context of discontinuous Galerkin spatial discretizations of PDEs and applied to several versions of DLRA methods found in the literature as well as a new variant. Numerical experiments comparing the predictor-corrector strategy to other methods demonstrate robustness to overcome shortcomings of step truncation or strict DLRA approaches: The former may require more memory than is strictly needed, while the latter may miss transients solution features that cannot be recovered. The effect of randomization, tolerances, and other implementation parameters is also explored.

97 MATHEMATICS AND COMPUTING↗