Search NASA⌕ Search

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.

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

At least 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Exploration of a Potential DOOR Endpoint for Hospital-acquired Bacterial Pneumonia and Ventilator-associated Bacterial Pneumonia Using Six Registrational Trials for Antibacterial Drugs

Abstract Background Desirability of outcome ranking (DOOR) is an innovative approach to clinical trial design and analysis that uses an ordinal ranking system to incorporate the overall risks and benefits of a therapeutic intervention into a single measurement. Here we derived and evaluated a disease-specific DOOR endpoint for registrational trials for hospital-acquired bacterial pneumonia and ventilator-associated bacterial pneumonia (HABP/VABP). Methods Through comprehensive examination of data from nearly 4000 participants enrolled in six registrational trials for HABP/VABP submitted to the Food and Drug Administration (FDA) between 2005 and 2022, we derived and applied a HABP/VABP specific endpoint. We estimated the probability that a participant assigned to the study treatment arm would have a more favorable overall DOOR or component outcome than a participant assigned to comparator. Results DOOR distributions between treatment arms were similar in all trials. DOOR probability estimates ranged from 48.3% to 52.9% and were not statistically different. There were no significant differences between treatment arms in the component analyses. Although infectious complications and serious adverse events occurred more frequently in ventilated participants compared to non-ventilated participants, the types of events were similar. Conclusions Through a data-driven approach, we constructed and applied a potential DOOR endpoint for HABP/VABP trials. The inclusion of syndrome-specific events may help to better delineate and evaluate participant experiences and outcomes in future HABP/VABP trials and could help inform data collection and trial design.

Immunology↗
DOE OSTI2021

Pre-conditioned BFGS-based uncertainty quantification in elastic full-waveform inversion

SUMMARY Full-waveform inversion has become an essential technique for mapping geophysical subsurface structures. However, proper uncertainty quantification is often lacking in current applications. In theory, uncertainty quantification is related to the inverse Hessian (or the posterior covariance matrix). Even for common geophysical inverse problems its calculation is beyond the computational and storage capacities of the largest high-performance computing systems. In this study, we amend the Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm to perform uncertainty quantification for large-scale applications. For seismic inverse problems, the limited-memory BFGS (L-BFGS) method prevails as the most efficient quasi-Newton method. We aim to augment it further to obtain an approximate inverse Hessian for uncertainty quantification in FWI. To facilitate retrieval of the inverse Hessian, we combine BFGS (essentially a full-history L-BFGS) with randomized singular value decomposition to determine a low-rank approximation of the inverse Hessian. Setting the rank number equal to the number of iterations makes this solution efficient and memory-affordable even for large-scale problems. Furthermore, based on the Gauss–Newton method, we formulate different initial, diagonal Hessian matrices as pre-conditioners for the inverse scheme and compare their performances in elastic FWI applications. We highlight our approach with the elastic Marmousi benchmark model, demonstrating the applicability of pre-conditioned BFGS for large-scale FWI and uncertainty quantification.

58 GEOSCIENCES↗
DOE OSTI2020

Machine learning predicts new anti-CRISPR proteins

The increasing use of CRISPR–Cas9 in medicine, agriculture, and synthetic biology has accelerated the drive to discover new CRISPR–Cas inhibitors as potential mechanisms of control for gene editing applications. Many anti-CRISPRs have been found that inhibit the CRISPR–Cas adaptive immune system. However, comparing all currently known anti-CRISPRs does not reveal a shared set of properties for facile bioinformatic identification of new anti-CRISPR families. Here, we describe AcRanker, a machine learning based method to aid direct identification of new potential anti-CRISPRs using only protein sequence information. Using a training set of known anti-CRISPRs, we built a model based on XGBoost ranking. We then applied AcRanker to predict candidate anti-CRISPRs from predicted prophage regions within self-targeting bacterial genomes and discovered two previously unknown anti-CRISPRs: AcrllA20 (ML1) and AcrIIA21 (ML8). We show that AcrIIA20 strongly inhibits Streptococcus iniae Cas9 (SinCas9) and weakly inhibits Streptococcus pyogenes Cas9 (SpyCas9). We also show that AcrIIA21 inhibits SpyCas9, Streptococcus aureus Cas9 (SauCas9) and SinCas9 with low potency. The addition of AcRanker to the anti-CRISPR discovery toolkit allows researchers to directly rank potential anti-CRISPR candidate genes for increased speed in testing and validation of new anti-CRISPRs. A web server implementation for AcRanker is available online at http://acranker.pythonanywhere.com/.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2026

