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 109 records · Page 6

Groups in Which the Normal Closures of Cyclic Subgroups Have Bounded Finite Hirsch–Zaitsev Rank

In this paper, we study generalized soluble groups with restriction on normal closures of cyclic subgroups. A group G is said to have finite Hirsch–Zaitsev rank if G has an ascending series whose factors are either infinite cyclic or periodic and if the number of infinite cyclic factors is finite. It is not hard to see that the number of infinite cyclic factors in each of such series is an invariant of a group G. This invariant is called the Hirsch–Zaitsev rank of G and will be denoted by r{sub hz}(G). We study the groups in which the normal closure of every cyclic subgroup has the Hirsch–Zaitsev rank at most b (b is some positive integer). For some natural restrictions we find a function k{sub 1}(b) such that r{sub hz}([G/Tor(G),G/Tor(G)]) ≤ k{sub 1}(b).

97 MATHEMATICS AND COMPUTING↗

Structure of Rank-One Matrices Over the Domain of Principal Ideals Relative to Similarity Transformations

We study the structure of rank-one matrices over the domain of principal ideals relative to equivalence and similarity transformations. The canonical form of rank-one matrices relative to similarity transformations is established. We propose conditions under which a pair of rank-one matrices is reduced to the triangular form by a similarity transformation.

97 MATHEMATICS AND COMPUTING↗

Compact video content representation for video coding using low multi-linear tensor rank approximation with dynamic core tensor order

Tensor is a multi-way representation of an entity that is widely used in many applications of mathematics and physics. The wide range of tensor algebra operations attract the researchers of graphical and vision field to identify unique methods for various applications such as segmentation, compression, indexing and so on. In this paper, low multi-linear rank approximation of a tensor is used for decomposition so as to perform compression on a video that is represented as a 4D tensor. Thus, the encoder has blocks for (1) multilinear rank approximation method so as to aid decomposition, (2) sparsity removal of residual data to reduce the required memory storage to a small level, (3) quantization on the sparse less residual data and (4) LZ77 dictionary coding for the video. The decoder uses a tensor reconstruction block along with residual error correction block that reduces loss/error in the reconstructed video. The size of core tensor is an important factor in rank approximation. It is identified at run time depending on the video contents. This size is determined adaptively using Tikhonov’s regularization method. The best value of core tensor size is identified with the corner of L-curve which preserves the video contents from heavy loss/error. Experimental results of the proposed work on comparison with H.264/AVC compression method indicate that the proposed method achieves up to 10% improvement in compression ratio with the least amount of loss and a maximum signal to noise ratio of 0.14. The proposed system gives better compression ratio than H.265 for videos with more number of frames without compromising quality.

97 MATHEMATICS AND COMPUTING↗

A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix

A Euclidean distance matrix (EDM) is a table of distance-square between points on a k-dimensional Euclidean space, with applications in many fields (e.g., engineering, geodesy, economics, genetics, biochemistry, and psychology). A problem that often arises is the absence (or uncertainty) of some EDM elements. In many situations, only a subset of all pairwise distances is available and it is desired to have some procedure to estimate the missing distances. In this paper, we address the problem of missing data in EDM through low-rank matrix completion techniques. We exploit the fact that the rank of a EDM is at most k+2 and does not depend on the number of points, which is, in general, much bigger then k. We use a singular value decomposition approach that considers the rank of the matrix to be completed and computes, in each iteration, a parameter that controls the convergence of the method. After performing a number of computational experiments, we could observe that our proposal was able to recover, with high precision, random EDMs with more than 1000 points and up to 98% of missing data in few minutes. In addition, our method required a smaller number of iterations when compared to other competitive state-of-art technique.

97 MATHEMATICS AND COMPUTING↗

Seasonal Disorder in Urban Traffic Patterns: A Low Rank Analysis

