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

Rank-ordered multifractal analysis for intermittent fluctuations with global crossover behavior

The rank-ordered multifractal analysis (ROMA), a recently developed technique that combines the ideas of parametric rank ordering and one-parameter scaling of monofractals, has the capabilities of deciphering the multifractal characteristics of intermittent fluctuations. The method allows one to understand the multifractal properties through rank-ordered scaling or nonscaling parametric variables. The idea of the ROMA technique is applied to analyze the multifractal characteristics of the auroral zone electric-field fluctuations observed by the SIERRA sounding rocket. The observed fluctuations span across contiguous multiple regimes of scales with different multifractal characteristics. We extend the ROMA technique such that it can take into account the crossover behavior - with the possibility of collapsing probability distribution functions - over these contiguous regimes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

MO-DE-207A-05: Dictionary Learning Based Reconstruction with Low-Rank Constraint for Low-Dose Spectral CT

Purpose: Spectral CT enabled by an energy-resolved photon-counting detector outperforms conventional CT in terms of material discrimination, contrast resolution, etc. One reconstruction method for spectral CT is to generate a color image from a reconstructed component in each energy channel. However, given the radiation dose, the number of photons in each channel is limited, which will result in strong noise in each channel and affect the final color reconstruction. Here we propose a novel dictionary learning method for spectral CT that combines dictionary-based sparse representation method and the patch based low-rank constraint to simultaneously improve the reconstruction in each channel and to address the inter-channel correlations to further improve the reconstruction. Methods: The proposed method has two important features: (1) guarantee of the patch based sparsity in each energy channel, which is the result of the dictionary based sparse representation constraint; (2) the explicit consideration of the correlations among different energy channels, which is realized by patch-by-patch nuclear norm-based low-rank constraint. For each channel, the dictionary consists of two sub-dictionaries. One is learned from the average of the images in all energy channels, and the other is learned from the average of the images in all energy channels except the current channel. With average operation to reduce noise, these two dictionaries can effectively preserve the structural details and get rid of artifacts caused by noise. Combining them together can express all structural information in current channel. Results: Dictionary learning based methods can obtain better results than FBP and the TV-based method. With low-rank constraint, the image quality can be further improved in the channel with more noise. The final color result by the proposed method has the best visual quality. Conclusion: The proposed method can effectively improve the image quality of low-dose spectral CT. This work is partially supported by the National Natural Science Foundation of China (No. 61302136), and the Natural Science Basic Research Plan in Shaanxi Province of China (No. 2014JQ8317).

60 APPLIED LIFE SCIENCES↗

PLANC: Parallel Low-rank Approximation with Nonnegativity Constraints

In this work, we consider the problem of low-rank approximation of massive dense nonnegative tensor data, for example, to discover latent patterns in video and imaging applications. As the size of data sets grows, single workstations are hitting bottlenecks in both computation time and available memory. We propose a distributed-memory parallel computing solution to handle massive data sets, loading the input data across the memories of multiple nodes, and performing efficient and scalable parallel algorithms to compute the low-rank approximation. We present a software package called Parallel Low-rank Approximation with Nonnegativity Constraints, which implements our solution and allows for extension in terms of data (dense or sparse, matrices or tensors of any order), algorithm (e.g., from multiplicative updating techniques to alternating direction method of multipliers), and architecture (we exploit GPUs to accelerate the computation in this work). We describe our parallel distributions and algorithms, which are careful to avoid unnecessary communication and computation, show how to extend the software to include new algorithms and/or constraints, and report efficiency and scalability results for both synthetic and real-world data sets.

97 MATHEMATICS AND COMPUTING↗

Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning

We present an algorithmic framework for quantum-inspired classical algorithms on close-to-low-rank matrices, generalizing the series of results started by Tang’s breakthrough quantum-inspired algorithm for recommendation systems [STOC’19]. Motivated by quantum linear algebra algorithms and the quantum singular value transformation (SVT) framework of Gilyén et al. [STOC’19], we develop classical algorithms for SVT that run in time independent of input dimension, under suitable quantum-inspired sampling assumptions. Our results give compelling evidence that in the corresponding QRAM data structure input model, quantum SVT does not yield exponential quantum speedups. Since the quantum SVT framework generalizes essentially all known techniques for quantum linear algebra, our results, combined with sampling lemmas from previous work, suffice to generalize all prior results about dequantizing quantum machine learning algorithms. In particular, our classical SVT framework recovers and often improves the dequantization results on recommendation systems, principal component analysis, supervised clustering, support vector machines, low-rank regression, and semidefinite program solving. We also give additional dequantization results on low-rank Hamiltonian simulation and discriminant analysis. Our improvements come from identifying the key feature of the quantum-inspired input model that is at the core of all prior quantum-inspired results: ℓ 2 -norm sampling can approximate matrix products in time independent of their dimension. We reduce all our main results to this fact, making our exposition concise, self-contained, and intuitive.

Computer Science↗

Evaluation of data driven low-rank matrix factorization for accelerated solutions of the Vlasov equation

Low-rank methods have shown success in accelerating simulations of a collisionless plasma described by the Vlasov equation, but still rely on computationally costly linear algebra every time step. We propose a data-driven factorization method using artificial neural networks, specifically with convolutional layer architecture, that trains on existing simulation data. At inference time, the model outputs a low-rank decomposition of the distribution field of the charged particles, and we demonstrate that this step is faster than the standard linear algebra technique. Numerical experiments show that the method achieves comparable reconstruction accuracy for interpolation tasks, generalizing to unseen test data in a manner beyond just memorizing training data; patterns in factorization also inherently followed the same numerical trend as those within algebraic methods (e.g., truncated singular-value decomposition). However, when training on the first 70% of a time-series data and testing on the remaining 30%, the method fails to meaningfully extrapolate. Despite this limiting result, the technique may have benefits for simulations in a statistical steady-state or otherwise showing temporal stability. These results suggest that while the model offers a computationally efficient alternative for datasets with temporal stability, its current formulation is best suited for interpolation rather than for predicting future states in time-evolving systems. This study thus lays the groundwork for further refinement of neural network-based approaches to low-rank matrix factorization in high-dimensional plasma simulations.

97 MATHEMATICS AND COMPUTING↗

Volume-preserving diffeomorphism as nonabelian higher-rank gauge symmetry

We propose nonabelian higher-rank gauge theories in 2+1D and 3+1D. The gauge group is constructed from the volume-preserving diffeomorphisms of space. We show that the intriguing physics of the lowest Landau level (LLL) limit can be interpreted as the consequences of the symmetry. We derive the renowned Girvin-MacDonald-Platzman (GMP) algebra as well as the topological Wen-Zee term within our formalism. Using the gauge symmetry in 2+1D, we derive the LLL effective action of vortex crystal in rotating Bose gas as well as Wigner crystal of electron in an applied magnetic field. We show that the nonlinear sigma models of ferromagnets in 2+1D and 3+1D exhibit the higher-rank gauge symmetries that we introduce in this paper. We interpret the fractonic behavior of the excitations on the lowest Landau level and of skyrmions in ferromagnets as the consequence of the higher-rank gauge symmetry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quality Ranking of Unary Fluoride Salt Property Data in MSTDB-TP

Molten salt reactor developers rely on thermal property data to design, license and operate the reactors they are developing. The Molten Salt Thermal Database-Thermophysical Properties (MSTDB-TP) is being developed under the DOE Nuclear Energy Advanced Modeling and Simulation (NEAMS) program and managed by Oak Ridge National Laboratory. The MSTDB-TP is intended to serve as a single source of measured thermophysical property values for a wide variety of molten salt systems available to researchers, molten salt reactor developers, and regulators. These properties include melting and boiling points, heat capacity, density, viscosity and thermal diffusivity and conductivity. Published measurements of molten salt properties are lacking for many salts and the data that are available are often inconsistent. This creates a challenge for MSR developers in determining which property values to select when designing their reactors. The MSDTDB-TP collects all available property data and down-selects to preferred data sets or correlations. It is the purpose of this work to apply a recently developed ranking system that indicates the quality of property values listed in the database to inform decisions about how to use the available data. Quality assessments and rankings are being applied to data in MSTDB-TP to provide an indication of the quality of the data available. A previous report detailed the ranking system that was followed.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Methods of computing vocabulary size for the two-parameter rank distribution