Efficient Measurement-Driven Eigenenergy Estimation with Classical Shadows

Quantum algorithms exploiting real-time evolution under a target Hamiltonian have demonstrated remarkable efficiency in extracting key spectral information. However, the broader potential of these methods, particularly beyond ground-state calculations, is underexplored. In this work, we introduce the framework of multiobservable dynamic mode decomposition (MODMD), which combines the observable dynamic mode decomposition (DMD), a measurement-driven eigensolver tailored for near-term implementation, with classical shadow tomography. MODMD leverages random scrambling in the classical shadow technique to construct, with exponentially reduced resource requirements, a signal subspace that encodes rich spectral information. Notably, we replace typical Hadamard-test circuits with a protocol designed to predict low-rank observables, thereby broadening the use of classical shadow tomography for predicting many low-rank observables. We establish theoretical guarantees on the spectral approximation from MODMD, taking into account distinct sources of error. In the ideal case, we prove that the spectral error scales as exp (−Δ⁢𝐸⁢𝑡 max ), where Δ⁢𝐸 is the Hamiltonian spectral gap and 𝑡 max is the maximal simulation time. This analysis provides a rigorous justification of the rapid convergence observed across simulations. To demonstrate the utility of our framework, we consider its application to fundamental tasks, such as determining the low-lying, i.e., ground or excited, energies of representative many-body systems. Our work paves the path for efficient designs of measurement-driven algorithms on near-term and early fault-tolerant quantum devices.

quantum algorithms & computation↗
DOE OSTI2026

Efficient Simulation of Logical Magic State Preparation Protocols

Developing space- and time-efficient logical magic state preparation (MSP) protocols will likely be an essential step toward building a large-scale fault-tolerant quantum computer. Motivated by this need, we introduce a scalable method for simulating logical MSP protocols under the standard circuit-level noise model. When applied to protocols based on code-switching, magic state cultivation, and magic state distillation, our method yields a complexity polynomial in (i) the number of qubits and (ii) the nonstabilizerness, e.g., stabilizer rank or Pauli rank, of the target encoded magic state. The efficiency of our simulation method is rooted in a curious fact: every circuit-level Pauli error in these protocols propagates to a Clifford error at the end. This property is satisfied by a large family of protocols, including those that repeatedly measure a transversal Clifford that squares to a Pauli. We provide a proof-of-principle numerical simulation that prepares a magic state using such logical Clifford measurements. Our work enables practical simulation of logical MSP protocols without resorting to approximations or resource-intensive state-vector simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Analysis of diagonal G and subspace W approximations within fully self-consistent GW calculations for bulk semiconducting systems

