Search NASA⌕ Search

SEARCH · Search NASA

Results for “Ranking methods”

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 631 records · Page 35
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

A long short-term memory embedding for hybrid uplifted reduced order models

In this paper, we introduce an uplifted reduced order modeling (UROM) approach through the integration of standard projection based methods with long short-term memory (LSTM) embedding. Our approach has three modeling layers or components. In the first layer, we utilize an intrusive projection approach to model dynamics represented by the largest modes. The second layer consists of an LSTM model to account for residuals beyond this truncation. This closure layer refers to the process of including the residual effect of the discarded modes into the dynamics of the largest scales. However, the feasibility of generating a low rank approximation tails off for higher Kolmogorov n -width systems due to the underlying nonlinear processes. The third uplifting layer, called super-resolution, addresses this limited representation issue by expanding the span into a larger number of modes utilizing the versatility of LSTM. Therefore, our model integrates a physics-based projection model with a memory embedded LSTM closure and an LSTM based super-resolution model. In several applications, we exploit the use of Grassmann manifold to construct UROM for unseen conditions. We performed numerical experiments by using the Burgers and Navier-Stokes equations with quadratic nonlinearity. Finally, our results show robustness of the proposed approach in building reduced order models for parameterized systems and confirm the improved trade-off between accuracy and efficiency.

42 ENGINEERING↗
DOE OSTI2024

Anomaly Detection in Connected and Autonomous Vehicle Trajectories Using LSTM Autoencoder and Gaussian Mixture Model

Connected and Autonomous Vehicles (CAVs) technology has the potential to transform the transportation system. Although these new technologies have many advantages, the implementation raises significant concerns regarding safety, security, and privacy. Anomalies in sensor data caused by errors or cyberattacks can cause severe accidents. To address the issue, this study proposed an innovative anomaly detection algorithm, namely the LSTM Autoencoder with Gaussian Mixture Model (LAGMM). This model supports anomalous CAV trajectory detection in the real-time leveraging communication capabilities of CAV sensors. The LSTM Autoencoder is applied to generate low-rank representations and reconstruct errors for each input data point, while the Gaussian Mixture Model (GMM) is employed for its strength in density estimation. The proposed model was jointly optimized for the LSTM Autoencoder and GMM simultaneously. The study utilizes realistic CAV data from a platooning experiment conducted for Cooperative Automated Research Mobility Applications (CARMAs). The experiment findings indicate that the proposed LAGMM approach enhances detection accuracy by 3% and precision by 6.4% compared to the existing state-of-the-art methods, suggesting a significant improvement in the field.

33 ADVANCED PROPULSION SYSTEMS↗
NASA NTRS1989

MIL-C-38999 electrical connector applicability tests for on-orbit EVA satellite servicing

MIL-C-38999 electrical connectors were tested for their applicability to the on-orbit EVA satellite servicing environment. The investigation provided a methodical approach to the evaluation of the human-machine interface of these connectors. The physical characteristics of thirty-five MIL-C-38999 connectors were tested in two simulated space environments, the NASA Johnson Space Center Weightless Environment Training Facility and an evacuated glovebox which incorporated the Extravehicular Maneuvering Unit series 3000 gloves. Physical characteristics of the connectors were documented, including operating torque and work profiles. STS crewmembers tested a select group of connectors in two WETF test and subjectively ranked the G&H PMM Wing-Tab connectors as most applicable to the on-orbit servicing environment. WETF performance times indicated that the G&H PMM Wing-Tab connector had the fastest operating time. The evacuated glovebox participants ranked the G&H 64600 Wing-Tab and the G&H PMM Wing-Tab connectors as those most applicable to the on-orbit servicing environment. During the evacuated glovebox tests, the G&H 64600 Wing-Tab connector had the fastest operating time.

Griffin, Thomas J.↗
DOE OSTI2021

A Flexible Power Method for Solving Infinite Dimensional Tensor Eigenvalue Problems