A summation method is described for computing the vocabulary size for given parameter values in the 1- and 2-parameter rank distributions. Two methods of determining the asymptotes for the family of 2-parameter rank-distribution curves are also described. Tables are computed and graphs are drawn relating paris of parameter values to the vocabulary size. The partial product formula for the Riemann zeta function is investigated as an approximation to the partial sum formula for the Riemann zeta function. An error bound is established that indicates that the partial product should not be used to approximate the partial sum in calculating the vocabulary size for the 2-parameter rank distribution.

Edmundson, H. P.↗

First-ranked galaxies in groups

A statistical analysis of five group catalogs shows that the B(0) magnitudes of first-ranked group members are consistent with a statistical model in which the luminosities of all group members are drawn from the same distribution. As in the Hickson compact groups, indications are that first-ranked group members are only rarely the products of distinctive evolutionary processes. Distance-dependent selection effects can introduce spurious correlations among group parameters which may appear to support environment-dependent evolution of the first-ranked group members.

Geller, M. J.↗

Evaluation and ranking of candidate ceramic wafer engine seal materials

Modern engineered ceramics offer high temperature capabilities not found in even the best superalloy metals. The high temperature properties of several selected ceramics including aluminum oxide, silicon carbide, and silicon nitride are reviewed as they apply to hypersonic engine seal design. A ranking procedure is employed to objectively differentiate among four different monolithic ceramic materials considered, including: a cold-pressed and sintered aluminum oxide; a sintered alpha-phase silicon carbide; a hot-isostatically pressed silicon nitride; and a cold-pressed and sintered silicon nitride. This procedure is used to narrow the wide range of potential ceramics considered to an acceptable number for future detailed and costly analyses and tests. The materials are numerically scored according to their high temperature flexural strength; high temperature thermal conductivity; resistance to crack growth; resistance to high heating rates; fracture toughness; Weibull modulus; and finally according to their resistance to leakage flow, where materials having coefficients of thermal expansion closely matching the engine panel material resist leakage flow best. The cold-pressed and sintered material (Kyocera SN-251) ranked the highest in the overall ranking especially when implemented in engine panels made of low expansion rate materials being considered for the engine, including Incoloy and titanium alloys.

Steinetz, Bruce M.↗

Adjoints and Low-rank Covariance Representation

Quantitative measures of the uncertainty of Earth System estimates can be as important as the estimates themselves. Second moments of estimation errors are described by the covariance matrix, whose direct calculation is impractical when the number of degrees of freedom of the system state is large. Ensemble and reduced-state approaches to prediction and data assimilation replace full estimation error covariance matrices by low-rank approximations. The appropriateness of such approximations depends on the spectrum of the full error covariance matrix, whose calculation is also often impractical. Here we examine the situation where the error covariance is a linear transformation of a forcing error covariance. We use operator norms and adjoints to relate the appropriateness of low-rank representations to the conditioning of this transformation. The analysis is used to investigate low-rank representations of the steady-state response to random forcing of an idealized discrete-time dynamical system.

Tippett, Michael K.↗

Air Pollution Scenario over Pakistan: Characterization and Ranking of Extremely Polluted Cities using Long-Term Concentrations of Aerosols and Trace Gases