Fully self-consistent GW (sc-GW) methods are now available to evaluate quasiparticle and spectral properties of various molecular and bulk systems. However, such techniques based on the full matrix of G and W are computationally demanding. Additionally, the routinely used single-shot GW approximation (G 0 W 0 ) has an undesirable dependency on the choice of initial exchange-correlation functional. In the literature, many so-called self-consistent GW methods are based on diagonal approximation of G and low-ranking approximation of W. It is thus worth checking how good such approximations are in comparison with the full matrix method. In this work, we consider AlAs, AlP, GaP, and ZnS as the prototype systems to perform sc-GW calculations by expressing the full G matrix using a plane-wave basis set. We compared our sc-GW results with the diagonal G and subspace W approximated sc-GW results (sc-GW-diagG and sc-GW-subW methods). In the sc-GW-diagG method, interacting G is expanded in the eigenvectors of noninteracting G such that only diagonal elements are retained, whereas the number of eigenmodes is truncated in sc-GW-subW calculations. A systematic analysis of the results obtained from the above techniques is presented. The differences in the quasiparticle band gap between the approximated and the full matrix sc-GW approaches are mostly less than 1.7%, which validates such widely adopted approximations, and also shows how such low-ranking approximation can be used to include higher-order terms such as the vertex correction.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Quantum field theory of topological spin dynamics

Here, we develop a field theory of quantum magnets and magnetic (semi)metals, which is suitable for the analysis of their universal and topological properties. The systems of interest include collinear, coplanar, and general noncoplanar magnets. At the basic level, we describe the dynamics of magnetic moments using smooth vector fields in the continuum limit. Dzyaloshinskii-Moriya interaction is captured by a non-Abelian vector gauge field, and chiral spin couplings related to topological defects appear as higher-rank antisymmetric tensor gauge fields. We distinguish type-I and type-II magnets by their equilibrium response to the non-Abelian gauge flux, and characterize the resulting lattices of skyrmions and hedgehogs, the spectra of spin waves, and the chiral response to external perturbations. The general spin-orbit coupling of electrons is similarly described by non-Abelian gauge fields, including higher-rank tensors related to the electronic Berry flux. Itinerant electrons and local moments exchange their gauge fluxes through Kondo and Hund interactions. Hence, by utilizing gauge fields, this theory provides a unifying physical picture of “intrinsic” and “topological” anomalous Hall effects, spin-Hall effects, and other correlations between the topological properties of electrons and moments. We predict “topological” magnetoelectric effect in materials prone to hosting hedgehogs. Links to experiments and model calculations are provided by deriving the couplings and gauge fields from generic microscopic models, including the Hubbard model with spin-orbit interactions. Much of the formal analysis is generalized to d spatial dimensions in order to access the $π_{d–1}(S^{d–1})$ homotopy classification of the magnetic hedgehog topological defects, and establish the possibility of novel quantum spin liquids that exhibit a fractional magnetoelectric effect. However, we emphasize the form of all results in the physically relevant $\textit{d}$ = 3 dimensions, and discuss a few applications to topological magnetic conductors like Mn 3 Sn and Pr 2 Ir 2 O 7 .

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Probing parity violation with the four-point correlation function of BOSS galaxies

Parity-violating physics in the early universe can leave detectable traces in late-time observables. While vector- and tensor-type parity violation can be observed in the B -modes of the cosmic microwave background, scalar-type signatures are visible only in the four-point correlation function (4PCF) and beyond. This work presents a blind test for parity violation in the 4PCF of the baryon oscillation spectroscopic survey (BOSS) CMASS sample, considering galaxy separations in the range [20; 160]h -1 Mpc The parity-odd 4PCF contains no contributions from standard Λ CDM physics and can be efficiently measured using recently developed estimators. Data are analyzed using both a nonparametric rank test (comparing the BOSS 4PCFs to those of realistic simulations) and a compressed χ 2 analysis, with the former avoiding the assumption of a Gaussian likelihood. These find similar results, with the rank test giving a detection probability of 99.6% (2.9 σ). This provides significant evidence for parity violation, from either cosmological sources or systematics. We perform a number of systematic tests: although these do not reveal any observational artifacts, we cannot exclude the possibility that our detection is caused by the simulations not faithfully representing the statistical properties of the BOSS data. Our measurements can be used to constrain physical models of parity violation. As an example, we consider a coupling between the inflaton and a U (1) gauge field and place bounds on the latter’s energy density, which are several orders of magnitude stronger than those previously reported. Upcoming probes such as DESI and Euclid will reveal whether our detection of parity violation is due to new physics, and strengthen the bounds on a variety of models.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