We propose a flexible power method for computing the leftmost, i.e., algebraically smallest, eigenvalue of an infinite dimensional tensor eigenvalue problem, $H x = \lambda x$, where the infinite dimensional symmetric matrix $H$ exhibits a translational invariant structure. We assume the smallest eigenvalue of $H$ is simple and apply a power iteration of $e^{-H}$ with the eigenvector represented in a compact way as a translational invariant infinite Tensor Ring (iTR). Hence, the infinite dimensional eigenvector can be represented by a finite number of iTR cores of finite rank. In order to implement this power iteration, we use a small parameter $t$ so that the infinite matrix-vector operation $e^{-Ht}x$ can efficiently be approximated by the Lie product formula, also known as Suzuki--Trotter splitting, and we employ a low rank approximation through a truncated singular value decomposition on the iTR cores in order to keep the cost of subsequent power iterations bounded. We also use an efficient way for computing the iTR Rayleigh quotient and introduce a finite size iTR residual which is used to monitor the convergence of the Rayleigh quotient and to modify the timestep $t$. In this paper, we discuss 2 different implementations of the flexible power algorithm and illustrate the automatic timestep adaption approach for several numerical examples.

Beeumen, Roel Van↗
DOE OSTI2021

Latent map Gaussian processes for mixed variable metamodeling

Gaussian processes (GPs) are ubiquitously used in sciences and engineering as metamodels. Standard GPs, however, can only handle numerical or quantitative variables. Here we introduce latent map Gaussian processes (LMGPs) that inherit the attractive properties of GPs and are also applicable to mixed data which have both quantitative and qualitative inputs. The core idea behind LMGPs is to learn a continuous, low-dimensional latent space or manifold which encodes all qualitative inputs. To learn this manifold, we first assign a unique prior vector representation to each combination of qualitative inputs. We then use a low-rank linear map to project these priors on a manifold that characterizes the posterior representations. As the posteriors are quantitative, they can be directly used in any standard correlation function such as the Gaussian or Matern. Hence, the optimal map and the corresponding manifold, along with other hyperparameters of the correlation function, can be systematically learned via maximum likelihood estimation. Through a wide range of analytic and real-world examples, we demonstrate the advantages of LMGPs over state-of-the-art methods in terms of accuracy and versatility. In particular, we show that LMGPs can handle variable-length inputs, have an explainable neural network interpretation, and provide insights into how qualitative inputs affect the response or interact with each other. We also employ LMGPs in Bayesian optimization and illustrate that they can discover optimal compound compositions more efficiently than conventional methods that convert compositions to qualitative variables via manual featurization.

42 ENGINEERING↗
DOE OSTI2020

Correlation-Aided Robust Decentralized Dynamic State Estimation of Power Systems with Unknown Control Inputs

This paper proposes a correlation-aided robust adaptive unscented Kalman filter for power system decentralized dynamic state estimation with unknown inputs, termed as robust AUKF-UI. The temporal and spatial correlations among the unknown inputs are used to derive a vector auto-regressive (VAR) model in an adaptive manner. This VAR model is further integrated together with state transition and measurement models for joint state and unknown inputs estimation. This allows taking into account the implicit cross-correlations between the states and the unknown inputs. As a result, the rank requirement for unknown input vector estimation is relaxed and the local generator frequency measurement is not required. The temporal correlations of time series innovation vectors, predicted state and input vectors are also leveraged by the robust AUKFUI to detect, identify and process bad data. Without these correlations, it is very challenging to address bad data with unknown inputs. Simulation results carried out on the IEEE 39-bus system demonstrate that the proposed robust AUKF-UI achieves much better results than other methods in the presence of low measurement redundancy, strong nonlinearity, and bad data.

Zhao, Junbo↗
DOE OSTI2020

Giant Wilson loops and AdS 2 /dCFT 1

The 1/2-BPS Wilson loop in N = 4 supersymmetric Yang-Mills theory is an important and well-studied example of conformal defect. In particular, much work has been done for the correlation functions of operator insertions on the Wilson loop in the fundamental representation. In this paper, we extend such analyses to Wilson loops in the large-rank symmetric and antisymmetric representations, which correspond to probe D3 and D5 branes with AdS 2 × S 2 and AdS 2 × S 4 worldvolume geometries, ending at the AdS 5 boundary along a one-dimensional contour. We first compute the correlation functions of protected scalar insertions from supersymmetric localization, and obtain a representation in terms of multiple integrals that are similar to the eigenvalue integrals of the random matrix, but with important differences. Using ideas from the Fermi Gas formalism and the Clustering method, we evaluate their large N limit exactly as a function of the ’t Hooft coupling. The results are given by simple integrals of polynomials that resemble the Q-functions of the Quantum Spectral Curve, with integration measures depending on the number of insertions. Next, we study the correlation functions of fluctuations on the probe D3 and D5 branes in AdS. We compute a selection of three- and four-point functions from perturbation theory on the D-branes, and show that they agree with the results of localization when restricted to supersymmetric kinematics. We also explain how the difference of the internal geometries of the D3 and D5 branes manifests itself in the localization computation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
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↗
NASA NTRS2001