This article proposes several advances to sparse nonnegative matrix factorization (SNMF) as a way to identify large-scale patterns in urban traffic data. The input to our model is traffic counts organized by time and location. Nonnegative matrix factorization additively decomposes this information, organized as a matrix, into a linear sum of temporal signatures. Penalty terms encourage this factorization to concentrate on only a few temporal signatures, with weights which are not too large. Our interest here is to quantify and compare the regularity of traffic behavior, particularly across different broad temporal windows. In addition to the rank and error, we adapt a measure introduced by Hoyer to quantify sparsity in the representation. Combining these, we construct several curves which quantify error as a function of rank (the number of possible signatures) and sparsity; as rank goes up and sparsity goes down, the approximation can be better and the error should decreases. Plots of several such curves corresponding to different time windows leads to a way to compare disorder/order at different time scalewindows. In this paper, we apply our algorithms and procedures to study a taxi traffic dataset from New York City. In this dataset, we find weekly periodicity in the signatures, which allows us an extra framework for identifying outliers as significant deviations from weekly medians. We then apply our seasonal disorder analysis to the New York City traffic data and seasonal (spring, summer, winter, fall) time windows. We do find seasonal differences in traffic order.

97 MATHEMATICS AND COMPUTING↗

On the Schmidt-rank-three bipartite and multipartite unitary operator

Unitary operations are physically implementable. We further the understanding of such operators by studying the possible forms of nonlocal unitary operators, which are bipartite or multipartite unitary operators that are not tensor product operators. They are of broad relevance in quantum information processing. We prove that any nonlocal unitary operator of Schmidt rank three on a d{sub A}×d{sub B} bipartite system is locally equivalent to a controlled unitary. This operator can be locally implemented assisted by a maximally entangled state of Schmidt rank min(d{sub A}{sup 2},d{sub B}) when d{sub A}≤d{sub B}. We further show that any multipartite unitary operator U of Schmidt rank three can be controlled by one system or collectively controlled by two systems, regardless of the number of systems of U. In the scenario of n-qubit, we construct non-controlled U for any odd n≥5, and prove that U is a controlled unitary for any even n≥4.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A ranking methodology for the coupling of pressurized water nuclear reactors and molten salt thermal energy storage

Thermal energy storage (TES) systems are a proposed solution to electricity market demand fluctuations and can be coupled to nuclear power plants to enable load following. Here, this work focuses on developing a methodology for evaluating potential designs for integrating a TES system into an existing pressurized water nuclear power plant. The proposed ranking methodology allows a group of experts to postulate and weigh designs based on ranking criteria derived from literature. The methodology developed in this study can aid in the final selection of a TES design for an existing nuclear power plant. The same process could be used to analyze other TES and nuclear reactor designs. The determined optimum design from this methodology was to place the TES system after the steam generator and to utilize the steam generated from the nuclear power plant to heat a molten salt TES unit. Another conclusion of this research was that human bias is prevalent during design selection, and actions such as standardized ranking criteria and large groups of experts should be used to minimize this error.

25 ENERGY STORAGE↗

Reduced-order microstructure-sensitive protocols to rank-order the transition fatigue resistance of polycrystalline microstructures

We present that the transition fatigue regime between low cycle fatigue (LCF) and high cycle fatigue (HCF) is often addressed in the design and performance evaluation of load-bearing components used in many structural applications. Transition fatigue is characterized by elevated levels of local inelastic deformation in significant regions of the microstructure as compared to HCF. Typically, crystal plasticity finite element method (CPFEM) simulations are performed to model this phenomenon and to rank-order microstructures by their resistance to crack formation and early growth in the regime of transition fatigue. Unfortunately, these approaches require significant computational resources, inhibiting their use to explore novel materials for transition fatigue resistance. Reduced-order, microstructure-sensitive models are needed to accelerate the search for next-generation, fatigue-resistant materials. In a recent study, Paulson et al. (2018) extended the materials knowledge system (MKS) framework for rank-ordering the HCF resistance of polycrystalline microstructures. The efficacy of this approach lies in the reduced-dimensional representation of microstructures through 2-point spatial correlations and principal component analysis (PCA), in addition to the characterization of the HCF response with a small set of performance measures. In this work, these same protocols are critically evaluated for their applicability to rank-order the transition fatigue resistance of the same class of polycrystalline microstructures subjected to increased strain amplitudes. Success in this endeavor requires the formation of homogenization linkages that account for the significantly higher levels of local inelastic deformation and stress redistribution in transition fatigue as compared to HCF. Finally, a set of 12 α-titanium microstructures generated using the open access DREAM.3D software (Groeber and Jackson, 2014) are employed for this evaluation.