6D large charge and 2D Virasoro blocks

We compute observables in the interacting rank-one 6D 𝒩 =(2,0) superconformal field theory (SCFT) at large 𝑅-charge. We focus on correlators involving Φ 𝑛 , namely symmetric products of the bottom component of the supermultiplet containing the stress tensor. By using the moduli space effective action and methods from the large-charge expansion, we compute the operator product expansion coefficients ⟨Φ 𝑛 ⁢Φ 𝑚 ⁢Φ 𝑛+𝑚 ⟩ in an expansion in 1/𝑛. The coefficients of the expansion are only partially determined from the 6D perspective, but we manage to fix them order-by-order in 1/𝑛 numerically by utilizing the 6⁢D/2⁢D correspondence. This is made possible by the fact that this 6D observable can be extracted in 2D from a specific double-scaling limit of the vacuum Virasoro block, which can be efficiently computed numerically. We also extend the computation to higher-rank SCFTs, and discuss various applications of our results to 6D as well as 2D.

classical solutions in field theory↗
DOE OSTI2024

Three-Dimensional Topological Field Theories and Nonunitary Minimal Models

We find an intriguing relation between a class of three-dimensional nonunitary topological field theories (TFTs) and Virasoro minimal models M ( 2 , 2 r + 3 ) with r ≥ 1 . The TFTs are constructed by topologically twisting 3D N = 4 superconformal field theories (SCFTs) of rank-0, i.e., having zero-dimensional Coulomb and Higgs branches. We present ultraviolet (UV) field theory descriptions of the SCFTs with manifest N = 2 supersymmetry, which we argue is enhanced to N = 4 in the infrared. From the UV description, we compute various partition functions of the TFTs and reproduce some basic properties of the minimal models, such as their characters and modular matrices. We expect more general correspondence between topologically twisted 3d N = 4 rank-0 SCFTs and 2D nonunitary rational conformal field theories. Published by the American Physical Society 2024

Physics↗
DOE OSTI2025

Synthetic tensor gauge fields

Synthetic gauge fields have provided physicists with a unique tool to explore a wide range of fundamentally important phenomena. However, most experiments have focused on synthetic vector gauge fields. The very rich physics brought about by coupling tensor gauge fields to fracton phases of matter remains unexplored in laboratories. Here, we propose schemes to realize synthetic tensor gauge fields that address dipoles instead of single particles. A lattice tilted by a strong linear potential and a weak quadratic potential yields a rank-2 electric field for a dipole formed by a particle-hole pair. Such a rank-2 electric field leads to a new type of Bloch oscillations, which modulates the quadrupole moment and preserves the dipole moment of the system. In higher dimensions, the interplay between interactions and vector gauge potentials imprints a phase to the ring-exchange interaction and thus generates synthetic tensor gauge fields. Such tensor gauge fields make it possible to realize a dipolar Harper-Hofstadter model in laboratories. The resultant dipolar Chern insulators feature chiral edge currents of dipoles in the absence of net charge currents. Published by the American Physical Society 2025

Zhang, Shaoliang (ORCID:000000016635044X)↗
DOE OSTI2025

Breaking the curse of dimensionality: Solving configurational integrals for crystalline solids by tensor networks

Accurately evaluating configurational integrals for dense solids remains a central and difficult challenge in the statistical mechanics of condensed systems. Here, we present a tensor network approach that reformulates the high-dimensional configurational integral for identical-particle crystals into a sequence of computationally efficient summations. We represent the integrand as a high-dimensional tensor and apply tensor-train (TT) decomposition together with a custom TT-cross interpolation. This approach circumvents the need to explicitly construct the full tensor. We introduce tailored rank-1 and rank-2 schemes optimized for sharply peaked Boltzmann probability densities, typical for identical-particle crystals. When applied to the calculation of internal energy and pressure-temperature curves for crystalline Cu and Ar at high (GPa) pressures, as well as the alpha-to-beta phase transition diagram of Sn, our method accurately reproduces molecular dynamics simulation results using tight-binding, machine learning, hierarchical interacting particle–neural network, and modified embedded atom method potentials,all within seconds of computation time.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Pattern-matching indexing of Laue and monochromatic serial crystallography data for applications in materials science