Methodology Development for Assessment of Spaceport Technology Returns and Risks

As part of Kennedy Space Center's (KSC's) challenge to open the space frontier, new spaceport technologies must be developed, matured and successfully transitioned to operational systems. R&D investment decisions can be considered from multiple perspectives. Near mid and far term technology horizons must be understood. Because a multitude of technology investment opportunities are available, we must identify choices that promise the greatest likelihood of significant lifecycle At the same time, the costs and risks of any choice must be well understood and balanced against its potential returns The problem is not one of simply rank- ordering projects in terms of their desirability. KSC wants to determine a portfolio of projects that simultaneously satisfies multiple goals, such as getting the biggest bang for the buck, supporting projects that may be too risky for private funding, staying within annual budget cycles without foregoing the requirements of a long term technology vision, and ensuring the development of a diversity of technologies that, support the variety of operational functions involved in space transportation. This work aims to assist in the development of in methods and techniques that support strategic technology investment decisions and ease the process of determining an optimal portfolio of spaceport R&D investments. Available literature on risks and returns to R&D is reviewed and most useful pieces are brought to the attention of the Spaceport Technology Development Office (STDO). KSC's current project management procedures are reviewed. It is found that the "one size fits all" nature of KSC's existing procedures and project selection criteria is not conducive to prudent decision-making. Directions for improving KSC's - procedures and criteria are outlined. With help of a contractor, STDO is currently developing a tool, named Change Management Analysis Tool (CMAT)/ Portfolio Analysis Tool (PAT), to assist KSC's R&D portfolio determination. A critical review of CMAT/PAT is undertaken. Directions for the improvement of this tool are provided. STDO and KSC intend to follow up on many, if not all, of the recommendations provided.

Joglekar, Prafulla↗
DOE OSTI2022

MRI-Based Radiotherapy Planning to Reduce Rectal Dose in Excess of Tolerance

Background and Purpose. Chronic rectal toxicity significantly decreases the quality of life for men who receive radiotherapy for prostate cancer. The most significant predictor of rectal toxicity is rectal dose-volume exceeding tolerance. To minimize the volume of rectum in the high dose field, it is essential to accurately define the prostate-rectum interface. This can be challenging to do by computed tomography (CT) imaging alone. The current study was undertaken to formally demonstrate in a clinical trial setting that image-guided intensity-modulated radiation therapy (IG-IMRT) planning using magnetic resonance imaging (MRI) can reduce the volume of rectum exceeding 70 Gy, a validated metric that predicts the risk of late rectal toxicity. Materials and Methods. This prospective single-arm study enrolled 15 men treated with IG-IMRT for localized prostate cancer. All participants received a dedicated 3 Tesla MRI examination of the prostate in addition to a pelvic CT examination for treatment planning. Two volumetric modulated arc therapy (VMAT) plans with a prescription dose of 79.2 Gy were designed using identical constraints based on CT- and MRI-defined consensus volumes. The volume of rectum exposed to 70 Gy or more was compared using the Wilcoxon paired signed rank test. Results. For CT-based treatment plans, the median volume of rectum receiving 70 Gy or more was 9.3 cubic centimeters (cc) (IQR 7.0 to 10.2) compared with 4.9 cc (IQR 4.1 to 7.8) for MRI-based plans. This resulted in a median volume reduction of 2.1 cc (IQR 0.5 to 5.3, P < .001). Conclusions. Using MRI to plan prostate IG-IMRT to a dose of 79.2 Gy reduces the volume of rectum receiving radiation dose in excess of tolerance (70 Gy or more) and should be considered in men who are at high risk for late rectal toxicity and are not good candidates for other rectal sparing techniques such as hydrogel spacer. This trial is registered with NCT02470910.

Schmidt, Daniel R.↗
NASA NTRS2022

Computing Sensitivities in Evolutionary Systems: A Real-time Reduced Order Modeling Strategy