2-point correlations↗

Accelerating Dynamic Magnetic Resonance Imaging (MRI) for Lung Tumor Tracking Based on Low-Rank Decomposition in the Spatial–Temporal Domain: A Feasibility Study Based on Simulation and Preliminary Prospective Undersampled MRI

Purpose: To evaluate a low-rank decomposition method to reconstruct down-sampled k-space data for the purpose of tumor tracking. Methods and Materials: Seven retrospective lung cancer patients were included in the simulation study. The fully-sampled k-space data were first generated from existing 2-dimensional dynamic MR images and then down-sampled by 5 × -20 × before reconstruction using a Cartesian undersampling mask. Two methods, a low-rank decomposition method using combined dynamic MR images (k-t SLR based on sparsity and low-rank penalties) and a total variation (TV) method using individual dynamic MR frames, were used to reconstruct images. The tumor trajectories were derived on the basis of autosegmentation of the resultant images. To further test its feasibility, k-t SLR was used to reconstruct prospective data of a healthy subject. An undersampled balanced steady-state free precession sequence with the same undersampling mask was used to acquire the imaging data. Results: In the simulation study, higher imaging fidelity and low noise levels were achieved with the k-t SLR compared with TV. At 10 × undersampling, the k-t SLR method resulted in an average normalized mean square error <0.05, as opposed to 0.23 by using the TV reconstruction on individual frames. Less than 6% showed tracking errors >1 mm with 10 × down-sampling using k-t SLR, as opposed to 17% using TV. In the prospective study, k-t SLR substantially reduced reconstruction artifacts and retained anatomic details. Conclusions: Magnetic resonance reconstruction using k-t SLR on highly undersampled dynamic MR imaging data results in high image quality useful for tumor tracking. The k-t SLR was superior to TV by better exploiting the intrinsic anatomic coherence of the same patient. The feasibility of k-t SLR was demonstrated by prospective imaging acquisition and reconstruction.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A Ranked-Orbital Approach to Select Active Spaces for High-Throughput Multireference Computation

The past decade has seen a great increase in the application of high-throughput computation to a variety of important problems in chemistry. However, one area which has been resistant to the high-throughput approach is multireference wave function methods, in large part due to the technicalities of setting up these calculations and in particular the not always intuitive challenge of active space selection. As we look toward a future of applying high-throughput computation to all areas of chemistry, it is important to prepare these methods for large-scale automation. Here, we propose a ranked-orbital approach to select active spaces with the goal of standardizing multireference methods for high-throughput computation. This method allows for the meaningful comparison of different active space selection schemes and orbital localizations, and we demonstrate the utility of this approach across 1120 multireference calculations for the excitation energies of small molecules. Our results reveal that it is helpful to distinguish the method used to generate orbitals from the method of ranking orbitals in terms of importance for the active space. Additionally, we propose our own orbital ranking scheme that estimates the importance of an orbital for the active space through a pair-interaction framework from orbital energies and features of the Hartree–Fock exchange matrix. Here, we call this new scheme the “approximate pair coefficient” (APC) method and we show that it performs quite well for the test systems presented.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

High-level computer molecular modeling for low-rank coal containing metal complexes and iron-catalyzed steam gasification

