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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Collocation methods for nonlinear differential equations on low-rank manifolds

We introduce new methods for integrating nonlinear differential equations on low-rank manifolds. These methods rely on interpolatory projections onto the tangent space, enabling low-rank time integration of vector fields that can be evaluated entry-wise. A key advantage of our approach is that it does not require the vector field to exhibit low-rank structure, thereby overcoming significant limitations of traditional dynamical low-rank methods based on orthogonal projection. To construct the interpolatory projectors, we develop a sparse tensor sampling algorithm based on the discrete empirical interpolation method (DEIM) that parameterizes tensor train manifolds and their tangent spaces with cross interpolation. Using these projectors, we propose two time integration schemes on low-rank tensor train manifolds. The first scheme integrates the solution at selected interpolation indices and constructs the solution with cross interpolation. The second scheme generalizes the well-known orthogonal projector-splitting integrator to interpolatory projectors. We demonstrate the proposed methods with applications to several tensor differential equations arising from the discretization of partial differential equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Unified Medical Language System resources improve sieve-based generation and Bidirectional Encoder Representations from Transformers (BERT)–based ranking for concept normalization

Concept normalization, the task of linking phrases in text to concepts in an ontology, is useful for many downstream tasks including relation extraction, information retrieval, etc. We present a generate-and-rank concept normalization system based on our participation in the 2019 National NLP Clinical Challenges Shared Task Track 3 Concept Normalization. The shared task provided 13 609 concept mentions drawn from 100 discharge summaries. We first design a sieve-based system that uses Lucene indices over the training data, Unified Medical Language System (UMLS) preferred terms, and UMLS synonyms to generate a list of possible concepts for each mention. We then design a listwise classifier based on the BERT (Bidirectional Encoder Representations from Transformers) neural network to rank the candidate concepts, integrating UMLS semantic types through a regularizer. Our generate-and-rank system was third of 33 in the competition, outperforming the candidate generator alone (81.66% vs 79.44%) and the previous state of the art (76.35%). During postevaluation, the model’s accuracy was increased to 83.56% via improvements to how training data are generated from UMLS and incorporation of our UMLS semantic type regularizer. Analysis of the model shows that prioritizing UMLS preferred terms yields better performance, that the UMLS semantic type regularizer results in qualitatively better concept predictions, and that the model performs well even on concepts not seen during training. Our generate-and-rank framework for UMLS concept normalization integrates key UMLS features like preferred terms and semantic types with a neural network–based ranking model to accurately link phrases in text to UMLS concepts.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2024

A Local Macroscopic Conservative (LoMaC) Low Rank Tensor Method for the Vlasov Dynamics

Abstract In this paper, we propose a novel Local Macroscopic Conservative (LoMaC) low rank tensor method for simulating the Vlasov-Poisson (VP) system. The LoMaC property refers to the exact local conservation of macroscopic mass, momentum and energy at the discrete level. This is a follow-up work of our previous development of a conservative low rank tensor approach for Vlasov dynamics ( arXiv:2201.10397 ). In that work, we applied a low rank tensor method with a conservative singular value decomposition to the high dimensional VP system to mitigate the curse of dimensionality, while maintaining the local conservation of mass and momentum. However, energy conservation is not guaranteed, which is a critical property to avoid unphysical plasma self-heating or cooling. The new ingredient in the LoMaC low rank tensor algorithm is that we simultaneously evolve the macroscopic conservation laws of mass, momentum and energy using a flux-difference form with kinetic flux vector splitting; then the LoMaC property is realized by projecting the low rank kinetic solution onto a subspace that shares the same macroscopic observables by a conservative orthogonal projection. The algorithm is extended to the high dimensional problems by hierarchical Tuck decomposition of solution tensors and a corresponding conservative projection algorithm. Extensive numerical tests on the VP system are showcased for the algorithm’s efficacy.

Guo, Wei↗
DOE OSTI2026

Using Artificial Soiling to Rank Anti-Soiling Coatings for Arid Climates