Serial crystallography data can be challenging to index, as each frame is processed individually, rather than being processed as a whole like in conventional X-ray single-crystal crystallography. An algorithm has been developed to index still diffraction patterns arising from small-unit-cell samples. The algorithm is based on the matching of reciprocal-lattice vector pairs, as developed for Laue microdiffraction data indexing, combined with three-dimensional pattern matching using a nearest-neighbors approach. As a result, large-bandpass data (e.g. 5–24 keV energy range) and monochromatic data can be processed, the main requirement being prior knowledge of the unit cell. Furthermore, angles calculated in the vicinity of a few theoretical and experimental reciprocal-lattice vectors are compared, and only vectors with the highest number of common angles are selected as candidates to obtain the orientation matrix. Global matching on the entire pattern is then checked. Four indexing options are available, two for the ranking of the theoretical reciprocal-lattice vectors and two for reducing the number of possible candidates. Furthermore, the algorithm has been used to index several data sets collected under different experimental conditions on a series of model samples. Additionally, knowing the crystallographic structure of the sample and using this information to rank the theoretical reflections based on the structure factors helps the indexing of large-bandpass data for the largest-unit-cell samples. For small-bandpass data, shortening the candidate list to determine the orientation matrix should be based on matching pairs of reciprocal-lattice vectors instead of triplet matching.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Towards the extraction of the crystal cell parameters from pair distribution function profiles

The approach based on atomic pair distribution function (PDF) has revolutionized structural investigations by X-ray/electron diffraction of nano or quasi-amorphous materials, opening up the possibility of exploring short-range order. However, the ab initio crystal structural solution by the PDF is far from being achieved due to the difficulty in determining the crystallographic properties of the unit cell. A method for estimating the crystal cell parameters directly from a PDF profile is presented, which is composed of two steps: first, the type of crystal cell is inferred using machine-learning approaches applied to the PDF profile; second, the crystal cell parameters are extracted by means of multivariate analysis combined with vector superposition techniques. The procedure has been validated on a large number of PDF profiles calculated from known crystal structures and on a small number of measured PDF profiles. The lattice determination step has been benchmarked by a comprehensive exploration of different classifiers and different input data. The highest performance is obtained using the k -nearest neighbours classifier applied to whole PDF profiles. Descriptors calculated from the PDF profiles by recurrence quantitative analysis produce results that can be interpreted in terms of PDF properties, and the significance of each descriptor in determining the prediction is evaluated. The cell parameter extraction step depends on the cell metric rather than its type. Monometric, dimetric and trimetric cells have top-1 estimates that are correct 40, 20 and 5% of the time, respectively. Promising results were obtained when analysing real nanocrystals, where unit cells close to the true ones are found within the top-1 ranked solution in the case of monometric cells and within the top-6 ranked solutions in the case of dimetric cells, even in the presence of a crystalline impurity with a weight fraction up to 40%.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Towards a machine-readable literature: finding relevant papers based on an uploaded powder diffraction pattern

A prototype application for machine-readable literature is investigated. The program is called pyDataRecognition and serves as an example of a data-driven literature search, where the literature search query is an experimental data set provided by the user. The user uploads a powder pattern together with the radiation wavelength. The program compares the user data to a database of existing powder patterns associated with published papers and produces a rank ordered according to their similarity score. The program returns the digital object identifier and full reference of top-ranked papers together with a stack plot of the user data alongside the top-five database entries. The paper describes the approach and explores successes and challenges.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Why is the winner the best?