Low-rank coal is a complex mixture; consequently, it is necessary to develop simpler molecular representations for computational modeling. Our modeling objective has been to develop molecules suitable for semi-empirical (SE) computations of low-rank coal containing transition-metal complexes. These molecular models contain oxygen functional groups that are macro-ligands, forming coordination complexes with specific three-dimensional (3D) orientations; consequently, we develop models that encapsulate the properties of low-rank coals and can form metal complexes. The large computer resources required for SE calculations of these molecules limited their size; of the models examined, those containing numerous short links between phenyl groups caused excessive strain and were unsuitable to model transition-metal complexes. Computations (SE) of our models provided data on (i) hydrogen bonds of coal containing water, (ii) formation of aqua-inorganic species and transition-metal complexes, (iii) pyrolysis chemistry involving transformations of metal hydroxide/oxides, (iv) routes for H{sub 2} and CO formation, and (v) mechanism of iron-catalyzed steam gasification. Our char models, on the basis of transformations of the coal model, were consistent with low-temperature pyrolysis; these were disordered structures with some phenyl groups spaced between 0.35 and 0.4 nm. Smaller models of char and chars containing transition-metal clusters were optimized with SE and density functional theory (DFT) computations; these models were useful in modeling the mechanism of catalytic steam gasification. Our modeling of the mechanisms of iron-catalyzed steam gasification was consistent with experimental data. 44 refs., 5 figs., 5 tabs.

01 COAL, LIGNITE, AND PEAT↗

An improved Greengenes taxonomy with explicit ranks for ecological and evolutionary analyses of bacteria and archaea

Reference phylogenies are crucial for providing a taxonomic framework for interpretation of marker gene and metagenomic surveys, which continue to reveal novel species at a remarkable rate. Greengenes is a dedicated full-length 16S rRNA gene database that provides users with a curated taxonomy based on de novo tree inference. We developed a ‘taxonomy to tree’ approach for transferring group names from an existing taxonomy to a tree topology, and used it to apply the Greengenes, National Center for Biotechnology Information (NCBI) and cyanoDB (Cyanobacteria only) taxonomies to a de novo tree comprising 408 315 sequences. We also incorporated explicit rank information provided by the NCBI taxonomy to group names (by prefixing rank designations) for better user orientation and classification consistency. The resulting merged taxonomy improved the classification of 75% of the sequences by one or more ranks relative to the original NCBI taxonomy with the most pronounced improvements occurring in under-classified environmental sequences. We also assessed candidate phyla (divisions) currently defined by NCBI and present recommendations for consolidation of 34 redundantly named groups. All intermediate results from the pipeline, which includes tree inference, jackknifing and transfer of a donor taxonomy to a recipient tree (tax2tree) are available for download. The improved Greengenes taxonomy should provide important infrastructure for a wide range of megasequencing projects studying ecosystems on scales ranging from our own bodies (the Human Microbiome Project) to the entire planet (the Earth Microbiome Project). The implementation of the software can be obtained from http://sourceforge.net/projects/tax2tree/.

54 ENVIRONMENTAL SCIENCES↗

Outlier analyses of the Protein Data Bank archive using a probability-density-ranking approach

Outlier analyses are central to scientific data assessments. Conventional outlier identification methods do not work effectively for Protein Data Bank (PDB) data, which are characterized by heavy skewness and the presence of bounds and/or long tails. We have developed a data-driven nonparametric method to identify outliers in PDB data based on kernel probability density estimation. Unlike conventional outlier analyses based on location and scale, Probability Density Ranking can be used for robust assessments of distance from other observations. Analyzing PDB data from the vantage points of probability and frequency enables proper outlier identification, which is important for quality control during deposition-validation-biocuration of new three-dimensional structure data. Ranking of Probability Density also permits use of Most Probable Range as a robust measure of data dispersion that is more compact than Interquartile Range. The Probability-Density-Ranking approach can be employed to analyze outliers and data-spread on any large data set with continuous distribution.

59 BASIC BIOLOGICAL SCIENCES↗

Rank reduced coupled cluster theory. II. Equation-of-motion coupled-cluster singles and doubles