Pakistan ranks third in the world in terms of mortality attributable to air pollution, with aerosol mass concentrations (PM2.5) consistently well above WHO (World Health Organization) air quality guidelines (AQG). However, regulation is dependent on a sparse network of air quality monitoring stations and insufficient ground data. This study utilizes long-term observations of aerosols and trace gases to characterize and rank the air pollution scenarios and pollution characteristics of 80 selected cities in Pakistan. Datasets used include (1) the Aqua and Terra (AquaTerra) MODIS (Moderate Resolution Imaging Spectroradiometer) Level 2 Collection 6.1 merged Dark Target and Deep Blue (DTB) aerosol optical depth (AOD) retrieval products; (2) the CAMS (Copernicus Atmosphere Monitoring Service) reanalysis PM1, PM2.5, and PM10 data; (3) the MERRA-2 (Modern-Era Retrospective analysis for Research and Applications, Version 2) reanalysis PM2.5 data, (4) the OMI (Ozone Monitoring Instrument) tropospheric vertical column density (TVCD) of nitrogen dioxide (NO2), and VCD of sulfur dioxide (SO2) in the Planetary Boundary Layer (PBL), (5) the VIIRS (Visible Infrared Imaging Radiometer Suite) Nighttime Lights data, (6) MODIS Collection 6 Version 2 global monthly fire location data (MCD14ML), (7) population density, (8) MODIS Level 3 Collection 6 land cover types, (9) AERONET (AErosol RObotic NETwork) Version 3 Level 2.0 data, and (10) ground-based PM2.5 concentrations from air quality monitoring stations. Potential Source Contribution Function (PSCF) analyses were performed by integrating with ground-based PM2.5 concentrations and the NOAA (National Oceanic and Atmospheric Administration) HYSPLIT (Hybrid Single-Particle Lagrangian Integrated Trajectory) air parcel back trajectories to identify potential pollution source areas which are responsible for extreme air pollution in Pakistan. Results show that the ranking of the top polluted cities depends on the type of pollutant considered and the metric used. For example, Jhang, Multan, and Vehari were characterized as the top three polluted cities in Pakistan when considering AquaTerra DTB AOD products; for PM1, PM2.5, and PM10 Lahore, Gujranwala, and Okara were the top three; for tropospheric NO2 VCD Lahore, Rawalpindi, and Islamabad and for PBL SO2 VCD Lahore, Mirpur, and Gujranwala. The results demonstrate that Pakistan’s entire population has been exposed to high PM2.5 concentrations for many years, with a mean annual value of 54.7 μg/cu. m, over all Pakistan from 2003 to 2020. This value exceeds Pakistan’s National Environmental Quality Standards (Pak-NEQS, i.e., <15 μg/cu. m annual mean) for ambient air defined by the Pakistan Environmental Protection Agency (Pak-EPA) as well as the WHO Interim Target-1 (i.e., mean annual PM2.5 <35 μg/cu. m). The spatial analyses of the concentrations of aerosols and trace gases in terms of population density, nighttime lights, land cover types, and fire location data, and the PSCF analysis indicate that Pakistan’s air quality is strongly affected by anthropogenic sources inside of Pakistan, with contributions from surrounding countries. Statistically significant positive (increasing) trends in PM1, PM2.5, PM10, tropospheric NO2 VCD, and SO2 VCD were observed in ~89%, ~67%, ~48%, 91%, and ~88% of the Pakistani cities (80 cities), respectively. This comprehensive analysis of aerosol and trace gas levels, their characteristics in spatio-temporal domains, and their trends over Pakistan, is the first of its kind. Results will be helpful to the Ministry of Climate Change (Government of Pakistan), Pak-EPA, SUPARCO (Pakistan Space and Upper Atmosphere Research Commission), policymakers, and the local research community to mitigate air pollution and its effects on human health.

Muhammad Bilal↗

Retrieving and Ranking Unannotated Images through Collaboratively Mining Online Search Results

We present a new image search and ranking algorithm for retrieving unannotated images by collaboratively mining online search results, which consist of online image and text search results. The online image search results are leveraged as reference examples to perform content-based image search over unannotated images. The online text search results are utilized to estimate individual reference images relevance to the search query as not all the online image search results are closely related to the query. Overall, the key contribution of our method lies in its capability to deal with unreliable online image search results through jointly mining visual and textual aspects of online search results. Through such collaborative mining, our algorithm infers the relevance of an online search result image to a text query. Once we estimate a query relevance score for each online image search result, we can selectively use query specific online search result images as reference examples for retrieving and ranking unannotated images. To explore the performance of our algorithm, we tested our algorithm both on the standard public image datasets and several modest sized personal photo collections. We also compared the performance of our method with that of two peer methods. The results are very positive, indicating that our algorithm is superior to existing content-based image search algorithms for retrieving and ranking unannotated images. Overall, the main advantage of our algorithm comes from its collaborative mining over online search results both in the visual and textual domains.

99 GENERAL AND MISCELLANEOUS↗

Rank 4 Premodular Categories

We consider the classification problem for rank 4 premodular categories. We uncover a formula for the 2nd Frobenius-Schur indicator of a premodular category is determined and the classification of rank 4 premodular categories (up to Grothendieck equivalence) is completed. In the appendix we show rank finiteness for premodular categories.