We present a new methodology for computing sensitivities in evolutionary systems using a model-driven low-rank approximation. To this end, we formulate a variational principle that seeks to minimize the distance between the time derivative of the reduced approximation and sensitivity dynamics. The first order optimality condition of the variational principle leads to a system of closed form evolution equations for an orthonormal basis and corresponding sensitivity coefficients. This approach allows for the computation of sensitivities with respect to a large number of parameters in an accurate and tractable manner by extracting correlations between different sensitivities on the fly. The presented method requires solving forward evolution equations, sidestepping the restrictions imposed by the forward/backward workflow of adjoint sensitivities. For example, the presented method, unlike the adjoint equation, does not impose any input/output load and can be used in applications in which real-time sensitivities are of interest. We demonstrate the utility of the method for three test cases: (1) computing sensitivity with respect to model parameters in the Rössler system, (2) computing sensitivity with respect to an infinite-dimensional forcing parameter in the chaotic Kuramoto--Sivashinsky equation, and (3) computing sensitivity with respect to reaction parameters for species transport in a turbulent reacting flow.

Reduced order model↗
DOE OSTI2023

Predicting Postoperative Injury and Military Discharge Status After Knee Surgery in the US Army

Background: Researchers have assessed postoperative injury or disability predictors in the military setting but typically focused on 1 type of surgical procedure at a time, used relatively small sample sizes, or investigated mixed cohorts with civilian populations. Purpose: To identify the relationship between baseline variables and injury incidence or military discharge status in US Army soldiers after knee surgery. Study Design: Case-control study; Level of evidence, 3. Methods: Data were obtained from a repository containing personnel, performance, and medical records for all active-duty US Army soldiers. Multivariate logistic regressions were used to estimate the effects of numerous variables on postoperative injury or on medical discharge. Variable selection and model validation were conducted using the k-fold method. Results: A total of 7567 soldiers underwent knee surgery between 2017 and 2019. Meniscal procedures were the most common type of surgery (39%), and approximately 71% of the cohort had a postoperative injury. Significant predictors for sustaining a postoperative injury included having a previous nonknee injury (odds ratio [OR], 1.5), female sex (OR, 1.3), and Black race (OR, 1.2). Within 4 years after surgery, 17% of soldiers were discharged from the military because of knee-related disability. Significant predictors for discharge from duty included enlisted rank (OR, 2.3), recent fitness test failure (OR, 1.9), number of previous knee surgeries (OR, 1.7), and having a previous nonknee injury (OR, 1.6). Conclusion: After knee surgery, nearly three-fourths of the soldiers in this cohort sustained a postoperative injury and almost one-fifth of soldiers were medically discharged from the military within 4 years. This study identified variables that indicate statistically increased risk for these postoperative outcomes and highlighted potentially modifiable factors.

Orthopedics↗
DOE OSTI2025

Chiral rank-$k$ truncations for the multigrid preconditioner of Wilson fermions in lattice QCD

We present a modification to the setup algorithm for the multigrid preconditioner of Wilson fermions in lattice QCD. A larger number of test vectors than that used in conventional multigrid is generated by the smoother. This set of test vectors is then truncated by a singular value decomposition on the chiral components of the test vectors, which are subsequently used to form the prolongation and restriction matrices of the multigrid hierarchy. This modification is demonstrated to improve the convergence of linear equations on an anisotropic lattice with 𝑚𝜋 ≈ 280 MeV from the Hadron Spectrum Collaboration and an isotropic lattice with 𝑚𝜋 ≈ 220 MeV from the MILC Collaboration. The lattice volume dependence of the method is also examined.