International benchmarking competitions have become fundamental for the comparative performance assessment of image analysis methods. However, little attention has been given to investigating what can be learnt from these competitions. Do they really generate scientific progress? What are common and successful participation strategies? What makes a solution superior to a competing method? To address this gap in the literature, we performed a multi- center study with all 80 competitions that were conducted in the scope of IEEE ISBI 2021 and MICCAI 2021. Statistical analyses performed based on comprehensive descriptions of the submitted algorithms linked to their rank as well as the underlying participation strategies revealed common characteristics of winning solutions. These typically include the use of multi-task learning (63%) and/or multi-stage pipelines (61%), and a focus on augmentation (100%), im- age preprocessing (97%), data curation (79%), and post- processing (66%). The “typical” lead of a winning team is a computer scientist with a doctoral degree, five years of experience in biomedical image analysis, and four years of experience in deep learning. Two core general development strategies stood out for highly-ranked teams: the reflection of the metrics in the method design and the focus on analyzing and handling failure cases. According to the organizers, 43% of the winning algorithms exceeded the state of the art but only 11% completely solved the respective domain problem. The insights of our study could help researchers (1) improve algorithm development strategies when approaching new problems, and (2) focus on open research questions revealed by this work.

Eisenmann, Matthias↗
DOE OSTI2025

SymProp: Scaling Sparse Symmetric Tucker Decomposition via Symmetry Propagation

Sparse symmetric tensors are an important class of tensors, and their decompositions serve as powerful tools for revealing low-rank structures. This paper introduces SymProp, a novel approach for scaling sparse symmetric Tucker decomposition by propagating symmetry through intermediate computations. SymProp optimizes two key computational kernels: Sparse Symmetric Tensor Times Same Matrix chain (S3 TTMc) for Higher-Order Orthogonal Iteration (HOOI) and Sparse Symmetric Tensor Times Same Matrix chain Times Core (S3 TTMcTC) for Higher-Order QR Iteration (HOQRI). Our method employs a metaprogramming-based index iteration approach to efficiently handle the upper triangular parts of intermediate dense symmetric tensors. SymProp achieves up to 50.9× speedup over SPLATT and up to 360.8× over Compressed Sparse Symmetric (CSS) format on the S3 TTMc operation. Moreover, our S3 TTMc and S3 TTMcTC implementations support tensor orders four levels higher than state-of-the-art methods. Our HOQRI demonstrates superior scalability and up to a 33.6× speedup over optimized HOOI. By enabling more scalable Tucker decompositions for higher orders, decomposition ranks, and dimension sizes, SymProp opens new possibilities for analyzing complex hypergraph structures in fields such as network science, data mining, and machine learning.

Li, Zecheng [North Carolina State University]↗
DOE OSTI2020

Robust Matrix Completion State Estimation in Distribution Systems

Due to the insufficient measurements in the distribution system state estimation (DSSE), full observability and redundant measurements are difficult to achieve without using the pseudo measurements. The matrix completion state estimation (MCSE) combines the matrix completion and power system model to estimate voltage by exploring the low-rank characteristics of the matrix. This paper proposes a robust matrix completion state estimation (RMCSE) to estimate the voltage in a distribution system under a low-observability condition. Tradition state estimation weighted least squares (WLS) method requires full observability to calculate the states and needs redundant measurements to proceed a bad data detection. The proposed method improves the robustness of the MCSE to bad data by minimizing the rank of the matrix and measurements residual with different weights. It can estimate the system state in a low-observability system and has robust estimates without the bad data detection process in the face of multiple bad data. The method is numerically evaluated on the IEEE 33-node radial distribution system. The estimation performance and robustness of RMCSE are compared with the WLS with the largest normalized residual bad data identification (WLS-LNR), and the MCSE.

24 POWER TRANSMISSION AND DISTRIBUTION↗