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 127 records · Page 7

Geometry-complete perceptron networks for 3D molecular graphs

Abstract Motivation The field of geometric deep learning has recently had a profound impact on several scientific domains such as protein structure prediction and design, leading to methodological advancements within and outside of the realm of traditional machine learning. Within this spirit, in this work, we introduce GCPNet, a new chirality-aware SE(3)-equivariant graph neural network designed for representation learning of 3D biomolecular graphs. We show that GCPNet, unlike previous representation learning methods for 3D biomolecules, is widely applicable to a variety of invariant or equivariant node-level, edge-level, and graph-level tasks on biomolecular structures while being able to (1) learn important chiral properties of 3D molecules and (2) detect external force fields. Results Across four distinct molecular-geometric tasks, we demonstrate that GCPNet’s predictions (1) for protein–ligand binding affinity achieve a statistically significant correlation of 0.608, more than 5%, greater than current state-of-the-art methods; (2) for protein structure ranking achieve statistically significant target-local and dataset-global correlations of 0.616 and 0.871, respectively; (3) for Newtownian many-body systems modeling achieve a task-averaged mean squared error less than 0.01, more than 15% better than current methods; and (4) for molecular chirality recognition achieve a state-of-the-art prediction accuracy of 98.7%, better than any other machine learning method to date. Availability and implementation The source code, data, and instructions to train new models or reproduce our results are freely available at https://github.com/BioinfoMachineLearning/GCPNet.

59 BASIC BIOLOGICAL SCIENCES↗

Capturing many-body correlation effects with quantum and classical computing

Theoretical descriptions of excited states of molecular systems in high-energy regimes are crucial for supporting and driving many experimental efforts at light source facilities. However, capturing their complicated correlation effects requires formalisms that provide a hierarchical infrastructure of approximations. These approximations lead to an increased overhead in classical computing methods and, therefore, decisions regarding the ranking of approximations and the quality of results must be made on purely numerical grounds. The emergence of quantum computing methods has the potential to change this situation. Here, in this study, we demonstrate the efficiency of the quantum phase estimator (QPE) in identifying core-level states relevant to x-ray photoelectron spectroscopy. We compare and validate the QPE predictions with exact diagonalization and real-time equation-of-motion coupled-cluster formulations, which are some of the most accurate methods for states dominated by collective correlation effects.

74 ATOMIC AND MOLECULAR PHYSICS↗

GPU acceleration of rank-reduced coupled-cluster singles and doubles

Here, we have developed a graphical processing unit (GPU) accelerated implementation of our recently introduced rank-reduced coupled-cluster singles and doubles (RR-CCSD) method. RR-CCSD introduces a low-rank approximation of the doubles amplitudes. This is combined with a low-rank approximation of the electron repulsion integrals via Cholesky decomposition. The result of these two low-rank approximations is the replacement of the usual fourth-order CCSD tensors with products of second- and third-order tensors. In our implementation, only a single fourth-order tensor must be constructed as an intermediate during the solution of the amplitude equations. Owing in large part to the compression of the doubles amplitudes, the GPU-accelerated implementation shows excellent parallel efficiency (95% on eight GPUs). Our implementation can solve the RR-CCSD equations for up to 400 electrons and 1550 basis functions—roughly 50% larger than the largest canonical CCSD computations that have been performed on any hardware. In addition to increased scalability, the RR-CCSD computations are faster than the corresponding CCSD computations for all but the smallest molecules. We test the accuracy of RR-CCSD for a variety of chemical systems including up to 1000 basis functions and determine that accuracy to better than 0.1% error in the correlation energy can be achieved with roughly 95% compression of the ov space for the largest systems considered. We also demonstrate that conformational energies can be predicted to be within 0.1 kcal mol -1 with efficient compression applied to the wavefunction. Finally, we find that low-rank approximations of the CCSD doubles amplitudes used in the similarity transformation of the Hamiltonian prior to a conventional equation-of-motion CCSD computation will not introduce significant errors (on the order of a few hundredths of an electronvolt) into the resulting excitation energies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

CASTELO: clustered atom subtypes aided lead optimization—a combined machine learning and molecular modeling method

Background: Drug discovery is a multi-stage process that comprises two costly major steps: pre-clinical research and clinical trials. Among its stages, lead optimization easily consumes more than half of the pre-clinical budget. We propose a combined machine learning and molecular modeling approach that partially automates lead optimization workflow in silico, providing suggestions for modification hot spots. Results: The initial data collection is achieved with physics-based molecular dynamics simulation. Contact matrices are calculated as the preliminary features extracted from the simulations. To take advantage of the temporal information from the simulations, we enhanced contact matrices data with temporal dynamism representation, which are then modeled with unsupervised convolutional variational autoencoder (CVAE). Finally, conventional and CVAE-based clustering methods are compared with metrics to rank the submolecular structures and propose potential candidates for lead optimization. Conclusion: With no need for extensive structure-activity data, our method provides new hints for drug modification hotspots which can be used to improve drug potency and reduce the lead optimization time. It can potentially become a valuable tool for medicinal chemists.