Bruillard, Paul J.↗

Dynamic Low-Rank Training with Spectral Regularization: Achieving Robustness in Compressed Representations

Deployment of neural networks on resource-constrained devices demands models that are both compact and robust to adversarial inputs. However, compression and adversarial robustness often conflict. In this work, we introduce a dynamical low-rank training scheme enhanced with a novel spectral regularizer that controls the condition number of the low-rank core in each layer. This approach mitigates the sensitivity of compressed models to adversarial perturbations without sacrificing clean accuracy. The method is model- and data-agnostic, computationally efficient, and supports rank adaptivity to automatically compress the network at hand. Extensive experiments across standard architectures, datasets, and adversarial attacks show the regularized networks can achieve over 94\% compression while recovering or improving adversarial accuracy relative to uncompressed baselines.

Schotthoefer, Steffen [ORNL] (ORCID:00000002156965↗

Dynamical Low-Rank Compression of Neural Networks with Robustness under Adversarial Attacks

Deployment of neural networks on resource-constrained devices demands models that are both compact and robust to adversarial inputs. However, compression and adversarial robustness often conflict. In this work, we introduce a dynamical low-rank training scheme enhanced with a novel spectral regularizer that controls the condition number of the low-rank core in each layer. This approach mitigates the sensitivity of compressed models to adversarial perturbations without sacrificing clean accuracy. The method is model- and data-agnostic, computationally efficient, and supports rank adaptivity to automatically compress the network at hand. Extensive experiments across standard architectures, datasets, and adversarial attacks show the regularized networks can achieve over 94 compression while recovering or improving adversarial accuracy relative to uncompressed baselines.

Schotthoefer, Steffen [ORNL] (ORCID:00000002156965↗

A rank-exploiting infinite Arnoldi algorithm for nonlinear eigenvalue problems

We consider the nonlinear eigenvalue problem M ( λ ) x = 0, where M ( λ ) is a large parameter-dependent matrix. In several applications, M ( λ ) has a structure where the higher-order terms of its Taylor expansion have a particular low-rank structure. We propose a new Arnoldi-based algorithm that can exploit this structure. More precisely, the proposed algorithm is equivalent to Arnoldi's method applied to an operator whose reciprocal eigenvalues are solutions to the nonlinear eigenvalue problem. The iterates in the algorithm are functions represented in a particular structured vector-valued polynomial basis similar to the construction in the infinite Arnoldi method [Jarlebring, Michiels, and Meerbergen, Numer. Math., 122 (2012), pp. 169–195]. In this paper, the low-rank structure is exploited by applying an additional operator and by using a more compact representation of the functions. This reduces the computational cost associated with orthogonalization, as well as the required memory resources. The structure exploitation also provides a natural way in carrying out implicit restarting and locking without the need to impose structure in every restart. In conclusion, the efficiency and properties of the algorithm are illustrated with two large-scale problems.

97 MATHEMATICS AND COMPUTING↗

Low rank approximation in G 0 W 0 calculations

The single particle energies obtained in a Kohn-Sham density functional theory (DFT) calculation are generally known to be poor approximations to electron excitation energies that are measured in tr ansport, tunneling and spectroscopic experiments such as photo-emission spectroscopy. The correction to these energies can be obtained from the poles of a single particle Green’s function derived from a many-body perturbation theory. From a computational perspective, the accuracy and efficiency of such an approach depends on how a self energy term that properly accounts for dynamic screening of electrons is approximated. The G 0 W 0 approximation is a widely used technique in which the self energy is expressed as the convolution of a noninteracting Green’s function (G 0 ) and a screened Coulomb interaction (W 0 ) in the frequency domain. The computational cost associated with such a convolution is high due to the high complexity of evaluating W 0 at multiple frequencies. In this paper, we discuss how the cost of G 0 W 0 calculation can be reduced by constructing a low rank approximation to the frequency dependent part of W 0 . In particular, we examine the effect of such a low rank approximation on the accuracy of the G 0 W 0 approximation. We also discuss how the numerical convolution of G 0 and W 0 can be evaluated efficiently and accurately by using a contour deformation technique with an appropriate choice of the contour.

97 MATHEMATICS AND COMPUTING↗