Whyte, Travis [Jülich Supercomputing Center, Jülic↗
DOE OSTI2025

Economic Evaluation of Modernization Expenditures for Electric Utility Distribution Systems: A Guide for Utility Regulators

Cost-effectiveness evaluation of potential grid modernization solutions is integral to integrated distribution system planning (IDSP). This report synthesizes and updates prior cost-effectiveness approaches identified by the U.S. Department of Energy for grid modernization investments, incorporating multi-objective decision-making. The structure of the report follows the IDSP process, from identifying objectives and priorities to prioritizing grid solutions. The report details two methods for conducting initial cost-effectiveness screening of individual and interdependent grid components: (1) Lowest Reasonable Cost and (2) Benefit-Cost Analysis. Drawing on solutions that passed the initial cost-effectiveness screen, the utility prioritizes grid solutions based on policy objectives and priorities, regulatory compliance, operational efficiencies, and other factors to develop a portfolio of distribution solutions. The utility uses multi-objective decision-making to assess each proposed expenditure against each objective and respective metric. The utility applies a weighting factor, reflecting the priority ranking of the objective, to the total numerical “score” based on the contribution of the proposed solution to addressing each objective. Ultimately, the utility ranks each expenditure from highest to lowest priority using the final score for each solution as well as its cost. The report includes examples of emerging best practices for states and utilities and a cost-effectiveness process checklist.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Decentralized Low-Rank State Estimation for Power Distribution Systems

This article considers the low-observability state estimation problem in power distribution networks and develops a decentralized state estimation algorithm leveraging the matrix completion methodology. Matrix completion has been shown to be an effective technique in state estimation that exploits the low dimensionality of the power system measurements to recover missing information. This technique can utilize an approximate (linear) load flow model, or it can be used with no physical models in a network where no information about the topology or line admittance is available. The direct application of matrix completion algorithms requires solving a semi-definite programming (SDP) problem, which becomes computationally challenging for large networks. We therefore develop a decentralized algorithm that capitalizes on the popular proximal alternating direction method of multipliers (proximal ADMM). The method allows us to distribute the computation among different areas of the network, leading to a scalable algorithm. By doing all computations at individual control areas and only communicating with neighboring areas, the algorithm eliminates the need for data to be sent to a central processing unit and thus increases efficiency and contributes to the goal of autonomous control of distribution networks. We illustrate the advantages of the proposed algorithm numerically using standard IEEE test cases.

41 EE - Solar Energy Technologies Office (EE-4S)↗
NASA NTRS2002

Onboard Autonomous Rock Shape Analysis for Mars Rovers

In the quest to maximize the scientific return of future robotic missions, it is imperative that our rovers be capable of determining the importance of the science they collect so that they may prioritize the acquisition and relay of that data. As an important step in this process, we present an automated technique to allow a rover to classify the shape and other geologic characteristics of rocks from two-dimensional photographic images and three-dimensional stereographically produced data. Experiments were conducted in the Matlab environment using images returned by JPL's Mars Pathfinder mission. Our method begins by first segmenting the rocks from the background using a combination of image intensity and height data. Various metrics are then used to classify the region's sphericity, roundness, and other geometric properties. Preliminary experiments to determine the most useful metrics were conducted by characterizing the two-dimensional rock shape while the three-dimensional shape was later studied with metrics derived from these two-dimensional techniques. Seven measures were developed and implemented. The performance of each measure was characterized by analyzing imagesfrom the Pathfinder mission and ranking the rocks according to the measured properties. Combined, the measures would provide a tool by which an automated rover could discover a greater amount of information about the data it collects, leading to a more productive mission.

image segmentation↗
DOE OSTI2022

Reverse-mode differentiation in arbitrary tensor network format: with application to supervised learning.

This paper describes an efficient reverse-mode differentiation algorithm for contraction operations of tensor networks that may have arbitrary and unconventional network topologies. The approach leverages the tensor contraction tree of Evenbly and Pfeifer (2014), which provides an instruction set for the contraction sequence of a network. We show that this tree can be efficiently leveraged for differentiation of a full tensor network contraction using a recursive scheme that exploits (1) the bilinear property of contraction and (2) the property that trees have single path from root to leaves. While differentiation of tensor-tensor contraction is already possible in most automatic differentiation packages, we show that exploiting these two additional properties in the specific context of contraction sequences can improve efficiency. Following a description of the algorithm and computational complexity analysis, we investigate its utility for gradient-based supervised learning for low-rank function recovery and for fitting real-world unstructured datasets. We demonstrate improved performance over alternating least-squares optimization approaches and the capability to handle heterogeneous and arbitrary tensor network formats. When compared to alternating minimization algorithms, we find that the gradient-based approach requires a smaller oversampling ratio (number of samples compared to number model parameters) for recovery. This increased efficiency extends to fitting unstructured data of varying dimensionality and when employing a variety of tensor network formats. Here, we show improved learning using the hierarchical Tucker method over the tensor-train in high-dimensional settings on a number of benchmark problems.

97 MATHEMATICS AND COMPUTING↗