59 BASIC BIOLOGICAL SCIENCES↗

Sensitivity Analysis of the Human Research Program’s Impact 1.0 Model

Sensitivity analysis estimates the relative contribution of the uncertainty in input values to the uncertainty of model outputs. Partial Rank Correlation Coefficient (PRCC) and Leave One Out (LOO) are methods of conducting sensitivity analysis on non-linear simulation models like the IMPACT Model. The PRCC method estimates the sensitivity using partial correlation of the ranks of the generated input values to each generated output value. The “partial” part is due to the adjustments made for the linear effects of all the other input values in the calculation of correlation between a particular input and each output. LOO removes a medical condition from test suite and calculates the change in the outcome. This is used to identify the influence of the condition input in the model The inputs to the sensitivity procedures include the number of occurrences of each of the one hundred plus IMPACT medical conditions generated over the simulations, and the IMPACT outputs from the MEDPRAT mathematical model. The outputs total task time lost (TTL), number of return to definitive care (RTDC), and number of loss of crew lives (LOCL). The IMPACT team will report the results of using PRCC and LOO on IMPACT 1.0. Tornado plots will assist in the visualization of the condition-related input sensitivities to each of the main outcomes. The outcomes of this sensitivity analysis will drive review focus by identifying conditions where changes in uncertainty, and input values could drive changes in overall model output uncertainty. These efforts are an integral part of the overall verification, validation, and credibility review of IMPACT 1.0.

Sensitivity Anaylsis↗

Artificial neural network prediction of self-diffusion in pure compounds over multiple phase regimes

Artificial neural networks (ANNs) were developed to accurately predict the self-diffusion constants for pure components in liquid, gas and super critical phases. The ANNs were tested on an experimental database of 6625 self-diffusion constants for 118 different chemical compounds. The presence of multiple phases results in a heavy skew in the distribution of diffusion constants and multiple approaches were used to address this challenge. First, an ANN was developed with the raw diffusion values to assess what the main drawbacks of this direct method were. The first approach for improving the predictions involved taking the log 10 of diffusion to provide a more uniform distribution and reduce the range of target output values used to develop the ANN. The second approach involved developing individual ANNs for each phase using the raw diffusion values. Results show that the log transformation leads to a model with the best self-diffusion constant predictions and an overall average absolute deviation (AAD) of 6.56%. The resultant ANN is a generalized model that can be used to predict diffusion across all three phases and over a diverse group of compounds. The importance of each input feature was ranked using a feature addition method revealing that the density of the compound has the largest impact on the ANN prediction of self-diffusion constants in pure compounds.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Recursive algorithms for vector extrapolation methods

Three classes of recursion relations are devised for implementing some extrapolation methods for vector sequences. One class of recursion relations can be used to implement methods like the modified minimal polynomial extrapolation and the topological epsilon algorithm; another allows implementation of methods like minimal polynomial and reduced rank extrapolation; while the remaining class can be employed in the implementation of the vector E-algorithm. Operation counts and storage requirements for these methods are also discussed, and some related techniques for special applications are also presented. Included are methods for the rapid evaluations of the vector E-algorithm.

Ford, William F.↗

Ultrasonic evaluation of the strength of unidirectional graphite-polyimide composites

An acoustic-ultrasonic method is described that was successful in ranking unidirectional graphite-polyimide composite specimens according to variations in interlaminar shear strength. Using this method, a quantity termed the stress wave factor was determined. It was found that this factor increases directly with interlaminar shear strength. The key variables in this investigation were composite density, fiber weight fraction, and void content. The stress wave factor and other ultrasonic factors that were studied were found to provide a powerful means for nondestructive evaluation of mechanical strength properties.

Vary, A.↗

Factorization of Binary Matrices: Rank Relations, Uniqueness and Model Selection of Boolean Decomposition

The application of binary matrices are numerous. Representing a matrix as a mixture of a small collection of latent vectors via low-rank decomposition is often seen as an advantageous method to interpret and analyze data. In this work, we examine the factorizations of binary matrices using standard arithmetic (real and nonnegative) and logical operations (Boolean and $\mathbb{Z}$ 2 ). We examine the relationships between the different ranks, and discuss when factorization is unique. In particular, we characterize when a Boolean factorization X = W$\land$H has a unique W, a unique H (for a fixed W), and when both W and H are unique, given a rank constraint. We introduce a method for robust Boolean model selection, called BMFk, and show on numerical examples that BMFk not only accurately determines the correct number of Boolean latent features but reconstruct the pre-determined factors accurately.