A simple method to evaluate (e.g., screen and rank) the performance of coatings that are fully or partially anti-soiling (AS) is lacking within the PV industry. Artificial soiling may be used as a rapid and economical assessment approach, offering an efficient alternative to time-intensive, site-specific field testing. In this study, we present an artificial soiling method to replicate the anti-soiling performance rankings of two groups of coated glass samples supplied by two manufacturers (group C with CA, CP, and CS coatings; group A with AC coating). These are compared to field aging in two climates: semi-arid Lemoore, California over 4 months, and the hot desert in Mesa, Arizona over 7 months. Both field and indoor performance ranking utilize the transmittance ratio, defined as the optical transmittance between a coated sample and an uncoated reference in each group, as an evaluation metric to assess the effectiveness of the artificial soiling approach in replicating field soiling. It is critical to mimic the dominant field meteorological conditions associated with soiling-prone days and vulnerable times of day during the soiling season. Our results reveal that the use of artificial soiling for field performance ranking among coatings strongly depends on the soil type (composition and particle distribution), dust surface density, and prevalent environmental factors (wetting saturation by humidity, dew condensation extent, and prior weathering history of the coating). The similar rank order relative to the field suggests that the artificial soiling approach presented may be used for down-selecting anti-soiling coatings prior to prolonged field validation.

14 SOLAR ENERGY↗
DOE OSTI2021

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↗
DOE OSTI2020

Risk Importance Ranking of Fire Data Parameters to Enhance Fire PRA Model Realism

Fire is historically and analytically a significant contributor to nuclear power plant risk. The level of fire risk and the methods, tools and data for modeling this risk is highly debated by experts. One area of debate is the input data used in fire modeling and how to deal with this data’s high uncertainty. This report outlines initial work performed for determining the key parameters causing this uncertainty and how it propagates into nuclear power plant models. This research paves the way for the development of methods to reduce fire data uncertainty used in modeling. The Nuclear Regulatory Commission has mandated that nuclear power plants perform fire risk modeling. However, there are several issues with the current risk modeling implementation that affect the results. Approved modeling methods can be overly conservative and often do not match plant experience. Also, the data used in the modeling can have high uncertainties and is influenced by expert judgement. To evaluate input data uncertainty, researchers performed an initial review of several fire experiments done at Sandia National Laboratories. Uncertainties for fire data can come from many sources, such as experiment design constraints, environmental conditions, or other plant-specific aspects. There are many different significant and insignificant parameters driving the uncertainty. Additionally, the uncertainty of the different input data used in the fire modeling could have a significant or insignificant effect on the entire plant risk. A four-step methodology was developed to perform Integrated Probabilistic Risk Assessment Importance Ranking. A demonstration case using these steps was set up and three of the four steps were completed in fiscal year (FY) 2019 and the fourth step done FY 2020. These steps are: 1. The qualitative analysis of potential sources was conducted with the following items identified for the demonstration. • Maximum heat release rate • Time to maximum heat release rate • Duration of max heat release rate • Time to decay • Thermal conductivity of concrete • Specific heat of concrete • Density of concrete • Cable jacket thickness 2. A quantitative characterization of dominant sources of uncertainty was performed. A list of distributions and determined values of the dominant sources is shown in Appendix A. 3. A quantitative screening of the potential sources of uncertainty using Morris Elementary Effects Analysis was completed. An experimental model using the physics-based fire modeling tool Fire Dynamics Simulator was developed and coupled with the Risk Analysis Virtual Environment. The Morris analysis identified at least two parameters that can be eliminated as significant contributors (specific heat of concrete and cable jacket thickness). 4. Global importance measure (Global IM) analysis to generate a comprehensive ranking based on their influence on the plant risk. In this research, a moment-independent Global IM is used since it can address (a) uncertainty in the input parameters of the fire model, (b) uncertainty in the risk outputs, and (c) non-linearity and interactions among input parameters in the fire model, more accurately than the correlation-based and variance-based global methods. The observations from the research showed that, depending on the initial and boundary conditions of the fire scenarios, fire-induced damage could have a very small probability and could be dominated by the tail of the uncertainty distribution; hence, the accuracy of the correlation-based and variance-based methods is questionable. The moment-independent Global IM analysis in this research provides a better understanding of how experimental uncertainty data affects industry’s plant models and where improvements in that data will have the largest benefit for improving fire modeling accuracy in causing core damage. Among the five unscreened parameters obtained from the Morris EE analysis, the Global IM analysis results for the case study indicated that max heat release rate and fire location are the most important parameters. The report also outlines benefits of using a unified computational platform that integrates the underlying simulations (e.g., a fire progression model), quantitative screening (using the Morris EE method), and the Global IM analysis. A unified platform can (i) facilitate the ranking of input parameters considering multiple key fire scenarios simultaneously, rather than considering one scenario at a time, (ii) contribute to more explicit and accurate treatment of dependencies at multiple levels of Fire PRA, (iii) facilitate the sampling-based uncertainty quantification for Fire PRA, and (iv) help generating both “industry-wide” and "plant-specific" ranking of uncertainty sources in Fire PRA. Future research should be done to include additional parameters such as detection/suppression or cable fire spread. Adding a PRA software such as SAPHIRE to the RAVEN platform would help with plant model integration and improve treatment of fire-induced dependency. The I-PRA risk importance ranking methodology offered in this report can provide valuable information for efficiently (a) enhancing the realism of Fire PRA for existing plants and (b) supporting the development of Dynamic Fire PRA for advanced reactors and new plants.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Quality Ranking System for Molten Salt Thermal Property Data