Equation-of-motion coupled-cluster singles and doubles (EOM-CCSD) is a reliable and popular approach to the determination of electronic excitation energies. Recently, we have developed a rank-reduced CCSD (RR-CCSD) method that allows the ground-state coupled-cluster energy to be determined with low-rank cluster amplitudes. Here, we extend this approach to excited-state energies through a RR-EOM-CCSD method. We start from the EOM-CCSD energy functional and insert low-rank approximations to the doubles amplitudes. The result is an approximate EOM-CCSD method with only a quadratic number (in the molecular size) of free parameters in the wavefunction. Importantly, our formulation of RR-EOM-CCSD preserves the size intensivity of the excitation energy and size extensivity of the total energy. Numerical tests of the method suggest that accuracy on the order of 0.05–0.01 eV in the excitation energy is possible with 1% or less of the original number of wavefunction coefficients; accuracy of better than 0.01 eV can be achieved with about 4% or less of the free parameters. The amount of compression at a given accuracy level is expected to increase with the size of the molecule. The RR-EOM-CCSD method is a new path toward the efficient determination of accurate electronic excitation energies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Classification of hyperbolic singularities of rank zero of integrable Hamiltonian systems

A complete invariant is constructed that is a solution of the problem of semilocal classification of saddle singularities of integrable Hamiltonian systems. Namely, a certain combinatorial object (an f{sub n}-graph) is associated with every nondegenerate saddle singularity of rank zero; as a result, the problem of semilocal classification of saddle singularities of rank zero is reduced to the problem of enumeration of the f{sub n}-graphs. This enables us to describe a simple algorithm for obtaining the lists of saddle singularities of rank zero for a given number of degrees of freedom and a given complexity. Bibliography: 24 titles.

97 MATHEMATICS AND COMPUTING↗

On Boolean matrices with full factor rank

It is demonstrated that every (0,1)-matrix of size n×m having Boolean rank n contains a column with at least √n/2−1 zero entries. This bound is shown to be asymptotically optimal. As a corollary, it is established that the size of a full-rank Boolean matrix is bounded from above by a function of its tropical and determinantal ranks. Bibliography: 16 titles.

97 MATHEMATICS AND COMPUTING↗

Low-rank canonical-tensor decomposition of potential energy surfaces: application to grid-based diagrammatic vibrational Green's function theory

Here, a new method is proposed for a fast evaluation of high-dimensional integrals of potential energy surfaces (PES) that arise in many areas of quantum dynamics. It decomposes a PES into a canonical low-rank tensor format, reducing its integral into a relatively short sum of products of low-dimensional integrals. The decomposition is achieved by the alternating least squares (ALS) algorithm, requiring only a small number of single-point energy evaluations. Therefore, it eradicates a force-constant evaluation as the hotspot of many quantum dynamics simulations and also possibly lifts the curse of dimensionality. This general method is applied to the anharmonic vibrational zero-point and transition energy calculations of molecules using the second-order diagrammatic vibrational many-body Green's function (XVH2) theory with a harmonic-approximation reference. In this application, high dimensional PES and Green's functions are both subjected to a low-rank decomposition. Evaluating the molecular integrals over a low-rank PES and Green's functions as sums of low-dimensional integrals using the Gauss–Hermite quadrature, this canonical-tensor-decomposition-based XVH2 (CT-XVH2) achieves an accuracy of 0.1 cm -1 or higher and nearly an order of magnitude speedup as compared with the original algorithm using force constants for water and formaldehyde.

74 ATOMIC AND MOLECULAR PHYSICS↗

Low-rank Sachdev-Ye-Kitaev models

Motivated by recent proposals of experimental realization of fast scramblers, we study a family of solvable variants of the ($\textit{q}$ = 4) Sachdev-Ye-Kitaev model in which the rank and eigenvalue distribution of the coupling matrix $J_{ ij,kl}$ are tuneable. When the rank is proportional to the number of fermions, the low temperature behavior is sensitive to the eigenvalue distribution. We obtain a complete classification of the possible non-Fermi liquid quantum phases. These include two previously studied phases whose fermion scaling dimension depends continuously on the rank; we show that they are maximally chaotic, but necessitate an extensively degenerate or negative semidefinite coupling matrix. In this work, more generic distributions give rise to “almost Fermi liquids” with a scaling dimension Δ = 1/2, but which differ from a genuine Fermi liquid in quasiparticle decay rate, quantum Lyapunov exponent, and/or specific heat.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