97 MATHEMATICS AND COMPUTING↗

The effect of changes in the USF/NASA toxicity screening test method on data from some cellular polymers

Rankings of relative toxicity can be markedly affected by changes in test variables. Revision of the USF/NASA toxicity screening test procedure to eliminate the connecting tube and supporting floor and incorporate a 1.0 g sample weight, 200 C starting temperature, and 800 C upper limit temperature for pyrolysis, reversed the rankings of flexible polyurethane and polychloroprene foams, not only in relation to each other, but also in relation to cotton and red oak. Much of the change is attributed to reduction of the distance between the sample and the test animals, and reduction of the sample weight charged. Elimination of the connecting tube increased the relative toxicity of the polyurethane foams. The materials tested were flexible polyurethane foam, without and with fire retardant; rigid polyurethane foam with fire retardant; flexible polychloroprene foam; cotton, Douglas fir, red oak, hemlock, hardboard, particle board, polystyrene, and polymethyl methacrylate.

Hilado, C. J.↗

Applications of singular value analysis and partial-step algorithm for nonlinear orbit determination

An adaptive method in which cruise and nonlinear orbit determination problems can be solved using a single program is presented. It involves singular value decomposition augmented with an extended partial step algorithm. The extended partial step algorithm constrains the size of the correction to the spacecraft state and other solve-for parameters. The correction is controlled by an a priori covariance and a user-supplied bounds parameter. The extended partial step method is an extension of the update portion of the singular value decomposition algorithm. It thus preserves the numerical stability of the singular value decomposition method, while extending the region over which it converges. In linear cases, this method reduces to the singular value decomposition algorithm with the full rank solution. Two examples are presented to illustrate the method's utility.

Ryne, Mark S.↗

Formal methods approach to the charging facility location problem for battery electric vehicles

Battery electric vehicles (BEVs) are becoming more prevalent as improvements in battery technology and energy management continue to be made. As the number of electric vehicles grows, the demand for fast-charging stations is expected to increase dramatically. Thus, building new charging station infrastructure efficiently will be key to reducing upfront costs while meeting consumer demands. In this work, we propose a method for choosing a set of charging station locations that are optimized based on a set of given common vehicle demand points. As part of this solution, we also offer a novel abstraction of the road network on which energy-efficient paths that account for charge-time delays may be found. The current algorithm chooses the optimal charging locations for a single agent which has a route objective specified using temporal logic. To demonstrate the proposed method, the running example shows how a charging station could be chosen for an electric delivery vehicle. Simulations were run on sample road networks with a given set of demand points to service and potential charging station locations to compare. The method is shown to successfully rank potential charging stations in terms of their expected average charging time cost.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Sensitivity Analysis of MFiX-PIC Parameters Using Nodeworks, PSUADE, and DAKOTA

The study presented in this report was aimed to demonstrate UQ analysis performed not only with Nodeworks, but also two other well-established UQ software tools from the U.S. DOE’s National Laboratories (PSUADE from Lawrence Livermore National Laboratory and DAKOTA from Sandia National Laboratory). It is important to emphasize that the motivation of this study was not to determine the best UQ software, but to verify if the global sensitivity analyses from the end-to-end workflow in Nodeworks are consistent with the results of other two UQ software. The components of Nodeworks from Python’s ecosystem have been tested as standalone libraries. However, an assessment study for the complete workflow targeting a specific UQ analysis has not been performed for Nodeworks. Hence, this study is expected to serve as an equivalent of solution verification for Nodeworks using other established UQ tools as reference solution. For this purpose, three distinct flow configurations (i.e., settling bed, bubbling fluidized, and circulating fluidized bed) have been used as representative multiphase flow problems of interest. The results of the systematic simulation campaigns performed in an earlier study using the particle-in-cell (PIC) approach in the Multiphase Flow with Interphase eXchanges (MFIX) suite of solvers (i.e., MFiX-PIC) was utilized. The same set of tabulated results was provided as input to the different UQ software for global sensitivity analysis. Results for the three cases indicate that based on the Sobol’ Sensitivity Indices method the order of importance ranking determined by Nodeworks for the Sobol’ Total Sensitivity Indices is consistent with PSUADE and DAKOTA in each case for the five model parameters considered. The input files for Nodeworks for the three cases are also shared through NETL’s Gitlab repository for the reader interested in reproducibility and further analysis (See Section 1.2).

97 MATHEMATICS AND COMPUTING↗

Diagnostic calculations of airframe-radiated noise

Methods of calculating airframe noise due to the following components are presented: wings and stabilizers, flaps, landing gear 'self-noise', landing gear bay (wheel well) oscillations, separated flow interaction with edges of cavities, and doors associated with gear deployment. The predominant source mechanisms were dipole-like in nature, being related to the local fluctuating aerodynamic forces on struts, airfoil edges, cavity edges, etc. Available data are converted into semiempirical prediction methods to enable a tentative rank ordering of noise sources. A sample application of these prediction procedures is carried out for a typical CTOL passenger jet using actual aircraft parameters, where available.