A simple ranking system for use with data and property values compiled in the Molten Salt Thermal Database-Thermophysical Properties (MSTDB-TP) is presented. The approach includes assessments of five features of data collection: the method used to measure the property value, calibration of devices used to make the measurements, the quantified uncertainty of the results, control of the environmental conditions, and determination of the salt composition. The verifiability of how the property value was determined is also assessed based on information provided or cited within the data set. The quality of each facet is ranked as High, Moderate, or Incomplete based on objective metrics. The overall quality of the dataset is ranked based on rankings of the five data features and the reported property value, with rankings of A and B indicating the data and property value are deemed suitable for quantitative use and U indicating uncertainties that restrict the recommended use to qualitative purposes. The system is suitable for assessing data already in the MSTDB-TP and screening new entries.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
NASA NTRSDate not supplied

Human Systems Risk Network - A Ranking Analysis of Risks

INTRODUCTION The Human Systems Risk Board (HSRB) is responsible for understanding, managing, and mitigating the risks associated with spaceflight. For a particular mission, the HSRB assigns each human system risk a rating on a 5x5 grid assessing its likelihood and consequence, which is ultimately used to compare and rank the risks. The HSRB approaches risk management by primarily establishing the context of each human system risk individually with the understanding that mitigating one risk might affect the likelihood, consequence, and mitigation approaches of another. To support this effort the HSRB, subject matter experts, and risk custodian teams created directed acyclic graphs (DAG), often called a causal graph, for the twenty-nine risks. In this presentation, we propose a new ranking algorithm for the risks which includes the downstream influence of each risk according to the information in the DAGs and provide an application of graph theoretic tools. METHODS In 2014, Mindock and Klaus proposed a taxonomy for human system risk influences which we have adopted to categorize the nodes in each DAG. Analyzing the nodes that correspond to the risks in this taxonomy allows us to analyze and understand how each risk influences the others. We construct an auxiliary network, which we call the Primary Risk Network (PRN), where the nodes are the twenty-nine space flight risks and, a directed edge connects Risk A to Risk B if Risk A has some influence on the likelihood or consequence of Risk B as described in the DAGS. We perform a variety of graph theoretic ranking methods on the nodes (or risks) in the PRN, including Katz centrality. RESULTS We rank the nodes in the PRN using the Katz centrality score. The ten risks with the highest score are pictured in Figure 1, colored (light to dark) according to their score. We analyze other centrality measures like betweenness centrality, eigenvector centrality, and the Estrada index, and provide the meaning of the corresponding rankings in terms of the risks. Future work includes analyzing the other categories in the taxonomy defined by Mindock and Klaus [1]. For example, we are interested in analyzing the nodes that are labeled as countermeasures or capabilities and perform similar analysis to measure their effect on certain medical conditions.

dag↗
DOE OSTI2025

A geometric framework for momentum-based optimizers for low-rank training

Low-rank pre-training and fine-tuning have recently emerged as promising techniques for reducing the computational and storage costs of large neural networks. Training low-rank parameterizations typically relies on conventional optimizers such as heavy ball momentum methods or Adam. In this work, we identify and analyze potential difficulties that these training methods encounter when used to train low-rank parameterizations of weights. In particular, we show that classical momentum methods can struggle to converge to a local optimum due to the geometry of the underlying optimization landscape. To address this, we introduce novel training strategies derived from dynamical low-rank approximation, which explicitly account for the underlying geometric structure. Our approach leverages and combines tools from dynamical low-rank approximation and momentum-based optimization to design optimizers that respect the intrinsic geometry of the parameter space. We validate our methods through numerical experiments, demonstrating faster convergence, and stronger validation metrics at given parameter budgets.

Schotthoefer, Steffen [ORNL] (ORCID:00000002156965↗
DOE OSTI2025

Asymptotic-preserving dynamical low-rank method for the stiff nonlinear Boltzmann equation

In kinetic theory, numerically solving the full Boltzmann equation is extremely expensive. This is because the Boltzmann collision operator involves a high-dimensional, nonlinear integral that must be evaluated at each spatial grid point and every time step. The challenge becomes even more pronounced in the fluid (strong collisionality) regime, where the collision operator exhibits strong stiffness, causing explicit time integrators to impose severe stability restrictions. In this paper, we propose addressing this problem through a dynamical low-rank (DLR) approximation. The resulting algorithm requires evaluating the Boltzmann collision operator only r 2 times, where r, the rank of the approximation, is much smaller than the number of spatial grid points. We propose a novel DLR integrator, called the XL integrator, which reduces the number of steps compared to the available alternatives (such as the projector splitting or basis update & Galerkin (BUG) integrator). For a class of problems including the Boltzmann collision operator which enjoys a separation property between physical and velocity space, we further propose a specialized version of the XL integrator, called the sXL integrator. This version requires solving only one differential equation to update the low-rank factors. Furthermore, the proposed low-rank schemes are asymptotic-preserving, meaning they can capture the asymptotic fluid limit in the case of strong collisionality. Our numerical experiments demonstrate the efficiency and accuracy of the proposed methods across a wide range of regimes, from non-stiff (kinetic) to stiff (fluid).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Sylvester-preconditioned adaptive-rank implicit time integrators for advection-diffusion equations with variable coefficients

Here, we consider the adaptive-rank integration of multi-dimensional time-dependent advection-diffusion partial differential equations (PDEs) with variable coefficients. We employ a standard finite-difference method for spatial discretization coupled with high-order diagonally implicit Runge-Kutta temporal schemes. The discrete equation is a generalized Sylvester equation (GSE), which we solve with a projection-based adaptive-rank algorithm structured around two key strategies: (i) constructing dimension-wise subspaces using a novel atypical extended Krylov strategy, and (ii) efficiently solving the basis coefficient matrix with a preconditioned GMRES solver. The low-rank decomposition is performed in 2D using SVD and with high-order SVD (HOSVD) in 3D to represent the tensor in a compressed Tucker format. For d-dimensional problems (here, d = 2 or 3), the computational complexity and memory storage of the approach are found numerically to scale as and $\mathscr{O}(Nr^2) + \mathscr{O} (r^{d+1})$ and $\mathscr{O}(Nr) + \mathscr{O} (r^{d})$, respectively, with the one-dimensional resolution and the maximal rank during the Krylov iteration (which we find to be largely independent of on our numerical examples). We present numerical examples that illustrate the advertised properties of the algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Sparse and Low Rank Penalized Signal Decomposition Model with Constraints: Anomaly Detection in PV Systems

Recently, robust PCA has seen its wide application in various industries for its ability to perform the task of anomaly detection. The essence of robust PCA approach is to break down the signal into a low rank component and sparse component. In many applications, a simple breakdown of the signal without accounting for the signs of low rank components and sparse components would violate the physical constraints of the decomposed signal. In addition, often times, the signals in the real world collected for a long duration has smooth changes within a day and between days. As an example, the power signals collected in a photovoltaic (PV) system are cyclostationary, exhibiting these characteristics. Neglecting the smoothness of signals would result in miss detection of anomalous signals which are smooth within a day but non-smooth between days and vice versa. In this paper, we developed a signal decomposition approach for the purpose of anomaly detection based on the idea of low rank and sparse decomposition taking into consideration the signs of the decomposed low rank and sparse components and the within-day and between-day smooth changes in the original signals. The proposed unsupervised approach for fault detection eliminates the need for faulty samples required by other machine learning methods. It does not require the full I-V characteristics to work. Furthermore, there is no need for complex modelling of PV systems as in the case of power loss analysis. Using Monte Carlo simulations, we demonstrate the ability of our proposed approach for detecting anomalies of different duration and severity in PV systems.

14 SOLAR ENERGY↗
DOE OSTI2020

Towards a classification of rank r $\mathscr{N}$ = 2 SCFTs. Part II. Special Kahler stratification of the Coulomb branch

We study the stratification of the singular locus of four dimensional $\mathscr{N}$ = 2 Coulomb branches. We present a set of self-consistency conditions on this stratification which can be used to extend the classification of scale-invariant rank 1 Coulomb branch geometries to two complex dimensions, and beyond. The calculational simplicity of the arguments presented here stems from the fact that the main ingredients needed - the rank 1 deformation patterns and the pattern of inclusions of rank 2 strata - are discrete topological data which satisfy strong self-consistency conditions through their relationship to the central charges of the SCFT. This relationship of the stratification data to the central charges is used here, but is derived and explained in a companion paper by one of the authors. We illustrate the use of these conditions by re-analyzing many previously-known examples of rank 2 SCFTs, and also by finding examples of new theories. The power of these conditions stems from the fact that for Coulomb branch stratifications a conjecturally complete list of physically allowed “elementary slices” is known. By contrast, constraining the possible elementary slices of symplectic singularities relevant for Higgs branch stratifications remains an open problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Randomized low-rank decompositions of nuclear three-body interactions

First-principles simulations of many-fermion systems are commonly limited by the computational requirements of processing large data objects. As a remedy, we propose the use of low-rank approximations of three-body interactions, which are the dominant such limitation in nuclear physics. We introduce a randomized decomposition technique to handle the excessively large matrix dimensions and study the sensitivity of low-rank properties to interaction details. The developed low-rank three-nucleon interactions are benchmarked in ab initio simulations of few- and many-body systems. Exploiting low-rank properties provides a promising route to extend the microscopic description of atomic nuclei to large systems where storage requirements exceed the computational capacities of the most advanced high-performance computing facilities.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

On Rank Selection for Nonnegative Matrix Factorization

Rank selection, i.e. the choice of factorization rank, is the first step in constructing Nonnegative Matrix Factorization (NMF) models. It is a long-standing problem which is not unique to NMF, but arises in most models which attempt to decompose data into its underlying components. Since these models are often used in the unsupervised setting, the rank selection problem is further complicated by the lack of ground truth labels. In this paper, we review and empirically evaluate the most commonly used schemes for NMF rank selection.

Eswar, Srinivas [Argonne National Laboratory]↗
DOE OSTI2024

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↗
DOE OSTI2024

Quality Ranking of Unary Chloride Salt Property Data Included in MSTDB-TP

Molten salt reactor developers rely on thermal property data to design, license and operate the reactors. The Molten Salt Thermal Database-Thermophysical Properties (MSTDB-TP) was established under the DOE Nuclear Energy Advanced Modeling and Simulation (NEAMS) program and is managed by Oak Ridge National Laboratory to serve as a single source of thermophysical property values measured for a wide variety of molten salt systems for use by researchers, molten salt reactor developers, and regulators. These properties include density, viscosity and thermal diffusivity and conductivity. Published measurements of molten salt properties are lacking for many salts of interest and the data that are available are often inconsistent. This creates a challenge for MSR developers when determining which property values to use when designing their reactors. It is the purpose of this work to apply a consistent ranking system to all data entries that indicates the quality of property values listed in the database. These rankings will be the technical basis for down-selections by the database developers and alert users about the quality of the available property values. MSTDB-TP collects all available property data and indicates preferred data sets or correlations. However, all available data sets are included in the database. Quality assessments and rankings are being applied to data in MSTDB-TP to provide an indication of the quality of each data set independent of consistency with other data. Previous reports detailed the ranking system that was followed and assessments of unary fluoride data sets. Documentation of the quality of data in MSTDB-TP was continued by reviewing and assessing all available sources of density, viscosity and thermal diffusivity or conductivity values for unary chloride salts in MSTDB-TP V3.0 using the same criteria.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
NASA NTRS1989

Promoted combustion of nine structural metals in high-pressure gaseous oxygen - A comparison of ranking methods

The 316, 321, 440C, and 17-4 PH stainless steels, as well as Inconel 600, Inconel 718, Waspaloy, Monel 400, and Al 2219, have been evaluated for relative nonflammability in a high-pressure oxygen environment with a view to the comparative advantages of four different flammability-ranking methods. The effects of changes in test pressure, sample diameter, promoter type, and sample configuration on ranking method results are evaluated; ranking methods employing velocity as the primary ranking criterion are limited by diameter effects, while those which use extinguishing pressure are nonselective for metals with similar flammabilities.

Steinberg, Theodore A.↗