Hayden, R. E.↗

Boulder Capture System Design Options for the Asteroid Robotic Redirect Mission Alternate Approach Trade Study

This paper presents a boulder acquisition and asteroid surface interaction electromechanical concept developed for the Asteroid Robotic Redirect Mission (ARRM) option to capture a free standing boulder on the surface of a 100 m or larger Near Earth Asteroid (NEA). It details the down select process and ranking of potential boulder capture methods, the evolution of a simple yet elegant articulating spaceframe, and ongoing risk reduction and concept refinement efforts. The capture system configuration leverages the spaceframe, heritage manipulators, and a new microspine technology to enable the ARRM boulder capture. While at the NEA it enables attenuation of terminal descent velocity, ascent to escape velocity, boulder collection and restraint. After departure from the NEA it enables, robotic inspection, sample caching, and crew Extra Vehicular Activities (EVA).

Belbin, Scott P.↗

A graphics processing unit accelerated sparse direct solver and preconditioner with block low rank compression

We present the GPU implementation efforts and challenges of the sparse solver package STRUMPACK. The code is made publicly available on github with a permissive BSD license. STRUMPACK implements an approximate multifrontal solver, a sparse LU factorization which makes use of compression methods to accelerate time to solution and reduce memory usage. Multiple compression schemes based on rank-structured and hierarchical matrix approximations are supported, including hierarchically semi-separable, hierarchically off-diagonal butterfly, and block low rank. Here, in this paper, we present the GPU implementation of the block low rank (BLR) compression method within a multifrontal solver. Our GPU implementation relies on highly optimized vendor libraries such as cuBLAS and cuSOLVER for NVIDIA GPUs, rocBLAS and rocSOLVER for AMD GPUs and the Intel oneAPI Math Kernel Library (oneMKL) for Intel GPUs. Additionally, we rely on external open source libraries such as SLATE (Software for Linear Algebra Targeting Exascale), MAGMA (Matrix Algebra on GPU and Multi-core Architectures), and KBLAS (KAUST BLAS). SLATE is used as a GPU-capable ScaLAPACK replacement. From MAGMA we use variable sized batched dense linear algebra operations such as GEMM, TRSM and LU with partial pivoting. KBLAS provides efficient (batched) low rank matrix compression for NVIDIA GPUs using an adaptive randomized sampling scheme. The resulting sparse solver and preconditioner runs on NVIDIA, AMD and Intel GPUs. Interfaces are available from PETSc, Trilinos and MFEM, or the solver can be used directly in user code. We report results for a range of benchmark applications, using the Perlmutter system from NERSC, Frontier from ORNL, and Aurora from ALCF. For a high frequency wave equation on a regular mesh, using 32 Perlmutter compute nodes, the factorization phase of the exact GPU solver is about 6.5× faster compared to the CPU-only solver. The BLR-enabled GPU solver is about 13.8× faster than the CPU exact solver. For a collection of SuiteSparse matrices, the STRUMPACK exact factorization on a single GPU is on average 1.9× faster than NVIDIA’s cuDSS solver.

97 MATHEMATICS AND COMPUTING↗

Using Trained Pixel Classifiers to Select Images of Interest

We present a machine-learning-based approach to ranking images based on learned priorities. Unlike previous methods for image evaluation, which typically assess the value of each image based on the presence of predetermined specific features, this method involves using two levels of machine-learning classifiers: one level is used to classify each pixel as belonging to one of a group of rather generic classes, and another level is used to rank the images based on these pixel classifications, given some example rankings from a scientist as a guide. Initial results indicate that the technique works well, producing new rankings that match the scientist's rankings significantly better than would be expected by chance. The method is demonstrated for a set of images collected by a Mars field-test rover.

Mazzoni, D.↗

Mutual information-assisted adaptive variational quantum eigensolver

Adaptive construction of ansatz circuits offers a promising route towards applicable variational quantum eigensolvers on near-term quantum hardware. Those algorithms aim to build up optimal circuits for a certain problem and ansatz circuits are adaptively constructed by selecting and adding entanglers from a predefined pool. In this work, we propose a way to construct entangler pools with reduced size by leveraging classical algorithms. Our method uses mutual information between the qubits in classically approximated ground state to rank and screen the entanglers. The density matrix renormalization group method is employed for classical precomputation in this work. We corroborate our method numerically on small molecules. Our numerical experiments show that a reduced entangler pool with a small portion of the original entangler pool can achieve same numerical accuracy. Here, we believe that our method paves a new way for adaptive construction of ansatz circuits for variational quantum algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