Matrix completion via a low rank factorization model and an Augmented Lagrangean Succesive Overrelaxation Algorithm

Directory of Open Access Journals (Sweden)

Hugo Lara

2014-12-01

Full Text Available The matrix completion problem (MC has been approximated by using the nuclear norm relaxation. Some algorithms based on this strategy require the computationally expensive singular value decomposition (SVD at each iteration. One way to avoid SVD calculations is to use alternating methods, which pursue the completion through matrix factorization with a low rank condition. In this work an augmented Lagrangean-type alternating algorithm is proposed. The new algorithm uses duality information to define the iterations, in contrast to the solely primal LMaFit algorithm, which employs a Successive Over Relaxation scheme. The convergence result is studied. Some numerical experiments are given to compare numerical performance of both proposals.

Nonnegative Matrix Factorization with Rank Regularization and Hard Constraint.

Science.gov (United States)

Shang, Ronghua; Liu, Chiyang; Meng, Yang; Jiao, Licheng; Stolkin, Rustam

2017-09-01

Nonnegative matrix factorization (NMF) is well known to be an effective tool for dimensionality reduction in problems involving big data. For this reason, it frequently appears in many areas of scientific and engineering literature. This letter proposes a novel semisupervised NMF algorithm for overcoming a variety of problems associated with NMF algorithms, including poor use of prior information, negative impact on manifold structure of the sparse constraint, and inaccurate graph construction. Our proposed algorithm, nonnegative matrix factorization with rank regularization and hard constraint (NMFRC), incorporates label information into data representation as a hard constraint, which makes full use of prior information. NMFRC also measures pairwise similarity according to geodesic distance rather than Euclidean distance. This results in more accurate measurement of pairwise relationships, resulting in more effective manifold information. Furthermore, NMFRC adopts rank constraint instead of norm constraints for regularization to balance the sparseness and smoothness of data. In this way, the new data representation is more representative and has better interpretability. Experiments on real data sets suggest that NMFRC outperforms four other state-of-the-art algorithms in terms of clustering accuracy.

Low-Rank Sparse Coding for Image Classification

KAUST Repository

Zhang, Tianzhu; Ghanem, Bernard; Liu, Si; Xu, Changsheng; Ahuja, Narendra

2013-01-01

In this paper, we propose a low-rank sparse coding (LRSC) method that exploits local structure information among features in an image for the purpose of image-level classification. LRSC represents densely sampled SIFT descriptors, in a spatial neighborhood, collectively as low-rank, sparse linear combinations of code words. As such, it casts the feature coding problem as a low-rank matrix learning problem, which is different from previous methods that encode features independently. This LRSC has a number of attractive properties. (1) It encourages sparsity in feature codes, locality in codebook construction, and low-rankness for spatial consistency. (2) LRSC encodes local features jointly by considering their low-rank structure information, and is computationally attractive. We evaluate the LRSC by comparing its performance on a set of challenging benchmarks with that of 7 popular coding and other state-of-the-art methods. Our experiments show that by representing local features jointly, LRSC not only outperforms the state-of-the-art in classification accuracy but also improves the time complexity of methods that use a similar sparse linear representation model for feature coding.

Low-Rank Sparse Coding for Image Classification

KAUST Repository

Zhang, Tianzhu

2013-12-01

In this paper, we propose a low-rank sparse coding (LRSC) method that exploits local structure information among features in an image for the purpose of image-level classification. LRSC represents densely sampled SIFT descriptors, in a spatial neighborhood, collectively as low-rank, sparse linear combinations of code words. As such, it casts the feature coding problem as a low-rank matrix learning problem, which is different from previous methods that encode features independently. This LRSC has a number of attractive properties. (1) It encourages sparsity in feature codes, locality in codebook construction, and low-rankness for spatial consistency. (2) LRSC encodes local features jointly by considering their low-rank structure information, and is computationally attractive. We evaluate the LRSC by comparing its performance on a set of challenging benchmarks with that of 7 popular coding and other state-of-the-art methods. Our experiments show that by representing local features jointly, LRSC not only outperforms the state-of-the-art in classification accuracy but also improves the time complexity of methods that use a similar sparse linear representation model for feature coding.

The optimized expansion based low-rank method for wavefield extrapolation

KAUST Repository

Wu, Zedong

2014-03-01

Spectral methods are fast becoming an indispensable tool for wavefield extrapolation, especially in anisotropic media because it tends to be dispersion and artifact free as well as highly accurate when solving the wave equation. However, for inhomogeneous media, we face difficulties in dealing with the mixed space-wavenumber domain extrapolation operator efficiently. To solve this problem, we evaluated an optimized expansion method that can approximate this operator with a low-rank variable separation representation. The rank defines the number of inverse Fourier transforms for each time extrapolation step, and thus, the lower the rank, the faster the extrapolation. The method uses optimization instead of matrix decomposition to find the optimal wavenumbers and velocities needed to approximate the full operator with its explicit low-rank representation. As a result, we obtain lower rank representations compared with the standard low-rank method within reasonable accuracy and thus cheaper extrapolations. Additional bounds set on the range of propagated wavenumbers to adhere to the physical wave limits yield unconditionally stable extrapolations regardless of the time step. An application on the BP model provided superior results compared to those obtained using the decomposition approach. For transversely isotopic media, because we used the pure P-wave dispersion relation, we obtained solutions that were free of the shear wave artifacts, and the algorithm does not require that n > 0. In addition, the required rank for the optimization approach to obtain high accuracy in anisotropic media was lower than that obtained by the decomposition approach, and thus, it was more efficient. A reverse time migration result for the BP tilted transverse isotropy model using this method as a wave propagator demonstrated the ability of the algorithm.

Efficient Low Rank Tensor Ring Completion

OpenAIRE

Wang, Wenqi; Aggarwal, Vaneet; Aeron, Shuchin

2017-01-01

Using the matrix product state (MPS) representation of the recently proposed tensor ring decompositions, in this paper we propose a tensor completion algorithm, which is an alternating minimization algorithm that alternates over the factors in the MPS representation. This development is motivated in part by the success of matrix completion algorithms that alternate over the (low-rank) factors. In this paper, we propose a spectral initialization for the tensor ring completion algorithm and ana...

Gene Ranking of RNA-Seq Data via Discriminant Non-Negative Matrix Factorization.

Science.gov (United States)

Jia, Zhilong; Zhang, Xiang; Guan, Naiyang; Bo, Xiaochen; Barnes, Michael R; Luo, Zhigang

2015-01-01

RNA-sequencing is rapidly becoming the method of choice for studying the full complexity of transcriptomes, however with increasing dimensionality, accurate gene ranking is becoming increasingly challenging. This paper proposes an accurate and sensitive gene ranking method that implements discriminant non-negative matrix factorization (DNMF) for RNA-seq data. To the best of our knowledge, this is the first work to explore the utility of DNMF for gene ranking. When incorporating Fisher's discriminant criteria and setting the reduced dimension as two, DNMF learns two factors to approximate the original gene expression data, abstracting the up-regulated or down-regulated metagene by using the sample label information. The first factor denotes all the genes' weights of two metagenes as the additive combination of all genes, while the second learned factor represents the expression values of two metagenes. In the gene ranking stage, all the genes are ranked as a descending sequence according to the differential values of the metagene weights. Leveraging the nature of NMF and Fisher's criterion, DNMF can robustly boost the gene ranking performance. The Area Under the Curve analysis of differential expression analysis on two benchmarking tests of four RNA-seq data sets with similar phenotypes showed that our proposed DNMF-based gene ranking method outperforms other widely used methods. Moreover, the Gene Set Enrichment Analysis also showed DNMF outweighs others. DNMF is also computationally efficient, substantially outperforming all other benchmarked methods. Consequently, we suggest DNMF is an effective method for the analysis of differential gene expression and gene ranking for RNA-seq data.

Low rank magnetic resonance fingerprinting.

Science.gov (United States)

Mazor, Gal; Weizman, Lior; Tal, Assaf; Eldar, Yonina C

2016-08-01

Magnetic Resonance Fingerprinting (MRF) is a relatively new approach that provides quantitative MRI using randomized acquisition. Extraction of physical quantitative tissue values is preformed off-line, based on acquisition with varying parameters and a dictionary generated according to the Bloch equations. MRF uses hundreds of radio frequency (RF) excitation pulses for acquisition, and therefore high under-sampling ratio in the sampling domain (k-space) is required. This under-sampling causes spatial artifacts that hamper the ability to accurately estimate the quantitative tissue values. In this work, we introduce a new approach for quantitative MRI using MRF, called Low Rank MRF. We exploit the low rank property of the temporal domain, on top of the well-known sparsity of the MRF signal in the generated dictionary domain. We present an iterative scheme that consists of a gradient step followed by a low rank projection using the singular value decomposition. Experiments on real MRI data demonstrate superior results compared to conventional implementation of compressed sensing for MRF at 15% sampling ratio.

Super-resolution reconstruction of 4D-CT lung data via patch-based low-rank matrix reconstruction

Science.gov (United States)

Fang, Shiting; Wang, Huafeng; Liu, Yueliang; Zhang, Minghui; Yang, Wei; Feng, Qianjin; Chen, Wufan; Zhang, Yu

2017-10-01

Lung 4D computed tomography (4D-CT), which is a time-resolved CT data acquisition, performs an important role in explicitly including respiratory motion in treatment planning and delivery. However, the radiation dose is usually reduced at the expense of inter-slice spatial resolution to minimize radiation-related health risk. Therefore, resolution enhancement along the superior-inferior direction is necessary. In this paper, a super-resolution (SR) reconstruction method based on a patch low-rank matrix reconstruction is proposed to improve the resolution of lung 4D-CT images. Specifically, a low-rank matrix related to every patch is constructed by using a patch searching strategy. Thereafter, the singular value shrinkage is employed to recover the high-resolution patch under the constraints of the image degradation model. The output high-resolution patches are finally assembled to output the entire image. This method is extensively evaluated using two public data sets. Quantitative analysis shows that the proposed algorithm decreases the root mean square error by 9.7%-33.4% and the edge width by 11.4%-24.3%, relative to linear interpolation, back projection (BP) and Zhang et al’s algorithm. A new algorithm has been developed to improve the resolution of 4D-CT. In all experiments, the proposed method outperforms various interpolation methods, as well as BP and Zhang et al’s method, thus indicating the effectivity and competitiveness of the proposed algorithm.

Texture Repairing by Unified Low Rank Optimization

Institute of Scientific and Technical Information of China (English)

Xiao Liang; Xiang Ren; Zhengdong Zhang; Yi Ma

2016-01-01

In this paper, we show how to harness both low-rank and sparse structures in regular or near-regular textures for image completion. Our method is based on a unified formulation for both random and contiguous corruption. In addition to the low rank property of texture, the algorithm also uses the sparse assumption of the natural image: because the natural image is piecewise smooth, it is sparse in certain transformed domain (such as Fourier or wavelet transform). We combine low-rank and sparsity properties of the texture image together in the proposed algorithm. Our algorithm based on convex optimization can automatically and correctly repair the global structure of a corrupted texture, even without precise information about the regions to be completed. This algorithm integrates texture rectification and repairing into one optimization problem. Through extensive simulations, we show our method can complete and repair textures corrupted by errors with both random and contiguous supports better than existing low-rank matrix recovery methods. Our method demonstrates significant advantage over local patch based texture synthesis techniques in dealing with large corruption, non-uniform texture, and large perspective deformation.

Weighted Discriminative Dictionary Learning based on Low-rank Representation

International Nuclear Information System (INIS)

Chang, Heyou; Zheng, Hao

2017-01-01

Low-rank representation has been widely used in the field of pattern classification, especially when both training and testing images are corrupted with large noise. Dictionary plays an important role in low-rank representation. With respect to the semantic dictionary, the optimal representation matrix should be block-diagonal. However, traditional low-rank representation based dictionary learning methods cannot effectively exploit the discriminative information between data and dictionary. To address this problem, this paper proposed weighted discriminative dictionary learning based on low-rank representation, where a weighted representation regularization term is constructed. The regularization associates label information of both training samples and dictionary atoms, and encourages to generate a discriminative representation with class-wise block-diagonal structure, which can further improve the classification performance where both training and testing images are corrupted with large noise. Experimental results demonstrate advantages of the proposed method over the state-of-the-art methods. (paper)

Tensor completion and low-n-rank tensor recovery via convex optimization

International Nuclear Information System (INIS)

Gandy, Silvia; Yamada, Isao; Recht, Benjamin

2011-01-01

In this paper we consider sparsity on a tensor level, as given by the n-rank of a tensor. In an important sparse-vector approximation problem (compressed sensing) and the low-rank matrix recovery problem, using a convex relaxation technique proved to be a valuable solution strategy. Here, we will adapt these techniques to the tensor setting. We use the n-rank of a tensor as a sparsity measure and consider the low-n-rank tensor recovery problem, i.e. the problem of finding the tensor of the lowest n-rank that fulfills some linear constraints. We introduce a tractable convex relaxation of the n-rank and propose efficient algorithms to solve the low-n-rank tensor recovery problem numerically. The algorithms are based on the Douglas–Rachford splitting technique and its dual variant, the alternating direction method of multipliers

Multi-energy CT based on a prior rank, intensity and sparsity model (PRISM)

International Nuclear Information System (INIS)

Gao, Hao; Osher, Stanley; Yu, Hengyong; Wang, Ge

2011-01-01

We propose a compressive sensing approach for multi-energy computed tomography (CT), namely the prior rank, intensity and sparsity model (PRISM). To further compress the multi-energy image for allowing the reconstruction with fewer CT data and less radiation dose, the PRISM models a multi-energy image as the superposition of a low-rank matrix and a sparse matrix (with row dimension in space and column dimension in energy), where the low-rank matrix corresponds to the stationary background over energy that has a low matrix rank, and the sparse matrix represents the rest of distinct spectral features that are often sparse. Distinct from previous methods, the PRISM utilizes the generalized rank, e.g., the matrix rank of tight-frame transform of a multi-energy image, which offers a way to characterize the multi-level and multi-filtered image coherence across the energy spectrum. Besides, the energy-dependent intensity information can be incorporated into the PRISM in terms of the spectral curves for base materials, with which the restoration of the multi-energy image becomes the reconstruction of the energy-independent material composition matrix. In other words, the PRISM utilizes prior knowledge on the generalized rank and sparsity of a multi-energy image, and intensity/spectral characteristics of base materials. Furthermore, we develop an accurate and fast split Bregman method for the PRISM and demonstrate the superior performance of the PRISM relative to several competing methods in simulations. (papers)

Low-rank coal research

Energy Technology Data Exchange (ETDEWEB)

Weber, G. F.; Laudal, D. L.

1989-01-01

This work is a compilation of reports on ongoing research at the University of North Dakota. Topics include: Control Technology and Coal Preparation Research (SO{sub x}/NO{sub x} control, waste management), Advanced Research and Technology Development (turbine combustion phenomena, combustion inorganic transformation, coal/char reactivity, liquefaction reactivity of low-rank coals, gasification ash and slag characterization, fine particulate emissions), Combustion Research (fluidized bed combustion, beneficiation of low-rank coals, combustion characterization of low-rank coal fuels, diesel utilization of low-rank coals), Liquefaction Research (low-rank coal direct liquefaction), and Gasification Research (hydrogen production from low-rank coals, advanced wastewater treatment, mild gasification, color and residual COD removal from Synfuel wastewaters, Great Plains Gasification Plant, gasifier optimization).

On low-rank updates to the singular value and Tucker decompositions

Energy Technology Data Exchange (ETDEWEB)

O' Hara, M J

2009-10-06

The singular value decomposition is widely used in signal processing and data mining. Since the data often arrives in a stream, the problem of updating matrix decompositions under low-rank modification has been widely studied. Brand developed a technique in 2006 that has many advantages. However, the technique does not directly approximate the updated matrix, but rather its previous low-rank approximation added to the new update, which needs justification. Further, the technique is still too slow for large information processing problems. We show that the technique minimizes the change in error per update, so if the error is small initially it remains small. We show that an updating algorithm for large sparse matrices should be sub-linear in the matrix dimension in order to be practical for large problems, and demonstrate a simple modification to the original technique that meets the requirements.

High-dimensional statistical inference: From vector to matrix

Science.gov (United States)

Zhang, Anru

estimator is easy to implement via convex programming and performs well numerically. The techniques and main results developed in the chapter also have implications to other related statistical problems. An application to estimation of spiked covariance matrices from one-dimensional random projections is considered. The results demonstrate that it is still possible to accurately estimate the covariance matrix of a high-dimensional distribution based only on one-dimensional projections. For the third part of the thesis, we consider another setting of low-rank matrix completion. Current literature on matrix completion focuses primarily on independent sampling models under which the individual observed entries are sampled independently. Motivated by applications in genomic data integration, we propose a new framework of structured matrix completion (SMC) to treat structured missingness by design. Specifically, our proposed method aims at efficient matrix recovery when a subset of the rows and columns of an approximately low-rank matrix are observed. We provide theoretical justification for the proposed SMC method and derive lower bound for the estimation errors, which together establish the optimal rate of recovery over certain classes of approximately low-rank matrices. Simulation studies show that the method performs well in finite sample under a variety of configurations. The method is applied to integrate several ovarian cancer genomic studies with different extent of genomic measurements, which enables us to construct more accurate prediction rules for ovarian cancer survival.

Learning Low-Rank Class-Specific Dictionary and Sparse Intra-Class Variant Dictionary for Face Recognition

Science.gov (United States)

Tang, Xin; Feng, Guo-can; Li, Xiao-xin; Cai, Jia-xin

2015-01-01

Face recognition is challenging especially when the images from different persons are similar to each other due to variations in illumination, expression, and occlusion. If we have sufficient training images of each person which can span the facial variations of that person under testing conditions, sparse representation based classification (SRC) achieves very promising results. However, in many applications, face recognition often encounters the small sample size problem arising from the small number of available training images for each person. In this paper, we present a novel face recognition framework by utilizing low-rank and sparse error matrix decomposition, and sparse coding techniques (LRSE+SC). Firstly, the low-rank matrix recovery technique is applied to decompose the face images per class into a low-rank matrix and a sparse error matrix. The low-rank matrix of each individual is a class-specific dictionary and it captures the discriminative feature of this individual. The sparse error matrix represents the intra-class variations, such as illumination, expression changes. Secondly, we combine the low-rank part (representative basis) of each person into a supervised dictionary and integrate all the sparse error matrix of each individual into a within-individual variant dictionary which can be applied to represent the possible variations between the testing and training images. Then these two dictionaries are used to code the query image. The within-individual variant dictionary can be shared by all the subjects and only contribute to explain the lighting conditions, expressions, and occlusions of the query image rather than discrimination. At last, a reconstruction-based scheme is adopted for face recognition. Since the within-individual dictionary is introduced, LRSE+SC can handle the problem of the corrupted training data and the situation that not all subjects have enough samples for training. Experimental results show that our method achieves the

Learning Low-Rank Class-Specific Dictionary and Sparse Intra-Class Variant Dictionary for Face Recognition.

Science.gov (United States)

Tang, Xin; Feng, Guo-Can; Li, Xiao-Xin; Cai, Jia-Xin

2015-01-01

Face recognition is challenging especially when the images from different persons are similar to each other due to variations in illumination, expression, and occlusion. If we have sufficient training images of each person which can span the facial variations of that person under testing conditions, sparse representation based classification (SRC) achieves very promising results. However, in many applications, face recognition often encounters the small sample size problem arising from the small number of available training images for each person. In this paper, we present a novel face recognition framework by utilizing low-rank and sparse error matrix decomposition, and sparse coding techniques (LRSE+SC). Firstly, the low-rank matrix recovery technique is applied to decompose the face images per class into a low-rank matrix and a sparse error matrix. The low-rank matrix of each individual is a class-specific dictionary and it captures the discriminative feature of this individual. The sparse error matrix represents the intra-class variations, such as illumination, expression changes. Secondly, we combine the low-rank part (representative basis) of each person into a supervised dictionary and integrate all the sparse error matrix of each individual into a within-individual variant dictionary which can be applied to represent the possible variations between the testing and training images. Then these two dictionaries are used to code the query image. The within-individual variant dictionary can be shared by all the subjects and only contribute to explain the lighting conditions, expressions, and occlusions of the query image rather than discrimination. At last, a reconstruction-based scheme is adopted for face recognition. Since the within-individual dictionary is introduced, LRSE+SC can handle the problem of the corrupted training data and the situation that not all subjects have enough samples for training. Experimental results show that our method achieves the

Learning Low-Rank Class-Specific Dictionary and Sparse Intra-Class Variant Dictionary for Face Recognition.

Directory of Open Access Journals (Sweden)

Xin Tang

Full Text Available Face recognition is challenging especially when the images from different persons are similar to each other due to variations in illumination, expression, and occlusion. If we have sufficient training images of each person which can span the facial variations of that person under testing conditions, sparse representation based classification (SRC achieves very promising results. However, in many applications, face recognition often encounters the small sample size problem arising from the small number of available training images for each person. In this paper, we present a novel face recognition framework by utilizing low-rank and sparse error matrix decomposition, and sparse coding techniques (LRSE+SC. Firstly, the low-rank matrix recovery technique is applied to decompose the face images per class into a low-rank matrix and a sparse error matrix. The low-rank matrix of each individual is a class-specific dictionary and it captures the discriminative feature of this individual. The sparse error matrix represents the intra-class variations, such as illumination, expression changes. Secondly, we combine the low-rank part (representative basis of each person into a supervised dictionary and integrate all the sparse error matrix of each individual into a within-individual variant dictionary which can be applied to represent the possible variations between the testing and training images. Then these two dictionaries are used to code the query image. The within-individual variant dictionary can be shared by all the subjects and only contribute to explain the lighting conditions, expressions, and occlusions of the query image rather than discrimination. At last, a reconstruction-based scheme is adopted for face recognition. Since the within-individual dictionary is introduced, LRSE+SC can handle the problem of the corrupted training data and the situation that not all subjects have enough samples for training. Experimental results show that our

Multi-Label Classification Based on Low Rank Representation for Image Annotation

Directory of Open Access Journals (Sweden)

Qiaoyu Tan

2017-01-01

Full Text Available Annotating remote sensing images is a challenging task for its labor demanding annotation process and requirement of expert knowledge, especially when images can be annotated with multiple semantic concepts (or labels. To automatically annotate these multi-label images, we introduce an approach called Multi-Label Classification based on Low Rank Representation (MLC-LRR. MLC-LRR firstly utilizes low rank representation in the feature space of images to compute the low rank constrained coefficient matrix, then it adapts the coefficient matrix to define a feature-based graph and to capture the global relationships between images. Next, it utilizes low rank representation in the label space of labeled images to construct a semantic graph. Finally, these two graphs are exploited to train a graph-based multi-label classifier. To validate the performance of MLC-LRR against other related graph-based multi-label methods in annotating images, we conduct experiments on a public available multi-label remote sensing images (Land Cover. We perform additional experiments on five real-world multi-label image datasets to further investigate the performance of MLC-LRR. Empirical study demonstrates that MLC-LRR achieves better performance on annotating images than these comparing methods across various evaluation criteria; it also can effectively exploit global structure and label correlations of multi-label images.

Simultaneous auto-calibration and gradient delays estimation (SAGE) in non-Cartesian parallel MRI using low-rank constraints.

Science.gov (United States)

Jiang, Wenwen; Larson, Peder E Z; Lustig, Michael

2018-03-09

To correct gradient timing delays in non-Cartesian MRI while simultaneously recovering corruption-free auto-calibration data for parallel imaging, without additional calibration scans. The calibration matrix constructed from multi-channel k-space data should be inherently low-rank. This property is used to construct reconstruction kernels or sensitivity maps. Delays between the gradient hardware across different axes and RF receive chain, which are relatively benign in Cartesian MRI (excluding EPI), lead to trajectory deviations and hence data inconsistencies for non-Cartesian trajectories. These in turn lead to higher rank and corrupted calibration information which hampers the reconstruction. Here, a method named Simultaneous Auto-calibration and Gradient delays Estimation (SAGE) is proposed that estimates the actual k-space trajectory while simultaneously recovering the uncorrupted auto-calibration data. This is done by estimating the gradient delays that result in the lowest rank of the calibration matrix. The Gauss-Newton method is used to solve the non-linear problem. The method is validated in simulations using center-out radial, projection reconstruction and spiral trajectories. Feasibility is demonstrated on phantom and in vivo scans with center-out radial and projection reconstruction trajectories. SAGE is able to estimate gradient timing delays with high accuracy at a signal to noise ratio level as low as 5. The method is able to effectively remove artifacts resulting from gradient timing delays and restore image quality in center-out radial, projection reconstruction, and spiral trajectories. The low-rank based method introduced simultaneously estimates gradient timing delays and provides accurate auto-calibration data for improved image quality, without any additional calibration scans. © 2018 International Society for Magnetic Resonance in Medicine.

Low-Rank Linear Dynamical Systems for Motor Imagery EEG.

Science.gov (United States)

Zhang, Wenchang; Sun, Fuchun; Tan, Chuanqi; Liu, Shaobo

2016-01-01

The common spatial pattern (CSP) and other spatiospectral feature extraction methods have become the most effective and successful approaches to solve the problem of motor imagery electroencephalography (MI-EEG) pattern recognition from multichannel neural activity in recent years. However, these methods need a lot of preprocessing and postprocessing such as filtering, demean, and spatiospectral feature fusion, which influence the classification accuracy easily. In this paper, we utilize linear dynamical systems (LDSs) for EEG signals feature extraction and classification. LDSs model has lots of advantages such as simultaneous spatial and temporal feature matrix generation, free of preprocessing or postprocessing, and low cost. Furthermore, a low-rank matrix decomposition approach is introduced to get rid of noise and resting state component in order to improve the robustness of the system. Then, we propose a low-rank LDSs algorithm to decompose feature subspace of LDSs on finite Grassmannian and obtain a better performance. Extensive experiments are carried out on public dataset from "BCI Competition III Dataset IVa" and "BCI Competition IV Database 2a." The results show that our proposed three methods yield higher accuracies compared with prevailing approaches such as CSP and CSSP.

Low-rank sparse learning for robust visual tracking

KAUST Repository

Zhang, Tianzhu

2012-01-01

In this paper, we propose a new particle-filter based tracking algorithm that exploits the relationship between particles (candidate targets). By representing particles as sparse linear combinations of dictionary templates, this algorithm capitalizes on the inherent low-rank structure of particle representations that are learned jointly. As such, it casts the tracking problem as a low-rank matrix learning problem. This low-rank sparse tracker (LRST) has a number of attractive properties. (1) Since LRST adaptively updates dictionary templates, it can handle significant changes in appearance due to variations in illumination, pose, scale, etc. (2) The linear representation in LRST explicitly incorporates background templates in the dictionary and a sparse error term, which enables LRST to address the tracking drift problem and to be robust against occlusion respectively. (3) LRST is computationally attractive, since the low-rank learning problem can be efficiently solved as a sequence of closed form update operations, which yield a time complexity that is linear in the number of particles and the template size. We evaluate the performance of LRST by applying it to a set of challenging video sequences and comparing it to 6 popular tracking methods. Our experiments show that by representing particles jointly, LRST not only outperforms the state-of-the-art in tracking accuracy but also significantly improves the time complexity of methods that use a similar sparse linear representation model for particles [1]. © 2012 Springer-Verlag.

Speech Denoising in White Noise Based on Signal Subspace Low-rank Plus Sparse Decomposition

Directory of Open Access Journals (Sweden)

yuan Shuai

2017-01-01

Full Text Available In this paper, a new subspace speech enhancement method using low-rank and sparse decomposition is presented. In the proposed method, we firstly structure the corrupted data as a Toeplitz matrix and estimate its effective rank for the underlying human speech signal. Then the low-rank and sparse decomposition is performed with the guidance of speech rank value to remove the noise. Extensive experiments have been carried out in white Gaussian noise condition, and experimental results show the proposed method performs better than conventional speech enhancement methods, in terms of yielding less residual noise and lower speech distortion.

Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train.

Science.gov (United States)

Bengua, Johann A; Phien, Ho N; Tuan, Hoang Duong; Do, Minh N

2017-05-01

This paper proposes a novel approach to tensor completion, which recovers missing entries of data represented by tensors. The approach is based on the tensor train (TT) rank, which is able to capture hidden information from tensors thanks to its definition from a well-balanced matricization scheme. Accordingly, new optimization formulations for tensor completion are proposed as well as two new algorithms for their solution. The first one called simple low-rank tensor completion via TT (SiLRTC-TT) is intimately related to minimizing a nuclear norm based on TT rank. The second one is from a multilinear matrix factorization model to approximate the TT rank of a tensor, and is called tensor completion by parallel matrix factorization via TT (TMac-TT). A tensor augmentation scheme of transforming a low-order tensor to higher orders is also proposed to enhance the effectiveness of SiLRTC-TT and TMac-TT. Simulation results for color image and video recovery show the clear advantage of our method over all other methods.

The higher rank numerical range of matrix polynomials

OpenAIRE

Aretaki, Aikaterini; Maroulas, John

2011-01-01

The notion of the higher rank numerical range $\\Lambda_{k}(L(\\lambda))$ for matrix polynomials $L(\\lambda)=A_{m}\\lambda^{m}+...+A_{1}\\lambda+A_{0}$ is introduced here and some fundamental geometrical properties are investigated. Further, the sharp points of $\\Lambda_{k}(L(\\lambda))$ are defined and their relation to the numerical range $w(L(\\lambda))$ is presented. A connection of $\\Lambda_{k}(L(\\lambda))$ with the vector-valued higher rank numerical range $\\Lambda_{k}(A_{0},..., A_{m})$ is a...

Robust subspace estimation using low-rank optimization theory and applications

CERN Document Server

Oreifej, Omar

2014-01-01

Various fundamental applications in computer vision and machine learning require finding the basis of a certain subspace. Examples of such applications include face detection, motion estimation, and activity recognition. An increasing interest has been recently placed on this area as a result of significant advances in the mathematics of matrix rank optimization. Interestingly, robust subspace estimation can be posed as a low-rank optimization problem, which can be solved efficiently using techniques such as the method of Augmented Lagrange Multiplier. In this book,?the authors?discuss fundame

Tile Low Rank Cholesky Factorization for Climate/Weather Modeling Applications on Manycore Architectures

KAUST Repository

Akbudak, Kadir; Ltaief, Hatem; Mikhalev, Aleksandr; Keyes, David E.

2017-01-01

Covariance matrices are ubiquitous in computational science and engineering. In particular, large covariance matrices arise from multivariate spatial data sets, for instance, in climate/weather modeling applications to improve prediction using statistical methods and spatial data. One of the most time-consuming computational steps consists in calculating the Cholesky factorization of the symmetric, positive-definite covariance matrix problem. The structure of such covariance matrices is also often data-sparse, in other words, effectively of low rank, though formally dense. While not typically globally of low rank, covariance matrices in which correlation decays with distance are nearly always hierarchically of low rank. While symmetry and positive definiteness should be, and nearly always are, exploited for performance purposes, exploiting low rank character in this context is very recent, and will be a key to solving these challenging problems at large-scale dimensions. The authors design a new and flexible tile row rank Cholesky factorization and propose a high performance implementation using OpenMP task-based programming model on various leading-edge manycore architectures. Performance comparisons and memory footprint saving on up to 200K×200K covariance matrix size show a gain of more than an order of magnitude for both metrics, against state-of-the-art open-source and vendor optimized numerical libraries, while preserving the numerical accuracy fidelity of the original model. This research represents an important milestone in enabling large-scale simulations for covariance-based scientific applications.

Tile Low Rank Cholesky Factorization for Climate/Weather Modeling Applications on Manycore Architectures

KAUST Repository

Akbudak, Kadir

2017-05-11

Covariance matrices are ubiquitous in computational science and engineering. In particular, large covariance matrices arise from multivariate spatial data sets, for instance, in climate/weather modeling applications to improve prediction using statistical methods and spatial data. One of the most time-consuming computational steps consists in calculating the Cholesky factorization of the symmetric, positive-definite covariance matrix problem. The structure of such covariance matrices is also often data-sparse, in other words, effectively of low rank, though formally dense. While not typically globally of low rank, covariance matrices in which correlation decays with distance are nearly always hierarchically of low rank. While symmetry and positive definiteness should be, and nearly always are, exploited for performance purposes, exploiting low rank character in this context is very recent, and will be a key to solving these challenging problems at large-scale dimensions. The authors design a new and flexible tile row rank Cholesky factorization and propose a high performance implementation using OpenMP task-based programming model on various leading-edge manycore architectures. Performance comparisons and memory footprint saving on up to 200K×200K covariance matrix size show a gain of more than an order of magnitude for both metrics, against state-of-the-art open-source and vendor optimized numerical libraries, while preserving the numerical accuracy fidelity of the original model. This research represents an important milestone in enabling large-scale simulations for covariance-based scientific applications.

A multi-platform evaluation of the randomized CX low-rank matrix factorization in Spark

Energy Technology Data Exchange (ETDEWEB)

Gittens, Alex; Kottalam, Jey; Yang, Jiyan; Ringenburg, Michael, F.; Chhugani, Jatin; Racah, Evan; Singh, Mohitdeep; Yao, Yushu; Fischer, Curt; Ruebel, Oliver; Bowen, Benjamin; Lewis, Norman, G.; Mahoney, Michael, W.; Krishnamurthy, Venkat; Prabhat, Mr

2017-07-27

We investigate the performance and scalability of the randomized CX low-rank matrix factorization and demonstrate its applicability through the analysis of a 1TB mass spectrometry imaging (MSI) dataset, using Apache Spark on an Amazon EC2 cluster, a Cray XC40 system, and an experimental Cray cluster. We implemented this factorization both as a parallelized C implementation with hand-tuned optimizations and in Scala using the Apache Spark high-level cluster computing framework. We obtained consistent performance across the three platforms: using Spark we were able to process the 1TB size dataset in under 30 minutes with 960 cores on all systems, with the fastest times obtained on the experimental Cray cluster. In comparison, the C implementation was 21X faster on the Amazon EC2 system, due to careful cache optimizations, bandwidth-friendly access of matrices and vector computation using SIMD units. We report these results and their implications on the hardware and software issues arising in supporting data-centric workloads in parallel and distributed environments.

ℓ1/2-norm regularized nonnegative low-rank and sparse affinity graph for remote sensing image segmentation

Science.gov (United States)

Tian, Shu; Zhang, Ye; Yan, Yiming; Su, Nan

2016-10-01

Segmentation of real-world remote sensing images is a challenge due to the complex texture information with high heterogeneity. Thus, graph-based image segmentation methods have been attracting great attention in the field of remote sensing. However, most of the traditional graph-based approaches fail to capture the intrinsic structure of the feature space and are sensitive to noises. A ℓ-norm regularization-based graph segmentation method is proposed to segment remote sensing images. First, we use the occlusion of the random texture model (ORTM) to extract the local histogram features. Then, a ℓ-norm regularized low-rank and sparse representation (LNNLRS) is implemented to construct a ℓ-regularized nonnegative low-rank and sparse graph (LNNLRS-graph), by the union of feature subspaces. Moreover, the LNNLRS-graph has a high ability to discriminate the manifold intrinsic structure of highly homogeneous texture information. Meanwhile, the LNNLRS representation takes advantage of the low-rank and sparse characteristics to remove the noises and corrupted data. Last, we introduce the LNNLRS-graph into the graph regularization nonnegative matrix factorization to enhance the segmentation accuracy. The experimental results using remote sensing images show that when compared to five state-of-the-art image segmentation methods, the proposed method achieves more accurate segmentation results.

Low-rank Kalman filtering for efficient state estimation of subsurface advective contaminant transport models

KAUST Repository

El Gharamti, Mohamad

2012-04-01

Accurate knowledge of the movement of contaminants in porous media is essential to track their trajectory and later extract them from the aquifer. A two-dimensional flow model is implemented and then applied on a linear contaminant transport model in the same porous medium. Because of different sources of uncertainties, this coupled model might not be able to accurately track the contaminant state. Incorporating observations through the process of data assimilation can guide the model toward the true trajectory of the system. The Kalman filter (KF), or its nonlinear invariants, can be used to tackle this problem. To overcome the prohibitive computational cost of the KF, the singular evolutive Kalman filter (SEKF) and the singular fixed Kalman filter (SFKF) are used, which are variants of the KF operating with low-rank covariance matrices. Experimental results suggest that under perfect and imperfect model setups, the low-rank filters can provide estimates as accurate as the full KF but at much lower computational effort. Low-rank filters are demonstrated to significantly reduce the computational effort of the KF to almost 3%. © 2012 American Society of Civil Engineers.

A Generalized Robust Minimization Framework for Low-Rank Matrix Recovery

Directory of Open Access Journals (Sweden)

Wen-Ze Shao

2014-01-01

Full Text Available This paper considers the problem of recovering low-rank matrices which are heavily corrupted by outliers or large errors. To improve the robustness of existing recovery methods, the problem is solved by formulating it as a generalized nonsmooth nonconvex minimization functional via exploiting the Schatten p-norm (0 < p ≤1 and Lq(0 < q ≤1 seminorm. Two numerical algorithms are provided based on the augmented Lagrange multiplier (ALM and accelerated proximal gradient (APG methods as well as efficient root-finder strategies. Experimental results demonstrate that the proposed generalized approach is more inclusive and effective compared with state-of-the-art methods, either convex or nonconvex.

Structured Matrix Completion with Applications to Genomic Data Integration.

Science.gov (United States)

Cai, Tianxi; Cai, T Tony; Zhang, Anru

2016-01-01

Matrix completion has attracted significant recent attention in many fields including statistics, applied mathematics and electrical engineering. Current literature on matrix completion focuses primarily on independent sampling models under which the individual observed entries are sampled independently. Motivated by applications in genomic data integration, we propose a new framework of structured matrix completion (SMC) to treat structured missingness by design. Specifically, our proposed method aims at efficient matrix recovery when a subset of the rows and columns of an approximately low-rank matrix are observed. We provide theoretical justification for the proposed SMC method and derive lower bound for the estimation errors, which together establish the optimal rate of recovery over certain classes of approximately low-rank matrices. Simulation studies show that the method performs well in finite sample under a variety of configurations. The method is applied to integrate several ovarian cancer genomic studies with different extent of genomic measurements, which enables us to construct more accurate prediction rules for ovarian cancer survival.

Computing Low-Rank Approximation of a Dense Matrix on Multicore CPUs with a GPU and Its Application to Solving a Hierarchically Semiseparable Linear System of Equations

Directory of Open Access Journals (Sweden)

Ichitaro Yamazaki

2015-01-01

of their low-rank properties. To compute a low-rank approximation of a dense matrix, in this paper, we study the performance of QR factorization with column pivoting or with restricted pivoting on multicore CPUs with a GPU. We first propose several techniques to reduce the postprocessing time, which is required for restricted pivoting, on a modern CPU. We then examine the potential of using a GPU to accelerate the factorization process with both column and restricted pivoting. Our performance results on two eight-core Intel Sandy Bridge CPUs with one NVIDIA Kepler GPU demonstrate that using the GPU, the factorization time can be reduced by a factor of more than two. In addition, to study the performance of our implementations in practice, we integrate them into a recently developed software StruMF which algebraically exploits such low-rank structures for solving a general sparse linear system of equations. Our performance results for solving Poisson's equations demonstrate that the proposed techniques can significantly reduce the preconditioner construction time of StruMF on the CPUs, and the construction time can be further reduced by 10%–50% using the GPU.

Pyrolysis characteristics and kinetics of low rank coals by distributed activation energy model

International Nuclear Information System (INIS)

Song, Huijuan; Liu, Guangrui; Wu, Jinhu

2016-01-01

Highlights: • Types of carbon in coal structure were investigated by curve-fitted "1"3C NMR spectra. • The work related pyrolysis characteristics and kinetics with coal structure. • Pyrolysis kinetics of low rank coals were studied by DAEM with Miura integral method. • DAEM could supply accurate extrapolations under relatively higher heating rates. - Abstract: The work was conducted to investigate pyrolysis characteristics and kinetics of low rank coals relating with coal structure by thermogravimetric analysis (TGA), the distributed activation energy model (DAEM) and solid-state "1"3C Nuclear Magnetic Resonance (NMR). Four low rank coals selected from different mines in China were studied in the paper. TGA was carried out with a non-isothermal temperature program in N_2 at the heating rate of 5, 10, 20 and 30 °C/min to estimate pyrolysis processes of coal samples. The results showed that corresponding characteristic temperatures and the maximum mass loss rates increased as heating rate increased. Pyrolysis kinetics parameters were investigated by the DAEM using Miura integral method. The DAEM was accurate verified by the good fit between the experimental and calculated curves of conversion degree x at the selected heating rates and relatively higher heating rates. The average activation energy was 331 kJ/mol (coal NM), 298 kJ/mol (coal NX), 302 kJ/mol (coal HLJ) and 196 kJ/mol (coal SD), respectively. The curve-fitting analysis of "1"3C NMR spectra was performed to characterize chemical structures of low rank coals. The results showed that various types of carbon functional groups with different relative contents existed in coal structure. The work indicated that pyrolysis characteristics and kinetics of low rank coals were closely associated with their chemical structures.

Rank-Optimized Logistic Matrix Regression toward Improved Matrix Data Classification.

Science.gov (United States)

Zhang, Jianguang; Jiang, Jianmin

2018-02-01

While existing logistic regression suffers from overfitting and often fails in considering structural information, we propose a novel matrix-based logistic regression to overcome the weakness. In the proposed method, 2D matrices are directly used to learn two groups of parameter vectors along each dimension without vectorization, which allows the proposed method to fully exploit the underlying structural information embedded inside the 2D matrices. Further, we add a joint [Formula: see text]-norm on two parameter matrices, which are organized by aligning each group of parameter vectors in columns. This added co-regularization term has two roles-enhancing the effect of regularization and optimizing the rank during the learning process. With our proposed fast iterative solution, we carried out extensive experiments. The results show that in comparison to both the traditional tensor-based methods and the vector-based regression methods, our proposed solution achieves better performance for matrix data classifications.

Detecting genuine multipartite correlations in terms of the rank of coefficient matrix

International Nuclear Information System (INIS)

Li Bo; Kwek, Leong Chuan; Fan Heng

2012-01-01

We propose a method to detect genuine quantum correlation for arbitrary quantum states in terms of the rank of coefficient matrices associated with the pure state. We then derive a necessary and sufficient condition for a quantum state to possess genuine correlation, namely that all corresponding coefficient matrices have rank larger than 1. We demonstrate an approach to decompose the genuine quantum correlated state with high rank coefficient matrix into the form of product states with no genuine quantum correlation for a pure state. (paper)

On predicting student performance using low-rank matrix factorization techniques

DEFF Research Database (Denmark)

Lorenzen, Stephan Sloth; Pham, Dang Ninh; Alstrup, Stephen

2017-01-01

Predicting the score of a student is one of the important problems in educational data mining. The scores given by an individual student reflect how a student understands and applies the knowledge conveyed in class. A reliable performance prediction enables teachers to identify weak students...... that require remedial support, generate adaptive hints, and improve the learning of students. This work focuses on predicting the score of students in the quiz system of the Clio Online learning platform, the largest Danish supplier of online learning materials, covering 90% of Danish elementary schools...... and the current version of the data set is very sparse, the very low-rank approximation can capture enough information. This means that the simple baseline approach achieves similar performance compared to other advanced methods. In future work, we will restrict the quiz data set, e.g. only including quizzes...

Complexity of the positive semidefinite matrix completion problem with a rank constraint.

NARCIS (Netherlands)

M. Eisenberg-Nagy (Marianna); M. Laurent (Monique); A. Varvitsiotis (Antonios); K. Bezdek; A. Deza; Y. Ye

2013-01-01

htmlabstractWe consider the decision problem asking whether a partial rational symmetric matrix with an all-ones diagonal can be completed to a full positive semidefinite matrix of rank at most k. We show that this problem is NP-hard for any fixed integer k ≥ 2. Equivalently, for k ≥ 2, it is

Complexity of the positive semidefinite matrix completion problem with a rank constraint.

NARCIS (Netherlands)

M. Eisenberg-Nagy (Marianna); M. Laurent (Monique); A. Varvitsiotis (Antonios)

2012-01-01

htmlabstractWe consider the decision problem asking whether a partial rational symmetric matrix with an all-ones diagonal can be completed to a full positive semidefinite matrix of rank at most k. We show that this problem is NP-hard for any fixed integer k ≥ 2. Equivalently, for k ≥ 2, it is

Complexity of the positive semidefinite matrix completion problem with a rank constraint

NARCIS (Netherlands)

Nagy, M.; Laurent, M.; Varvitsiotis, A.; Bezdek, K.; Deza, A.; Ye, Y.

2013-01-01

We consider the decision problem asking whether a partial rational symmetric matrix with an all-ones diagonal can be completed to a full positive semidefinite matrix of rank at most k. We show that this problem is NP-hard for any fixed integer k ≥ 2. In other words, for k ≥ 2, it is NP-hard to test

Exponential Family Functional data analysis via a low-rank model.

Science.gov (United States)

Li, Gen; Huang, Jianhua Z; Shen, Haipeng

2018-05-08

In many applications, non-Gaussian data such as binary or count are observed over a continuous domain and there exists a smooth underlying structure for describing such data. We develop a new functional data method to deal with this kind of data when the data are regularly spaced on the continuous domain. Our method, referred to as Exponential Family Functional Principal Component Analysis (EFPCA), assumes the data are generated from an exponential family distribution, and the matrix of the canonical parameters has a low-rank structure. The proposed method flexibly accommodates not only the standard one-way functional data, but also two-way (or bivariate) functional data. In addition, we introduce a new cross validation method for estimating the latent rank of a generalized data matrix. We demonstrate the efficacy of the proposed methods using a comprehensive simulation study. The proposed method is also applied to a real application of the UK mortality study, where data are binomially distributed and two-way functional across age groups and calendar years. The results offer novel insights into the underlying mortality pattern. © 2018, The International Biometric Society.

Clean utilization of low-rank coals for low-cost power generation

International Nuclear Information System (INIS)

Sondreal, E.A.

1992-01-01

Despite the unique utilization problems of low-rank coals, the ten US steam electric plants having the lowest operating cost in 1990 were all fueled on either lignite or subbituminous coal. Ash deposition problems, which have been a major barrier to sustaining high load on US boilers burning high-sodium low-rank coals, have been substantially reduced by improvements in coal selection, boiler design, on-line cleaning, operating conditions, and additives. Advantages of low-rank coals in advanced systems are their noncaking behavior when heated, their high reactivity allowing more complete reaction at lower temperatures, and the low sulfur content of selected deposits. The principal barrier issues are the high-temperature behavior of ash and volatile alkali derived from the coal-bound sodium found in some low-rank coals. Successful upgrading of low-rank coals requires that the product be both stable and suitable for end use in conventional and advanced systems. Coal-water fuel produced by hydrothermal processing of high-moisture low-rank coal meets these criteria, whereas most dry products from drying or carbonizing in hot gas tend to create dust and spontaneous ignition problems unless coated, agglomerated, briquetted, or afforded special handling

Sign rank versus Vapnik-Chervonenkis dimension

Science.gov (United States)

Alon, N.; Moran, Sh; Yehudayoff, A.

2017-12-01

This work studies the maximum possible sign rank of sign (N × N)-matrices with a given Vapnik-Chervonenkis dimension d. For d=1, this maximum is three. For d=2, this maximum is \\widetilde{\\Theta}(N1/2). For d >2, similar but slightly less accurate statements hold. The lower bounds improve on previous ones by Ben-David et al., and the upper bounds are novel. The lower bounds are obtained by probabilistic constructions, using a theorem of Warren in real algebraic topology. The upper bounds are obtained using a result of Welzl about spanning trees with low stabbing number, and using the moment curve. The upper bound technique is also used to: (i) provide estimates on the number of classes of a given Vapnik-Chervonenkis dimension, and the number of maximum classes of a given Vapnik-Chervonenkis dimension--answering a question of Frankl from 1989, and (ii) design an efficient algorithm that provides an O(N/log(N)) multiplicative approximation for the sign rank. We also observe a general connection between sign rank and spectral gaps which is based on Forster's argument. Consider the adjacency (N × N)-matrix of a Δ-regular graph with a second eigenvalue of absolute value λ and Δ ≤ N/2. We show that the sign rank of the signed version of this matrix is at least Δ/λ. We use this connection to prove the existence of a maximum class C\\subseteq\\{+/- 1\\}^N with Vapnik-Chervonenkis dimension 2 and sign rank \\widetilde{\\Theta}(N1/2). This answers a question of Ben-David et al. regarding the sign rank of large Vapnik-Chervonenkis classes. We also describe limitations of this approach, in the spirit of the Alon-Boppana theorem. We further describe connections to communication complexity, geometry, learning theory, and combinatorics. Bibliography: 69 titles.

Beyond Low Rank: A Data-Adaptive Tensor Completion Method

OpenAIRE

Zhang, Lei; Wei, Wei; Shi, Qinfeng; Shen, Chunhua; Hengel, Anton van den; Zhang, Yanning

2017-01-01

Low rank tensor representation underpins much of recent progress in tensor completion. In real applications, however, this approach is confronted with two challenging problems, namely (1) tensor rank determination; (2) handling real tensor data which only approximately fulfils the low-rank requirement. To address these two issues, we develop a data-adaptive tensor completion model which explicitly represents both the low-rank and non-low-rank structures in a latent tensor. Representing the no...

Low-ranking female Japanese macaques make efforts for social grooming.

Science.gov (United States)

Kurihara, Yosuke

2016-04-01

Grooming is essential to build social relationships in primates. Its importance is universal among animals from different ranks; however, rank-related differences in feeding patterns can lead to conflicts between feeding and grooming in low-ranking animals. Unifying the effects of dominance rank on feeding and grooming behaviors contributes to revealing the importance of grooming. Here, I tested whether the grooming behavior of low-ranking females were similar to that of high-ranking females despite differences in their feeding patterns. I followed 9 Japanese macaques Macaca fuscata fuscata adult females from the Arashiyama group, and analyzed the feeding patterns and grooming behaviors of low- and high-ranking females. Low-ranking females fed on natural foods away from the provisioning site, whereas high-ranking females obtained more provisioned food at the site. Due to these differences in feeding patterns, low-ranking females spent less time grooming than high-ranking females. However, both low- and high-ranking females performed grooming around the provisioning site, which was linked to the number of neighboring individuals for low-ranking females and feeding on provisioned foods at the site for high-ranking females. The similarity in grooming area led to a range and diversity of grooming partners that did not differ with rank. Thus, low-ranking females can obtain small amounts of provisioned foods and perform grooming with as many partners around the provisioning site as high-ranking females. These results highlight the efforts made by low-ranking females to perform grooming and suggest the importance of grooming behavior in group-living primates.

Low-ranking female Japanese macaques make efforts for social grooming

Science.gov (United States)

Kurihara, Yosuke

2016-01-01

Abstract Grooming is essential to build social relationships in primates. Its importance is universal among animals from different ranks; however, rank-related differences in feeding patterns can lead to conflicts between feeding and grooming in low-ranking animals. Unifying the effects of dominance rank on feeding and grooming behaviors contributes to revealing the importance of grooming. Here, I tested whether the grooming behavior of low-ranking females were similar to that of high-ranking females despite differences in their feeding patterns. I followed 9 Japanese macaques Macaca fuscata fuscata adult females from the Arashiyama group, and analyzed the feeding patterns and grooming behaviors of low- and high-ranking females. Low-ranking females fed on natural foods away from the provisioning site, whereas high-ranking females obtained more provisioned food at the site. Due to these differences in feeding patterns, low-ranking females spent less time grooming than high-ranking females. However, both low- and high-ranking females performed grooming around the provisioning site, which was linked to the number of neighboring individuals for low-ranking females and feeding on provisioned foods at the site for high-ranking females. The similarity in grooming area led to a range and diversity of grooming partners that did not differ with rank. Thus, low-ranking females can obtain small amounts of provisioned foods and perform grooming with as many partners around the provisioning site as high-ranking females. These results highlight the efforts made by low-ranking females to perform grooming and suggest the importance of grooming behavior in group-living primates. PMID:29491896

Solving block linear systems with low-rank off-diagonal blocks is easily parallelizable

Energy Technology Data Exchange (ETDEWEB)

Menkov, V. [Indiana Univ., Bloomington, IN (United States)

1996-12-31

An easily and efficiently parallelizable direct method is given for solving a block linear system Bx = y, where B = D + Q is the sum of a non-singular block diagonal matrix D and a matrix Q with low-rank blocks. This implicitly defines a new preconditioning method with an operation count close to the cost of calculating a matrix-vector product Qw for some w, plus at most twice the cost of calculating Qw for some w. When implemented on a parallel machine the processor utilization can be as good as that of those operations. Order estimates are given for the general case, and an implementation is compared to block SSOR preconditioning.

Probabilistic low-rank factorization accelerates tensor network simulations of critical quantum many-body ground states

Science.gov (United States)

Kohn, Lucas; Tschirsich, Ferdinand; Keck, Maximilian; Plenio, Martin B.; Tamascelli, Dario; Montangero, Simone

2018-01-01

We provide evidence that randomized low-rank factorization is a powerful tool for the determination of the ground-state properties of low-dimensional lattice Hamiltonians through tensor network techniques. In particular, we show that randomized matrix factorization outperforms truncated singular value decomposition based on state-of-the-art deterministic routines in time-evolving block decimation (TEBD)- and density matrix renormalization group (DMRG)-style simulations, even when the system under study gets close to a phase transition: We report linear speedups in the bond or local dimension of up to 24 times in quasi-two-dimensional cylindrical systems.

Improving temporal resolution in fMRI using a 3D spiral acquisition and low rank plus sparse (L+S) reconstruction.

Science.gov (United States)

Petrov, Andrii Y; Herbst, Michael; Andrew Stenger, V

2017-08-15

Rapid whole-brain dynamic Magnetic Resonance Imaging (MRI) is of particular interest in Blood Oxygen Level Dependent (BOLD) functional MRI (fMRI). Faster acquisitions with higher temporal sampling of the BOLD time-course provide several advantages including increased sensitivity in detecting functional activation, the possibility of filtering out physiological noise for improving temporal SNR, and freezing out head motion. Generally, faster acquisitions require undersampling of the data which results in aliasing artifacts in the object domain. A recently developed low-rank (L) plus sparse (S) matrix decomposition model (L+S) is one of the methods that has been introduced to reconstruct images from undersampled dynamic MRI data. The L+S approach assumes that the dynamic MRI data, represented as a space-time matrix M, is a linear superposition of L and S components, where L represents highly spatially and temporally correlated elements, such as the image background, while S captures dynamic information that is sparse in an appropriate transform domain. This suggests that L+S might be suited for undersampled task or slow event-related fMRI acquisitions because the periodic nature of the BOLD signal is sparse in the temporal Fourier transform domain and slowly varying low-rank brain background signals, such as physiological noise and drift, will be predominantly low-rank. In this work, as a proof of concept, we exploit the L+S method for accelerating block-design fMRI using a 3D stack of spirals (SoS) acquisition where undersampling is performed in the k z -t domain. We examined the feasibility of the L+S method to accurately separate temporally correlated brain background information in the L component while capturing periodic BOLD signals in the S component. We present results acquired in control human volunteers at 3T for both retrospective and prospectively acquired fMRI data for a visual activation block-design task. We show that a SoS fMRI acquisition with an

Fast Multipole Method as a Matrix-Free Hierarchical Low-Rank Approximation

KAUST Repository

Yokota, Rio; Ibeid, Huda; Keyes, David E.

2018-01-01

There has been a large increase in the amount of work on hierarchical low-rank approximation methods, where the interest is shared by multiple communities that previously did not intersect. This objective of this article is two-fold; to provide a thorough review of the recent advancements in this field from both analytical and algebraic perspectives, and to present a comparative benchmark of two highly optimized implementations of contrasting methods for some simple yet representative test cases. The first half of this paper has the form of a survey paper, to achieve the former objective. We categorize the recent advances in this field from the perspective of compute-memory tradeoff, which has not been considered in much detail in this area. Benchmark tests reveal that there is a large difference in the memory consumption and performance between the different methods.

Fast Multipole Method as a Matrix-Free Hierarchical Low-Rank Approximation

KAUST Repository

Yokota, Rio

2018-01-03

There has been a large increase in the amount of work on hierarchical low-rank approximation methods, where the interest is shared by multiple communities that previously did not intersect. This objective of this article is two-fold; to provide a thorough review of the recent advancements in this field from both analytical and algebraic perspectives, and to present a comparative benchmark of two highly optimized implementations of contrasting methods for some simple yet representative test cases. The first half of this paper has the form of a survey paper, to achieve the former objective. We categorize the recent advances in this field from the perspective of compute-memory tradeoff, which has not been considered in much detail in this area. Benchmark tests reveal that there is a large difference in the memory consumption and performance between the different methods.

LogDet Rank Minimization with Application to Subspace Clustering

Directory of Open Access Journals (Sweden)

Zhao Kang

2015-01-01

Full Text Available Low-rank matrix is desired in many machine learning and computer vision problems. Most of the recent studies use the nuclear norm as a convex surrogate of the rank operator. However, all singular values are simply added together by the nuclear norm, and thus the rank may not be well approximated in practical problems. In this paper, we propose using a log-determinant (LogDet function as a smooth and closer, though nonconvex, approximation to rank for obtaining a low-rank representation in subspace clustering. Augmented Lagrange multipliers strategy is applied to iteratively optimize the LogDet-based nonconvex objective function on potentially large-scale data. By making use of the angular information of principal directions of the resultant low-rank representation, an affinity graph matrix is constructed for spectral clustering. Experimental results on motion segmentation and face clustering data demonstrate that the proposed method often outperforms state-of-the-art subspace clustering algorithms.

Low-rank coal research. Quarterly report, January--March 1990

Energy Technology Data Exchange (ETDEWEB)

1990-08-01

This document contains several quarterly progress reports for low-rank coal research that was performed from January-March 1990. Reports in Control Technology and Coal Preparation Research are in Flue Gas Cleanup, Waste Management, and Regional Energy Policy Program for the Northern Great Plains. Reports in Advanced Research and Technology Development are presented in Turbine Combustion Phenomena, Combustion Inorganic Transformation (two sections), Liquefaction Reactivity of Low-Rank Coals, Gasification Ash and Slag Characterization, and Coal Science. Reports in Combustion Research cover Fluidized-Bed Combustion, Beneficiation of Low-Rank Coals, Combustion Characterization of Low-Rank Coal Fuels, Diesel Utilization of Low-Rank Coals, and Produce and Characterize HWD (hot-water drying) Fuels for Heat Engine Applications. Liquefaction Research is reported in Low-Rank Coal Direct Liquefaction. Gasification Research progress is discussed for Production of Hydrogen and By-Products from Coal and for Chemistry of Sulfur Removal in Mild Gas.

The augmented lagrange multipliers method for matrix completion from corrupted samplings with application to mixed Gaussian-impulse noise removal.

Directory of Open Access Journals (Sweden)

Fan Meng

Full Text Available This paper studies the problem of the restoration of images corrupted by mixed Gaussian-impulse noise. In recent years, low-rank matrix reconstruction has become a research hotspot in many scientific and engineering domains such as machine learning, image processing, computer vision and bioinformatics, which mainly involves the problem of matrix completion and robust principal component analysis, namely recovering a low-rank matrix from an incomplete but accurate sampling subset of its entries and from an observed data matrix with an unknown fraction of its entries being arbitrarily corrupted, respectively. Inspired by these ideas, we consider the problem of recovering a low-rank matrix from an incomplete sampling subset of its entries with an unknown fraction of the samplings contaminated by arbitrary errors, which is defined as the problem of matrix completion from corrupted samplings and modeled as a convex optimization problem that minimizes a combination of the nuclear norm and the l(1-norm in this paper. Meanwhile, we put forward a novel and effective algorithm called augmented Lagrange multipliers to exactly solve the problem. For mixed Gaussian-impulse noise removal, we regard it as the problem of matrix completion from corrupted samplings, and restore the noisy image following an impulse-detecting procedure. Compared with some existing methods for mixed noise removal, the recovery quality performance of our method is dominant if images possess low-rank features such as geometrically regular textures and similar structured contents; especially when the density of impulse noise is relatively high and the variance of Gaussian noise is small, our method can outperform the traditional methods significantly not only in the simultaneous removal of Gaussian noise and impulse noise, and the restoration ability for a low-rank image matrix, but also in the preservation of textures and details in the image.

Low-Rank Kalman Filtering in Subsurface Contaminant Transport Models

KAUST Repository

El Gharamti, Mohamad

2010-01-01

Understanding the geology and the hydrology of the subsurface is important to model the fluid flow and the behavior of the contaminant. It is essential to have an accurate knowledge of the movement of the contaminants in the porous media in order to track them and later extract them from the aquifer. A two-dimensional flow model is studied and then applied on a linear contaminant transport model in the same porous medium. Because of possible different sources of uncertainties, the deterministic model by itself cannot give exact estimations for the future contaminant state. Incorporating observations in the model can guide it to the true state. This is usually done using the Kalman filter (KF) when the system is linear and the extended Kalman filter (EKF) when the system is nonlinear. To overcome the high computational cost required by the KF, we use the singular evolutive Kalman filter (SEKF) and the singular evolutive extended Kalman filter (SEEKF) approximations of the KF operating with low-rank covariance matrices. The SEKF can be implemented on large dimensional contaminant problems while the usage of the KF is not possible. Experimental results show that with perfect and imperfect models, the low rank filters can provide as much accurate estimates as the full KF but at much less computational cost. Localization can help the filter analysis as long as there are enough neighborhood data to the point being analyzed. Estimating the permeabilities of the aquifer is successfully tackled using both the EKF and the SEEKF.

Low-Rank Kalman Filtering in Subsurface Contaminant Transport Models

KAUST Repository

El Gharamti, Mohamad

2010-12-01

Understanding the geology and the hydrology of the subsurface is important to model the fluid flow and the behavior of the contaminant. It is essential to have an accurate knowledge of the movement of the contaminants in the porous media in order to track them and later extract them from the aquifer. A two-dimensional flow model is studied and then applied on a linear contaminant transport model in the same porous medium. Because of possible different sources of uncertainties, the deterministic model by itself cannot give exact estimations for the future contaminant state. Incorporating observations in the model can guide it to the true state. This is usually done using the Kalman filter (KF) when the system is linear and the extended Kalman filter (EKF) when the system is nonlinear. To overcome the high computational cost required by the KF, we use the singular evolutive Kalman filter (SEKF) and the singular evolutive extended Kalman filter (SEEKF) approximations of the KF operating with low-rank covariance matrices. The SEKF can be implemented on large dimensional contaminant problems while the usage of the KF is not possible. Experimental results show that with perfect and imperfect models, the low rank filters can provide as much accurate estimates as the full KF but at much less computational cost. Localization can help the filter analysis as long as there are enough neighborhood data to the point being analyzed. Estimating the permeabilities of the aquifer is successfully tackled using both the EKF and the SEEKF.

The Optimization on Ranks and Inertias of a Quadratic Hermitian Matrix Function and Its Applications

Directory of Open Access Journals (Sweden)

Yirong Yao

2013-01-01

Full Text Available We solve optimization problems on the ranks and inertias of the quadratic Hermitian matrix function subject to a consistent system of matrix equations and . As applications, we derive necessary and sufficient conditions for the solvability to the systems of matrix equations and matrix inequalities , and in the Löwner partial ordering to be feasible, respectively. The findings of this paper widely extend the known results in the literature.

SAR Target Recognition via Local Sparse Representation of Multi-Manifold Regularized Low-Rank Approximation

Directory of Open Access Journals (Sweden)

Meiting Yu

2018-02-01

Full Text Available The extraction of a valuable set of features and the design of a discriminative classifier are crucial for target recognition in SAR image. Although various features and classifiers have been proposed over the years, target recognition under extended operating conditions (EOCs is still a challenging problem, e.g., target with configuration variation, different capture orientations, and articulation. To address these problems, this paper presents a new strategy for target recognition. We first propose a low-dimensional representation model via incorporating multi-manifold regularization term into the low-rank matrix factorization framework. Two rules, pairwise similarity and local linearity, are employed for constructing multiple manifold regularization. By alternately optimizing the matrix factorization and manifold selection, the feature representation model can not only acquire the optimal low-rank approximation of original samples, but also capture the intrinsic manifold structure information. Then, to take full advantage of the local structure property of features and further improve the discriminative ability, local sparse representation is proposed for classification. Finally, extensive experiments on moving and stationary target acquisition and recognition (MSTAR database demonstrate the effectiveness of the proposed strategy, including target recognition under EOCs, as well as the capability of small training size.

A Sufficient Condition for an Interval Matrix to have Full Column Rank

Czech Academy of Sciences Publication Activity Database

Rohn, Jiří

2017-01-01

Roč. 22, č. 2 (2017), s. 59-66 ISSN 1560-7534 Institutional support: RVO:67985807 Keywords : interval matrix * full column rank * sufficient condition * double condition Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics http://www.ict.nsc.ru/jct/annotation/1779?l=eng

A novel deep learning algorithm for incomplete face recognition: Low-rank-recovery network.

Science.gov (United States)

Zhao, Jianwei; Lv, Yongbiao; Zhou, Zhenghua; Cao, Feilong

2017-10-01

There have been a lot of methods to address the recognition of complete face images. However, in real applications, the images to be recognized are usually incomplete, and it is more difficult to realize such a recognition. In this paper, a novel convolution neural network frame, named a low-rank-recovery network (LRRNet), is proposed to conquer the difficulty effectively inspired by matrix completion and deep learning techniques. The proposed LRRNet first recovers the incomplete face images via an approach of matrix completion with the truncated nuclear norm regularization solution, and then extracts some low-rank parts of the recovered images as the filters. With these filters, some important features are obtained by means of the binaryzation and histogram algorithms. Finally, these features are classified with the classical support vector machines (SVMs). The proposed LRRNet method has high face recognition rate for the heavily corrupted images, especially for the images in the large databases. The proposed LRRNet performs well and efficiently for the images with heavily corrupted, especially in the case of large databases. Extensive experiments on several benchmark databases demonstrate that the proposed LRRNet performs better than some other excellent robust face recognition methods. Copyright © 2017 Elsevier Ltd. All rights reserved.

Proceedings of the sixteenth biennial low-rank fuels symposium

International Nuclear Information System (INIS)

1991-01-01

Low-rank coals represent a major energy resource for the world. The Low-Rank Fuels Symposium, building on the traditions established by the Lignite Symposium, focuses on the key opportunities for this resource. This conference offers a forum for leaders from industry, government, and academia to gather to share current information on the opportunities represented by low-rank coals. In the United States and throughout the world, the utility industry is the primary user of low-rank coals. As such, current experiences and future opportunities for new technologies in this industry were the primary focuses of the symposium

Proceedings of the sixteenth biennial low-rank fuels symposium

Energy Technology Data Exchange (ETDEWEB)

1991-01-01

Low-rank coals represent a major energy resource for the world. The Low-Rank Fuels Symposium, building on the traditions established by the Lignite Symposium, focuses on the key opportunities for this resource. This conference offers a forum for leaders from industry, government, and academia to gather to share current information on the opportunities represented by low-rank coals. In the United States and throughout the world, the utility industry is the primary user of low-rank coals. As such, current experiences and future opportunities for new technologies in this industry were the primary focuses of the symposium.

Improved magnetic resonance fingerprinting reconstruction with low-rank and subspace modeling.

Science.gov (United States)

Zhao, Bo; Setsompop, Kawin; Adalsteinsson, Elfar; Gagoski, Borjan; Ye, Huihui; Ma, Dan; Jiang, Yun; Ellen Grant, P; Griswold, Mark A; Wald, Lawrence L

2018-02-01

This article introduces a constrained imaging method based on low-rank and subspace modeling to improve the accuracy and speed of MR fingerprinting (MRF). A new model-based imaging method is developed for MRF to reconstruct high-quality time-series images and accurate tissue parameter maps (e.g., T 1 , T 2 , and spin density maps). Specifically, the proposed method exploits low-rank approximations of MRF time-series images, and further enforces temporal subspace constraints to capture magnetization dynamics. This allows the time-series image reconstruction problem to be formulated as a simple linear least-squares problem, which enables efficient computation. After image reconstruction, tissue parameter maps are estimated via dictionary-based pattern matching, as in the conventional approach. The effectiveness of the proposed method was evaluated with in vivo experiments. Compared with the conventional MRF reconstruction, the proposed method reconstructs time-series images with significantly reduced aliasing artifacts and noise contamination. Although the conventional approach exhibits some robustness to these corruptions, the improved time-series image reconstruction in turn provides more accurate tissue parameter maps. The improvement is pronounced especially when the acquisition time becomes short. The proposed method significantly improves the accuracy of MRF, and also reduces data acquisition time. Magn Reson Med 79:933-942, 2018. © 2017 International Society for Magnetic Resonance in Medicine. © 2017 International Society for Magnetic Resonance in Medicine.

Technical Note: Interleaved Bipolar Acquisition and Low-rank Reconstruction for Water-Fat Separation in MRI.

Science.gov (United States)

Cho, JaeJin; Park, HyunWook

2018-05-17

To acquire interleaved bipolar data and reconstruct the full data using low-rank property for water fat separation. Bipolar acquisition suffers from issues related to gradient switching, the opposite gradient polarities, and other system imperfections, which prevent accurate water-fat separation. In this study, an interleaved bipolar acquisition scheme and a low-rank reconstruction method were proposed to reduce issues from the bipolar gradients while achieving a short imaging time. The proposed interleaved bipolar acquisition scheme collects echo-time signals from both gradient polarities; however, the sequence increases the imaging time. To reduce the imaging time, the signals were subsampled at every dimension of k-space. The low-rank property of the bipolar acquisition was defined and exploited to estimate the full data from the acquired subsampled data. To eliminate the bipolar issues, in the proposed method, the water-fat separation was performed separately for each gradient polarity, and the results for the positive and negative gradient polarities were combined after the water-fat separation. A phantom study and in-vivo experiments were conducted on a 3T Siemens Verio system. The results for the proposed method were compared with the results of the fully sampled interleaved bipolar acquisition and Soliman's method, which was the previous water-fat separation approach for reducing the issues of bipolar gradients and accelerating the interleaved bipolar acquisition. The proposed method provided accurate water and fat images without the issues of bipolar gradients and demonstrated a better performance compared with the results of the previous methods. The water-fat separation using the bipolar acquisition has several benefits including a short echo-spacing time. However, it suffers from bipolar-gradient issues such as strong gradient switching, system imperfection, and eddy current effects. This study demonstrated that accurate water-fat separated images can

Technique for information retrieval using enhanced latent semantic analysis generating rank approximation matrix by factorizing the weighted morpheme-by-document matrix

Science.gov (United States)

Chew, Peter A; Bader, Brett W

2012-10-16

A technique for information retrieval includes parsing a corpus to identify a number of wordform instances within each document of the corpus. A weighted morpheme-by-document matrix is generated based at least in part on the number of wordform instances within each document of the corpus and based at least in part on a weighting function. The weighted morpheme-by-document matrix separately enumerates instances of stems and affixes. Additionally or alternatively, a term-by-term alignment matrix may be generated based at least in part on the number of wordform instances within each document of the corpus. At least one lower rank approximation matrix is generated by factorizing the weighted morpheme-by-document matrix and/or the term-by-term alignment matrix.

Color correction with blind image restoration based on multiple images using a low-rank model

Science.gov (United States)

Li, Dong; Xie, Xudong; Lam, Kin-Man

2014-03-01

We present a method that can handle the color correction of multiple photographs with blind image restoration simultaneously and automatically. We prove that the local colors of a set of images of the same scene exhibit the low-rank property locally both before and after a color-correction operation. This property allows us to correct all kinds of errors in an image under a low-rank matrix model without particular priors or assumptions. The possible errors may be caused by changes of viewpoint, large illumination variations, gross pixel corruptions, partial occlusions, etc. Furthermore, a new iterative soft-segmentation method is proposed for local color transfer using color influence maps. Due to the fact that the correct color information and the spatial information of images can be recovered using the low-rank model, more precise color correction and many other image-restoration tasks-including image denoising, image deblurring, and gray-scale image colorizing-can be performed simultaneously. Experiments have verified that our method can achieve consistent and promising results on uncontrolled real photographs acquired from the Internet and that it outperforms current state-of-the-art methods.

Rank reduction of correlation matrices by majorization

NARCIS (Netherlands)

R. Pietersz (Raoul); P.J.F. Groenen (Patrick)

2004-01-01

textabstractIn this paper a novel method is developed for the problem of finding a low-rank correlation matrix nearest to a given correlation matrix. The method is based on majorization and therefore it is globally convergent. The method is computationally efficient, is straightforward to implement,

Sparse and smooth canonical correlation analysis through rank-1 matrix approximation

Science.gov (United States)

Aïssa-El-Bey, Abdeldjalil; Seghouane, Abd-Krim

2017-12-01

Canonical correlation analysis (CCA) is a well-known technique used to characterize the relationship between two sets of multidimensional variables by finding linear combinations of variables with maximal correlation. Sparse CCA and smooth or regularized CCA are two widely used variants of CCA because of the improved interpretability of the former and the better performance of the later. So far, the cross-matrix product of the two sets of multidimensional variables has been widely used for the derivation of these variants. In this paper, two new algorithms for sparse CCA and smooth CCA are proposed. These algorithms differ from the existing ones in their derivation which is based on penalized rank-1 matrix approximation and the orthogonal projectors onto the space spanned by the two sets of multidimensional variables instead of the simple cross-matrix product. The performance and effectiveness of the proposed algorithms are tested on simulated experiments. On these results, it can be observed that they outperform the state of the art sparse CCA algorithms.

Low-rank coal study. Volume 4. Regulatory, environmental, and market analyses

Energy Technology Data Exchange (ETDEWEB)

1980-11-01

The regulatory, environmental, and market constraints to development of US low-rank coal resources are analyzed. Government-imposed environmental and regulatory requirements are among the most important factors that determine the markets for low-rank coal and the technology used in the extraction, delivery, and utilization systems. Both state and federal controls are examined, in light of available data on impacts and effluents associated with major low-rank coal development efforts. The market analysis examines both the penetration of existing markets by low-rank coal and the evolution of potential markets in the future. The electric utility industry consumes about 99 percent of the total low-rank coal production. This use in utility boilers rose dramatically in the 1970's and is expected to continue to grow rapidly. In the late 1980's and 1990's, industrial direct use of low-rank coal and the production of synthetic fuels are expected to start growing as major new markets.

Reduced Rank Regression

DEFF Research Database (Denmark)

Johansen, Søren

2008-01-01

The reduced rank regression model is a multivariate regression model with a coefficient matrix with reduced rank. The reduced rank regression algorithm is an estimation procedure, which estimates the reduced rank regression model. It is related to canonical correlations and involves calculating...

MRI reconstruction of multi-image acquisitions using a rank regularizer with data reordering

Energy Technology Data Exchange (ETDEWEB)

Adluru, Ganesh, E-mail: gadluru@gmail.com; Anderson, Jeffrey [UCAIR, Department of Radiology, University of Utah, Salt Lake City, Utah 84108 (United States); Gur, Yaniv [IBM Almaden Research Center, San Jose, California 95120 (United States); Chen, Liyong; Feinberg, David [Advanced MRI Technologies, Sebastpool, California, 95472 (United States); DiBella, Edward V. R. [UCAIR, Department of Radiology, University of Utah, Salt Lake City, Utah 84108 and Department of Bioengineering, University of Utah, Salt Lake City, Utah 84112 (United States)

2015-08-15

Purpose: To improve rank constrained reconstructions for undersampled multi-image MRI acquisitions. Methods: Motivated by the recent developments in low-rank matrix completion theory and its applicability to rapid dynamic MRI, a new reordering-based rank constrained reconstruction of undersampled multi-image data that uses prior image information is proposed. Instead of directly minimizing the nuclear norm of a matrix of estimated images, the nuclear norm of reordered matrix values is minimized. The reordering is based on the prior image estimates. The method is tested on brain diffusion imaging data and dynamic contrast enhanced myocardial perfusion data. Results: Good quality images from data undersampled by a factor of three for diffusion imaging and by a factor of 3.5 for dynamic cardiac perfusion imaging with respiratory motion were obtained. Reordering gave visually improved image quality over standard nuclear norm minimization reconstructions. Root mean squared errors with respect to ground truth images were improved by ∼18% and ∼16% with reordering for diffusion and perfusion applications, respectively. Conclusions: The reordered low-rank constraint is a way to inject prior image information that offers improvements over a standard low-rank constraint for undersampled multi-image MRI reconstructions.

MRI reconstruction of multi-image acquisitions using a rank regularizer with data reordering

International Nuclear Information System (INIS)

Adluru, Ganesh; Anderson, Jeffrey; Gur, Yaniv; Chen, Liyong; Feinberg, David; DiBella, Edward V. R.

2015-01-01

Purpose: To improve rank constrained reconstructions for undersampled multi-image MRI acquisitions. Methods: Motivated by the recent developments in low-rank matrix completion theory and its applicability to rapid dynamic MRI, a new reordering-based rank constrained reconstruction of undersampled multi-image data that uses prior image information is proposed. Instead of directly minimizing the nuclear norm of a matrix of estimated images, the nuclear norm of reordered matrix values is minimized. The reordering is based on the prior image estimates. The method is tested on brain diffusion imaging data and dynamic contrast enhanced myocardial perfusion data. Results: Good quality images from data undersampled by a factor of three for diffusion imaging and by a factor of 3.5 for dynamic cardiac perfusion imaging with respiratory motion were obtained. Reordering gave visually improved image quality over standard nuclear norm minimization reconstructions. Root mean squared errors with respect to ground truth images were improved by ∼18% and ∼16% with reordering for diffusion and perfusion applications, respectively. Conclusions: The reordered low-rank constraint is a way to inject prior image information that offers improvements over a standard low-rank constraint for undersampled multi-image MRI reconstructions

Manifold Based Low-rank Regularization for Image Restoration and Semi-supervised Learning

OpenAIRE

Lai, Rongjie; Li, Jia

2017-01-01

Low-rank structures play important role in recent advances of many problems in image science and data science. As a natural extension of low-rank structures for data with nonlinear structures, the concept of the low-dimensional manifold structure has been considered in many data processing problems. Inspired by this concept, we consider a manifold based low-rank regularization as a linear approximation of manifold dimension. This regularization is less restricted than the global low-rank regu...

On Rank and Nullity

Science.gov (United States)

Dobbs, David E.

2012-01-01

This note explains how Emil Artin's proof that row rank equals column rank for a matrix with entries in a field leads naturally to the formula for the nullity of a matrix and also to an algorithm for solving any system of linear equations in any number of variables. This material could be used in any course on matrix theory or linear algebra.

Efficient Rank Reduction of Correlation Matrices

NARCIS (Netherlands)

I. Grubisic (Igor); R. Pietersz (Raoul)

2005-01-01

textabstractGeometric optimisation algorithms are developed that efficiently find the nearest low-rank correlation matrix. We show, in numerical tests, that our methods compare favourably to the existing methods in the literature. The connection with the Lagrange multiplier method is established,

PageRank of integers

International Nuclear Information System (INIS)

Frahm, K M; Shepelyansky, D L; Chepelianskii, A D

2012-01-01

We up a directed network tracing links from a given integer to its divisors and analyze the properties of the Google matrix of this network. The PageRank vector of this matrix is computed numerically and it is shown that its probability is approximately inversely proportional to the PageRank index thus being similar to the Zipf law and the dependence established for the World Wide Web. The spectrum of the Google matrix of integers is characterized by a large gap and a relatively small number of nonzero eigenvalues. A simple semi-analytical expression for the PageRank of integers is derived that allows us to find this vector for matrices of billion size. This network provides a new PageRank order of integers. (paper)

A Ranking Analysis/An Interlinking Approach of New Triangular Fuzzy Cognitive Maps and Combined Effective Time Dependent Matrix

Science.gov (United States)

Adiga, Shreemathi; Saraswathi, A.; Praveen Prakash, A.

2018-04-01

This paper aims an interlinking approach of new Triangular Fuzzy Cognitive Maps (TrFCM) and Combined Effective Time Dependent (CETD) matrix to find the ranking of the problems of Transgenders. Section one begins with an introduction that briefly describes the scope of Triangular Fuzzy Cognitive Maps (TrFCM) and CETD Matrix. Section two provides the process of causes of problems faced by Transgenders using Fuzzy Triangular Fuzzy Cognitive Maps (TrFCM) method and performs the calculations using the collected data among the Transgender. In Section 3, the reasons for the main causes for the problems of the Transgenders. Section 4 describes the Charles Spearmans coefficients of rank correlation method by interlinking of Triangular Fuzzy Cognitive Maps (TrFCM) Method and CETD Matrix. Section 5 shows the results based on our study.

Modeling of pseudoacoustic P-waves in orthorhombic media with a low-rank approximation

KAUST Repository

Song, Xiaolei

2013-06-04

Wavefield extrapolation in pseudoacoustic orthorhombic anisotropic media suffers from wave-mode coupling and stability limitations in the parameter range. We use the dispersion relation for scalar wave propagation in pseudoacoustic orthorhombic media to model acoustic wavefields. The wavenumber-domain application of the Laplacian operator allows us to propagate the P-waves exclusively, without imposing any conditions on the parameter range of stability. It also allows us to avoid dispersion artifacts commonly associated with evaluating the Laplacian operator in space domain using practical finite-difference stencils. To handle the corresponding space-wavenumber mixed-domain operator, we apply the low-rank approximation approach. Considering the number of parameters necessary to describe orthorhombic anisotropy, the low-rank approach yields space-wavenumber decomposition of the extrapolator operator that is dependent on space location regardless of the parameters, a feature necessary for orthorhombic anisotropy. Numerical experiments that the proposed wavefield extrapolator is accurate and practically free of dispersion. Furthermore, there is no coupling of qSv and qP waves because we use the analytical dispersion solution corresponding to the P-wave.

Time evolution of Wikipedia network ranking

Science.gov (United States)

Eom, Young-Ho; Frahm, Klaus M.; Benczúr, András; Shepelyansky, Dima L.

2013-12-01

We study the time evolution of ranking and spectral properties of the Google matrix of English Wikipedia hyperlink network during years 2003-2011. The statistical properties of ranking of Wikipedia articles via PageRank and CheiRank probabilities, as well as the matrix spectrum, are shown to be stabilized for 2007-2011. A special emphasis is done on ranking of Wikipedia personalities and universities. We show that PageRank selection is dominated by politicians while 2DRank, which combines PageRank and CheiRank, gives more accent on personalities of arts. The Wikipedia PageRank of universities recovers 80% of top universities of Shanghai ranking during the considered time period.

Hyperspectral Super-Resolution of Locally Low Rank Images From Complementary Multisource Data.

Science.gov (United States)

Veganzones, Miguel A; Simoes, Miguel; Licciardi, Giorgio; Yokoya, Naoto; Bioucas-Dias, Jose M; Chanussot, Jocelyn

2016-01-01

Remote sensing hyperspectral images (HSIs) are quite often low rank, in the sense that the data belong to a low dimensional subspace/manifold. This has been recently exploited for the fusion of low spatial resolution HSI with high spatial resolution multispectral images in order to obtain super-resolution HSI. Most approaches adopt an unmixing or a matrix factorization perspective. The derived methods have led to state-of-the-art results when the spectral information lies in a low-dimensional subspace/manifold. However, if the subspace/manifold dimensionality spanned by the complete data set is large, i.e., larger than the number of multispectral bands, the performance of these methods mainly decreases because the underlying sparse regression problem is severely ill-posed. In this paper, we propose a local approach to cope with this difficulty. Fundamentally, we exploit the fact that real world HSIs are locally low rank, that is, pixels acquired from a given spatial neighborhood span a very low-dimensional subspace/manifold, i.e., lower or equal than the number of multispectral bands. Thus, we propose to partition the image into patches and solve the data fusion problem independently for each patch. This way, in each patch the subspace/manifold dimensionality is low enough, such that the problem is not ill-posed anymore. We propose two alternative approaches to define the hyperspectral super-resolution through local dictionary learning using endmember induction algorithms. We also explore two alternatives to define the local regions, using sliding windows and binary partition trees. The effectiveness of the proposed approaches is illustrated with synthetic and semi real data.

Low-rank and sparse modeling for visual analysis

CERN Document Server

Fu, Yun

2014-01-01

This book provides a view of low-rank and sparse computing, especially approximation, recovery, representation, scaling, coding, embedding and learning among unconstrained visual data. The book includes chapters covering multiple emerging topics in this new field. It links multiple popular research fields in Human-Centered Computing, Social Media, Image Classification, Pattern Recognition, Computer Vision, Big Data, and Human-Computer Interaction. Contains an overview of the low-rank and sparse modeling techniques for visual analysis by examining both theoretical analysis and real-world applic

A fast algorithm for determining bounds and accurate approximate p-values of the rank product statistic for replicate experiments.

Science.gov (United States)

Heskes, Tom; Eisinga, Rob; Breitling, Rainer

2014-11-21

The rank product method is a powerful statistical technique for identifying differentially expressed molecules in replicated experiments. A critical issue in molecule selection is accurate calculation of the p-value of the rank product statistic to adequately address multiple testing. Both exact calculation and permutation and gamma approximations have been proposed to determine molecule-level significance. These current approaches have serious drawbacks as they are either computationally burdensome or provide inaccurate estimates in the tail of the p-value distribution. We derive strict lower and upper bounds to the exact p-value along with an accurate approximation that can be used to assess the significance of the rank product statistic in a computationally fast manner. The bounds and the proposed approximation are shown to provide far better accuracy over existing approximate methods in determining tail probabilities, with the slightly conservative upper bound protecting against false positives. We illustrate the proposed method in the context of a recently published analysis on transcriptomic profiling performed in blood. We provide a method to determine upper bounds and accurate approximate p-values of the rank product statistic. The proposed algorithm provides an order of magnitude increase in throughput as compared with current approaches and offers the opportunity to explore new application domains with even larger multiple testing issue. The R code is published in one of the Additional files and is available at http://www.ru.nl/publish/pages/726696/rankprodbounds.zip .

Low temperature oxidation and spontaneous combustion characteristics of upgraded low rank coal

Energy Technology Data Exchange (ETDEWEB)

Choi, H.K.; Kim, S.D.; Yoo, J.H.; Chun, D.H.; Rhim, Y.J.; Lee, S.H. [Korea Institute of Energy Research, Daejeon (Korea, Republic of)

2013-07-01

The low temperature oxidation and spontaneous combustion characteristics of dried coal produced from low rank coal using the upgraded brown coal (UBC) process were investigated. To this end, proximate properties, crossing-point temperature (CPT), and isothermal oxidation characteristics of the coal were analyzed. The isothermal oxidation characteristics were estimated by considering the formation rates of CO and CO{sub 2} at low temperatures. The upgraded low rank coal had higher heating values than the raw coal. It also had less susceptibility to low temperature oxidation and spontaneous combustion. This seemed to result from the coating of the asphalt on the surface of the coal, which suppressed the active functional groups from reacting with oxygen in the air. The increasing upgrading pressure negatively affected the low temperature oxidation and spontaneous combustion.

Salient Object Detection via Structured Matrix Decomposition.

Science.gov (United States)

Peng, Houwen; Li, Bing; Ling, Haibin; Hu, Weiming; Xiong, Weihua; Maybank, Stephen J

2016-05-04

Low-rank recovery models have shown potential for salient object detection, where a matrix is decomposed into a low-rank matrix representing image background and a sparse matrix identifying salient objects. Two deficiencies, however, still exist. First, previous work typically assumes the elements in the sparse matrix are mutually independent, ignoring the spatial and pattern relations of image regions. Second, when the low-rank and sparse matrices are relatively coherent, e.g., when there are similarities between the salient objects and background or when the background is complicated, it is difficult for previous models to disentangle them. To address these problems, we propose a novel structured matrix decomposition model with two structural regularizations: (1) a tree-structured sparsity-inducing regularization that captures the image structure and enforces patches from the same object to have similar saliency values, and (2) a Laplacian regularization that enlarges the gaps between salient objects and the background in feature space. Furthermore, high-level priors are integrated to guide the matrix decomposition and boost the detection. We evaluate our model for salient object detection on five challenging datasets including single object, multiple objects and complex scene images, and show competitive results as compared with 24 state-of-the-art methods in terms of seven performance metrics.

Remote sensing image segmentation using local sparse structure constrained latent low rank representation

Science.gov (United States)

Tian, Shu; Zhang, Ye; Yan, Yimin; Su, Nan; Zhang, Junping

2016-09-01

Latent low-rank representation (LatLRR) has been attached considerable attention in the field of remote sensing image segmentation, due to its effectiveness in exploring the multiple subspace structures of data. However, the increasingly heterogeneous texture information in the high spatial resolution remote sensing images, leads to more severe interference of pixels in local neighborhood, and the LatLRR fails to capture the local complex structure information. Therefore, we present a local sparse structure constrainted latent low-rank representation (LSSLatLRR) segmentation method, which explicitly imposes the local sparse structure constraint on LatLRR to capture the intrinsic local structure in manifold structure feature subspaces. The whole segmentation framework can be viewed as two stages in cascade. In the first stage, we use the local histogram transform to extract the texture local histogram features (LHOG) at each pixel, which can efficiently capture the complex and micro-texture pattern. In the second stage, a local sparse structure (LSS) formulation is established on LHOG, which aims to preserve the local intrinsic structure and enhance the relationship between pixels having similar local characteristics. Meanwhile, by integrating the LSS and the LatLRR, we can efficiently capture the local sparse and low-rank structure in the mixture of feature subspace, and we adopt the subspace segmentation method to improve the segmentation accuracy. Experimental results on the remote sensing images with different spatial resolution show that, compared with three state-of-the-art image segmentation methods, the proposed method achieves more accurate segmentation results.

CT Image Sequence Restoration Based on Sparse and Low-Rank Decomposition

Science.gov (United States)

Gou, Shuiping; Wang, Yueyue; Wang, Zhilong; Peng, Yong; Zhang, Xiaopeng; Jiao, Licheng; Wu, Jianshe

2013-01-01

Blurry organ boundaries and soft tissue structures present a major challenge in biomedical image restoration. In this paper, we propose a low-rank decomposition-based method for computed tomography (CT) image sequence restoration, where the CT image sequence is decomposed into a sparse component and a low-rank component. A new point spread function of Weiner filter is employed to efficiently remove blur in the sparse component; a wiener filtering with the Gaussian PSF is used to recover the average image of the low-rank component. And then we get the recovered CT image sequence by combining the recovery low-rank image with all recovery sparse image sequence. Our method achieves restoration results with higher contrast, sharper organ boundaries and richer soft tissue structure information, compared with existing CT image restoration methods. The robustness of our method was assessed with numerical experiments using three different low-rank models: Robust Principle Component Analysis (RPCA), Linearized Alternating Direction Method with Adaptive Penalty (LADMAP) and Go Decomposition (GoDec). Experimental results demonstrated that the RPCA model was the most suitable for the small noise CT images whereas the GoDec model was the best for the large noisy CT images. PMID:24023764

Multi-stage classification method oriented to aerial image based on low-rank recovery and multi-feature fusion sparse representation.

Science.gov (United States)

Ma, Xu; Cheng, Yongmei; Hao, Shuai

2016-12-10

Automatic classification of terrain surfaces from an aerial image is essential for an autonomous unmanned aerial vehicle (UAV) landing at an unprepared site by using vision. Diverse terrain surfaces may show similar spectral properties due to the illumination and noise that easily cause poor classification performance. To address this issue, a multi-stage classification algorithm based on low-rank recovery and multi-feature fusion sparse representation is proposed. First, color moments and Gabor texture feature are extracted from training data and stacked as column vectors of a dictionary. Then we perform low-rank matrix recovery for the dictionary by using augmented Lagrange multipliers and construct a multi-stage terrain classifier. Experimental results on an aerial map database that we prepared verify the classification accuracy and robustness of the proposed method.

Low-rank coal research, Task 5.1. Topical report, April 1986--December 1992

Energy Technology Data Exchange (ETDEWEB)

1993-02-01

This document is a topical progress report for Low-Rank Coal Research performed April 1986 - December 1992. Control Technology and Coal Preparation Research is described for Flue Gas Cleanup, Waste Management, Regional Energy Policy Program for the Northern Great Plains, and Hot-Gas Cleanup. Advanced Research and Technology Development was conducted on Turbine Combustion Phenomena, Combustion Inorganic Transformation (two sections), Liquefaction Reactivity of Low-Rank Coals, Gasification Ash and Slag Characterization, and Coal Science. Combustion Research is described for Atmospheric Fluidized-Bed Combustion, Beneficiation of Low-Rank Coals, Combustion Characterization of Low-Rank Fuels (completed 10/31/90), Diesel Utilization of Low-Rank Coals (completed 12/31/90), Produce and Characterize HWD (hot-water drying) Fuels for Heat Engine Applications (completed 10/31/90), Nitrous Oxide Emission, and Pressurized Fluidized-Bed Combustion. Liquefaction Research in Low-Rank Coal Direct Liquefaction is discussed. Gasification Research was conducted in Production of Hydrogen and By-Products from Coals and in Sulfur Forms in Coal.

Task 27 -- Alaskan low-rank coal-water fuel demonstration project

Energy Technology Data Exchange (ETDEWEB)

NONE

1995-10-01

Development of coal-water-fuel (CWF) technology has to-date been predicated on the use of high-rank bituminous coal only, and until now the high inherent moisture content of low-rank coal has precluded its use for CWF production. The unique feature of the Alaskan project is the integration of hot-water-drying (HWD) into CWF technology as a beneficiation process. Hot-water-drying is an EERC developed technology unavailable to the competition that allows the range of CWF feedstock to be extended to low-rank coals. The primary objective of the Alaskan Project, is to promote interest in the CWF marketplace by demonstrating the commercial viability of low-rank coal-water-fuel (LRCWF). While commercialization plans cannot be finalized until the implementation and results of the Alaskan LRCWF Project are known and evaluated, this report has been prepared to specifically address issues concerning business objectives for the project, and outline a market development plan for meeting those objectives.

Global sensitivity analysis using low-rank tensor approximations

International Nuclear Information System (INIS)

Konakli, Katerina; Sudret, Bruno

2016-01-01

In the context of global sensitivity analysis, the Sobol' indices constitute a powerful tool for assessing the relative significance of the uncertain input parameters of a model. We herein introduce a novel approach for evaluating these indices at low computational cost, by post-processing the coefficients of polynomial meta-models belonging to the class of low-rank tensor approximations. Meta-models of this class can be particularly efficient in representing responses of high-dimensional models, because the number of unknowns in their general functional form grows only linearly with the input dimension. The proposed approach is validated in example applications, where the Sobol' indices derived from the meta-model coefficients are compared to reference indices, the latter obtained by exact analytical solutions or Monte-Carlo simulation with extremely large samples. Moreover, low-rank tensor approximations are confronted to the popular polynomial chaos expansion meta-models in case studies that involve analytical rank-one functions and finite-element models pertinent to structural mechanics and heat conduction. In the examined applications, indices based on the novel approach tend to converge faster to the reference solution with increasing size of the experimental design used to build the meta-model. - Highlights: • A new method is proposed for global sensitivity analysis of high-dimensional models. • Low-rank tensor approximations (LRA) are used as a meta-modeling technique. • Analytical formulas for the Sobol' indices in terms of LRA coefficients are derived. • The accuracy and efficiency of the approach is illustrated in application examples. • LRA-based indices are compared to indices based on polynomial chaos expansions.

Matrix factorization-based data fusion for the prediction of lncRNA-disease associations.

Science.gov (United States)

Fu, Guangyuan; Wang, Jun; Domeniconi, Carlotta; Yu, Guoxian

2018-05-01

Long non-coding RNAs (lncRNAs) play crucial roles in complex disease diagnosis, prognosis, prevention and treatment, but only a small portion of lncRNA-disease associations have been experimentally verified. Various computational models have been proposed to identify lncRNA-disease associations by integrating heterogeneous data sources. However, existing models generally ignore the intrinsic structure of data sources or treat them as equally relevant, while they may not be. To accurately identify lncRNA-disease associations, we propose a Matrix Factorization based LncRNA-Disease Association prediction model (MFLDA in short). MFLDA decomposes data matrices of heterogeneous data sources into low-rank matrices via matrix tri-factorization to explore and exploit their intrinsic and shared structure. MFLDA can select and integrate the data sources by assigning different weights to them. An iterative solution is further introduced to simultaneously optimize the weights and low-rank matrices. Next, MFLDA uses the optimized low-rank matrices to reconstruct the lncRNA-disease association matrix and thus to identify potential associations. In 5-fold cross validation experiments to identify verified lncRNA-disease associations, MFLDA achieves an area under the receiver operating characteristic curve (AUC) of 0.7408, at least 3% higher than those given by state-of-the-art data fusion based computational models. An empirical study on identifying masked lncRNA-disease associations again shows that MFLDA can identify potential associations more accurately than competing models. A case study on identifying lncRNAs associated with breast, lung and stomach cancers show that 38 out of 45 (84%) associations predicted by MFLDA are supported by recent biomedical literature and further proves the capability of MFLDA in identifying novel lncRNA-disease associations. MFLDA is a general data fusion framework, and as such it can be adopted to predict associations between other biological

Synfuels from low-rank coals at the Great Plains Gasification Plant

International Nuclear Information System (INIS)

Pollock, D.

1992-01-01

This presentation focuses on the use of low rank coals to form synfuels. A worldwide abundance of low rank coals exists. Large deposits in the United States are located in Texas and North Dakota. Low rank coal deposits are also found in Europe, India and Australia. Because of the high moisture content of lignite ranging from 30% to 60% or higher, it is usually utilized in mine mouth applications. Lignite is generally very reactive and contains varying amounts of ash and sulfur. Typical uses for lignite are listed. A commercial application using lignite as feedstock to a synfuels plant, Dakota Gasification Company's Great Plains Gasification Plant, is discussed

Generalized Reduced Rank Tests using the Singular Value Decomposition

NARCIS (Netherlands)

F.R. Kleibergen (Frank); R. Paap (Richard)

2003-01-01

textabstractWe propose a novel statistic to test the rank of a matrix. The rank statistic overcomes deficiencies of existing rank statistics, like: necessity of a Kronecker covariance matrix for the canonical correlation rank statistic of Anderson (1951), sensitivity to the ordering of the variables

Robust Visual Tracking Via Consistent Low-Rank Sparse Learning

KAUST Repository

Zhang, Tianzhu

2014-06-19

Object tracking is the process of determining the states of a target in consecutive video frames based on properties of motion and appearance consistency. In this paper, we propose a consistent low-rank sparse tracker (CLRST) that builds upon the particle filter framework for tracking. By exploiting temporal consistency, the proposed CLRST algorithm adaptively prunes and selects candidate particles. By using linear sparse combinations of dictionary templates, the proposed method learns the sparse representations of image regions corresponding to candidate particles jointly by exploiting the underlying low-rank constraints. In addition, the proposed CLRST algorithm is computationally attractive since temporal consistency property helps prune particles and the low-rank minimization problem for learning joint sparse representations can be efficiently solved by a sequence of closed form update operations. We evaluate the proposed CLRST algorithm against 14 state-of-the-art tracking methods on a set of 25 challenging image sequences. Experimental results show that the CLRST algorithm performs favorably against state-of-the-art tracking methods in terms of accuracy and execution time.

Generalized reduced rank tests using the singular value decomposition

NARCIS (Netherlands)

Kleibergen, F.R.; Paap, R.

2002-01-01

We propose a novel statistic to test the rank of a matrix. The rank statistic overcomes deficiencies of existing rank statistics, like: necessity of a Kronecker covariance matrix for the canonical correlation rank statistic of Anderson (1951), sensitivity to the ordering of the variables for the LDU

Low-rank coal study : national needs for resource development. Volume 2. Resource characterization

Energy Technology Data Exchange (ETDEWEB)

1980-11-01

Comprehensive data are presented on the quantity, quality, and distribution of low-rank coal (subbituminous and lignite) deposits in the United States. The major lignite-bearing areas are the Fort Union Region and the Gulf Lignite Region, with the predominant strippable reserves being in the states of North Dakota, Montana, and Texas. The largest subbituminous coal deposits are in the Powder River Region of Montana and Wyoming, The San Juan Basin of New Mexico, and in Northern Alaska. For each of the low-rank coal-bearing regions, descriptions are provided of the geology; strippable reserves; active and planned mines; classification of identified resources by depth, seam thickness, sulfur content, and ash content; overburden characteristics; aquifers; and coal properties and characteristics. Low-rank coals are distinguished from bituminous coals by unique chemical and physical properties that affect their behavior in extraction, utilization, or conversion processes. The most characteristic properties of the organic fraction of low-rank coals are the high inherent moisture and oxygen contents, and the correspondingly low heating value. Mineral matter (ash) contents and compositions of all coals are highly variable; however, low-rank coals tend to have a higher proportion of the alkali components CaO, MgO, and Na/sub 2/O. About 90% of the reserve base of US low-rank coal has less than one percent sulfur. Water resources in the major low-rank coal-bearing regions tend to have highly seasonal availabilities. Some areas appear to have ample water resources to support major new coal projects; in other areas such as Texas, water supplies may be constraining factor on development.

Recovering task fMRI signals from highly under-sampled data with low-rank and temporal subspace constraints.

Science.gov (United States)

Chiew, Mark; Graedel, Nadine N; Miller, Karla L

2018-07-01

Recent developments in highly accelerated fMRI data acquisition have employed low-rank and/or sparsity constraints for image reconstruction, as an alternative to conventional, time-independent parallel imaging. When under-sampling factors are high or the signals of interest are low-variance, however, functional data recovery can be poor or incomplete. We introduce a method for improving reconstruction fidelity using external constraints, like an experimental design matrix, to partially orient the estimated fMRI temporal subspace. Combining these external constraints with low-rank constraints introduces a new image reconstruction model that is analogous to using a mixture of subspace-decomposition (PCA/ICA) and regression (GLM) models in fMRI analysis. We show that this approach improves fMRI reconstruction quality in simulations and experimental data, focusing on the model problem of detecting subtle 1-s latency shifts between brain regions in a block-design task-fMRI experiment. Successful latency discrimination is shown at acceleration factors up to R = 16 in a radial-Cartesian acquisition. We show that this approach works with approximate, or not perfectly informative constraints, where the derived benefit is commensurate with the information content contained in the constraints. The proposed method extends low-rank approximation methods for under-sampled fMRI data acquisition by leveraging knowledge of expected task-based variance in the data, enabling improvements in the speed and efficiency of fMRI data acquisition without the loss of subtle features. Copyright © 2018 The Authors. Published by Elsevier Inc. All rights reserved.

Simulating propagation of decoupled elastic waves using low-rank approximate mixed-domain integral operators for anisotropic media

KAUST Repository

Cheng, Jiubing; Alkhalifah, Tariq Ali; Wu, Zedong; Zou, Peng; Wang, Chenlong

2016-01-01

In elastic imaging, the extrapolated vector fields are decoupled into pure wave modes, such that the imaging condition produces interpretable images. Conventionally, mode decoupling in anisotropic media is costly because the operators involved are dependent on the velocity, and thus they are not stationary. We have developed an efficient pseudospectral approach to directly extrapolate the decoupled elastic waves using low-rank approximate mixed-domain integral operators on the basis of the elastic displacement wave equation. We have applied k-space adjustment to the pseudospectral solution to allow for a relatively large extrapolation time step. The low-rank approximation was, thus, applied to the spectral operators that simultaneously extrapolate and decompose the elastic wavefields. Synthetic examples on transversely isotropic and orthorhombic models showed that our approach has the potential to efficiently and accurately simulate the propagations of the decoupled quasi-P and quasi-S modes as well as the total wavefields for elastic wave modeling, imaging, and inversion.

Simulating propagation of decoupled elastic waves using low-rank approximate mixed-domain integral operators for anisotropic media

KAUST Repository

Cheng, Jiubing

2016-03-15

In elastic imaging, the extrapolated vector fields are decoupled into pure wave modes, such that the imaging condition produces interpretable images. Conventionally, mode decoupling in anisotropic media is costly because the operators involved are dependent on the velocity, and thus they are not stationary. We have developed an efficient pseudospectral approach to directly extrapolate the decoupled elastic waves using low-rank approximate mixed-domain integral operators on the basis of the elastic displacement wave equation. We have applied k-space adjustment to the pseudospectral solution to allow for a relatively large extrapolation time step. The low-rank approximation was, thus, applied to the spectral operators that simultaneously extrapolate and decompose the elastic wavefields. Synthetic examples on transversely isotropic and orthorhombic models showed that our approach has the potential to efficiently and accurately simulate the propagations of the decoupled quasi-P and quasi-S modes as well as the total wavefields for elastic wave modeling, imaging, and inversion.

Beyond Low-Rank Representations: Orthogonal clustering basis reconstruction with optimized graph structure for multi-view spectral clustering.

Science.gov (United States)

Wang, Yang; Wu, Lin

2018-07-01

Low-Rank Representation (LRR) is arguably one of the most powerful paradigms for Multi-view spectral clustering, which elegantly encodes the multi-view local graph/manifold structures into an intrinsic low-rank self-expressive data similarity embedded in high-dimensional space, to yield a better graph partition than their single-view counterparts. In this paper we revisit it with a fundamentally different perspective by discovering LRR as essentially a latent clustered orthogonal projection based representation winged with an optimized local graph structure for spectral clustering; each column of the representation is fundamentally a cluster basis orthogonal to others to indicate its members, which intuitively projects the view-specific feature representation to be the one spanned by all orthogonal basis to characterize the cluster structures. Upon this finding, we propose our technique with the following: (1) We decompose LRR into latent clustered orthogonal representation via low-rank matrix factorization, to encode the more flexible cluster structures than LRR over primal data objects; (2) We convert the problem of LRR into that of simultaneously learning orthogonal clustered representation and optimized local graph structure for each view; (3) The learned orthogonal clustered representations and local graph structures enjoy the same magnitude for multi-view, so that the ideal multi-view consensus can be readily achieved. The experiments over multi-view datasets validate its superiority, especially over recent state-of-the-art LRR models. Copyright © 2018 Elsevier Ltd. All rights reserved.

Low ranks make the difference : How achievement goals and ranking information affect cooperation intentions

NARCIS (Netherlands)

Poortvliet, P. Marijn; Janssen, Onne; Van Yperen, N.W.; Van de Vliert, E.

This investigation tested the joint effect of achievement goals and ranking information on information exchange intentions with a commensurate exchange partner. Results showed that individuals with performance goals were less inclined to cooperate with an exchange partner when they had low or high

Sparse/Low Rank Constrained Reconstruction for Dynamic PET Imaging.

Directory of Open Access Journals (Sweden)

Xingjian Yu

Full Text Available In dynamic Positron Emission Tomography (PET, an estimate of the radio activity concentration is obtained from a series of frames of sinogram data taken at ranging in duration from 10 seconds to minutes under some criteria. So far, all the well-known reconstruction algorithms require known data statistical properties. It limits the speed of data acquisition, besides, it is unable to afford the separated information about the structure and the variation of shape and rate of metabolism which play a major role in improving the visualization of contrast for some requirement of the diagnosing in application. This paper presents a novel low rank-based activity map reconstruction scheme from emission sinograms of dynamic PET, termed as SLCR representing Sparse/Low Rank Constrained Reconstruction for Dynamic PET Imaging. In this method, the stationary background is formulated as a low rank component while variations between successive frames are abstracted to the sparse. The resulting nuclear norm and l1 norm related minimization problem can also be efficiently solved by many recently developed numerical methods. In this paper, the linearized alternating direction method is applied. The effectiveness of the proposed scheme is illustrated on three data sets.

Reweighted Low-Rank Tensor Completion and its Applications in Video Recovery

OpenAIRE

M., Baburaj; George, Sudhish N.

2016-01-01

This paper focus on recovering multi-dimensional data called tensor from randomly corrupted incomplete observation. Inspired by reweighted $l_1$ norm minimization for sparsity enhancement, this paper proposes a reweighted singular value enhancement scheme to improve tensor low tubular rank in the tensor completion process. An efficient iterative decomposition scheme based on t-SVD is proposed which improves low-rank signal recovery significantly. The effectiveness of the proposed method is es...

Universal emergence of PageRank

Energy Technology Data Exchange (ETDEWEB)

Frahm, K M; Georgeot, B; Shepelyansky, D L, E-mail: frahm@irsamc.ups-tlse.fr, E-mail: georgeot@irsamc.ups-tlse.fr, E-mail: dima@irsamc.ups-tlse.fr [Laboratoire de Physique Theorique du CNRS, IRSAMC, Universite de Toulouse, UPS, 31062 Toulouse (France)

2011-11-18

The PageRank algorithm enables us to rank the nodes of a network through a specific eigenvector of the Google matrix, using a damping parameter {alpha} Element-Of ]0, 1[. Using extensive numerical simulations of large web networks, with a special accent on British University networks, we determine numerically and analytically the universal features of the PageRank vector at its emergence when {alpha} {yields} 1. The whole network can be divided into a core part and a group of invariant subspaces. For {alpha} {yields} 1, PageRank converges to a universal power-law distribution on the invariant subspaces whose size distribution also follows a universal power law. The convergence of PageRank at {alpha} {yields} 1 is controlled by eigenvalues of the core part of the Google matrix, which are extremely close to unity, leading to large relaxation times as, for example, in spin glasses. (paper)

Universal emergence of PageRank

International Nuclear Information System (INIS)

Frahm, K M; Georgeot, B; Shepelyansky, D L

2011-01-01

The PageRank algorithm enables us to rank the nodes of a network through a specific eigenvector of the Google matrix, using a damping parameter α ∈ ]0, 1[. Using extensive numerical simulations of large web networks, with a special accent on British University networks, we determine numerically and analytically the universal features of the PageRank vector at its emergence when α → 1. The whole network can be divided into a core part and a group of invariant subspaces. For α → 1, PageRank converges to a universal power-law distribution on the invariant subspaces whose size distribution also follows a universal power law. The convergence of PageRank at α → 1 is controlled by eigenvalues of the core part of the Google matrix, which are extremely close to unity, leading to large relaxation times as, for example, in spin glasses. (paper)

Tensor Factorization for Low-Rank Tensor Completion.

Science.gov (United States)

Zhou, Pan; Lu, Canyi; Lin, Zhouchen; Zhang, Chao

2018-03-01

Recently, a tensor nuclear norm (TNN) based method was proposed to solve the tensor completion problem, which has achieved state-of-the-art performance on image and video inpainting tasks. However, it requires computing tensor singular value decomposition (t-SVD), which costs much computation and thus cannot efficiently handle tensor data, due to its natural large scale. Motivated by TNN, we propose a novel low-rank tensor factorization method for efficiently solving the 3-way tensor completion problem. Our method preserves the low-rank structure of a tensor by factorizing it into the product of two tensors of smaller sizes. In the optimization process, our method only needs to update two smaller tensors, which can be more efficiently conducted than computing t-SVD. Furthermore, we prove that the proposed alternating minimization algorithm can converge to a Karush-Kuhn-Tucker point. Experimental results on the synthetic data recovery, image and video inpainting tasks clearly demonstrate the superior performance and efficiency of our developed method over state-of-the-arts including the TNN and matricization methods.

Robust Visual Tracking via Online Discriminative and Low-Rank Dictionary Learning.

Science.gov (United States)

Zhou, Tao; Liu, Fanghui; Bhaskar, Harish; Yang, Jie

2017-09-12

In this paper, we propose a novel and robust tracking framework based on online discriminative and low-rank dictionary learning. The primary aim of this paper is to obtain compact and low-rank dictionaries that can provide good discriminative representations of both target and background. We accomplish this by exploiting the recovery ability of low-rank matrices. That is if we assume that the data from the same class are linearly correlated, then the corresponding basis vectors learned from the training set of each class shall render the dictionary to become approximately low-rank. The proposed dictionary learning technique incorporates a reconstruction error that improves the reliability of classification. Also, a multiconstraint objective function is designed to enable active learning of a discriminative and robust dictionary. Further, an optimal solution is obtained by iteratively computing the dictionary, coefficients, and by simultaneously learning the classifier parameters. Finally, a simple yet effective likelihood function is implemented to estimate the optimal state of the target during tracking. Moreover, to make the dictionary adaptive to the variations of the target and background during tracking, an online update criterion is employed while learning the new dictionary. Experimental results on a publicly available benchmark dataset have demonstrated that the proposed tracking algorithm performs better than other state-of-the-art trackers.

A New Direction of Cancer Classification: Positive Effect of Low-Ranking MicroRNAs.

Science.gov (United States)

Li, Feifei; Piao, Minghao; Piao, Yongjun; Li, Meijing; Ryu, Keun Ho

2014-10-01

Many studies based on microRNA (miRNA) expression profiles showed a new aspect of cancer classification. Because one characteristic of miRNA expression data is the high dimensionality, feature selection methods have been used to facilitate dimensionality reduction. The feature selection methods have one shortcoming thus far: they just consider the problem of where feature to class is 1:1 or n:1. However, because one miRNA may influence more than one type of cancer, human miRNA is considered to be ranked low in traditional feature selection methods and are removed most of the time. In view of the limitation of the miRNA number, low-ranking miRNAs are also important to cancer classification. We considered both high- and low-ranking features to cover all problems (1:1, n:1, 1:n, and m:n) in cancer classification. First, we used the correlation-based feature selection method to select the high-ranking miRNAs, and chose the support vector machine, Bayes network, decision tree, k-nearest-neighbor, and logistic classifier to construct cancer classification. Then, we chose Chi-square test, information gain, gain ratio, and Pearson's correlation feature selection methods to build the m:n feature subset, and used the selected miRNAs to determine cancer classification. The low-ranking miRNA expression profiles achieved higher classification accuracy compared with just using high-ranking miRNAs in traditional feature selection methods. Our results demonstrate that the m:n feature subset made a positive impression of low-ranking miRNAs in cancer classification.

Assessment of low-rank (LRC) drying technologies

International Nuclear Information System (INIS)

Willson, W.G.; Young, B.C.; Irwinj, W.

1992-01-01

This paper reports that low-rank coals (LRCs), brown, lignitic, and subbituminous coals, represent nearly half of the estimated coal resources in the world. In many of the developing nations, LRCs are the only source of low-cost energy. LRCs are geologically younger than higher-rank bituminous coals and are typically present in thick seams with less cover (overburden) than bituminous coals, making them recoverable by low-cost strip mining. Current pit-head coal prices for LRCs range from a low of around $0.25 per MM Btus for subbituminous coals from the USA's Powder River Basin, to highs of around $1,00 for those that are more costly to mine. On the other hand, the pit-head price of bituminous coals in the USA range from a low of around $1 to over $2 per MM Btu. Unfortunately, this differential in favor of LRC is more than offset in distant markers where, until now, it has been considered a nuisance. Often less than half of its weight is combustible, the rest being water and ash. Thus the cost of hauling it any distance at all in its untreated dry bulk form is prohibitive. However, from a utilization aspect, LRCs have a lower fuel ration (fixed carbon to volatile matter) and are typically an order of magnitude more reactive than bituminous coals. Many LRCs, including the enormous reserves in Alaska, Australia, and Indonesia, also have extremely low sulfur contents of only a few tenths of a percent. Low mining costs, high reactivity, and extremely low sulfur content would make these coals premium fuel were it not for their high moisture levels, which range from around 25% w/w to over 60% w/w. High moisture creates a mistaken perception, among major coal importers, of inferior quality, and the many positive features of LRCs are overlooked

Ranking Support Vector Machine with Kernel Approximation.

Science.gov (United States)

Chen, Kai; Li, Rongchun; Dou, Yong; Liang, Zhengfa; Lv, Qi

2017-01-01

Learning to rank algorithm has become important in recent years due to its successful application in information retrieval, recommender system, and computational biology, and so forth. Ranking support vector machine (RankSVM) is one of the state-of-art ranking models and has been favorably used. Nonlinear RankSVM (RankSVM with nonlinear kernels) can give higher accuracy than linear RankSVM (RankSVM with a linear kernel) for complex nonlinear ranking problem. However, the learning methods for nonlinear RankSVM are still time-consuming because of the calculation of kernel matrix. In this paper, we propose a fast ranking algorithm based on kernel approximation to avoid computing the kernel matrix. We explore two types of kernel approximation methods, namely, the Nyström method and random Fourier features. Primal truncated Newton method is used to optimize the pairwise L2-loss (squared Hinge-loss) objective function of the ranking model after the nonlinear kernel approximation. Experimental results demonstrate that our proposed method gets a much faster training speed than kernel RankSVM and achieves comparable or better performance over state-of-the-art ranking algorithms.

Ranking Support Vector Machine with Kernel Approximation

Directory of Open Access Journals (Sweden)

Kai Chen

2017-01-01

Full Text Available Learning to rank algorithm has become important in recent years due to its successful application in information retrieval, recommender system, and computational biology, and so forth. Ranking support vector machine (RankSVM is one of the state-of-art ranking models and has been favorably used. Nonlinear RankSVM (RankSVM with nonlinear kernels can give higher accuracy than linear RankSVM (RankSVM with a linear kernel for complex nonlinear ranking problem. However, the learning methods for nonlinear RankSVM are still time-consuming because of the calculation of kernel matrix. In this paper, we propose a fast ranking algorithm based on kernel approximation to avoid computing the kernel matrix. We explore two types of kernel approximation methods, namely, the Nyström method and random Fourier features. Primal truncated Newton method is used to optimize the pairwise L2-loss (squared Hinge-loss objective function of the ranking model after the nonlinear kernel approximation. Experimental results demonstrate that our proposed method gets a much faster training speed than kernel RankSVM and achieves comparable or better performance over state-of-the-art ranking algorithms.

Fast Low-Rank Shared Dictionary Learning for Image Classification.

Science.gov (United States)

Tiep Huu Vu; Monga, Vishal

2017-11-01

Despite the fact that different objects possess distinct class-specific features, they also usually share common patterns. This observation has been exploited partially in a recently proposed dictionary learning framework by separating the particularity and the commonality (COPAR). Inspired by this, we propose a novel method to explicitly and simultaneously learn a set of common patterns as well as class-specific features for classification with more intuitive constraints. Our dictionary learning framework is hence characterized by both a shared dictionary and particular (class-specific) dictionaries. For the shared dictionary, we enforce a low-rank constraint, i.e., claim that its spanning subspace should have low dimension and the coefficients corresponding to this dictionary should be similar. For the particular dictionaries, we impose on them the well-known constraints stated in the Fisher discrimination dictionary learning (FDDL). Furthermore, we develop new fast and accurate algorithms to solve the subproblems in the learning step, accelerating its convergence. The said algorithms could also be applied to FDDL and its extensions. The efficiencies of these algorithms are theoretically and experimentally verified by comparing their complexities and running time with those of other well-known dictionary learning methods. Experimental results on widely used image data sets establish the advantages of our method over the state-of-the-art dictionary learning methods.

Enhancing Low-Rank Subspace Clustering by Manifold Regularization.

Science.gov (United States)

Liu, Junmin; Chen, Yijun; Zhang, JiangShe; Xu, Zongben

2014-07-25

Recently, low-rank representation (LRR) method has achieved great success in subspace clustering (SC), which aims to cluster the data points that lie in a union of low-dimensional subspace. Given a set of data points, LRR seeks the lowest rank representation among the many possible linear combinations of the bases in a given dictionary or in terms of the data itself. However, LRR only considers the global Euclidean structure, while the local manifold structure, which is often important for many real applications, is ignored. In this paper, to exploit the local manifold structure of the data, a manifold regularization characterized by a Laplacian graph has been incorporated into LRR, leading to our proposed Laplacian regularized LRR (LapLRR). An efficient optimization procedure, which is based on alternating direction method of multipliers (ADMM), is developed for LapLRR. Experimental results on synthetic and real data sets are presented to demonstrate that the performance of LRR has been enhanced by using the manifold regularization.

Blind Reduced-Rank MMSE Detector for DS-CDMA Systems

Directory of Open Access Journals (Sweden)

Xiaodong Cai

2003-01-01

Full Text Available We first develop a reduced-rank minimum mean squared error (MMSE detector for direct-sequence (DS code division multiple access (CDMA by forcing the linear MMSE detector to lie in a signal subspace of a reduced dimension. While a reduced-rank MMSE detector has lower complexity, it cannot outperform the full-rank MMSE detector. We then concentrate on the blind reduced-rank MMSE detector which is obtained from an estimated covariance matrix. Our analysis and simulation results show that when the desired user′s signal is in a low-dimensional subspace, there exists an optimal subspace so that the blind reduced-rank MMSE detector lying in this subspace has the best performance. By properly choosing a subsspace, we guarantee that the optimal blind reduced-rank MMSE detector is obtained. An adaptive blind reduced-rank MMSE detector, based on a subspace tracking algorithm, is developed. The adaptive blind reduced-rank MMSE detector exhibits superior steady-state performance and fast convergence speed.

Weakly intrusive low-rank approximation method for nonlinear parameter-dependent equations

KAUST Repository

Giraldi, Loic; Nouy, Anthony

2017-01-01

This paper presents a weakly intrusive strategy for computing a low-rank approximation of the solution of a system of nonlinear parameter-dependent equations. The proposed strategy relies on a Newton-like iterative solver which only requires evaluations of the residual of the parameter-dependent equation and of a preconditioner (such as the differential of the residual) for instances of the parameters independently. The algorithm provides an approximation of the set of solutions associated with a possibly large number of instances of the parameters, with a computational complexity which can be orders of magnitude lower than when using the same Newton-like solver for all instances of the parameters. The reduction of complexity requires efficient strategies for obtaining low-rank approximations of the residual, of the preconditioner, and of the increment at each iteration of the algorithm. For the approximation of the residual and the preconditioner, weakly intrusive variants of the empirical interpolation method are introduced, which require evaluations of entries of the residual and the preconditioner. Then, an approximation of the increment is obtained by using a greedy algorithm for low-rank approximation, and a low-rank approximation of the iterate is finally obtained by using a truncated singular value decomposition. When the preconditioner is the differential of the residual, the proposed algorithm is interpreted as an inexact Newton solver for which a detailed convergence analysis is provided. Numerical examples illustrate the efficiency of the method.

Weakly intrusive low-rank approximation method for nonlinear parameter-dependent equations

KAUST Repository

Giraldi, Loic

2017-06-30

This paper presents a weakly intrusive strategy for computing a low-rank approximation of the solution of a system of nonlinear parameter-dependent equations. The proposed strategy relies on a Newton-like iterative solver which only requires evaluations of the residual of the parameter-dependent equation and of a preconditioner (such as the differential of the residual) for instances of the parameters independently. The algorithm provides an approximation of the set of solutions associated with a possibly large number of instances of the parameters, with a computational complexity which can be orders of magnitude lower than when using the same Newton-like solver for all instances of the parameters. The reduction of complexity requires efficient strategies for obtaining low-rank approximations of the residual, of the preconditioner, and of the increment at each iteration of the algorithm. For the approximation of the residual and the preconditioner, weakly intrusive variants of the empirical interpolation method are introduced, which require evaluations of entries of the residual and the preconditioner. Then, an approximation of the increment is obtained by using a greedy algorithm for low-rank approximation, and a low-rank approximation of the iterate is finally obtained by using a truncated singular value decomposition. When the preconditioner is the differential of the residual, the proposed algorithm is interpreted as an inexact Newton solver for which a detailed convergence analysis is provided. Numerical examples illustrate the efficiency of the method.

UTV Expansion Pack: Special-Purpose Rank-Revealing Algorithms

DEFF Research Database (Denmark)

Fierro, Ricardo D.; Hansen, Per Christian

2005-01-01

This collection of Matlab 7.0 software supplements and complements the package UTV Tools from 1999, and includes implementations of special-purpose rank-revealing algorithms developed since the publication of the original package. We provide algorithms for computing and modifying symmetric rank-r...... values of a sparse or structured matrix. These new algorithms have applications in signal processing, optimization and LSI information retrieval.......This collection of Matlab 7.0 software supplements and complements the package UTV Tools from 1999, and includes implementations of special-purpose rank-revealing algorithms developed since the publication of the original package. We provide algorithms for computing and modifying symmetric rank......-revealing VSV decompositions, we expand the algorithms for the ULLV decomposition of a matrix pair to handle interference-type problems with a rank-deficient covariance matrix, and we provide a robust and reliable Lanczos algorithm which - despite its simplicity - is able to capture all the dominant singular...

Hierarchical matrix techniques for the solution of elliptic equations

KAUST Repository

Chávez, Gustavo

2014-05-04

Hierarchical matrix approximations are a promising tool for approximating low-rank matrices given the compactness of their representation and the economy of the operations between them. Integral and differential operators have been the major applications of this technology, but they can be applied into other areas where low-rank properties exist. Such is the case of the Block Cyclic Reduction algorithm, which is used as a direct solver for the constant-coefficient Poisson quation. We explore the variable-coefficient case, also using Block Cyclic reduction, with the addition of Hierarchical Matrices to represent matrix blocks, hence improving the otherwise O(N2) algorithm, into an efficient O(N) algorithm.

Low-rank driving in quantum systems

International Nuclear Information System (INIS)

Burkey, R.S.

1989-01-01

A new property of quantum systems called low-rank driving is introduced. Numerous simplifications in the solution of the time-dependent Schroedinger equation are pointed out for systems having this property. These simplifications are in the areas of finding eigenvalues, taking the Laplace transform, converting Schroedinger's equation to an integral form, discretizing the continuum, generalizing the Weisskopf-Wigner approximation, band-diagonalizing the Hamiltonian, finding new exact solutions to Schroedinger's equation, and so forth. The principal physical application considered is the phenomenon of coherent populations-trapping in continuum-continuum interactions

Fuzzy risk matrix

International Nuclear Information System (INIS)

Markowski, Adam S.; Mannan, M. Sam

2008-01-01

A risk matrix is a mechanism to characterize and rank process risks that are typically identified through one or more multifunctional reviews (e.g., process hazard analysis, audits, or incident investigation). This paper describes a procedure for developing a fuzzy risk matrix that may be used for emerging fuzzy logic applications in different safety analyses (e.g., LOPA). The fuzzification of frequency and severity of the consequences of the incident scenario are described which are basic inputs for fuzzy risk matrix. Subsequently using different design of risk matrix, fuzzy rules are established enabling the development of fuzzy risk matrices. Three types of fuzzy risk matrix have been developed (low-cost, standard, and high-cost), and using a distillation column case study, the effect of the design on final defuzzified risk index is demonstrated

Low-rank coal study: national needs for resource development. Volume 3. Technology evaluation

Energy Technology Data Exchange (ETDEWEB)

1980-11-01

Technologies applicable to the development and use of low-rank coals are analyzed in order to identify specific needs for research, development, and demonstration (RD and D). Major sections of the report address the following technologies: extraction; transportation; preparation, handling and storage; conventional combustion and environmental control technology; gasification; liquefaction; and pyrolysis. Each of these sections contains an introduction and summary of the key issues with regard to subbituminous coal and lignite; description of all relevant technology, both existing and under development; a description of related environmental control technology; an evaluation of the effects of low-rank coal properties on the technology; and summaries of current commercial status of the technology and/or current RD and D projects relevant to low-rank coals.

Does resident ranking during recruitment accurately predict subsequent performance as a surgical resident?

Science.gov (United States)

Fryer, Jonathan P; Corcoran, Noreen; George, Brian; Wang, Ed; Darosa, Debra

2012-01-01

While the primary goal of ranking applicants for surgical residency training positions is to identify the candidates who will subsequently perform best as surgical residents, the effectiveness of the ranking process has not been adequately studied. We evaluated our general surgery resident recruitment process between 2001 and 2011 inclusive, to determine if our recruitment ranking parameters effectively predicted subsequent resident performance. We identified 3 candidate ranking parameters (United States Medical Licensing Examination [USMLE] Step 1 score, unadjusted ranking score [URS], and final adjusted ranking [FAR]), and 4 resident performance parameters (American Board of Surgery In-Training Examination [ABSITE] score, PGY1 resident evaluation grade [REG], overall REG, and independent faculty rating ranking [IFRR]), and assessed whether the former were predictive of the latter. Analyses utilized Spearman correlation coefficient. We found that the URS, which is based on objective and criterion based parameters, was a better predictor of subsequent performance than the FAR, which is a modification of the URS based on subsequent determinations of the resident selection committee. USMLE score was a reliable predictor of ABSITE scores only. However, when we compared our worst residence performances with the performances of the other residents in this evaluation, the data did not produce convincing evidence that poor resident performances could be reliably predicted by any of the recruitment ranking parameters. Finally, stratifying candidates based on their rank range did not effectively define a ranking cut-off beyond which resident performance would drop off. Based on these findings, we recommend surgery programs may be better served by utilizing a more structured resident ranking process and that subsequent adjustments to the rank list generated by this process should be undertaken with caution. Copyright © 2012 Association of Program Directors in Surgery

Efficiency criterion for teleportation via channel matrix, measurement matrix and collapsed matrix

Directory of Open Access Journals (Sweden)

Xin-Wei Zha

Full Text Available In this paper, three kinds of coefficient matrixes (channel matrix, measurement matrix, collapsed matrix associated with the pure state for teleportation are presented, the general relation among channel matrix, measurement matrix and collapsed matrix is obtained. In addition, a criterion for judging whether a state can be teleported successfully is given, depending on the relation between the number of parameter of an unknown state and the rank of the collapsed matrix. Keywords: Channel matrix, Measurement matrix, Collapsed matrix, Teleportation

BJUT at TREC 2015 Microblog Track: Real-Time Filtering Using Non-negative Matrix Factorization

Science.gov (United States)

2015-11-20

query accurate ambiguity intergration Tweets Vector Preprocessing W-d matrix Feature vector Similarity ranking Recommended twittres Get...recommendation tech- nique based on product category attributes[J]. Expert Systems with Applications, 2009, 36(9): 11480-11488. [5] Sobecki J, Babiak E,Sanina M

Robust Visual Tracking Via Consistent Low-Rank Sparse Learning

KAUST Repository

Zhang, Tianzhu; Liu, Si; Ahuja, Narendra; Yang, Ming-Hsuan; Ghanem, Bernard

2014-01-01

and the low-rank minimization problem for learning joint sparse representations can be efficiently solved by a sequence of closed form update operations. We evaluate the proposed CLRST algorithm against 14 state-of-the-art tracking methods on a set of 25

Low-rank coal research. Final technical report, April 1, 1988--June 30, 1989, including quarterly report, April--June 1989

Energy Technology Data Exchange (ETDEWEB)

1989-12-31

This work is a compilation of reports on ongoing research at the University of North Dakota. Topics include: Control Technology and Coal Preparation Research (SO{sub x}/NO{sub x} control, waste management), Advanced Research and Technology Development (turbine combustion phenomena, combustion inorganic transformation, coal/char reactivity, liquefaction reactivity of low-rank coals, gasification ash and slag characterization, fine particulate emissions), Combustion Research (fluidized bed combustion, beneficiation of low-rank coals, combustion characterization of low-rank coal fuels, diesel utilization of low-rank coals), Liquefaction Research (low-rank coal direct liquefaction), and Gasification Research (hydrogen production from low-rank coals, advanced wastewater treatment, mild gasification, color and residual COD removal from Synfuel wastewaters, Great Plains Gasification Plant, gasifier optimization).

Comparison of different eigensolvers for calculating vibrational spectra using low-rank, sum-of-product basis functions

Science.gov (United States)

Leclerc, Arnaud; Thomas, Phillip S.; Carrington, Tucker

2017-08-01

Vibrational spectra and wavefunctions of polyatomic molecules can be calculated at low memory cost using low-rank sum-of-product (SOP) decompositions to represent basis functions generated using an iterative eigensolver. Using a SOP tensor format does not determine the iterative eigensolver. The choice of the interative eigensolver is limited by the need to restrict the rank of the SOP basis functions at every stage of the calculation. We have adapted, implemented and compared different reduced-rank algorithms based on standard iterative methods (block-Davidson algorithm, Chebyshev iteration) to calculate vibrational energy levels and wavefunctions of the 12-dimensional acetonitrile molecule. The effect of using low-rank SOP basis functions on the different methods is analysed and the numerical results are compared with those obtained with the reduced rank block power method. Relative merits of the different algorithms are presented, showing that the advantage of using a more sophisticated method, although mitigated by the use of reduced-rank SOP functions, is noticeable in terms of CPU time.

Low rank approximation methods for MR fingerprinting with large scale dictionaries.

Science.gov (United States)

Yang, Mingrui; Ma, Dan; Jiang, Yun; Hamilton, Jesse; Seiberlich, Nicole; Griswold, Mark A; McGivney, Debra

2018-04-01

This work proposes new low rank approximation approaches with significant memory savings for large scale MR fingerprinting (MRF) problems. We introduce a compressed MRF with randomized singular value decomposition method to significantly reduce the memory requirement for calculating a low rank approximation of large sized MRF dictionaries. We further relax this requirement by exploiting the structures of MRF dictionaries in the randomized singular value decomposition space and fitting them to low-degree polynomials to generate high resolution MRF parameter maps. In vivo 1.5T and 3T brain scan data are used to validate the approaches. T 1 , T 2 , and off-resonance maps are in good agreement with that of the standard MRF approach. Moreover, the memory savings is up to 1000 times for the MRF-fast imaging with steady-state precession sequence and more than 15 times for the MRF-balanced, steady-state free precession sequence. The proposed compressed MRF with randomized singular value decomposition and dictionary fitting methods are memory efficient low rank approximation methods, which can benefit the usage of MRF in clinical settings. They also have great potentials in large scale MRF problems, such as problems considering multi-component MRF parameters or high resolution in the parameter space. Magn Reson Med 79:2392-2400, 2018. © 2017 International Society for Magnetic Resonance in Medicine. © 2017 International Society for Magnetic Resonance in Medicine.

THERMOPLASTIC MATRIX SELECTION FOR FIBRE METAL LAMINATE USING FUZZY VIKOR AND ENTROPY MEASURE FOR OBJECTIVE WEIGHTING

Directory of Open Access Journals (Sweden)

N. M. ISHAK

2017-10-01

Full Text Available The purpose of this study is to define the suitable thermoplastic matrix for fibre metal laminate for automotive front hood utilisation. To achieve the accurate and reliable results, the decision making process involved subjective and objective weighting where the combination of Fuzzy VIKOR and entropy method have been applied. Fuzzy VIKOR is used for ranking purpose and entropy method is used to determine the objective weighting. The result shows that polypropylene is the best thermoplastic matrix for fibre metal laminate by satisfying two compromise solutions with validation using least VIKOR index value scored 0.00, compared to low density polyethylene, high density polyethylene and polystyrene. Through a combination of Fuzzy VIKOR and entropy, it is proved that this method gives a higher degree of confidence to the decision maker especially for fibre metal laminate thermoplastic matrix selection due to its systematic and scientific selection method involving MCDM.

OCT despeckling via weighted nuclear norm constrained non-local low-rank representation

Science.gov (United States)

Tang, Chang; Zheng, Xiao; Cao, Lijuan

2017-10-01

As a non-invasive imaging modality, optical coherence tomography (OCT) plays an important role in medical sciences. However, OCT images are always corrupted by speckle noise, which can mask image features and pose significant challenges for medical analysis. In this work, we propose an OCT despeckling method by using non-local, low-rank representation with weighted nuclear norm constraint. Unlike previous non-local low-rank representation based OCT despeckling methods, we first generate a guidance image to improve the non-local group patches selection quality, then a low-rank optimization model with a weighted nuclear norm constraint is formulated to process the selected group patches. The corrupted probability of each pixel is also integrated into the model as a weight to regularize the representation error term. Note that each single patch might belong to several groups, hence different estimates of each patch are aggregated to obtain its final despeckled result. Both qualitative and quantitative experimental results on real OCT images show the superior performance of the proposed method compared with other state-of-the-art speckle removal techniques.

A novel three-stage distance-based consensus ranking method

Science.gov (United States)

Aghayi, Nazila; Tavana, Madjid

2018-05-01

In this study, we propose a three-stage weighted sum method for identifying the group ranks of alternatives. In the first stage, a rank matrix, similar to the cross-efficiency matrix, is obtained by computing the individual rank position of each alternative based on importance weights. In the second stage, a secondary goal is defined to limit the vector of weights since the vector of weights obtained in the first stage is not unique. Finally, in the third stage, the group rank position of alternatives is obtained based on a distance of individual rank positions. The third stage determines a consensus solution for the group so that the ranks obtained have a minimum distance from the ranks acquired by each alternative in the previous stage. A numerical example is presented to demonstrate the applicability and exhibit the efficacy of the proposed method and algorithms.

A Case-Based Reasoning Method with Rank Aggregation

Science.gov (United States)

Sun, Jinhua; Du, Jiao; Hu, Jian

2018-03-01

In order to improve the accuracy of case-based reasoning (CBR), this paper addresses a new CBR framework with the basic principle of rank aggregation. First, the ranking methods are put forward in each attribute subspace of case. The ordering relation between cases on each attribute is got between cases. Then, a sorting matrix is got. Second, the similar case retrieval process from ranking matrix is transformed into a rank aggregation optimal problem, which uses the Kemeny optimal. On the basis, a rank aggregation case-based reasoning algorithm, named RA-CBR, is designed. The experiment result on UCI data sets shows that case retrieval accuracy of RA-CBR algorithm is higher than euclidean distance CBR and mahalanobis distance CBR testing.So we can get the conclusion that RA-CBR method can increase the performance and efficiency of CBR.

Accurate Numerical Simulations Of Chemical Phenomena Involved in Energy Production and Storage with MADNESS and MPQC: ALCF-2 Early Science Program Technical Report

Energy Technology Data Exchange (ETDEWEB)

Vzquez-Mayagoitia, Alvaro [Argonne National Lab. (ANL), Argonne, IL (United States); Hammond, Jeff R. [Argonne National Lab. (ANL), Argonne, IL (United States)

2013-09-16

In order to solve the electronic structure of large molecular systems on petascale computers using MADNESS, a numerical tool kit, are required fast and accurate implementations for linear algebra. MADNESS uses multiresolution analysis and low separation rank which translates high dimensional functions in tensor products using Legendre polynomial. The multiple tensor products make to the singular value decomposition and matrix multiplication the most intense operations in MADNESS. This work discusses the interfacing of Eigen3 as a C++ substitute of LAPACK and introduces Elemental for the diagonalization of large matrices. Furthermore, the present paper shows the performance these libraries on Blue Gene/ Q.

Matrix completion-based reconstruction for undersampled magnetic resonance fingerprinting data.

Science.gov (United States)

Doneva, Mariya; Amthor, Thomas; Koken, Peter; Sommer, Karsten; Börnert, Peter

2017-09-01

An iterative reconstruction method for undersampled magnetic resonance fingerprinting data is presented. The method performs the reconstruction entirely in k-space and is related to low rank matrix completion methods. A low dimensional data subspace is estimated from a small number of k-space locations fully sampled in the temporal direction and used to reconstruct the missing k-space samples before MRF dictionary matching. Performing the iterations in k-space eliminates the need for applying a forward and an inverse Fourier transform in each iteration required in previously proposed iterative reconstruction methods for undersampled MRF data. A projection onto the low dimensional data subspace is performed as a matrix multiplication instead of a singular value thresholding typically used in low rank matrix completion, further reducing the computational complexity of the reconstruction. The method is theoretically described and validated in phantom and in-vivo experiments. The quality of the parameter maps can be significantly improved compared to direct matching on undersampled data. Copyright © 2017 Elsevier Inc. All rights reserved.

Effects of microwave irradiation treatment on physicochemical characteristics of Chinese low-rank coals

International Nuclear Information System (INIS)

Ge, Lichao; Zhang, Yanwei; Wang, Zhihua; Zhou, Junhu; Cen, Kefa

2013-01-01

Highlights: • Typical Chinese lignites with various ranks are upgraded through microwave. • The pore distribution extends to micropore region, BET area and volume increase. • FTIR show the change of microstructure and improvement in coal rank after upgrading. • Upgraded coals exhibit weak combustion similar to Da Tong bituminous coal. • More evident effects are obtained for raw brown coal with relative lower rank. - Abstract: This study investigates the effects of microwave irradiation treatment on coal composition, pore structure, coal rank, function groups, and combustion characteristics of typical Chinese low-rank coals. Results showed that the upgrading process (microwave irradiation treatment) significantly reduced the coals’ inherent moisture, and increased their calorific value and fixed carbon content. It was also found that the upgrading process generated micropores and increased pore volume and surface area of the coals. Results on the oxygen/carbon ratio parameter indicated that the low-rank coals were upgraded to high-rank coals after the upgrading process, which is in agreement with the findings from Fourier transform infrared spectroscopy. Unstable components in the coal were converted into stable components during the upgrading process. Thermo-gravimetric analysis showed that the combustion processes of upgraded coals were delayed toward the high-temperature region, the ignition and burnout temperatures increased, and the comprehensive combustion parameter decreased. Compared with raw brown coals, the upgraded coals exhibited weak combustion characteristics similar to bituminous coal. The changes in physicochemical characteristics became more notable when processing temperature increased from 130 °C to 160 °C or the rank of raw brown coal was lower. Microwave irradiation treatment could be considered as an effective dewatering and upgrading process

Identification of Successive ``Unobservable'' Cyber Data Attacks in Power Systems Through Matrix Decomposition

Science.gov (United States)

Gao, Pengzhi; Wang, Meng; Chow, Joe H.; Ghiocel, Scott G.; Fardanesh, Bruce; Stefopoulos, George; Razanousky, Michael P.

2016-11-01

This paper presents a new framework of identifying a series of cyber data attacks on power system synchrophasor measurements. We focus on detecting "unobservable" cyber data attacks that cannot be detected by any existing method that purely relies on measurements received at one time instant. Leveraging the approximate low-rank property of phasor measurement unit (PMU) data, we formulate the identification problem of successive unobservable cyber attacks as a matrix decomposition problem of a low-rank matrix plus a transformed column-sparse matrix. We propose a convex-optimization-based method and provide its theoretical guarantee in the data identification. Numerical experiments on actual PMU data from the Central New York power system and synthetic data are conducted to verify the effectiveness of the proposed method.

Compressed Sensing with Rank Deficient Dictionaries

DEFF Research Database (Denmark)

Hansen, Thomas Lundgaard; Johansen, Daniel Højrup; Jørgensen, Peter Bjørn

2012-01-01

In compressed sensing it is generally assumed that the dictionary matrix constitutes a (possibly overcomplete) basis of the signal space. In this paper we consider dictionaries that do not span the signal space, i.e. rank deficient dictionaries. We show that in this case the signal-to-noise ratio...... (SNR) in the compressed samples can be increased by selecting the rows of the measurement matrix from the column space of the dictionary. As an example application of compressed sensing with a rank deficient dictionary, we present a case study of compressed sensing applied to the Coarse Acquisition (C...

Hierarchical matrix techniques for the solution of elliptic equations

KAUST Repository

Chá vez, Gustavo; Turkiyyah, George; Yokota, Rio; Keyes, David E.

2014-01-01

Hierarchical matrix approximations are a promising tool for approximating low-rank matrices given the compactness of their representation and the economy of the operations between them. Integral and differential operators have been the major

Influence of the hydrothermal dewatering on the combustion characteristics of Chinese low-rank coals

International Nuclear Information System (INIS)

Ge, Lichao; Zhang, Yanwei; Xu, Chang; Wang, Zhihua; Zhou, Junhu; Cen, Kefa

2015-01-01

This study investigates the influence of hydrothermal dewatering performed at different temperatures on the combustion characteristics of Chinese low-rank coals with different coalification maturities. It was found that the upgrading process significantly decreased the inherent moisture and oxygen content, increased the calorific value and fixed carbon content, and promoted the damage of the hydrophilic oxygen functional groups. The results of oxygen/carbon atomic ratio indicated that the upgrading process converted the low-rank coals near to high-rank coals which can also be gained using the Fourier transform infrared spectroscopy. The thermogravimetric analysis showed that the combustion processes of upgraded coals were delayed toward the high temperature region, and the upgraded coals had higher ignition and burnout temperature. On the other hand, based on the higher average combustion rate and comprehensive combustion parameter, the upgraded coals performed better compared with raw brown coals and the Da Tong bituminous coal. In ignition segment, the activation energy increased after treatment but decreased in the combustion stage. The changes in coal compositions, microstructure, rank, and combustion characteristics were more notable as the temperature in hydrothermal dewatering increased from 250 to 300 °C or coals of lower ranks were used. - Highlights: • Typical Chinese lignites with various ranks are upgraded by hydrothermal dewatering. • Upgraded coals exhibit chemical compositions comparable with that of bituminous coal. • FTIR show the change of microstructure and improvement in coal rank after upgrading. • Upgraded coals exhibit difficulty in ignition but combust easily. • More evident effects are obtained for raw brown coal with relative lower rank.

Separable expansions of the NN t-matrix via exact half off the energy shell methods

International Nuclear Information System (INIS)

Pisent, G.; Amos, K.; Dortmans, P.J.

1992-01-01

Recently a method was proposed by which one can obtain rank 1 (for uncoupled channels) and rank 2 (for coupled channels), energy dependent t-matrix representations which are exact on- and half off of the energy shell. Fully off shell, this representation, though accurate at low energies, is flawed. For uncoupled channels, if the phase shift passes through zero, the representation has a pathology. Two methods which overcome this are investigated one due to Haberzettl which was extended to coupled channels, and the second which is based upon selective combination of the elements of Sturmian expansions. All methods of separation over a range of energies up to 250 MeV for the 1 S 0 and 3 S 1 channels are compared with the Paris interaction. Special attention is paid to the convergence of the higher order Haberzettl expansion and to the comparison of the extended methods for energies around the zero phase shift pathology for the 1 S 0 channel. The method describes well the fully off-shell properties of the t-matrices up to quite high energies, while keeping the rank of the separation as low as possible in order to be used in three or more body calculations. 39 refs., 10 figs

Finite-rank potential that reproduces the Pade approximant

International Nuclear Information System (INIS)

Tani, S.

1979-01-01

If a scattering potential is of a finite rank, say N, the exact solution of the problem can be obtained from the Born series, if the potential strength is within the radius of convergence; the exact solution can be obtained from the analytical continuation of the formal Born series outside the radius of convergence. Beyond the first 2N terms of the Born series, an individual term of the Born series depends on the first 2N terms, and the [N/N] Pade approximant and the exact solution agree with each other. The above-mentioned features of a finite-rank problem are relevant to scattering theory in general, because most scattering problems may be handled as an extension of the rank-N problem, in which the rank N tends to infinity. The foregoing aspects of scattering theory will be studied in depth in the present paper, and in so doing we proceed in the opposite direction. Namely, given a potential, we calculate the first 2N terms of the Born series for the K matrix and the first N terms of the Born series for the wave function. Using these data, a special rank-N potential is constructed in such a way that it reproduces the [N/N] Pade approximant of the K matrix of the original scattering problem. One great advantage of obtaining such a rank-N potential is that the wave function of the system may be approximated in the same spirit as done for the K matrix; hence, we can introduce a new approximation method for dealing with an off-shell T matrix. A part of the mathematical work is incomplete, but the physical aspects are thoroughly discussed

Sugeno integral ranking of release scenarios in a low and intermediate waste repository

International Nuclear Information System (INIS)

Kim, S. Ho; Kim, Tae Woon; Ha, Jae Joo

2004-01-01

In the present study, a multi criteria decision-making (MCDM) problem of ranking of important radionuclide release scenarios in a low and intermediate radioactive waste repository is to treat on the basis of λ-fuzzy measures and Sugeno integral. Ranking of important scenarios can lead to the provision of more effective safety measure in a design stage of the repository. The ranking is determined by a relative degree of appropriateness of scenario alternatives. To demonstrate a validation of the proposed approach to ranking of release scenarios, results of the previous AHP study are used and compared with them of the present SIAHP approach. Since the AHP approach uses importance weight based on additive probability measures, the interaction among criteria is ignored. The comparison of scenarios ranking obtained from these two approaches enables us to figure out the effect of different models for interaction among criteria

A Direct Elliptic Solver Based on Hierarchically Low-Rank Schur Complements

KAUST Repository

Chávez, Gustavo

2017-03-17

A parallel fast direct solver for rank-compressible block tridiagonal linear systems is presented. Algorithmic synergies between Cyclic Reduction and Hierarchical matrix arithmetic operations result in a solver with O(Nlog2N) arithmetic complexity and O(NlogN) memory footprint. We provide a baseline for performance and applicability by comparing with well-known implementations of the $$\\\\mathcal{H}$$ -LU factorization and algebraic multigrid within a shared-memory parallel environment that leverages the concurrency features of the method. Numerical experiments reveal that this method is comparable with other fast direct solvers based on Hierarchical Matrices such as $$\\\\mathcal{H}$$ -LU and that it can tackle problems where algebraic multigrid fails to converge.

The application of low-rank and sparse decomposition method in the field of climatology

Science.gov (United States)

Gupta, Nitika; Bhaskaran, Prasad K.

2018-04-01

The present study reports a low-rank and sparse decomposition method that separates the mean and the variability of a climate data field. Until now, the application of this technique was limited only in areas such as image processing, web data ranking, and bioinformatics data analysis. In climate science, this method exactly separates the original data into a set of low-rank and sparse components, wherein the low-rank components depict the linearly correlated dataset (expected or mean behavior), and the sparse component represents the variation or perturbation in the dataset from its mean behavior. The study attempts to verify the efficacy of this proposed technique in the field of climatology with two examples of real world. The first example attempts this technique on the maximum wind-speed (MWS) data for the Indian Ocean (IO) region. The study brings to light a decadal reversal pattern in the MWS for the North Indian Ocean (NIO) during the months of June, July, and August (JJA). The second example deals with the sea surface temperature (SST) data for the Bay of Bengal region that exhibits a distinct pattern in the sparse component. The study highlights the importance of the proposed technique used for interpretation and visualization of climate data.

Low-rank extremal positive-partial-transpose states and unextendible product bases

International Nuclear Information System (INIS)

Leinaas, Jon Magne; Sollid, Per Oyvind; Myrheim, Jan

2010-01-01

It is known how to construct, in a bipartite quantum system, a unique low-rank entangled mixed state with positive partial transpose (a PPT state) from an unextendible product basis (UPB), defined as an unextendible set of orthogonal product vectors. We point out that a state constructed in this way belongs to a continuous family of entangled PPT states of the same rank, all related by nonsingular unitary or nonunitary product transformations. The characteristic property of a state ρ in such a family is that its kernel Ker ρ has a generalized UPB, a basis of product vectors, not necessarily orthogonal, with no product vector in Im ρ, the orthogonal complement of Ker ρ. The generalized UPB in Ker ρ has the special property that it can be transformed to orthogonal form by a product transformation. In the case of a system of dimension 3x3, we give a complete parametrization of orthogonal UPBs. This is then a parametrization of families of rank 4 entangled (and extremal) PPT states, and we present strong numerical evidence that it is a complete classification of such states. We speculate that the lowest rank entangled and extremal PPT states also in higher dimensions are related to generalized, nonorthogonal UPBs in similar ways.

S-Matrix to potential inversion of low-energy α-12C phase shifts

Science.gov (United States)

Cooper, S. G.; Mackintosh, R. S.

1990-10-01

The IP S-matrix to potential inversion procedure is applied to phase shifts for selected partial waves over a range of energies below the inelastic threshold for α-12C scattering. The phase shifts were determined by Plaga et al. Potentials found by Buck and Rubio to fit the low-energy alpha cluster resonances need only an increased attraction in the surface to accurately reproduce the phase-shift behaviour. Substantial differences between the potentials for odd and even partial waves are necessary. The surface tail of the potential is postulated to be a threshold effect.

Efficient anisotropic quasi-P wavefield extrapolation using an isotropic low-rank approximation

KAUST Repository

Zhang, Zhendong; Liu, Yike; Alkhalifah, Tariq Ali; Wu, Zedong

2017-01-01

efficient. A dynamic implementation of this approach decomposes the original pseudo-differential operator into a Laplacian, handled using the low-rank approximation of the spectral operator, plus an angular dependent correction factor applied in the space

Efficient tensor completion for color image and video recovery: Low-rank tensor train

OpenAIRE

Bengua, Johann A.; Phien, Ho N.; Tuan, Hoang D.; Do, Minh N.

2016-01-01

This paper proposes a novel approach to tensor completion, which recovers missing entries of data represented by tensors. The approach is based on the tensor train (TT) rank, which is able to capture hidden information from tensors thanks to its definition from a well-balanced matricization scheme. Accordingly, new optimization formulations for tensor completion are proposed as well as two new algorithms for their solution. The first one called simple low-rank tensor completion via tensor tra...

Low rank approach to computing first and higher order derivatives using automatic differentiation

International Nuclear Information System (INIS)

Reed, J. A.; Abdel-Khalik, H. S.; Utke, J.

2012-01-01

This manuscript outlines a new approach for increasing the efficiency of applying automatic differentiation (AD) to large scale computational models. By using the principles of the Efficient Subspace Method (ESM), low rank approximations of the derivatives for first and higher orders can be calculated using minimized computational resources. The output obtained from nuclear reactor calculations typically has a much smaller numerical rank compared to the number of inputs and outputs. This rank deficiency can be exploited to reduce the number of derivatives that need to be calculated using AD. The effective rank can be determined according to ESM by computing derivatives with AD at random inputs. Reduced or pseudo variables are then defined and new derivatives are calculated with respect to the pseudo variables. Two different AD packages are used: OpenAD and Rapsodia. OpenAD is used to determine the effective rank and the subspace that contains the derivatives. Rapsodia is then used to calculate derivatives with respect to the pseudo variables for the desired order. The overall approach is applied to two simple problems and to MATWS, a safety code for sodium cooled reactors. (authors)

Reference Information Based Remote Sensing Image Reconstruction with Generalized Nonconvex Low-Rank Approximation

Directory of Open Access Journals (Sweden)

Hongyang Lu

2016-06-01

Full Text Available Because of the contradiction between the spatial and temporal resolution of remote sensing images (RSI and quality loss in the process of acquisition, it is of great significance to reconstruct RSI in remote sensing applications. Recent studies have demonstrated that reference image-based reconstruction methods have great potential for higher reconstruction performance, while lacking accuracy and quality of reconstruction. For this application, a new compressed sensing objective function incorporating a reference image as prior information is developed. We resort to the reference prior information inherent in interior and exterior data simultaneously to build a new generalized nonconvex low-rank approximation framework for RSI reconstruction. Specifically, the innovation of this paper consists of the following three respects: (1 we propose a nonconvex low-rank approximation for reconstructing RSI; (2 we inject reference prior information to overcome over smoothed edges and texture detail losses; (3 on this basis, we combine conjugate gradient algorithms and a single-value threshold (SVT simultaneously to solve the proposed algorithm. The performance of the algorithm is evaluated both qualitatively and quantitatively. Experimental results demonstrate that the proposed algorithm improves several dBs in terms of peak signal to noise ratio (PSNR and preserves image details significantly compared to most of the current approaches without reference images as priors. In addition, the generalized nonconvex low-rank approximation of our approach is naturally robust to noise, and therefore, the proposed algorithm can handle low resolution with noisy inputs in a more unified framework.

MCDM based evaluation and ranking of commercial off-the-shelf using fuzzy based matrix method

Directory of Open Access Journals (Sweden)

Rakesh Garg

2017-04-01

Full Text Available In today’s scenario, software has become an essential component in all kinds of systems. The size and the complexity of the software increases with a corresponding increase in its functionality, hence leads to the development of the modular software systems. Software developers emphasize on the concept of component based software engineering (CBSE for the development of modular software systems. The CBSE concept consists of dividing the software into a number of modules; selecting Commercial Off-the-Shelf (COTS for each module; and finally integrating the modules to develop the final software system. The selection of COTS for any module plays a vital role in software development. To address the problem of selection of COTS, a framework for ranking and selection of various COTS components for any software system based on expert opinion elicitation and fuzzy-based matrix methodology is proposed in this research paper. The selection problem is modeled as a multi-criteria decision making (MCDM problem. The evaluation criteria are identified through extensive literature study and the COTS components are ranked based on these identified and selected evaluation criteria using the proposed methods according to the value of a permanent function of their criteria matrices. The methodology is explained through an example and is validated by comparing with an existing method.

Simultaneous multislice magnetic resonance fingerprinting with low-rank and subspace modeling.

Science.gov (United States)

Bo Zhao; Bilgic, Berkin; Adalsteinsson, Elfar; Griswold, Mark A; Wald, Lawrence L; Setsompop, Kawin

2017-07-01

Magnetic resonance fingerprinting (MRF) is a new quantitative imaging paradigm that enables simultaneous acquisition of multiple magnetic resonance tissue parameters (e.g., T 1 , T 2 , and spin density). Recently, MRF has been integrated with simultaneous multislice (SMS) acquisitions to enable volumetric imaging with faster scan time. In this paper, we present a new image reconstruction method based on low-rank and subspace modeling for improved SMS-MRF. Here the low-rank model exploits strong spatiotemporal correlation among contrast-weighted images, while the subspace model captures the temporal evolution of magnetization dynamics. With the proposed model, the image reconstruction problem is formulated as a convex optimization problem, for which we develop an algorithm based on variable splitting and the alternating direction method of multipliers. The performance of the proposed method has been evaluated by numerical experiments, and the results demonstrate that the proposed method leads to improved accuracy over the conventional approach. Practically, the proposed method has a potential to allow for a 3× speedup with minimal reconstruction error, resulting in less than 5 sec imaging time per slice.

Novel Direction Of Arrival Estimation Method Based on Coherent Accumulation Matrix Reconstruction

Directory of Open Access Journals (Sweden)

Li Lei

2015-04-01

Full Text Available Based on coherent accumulation matrix reconstruction, a novel Direction Of Arrival (DOA estimation decorrelation method of coherent signals is proposed using a small sample. First, the Signal to Noise Ratio (SNR is improved by performing coherent accumulation operation on an array of observed data. Then, according to the structure characteristics of the accumulated snapshot vector, the equivalent covariance matrix, whose rank is the same as the number of array elements, is constructed. The rank of this matrix is proved to be determined just by the number of incident signals, which realize the decorrelation of coherent signals. Compared with spatial smoothing method, the proposed method performs better by effectively avoiding aperture loss with high-resolution characteristics and low computational complexity. Simulation results demonstrate the efficiency of the proposed method.

Sampling and Low-Rank Tensor Approximation of the Response Surface

KAUST Repository

Litvinenko, Alexander; Matthies, Hermann Georg; El-Moselhy, Tarek A.

2013-01-01

Most (quasi)-Monte Carlo procedures can be seen as computing some integral over an often high-dimensional domain. If the integrand is expensive to evaluate-we are thinking of a stochastic PDE (SPDE) where the coefficients are random fields and the integrand is some functional of the PDE-solution-there is the desire to keep all the samples for possible later computations of similar integrals. This obviously means a lot of data. To keep the storage demands low, and to allow evaluation of the integrand at points which were not sampled, we construct a low-rank tensor approximation of the integrand over the whole integration domain. This can also be viewed as a representation in some problem-dependent basis which allows a sparse representation. What one obtains is sometimes called a "surrogate" or "proxy" model, or a "response surface". This representation is built step by step or sample by sample, and can already be used for each new sample. In case we are sampling a solution of an SPDE, this allows us to reduce the number of necessary samples, namely in case the solution is already well-represented by the low-rank tensor approximation. This can be easily checked by evaluating the residuum of the PDE with the approximate solution. The procedure will be demonstrated in the computation of a compressible transonic Reynolds-averaged Navier-Strokes flow around an airfoil with random/uncertain data. © Springer-Verlag Berlin Heidelberg 2013.

Google matrix, dynamical attractors, and Ulam networks.

Science.gov (United States)

Shepelyansky, D L; Zhirov, O V

2010-03-01

We study the properties of the Google matrix generated by a coarse-grained Perron-Frobenius operator of the Chirikov typical map with dissipation. The finite-size matrix approximant of this operator is constructed by the Ulam method. This method applied to the simple dynamical model generates directed Ulam networks with approximate scale-free scaling and characteristics being in certain features similar to those of the world wide web with approximate scale-free degree distributions as well as two characteristics similar to the web: a power-law decay in PageRank that mirrors the decay of PageRank on the world wide web and a sensitivity to the value alpha in PageRank. The simple dynamical attractors play here the role of popular websites with a strong concentration of PageRank. A variation in the Google parameter alpha or other parameters of the dynamical map can drive the PageRank of the Google matrix to a delocalized phase with a strange attractor where the Google search becomes inefficient.

PageRank for low frequency earthquake detection

Science.gov (United States)

Aguiar, A. C.; Beroza, G. C.

2013-12-01

We have analyzed Hi-Net seismic waveform data during the April 2006 tremor episode in the Nankai Trough in SW Japan using the autocorrelation approach of Brown et al. (2008), which detects low frequency earthquakes (LFEs) based on pair-wise waveform matching. We have generalized this to exploit the fact that waveforms may repeat multiple times, on more than just a pair-wise basis. We are working towards developing a sound statistical basis for event detection, but that is complicated by two factors. First, the statistical behavior of the autocorrelations varies between stations. Analyzing one station at a time assures that the detection threshold will only depend on the station being analyzed. Second, the positive detections do not satisfy "closure." That is, if window A correlates with window B, and window B correlates with window C, then window A and window C do not necessarily correlate with one another. We want to evaluate whether or not a linked set of windows are correlated due to chance. To do this, we map our problem on to one that has previously been solved for web search, and apply Google's PageRank algorithm. PageRank is the probability of a 'random surfer' to visit a particular web page; it assigns a ranking for a webpage based on the amount of links associated with that page. For windows of seismic data instead of webpages, the windows with high probabilities suggest likely LFE signals. Once identified, we stack the matched windows to improve the snr and use these stacks as template signals to find other LFEs within continuous data. We compare the results among stations and declare a detection if they are found in a statistically significant number of stations, based on multinomial statistics. We compare our detections using the single-station method to detections found by Shelly et al. (2007) for the April 2006 tremor sequence in Shikoku, Japan. We find strong similarity between the results, as well as many new detections that were not found using

Low-temperature random matrix theory at the soft edge

International Nuclear Information System (INIS)

Edelman, Alan; Persson, Per-Olof; Sutton, Brian D.

2014-01-01

“Low temperature” random matrix theory is the study of random eigenvalues as energy is removed. In standard notation, β is identified with inverse temperature, and low temperatures are achieved through the limit β → ∞. In this paper, we derive statistics for low-temperature random matrices at the “soft edge,” which describes the extreme eigenvalues for many random matrix distributions. Specifically, new asymptotics are found for the expected value and standard deviation of the general-β Tracy-Widom distribution. The new techniques utilize beta ensembles, stochastic differential operators, and Riccati diffusions. The asymptotics fit known high-temperature statistics curiously well and contribute to the larger program of general-β random matrix theory

Efficient anisotropic quasi-P wavefield extrapolation using an isotropic low-rank approximation

KAUST Repository

Zhang, Zhendong

2017-12-17

The computational cost of quasi-P wave extrapolation depends on the complexity of the medium, and specifically the anisotropy. Our effective-model method splits the anisotropic dispersion relation into an isotropic background and a correction factor to handle this dependency. The correction term depends on the slope (measured using the gradient) of current wavefields and the anisotropy. As a result, the computational cost is independent of the nature of anisotropy, which makes the extrapolation efficient. A dynamic implementation of this approach decomposes the original pseudo-differential operator into a Laplacian, handled using the low-rank approximation of the spectral operator, plus an angular dependent correction factor applied in the space domain to correct for anisotropy. We analyze the role played by the correction factor and propose a new spherical decomposition of the dispersion relation. The proposed method provides accurate wavefields in phase and more balanced amplitudes than a previous spherical decomposition. Also, it is free of SV-wave artifacts. Applications to a simple homogeneous transverse isotropic medium with a vertical symmetry axis (VTI) and a modified Hess VTI model demonstrate the effectiveness of the approach. The Reverse Time Migration (RTM) applied to a modified BP VTI model reveals that the anisotropic migration using the proposed modeling engine performs better than an isotropic migration.

Delocalization transition for the Google matrix.

Science.gov (United States)

Giraud, Olivier; Georgeot, Bertrand; Shepelyansky, Dima L

2009-08-01

We study the localization properties of eigenvectors of the Google matrix, generated both from the world wide web and from the Albert-Barabási model of networks. We establish the emergence of a delocalization phase for the PageRank vector when network parameters are changed. For networks with localized PageRank, eigenvalues of the matrix in the complex plane with a modulus above a certain threshold correspond to localized eigenfunctions while eigenvalues below this threshold are associated with delocalized relaxation modes. We argue that, for networks with delocalized PageRank, the efficiency of information retrieval by Google-type search is strongly affected since the PageRank values have no clear hierarchical structure in this case.

Floating matrix tablets based on low density foam powder: effects of formulation and processing parameters on drug release.

Science.gov (United States)

Streubel, A; Siepmann, J; Bodmeier, R

2003-01-01

The aim of this study was to develop and physicochemically characterize single unit, floating controlled drug delivery systems consisting of (i). polypropylene foam powder, (ii). matrix-forming polymer(s), (iii). drug, and (iv). filler (optional). The highly porous foam powder provided low density and, thus, excellent in vitro floating behavior of the tablets. All foam powder-containing tablets remained floating for at least 8 h in 0.1 N HCl at 37 degrees C. Different types of matrix-forming polymers were studied: hydroxypropyl methylcellulose (HPMC), polyacrylates, sodium alginate, corn starch, carrageenan, gum guar and gum arabic. The tablets eroded upon contact with the release medium, and the relative importance of drug diffusion, polymer swelling and tablet erosion for the resulting release patterns varied significantly with the type of matrix former. The release rate could effectively be modified by varying the "matrix-forming polymer/foam powder" ratio, the initial drug loading, the tablet geometry (radius and height), the type of matrix-forming polymer, the use of polymer blends and the addition of water-soluble or water-insoluble fillers (such as lactose or microcrystalline cellulose). The floating behavior of the low density drug delivery systems could successfully be combined with accurate control of the drug release patterns.

Rank restriction for the variational calculation of two-electron reduced density matrices of many-electron atoms and molecules

International Nuclear Information System (INIS)

Naftchi-Ardebili, Kasra; Hau, Nathania W.; Mazziotti, David A.

2011-01-01

Variational minimization of the ground-state energy as a function of the two-electron reduced density matrix (2-RDM), constrained by necessary N-representability conditions, provides a polynomial-scaling approach to studying strongly correlated molecules without computing the many-electron wave function. Here we introduce a route to enhancing necessary conditions for N representability through rank restriction of the 2-RDM. Rather than adding computationally more expensive N-representability conditions, we directly enhance the accuracy of two-particle (2-positivity) conditions through rank restriction, which removes degrees of freedom in the 2-RDM that are not sufficiently constrained. We select the rank of the particle-hole 2-RDM by deriving the ranks associated with model wave functions, including both mean-field and antisymmetrized geminal power (AGP) wave functions. Because the 2-positivity conditions are exact for quantum systems with AGP ground states, the rank of the particle-hole 2-RDM from the AGP ansatz provides a minimum for its value in variational 2-RDM calculations of general quantum systems. To implement the rank-restricted conditions, we extend a first-order algorithm for large-scale semidefinite programming. The rank-restricted conditions significantly improve the accuracy of the energies; for example, the percentages of correlation energies recovered for HF, CO, and N 2 improve from 115.2%, 121.7%, and 121.5% without rank restriction to 97.8%, 101.1%, and 100.0% with rank restriction. Similar results are found at both equilibrium and nonequilibrium geometries. While more accurate, the rank-restricted N-representability conditions are less expensive computationally than the full-rank conditions.

Canonical correlation analysis of professional stress,social support,and professional burnout among low-rank army officers

Directory of Open Access Journals (Sweden)

Chuan-yun LI

2011-12-01

Full Text Available Objective The present study investigates the influence of professional stress and social support on professional burnout among low-rank army officers.Methods The professional stress,social support,and professional burnout scales among low-rank army officers were used as test tools.Moreover,the officers of established units(battalion,company,and platoon were chosen as test subjects.Out of the 260 scales sent,226 effective scales were received.The descriptive statistic and canonical correlation analysis models were used to analyze the influence of each variable.Results The scores of low-rank army officers in the professional stress,social support,and professional burnout scales were more than average,except on two factors,namely,interpersonal support and de-individualization.The canonical analysis identified three groups of canonical correlation factors,of which two were up to a significant level(P < 0.001.After further eliminating the social support variable,the canonical correlation analysis of professional stress and burnout showed that the canonical correlation coefficients P corresponding to 1 and 2 were 0.62 and 0.36,respectively,and were up to a very significant level(P < 0.001.Conclusion The low-rank army officers experience higher professional stress and burnout levels,showing a lower sense of accomplishment,emotional exhaustion,and more serious depersonalization.However,social support can reduce the onset and seriousness of professional burnout among these officers by lessening pressure factors,such as career development,work features,salary conditions,and other personal factors.

Low-rank coal research: Volume 2, Advanced research and technology development: Final report

Energy Technology Data Exchange (ETDEWEB)

Mann, M.D.; Swanson, M.L.; Benson, S.A.; Radonovich, L.; Steadman, E.N.; Sweeny, P.G.; McCollor, D.P.; Kleesattel, D.; Grow, D.; Falcone, S.K.

1987-04-01

Volume II contains articles on advanced combustion phenomena, combustion inorganic transformation; coal/char reactivity; liquefaction reactivity of low-rank coals, gasification ash and slag characterization, and fine particulate emissions. These articles have been entered individually into EDB and ERA. (LTN)

Kriging accelerated by orders of magnitude: combining low-rank with FFT techniques

KAUST Repository

Litvinenko, Alexander; Nowak, Wolfgang

2014-01-01

Kriging algorithms based on FFT, the separability of certain covariance functions and low-rank representations of covariance functions have been investigated. The current study combines these ideas, and so combines the individual speedup factors of all ideas. The reduced computational complexity is O(dLlogL), where L := max ini, i = 1

Kriging accelerated by orders of magnitude: combining low-rank with FFT techniques

KAUST Repository

Litvinenko, Alexander

2014-05-04

Kriging algorithms based on FFT, the separability of certain covariance functions and low-rank representations of covariance functions have been investigated. The current study combines these ideas, and so combines the individual speedup factors of all ideas. The reduced computational complexity is O(dLlogL), where L := max ini, i = 1

Structure-Based Low-Rank Model With Graph Nuclear Norm Regularization for Noise Removal.

Science.gov (United States)

Ge, Qi; Jing, Xiao-Yuan; Wu, Fei; Wei, Zhi-Hui; Xiao, Liang; Shao, Wen-Ze; Yue, Dong; Li, Hai-Bo

2017-07-01

Nonlocal image representation methods, including group-based sparse coding and block-matching 3-D filtering, have shown their great performance in application to low-level tasks. The nonlocal prior is extracted from each group consisting of patches with similar intensities. Grouping patches based on intensity similarity, however, gives rise to disturbance and inaccuracy in estimation of the true images. To address this problem, we propose a structure-based low-rank model with graph nuclear norm regularization. We exploit the local manifold structure inside a patch and group the patches by the distance metric of manifold structure. With the manifold structure information, a graph nuclear norm regularization is established and incorporated into a low-rank approximation model. We then prove that the graph-based regularization is equivalent to a weighted nuclear norm and the proposed model can be solved by a weighted singular-value thresholding algorithm. Extensive experiments on additive white Gaussian noise removal and mixed noise removal demonstrate that the proposed method achieves a better performance than several state-of-the-art algorithms.

Dynamic PET reconstruction using temporal patch-based low rank penalty for ROI-based brain kinetic analysis

International Nuclear Information System (INIS)

Kim, Kyungsang; Ye, Jong Chul; Son, Young Don; Cho, Zang Hee; Bresler, Yoram; Ra, Jong Beom

2015-01-01

Dynamic positron emission tomography (PET) is widely used to measure changes in the bio-distribution of radiopharmaceuticals within particular organs of interest over time. However, to retain sufficient temporal resolution, the number of photon counts in each time frame must be limited. Therefore, conventional reconstruction algorithms such as the ordered subset expectation maximization (OSEM) produce noisy reconstruction images, thus degrading the quality of the extracted time activity curves (TACs). To address this issue, many advanced reconstruction algorithms have been developed using various spatio-temporal regularizations. In this paper, we extend earlier results and develop a novel temporal regularization, which exploits the self-similarity of patches that are collected in dynamic images. The main contribution of this paper is to demonstrate that the correlation of patches can be exploited using a low-rank constraint that is insensitive to global intensity variations. The resulting optimization framework is, however, non-Lipschitz and non-convex due to the Poisson log-likelihood and low-rank penalty terms. Direct application of the conventional Poisson image deconvolution by an augmented Lagrangian (PIDAL) algorithm is, however, problematic due to its large memory requirements, which prevents its parallelization. Thus, we propose a novel optimization framework using the concave-convex procedure (CCCP) by exploiting the Legendre–Fenchel transform, which is computationally efficient and parallelizable. In computer simulation and a real in vivo experiment using a high-resolution research tomograph (HRRT) scanner, we confirm that the proposed algorithm can improve image quality while also extracting more accurate region of interests (ROI) based kinetic parameters. Furthermore, we show that the total reconstruction time for HRRT PET is significantly accelerated using our GPU implementation, which makes the algorithm very practical in clinical environments

Ranking Fragment Ions Based on Outlier Detection for Improved Label-Free Quantification in Data-Independent Acquisition LC-MS/MS

Science.gov (United States)

Bilbao, Aivett; Zhang, Ying; Varesio, Emmanuel; Luban, Jeremy; Strambio-De-Castillia, Caterina; Lisacek, Frédérique; Hopfgartner, Gérard

2016-01-01

Data-independent acquisition LC-MS/MS techniques complement supervised methods for peptide quantification. However, due to the wide precursor isolation windows, these techniques are prone to interference at the fragment ion level, which in turn is detrimental for accurate quantification. The “non-outlier fragment ion” (NOFI) ranking algorithm has been developed to assign low priority to fragment ions affected by interference. By using the optimal subset of high priority fragment ions these interfered fragment ions are effectively excluded from quantification. NOFI represents each fragment ion as a vector of four dimensions related to chromatographic and MS fragmentation attributes and applies multivariate outlier detection techniques. Benchmarking conducted on a well-defined quantitative dataset (i.e. the SWATH Gold Standard), indicates that NOFI on average is able to accurately quantify 11-25% more peptides than the commonly used Top-N library intensity ranking method. The sum of the area of the Top3-5 NOFIs produces similar coefficients of variation as compared to the library intensity method but with more accurate quantification results. On a biologically relevant human dendritic cell digest dataset, NOFI properly assigns low priority ranks to 85% of annotated interferences, resulting in sensitivity values between 0.92 and 0.80 against 0.76 for the Spectronaut interference detection algorithm. PMID:26412574

RANK and RANK ligand expression in primary human osteosarcoma

Directory of Open Access Journals (Sweden)

Daniel Branstetter

2015-09-01

Our results demonstrate RANKL expression was observed in the tumor element in 68% of human OS using IHC. However, the staining intensity was relatively low and only 37% (29/79 of samples exhibited≥10% RANKL positive tumor cells. RANK expression was not observed in OS tumor cells. In contrast, RANK expression was clearly observed in other cells within OS samples, including the myeloid osteoclast precursor compartment, osteoclasts and in giant osteoclast cells. The intensity and frequency of RANKL and RANK staining in OS samples were substantially less than that observed in GCTB samples. The observation that RANKL is expressed in OS cells themselves suggests that these tumors may mediate an osteoclastic response, and anti-RANKL therapy may potentially be protective against bone pathologies in OS. However, the absence of RANK expression in primary human OS cells suggests that any autocrine RANKL/RANK signaling in human OS tumor cells is not operative, and anti-RANKL therapy would not directly affect the tumor.

S-matrix to potential inversion of low-energy. alpha. - sup 12 C phase shifts

Energy Technology Data Exchange (ETDEWEB)

Cooper, S.G.; Mackintosh, R.S. (Open Univ., Milton Keynes (UK). Dept. of Physics)

1990-10-22

The IP S-matrix to potential inversion procedure is applied to phase shifts for selected partial waves over a range of energies below the inelastic threshold for {alpha}-{sup 12}C scattering. The phase shifts were determined by Plaga et al. Potentials found by Buck and Rubio to fit the low-energy alpha cluster resonances need only an increased attraction in the surface to accurately reproduce the phase-shift behaviour. Substantial differences between the potentials for odd and even partial waves are necessary. The surface tail of the potential is postulated to be a threshold effect. (orig.).

Complex step-based low-rank extended Kalman filtering for state-parameter estimation in subsurface transport models

KAUST Repository

El Gharamti, Mohamad; Hoteit, Ibrahim

2014-01-01

The accuracy of groundwater flow and transport model predictions highly depends on our knowledge of subsurface physical parameters. Assimilation of contaminant concentration data from shallow dug wells could help improving model behavior, eventually resulting in better forecasts. In this paper, we propose a joint state-parameter estimation scheme which efficiently integrates a low-rank extended Kalman filtering technique, namely the Singular Evolutive Extended Kalman (SEEK) filter, with the prominent complex-step method (CSM). The SEEK filter avoids the prohibitive computational burden of the Extended Kalman filter by updating the forecast along the directions of error growth only, called filter correction directions. CSM is used within the SEEK filter to efficiently compute model derivatives with respect to the state and parameters along the filter correction directions. CSM is derived using complex Taylor expansion and is second order accurate. It is proven to guarantee accurate gradient computations with zero numerical round-off errors, but requires complexifying the numerical code. We perform twin-experiments to test the performance of the CSM-based SEEK for estimating the state and parameters of a subsurface contaminant transport model. We compare the efficiency and the accuracy of the proposed scheme with two standard finite difference-based SEEK filters as well as with the ensemble Kalman filter (EnKF). Assimilation results suggest that the use of the CSM in the context of the SEEK filter may provide up to 80% more accurate solutions when compared to standard finite difference schemes and is competitive with the EnKF, even providing more accurate results in certain situations. We analyze the results based on two different observation strategies. We also discuss the complexification of the numerical code and show that this could be efficiently implemented in the context of subsurface flow models. © 2013 Elsevier B.V.

Complex step-based low-rank extended Kalman filtering for state-parameter estimation in subsurface transport models

KAUST Repository

El Gharamti, Mohamad

2014-02-01

The accuracy of groundwater flow and transport model predictions highly depends on our knowledge of subsurface physical parameters. Assimilation of contaminant concentration data from shallow dug wells could help improving model behavior, eventually resulting in better forecasts. In this paper, we propose a joint state-parameter estimation scheme which efficiently integrates a low-rank extended Kalman filtering technique, namely the Singular Evolutive Extended Kalman (SEEK) filter, with the prominent complex-step method (CSM). The SEEK filter avoids the prohibitive computational burden of the Extended Kalman filter by updating the forecast along the directions of error growth only, called filter correction directions. CSM is used within the SEEK filter to efficiently compute model derivatives with respect to the state and parameters along the filter correction directions. CSM is derived using complex Taylor expansion and is second order accurate. It is proven to guarantee accurate gradient computations with zero numerical round-off errors, but requires complexifying the numerical code. We perform twin-experiments to test the performance of the CSM-based SEEK for estimating the state and parameters of a subsurface contaminant transport model. We compare the efficiency and the accuracy of the proposed scheme with two standard finite difference-based SEEK filters as well as with the ensemble Kalman filter (EnKF). Assimilation results suggest that the use of the CSM in the context of the SEEK filter may provide up to 80% more accurate solutions when compared to standard finite difference schemes and is competitive with the EnKF, even providing more accurate results in certain situations. We analyze the results based on two different observation strategies. We also discuss the complexification of the numerical code and show that this could be efficiently implemented in the context of subsurface flow models. © 2013 Elsevier B.V.

Manifold regularized matrix completion for multi-label learning with ADMM.

Science.gov (United States)

Liu, Bin; Li, Yingming; Xu, Zenglin

2018-05-01

Multi-label learning is a common machine learning problem arising from numerous real-world applications in diverse fields, e.g, natural language processing, bioinformatics, information retrieval and so on. Among various multi-label learning methods, the matrix completion approach has been regarded as a promising approach to transductive multi-label learning. By constructing a joint matrix comprising the feature matrix and the label matrix, the missing labels of test samples are regarded as missing values of the joint matrix. With the low-rank assumption of the constructed joint matrix, the missing labels can be recovered by minimizing its rank. Despite its success, most matrix completion based approaches ignore the smoothness assumption of unlabeled data, i.e., neighboring instances should also share a similar set of labels. Thus they may under exploit the intrinsic structures of data. In addition, the matrix completion problem can be less efficient. To this end, we propose to efficiently solve the multi-label learning problem as an enhanced matrix completion model with manifold regularization, where the graph Laplacian is used to ensure the label smoothness over it. To speed up the convergence of our model, we develop an efficient iterative algorithm, which solves the resulted nuclear norm minimization problem with the alternating direction method of multipliers (ADMM). Experiments on both synthetic and real-world data have shown the promising results of the proposed approach. Copyright © 2018 Elsevier Ltd. All rights reserved.

Scoping Studies to Evaluate the Benefits of an Advanced Dry Feed System on the Use of Low-Rank Coal

Energy Technology Data Exchange (ETDEWEB)

Rader, Jeff; Aguilar, Kelly; Aldred, Derek; Chadwick, Ronald; Conchieri, John; Dara, Satyadileep; Henson, Victor; Leininger, Tom; Liber, Pawel; Liber, Pawel; Lopez-Nakazono, Benito; Pan, Edward; Ramirez, Jennifer; Stevenson, John; Venkatraman, Vignesh

2012-03-30

The purpose of this project was to evaluate the ability of advanced low rank coal gasification technology to cause a significant reduction in the COE for IGCC power plants with 90% carbon capture and sequestration compared with the COE for similarly configured IGCC plants using conventional low rank coal gasification technology. GE’s advanced low rank coal gasification technology uses the Posimetric Feed System, a new dry coal feed system based on GE’s proprietary Posimetric Feeder. In order to demonstrate the performance and economic benefits of the Posimetric Feeder in lowering the cost of low rank coal-fired IGCC power with carbon capture, two case studies were completed. In the Base Case, the gasifier was fed a dilute slurry of Montana Rosebud PRB coal using GE’s conventional slurry feed system. In the Advanced Technology Case, the slurry feed system was replaced with the Posimetric Feed system. The process configurations of both cases were kept the same, to the extent possible, in order to highlight the benefit of substituting the Posimetric Feed System for the slurry feed system.

Prewhitening for Rank-Deficient Noise in Subspace Methods for Noise Reduction

DEFF Research Database (Denmark)

Hansen, Per Christian; Jensen, Søren Holdt

2005-01-01

A fundamental issue in connection with subspace methods for noise reduction is that the covariance matrix for the noise is required to have full rank, in order for the prewhitening step to be defined. However, there are important cases where this requirement is not fulfilled, e.g., when the noise...... has narrow-band characteristics, or in the case of tonal noise. We extend the concept of prewhitening to include the case when the noise covariance matrix is rank deficient, using a weighted pseudoinverse and the quotient SVD, and we show how to formulate a general rank-reduction algorithm that works...... also for rank deficient noise. We also demonstrate how to formulate this algorithm by means of a quotient ULV decomposition, which allows for faster computation and updating. Finally we apply our algorithm to a problem involving a speech signal contaminated by narrow-band noise....

A result-driven minimum blocking method for PageRank parallel computing

Science.gov (United States)

Tao, Wan; Liu, Tao; Yu, Wei; Huang, Gan

2017-01-01

Matrix blocking is a common method for improving computational efficiency of PageRank, but the blocking rules are hard to be determined, and the following calculation is complicated. In tackling these problems, we propose a minimum blocking method driven by result needs to accomplish a parallel implementation of PageRank algorithm. The minimum blocking just stores the element which is necessary for the result matrix. In return, the following calculation becomes simple and the consumption of the I/O transmission is cut down. We do experiments on several matrixes of different data size and different sparsity degree. The results show that the proposed method has better computational efficiency than traditional blocking methods.

A Novel Multi-Sensor Environmental Perception Method Using Low-Rank Representation and a Particle Filter for Vehicle Reversing Safety

Directory of Open Access Journals (Sweden)

Zutao Zhang

2016-06-01

Full Text Available Environmental perception and information processing are two key steps of active safety for vehicle reversing. Single-sensor environmental perception cannot meet the need for vehicle reversing safety due to its low reliability. In this paper, we present a novel multi-sensor environmental perception method using low-rank representation and a particle filter for vehicle reversing safety. The proposed system consists of four main steps, namely multi-sensor environmental perception, information fusion, target recognition and tracking using low-rank representation and a particle filter, and vehicle reversing speed control modules. First of all, the multi-sensor environmental perception module, based on a binocular-camera system and ultrasonic range finders, obtains the distance data for obstacles behind the vehicle when the vehicle is reversing. Secondly, the information fusion algorithm using an adaptive Kalman filter is used to process the data obtained with the multi-sensor environmental perception module, which greatly improves the robustness of the sensors. Then the framework of a particle filter and low-rank representation is used to track the main obstacles. The low-rank representation is used to optimize an objective particle template that has the smallest L-1 norm. Finally, the electronic throttle opening and automatic braking is under control of the proposed vehicle reversing control strategy prior to any potential collisions, making the reversing control safer and more reliable. The final system simulation and practical testing results demonstrate the validity of the proposed multi-sensor environmental perception method using low-rank representation and a particle filter for vehicle reversing safety.

A Novel Fixed Low-Rank Constrained EEG Spatial Filter Estimation with Application to Movie-Induced Emotion Recognition

Directory of Open Access Journals (Sweden)

Ken Yano

2016-01-01

Full Text Available This paper proposes a novel fixed low-rank spatial filter estimation for brain computer interface (BCI systems with an application that recognizes emotions elicited by movies. The proposed approach unifies such tasks as feature extraction, feature selection, and classification, which are often independently tackled in a “bottom-up” manner, under a regularized loss minimization problem. The loss function is explicitly derived from the conventional BCI approach and solves its minimization by optimization with a nonconvex fixed low-rank constraint. For evaluation, an experiment was conducted to induce emotions by movies for dozens of young adult subjects and estimated the emotional states using the proposed method. The advantage of the proposed method is that it combines feature selection, feature extraction, and classification into a monolithic optimization problem with a fixed low-rank regularization, which implicitly estimates optimal spatial filters. The proposed method shows competitive performance against the best CSP-based alternatives.

Direct liquefaction of low-rank coals under mild conditions

Energy Technology Data Exchange (ETDEWEB)

Braun, N.; Rinaldi, R. [Max-Planck-Institut fuer Kohlenforschung, Muelheim an der Ruhr (Germany)

2013-11-01

Due to decreasing of petroleum reserves, direct coal liquefaction is attracting renewed interest as an alternative process to produce liquid fuels. The combination of hydrogen peroxide and coal is not a new one. In the early 1980, Vasilakos and Clinton described a procedure for desulfurization by leaching coal with solutions of sulphuric acid/H{sub 2}O{sub 2}. But so far, H{sub 2}O{sub 2} has never been ascribed a major role in coal liquefaction. Herein, we describe a novel approach for liquefying low-rank coals using a solution of H{sub 2}O{sub 2} in presence of a soluble non-transition metal catalyst. (orig.)

Accelerated cardiac cine MRI using locally low rank and finite difference constraints.

Science.gov (United States)

Miao, Xin; Lingala, Sajan Goud; Guo, Yi; Jao, Terrence; Usman, Muhammad; Prieto, Claudia; Nayak, Krishna S

2016-07-01

To evaluate the potential value of combining multiple constraints for highly accelerated cardiac cine MRI. A locally low rank (LLR) constraint and a temporal finite difference (FD) constraint were combined to reconstruct cardiac cine data from highly undersampled measurements. Retrospectively undersampled 2D Cartesian reconstructions were quantitatively evaluated against fully-sampled data using normalized root mean square error, structural similarity index (SSIM) and high frequency error norm (HFEN). This method was also applied to 2D golden-angle radial real-time imaging to facilitate single breath-hold whole-heart cine (12 short-axis slices, 9-13s single breath hold). Reconstruction was compared against state-of-the-art constrained reconstruction methods: LLR, FD, and k-t SLR. At 10 to 60 spokes/frame, LLR+FD better preserved fine structures and depicted myocardial motion with reduced spatio-temporal blurring in comparison to existing methods. LLR yielded higher SSIM ranking than FD; FD had higher HFEN ranking than LLR. LLR+FD combined the complimentary advantages of the two, and ranked the highest in all metrics for all retrospective undersampled cases. Single breath-hold multi-slice cardiac cine with prospective undersampling was enabled with in-plane spatio-temporal resolutions of 2×2mm(2) and 40ms. Highly accelerated cardiac cine is enabled by the combination of 2D undersampling and the synergistic use of LLR and FD constraints. Copyright © 2016 Elsevier Inc. All rights reserved.

Ranking online quality and reputation via the user activity

Science.gov (United States)

Liu, Xiao-Lu; Guo, Qiang; Hou, Lei; Cheng, Can; Liu, Jian-Guo

2015-10-01

How to design an accurate algorithm for ranking the object quality and user reputation is of importance for online rating systems. In this paper we present an improved iterative algorithm for online ranking object quality and user reputation in terms of the user degree (IRUA), where the user's reputation is measured by his/her rating vector, the corresponding objects' quality vector and the user degree. The experimental results for the empirical networks show that the AUC values of the IRUA algorithm can reach 0.9065 and 0.8705 in Movielens and Netflix data sets, respectively, which is better than the results generated by the traditional iterative ranking methods. Meanwhile, the results for the synthetic networks indicate that user degree should be considered in real rating systems due to users' rating behaviors. Moreover, we find that enhancing or reducing the influences of the large-degree users could produce more accurate reputation ranking lists.

An Adaptive Reordered Method for Computing PageRank

Directory of Open Access Journals (Sweden)

Yi-Ming Bu

2013-01-01

Full Text Available We propose an adaptive reordered method to deal with the PageRank problem. It has been shown that one can reorder the hyperlink matrix of PageRank problem to calculate a reduced system and get the full PageRank vector through forward substitutions. This method can provide a speedup for calculating the PageRank vector. We observe that in the existing reordered method, the cost of the recursively reordering procedure could offset the computational reduction brought by minimizing the dimension of linear system. With this observation, we introduce an adaptive reordered method to accelerate the total calculation, in which we terminate the reordering procedure appropriately instead of reordering to the end. Numerical experiments show the effectiveness of this adaptive reordered method.

Application of House of Quality in evaluation of low rank coal pyrolysis polygeneration technologies

International Nuclear Information System (INIS)

Yang, Qingchun; Yang, Siyu; Qian, Yu; Kraslawski, Andrzej

2015-01-01

Highlights: • House of Quality method was used for assessment of coal pyrolysis polygeneration technologies. • Low rank coal pyrolysis polygeneration processes based on solid heat carrier, moving bed and fluidized bed were evaluated. • Technical and environmental criteria for the assessment of technologies were used. • Low rank coal pyrolysis polygeneration process based on a fluidized bed is the best option. - Abstract: Increasing interest in low rank coal pyrolysis (LRCP) polygeneration has resulted in the development of a number of different technologies and approaches. Evaluation of LRCP processes should include not only conventional efficiency, economic and environmental assessments, but also take into consideration sustainability aspects. As a result of the many complex variables involved, selection of the most suitable LRCP technology becomes a challenging task. This paper applies a House of Quality method in comprehensive evaluation of LRCP. A multi-level evaluation model addressing 19 customer needs and analyzing 10 technical characteristics is developed. Using the evaluation model, the paper evaluates three LRCP technologies, which are based on solid heat carrier, moving bed and fluidized bed concepts, respectively. The results show that the three most important customer needs are level of technical maturity, wastewater emissions, and internal rate of return. The three most important technical characteristics are production costs, investment costs and waste emissions. On the basis of the conducted analysis, it is concluded that the LRCP process utilizing a fluidized bed approach is the optimal alternative studied

Split-and-Combine Singular Value Decomposition for Large-Scale Matrix

Directory of Open Access Journals (Sweden)

Jengnan Tzeng

2013-01-01

Full Text Available The singular value decomposition (SVD is a fundamental matrix decomposition in linear algebra. It is widely applied in many modern techniques, for example, high- dimensional data visualization, dimension reduction, data mining, latent semantic analysis, and so forth. Although the SVD plays an essential role in these fields, its apparent weakness is the order three computational cost. This order three computational cost makes many modern applications infeasible, especially when the scale of the data is huge and growing. Therefore, it is imperative to develop a fast SVD method in modern era. If the rank of matrix is much smaller than the matrix size, there are already some fast SVD approaches. In this paper, we focus on this case but with the additional condition that the data is considerably huge to be stored as a matrix form. We will demonstrate that this fast SVD result is sufficiently accurate, and most importantly it can be derived immediately. Using this fast method, many infeasible modern techniques based on the SVD will become viable.

The nuclear reaction matrix

International Nuclear Information System (INIS)

Krenciglowa, E.M.; Kung, C.L.; Kuo, T.T.S.; Osnes, E.; and Department of Physics, State University of New York at Stony Brook, Stony Brook, New York 11794)

1976-01-01

Different definitions of the reaction matrix G appropriate to the calculation of nuclear structure are reviewed and discussed. Qualitative physical arguments are presented in support of a two-step calculation of the G-matrix for finite nuclei. In the first step the high-energy excitations are included using orthogonalized plane-wave intermediate states, and in the second step the low-energy excitations are added in, using harmonic oscillator intermediate states. Accurate calculations of G-matrix elements for nuclear structure calculations in the Aapprox. =18 region are performed following this procedure and treating the Pauli exclusion operator Q 2 /sub p/ by the method of Tsai and Kuo. The treatment of Q 2 /sub p/, the effect of the intermediate-state spectrum and the energy dependence of the reaction matrix are investigated in detail. The present matrix elements are compared with various matrix elements given in the literature. In particular, close agreement is obtained with the matrix elements calculated by Kuo and Brown using approximate methods

Producing accurate wave propagation time histories using the global matrix method

International Nuclear Information System (INIS)

Obenchain, Matthew B; Cesnik, Carlos E S

2013-01-01

This paper presents a reliable method for producing accurate displacement time histories for wave propagation in laminated plates using the global matrix method. The existence of inward and outward propagating waves in the general solution is highlighted while examining the axisymmetric case of a circular actuator on an aluminum plate. Problems with previous attempts to isolate the outward wave for anisotropic laminates are shown. The updated method develops a correction signal that can be added to the original time history solution to cancel the inward wave and leave only the outward propagating wave. The paper demonstrates the effectiveness of the new method for circular and square actuators bonded to the surface of isotropic laminates, and these results are compared with exact solutions. Results for circular actuators on cross-ply laminates are also presented and compared with experimental results, showing the ability of the new method to successfully capture the displacement time histories for composite laminates. (paper)

Device accurately measures and records low gas-flow rates

Science.gov (United States)

Branum, L. W.

1966-01-01

Free-floating piston in a vertical column accurately measures and records low gas-flow rates. The system may be calibrated, using an adjustable flow-rate gas supply, a low pressure gage, and a sequence recorder. From the calibration rates, a nomograph may be made for easy reduction. Temperature correction may be added for further accuracy.

Pharmacokinetic properties and tolerability of low-dose SoluMatrix diclofenac.

Science.gov (United States)

Desjardins, Paul J; Olugemo, Kemi; Solorio, Daniel; Young, Clarence L

2015-02-01

This study compared the pharmacokinetic properties and safety profile of low-dose (18- and 35-mg) diclofenac capsules manufactured using SoluMatrix Fine Particle Technology (Trademark of iCeutica Inc. (Philadelphia, Pennsylvania), and the technology is licensed to Iroko Pharmaceuticals, LLC (Philadelphia, Pennsylvania) for exclusive use in NSAIDs), which produces submicron-sized drug particles with enhanced dissolution properties, to those of diclofenac potassium immediate-release (IR) 50-mg tablets. This Phase 1, single-center, randomized, open-label, single-dose crossover study was conducted in 40 healthy volunteers. Subjects received, in randomized order, SoluMatrix diclofenac 18- or 35-mg capsules in the fasting condition, SoluMatrix diclofenac 35-mg capsules under fed conditions, and diclofenac potassium IR 50-mg tablets under fasting and fed conditions. Pharmacokinetic parameters (T(max), C(max), AUC(0-t), AUC(0-∞)) were calculated from the concentrations of diclofenac in the plasma. Absorption, food effect, and dose proportionality were determined using a mixed-model ANOVA for C(max), AUC(0-t), AUC(0-∞). Tolerability was assessed by recording adverse events, physical examination findings, vital sign measurements: clinical laboratory test results. Overall, 35 healthy volunteers aged 18 to 52 years completed the study. The mean age of the subjects was 33.4 years, and approximately half were men (47.5%). Median T(max) values were similar between the low-dose SoluMatrix diclofenac 35-mg capsules and the diclofenac potassium IR 50-mg tablets (both, ~1.0 hour). The mean maximum plasma concentration (C(max)) after the administration of low-dose SoluMatrix diclofenac 35-mg capsules was 26% lower than that with diclofenac potassium IR 50-mg tablets under fasting conditions (868.72 vs 1194.21 ng/mL). The administration of low-dose SoluMatrix diclofenac 35-mg capsules was associated with a 23% lower overall systemic exposure compared with that of diclofenac

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

International Nuclear Information System (INIS)

Xu, Q; Liu, H; Xing, L; Yu, H; Wang, G

2016-01-01

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

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

Energy Technology Data Exchange (ETDEWEB)

Xu, Q [Xi’an Jiaotong University, Xi’an (China); Stanford University School of Medicine, Stanford, CA (United States); Liu, H; Xing, L [Stanford University School of Medicine, Stanford, CA (United States); Yu, H [University of Massachusetts Lowell, Lowell, MA (United States); Wang, G [Rensselaer Polytechnic Instute., Troy, NY (United States)

2016-06-15

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

Ranking Performance Measures in Multi-Task Agencies

DEFF Research Database (Denmark)

Christensen, Peter Ove; Sabac, Florin; Tian, Joyce

We derive sufficient conditions for ranking performance evaluation systems in multi-task agency models using both optimal and linear contracts in terms of a second-order stochastic dominance (SSD) condition on the likelihood ratios. The SSD condition can be replaced by a variance-covariance matrix...

QV modal distance displacement - a criterion for contingency ranking

Energy Technology Data Exchange (ETDEWEB)

Rios, M.A.; Sanchez, J.L.; Zapata, C.J. [Universidad de Los Andes (Colombia). Dept. of Electrical Engineering], Emails: mrios@uniandes.edu.co, josesan@uniandes.edu.co, cjzapata@utp.edu.co

2009-07-01

This paper proposes a new methodology using concepts of fast decoupled load flow, modal analysis and ranking of contingencies, where the impact of each contingency is measured hourly taking into account the influence of each contingency over the mathematical model of the system, i.e. the Jacobian Matrix. This method computes the displacement of the reduced Jacobian Matrix eigenvalues used in voltage stability analysis, as a criterion of contingency ranking, considering the fact that the lowest eigenvalue in the normal operation condition is not the same lowest eigenvalue in N-1 contingency condition. It is made using all branches in the system and specific branches according to the IBPF index. The test system used is the IEEE 118 nodes. (author)

Some relations between rank, chromatic number and energy of graphs

International Nuclear Information System (INIS)

Akbari, S.; Ghorbani, E.; Zare, S.

2006-08-01

The energy of a graph G is defined as the sum of the absolute values of all eigenvalues of G and denoted by E(G). Let G be a graph and rank(G) be the rank of the adjacency matrix of G. In this paper we characterize all the graphs with E(G) = rank(G). Among other results we show that apart from a few families of graphs, E(G) ≥ 2max(χ(G), n - χ(G--bar)), where G-bar and χ(G) are the complement and the chromatic number of G, respectively. Moreover some new lower bounds for E(G) in terms of rank(G) are given. (author)

Ranking of small scale proposals for water system repair using the Rapid Impact Assessment Matrix (RIAM)

Energy Technology Data Exchange (ETDEWEB)

Shakib-Manesh, T.E.; Hirvonen, K.O.; Jalava, K.J.; Ålander, T.; Kuitunen, M.T., E-mail: markku.kuitunen@jyu.fi

2014-11-15

Environmental impacts of small scale projects are often assessed poorly, or not assessed at all. This paper examines the usability of the Rapid Impact Assessment Matrix (RIAM) as a tool to prioritize project proposals for small scale water restoration projects in relation to proposals' potential to improve the environment. The RIAM scoring system was used to assess and rank the proposals based on their environmental impacts, the costs of the projects to repair the harmful impacts, and the size of human population living around the sites. A four-member assessment group (The expert panel) gave the RIAM-scores to the proposals. The assumed impacts of the studied projects at the Eastern Finland water systems were divided into the ecological and social impacts. The more detailed assessment categories of the ecological impacts in this study were impacts on landscape, natural state, and limnology. The social impact categories were impacts to recreational use of the area, fishing, industry, population, and economy. These impacts were scored according to their geographical and social significance, their magnitude of change, their character, permanence, reversibility, and cumulativeness. The RIAM method proved to be an appropriate and recommendable method for the small-scale assessment and prioritizing of project proposals. If the assessments are well documented, the RIAM can be a method for easy assessing and comparison of the various kinds of projects. In the studied project proposals there were no big surprises in the results: the best ranks were received by the projects, which were assumed to return watersheds toward their original state.

Ranking of small scale proposals for water system repair using the Rapid Impact Assessment Matrix (RIAM)

International Nuclear Information System (INIS)

Shakib-Manesh, T.E.; Hirvonen, K.O.; Jalava, K.J.; Ålander, T.; Kuitunen, M.T.

2014-01-01

Environmental impacts of small scale projects are often assessed poorly, or not assessed at all. This paper examines the usability of the Rapid Impact Assessment Matrix (RIAM) as a tool to prioritize project proposals for small scale water restoration projects in relation to proposals' potential to improve the environment. The RIAM scoring system was used to assess and rank the proposals based on their environmental impacts, the costs of the projects to repair the harmful impacts, and the size of human population living around the sites. A four-member assessment group (The expert panel) gave the RIAM-scores to the proposals. The assumed impacts of the studied projects at the Eastern Finland water systems were divided into the ecological and social impacts. The more detailed assessment categories of the ecological impacts in this study were impacts on landscape, natural state, and limnology. The social impact categories were impacts to recreational use of the area, fishing, industry, population, and economy. These impacts were scored according to their geographical and social significance, their magnitude of change, their character, permanence, reversibility, and cumulativeness. The RIAM method proved to be an appropriate and recommendable method for the small-scale assessment and prioritizing of project proposals. If the assessments are well documented, the RIAM can be a method for easy assessing and comparison of the various kinds of projects. In the studied project proposals there were no big surprises in the results: the best ranks were received by the projects, which were assumed to return watersheds toward their original state

Sparse reduced-rank regression with covariance estimation

KAUST Repository

Chen, Lisha

2014-12-08

Improving the predicting performance of the multiple response regression compared with separate linear regressions is a challenging question. On the one hand, it is desirable to seek model parsimony when facing a large number of parameters. On the other hand, for certain applications it is necessary to take into account the general covariance structure for the errors of the regression model. We assume a reduced-rank regression model and work with the likelihood function with general error covariance to achieve both objectives. In addition we propose to select relevant variables for reduced-rank regression by using a sparsity-inducing penalty, and to estimate the error covariance matrix simultaneously by using a similar penalty on the precision matrix. We develop a numerical algorithm to solve the penalized regression problem. In a simulation study and real data analysis, the new method is compared with two recent methods for multivariate regression and exhibits competitive performance in prediction and variable selection.

Sparse reduced-rank regression with covariance estimation

KAUST Repository

Chen, Lisha; Huang, Jianhua Z.

2014-01-01

Improving the predicting performance of the multiple response regression compared with separate linear regressions is a challenging question. On the one hand, it is desirable to seek model parsimony when facing a large number of parameters. On the other hand, for certain applications it is necessary to take into account the general covariance structure for the errors of the regression model. We assume a reduced-rank regression model and work with the likelihood function with general error covariance to achieve both objectives. In addition we propose to select relevant variables for reduced-rank regression by using a sparsity-inducing penalty, and to estimate the error covariance matrix simultaneously by using a similar penalty on the precision matrix. We develop a numerical algorithm to solve the penalized regression problem. In a simulation study and real data analysis, the new method is compared with two recent methods for multivariate regression and exhibits competitive performance in prediction and variable selection.

An Improved Approach to the PageRank Problems

Directory of Open Access Journals (Sweden)

Yue Xie

2013-01-01

Full Text Available We introduce a partition of the web pages particularly suited to the PageRank problems in which the web link graph has a nested block structure. Based on the partition of the web pages, dangling nodes, common nodes, and general nodes, the hyperlink matrix can be reordered to be a more simple block structure. Then based on the parallel computation method, we propose an algorithm for the PageRank problems. In this algorithm, the dimension of the linear system becomes smaller, and the vector for general nodes in each block can be calculated separately in every iteration. Numerical experiments show that this approach speeds up the computation of PageRank.

A low-rank matrix recovery approach for energy efficient EEG acquisition for a wireless body area network.

Science.gov (United States)

Majumdar, Angshul; Gogna, Anupriya; Ward, Rabab

2014-08-25

We address the problem of acquiring and transmitting EEG signals in Wireless Body Area Networks (WBAN) in an energy efficient fashion. In WBANs, the energy is consumed by three operations: sensing (sampling), processing and transmission. Previous studies only addressed the problem of reducing the transmission energy. For the first time, in this work, we propose a technique to reduce sensing and processing energy as well: this is achieved by randomly under-sampling the EEG signal. We depart from previous Compressed Sensing based approaches and formulate signal recovery (from under-sampled measurements) as a matrix completion problem. A new algorithm to solve the matrix completion problem is derived here. We test our proposed method and find that the reconstruction accuracy of our method is significantly better than state-of-the-art techniques; and we achieve this while saving sensing, processing and transmission energy. Simple power analysis shows that our proposed methodology consumes considerably less power compared to previous CS based techniques.

Modeling and Simulation on NOx and N2O Formation in Co-combustion of Low-rank Coal and Palm Kernel Shell

Directory of Open Access Journals (Sweden)

Mahidin Mahidin

2012-12-01

Full Text Available NOx and N2O emissions from coal combustion are claimed as the major contributors for the acid rain, photochemical smog, green house and ozone depletion problems. Based on the facts, study on those emissions formation is interest topic in the combustion area. In this paper, theoretical study by modeling and simulation on NOx and N2O formation in co-combustion of low-rank coal and palm kernel shell has been done. Combustion model was developed by using the principle of chemical-reaction equilibrium. Simulation on the model in order to evaluate the composition of the flue gas was performed by minimization the Gibbs free energy. The results showed that by introduced of biomass in coal combustion can reduce the NOx concentration in considerably level. Maximum NO level in co-combustion of low-rank coal and palm kernel shell with fuel composition 1:1 is 2,350 ppm, low enough compared to single low-rank coal combustion up to 3,150 ppm. Moreover, N2O is less than 0.25 ppm in all cases. Keywords: low-rank coal, N2O emission, NOx emission, palm kernel shell

Iterative Neighbour-Information Gathering for Ranking Nodes in Complex Networks

Science.gov (United States)

Xu, Shuang; Wang, Pei; Lü, Jinhu

2017-01-01

Designing node influence ranking algorithms can provide insights into network dynamics, functions and structures. Increasingly evidences reveal that node’s spreading ability largely depends on its neighbours. We introduce an iterative neighbourinformation gathering (Ing) process with three parameters, including a transformation matrix, a priori information and an iteration time. The Ing process iteratively combines priori information from neighbours via the transformation matrix, and iteratively assigns an Ing score to each node to evaluate its influence. The algorithm appropriates for any types of networks, and includes some traditional centralities as special cases, such as degree, semi-local, LeaderRank. The Ing process converges in strongly connected networks with speed relying on the first two largest eigenvalues of the transformation matrix. Interestingly, the eigenvector centrality corresponds to a limit case of the algorithm. By comparing with eight renowned centralities, simulations of susceptible-infected-removed (SIR) model on real-world networks reveal that the Ing can offer more exact rankings, even without a priori information. We also observe that an optimal iteration time is always in existence to realize best characterizing of node influence. The proposed algorithms bridge the gaps among some existing measures, and may have potential applications in infectious disease control, designing of optimal information spreading strategies.

Re-Ranking Sequencing Variants in the Post-GWAS Era for Accurate Causal Variant Identification

Science.gov (United States)

Faye, Laura L.; Machiela, Mitchell J.; Kraft, Peter; Bull, Shelley B.; Sun, Lei

2013-01-01

Next generation sequencing has dramatically increased our ability to localize disease-causing variants by providing base-pair level information at costs increasingly feasible for the large sample sizes required to detect complex-trait associations. Yet, identification of causal variants within an established region of association remains a challenge. Counter-intuitively, certain factors that increase power to detect an associated region can decrease power to localize the causal variant. First, combining GWAS with imputation or low coverage sequencing to achieve the large sample sizes required for high power can have the unintended effect of producing differential genotyping error among SNPs. This tends to bias the relative evidence for association toward better genotyped SNPs. Second, re-use of GWAS data for fine-mapping exploits previous findings to ensure genome-wide significance in GWAS-associated regions. However, using GWAS findings to inform fine-mapping analysis can bias evidence away from the causal SNP toward the tag SNP and SNPs in high LD with the tag. Together these factors can reduce power to localize the causal SNP by more than half. Other strategies commonly employed to increase power to detect association, namely increasing sample size and using higher density genotyping arrays, can, in certain common scenarios, actually exacerbate these effects and further decrease power to localize causal variants. We develop a re-ranking procedure that accounts for these adverse effects and substantially improves the accuracy of causal SNP identification, often doubling the probability that the causal SNP is top-ranked. Application to the NCI BPC3 aggressive prostate cancer GWAS with imputation meta-analysis identified a new top SNP at 2 of 3 associated loci and several additional possible causal SNPs at these loci that may have otherwise been overlooked. This method is simple to implement using R scripts provided on the author's website. PMID:23950724

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

Science.gov (United States)

Rai, Prashant; Sargsyan, Khachik; Najm, Habib; Hermes, Matthew R.; Hirata, So

2017-09-01

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.

Co-pyrolysis of low rank coals and biomass: Product distributions

Energy Technology Data Exchange (ETDEWEB)

Soncini, Ryan M.; Means, Nicholas C.; Weiland, Nathan T.

2013-10-01

Pyrolysis and gasification of combined low rank coal and biomass feeds are the subject of much study in an effort to mitigate the production of green house gases from integrated gasification combined cycle (IGCC) systems. While co-feeding has the potential to reduce the net carbon footprint of commercial gasification operations, the effects of co-feeding on kinetics and product distributions requires study to ensure the success of this strategy. Southern yellow pine was pyrolyzed in a semi-batch type drop tube reactor with either Powder River Basin sub-bituminous coal or Mississippi lignite at several temperatures and feed ratios. Product gas composition of expected primary constituents (CO, CO{sub 2}, CH{sub 4}, H{sub 2}, H{sub 2}O, and C{sub 2}H{sub 4}) was determined by in-situ mass spectrometry while minor gaseous constituents were determined using a GC-MS. Product distributions are fit to linear functions of temperature, and quadratic functions of biomass fraction, for use in computational co-pyrolysis simulations. The results are shown to yield significant nonlinearities, particularly at higher temperatures and for lower ranked coals. The co-pyrolysis product distributions evolve more tar, and less char, CH{sub 4}, and C{sub 2}H{sub 4}, than an additive pyrolysis process would suggest. For lignite co-pyrolysis, CO and H{sub 2} production are also reduced. The data suggests that evolution of hydrogen from rapid pyrolysis of biomass prevents the crosslinking of fragmented aromatic structures during coal pyrolysis to produce tar, rather than secondary char and light gases. Finally, it is shown that, for the two coal types tested, co-pyrolysis synergies are more significant as coal rank decreases, likely because the initial structure in these coals contains larger pores and smaller clusters of aromatic structures which are more readily retained as tar in rapid co-pyrolysis.

Use of the dry-weight-rank method of botanical analysis in the ...

African Journals Online (AJOL)

The dry-weight-rank method of botanical analysis was tested in the highveld of the Eastern Transvaal and was found to be an efficient and accurate means of determining the botanical composition of veld herbage. Accuracy was increased by weighting ranks on the basis of quadrat yield, and by allocation of equal ranks to ...

Accurate Estimation of Low Fundamental Frequencies from Real-Valued Measurements

DEFF Research Database (Denmark)

Christensen, Mads Græsbøll

2013-01-01

In this paper, the difficult problem of estimating low fundamental frequencies from real-valued measurements is addressed. The methods commonly employed do not take the phenomena encountered in this scenario into account and thus fail to deliver accurate estimates. The reason for this is that the......In this paper, the difficult problem of estimating low fundamental frequencies from real-valued measurements is addressed. The methods commonly employed do not take the phenomena encountered in this scenario into account and thus fail to deliver accurate estimates. The reason...... for this is that they employ asymptotic approximations that are violated when the harmonics are not well-separated in frequency, something that happens when the observed signal is real-valued and the fundamental frequency is low. To mitigate this, we analyze the problem and present some exact fundamental frequency estimators...

Social class rank, threat vigilance, and hostile reactivity.

Science.gov (United States)

Kraus, Michael W; Horberg, E J; Goetz, Jennifer L; Keltner, Dacher

2011-10-01

Lower-class individuals, because of their lower rank in society, are theorized to be more vigilant to social threats relative to their high-ranking upper-class counterparts. This class-related vigilance to threat, the authors predicted, would shape the emotional content of social interactions in systematic ways. In Study 1, participants engaged in a teasing interaction with a close friend. Lower-class participants--measured in terms of social class rank in society and within the friendship--more accurately tracked the hostile emotions of their friend. As a result, lower-class individuals experienced more hostile emotion contagion relative to upper-class participants. In Study 2, lower-class participants manipulated to experience lower subjective socioeconomic rank showed more hostile reactivity to ambiguous social scenarios relative to upper-class participants and to lower-class participants experiencing elevated socioeconomic rank. The results suggest that class affects expectations, perception, and experience of hostile emotion, particularly in situations in which lower-class individuals perceive their subordinate rank.

Theoretical Properties for Neural Networks with Weight Matrices of Low Displacement Rank

OpenAIRE

Zhao, Liang; Liao, Siyu; Wang, Yanzhi; Li, Zhe; Tang, Jian; Pan, Victor; Yuan, Bo

2017-01-01

Recently low displacement rank (LDR) matrices, or so-called structured matrices, have been proposed to compress large-scale neural networks. Empirical results have shown that neural networks with weight matrices of LDR matrices, referred as LDR neural networks, can achieve significant reduction in space and computational complexity while retaining high accuracy. We formally study LDR matrices in deep learning. First, we prove the universal approximation property of LDR neural networks with a ...

Measurement of Rank and Other Properties of Direct and Scattered Signals

Directory of Open Access Journals (Sweden)

Svante Björklund

2016-01-01

Full Text Available We have designed an experiment for low-cost indoor measurements of rank and other properties of direct and scattered signals with radar interference suppression in mind. The signal rank is important also in many other applications, for example, DOA (Direction of Arrival estimation, estimation of the number of and location of transmitters in electronic warfare, and increasing the capacity in wireless communications. In real radar applications, such measurements can be very expensive, for example, involving airborne radars with array antennas. We have performed the measurements in an anechoic chamber with several transmitters, a receiving array antenna, and a moving reflector. Our experiment takes several aspects into account: transmitted signals with different correlation, decorrelation of the signals during the acquisition interval, covariance matrix estimation, noise eigenvalue spread, calibration, near-field compensation, scattering in a rough surface, and good control of the influencing factors. With our measurements we have observed rank, DOA spectrum, and eigenpatterns of direct and scattered signals. The agreement of our measured properties with theoretic and simulated results in the literature shows that our experiment is realistic and sound. The detailed description of our experiment could serve as help for conducting other well-controlled experiments.

An Efficient PageRank Approach for Urban Traffic Optimization

Directory of Open Access Journals (Sweden)

Florin Pop

2012-01-01

to determine optimal decisions for each traffic light, based on the solution given by Larry Page for page ranking in Web environment (Page et al. (1999. Our approach is similar with work presented by Sheng-Chung et al. (2009 and Yousef et al. (2010. We consider that the traffic lights are controlled by servers and a score for each road is computed based on efficient PageRank approach and is used in cost function to determine optimal decisions. We demonstrate that the cumulative contribution of each car in the traffic respects the main constrain of PageRank approach, preserving all the properties of matrix consider in our model.

A Ranking Approach to Genomic Selection.

Science.gov (United States)

Blondel, Mathieu; Onogi, Akio; Iwata, Hiroyoshi; Ueda, Naonori

2015-01-01

Genomic selection (GS) is a recent selective breeding method which uses predictive models based on whole-genome molecular markers. Until now, existing studies formulated GS as the problem of modeling an individual's breeding value for a particular trait of interest, i.e., as a regression problem. To assess predictive accuracy of the model, the Pearson correlation between observed and predicted trait values was used. In this paper, we propose to formulate GS as the problem of ranking individuals according to their breeding value. Our proposed framework allows us to employ machine learning methods for ranking which had previously not been considered in the GS literature. To assess ranking accuracy of a model, we introduce a new measure originating from the information retrieval literature called normalized discounted cumulative gain (NDCG). NDCG rewards more strongly models which assign a high rank to individuals with high breeding value. Therefore, NDCG reflects a prerequisite objective in selective breeding: accurate selection of individuals with high breeding value. We conducted a comparison of 10 existing regression methods and 3 new ranking methods on 6 datasets, consisting of 4 plant species and 25 traits. Our experimental results suggest that tree-based ensemble methods including McRank, Random Forests and Gradient Boosting Regression Trees achieve excellent ranking accuracy. RKHS regression and RankSVM also achieve good accuracy when used with an RBF kernel. Traditional regression methods such as Bayesian lasso, wBSR and BayesC were found less suitable for ranking. Pearson correlation was found to correlate poorly with NDCG. Our study suggests two important messages. First, ranking methods are a promising research direction in GS. Second, NDCG can be a useful evaluation measure for GS.

Google matrix and Ulam networks of intermittency maps.

Science.gov (United States)

Ermann, L; Shepelyansky, D L

2010-03-01

We study the properties of the Google matrix of an Ulam network generated by intermittency maps. This network is created by the Ulam method which gives a matrix approximant for the Perron-Frobenius operator of dynamical map. The spectral properties of eigenvalues and eigenvectors of this matrix are analyzed. We show that the PageRank of the system is characterized by a power law decay with the exponent beta dependent on map parameters and the Google damping factor alpha . Under certain conditions the PageRank is completely delocalized so that the Google search in such a situation becomes inefficient.

High accurate time system of the Low Latitude Meridian Circle.

Science.gov (United States)

Yang, Jing; Wang, Feng; Li, Zhiming

In order to obtain the high accurate time signal for the Low Latitude Meridian Circle (LLMC), a new GPS accurate time system is developed which include GPS, 1 MC frequency source and self-made clock system. The second signal of GPS is synchronously used in the clock system and information can be collected by a computer automatically. The difficulty of the cancellation of the time keeper can be overcomed by using this system.

Poisson statistics of PageRank probabilities of Twitter and Wikipedia networks

Science.gov (United States)

Frahm, Klaus M.; Shepelyansky, Dima L.

2014-04-01

We use the methods of quantum chaos and Random Matrix Theory for analysis of statistical fluctuations of PageRank probabilities in directed networks. In this approach the effective energy levels are given by a logarithm of PageRank probability at a given node. After the standard energy level unfolding procedure we establish that the nearest spacing distribution of PageRank probabilities is described by the Poisson law typical for integrable quantum systems. Our studies are done for the Twitter network and three networks of Wikipedia editions in English, French and German. We argue that due to absence of level repulsion the PageRank order of nearby nodes can be easily interchanged. The obtained Poisson law implies that the nearby PageRank probabilities fluctuate as random independent variables.

Correlation effects beyond coupled cluster singles and doubles approximation through Fock matrix dressing.

Science.gov (United States)

Maitra, Rahul; Nakajima, Takahito

2017-11-28

We present an accurate single reference coupled cluster theory in which the conventional Fock operator matrix is suitably dressed to simulate the effect of triple and higher excitations within a singles and doubles framework. The dressing thus invoked originates from a second-order perturbative approximation of a similarity transformed Hamiltonian and induces higher rank excitations through local renormalization of individual occupied and unoccupied orbital lines. Such a dressing is able to recover a significant amount of correlation effects beyond singles and doubles approximation, but only with an economic n 5 additional cost. Due to the inclusion of higher rank excitations via the Fock matrix dressing, this method is a natural improvement over conventional coupled cluster theory with singles and doubles approximation, and this method would be demonstrated via applications on some challenging systems. This highly promising scheme has a conceptually simple structure which is also easily generalizable to a multi-reference coupled cluster scheme for treating strong degeneracy. We shall demonstrate that this method is a natural lowest order perturbative approximation to the recently developed iterative n-body excitation inclusive coupled cluster singles and doubles scheme [R. Maitra et al., J. Chem. Phys. 147, 074103 (2017)].

Geogenic organic contaminants in the low-rank coal-bearing Carrizo-Wilcox aquifer of East Texas, USA

Science.gov (United States)

Chakraborty, Jayeeta; Varonka, Matthew S.; Orem, William H.; Finkelman, Robert B.; Manton, William

2017-01-01

The organic composition of groundwater along the Carrizo-Wilcox aquifer in East Texas (USA), sampled from rural wells in May and September 2015, was examined as part of a larger study of the potential health and environmental effects of organic compounds derived from low-rank coals. The quality of water from the low-rank coal-bearing Carrizo-Wilcox aquifer is a potential environmental concern and no detailed studies of the organic compounds in this aquifer have been published. Organic compounds identified in the water samples included: aliphatics and their fatty acid derivatives, phenols, biphenyls, N-, O-, and S-containing heterocyclic compounds, polycyclic aromatic hydrocarbons (PAHs), aromatic amines, and phthalates. Many of the identified organic compounds (aliphatics, phenols, heterocyclic compounds, PAHs) are geogenic and originated from groundwater leaching of young and unmetamorphosed low-rank coals. Estimated concentrations of individual compounds ranged from about 3.9 to 0.01 μg/L. In many rural areas in East Texas, coal strata provide aquifers for drinking water wells. Organic compounds observed in groundwater are likely to be present in drinking water supplied from wells that penetrate the coal. Some of the organic compounds identified in the water samples are potentially toxic to humans, but at the estimated levels in these samples, the compounds are unlikely to cause acute health problems. The human health effects of low-level chronic exposure to coal-derived organic compounds in drinking water in East Texas are currently unknown, and continuing studies will evaluate possible toxicity.

Sparse Reduced-Rank Regression for Simultaneous Dimension Reduction and Variable Selection

KAUST Repository

Chen, Lisha

2012-12-01

The reduced-rank regression is an effective method in predicting multiple response variables from the same set of predictor variables. It reduces the number of model parameters and takes advantage of interrelations between the response variables and hence improves predictive accuracy. We propose to select relevant variables for reduced-rank regression by using a sparsity-inducing penalty. We apply a group-lasso type penalty that treats each row of the matrix of the regression coefficients as a group and show that this penalty satisfies certain desirable invariance properties. We develop two numerical algorithms to solve the penalized regression problem and establish the asymptotic consistency of the proposed method. In particular, the manifold structure of the reduced-rank regression coefficient matrix is considered and studied in our theoretical analysis. In our simulation study and real data analysis, the new method is compared with several existing variable selection methods for multivariate regression and exhibits competitive performance in prediction and variable selection. © 2012 American Statistical Association.

Fair ranking of researchers and research teams.

Science.gov (United States)

Vavryčuk, Václav

2018-01-01

The main drawback of ranking of researchers by the number of papers, citations or by the Hirsch index is ignoring the problem of distributing authorship among authors in multi-author publications. So far, the single-author or multi-author publications contribute to the publication record of a researcher equally. This full counting scheme is apparently unfair and causes unjust disproportions, in particular, if ranked researchers have distinctly different collaboration profiles. These disproportions are removed by less common fractional or authorship-weighted counting schemes, which can distribute the authorship credit more properly and suppress a tendency to unjustified inflation of co-authors. The urgent need of widely adopting a fair ranking scheme in practise is exemplified by analysing citation profiles of several highly-cited astronomers and astrophysicists. While the full counting scheme often leads to completely incorrect and misleading ranking, the fractional or authorship-weighted schemes are more accurate and applicable to ranking of researchers as well as research teams. In addition, they suppress differences in ranking among scientific disciplines. These more appropriate schemes should urgently be adopted by scientific publication databases as the Web of Science (Thomson Reuters) or the Scopus (Elsevier).

Fuzzy Logic and Its Application in Football Team Ranking

Directory of Open Access Journals (Sweden)

Wenyi Zeng

2014-01-01

some certain rules, we propose four parameters to calculate fuzzy similar matrix, obtain fuzzy equivalence matrix and the ranking result for our numerical example, T7, T3, T1, T9, T10, T8, T11, T12, T2, T6, T5, T4, and investigate four parameters sensitivity analysis. The study shows that our fuzzy logic method is reliable and stable when the parameters change in certain range.

Kriging accelerated by orders of magnitude: combining low-rank with FFT techniques

KAUST Repository

Litvinenko, Alexander; Nowak, Wolfgang

2014-01-01

Kriging algorithms based on FFT, the separability of certain covariance functions and low-rank representations of covariance functions have been investigated. The current study combines these ideas, and so combines the individual speedup factors of all ideas. For separable covariance functions, the results are exact, and non-separable covariance functions can be approximated through sums of separable components. Speedup factor is 1e+8, problem sizes 1.5e+13 and 2e+15 estimation points for Kriging and spatial design.

Kriging accelerated by orders of magnitude: combining low-rank with FFT techniques

KAUST Repository

Litvinenko, Alexander

2014-01-08

Kriging algorithms based on FFT, the separability of certain covariance functions and low-rank representations of covariance functions have been investigated. The current study combines these ideas, and so combines the individual speedup factors of all ideas. For separable covariance functions, the results are exact, and non-separable covariance functions can be approximated through sums of separable components. Speedup factor is 1e+8, problem sizes 1.5e+13 and 2e+15 estimation points for Kriging and spatial design.

Highlighting Entanglement of Cultures via Ranking of Multilingual Wikipedia Articles

Science.gov (United States)

Eom, Young-Ho; Shepelyansky, Dima L.

2013-01-01

How different cultures evaluate a person? Is an important person in one culture is also important in the other culture? We address these questions via ranking of multilingual Wikipedia articles. With three ranking algorithms based on network structure of Wikipedia, we assign ranking to all articles in 9 multilingual editions of Wikipedia and investigate general ranking structure of PageRank, CheiRank and 2DRank. In particular, we focus on articles related to persons, identify top 30 persons for each rank among different editions and analyze distinctions of their distributions over activity fields such as politics, art, science, religion, sport for each edition. We find that local heroes are dominant but also global heroes exist and create an effective network representing entanglement of cultures. The Google matrix analysis of network of cultures shows signs of the Zipf law distribution. This approach allows to examine diversity and shared characteristics of knowledge organization between cultures. The developed computational, data driven approach highlights cultural interconnections in a new perspective. Dated: June 26, 2013 PMID:24098338

Highlighting entanglement of cultures via ranking of multilingual Wikipedia articles.

Directory of Open Access Journals (Sweden)

Young-Ho Eom

Full Text Available How different cultures evaluate a person? Is an important person in one culture is also important in the other culture? We address these questions via ranking of multilingual Wikipedia articles. With three ranking algorithms based on network structure of Wikipedia, we assign ranking to all articles in 9 multilingual editions of Wikipedia and investigate general ranking structure of PageRank, CheiRank and 2DRank. In particular, we focus on articles related to persons, identify top 30 persons for each rank among different editions and analyze distinctions of their distributions over activity fields such as politics, art, science, religion, sport for each edition. We find that local heroes are dominant but also global heroes exist and create an effective network representing entanglement of cultures. The Google matrix analysis of network of cultures shows signs of the Zipf law distribution. This approach allows to examine diversity and shared characteristics of knowledge organization between cultures. The developed computational, data driven approach highlights cultural interconnections in a new perspective. Dated: June 26, 2013.

Weighted Low-Rank Approximation of Matrices and Background Modeling

KAUST Repository

Dutta, Aritra

2018-04-15

We primarily study a special a weighted low-rank approximation of matrices and then apply it to solve the background modeling problem. We propose two algorithms for this purpose: one operates in the batch mode on the entire data and the other one operates in the batch-incremental mode on the data and naturally captures more background variations and computationally more effective. Moreover, we propose a robust technique that learns the background frame indices from the data and does not require any training frames. We demonstrate through extensive experiments that by inserting a simple weight in the Frobenius norm, it can be made robust to the outliers similar to the $\\\\ell_1$ norm. Our methods match or outperform several state-of-the-art online and batch background modeling methods in virtually all quantitative and qualitative measures.

Weighted Low-Rank Approximation of Matrices and Background Modeling

KAUST Repository

Dutta, Aritra; Li, Xin; Richtarik, Peter

2018-01-01

We primarily study a special a weighted low-rank approximation of matrices and then apply it to solve the background modeling problem. We propose two algorithms for this purpose: one operates in the batch mode on the entire data and the other one operates in the batch-incremental mode on the data and naturally captures more background variations and computationally more effective. Moreover, we propose a robust technique that learns the background frame indices from the data and does not require any training frames. We demonstrate through extensive experiments that by inserting a simple weight in the Frobenius norm, it can be made robust to the outliers similar to the $\\ell_1$ norm. Our methods match or outperform several state-of-the-art online and batch background modeling methods in virtually all quantitative and qualitative measures.

Application of Parallel Hierarchical Matrices and Low-Rank Tensors in Spatial Statistics and Parameter Identification

KAUST Repository

Litvinenko, Alexander

2018-03-12

Part 1: Parallel H-matrices in spatial statistics 1. Motivation: improve statistical model 2. Tools: Hierarchical matrices 3. Matern covariance function and joint Gaussian likelihood 4. Identification of unknown parameters via maximizing Gaussian log-likelihood 5. Implementation with HLIBPro. Part 2: Low-rank Tucker tensor methods in spatial statistics

On bounded rank positive semidefinite matrix completions of extreme partial correlation matrices.

NARCIS (Netherlands)

M. Eisenberg-Nagy (Marianna); M. Laurent (Monique); A. Varvitsiotis (Antonios)

2012-01-01

textabstractWe study a new geometric graph parameter $egd(G)$, defined as the smallest integer $r\\ge 1$ for which any partial symmetric matrix which is completable to a correlation matrix and whose entries are specified at the positions of the edges of $G$, can be completed to a matrix in the convex

Factorization of cp-rank-3 completely positive matrices

Czech Academy of Sciences Publication Activity Database

Brandts, J.; Křížek, Michal

2016-01-01

Roč. 66, č. 3 (2016), s. 955-970 ISSN 0011-4642 R&D Projects: GA ČR GA14-02067S Institutional support: RVO:67985840 Keywords : completely positive matrix * cp-rank * factorization Subject RIV: BA - General Mathematics Impact factor: 0.364, year: 2016 http://hdl.handle.net/10338.dmlcz/145882

On bounded rank positive semidefinite matrix completions of extreme partial correlation matrices.

NARCIS (Netherlands)

M. Eisenberg-Nagy (Marianna); M. Laurent (Monique); A. Varvitsiotis (Antonios)

2012-01-01

htmlabstractWe study a new geometric graph parameter egd(G), defined as the smallest integer r ≥ 1 for which any partial symmetric matrix which is completable to a correlation matrix and whose entries are specified at the positions of the edges of G, can be completed to a matrix in the convex hull

Accurate Modeling of Ionospheric Electromagnetic Fields Generated by a Low Altitude VLF Transmitter

Science.gov (United States)

2009-03-31

AFRL-RV-HA-TR-2009-1055 Accurate Modeling of Ionospheric Electromagnetic Fields Generated by a Low Altitude VLF Transmitter ...m (or even 500 m) at mid to high latitudes . At low latitudes , the FDTD model exhibits variations that make it difficult to determine a reliable...Scientific, Final 3. DATES COVERED (From - To) 02-08-2006 – 31-12-2008 4. TITLE AND SUBTITLE Accurate Modeling of Ionospheric Electromagnetic Fields

An intrinsic robust rank-one-approximation approach for currencyportfolio optimization

Directory of Open Access Journals (Sweden)

Hongxuan Huang

2018-03-01

Full Text Available A currency portfolio is a special kind of wealth whose value fluctuates with foreignexchange rates over time, which possesses 3Vs (volume, variety and velocity properties of big datain the currency market. In this paper, an intrinsic robust rank one approximation (ROA approachis proposed to maximize the value of currency portfolios over time. The main results of the paperinclude four parts: Firstly, under the assumptions about the currency market, the currency portfoliooptimization problem is formulated as the basic model, in which there are two types of variablesdescribing currency amounts in portfolios and the amount of each currency exchanged into another,respectively. Secondly, the rank one approximation problem and its variants are also formulated toapproximate a foreign exchange rate matrix, whose performance is measured by the Frobenius normor the 2-norm of a residual matrix. The intrinsic robustness of the rank one approximation is provedtogether with summarizing properties of the basic ROA problem and designing a modified powermethod to search for the virtual exchange rates hidden in a foreign exchange rate matrix. Thirdly,a technique for decision variables reduction is presented to attack the currency portfolio optimization.The reduced formulation is referred to as the ROA model, which keeps only variables describingcurrency amounts in portfolios. The optimal solution to the ROA model also induces a feasible solutionto the basic model of the currency portfolio problem by integrating forex operations from the ROAmodel with practical forex rates. Finally, numerical examples are presented to verify the feasibility ande ciency of the intrinsic robust rank one approximation approach. They also indicate that there existsan objective measure for evaluating and optimizing currency portfolios over time, which is related tothe virtual standard currency and independent of any real currency selected specially for measurement.

Kriging accelerated by orders of magnitude: combining low-rank with FFT techniques

KAUST Repository

Litvinenko, Alexander; Nowak, Wolfgang

2014-01-01

Kriging algorithms based on FFT, the separability of certain covariance functions and low-rank representations of covariance functions have been investigated. The current study combines these ideas, and so combines the individual speedup factors of all ideas. The reduced computational complexity is O(dLlogL), where L := max ini, i = 1..d. For separable covariance functions, the results are exact, and non-separable covariance functions can be approximated through sums of separable components. Speedup factor is 10 8, problem sizes 15e + 12 and 2e + 15 estimation points for Kriging and spatial design.

Low-rank Quasi-Newton updates for Robust Jacobian lagging in Newton methods

International Nuclear Information System (INIS)

Brown, J.; Brune, P.

2013-01-01

Newton-Krylov methods are standard tools for solving nonlinear problems. A common approach is to 'lag' the Jacobian when assembly or preconditioner setup is computationally expensive, in exchange for some degradation in the convergence rate and robustness. We show that this degradation may be partially mitigated by using the lagged Jacobian as an initial operator in a quasi-Newton method, which applies unassembled low-rank updates to the Jacobian until the next full reassembly. We demonstrate the effectiveness of this technique on problems in glaciology and elasticity. (authors)

Kriging accelerated by orders of magnitude: combining low-rank with FFT techniques

KAUST Repository

Litvinenko, Alexander

2014-01-06

Kriging algorithms based on FFT, the separability of certain covariance functions and low-rank representations of covariance functions have been investigated. The current study combines these ideas, and so combines the individual speedup factors of all ideas. The reduced computational complexity is O(dLlogL), where L := max ini, i = 1..d. For separable covariance functions, the results are exact, and non-separable covariance functions can be approximated through sums of separable components. Speedup factor is 10 8, problem sizes 15e + 12 and 2e + 15 estimation points for Kriging and spatial design.

The Extrapolation-Accelerated Multilevel Aggregation Method in PageRank Computation

Directory of Open Access Journals (Sweden)

Bing-Yuan Pu

2013-01-01

Full Text Available An accelerated multilevel aggregation method is presented for calculating the stationary probability vector of an irreducible stochastic matrix in PageRank computation, where the vector extrapolation method is its accelerator. We show how to periodically combine the extrapolation method together with the multilevel aggregation method on the finest level for speeding up the PageRank computation. Detailed numerical results are given to illustrate the behavior of this method, and comparisons with the typical methods are also made.

Some p-ranks related to orthogonal spaces

NARCIS (Netherlands)

Blokhuis, A.; Moorhouse, G.E.

1995-01-01

We determine the p-rank of the incidence matrix of hyperplanes of PG(n, p e) and points of a nondegenerate quadric. This yields new bounds for ovoids and the size of caps in finite orthogonal spaces. In particular, we show the nonexistence of ovoids in O10+ (2e ),O10+ (3e ),O9 (5e ),O12+ (5e

Google matrix analysis of DNA sequences.

Science.gov (United States)

Kandiah, Vivek; Shepelyansky, Dima L

2013-01-01

For DNA sequences of various species we construct the Google matrix [Formula: see text] of Markov transitions between nearby words composed of several letters. The statistical distribution of matrix elements of this matrix is shown to be described by a power law with the exponent being close to those of outgoing links in such scale-free networks as the World Wide Web (WWW). At the same time the sum of ingoing matrix elements is characterized by the exponent being significantly larger than those typical for WWW networks. This results in a slow algebraic decay of the PageRank probability determined by the distribution of ingoing elements. The spectrum of [Formula: see text] is characterized by a large gap leading to a rapid relaxation process on the DNA sequence networks. We introduce the PageRank proximity correlator between different species which determines their statistical similarity from the view point of Markov chains. The properties of other eigenstates of the Google matrix are also discussed. Our results establish scale-free features of DNA sequence networks showing their similarities and distinctions with the WWW and linguistic networks.

Google matrix analysis of DNA sequences.

Directory of Open Access Journals (Sweden)

Vivek Kandiah

Full Text Available For DNA sequences of various species we construct the Google matrix [Formula: see text] of Markov transitions between nearby words composed of several letters. The statistical distribution of matrix elements of this matrix is shown to be described by a power law with the exponent being close to those of outgoing links in such scale-free networks as the World Wide Web (WWW. At the same time the sum of ingoing matrix elements is characterized by the exponent being significantly larger than those typical for WWW networks. This results in a slow algebraic decay of the PageRank probability determined by the distribution of ingoing elements. The spectrum of [Formula: see text] is characterized by a large gap leading to a rapid relaxation process on the DNA sequence networks. We introduce the PageRank proximity correlator between different species which determines their statistical similarity from the view point of Markov chains. The properties of other eigenstates of the Google matrix are also discussed. Our results establish scale-free features of DNA sequence networks showing their similarities and distinctions with the WWW and linguistic networks.

An Improved Fuzzy Based Missing Value Estimation in DNA Microarray Validated by Gene Ranking

Directory of Open Access Journals (Sweden)

Sujay Saha

2016-01-01

Full Text Available Most of the gene expression data analysis algorithms require the entire gene expression matrix without any missing values. Hence, it is necessary to devise methods which would impute missing data values accurately. There exist a number of imputation algorithms to estimate those missing values. This work starts with a microarray dataset containing multiple missing values. We first apply the modified version of the fuzzy theory based existing method LRFDVImpute to impute multiple missing values of time series gene expression data and then validate the result of imputation by genetic algorithm (GA based gene ranking methodology along with some regular statistical validation techniques, like RMSE method. Gene ranking, as far as our knowledge, has not been used yet to validate the result of missing value estimation. Firstly, the proposed method has been tested on the very popular Spellman dataset and results show that error margins have been drastically reduced compared to some previous works, which indirectly validates the statistical significance of the proposed method. Then it has been applied on four other 2-class benchmark datasets, like Colorectal Cancer tumours dataset (GDS4382, Breast Cancer dataset (GSE349-350, Prostate Cancer dataset, and DLBCL-FL (Leukaemia for both missing value estimation and ranking the genes, and the results show that the proposed method can reach 100% classification accuracy with very few dominant genes, which indirectly validates the biological significance of the proposed method.

Phenomena identification and ranking tables (PIRT) for LBLOCA

International Nuclear Information System (INIS)

Shaw, R.A.; Dimenna, R.A.; Larson, T.K.; Wilson, G.E.

1988-01-01

The US Nuclear Regulatory Commission is sponsoring a program to provide validated reactor safety computer codes with quantified uncertainties. The intent is to quantify the accuracy of the codes for use in best estimate licensing applications. One of the tasks required to complete this program involves the identification and ranking of thermal-hydraulic phenomena that occur during particular accidents. This paper provides detailed tables of phenomena and importance ranks for a PWR LBLOCA. The phenomena were identified and ranked according to perceived impact on peak cladding temperature. Two approaches were used to complete this task. First, a panel of experts identified the physical processes considered to be most important during LBLOCA. A second team of experienced analysts then, in parallel, assembled complete tables of all plausible LBLOCA phenomena, regardless of perceived importance. Each phenomenon was then ranked in importance against every other phenomenon associated with a given component. The results were placed in matrix format and solved for the principal eigenvector. The results as determined by each method are presented in this report

Google matrix of the citation network of Physical Review

Science.gov (United States)

Frahm, Klaus M.; Eom, Young-Ho; Shepelyansky, Dima L.

2014-05-01

We study the statistical properties of spectrum and eigenstates of the Google matrix of the citation network of Physical Review for the period 1893-2009. The main fraction of complex eigenvalues with largest modulus is determined numerically by different methods based on high-precision computations with up to p =16384 binary digits that allow us to resolve hard numerical problems for small eigenvalues. The nearly nilpotent matrix structure allows us to obtain a semianalytical computation of eigenvalues. We find that the spectrum is characterized by the fractal Weyl law with a fractal dimension df≈1. It is found that the majority of eigenvectors are located in a localized phase. The statistical distribution of articles in the PageRank-CheiRank plane is established providing a better understanding of information flows on the network. The concept of ImpactRank is proposed to determine an influence domain of a given article. We also discuss the properties of random matrix models of Perron-Frobenius operators.

Consequence ranking of radionuclides in Hanford tank waste

International Nuclear Information System (INIS)

Schmittroth, F.A.; De Lorenzo, T.H.

1995-09-01

Radionuclides in the Hanford tank waste are ranked relative to their consequences for the Low-Level Tank Waste program. The ranking identifies key radionuclides where further study is merited. In addition to potential consequences for intrude and drinking-water scenarios supporting low-level waste activities, a ranking based on shielding criteria is provided. The radionuclide production inventories are based on a new and independent ORIGEN2 calculation representing the operation of all Hanford single-pass reactors and the N Reactor

Orbit Classification of Qutrit via the Gram Matrix

International Nuclear Information System (INIS)

Tay, B. A.; Zainuddin, Hishamuddin

2008-01-01

We classify the orbits generated by unitary transformation on the density matrices of the three-state quantum systems (qutrits) via the Gram matrix. The Gram matrix is a real symmetric matrix formed from the Hilbert–Schmidt scalar products of the vectors lying in the tangent space to the orbits. The rank of the Gram matrix determines the dimensions of the orbits, which fall into three classes for qutrits. (general)

An accurate and efficient reliability-based design optimization using the second order reliability method and improved stability transformation method

Science.gov (United States)

Meng, Zeng; Yang, Dixiong; Zhou, Huanlin; Yu, Bo

2018-05-01

The first order reliability method has been extensively adopted for reliability-based design optimization (RBDO), but it shows inaccuracy in calculating the failure probability with highly nonlinear performance functions. Thus, the second order reliability method is required to evaluate the reliability accurately. However, its application for RBDO is quite challenge owing to the expensive computational cost incurred by the repeated reliability evaluation and Hessian calculation of probabilistic constraints. In this article, a new improved stability transformation method is proposed to search the most probable point efficiently, and the Hessian matrix is calculated by the symmetric rank-one update. The computational capability of the proposed method is illustrated and compared to the existing RBDO approaches through three mathematical and two engineering examples. The comparison results indicate that the proposed method is very efficient and accurate, providing an alternative tool for RBDO of engineering structures.

Ultra-low Temperature Curable Conductive Silver Adhesive with different Resin Matrix

Science.gov (United States)

Zhou, Xingli; Wang, Likun; Liao, Qingwei; Yan, Chao; Li, Xing; Qin, Lei

2018-03-01

The ultra-low temperature curable conductive silver adhesive with curing temperature less than 100 °C needed urgently for the surface conductive treatment of piezoelectric composite material due to the low thermal resistance of composite material and low adhesion strength of adhesive. An ultra-low temperature curable conductive adhesive with high adhesion strength was obtained for the applications of piezoelectric composite material. The microstructure, conductive properties and adhesive properties with different resin matrix were investigated. The conductive adhesive with AG-80 as the resin matrix has the shorter curing time (20min), lower curing temperature (90°C) and higher adhesion strength (7.6MPa). The resistivity of AG-80 sample has the lower value (2.13 × 10-4Ω·cm) than the 618 sample (4.44 × 10-4Ω·cm).

Complete hazard ranking to analyze right-censored data: An ALS survival study.

Science.gov (United States)

Huang, Zhengnan; Zhang, Hongjiu; Boss, Jonathan; Goutman, Stephen A; Mukherjee, Bhramar; Dinov, Ivo D; Guan, Yuanfang

2017-12-01

Survival analysis represents an important outcome measure in clinical research and clinical trials; further, survival ranking may offer additional advantages in clinical trials. In this study, we developed GuanRank, a non-parametric ranking-based technique to transform patients' survival data into a linear space of hazard ranks. The transformation enables the utilization of machine learning base-learners including Gaussian process regression, Lasso, and random forest on survival data. The method was submitted to the DREAM Amyotrophic Lateral Sclerosis (ALS) Stratification Challenge. Ranked first place, the model gave more accurate ranking predictions on the PRO-ACT ALS dataset in comparison to Cox proportional hazard model. By utilizing right-censored data in its training process, the method demonstrated its state-of-the-art predictive power in ALS survival ranking. Its feature selection identified multiple important factors, some of which conflicts with previous studies.

The role of IGCC technology in power generation using low-rank coal

Energy Technology Data Exchange (ETDEWEB)

Juangjandee, Pipat

2010-09-15

Based on basic test results on the gasification rate of Mae Moh lignite coal. It was found that an IDGCC power plant is the most suitable for Mae Moh lignite. In conclusion, the future of an IDGCC power plant using low-rank coal in Mae Moh mine would hinge on the strictness of future air pollution control regulations including green-house gas emission and the constraint of Thailand's foreign currency reserves needed to import fuels, in addition to economic consideration. If and when it is necessary to overcome these obstacles, IGCC is one variable alternative power generation must consider.

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

International Nuclear Information System (INIS)

Rai, Prashant; Sargsyan, Khachik; Najm, Habib; Hermes, Matthew R.; Hirata, So

2017-01-01

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.

Relationship between Particle Size Distribution of Low-Rank Pulverized Coal and Power Plant Performance

Directory of Open Access Journals (Sweden)

Rajive Ganguli

2012-01-01

Full Text Available The impact of particle size distribution (PSD of pulverized, low rank high volatile content Alaska coal on combustion related power plant performance was studied in a series of field scale tests. Performance was gauged through efficiency (ratio of megawatt generated to energy consumed as coal, emissions (SO2, NOx, CO, and carbon content of ash (fly ash and bottom ash. The study revealed that the tested coal could be burned at a grind as coarse as 50% passing 76 microns, with no deleterious impact on power generation and emissions. The PSD’s tested in this study were in the range of 41 to 81 percent passing 76 microns. There was negligible correlation between PSD and the followings factors: efficiency, SO2, NOx, and CO. Additionally, two tests where stack mercury (Hg data was collected, did not demonstrate any real difference in Hg emissions with PSD. The results from the field tests positively impacts pulverized coal power plants that burn low rank high volatile content coals (such as Powder River Basin coal. These plants can potentially reduce in-plant load by grinding the coal less (without impacting plant performance on emissions and efficiency and thereby, increasing their marketability.

Exploiting Data Sparsity for Large-Scale Matrix Computations

KAUST Repository

Akbudak, Kadir

2018-02-24

Exploiting data sparsity in dense matrices is an algorithmic bridge between architectures that are increasingly memory-austere on a per-core basis and extreme-scale applications. The Hierarchical matrix Computations on Manycore Architectures (HiCMA) library tackles this challenging problem by achieving significant reductions in time to solution and memory footprint, while preserving a specified accuracy requirement of the application. HiCMA provides a high-performance implementation on distributed-memory systems of one of the most widely used matrix factorization in large-scale scientific applications, i.e., the Cholesky factorization. It employs the tile low-rank data format to compress the dense data-sparse off-diagonal tiles of the matrix. It then decomposes the matrix computations into interdependent tasks and relies on the dynamic runtime system StarPU for asynchronous out-of-order scheduling, while allowing high user-productivity. Performance comparisons and memory footprint on matrix dimensions up to eleven million show a performance gain and memory saving of more than an order of magnitude for both metrics on thousands of cores, against state-of-the-art open-source and vendor optimized numerical libraries. This represents an important milestone in enabling large-scale matrix computations toward solving big data problems in geospatial statistics for climate/weather forecasting applications.

Exploiting Data Sparsity for Large-Scale Matrix Computations

KAUST Repository

Akbudak, Kadir; Ltaief, Hatem; Mikhalev, Aleksandr; Charara, Ali; Keyes, David E.

2018-01-01

Exploiting data sparsity in dense matrices is an algorithmic bridge between architectures that are increasingly memory-austere on a per-core basis and extreme-scale applications. The Hierarchical matrix Computations on Manycore Architectures (HiCMA) library tackles this challenging problem by achieving significant reductions in time to solution and memory footprint, while preserving a specified accuracy requirement of the application. HiCMA provides a high-performance implementation on distributed-memory systems of one of the most widely used matrix factorization in large-scale scientific applications, i.e., the Cholesky factorization. It employs the tile low-rank data format to compress the dense data-sparse off-diagonal tiles of the matrix. It then decomposes the matrix computations into interdependent tasks and relies on the dynamic runtime system StarPU for asynchronous out-of-order scheduling, while allowing high user-productivity. Performance comparisons and memory footprint on matrix dimensions up to eleven million show a performance gain and memory saving of more than an order of magnitude for both metrics on thousands of cores, against state-of-the-art open-source and vendor optimized numerical libraries. This represents an important milestone in enabling large-scale matrix computations toward solving big data problems in geospatial statistics for climate/weather forecasting applications.

Distance-Ranked Fault Identification of Reconfigurable Hardware Bitstreams via Functional Input

Directory of Open Access Journals (Sweden)

Naveed Imran

2014-01-01

Full Text Available Distance-Ranked Fault Identification (DRFI is a dynamic reconfiguration technique which employs runtime inputs to conduct online functional testing of fielded FPGA logic and interconnect resources without test vectors. At design time, a diverse set of functionally identical bitstream configurations are created which utilize alternate hardware resources in the FPGA fabric. An ordering is imposed on the configuration pool as updated by the PageRank indexing precedence. The configurations which utilize permanently damaged resources and hence manifest discrepant outputs, receive lower rank are thus less preferred for instantiation on the FPGA. Results indicate accurate identification of fault-free configurations in a pool of pregenerated bitstreams with a low number of reconfigurations and input evaluations. For MCNC benchmark circuits, the observed reduction in input evaluations is up to 75% when comparing the DRFI technique to unguided evaluation. The DRFI diagnosis method is seen to isolate all 14 healthy configurations from a pool of 100 pregenerated configurations, and thereby offering a 100% isolation accuracy provided the fault-free configurations exist in the design pool. When a complete recovery is not feasible, graceful degradation may be realized which is demonstrated by the PSNR improvement of images processed in a video encoder case study.

Catalytic briquettes from low-rank coal for NO reduction

Energy Technology Data Exchange (ETDEWEB)

A. Boyano; M.E. Galvez; R. Moliner; M.J. Lazaro [Instituto de Carboquimica, CSIC, Zaragoza (Spain)

2007-07-01

The briquetting is one of the most ancient and widespread techniques of coal agglomeration which is nowadays becoming useless for combustion home applications. However, the social increasing interest in environmental protection opens new applications to this technique, especially in developed countries. In this work, a series of catalytic briquettes were prepared from low-rank Spanish coal and commercial pitch by means of a pressure agglomeration method. After that, they were cured in air and doped by equilibrium impregnation with vanadium compounds. Preparation conditions (especially those of activation and oxidizing process) were changed to study their effects on catalytic behaviour. Catalytic briquettes showed a relative high NO conversion at low temperatures in all cases, however, a strong relation between the preparation process and the reached NO conversion was observed. Preparation procedure has an effect not only on the NO reduction efficiency but also on the mechanical strength of the briquettes as a consequence of the structural and chemical changes carried out during the activation and oxidation procedures. Generally speaking mechanical resistance is enhanced by an optimal porous volume and the creation of new carboxyl groups on surface. Just on the contrary, NO reduction is promoted by high microporous structures and higher amounts of surface oxygen groups. Both facts force to find an optimum point in the preparation produce which will depend on the application. 24 refs., 4 figs., 3 tabs.

Extensions of linear-quadratic control, optimization and matrix theory

CERN Document Server

Jacobson, David H

1977-01-01

In this book, we study theoretical and practical aspects of computing methods for mathematical modelling of nonlinear systems. A number of computing techniques are considered, such as methods of operator approximation with any given accuracy; operator interpolation techniques including a non-Lagrange interpolation; methods of system representation subject to constraints associated with concepts of causality, memory and stationarity; methods of system representation with an accuracy that is the best within a given class of models; methods of covariance matrix estimation;methods for low-rank mat

Complete hazard ranking to analyze right-censored data: An ALS survival study.

Directory of Open Access Journals (Sweden)

Zhengnan Huang

2017-12-01

Full Text Available Survival analysis represents an important outcome measure in clinical research and clinical trials; further, survival ranking may offer additional advantages in clinical trials. In this study, we developed GuanRank, a non-parametric ranking-based technique to transform patients' survival data into a linear space of hazard ranks. The transformation enables the utilization of machine learning base-learners including Gaussian process regression, Lasso, and random forest on survival data. The method was submitted to the DREAM Amyotrophic Lateral Sclerosis (ALS Stratification Challenge. Ranked first place, the model gave more accurate ranking predictions on the PRO-ACT ALS dataset in comparison to Cox proportional hazard model. By utilizing right-censored data in its training process, the method demonstrated its state-of-the-art predictive power in ALS survival ranking. Its feature selection identified multiple important factors, some of which conflicts with previous studies.

Rovibrational matrix elements of the multipole moments

Indian Academy of Sciences (India)

Rovibrational matrix elements of the multipole moments ℓ up to rank 10 and of the linear polarizability of the H2 molecule in the condensed phase have been computed taking into account the effect of the intermolecular potential. Comparison with gas phase matrix elements shows that the effect of solid state interactions is ...

Ion-exchanged calcium from calcium carbonate and low-rank coals: high catalytic activity in steam gasification

Energy Technology Data Exchange (ETDEWEB)

Ohtsuka, Y.; Asami, K. [Tokoku University, Sendai (Japan). Inst. for Chemical Reaction Science

1996-03-01

Interactions between CaCO{sub 3} and low-rank coals were examined, and the steam gasification of the resulting Ca-loaded coals was carried out at 973 K with a thermobalance. Chemical analysis and FT-IR spectra show that CaCO{sub 3} can react readily with COOH groups to form ion-exchanged Ca and CO{sub 2} when mixed with brown coal in water at room temperature. The extent of the exchange is dependent on the crystalline form of CaCO{sub 3}, and higher for aragonite naturally present in seashells and coral reef than for calcite from limestone. The FT-IR spectra reveal that ion-exchange reactions also proceed during kneading CaCO{sub 3} with low-rank coals. The exchanged Ca promotes gasification and achieves 40-60 fold rate enhancement for brown coal with a lower content of inherent minerals. Catalyst effectiveness of kneaded CaCO{sub 3} depends on the coal type, in other words, the extent of ion exchange. 11 refs., 7 figs., 3 tabs.

An R package for analyzing and modeling ranking data.

Science.gov (United States)

Lee, Paul H; Yu, Philip L H

2013-05-14

In medical informatics, psychology, market research and many other fields, researchers often need to analyze and model ranking data. However, there is no statistical software that provides tools for the comprehensive analysis of ranking data. Here, we present pmr, an R package for analyzing and modeling ranking data with a bundle of tools. The pmr package enables descriptive statistics (mean rank, pairwise frequencies, and marginal matrix), Analytic Hierarchy Process models (with Saaty's and Koczkodaj's inconsistencies), probability models (Luce model, distance-based model, and rank-ordered logit model), and the visualization of ranking data with multidimensional preference analysis. Examples of the use of package pmr are given using a real ranking dataset from medical informatics, in which 566 Hong Kong physicians ranked the top five incentives (1: competitive pressures; 2: increased savings; 3: government regulation; 4: improved efficiency; 5: improved quality care; 6: patient demand; 7: financial incentives) to the computerization of clinical practice. The mean rank showed that item 4 is the most preferred item and item 3 is the least preferred item, and significance difference was found between physicians' preferences with respect to their monthly income. A multidimensional preference analysis identified two dimensions that explain 42% of the total variance. The first can be interpreted as the overall preference of the seven items (labeled as "internal/external"), and the second dimension can be interpreted as their overall variance of (labeled as "push/pull factors"). Various statistical models were fitted, and the best were found to be weighted distance-based models with Spearman's footrule distance. In this paper, we presented the R package pmr, the first package for analyzing and modeling ranking data. The package provides insight to users through descriptive statistics of ranking data. Users can also visualize ranking data by applying a thought

A quantitative experimental paradigm to optimize construction of rank order lists in the National Resident Matching Program: the ROSS-MOORE approach.

Science.gov (United States)

Ross, David A; Moore, Edward Z

2013-09-01

As part of the National Resident Matching Program, programs must submit a rank order list of desired applicants. Despite the importance of this process and the numerous manifest limitations with traditional approaches, minimal research has been conducted to examine the accuracy of different ranking strategies. The authors developed the Moore Optimized Ordinal Rank Estimator (MOORE), a novel algorithm for ranking applicants that is based on college sports ranking systems. Because it is not possible to study the Match in vivo, the authors then designed the Recruitment Outcomes Simulation System (ROSS). This program was used to simulate a series of interview seasons and to compare MOORE and traditional approaches under different conditions. The accuracy of traditional ranking and the MOORE approach are equally and adversely affected with higher levels of intrarater variability. However, compared with traditional ranking methods, MOORE produces a more accurate rank order list as interrater variability increases. The present data demonstrate three key findings. First, they provide proof of concept that it is possible to scientifically test the accuracy of different rank methods used in the Match. Second, they show that small amounts of variability can have a significant adverse impact on the accuracy of rank order lists. Finally, they demonstrate that an ordinal approach may lead to a more accurate rank order list in the presence of interviewer bias. The ROSS-MOORE approach offers programs a novel way to optimize the recruitment process and, potentially, to construct a more accurate rank order list.

Rank Dynamics

Science.gov (United States)

Gershenson, Carlos

Studies of rank distributions have been popular for decades, especially since the work of Zipf. For example, if we rank words of a given language by use frequency (most used word in English is 'the', rank 1; second most common word is 'of', rank 2), the distribution can be approximated roughly with a power law. The same applies for cities (most populated city in a country ranks first), earthquakes, metabolism, the Internet, and dozens of other phenomena. We recently proposed ``rank diversity'' to measure how ranks change in time, using the Google Books Ngram dataset. Studying six languages between 1800 and 2009, we found that the rank diversity curves of languages are universal, adjusted with a sigmoid on log-normal scale. We are studying several other datasets (sports, economies, social systems, urban systems, earthquakes, artificial life). Rank diversity seems to be universal, independently of the shape of the rank distribution. I will present our work in progress towards a general description of the features of rank change in time, along with simple models which reproduce it

Sparse Reduced-Rank Regression for Simultaneous Dimension Reduction and Variable Selection

KAUST Repository

Chen, Lisha; Huang, Jianhua Z.

2012-01-01

and hence improves predictive accuracy. We propose to select relevant variables for reduced-rank regression by using a sparsity-inducing penalty. We apply a group-lasso type penalty that treats each row of the matrix of the regression coefficients as a group

A Novel Measurement Matrix Optimization Approach for Hyperspectral Unmixing

Directory of Open Access Journals (Sweden)

Su Xu

2017-01-01

Full Text Available Each pixel in the hyperspectral unmixing process is modeled as a linear combination of endmembers, which can be expressed in the form of linear combinations of a number of pure spectral signatures that are known in advance. However, the limitation of Gaussian random variables on its computational complexity or sparsity affects the efficiency and accuracy. This paper proposes a novel approach for the optimization of measurement matrix in compressive sensing (CS theory for hyperspectral unmixing. Firstly, a new Toeplitz-structured chaotic measurement matrix (TSCMM is formed by pseudo-random chaotic elements, which can be implemented by a simple hardware; secondly, rank revealing QR factorization with eigenvalue decomposition is presented to speed up the measurement time; finally, orthogonal gradient descent method for measurement matrix optimization is used to achieve optimal incoherence. Experimental results demonstrate that the proposed approach can lead to better CS reconstruction performance with low extra computational cost in hyperspectral unmixing.

Promoting effect of various biomass ashes on the steam gasification of low-rank coal

International Nuclear Information System (INIS)

Rizkiana, Jenny; Guan, Guoqing; Widayatno, Wahyu Bambang; Hao, Xiaogang; Li, Xiumin; Huang, Wei; Abudula, Abuliti

2014-01-01

Highlights: • Biomass ash was utilized to promote gasification of low rank coal. • Promoting effect of biomass ash highly depended on AAEM content in the ash. • Stability of the ash could be improved by maintaining AAEM amount in the ash. • Different biomass ash could have completely different catalytic activity. - Abstract: Application of biomass ash as a catalyst to improve gasification rate is a promising way for the effective utilization of waste ash as well as for the reduction of cost. Investigation on the catalytic activity of biomass ash to the gasification of low rank coal was performed in details in the present study. Ashes from 3 kinds of biomass, i.e. brown seaweed/BS, eel grass/EG, and rice straw/RS, were separately mixed with coal sample and gasified in a fixed bed downdraft reactor using steam as the gasifying agent. BS and EG ashes enhanced the gas production rate greater than RS ash. Higher catalytic activity of BS or EG ash was mainly attributed to the higher content of alkali and alkaline earth metal (AAEM) and lower content of silica in it. Higher content of silica in the RS ash was identified to have inhibiting effect for the steam gasification of coal. Stable catalytic activity was remained when the amount of AAEM in the regenerated ash was maintained as that of the original one

Perils of parsimony: properties of reduced-rank estimates of genetic covariance matrices.

Science.gov (United States)

Meyer, Karin; Kirkpatrick, Mark

2008-10-01

Eigenvalues and eigenvectors of covariance matrices are important statistics for multivariate problems in many applications, including quantitative genetics. Estimates of these quantities are subject to different types of bias. This article reviews and extends the existing theory on these biases, considering a balanced one-way classification and restricted maximum-likelihood estimation. Biases are due to the spread of sample roots and arise from ignoring selected principal components when imposing constraints on the parameter space, to ensure positive semidefinite estimates or to estimate covariance matrices of chosen, reduced rank. In addition, it is shown that reduced-rank estimators that consider only the leading eigenvalues and -vectors of the "between-group" covariance matrix may be biased due to selecting the wrong subset of principal components. In a genetic context, with groups representing families, this bias is inverse proportional to the degree of genetic relationship among family members, but is independent of sample size. Theoretical results are supplemented by a simulation study, demonstrating close agreement between predicted and observed bias for large samples. It is emphasized that the rank of the genetic covariance matrix should be chosen sufficiently large to accommodate all important genetic principal components, even though, paradoxically, this may require including a number of components with negligible eigenvalues. A strategy for rank selection in practical analyses is outlined.

PageRank tracker: from ranking to tracking.

Science.gov (United States)

Gong, Chen; Fu, Keren; Loza, Artur; Wu, Qiang; Liu, Jia; Yang, Jie

2014-06-01

Video object tracking is widely used in many real-world applications, and it has been extensively studied for over two decades. However, tracking robustness is still an issue in most existing methods, due to the difficulties with adaptation to environmental or target changes. In order to improve adaptability, this paper formulates the tracking process as a ranking problem, and the PageRank algorithm, which is a well-known webpage ranking algorithm used by Google, is applied. Labeled and unlabeled samples in tracking application are analogous to query webpages and the webpages to be ranked, respectively. Therefore, determining the target is equivalent to finding the unlabeled sample that is the most associated with existing labeled set. We modify the conventional PageRank algorithm in three aspects for tracking application, including graph construction, PageRank vector acquisition and target filtering. Our simulations with the use of various challenging public-domain video sequences reveal that the proposed PageRank tracker outperforms mean-shift tracker, co-tracker, semiboosting and beyond semiboosting trackers in terms of accuracy, robustness and stability.

Mini-lecture course: Introduction into hierarchical matrix technique

KAUST Repository

Litvinenko, Alexander

2017-12-14

The H-matrix format has a log-linear computational cost and storage O(kn log n), where the rank k is a small integer and n is the number of locations (mesh points). The H-matrix technique allows us to work with general class of matrices (not only structured or Toeplits or sparse). H-matrices can keep the H-matrix data format during linear algebra operations (inverse, update, Schur complement).

Batched QR and SVD Algorithms on GPUs with Applications in Hierarchical Matrix Compression

KAUST Repository

Halim Boukaram, Wajih

2017-09-14

We present high performance implementations of the QR and the singular value decomposition of a batch of small matrices hosted on the GPU with applications in the compression of hierarchical matrices. The one-sided Jacobi algorithm is used for its simplicity and inherent parallelism as a building block for the SVD of low rank blocks using randomized methods. We implement multiple kernels based on the level of the GPU memory hierarchy in which the matrices can reside and show substantial speedups against streamed cuSOLVER SVDs. The resulting batched routine is a key component of hierarchical matrix compression, opening up opportunities to perform H-matrix arithmetic efficiently on GPUs.

Batched QR and SVD Algorithms on GPUs with Applications in Hierarchical Matrix Compression

KAUST Repository

Halim Boukaram, Wajih; Turkiyyah, George; Ltaief, Hatem; Keyes, David E.

2017-01-01

We present high performance implementations of the QR and the singular value decomposition of a batch of small matrices hosted on the GPU with applications in the compression of hierarchical matrices. The one-sided Jacobi algorithm is used for its simplicity and inherent parallelism as a building block for the SVD of low rank blocks using randomized methods. We implement multiple kernels based on the level of the GPU memory hierarchy in which the matrices can reside and show substantial speedups against streamed cuSOLVER SVDs. The resulting batched routine is a key component of hierarchical matrix compression, opening up opportunities to perform H-matrix arithmetic efficiently on GPUs.

The optimizied expansion method for wavefield extrapolation

KAUST Repository

Wu, Zedong

2013-01-01

Spectral methods are fast becoming an indispensable tool for wave-field extrapolation, especially in anisotropic media, because of its dispersion and artifact free, as well as highly accurate, solutions of the wave equation. However, for inhomogeneous media, we face difficulties in dealing with the mixed space-wavenumber domain operator.In this abstract, we propose an optimized expansion method that can approximate this operator with its low rank representation. The rank defines the number of inverse FFT required per time extrapolation step, and thus, a lower rank admits faster extrapolations. The method uses optimization instead of matrix decomposition to find the optimal wavenumbers and velocities needed to approximate the full operator with its low rank representation.Thus,we obtain more accurate wave-fields using lower rank representation, and thus cheaper extrapolations. The optimization operation to define the low rank representation depends only on the velocity model, and this is done only once, and valid for a full reverse time migration (many shots) or one iteration of full waveform inversion. Applications on the BP model yielded superior results than those obtained using the decomposition approach. For transversely isotopic media, the solutions were free of the shear wave artifacts, and does not require that eta>0.

Construction and decoding of matrix-product codes from nested codes

DEFF Research Database (Denmark)

Hernando, Fernando; Lally, Kristine; Ruano, Diego

2009-01-01

We consider matrix-product codes [C1 ... Cs] · A, where C1, ..., Cs  are nested linear codes and matrix A has full rank. We compute their minimum distance and provide a decoding algorithm when A is a non-singular by columns matrix. The decoding algorithm decodes up to half of the minimum distance....

Evidence of low molecular weight components in the organic matrix of the reef building coral, Stylophora pistillata.

Science.gov (United States)

Puverel, S; Houlbrèque, F; Tambutté, E; Zoccola, D; Payan, P; Caminiti, N; Tambutté, S; Allemand, D

2007-08-01

Biominerals contain both inorganic and organic components. Organic components are collectively termed the organic matrix, and this matrix has been reported to play a crucial role in mineralization. Several matrix proteins have been characterized in vertebrates, but only a few in invertebrates, primarily in Molluscs and Echinoderms. Methods classically used to extract organic matrix proteins eliminate potential low molecular weight matrix components, since cut-offs ranging from 3.5 to 10 kDa are used to desalt matrix extracts. Consequently, the presence of such components remains unknown and these are never subjected to further analyses. In the present study, we have used microcolonies from the Scleractinian coral Stylophora pistillata to study newly synthesized matrix components by labelling them with 14C-labelled amino acids. Radioactive matrix components were investigated by a method in which both total organic matrix and fractions of matrix below and above 5 kDa were analyzed. Using this method and SDS-PAGE analyses, we were able to detect the presence of low molecular mass matrix components (weight molecules, these probably form the bulk of newly synthesized organic matrix components. Our results suggest that these low molecular weight components may be peptides, which can be involved in the regulation of coral skeleton mineralization.

Reducing the rank of gauge groups in orbifold compactification

International Nuclear Information System (INIS)

Sato, Hikaru

1989-01-01

The report introduces general twisted boundary conditions on fermionic string variables and shows that a non-Abelian embedding is possible when background gauge field is introduced on orbifold. This leads to reduction of the rank of the gauge group. The report presents a procedure to obtain the lower-rank gauge groups by the use of non-Abelian Wilson lines. The unbroken gauge group is essentially determined by the eigen vector which should obey the level-matching conditions. The gauge symmetry is determined by certain conditions. In a particular application, it is not necessary to introduce explicit form of the non-Abelian Wilson lines. The procedure starts with introduction of desired eigen vectors which are supposed to be obtained by diagonalization of the boundary conditions with the appropriate transformation matrix. The rank is reduced by one by using the Wilson lines which transform as 3 of SU(2) R or SU(2) in SU(4). A possible way of reducing the rank by two is to use the Wilson lines from SU(2) R x SU(2) or SU(3) in SU(4). The rank is reduced by three by means of the Wilson lines which transform as SU(4) or SU(2) R SU(3). Finally the rank is reduced by four when the Wilson lines with full symmetry of SU(2) R x SU(4) are used. The report tabulates the possible lower-rank gauge groups obtained by the proposed method. Massless fermions corresponding to the eigen vectors are also listed. (N.K.)

Robust Face Recognition via Multi-Scale Patch-Based Matrix Regression.

Directory of Open Access Journals (Sweden)

Guangwei Gao

Full Text Available In many real-world applications such as smart card solutions, law enforcement, surveillance and access control, the limited training sample size is the most fundamental problem. By making use of the low-rank structural information of the reconstructed error image, the so-called nuclear norm-based matrix regression has been demonstrated to be effective for robust face recognition with continuous occlusions. However, the recognition performance of nuclear norm-based matrix regression degrades greatly in the face of the small sample size problem. An alternative solution to tackle this problem is performing matrix regression on each patch and then integrating the outputs from all patches. However, it is difficult to set an optimal patch size across different databases. To fully utilize the complementary information from different patch scales for the final decision, we propose a multi-scale patch-based matrix regression scheme based on which the ensemble of multi-scale outputs can be achieved optimally. Extensive experiments on benchmark face databases validate the effectiveness and robustness of our method, which outperforms several state-of-the-art patch-based face recognition algorithms.

Correction of failure in antenna array using matrix pencil technique

International Nuclear Information System (INIS)

Khan, SU; Rahim, MKA

2017-01-01

In this paper a non-iterative technique is developed for the correction of faulty antenna array based on matrix pencil technique (MPT). The failure of a sensor in antenna array can damage the radiation power pattern in terms of sidelobes level and nulls. In the developed technique, the radiation pattern of the array is sampled to form discrete power pattern information set. Then this information set can be arranged in the form of Hankel matrix (HM) and execute the singular value decomposition (SVD). By removing nonprincipal values, we obtain an optimum lower rank estimation of HM. This lower rank matrix corresponds to the corrected pattern. Then the proposed technique is employed to recover the weight excitation and position allocations from the estimated matrix. Numerical simulations confirm the efficiency of the proposed technique, which is compared with the available techniques in terms of sidelobes level and nulls. (paper)

Recognition of Risk Information - Adaptation of J. Bertin's Orderable Matrix for social communication

Science.gov (United States)

Ishida, Keiichi

2018-05-01

This paper aims to show capability of the Orderable Matrix of Jacques Bertin which is a visualization method of data analyze and/or a method to recognize data. That matrix can show the data by replacing numbers to visual element. As an example, using a set of data regarding natural hazard rankings for certain metropolitan cities in the world, this paper describes how the Orderable Matrix handles the data set and show characteristic factors of this data to understand it. Not only to see a kind of risk ranking of cities, the Orderable Matrix shows how differently danger concerned cities ones and others are. Furthermore, we will see that the visualized data by Orderable Matrix allows us to see the characteristics of the data set comprehensively and instantaneously.

Homocomposites of chopped fluorinated polyethylene fiber with low-density polyethylene matrix

International Nuclear Information System (INIS)

Maity, J.; Jacob, C.; Das, C.K.; Alam, S.; Singh, R.P.

2008-01-01

Conventional composites are generally prepared by adding reinforcing agent to a matrix and the matrix wherein the reinforcing agents are different in chemical composition with the later having superior mechanical properties. This work presents the preparation and properties of homocomposites consisting of a low-density polyethylene (LDPE) matrix and an ultra high molecular weight polyethylene (UHMWPE) fiber reinforcing phase. Direct fluorination is an important surface modification process by which only a thin upper layer is modified, the bulk properties of the polymer remaining unchanged. In this work, surface fluorination of UHMWPE fiber was done and then fiber characterization was performed. It was observed that after fluorination the fiber surface became rough. Composites were then prepared using both fluorinated and non-fluorinated polyethylene fiber with a low-density polyethylene (LDPE) matrix to prepare single polymer composites. It was found that the thermal stability and mechanical properties were improved for fluorinated fiber composites. X-ray diffraction (XRD) analysis showed that the crystallinity of the composites increased and it is maximum for fluorinated fiber composites. Tensile strength (TS) and modulus also increased while elongation at break (EB) decreased for fiber composites and was a maximum for fluorinated fiber composites. Scanning electron microscopic analysis indicates that that the distribution of fiber into the matrix is homogeneous. It also indicates the better adhesion between the matrix and the reinforcing agent for modified fiber composites. We also did surface fluorination of the prepared composites and base polymer for knowing its application to different fields such as printability wettability, etc. To determine the various properties such as printability, wettability and adhesion properties, contact angle measurement was done. It was observed that the surface energies of surface modified composites and base polymer increases

Link Prediction via Convex Nonnegative Matrix Factorization on Multiscale Blocks

Directory of Open Access Journals (Sweden)

Enming Dong

2014-01-01

Full Text Available Low rank matrices approximations have been used in link prediction for networks, which are usually global optimal methods and lack of using the local information. The block structure is a significant local feature of matrices: entities in the same block have similar values, which implies that links are more likely to be found within dense blocks. We use this insight to give a probabilistic latent variable model for finding missing links by convex nonnegative matrix factorization with block detection. The experiments show that this method gives better prediction accuracy than original method alone. Different from the original low rank matrices approximations methods for link prediction, the sparseness of solutions is in accord with the sparse property for most real complex networks. Scaling to massive size network, we use the block information mapping matrices onto distributed architectures and give a divide-and-conquer prediction method. The experiments show that it gives better results than common neighbors method when the networks have a large number of missing links.

Decomposing tensors with structured matrix factors reduces to rank-1 approximations

DEFF Research Database (Denmark)

Comon, Pierre; Sørensen, Mikael; Tsigaridas, Elias

2010-01-01

Tensor decompositions permit to estimate in a deterministic way the parameters in a multi-linear model. Applications have been already pointed out in antenna array processing and digital communications, among others, and are extremely attractive provided some diversity at the receiver is availabl....... As opposed to the widely used ALS algorithm, non-iterative algorithms are proposed in this paper to compute the required tensor decomposition into a sum of rank-1 terms, when some factor matrices enjoy some structure, such as block-Hankel, triangular, band, etc....

Non-intrusive low-rank separated approximation of high-dimensional stochastic models

KAUST Repository

Doostan, Alireza; Validi, AbdoulAhad; Iaccarino, Gianluca

2013-01-01

This work proposes a sampling-based (non-intrusive) approach within the context of low-. rank separated representations to tackle the issue of curse-of-dimensionality associated with the solution of models, e.g., PDEs/ODEs, with high-dimensional random inputs. Under some conditions discussed in details, the number of random realizations of the solution, required for a successful approximation, grows linearly with respect to the number of random inputs. The construction of the separated representation is achieved via a regularized alternating least-squares regression, together with an error indicator to estimate model parameters. The computational complexity of such a construction is quadratic in the number of random inputs. The performance of the method is investigated through its application to three numerical examples including two ODE problems with high-dimensional random inputs. © 2013 Elsevier B.V.

Non-intrusive low-rank separated approximation of high-dimensional stochastic models

KAUST Repository

Doostan, Alireza

2013-08-01

This work proposes a sampling-based (non-intrusive) approach within the context of low-. rank separated representations to tackle the issue of curse-of-dimensionality associated with the solution of models, e.g., PDEs/ODEs, with high-dimensional random inputs. Under some conditions discussed in details, the number of random realizations of the solution, required for a successful approximation, grows linearly with respect to the number of random inputs. The construction of the separated representation is achieved via a regularized alternating least-squares regression, together with an error indicator to estimate model parameters. The computational complexity of such a construction is quadratic in the number of random inputs. The performance of the method is investigated through its application to three numerical examples including two ODE problems with high-dimensional random inputs. © 2013 Elsevier B.V.

Matrix and Tensor Completion on a Human Activity Recognition Framework.

Science.gov (United States)

Savvaki, Sofia; Tsagkatakis, Grigorios; Panousopoulou, Athanasia; Tsakalides, Panagiotis

2017-11-01

Sensor-based activity recognition is encountered in innumerable applications of the arena of pervasive healthcare and plays a crucial role in biomedical research. Nonetheless, the frequent situation of unobserved measurements impairs the ability of machine learning algorithms to efficiently extract context from raw streams of data. In this paper, we study the problem of accurate estimation of missing multimodal inertial data and we propose a classification framework that considers the reconstruction of subsampled data during the test phase. We introduce the concept of forming the available data streams into low-rank two-dimensional (2-D) and 3-D Hankel structures, and we exploit data redundancies using sophisticated imputation techniques, namely matrix and tensor completion. Moreover, we examine the impact of reconstruction on the classification performance by experimenting with several state-of-the-art classifiers. The system is evaluated with respect to different data structuring scenarios, the volume of data available for reconstruction, and various levels of missing values per device. Finally, the tradeoff between subsampling accuracy and energy conservation in wearable platforms is examined. Our analysis relies on two public datasets containing inertial data, which extend to numerous activities, multiple sensing parameters, and body locations. The results highlight that robust classification accuracy can be achieved through recovery, even for extremely subsampled data streams.

Optimal reduced-rank quadratic classifiers using the Fukunaga-Koontz transform with applications to automated target recognition

Science.gov (United States)

Huo, Xiaoming; Elad, Michael; Flesia, Ana G.; Muise, Robert R.; Stanfill, S. Robert; Friedman, Jerome; Popescu, Bogdan; Chen, Jihong; Mahalanobis, Abhijit; Donoho, David L.

2003-09-01

In target recognition applications of discriminant of classification analysis, each 'feature' is a result of a convolution of an imagery with a filter, which may be derived from a feature vector. It is important to use relatively few features. We analyze an optimal reduced-rank classifier under the two-class situation. Assuming each population is Gaussian and has zero mean, and the classes differ through the covariance matrices: ∑1 and ∑2. The following matrix is considered: Λ=(∑1+∑2)-1/2∑1(∑1+∑2)-1/2. We show that the k eigenvectors of this matrix whose eigenvalues are most different from 1/2 offer the best rank k approximation to the maximum likelihood classifier. The matrix Λ and its eigenvectors have been introduced by Fukunaga and Koontz; hence this analysis gives a new interpretation of the well known Fukunaga-Koontz transform. The optimality that is promised in this method hold if the two populations are exactly Guassian with the same means. To check the applicability of this approach to real data, an experiment is performed, in which several 'modern' classifiers were used on an Infrared ATR data. In these experiments, a reduced-rank classifier-Tuned Basis Functions-outperforms others. The competitive performance of the optimal reduced-rank quadratic classifier suggests that, at least for classification purposes, the imagery data behaves in a nearly-Gaussian fashion.

Matrix Factorisation-based Calibration For Air Quality Crowd-sensing

Science.gov (United States)

Dorffer, Clement; Puigt, Matthieu; Delmaire, Gilles; Roussel, Gilles; Rouvoy, Romain; Sagnier, Isabelle

2017-04-01

sensors share some information using the APISENSE® crowdsensing platform and we aim to calibrate the sensor responses from the data directly. For that purpose, we express the sensor readings as a low-rank matrix with missing entries and we revisit self-calibration as a Matrix Factorization (MF) problem. In our proposed framework, one factor matrix contains the calibration parameters while the other is structured by the calibration model and contains some values of the sensed phenomenon. The MF calibration approach also uses the precise measurements from ATMO—the French public institution—to drive the calibration of the mobile sensors. MF calibration can be improved using, e.g., the mean calibration parameters provided by the sensor manufacturers, or using sparse priors or a model of the physical phenomenon. All our approaches are shown to provide a better calibration accuracy than matrix-completion-based and robust-regression-based methods, even in difficult scenarios involving a lot of missing data and/or very few accurate references. When combined with a dictionary of air quality patterns, our experiments suggest that MF is not only able to perform sensor network calibration but also to provide detailed maps of air quality.

Leveraging Multiactions to Improve Medical Personalized Ranking for Collaborative Filtering

Directory of Open Access Journals (Sweden)

Shan Gao

2017-01-01

Full Text Available Nowadays, providing high-quality recommendation services to users is an essential component in web applications, including shopping, making friends, and healthcare. This can be regarded either as a problem of estimating users’ preference by exploiting explicit feedbacks (numerical ratings, or as a problem of collaborative ranking with implicit feedback (e.g., purchases, views, and clicks. Previous works for solving this issue include pointwise regression methods and pairwise ranking methods. The emerging healthcare websites and online medical databases impose a new challenge for medical service recommendation. In this paper, we develop a model, MBPR (Medical Bayesian Personalized Ranking over multiple users’ actions, based on the simple observation that users tend to assign higher ranks to some kind of healthcare services that are meanwhile preferred in users’ other actions. Experimental results on the real-world datasets demonstrate that MBPR achieves more accurate recommendations than several state-of-the-art methods and shows its generality and scalability via experiments on the datasets from one mobile shopping app.

Leveraging Multiactions to Improve Medical Personalized Ranking for Collaborative Filtering.

Science.gov (United States)

Gao, Shan; Guo, Guibing; Li, Runzhi; Wang, Zongmin

2017-01-01

Nowadays, providing high-quality recommendation services to users is an essential component in web applications, including shopping, making friends, and healthcare. This can be regarded either as a problem of estimating users' preference by exploiting explicit feedbacks (numerical ratings), or as a problem of collaborative ranking with implicit feedback (e.g., purchases, views, and clicks). Previous works for solving this issue include pointwise regression methods and pairwise ranking methods. The emerging healthcare websites and online medical databases impose a new challenge for medical service recommendation. In this paper, we develop a model, MBPR (Medical Bayesian Personalized Ranking over multiple users' actions), based on the simple observation that users tend to assign higher ranks to some kind of healthcare services that are meanwhile preferred in users' other actions. Experimental results on the real-world datasets demonstrate that MBPR achieves more accurate recommendations than several state-of-the-art methods and shows its generality and scalability via experiments on the datasets from one mobile shopping app.

Extracellular oxidases and the transformation of solubilised low-rank coal by wood-rot fungi

Energy Technology Data Exchange (ETDEWEB)

Ralph, J.P. [Flinders Univ. of South Australia, Bedford Park (Australia). School of Biological Sciences; Graham, L.A. [Flinders Univ. of South Australia, Bedford Park (Australia). School of Biological Sciences; Catcheside, D.E.A. [Flinders Univ. of South Australia, Bedford Park (Australia). School of Biological Sciences

1996-12-31

The involvement of extracellular oxidases in biotransformation of low-rank coal was assessed by correlating the ability of nine white-rot and brown-rot fungi to alter macromolecular material in alkali-solubilised brown coal with the spectrum of oxidases they produce when grown on low-nitrogen medium. The coal fraction used was that soluble at 3.0{<=}pH{<=}6.0 (SWC6 coal). In 15-ml cultures, Gloeophyllum trabeum, Lentinus lepideus and Trametes versicolor produced little or no lignin peroxidase, manganese (Mn) peroxidase or laccase activity and caused no change to SWC6 coal. Ganoderma applanatum and Pycnoporus cinnabarinus also produced no detectable lignin or Mn peroxidases or laccase yet increased the absorbance at 400 nm of SWC6 coal. G. applanatum, which produced veratryl alcohol oxidase, also increased the modal apparent molecular mass. SWC6 coal exposed to Merulius tremellosus and Perenniporia tephropora, which secreted Mn peroxidases and laccase and Phanerochaete chrysosporium, which produced Mn and lignin peroxidases was polymerised but had unchanged or decreased absorbance. In the case of both P. chrysosporium and M. tremellosus, polymerisation of SWC6 coal was most extensive, leading to the formation of a complex insoluble in 100 mM NaOH. Rigidoporus ulmarius, which produced only laccase, both polymerised and reduced the A{sub 400} of SWC6 coal. P. chrysosporium, M. tremellosus and P. tephropora grown in 10-ml cultures produced a spectrum of oxidases similar to that in 15-ml cultures but, in each case, caused more extensive loss of A{sub 400}, and P. chrysosporium depolymerised SWC6 coal. It is concluded that the extracellular oxidases of white-rot fungi can transform low-rank coal macromolecules and that increased oxygen availability in the shallower 10-ml cultures favours catabolism over polymerisation. (orig.)

Reducing the rank of gauge groups in orbifold compactification

International Nuclear Information System (INIS)

Sato, H.

1989-01-01

The Wilson-line mechanism in orbifold compactification is investigated for both Abelian and non-Abelian embedding of the Z 3 group in the E 8 x E 8 . The authors give general argument in the fermionic formulation for the gauge degrees of freedom and show that the rank of the gauge group is reduced by introducing nondiagonal Wilson-line matrix in the fermionic boundary conditions

Accurate single-scattering simulation of ice cloud using the invariant-imbedding T-matrix method and the physical-geometric optics method

Science.gov (United States)

Sun, B.; Yang, P.; Kattawar, G. W.; Zhang, X.

2017-12-01

The ice cloud single-scattering properties can be accurately simulated using the invariant-imbedding T-matrix method (IITM) and the physical-geometric optics method (PGOM). The IITM has been parallelized using the Message Passing Interface (MPI) method to remove the memory limitation so that the IITM can be used to obtain the single-scattering properties of ice clouds for sizes in the geometric optics regime. Furthermore, the results associated with random orientations can be analytically achieved once the T-matrix is given. The PGOM is also parallelized in conjunction with random orientations. The single-scattering properties of a hexagonal prism with height 400 (in units of lambda/2*pi, where lambda is the incident wavelength) and an aspect ratio of 1 (defined as the height over two times of bottom side length) are given by using the parallelized IITM and compared to the counterparts using the parallelized PGOM. The two results are in close agreement. Furthermore, the integrated single-scattering properties, including the asymmetry factor, the extinction cross-section, and the scattering cross-section, are given in a completed size range. The present results show a smooth transition from the exact IITM solution to the approximate PGOM result. Because the calculation of the IITM method has reached the geometric regime, the IITM and the PGOM can be efficiently employed to accurately compute the single-scattering properties of ice cloud in a wide spectral range.

Fuzzy Reasoning to More Accurately Determine Void Areas on Optical Micrographs of Composite Structures

Science.gov (United States)

Dominquez, Jesus A.; Tate, Lanetra C.; Wright, M. Clara; Caraccio, Anne

2013-01-01

Accomplishing the best-performing composite matrix (resin) requires that not only the processing method but also the cure cycle generate low-void-content structures. If voids are present, the performance of the composite matrix will be significantly reduced. This is usually noticed by significant reductions in matrix-dominated properties, such as compression and shear strength. Voids in composite materials are areas that are absent of the composite components: matrix and fibers. The characteristics of the voids and their accurate estimation are critical to determine for high performance composite structures. One widely used method of performing void analysis on a composite structure sample is acquiring optical micrographs or Scanning Electron Microscope (SEM) images of lateral sides of the sample and retrieving the void areas within the micrographs/images using an image analysis technique. Segmentation for the retrieval and subsequent computation of void areas within the micrographs/images is challenging as the gray-scaled values of the void areas are close to the gray-scaled values of the matrix leading to the need of manually performing the segmentation based on the histogram of the micrographs/images to retrieve the void areas. The use of an algorithm developed by NASA and based on Fuzzy Reasoning (FR) proved to overcome the difficulty of suitably differentiate void and matrix image areas with similar gray-scaled values leading not only to a more accurate estimation of void areas on composite matrix micrographs but also to a faster void analysis process as the algorithm is fully autonomous.

Simulating propagation of decomposed elastic waves using low-rank approximate mixed-domain integral operators for heterogeneous transversely isotropic media

KAUST Repository

Cheng, Jiubing

2014-08-05

In elastic imaging, the extrapolated vector fields are decomposed into pure wave modes, such that the imaging condition produces interpretable images, which characterize reflectivity of different reflection types. Conventionally, wavefield decomposition in anisotropic media is costly as the operators involved is dependent on the velocity, and thus not stationary. In this abstract, we propose an efficient approach to directly extrapolate the decomposed elastic waves using lowrank approximate mixed space/wavenumber domain integral operators for heterogeneous transverse isotropic (TI) media. The low-rank approximation is, thus, applied to the pseudospectral extrapolation and decomposition at the same time. The pseudo-spectral implementation also allows for relatively large time steps in which the low-rank approximation is applied. Synthetic examples show that it can yield dispersionfree extrapolation of the decomposed quasi-P (qP) and quasi- SV (qSV) modes, which can be used for imaging, as well as the total elastic wavefields.

Equal opportunity for low-degree network nodes: a PageRank-based method for protein target identification in metabolic graphs.

Directory of Open Access Journals (Sweden)

Dániel Bánky

Full Text Available Biological network data, such as metabolic-, signaling- or physical interaction graphs of proteins are increasingly available in public repositories for important species. Tools for the quantitative analysis of these networks are being developed today. Protein network-based drug target identification methods usually return protein hubs with large degrees in the networks as potentially important targets. Some known, important protein targets, however, are not hubs at all, and perturbing protein hubs in these networks may have several unwanted physiological effects, due to their interaction with numerous partners. Here, we show a novel method applicable in networks with directed edges (such as metabolic networks that compensates for the low degree (non-hub vertices in the network, and identifies important nodes, regardless of their hub properties. Our method computes the PageRank for the nodes of the network, and divides the PageRank by the in-degree (i.e., the number of incoming edges of the node. This quotient is the same in all nodes in an undirected graph (even for large- and low-degree nodes, that is, for hubs and non-hubs as well, but may differ significantly from node to node in directed graphs. We suggest to assign importance to non-hub nodes with large PageRank/in-degree quotient. Consequently, our method gives high scores to nodes with large PageRank, relative to their degrees: therefore non-hub important nodes can easily be identified in large networks. We demonstrate that these relatively high PageRank scores have biological relevance: the method correctly finds numerous already validated drug targets in distinct organisms (Mycobacterium tuberculosis, Plasmodium falciparum and MRSA Staphylococcus aureus, and consequently, it may suggest new possible protein targets as well. Additionally, our scoring method was not chosen arbitrarily: its value for all nodes of all undirected graphs is constant; therefore its high value captures

Equal opportunity for low-degree network nodes: a PageRank-based method for protein target identification in metabolic graphs.

Science.gov (United States)

Bánky, Dániel; Iván, Gábor; Grolmusz, Vince

2013-01-01

Biological network data, such as metabolic-, signaling- or physical interaction graphs of proteins are increasingly available in public repositories for important species. Tools for the quantitative analysis of these networks are being developed today. Protein network-based drug target identification methods usually return protein hubs with large degrees in the networks as potentially important targets. Some known, important protein targets, however, are not hubs at all, and perturbing protein hubs in these networks may have several unwanted physiological effects, due to their interaction with numerous partners. Here, we show a novel method applicable in networks with directed edges (such as metabolic networks) that compensates for the low degree (non-hub) vertices in the network, and identifies important nodes, regardless of their hub properties. Our method computes the PageRank for the nodes of the network, and divides the PageRank by the in-degree (i.e., the number of incoming edges) of the node. This quotient is the same in all nodes in an undirected graph (even for large- and low-degree nodes, that is, for hubs and non-hubs as well), but may differ significantly from node to node in directed graphs. We suggest to assign importance to non-hub nodes with large PageRank/in-degree quotient. Consequently, our method gives high scores to nodes with large PageRank, relative to their degrees: therefore non-hub important nodes can easily be identified in large networks. We demonstrate that these relatively high PageRank scores have biological relevance: the method correctly finds numerous already validated drug targets in distinct organisms (Mycobacterium tuberculosis, Plasmodium falciparum and MRSA Staphylococcus aureus), and consequently, it may suggest new possible protein targets as well. Additionally, our scoring method was not chosen arbitrarily: its value for all nodes of all undirected graphs is constant; therefore its high value captures importance in the

Citation ranking versus peer evaluation of senior faculty research performance

DEFF Research Database (Denmark)

Meho, Lokman I.; Sonnenwald, Diane H.

2000-01-01

The purpose of this study is to analyze the relationship between citation ranking and peer evaluation in assessing senior faculty research performance. Other studies typically derive their peer evaluation data directly from referees, often in the form of ranking. This study uses two additional...... indicator of research performance of senior faculty members? Citation data, book reviews, and peer ranking were compiled and examined for faculty members specializing in Kurdish studies. Analysis shows that normalized citation ranking and citation content analysis data yield identical ranking results....... Analysis also shows that normalized citation ranking and citation content analysis, book reviews, and peer ranking perform similarly (i.e., are highly correlated) for high-ranked and low-ranked senior scholars. Additional evaluation methods and measures that take into account the context and content...

Reduced-Rank Adaptive Filtering Using Krylov Subspace

Directory of Open Access Journals (Sweden)

Sergueï Burykh

2003-01-01

Full Text Available A unified view of several recently introduced reduced-rank adaptive filters is presented. As all considered methods use Krylov subspace for rank reduction, the approach taken in this work is inspired from Krylov subspace methods for iterative solutions of linear systems. The alternative interpretation so obtained is used to study the properties of each considered technique and to relate one reduced-rank method to another as well as to algorithms used in computational linear algebra. Practical issues are discussed and low-complexity versions are also included in our study. It is believed that the insight developed in this paper can be further used to improve existing reduced-rank methods according to known results in the domain of Krylov subspace methods.

PageRank and rank-reversal dependence on the damping factor

Science.gov (United States)

Son, S.-W.; Christensen, C.; Grassberger, P.; Paczuski, M.

2012-12-01

PageRank (PR) is an algorithm originally developed by Google to evaluate the importance of web pages. Considering how deeply rooted Google's PR algorithm is to gathering relevant information or to the success of modern businesses, the question of rank stability and choice of the damping factor (a parameter in the algorithm) is clearly important. We investigate PR as a function of the damping factor d on a network obtained from a domain of the World Wide Web, finding that rank reversal happens frequently over a broad range of PR (and of d). We use three different correlation measures, Pearson, Spearman, and Kendall, to study rank reversal as d changes, and we show that the correlation of PR vectors drops rapidly as d changes from its frequently cited value, d0=0.85. Rank reversal is also observed by measuring the Spearman and Kendall rank correlation, which evaluate relative ranks rather than absolute PR. Rank reversal happens not only in directed networks containing rank sinks but also in a single strongly connected component, which by definition does not contain any sinks. We relate rank reversals to rank pockets and bottlenecks in the directed network structure. For the network studied, the relative rank is more stable by our measures around d=0.65 than at d=d0.

PageRank and rank-reversal dependence on the damping factor.

Science.gov (United States)

Son, S-W; Christensen, C; Grassberger, P; Paczuski, M

2012-12-01

PageRank (PR) is an algorithm originally developed by Google to evaluate the importance of web pages. Considering how deeply rooted Google's PR algorithm is to gathering relevant information or to the success of modern businesses, the question of rank stability and choice of the damping factor (a parameter in the algorithm) is clearly important. We investigate PR as a function of the damping factor d on a network obtained from a domain of the World Wide Web, finding that rank reversal happens frequently over a broad range of PR (and of d). We use three different correlation measures, Pearson, Spearman, and Kendall, to study rank reversal as d changes, and we show that the correlation of PR vectors drops rapidly as d changes from its frequently cited value, d_{0}=0.85. Rank reversal is also observed by measuring the Spearman and Kendall rank correlation, which evaluate relative ranks rather than absolute PR. Rank reversal happens not only in directed networks containing rank sinks but also in a single strongly connected component, which by definition does not contain any sinks. We relate rank reversals to rank pockets and bottlenecks in the directed network structure. For the network studied, the relative rank is more stable by our measures around d=0.65 than at d=d_{0}.

Learning to rank figures within a biomedical article.

Directory of Open Access Journals (Sweden)

Feifan Liu

Full Text Available Hundreds of millions of figures are available in biomedical literature, representing important biomedical experimental evidence. This ever-increasing sheer volume has made it difficult for scientists to effectively and accurately access figures of their interest, the process of which is crucial for validating research facts and for formulating or testing novel research hypotheses. Current figure search applications can't fully meet this challenge as the "bag of figures" assumption doesn't take into account the relationship among figures. In our previous study, hundreds of biomedical researchers have annotated articles in which they serve as corresponding authors. They ranked each figure in their paper based on a figure's importance at their discretion, referred to as "figure ranking". Using this collection of annotated data, we investigated computational approaches to automatically rank figures. We exploited and extended the state-of-the-art listwise learning-to-rank algorithms and developed a new supervised-learning model BioFigRank. The cross-validation results show that BioFigRank yielded the best performance compared with other state-of-the-art computational models, and the greedy feature selection can further boost the ranking performance significantly. Furthermore, we carry out the evaluation by comparing BioFigRank with three-level competitive domain-specific human experts: (1 First Author, (2 Non-Author-In-Domain-Expert who is not the author nor co-author of an article but who works in the same field of the corresponding author of the article, and (3 Non-Author-Out-Domain-Expert who is not the author nor co-author of an article and who may or may not work in the same field of the corresponding author of an article. Our results show that BioFigRank outperforms Non-Author-Out-Domain-Expert and performs as well as Non-Author-In-Domain-Expert. Although BioFigRank underperforms First Author, since most biomedical researchers are either in- or

Learning to rank figures within a biomedical article.

Science.gov (United States)

Liu, Feifan; Yu, Hong

2014-01-01

Hundreds of millions of figures are available in biomedical literature, representing important biomedical experimental evidence. This ever-increasing sheer volume has made it difficult for scientists to effectively and accurately access figures of their interest, the process of which is crucial for validating research facts and for formulating or testing novel research hypotheses. Current figure search applications can't fully meet this challenge as the "bag of figures" assumption doesn't take into account the relationship among figures. In our previous study, hundreds of biomedical researchers have annotated articles in which they serve as corresponding authors. They ranked each figure in their paper based on a figure's importance at their discretion, referred to as "figure ranking". Using this collection of annotated data, we investigated computational approaches to automatically rank figures. We exploited and extended the state-of-the-art listwise learning-to-rank algorithms and developed a new supervised-learning model BioFigRank. The cross-validation results show that BioFigRank yielded the best performance compared with other state-of-the-art computational models, and the greedy feature selection can further boost the ranking performance significantly. Furthermore, we carry out the evaluation by comparing BioFigRank with three-level competitive domain-specific human experts: (1) First Author, (2) Non-Author-In-Domain-Expert who is not the author nor co-author of an article but who works in the same field of the corresponding author of the article, and (3) Non-Author-Out-Domain-Expert who is not the author nor co-author of an article and who may or may not work in the same field of the corresponding author of an article. Our results show that BioFigRank outperforms Non-Author-Out-Domain-Expert and performs as well as Non-Author-In-Domain-Expert. Although BioFigRank underperforms First Author, since most biomedical researchers are either in- or out

Google matrix analysis of C.elegans neural network

Energy Technology Data Exchange (ETDEWEB)

Kandiah, V., E-mail: kandiah@irsamc.ups-tlse.fr; Shepelyansky, D.L., E-mail: dima@irsamc.ups-tlse.fr

2014-05-01

We study the structural properties of the neural network of the C.elegans (worm) from a directed graph point of view. The Google matrix analysis is used to characterize the neuron connectivity structure and node classifications are discussed and compared with physiological properties of the cells. Our results are obtained by a proper definition of neural directed network and subsequent eigenvector analysis which recovers some results of previous studies. Our analysis highlights particular sets of important neurons constituting the core of the neural system. The applications of PageRank, CheiRank and ImpactRank to characterization of interdependency of neurons are discussed.

Google matrix analysis of C.elegans neural network

International Nuclear Information System (INIS)

Kandiah, V.; Shepelyansky, D.L.

2014-01-01

We study the structural properties of the neural network of the C.elegans (worm) from a directed graph point of view. The Google matrix analysis is used to characterize the neuron connectivity structure and node classifications are discussed and compared with physiological properties of the cells. Our results are obtained by a proper definition of neural directed network and subsequent eigenvector analysis which recovers some results of previous studies. Our analysis highlights particular sets of important neurons constituting the core of the neural system. The applications of PageRank, CheiRank and ImpactRank to characterization of interdependency of neurons are discussed.

Google matrix of the world network of economic activities

Science.gov (United States)

Kandiah, Vivek; Escaith, Hubert; Shepelyansky, Dima L.

2015-07-01

Using the new data from the OECD-WTO world network of economic activities we construct the Google matrix G of this directed network and perform its detailed analysis. The network contains 58 countries and 37 activity sectors for years 1995 and 2008. The construction of G, based on Markov chain transitions, treats all countries on equal democratic grounds while the contribution of activity sectors is proportional to their exchange monetary volume. The Google matrix analysis allows to obtain reliable ranking of countries and activity sectors and to determine the sensitivity of CheiRank-PageRank commercial balance of countries in respect to price variations and labor cost in various countries. We demonstrate that the developed approach takes into account multiplicity of network links with economy interactions between countries and activity sectors thus being more efficient compared to the usual export-import analysis. The spectrum and eigenstates of G are also analyzed being related to specific activity communities of countries.

A density matrix renormalization group study of low-lying excitations ...

Indian Academy of Sciences (India)

Symmetrized density-matrix-renormalization-group calculations have been carried out, within Pariser-Parr-Pople Hamiltonian, to explore the nature of the ground and low-lying excited states of long polythiophene oligomers. We have exploited 2 symmetry and spin parity of the system to obtain excited states of ...

Ranking structures and rank-rank correlations of countries: The FIFA and UEFA cases

Science.gov (United States)

Ausloos, Marcel; Cloots, Rudi; Gadomski, Adam; Vitanov, Nikolay K.

2014-04-01

Ranking of agents competing with each other in complex systems may lead to paradoxes according to the pre-chosen different measures. A discussion is presented on such rank-rank, similar or not, correlations based on the case of European countries ranked by UEFA and FIFA from different soccer competitions. The first question to be answered is whether an empirical and simple law is obtained for such (self-) organizations of complex sociological systems with such different measuring schemes. It is found that the power law form is not the best description contrary to many modern expectations. The stretched exponential is much more adequate. Moreover, it is found that the measuring rules lead to some inner structures in both cases.

Carbon-free hydrogen production from low rank coal

Science.gov (United States)

Aziz, Muhammad; Oda, Takuya; Kashiwagi, Takao

2018-02-01

Novel carbon-free integrated system of hydrogen production and storage from low rank coal is proposed and evaluated. To measure the optimum energy efficiency, two different systems employing different chemical looping technologies are modeled. The first integrated system consists of coal drying, gasification, syngas chemical looping, and hydrogenation. On the other hand, the second system combines coal drying, coal direct chemical looping, and hydrogenation. In addition, in order to cover the consumed electricity and recover the energy, combined cycle is adopted as addition module for power generation. The objective of the study is to find the best system having the highest performance in terms of total energy efficiency, including hydrogen production efficiency and power generation efficiency. To achieve a thorough energy/heat circulation throughout each module and the whole integrated system, enhanced process integration technology is employed. It basically incorporates two core basic technologies: exergy recovery and process integration. Several operating parameters including target moisture content in drying module, operating pressure in chemical looping module, are observed in terms of their influence to energy efficiency. From process modeling and calculation, two integrated systems can realize high total energy efficiency, higher than 60%. However, the system employing coal direct chemical looping represents higher energy efficiency, including hydrogen production and power generation, which is about 83%. In addition, optimum target moisture content in drying and operating pressure in chemical looping also have been defined.

A Fast, Open EEG Classification Framework Based on Feature Compression and Channel Ranking

Directory of Open Access Journals (Sweden)

Jiuqi Han

2018-04-01

Full Text Available Superior feature extraction, channel selection and classification methods are essential for designing electroencephalography (EEG classification frameworks. However, the performance of most frameworks is limited by their improper channel selection methods and too specifical design, leading to high computational complexity, non-convergent procedure and narrow expansibility. In this paper, to remedy these drawbacks, we propose a fast, open EEG classification framework centralized by EEG feature compression, low-dimensional representation, and convergent iterative channel ranking. First, to reduce the complexity, we use data clustering to compress the EEG features channel-wise, packing the high-dimensional EEG signal, and endowing them with numerical signatures. Second, to provide easy access to alternative superior methods, we structurally represent each EEG trial in a feature vector with its corresponding numerical signature. Thus, the recorded signals of many trials shrink to a low-dimensional structural matrix compatible with most pattern recognition methods. Third, a series of effective iterative feature selection approaches with theoretical convergence is introduced to rank the EEG channels and remove redundant ones, further accelerating the EEG classification process and ensuring its stability. Finally, a classical linear discriminant analysis (LDA model is employed to classify a single EEG trial with selected channels. Experimental results on two real world brain-computer interface (BCI competition datasets demonstrate the promising performance of the proposed framework over state-of-the-art methods.

Mass transfer ranking of polylysine, poly-ornithine and poly-methylene-co-guanidine microcapsule membranes using a single low molecular mass marker

Directory of Open Access Journals (Sweden)

Rosinski Stefan

2003-01-01

Full Text Available On the long way to clinical transplantable hybrid systems, comprising of cells, acting as immuno-protected bioreactors microencapsulated in a polymeric matrix and delivering desired factors (proteins, hormones, enzymes etc to the patient's body, an important step is the optimization of the microcapsule. This topic includes the selection of a proper coating membrane which could fulfil, first of all, the mass transfer as well as biocompatibility, stability and durability requirements. Three different membranes from polymerised aminoacids, formed around exactly identical alginate gel cores, were considered, concerning their mass transport properties, as potential candidates in this task. The results of the evaluation of the mass ingress and mass transfer coefficient h for the selected low molecular mass marker, vitamin B12, in poly-L-lysine (HPLL poly-L-ornithine (HPLO and poly-methylene-co-guanidine hydrochloride (HPMCG membrane alginate microcapsules demonstrate the advantage of using the mass transfer approach to a preliminary screening of various microcapsule formulations. Applying a single marker and evaluating mass transfer coefficients can help to quickly rank the investigated membranes and microcapsules according to their permeability. It has been demonstrated that HPLL, HPLO and HPMCG microcapsules differ from each other by a factor of two concerning the rate of low molecular mass marker transport. Interesting differences in mass transfer through the membrane in both directions in-out was also found, which could possibly be related to the membrane asymmetry.

On the regularity of the covariance matrix of a discretized scalar field on the sphere

Energy Technology Data Exchange (ETDEWEB)

Bilbao-Ahedo, J.D. [Departamento de Física Moderna, Universidad de Cantabria, Av. los Castros s/n, 39005 Santander (Spain); Barreiro, R.B.; Herranz, D.; Vielva, P.; Martínez-González, E., E-mail: bilbao@ifca.unican.es, E-mail: barreiro@ifca.unican.es, E-mail: herranz@ifca.unican.es, E-mail: vielva@ifca.unican.es, E-mail: martinez@ifca.unican.es [Instituto de Física de Cantabria (CSIC-UC), Av. los Castros s/n, 39005 Santander (Spain)

2017-02-01

We present a comprehensive study of the regularity of the covariance matrix of a discretized field on the sphere. In a particular situation, the rank of the matrix depends on the number of pixels, the number of spherical harmonics, the symmetries of the pixelization scheme and the presence of a mask. Taking into account the above mentioned components, we provide analytical expressions that constrain the rank of the matrix. They are obtained by expanding the determinant of the covariance matrix as a sum of determinants of matrices made up of spherical harmonics. We investigate these constraints for five different pixelizations that have been used in the context of Cosmic Microwave Background (CMB) data analysis: Cube, Icosahedron, Igloo, GLESP and HEALPix, finding that, at least in the considered cases, the HEALPix pixelization tends to provide a covariance matrix with a rank closer to the maximum expected theoretical value than the other pixelizations. The effect of the propagation of numerical errors in the regularity of the covariance matrix is also studied for different computational precisions, as well as the effect of adding a certain level of noise in order to regularize the matrix. In addition, we investigate the application of the previous results to a particular example that requires the inversion of the covariance matrix: the estimation of the CMB temperature power spectrum through the Quadratic Maximum Likelihood algorithm. Finally, some general considerations in order to achieve a regular covariance matrix are also presented.

Limits of rank 4 Azumaya algebras and applications to desingularisation

International Nuclear Information System (INIS)

Venkata Balaji, T.E.

2001-07-01

A smooth scheme structure on the space of limits of Azumaya algebra structures on a free rank 4 module over any noetherian commutative ring is shown to exist, generalizing Seshadri's theorem in that the variety of specialisations of (2x2)-matrix algebras is smooth in characteristic ≠2. As an application, a construction of Seshadri is shown in a characteristic-free way to desingularise the moduli space of rank two even degree semistable vector bundles on a complete curve. As another application, a construction of Nori over Z is extended to the case of a normal domain which is finitely generate algebra over a universally Japanese (Nagata) ring and is shown to desingularise the Artin moduli space of invariants of several matrices in rank 2. This desingularisation is shown to have a good specialisation property if the Artin moduli space has geometrically reduced fibers, for example, this happens over Z. Essential use is made of M. Kneser's concept of 'semiregular quadratic module'. For any free quadratic module of odd rank, a formula linking the half-discriminant and the values of the quadratic form on its radical is derived. (author)

Low rank approximation method for efficient Green's function calculation of dissipative quantum transport

Science.gov (United States)

Zeng, Lang; He, Yu; Povolotskyi, Michael; Liu, XiaoYan; Klimeck, Gerhard; Kubis, Tillmann

2013-06-01

In this work, the low rank approximation concept is extended to the non-equilibrium Green's function (NEGF) method to achieve a very efficient approximated algorithm for coherent and incoherent electron transport. This new method is applied to inelastic transport in various semiconductor nanodevices. Detailed benchmarks with exact NEGF solutions show (1) a very good agreement between approximated and exact NEGF results, (2) a significant reduction of the required memory, and (3) a large reduction of the computational time (a factor of speed up as high as 150 times is observed). A non-recursive solution of the inelastic NEGF transport equations of a 1000 nm long resistor on standard hardware illustrates nicely the capability of this new method.

Effect of blending ratio to the liquid product on co-pyrolysis of low rank coal and oil palm empty fruit bunch

Directory of Open Access Journals (Sweden)

Zullaikah Siti

2018-01-01

Full Text Available The utilization of Indonesia low rank coal should be maximized, since the source of Indonesia law rank coals were abundant. Pyrolysis of this coal can produce liquid product which can be utilized as fuel and chemical feedstocks. The yield of liquid product is still low due to lower of comparison H/C. Since coal is non-renewable source, an effort of coal saving and to mitigate the production of greenhouse gases, biomass such as oil palm empty fruit bunch (EFB would added as co-feeding. EFB could act as hydrogen donor in co-pyrolysis to increase liquid product. Co-pyrolysis of Indonesia low rank coal and EFB were studied in a drop tube reactor under the certain temperature (t= 500 °C and time (t= 1 h used N2 as purge gas. The effect of blending ratios of coal/EFB (100/0, 75/25, 50/50, 25/75 and 0/100%, w/w % on the yield and composition of liquid product were studied systematically. The results showed that the higher blending ratio, the yield of liquid product and gas obtained increased, while the char decreased. The highest yield of liquid product (28,62 % was obtained used blending ratio of coal/EFB = 25/75, w/w%. Tar composition obtained in this ratio is phenol, polycyclic aromatic hydrocarbons, alkanes, acids, esters.

Bayesian Plackett-Luce Mixture Models for Partially Ranked Data.

Science.gov (United States)

Mollica, Cristina; Tardella, Luca

2017-06-01

The elicitation of an ordinal judgment on multiple alternatives is often required in many psychological and behavioral experiments to investigate preference/choice orientation of a specific population. The Plackett-Luce model is one of the most popular and frequently applied parametric distributions to analyze rankings of a finite set of items. The present work introduces a Bayesian finite mixture of Plackett-Luce models to account for unobserved sample heterogeneity of partially ranked data. We describe an efficient way to incorporate the latent group structure in the data augmentation approach and the derivation of existing maximum likelihood procedures as special instances of the proposed Bayesian method. Inference can be conducted with the combination of the Expectation-Maximization algorithm for maximum a posteriori estimation and the Gibbs sampling iterative procedure. We additionally investigate several Bayesian criteria for selecting the optimal mixture configuration and describe diagnostic tools for assessing the fitness of ranking distributions conditionally and unconditionally on the number of ranked items. The utility of the novel Bayesian parametric Plackett-Luce mixture for characterizing sample heterogeneity is illustrated with several applications to simulated and real preference ranked data. We compare our method with the frequentist approach and a Bayesian nonparametric mixture model both assuming the Plackett-Luce model as a mixture component. Our analysis on real datasets reveals the importance of an accurate diagnostic check for an appropriate in-depth understanding of the heterogenous nature of the partial ranking data.

Sparse Contextual Activation for Efficient Visual Re-Ranking.

Science.gov (United States)

Bai, Song; Bai, Xiang

2016-03-01

In this paper, we propose an extremely efficient algorithm for visual re-ranking. By considering the original pairwise distance in the contextual space, we develop a feature vector called sparse contextual activation (SCA) that encodes the local distribution of an image. Hence, re-ranking task can be simply accomplished by vector comparison under the generalized Jaccard metric, which has its theoretical meaning in the fuzzy set theory. In order to improve the time efficiency of re-ranking procedure, inverted index is successfully introduced to speed up the computation of generalized Jaccard metric. As a result, the average time cost of re-ranking for a certain query can be controlled within 1 ms. Furthermore, inspired by query expansion, we also develop an additional method called local consistency enhancement on the proposed SCA to improve the retrieval performance in an unsupervised manner. On the other hand, the retrieval performance using a single feature may not be satisfactory enough, which inspires us to fuse multiple complementary features for accurate retrieval. Based on SCA, a robust feature fusion algorithm is exploited that also preserves the characteristic of high time efficiency. We assess our proposed method in various visual re-ranking tasks. Experimental results on Princeton shape benchmark (3D object), WM-SRHEC07 (3D competition), YAEL data set B (face), MPEG-7 data set (shape), and Ukbench data set (image) manifest the effectiveness and efficiency of SCA.

Unitarity of CKM Matrix

CERN Document Server

Saleem, M

2002-01-01

The Unitarity of the CKM matrix is examined in the light of the latest available accurate data. The analysis shows that a conclusive result cannot be derived at present. Only more precise data can determine whether the CKM matrix opens new vistas beyond the standard model or not.

Statistical analysis of latent generalized correlation matrix estimation in transelliptical distribution.

Science.gov (United States)

Han, Fang; Liu, Han

2017-02-01

Correlation matrix plays a key role in many multivariate methods (e.g., graphical model estimation and factor analysis). The current state-of-the-art in estimating large correlation matrices focuses on the use of Pearson's sample correlation matrix. Although Pearson's sample correlation matrix enjoys various good properties under Gaussian models, its not an effective estimator when facing heavy-tail distributions with possible outliers. As a robust alternative, Han and Liu (2013b) advocated the use of a transformed version of the Kendall's tau sample correlation matrix in estimating high dimensional latent generalized correlation matrix under the transelliptical distribution family (or elliptical copula). The transelliptical family assumes that after unspecified marginal monotone transformations, the data follow an elliptical distribution. In this paper, we study the theoretical properties of the Kendall's tau sample correlation matrix and its transformed version proposed in Han and Liu (2013b) for estimating the population Kendall's tau correlation matrix and the latent Pearson's correlation matrix under both spectral and restricted spectral norms. With regard to the spectral norm, we highlight the role of "effective rank" in quantifying the rate of convergence. With regard to the restricted spectral norm, we for the first time present a "sign subgaussian condition" which is sufficient to guarantee that the rank-based correlation matrix estimator attains the optimal rate of convergence. In both cases, we do not need any moment condition.

D-Iteration: diffusion approach for solving PageRank

OpenAIRE

Hong, Dohy; Huynh, The Dang; Mathieu, Fabien

2015-01-01

In this paper we present a new method that can accelerate the computation of the PageRank importance vector. Our method, called D-Iteration (DI), is based on the decomposition of the matrix-vector product that can be seen as a fluid diffusion model and is potentially adapted to asynchronous implementation. We give theoretical results about the convergence of our algorithm and we show through experimentations on a real Web graph that DI can improve the computation efficiency compared to other ...

SibRank: Signed bipartite network analysis for neighbor-based collaborative ranking

Science.gov (United States)

Shams, Bita; Haratizadeh, Saman

2016-09-01

Collaborative ranking is an emerging field of recommender systems that utilizes users' preference data rather than rating values. Unfortunately, neighbor-based collaborative ranking has gained little attention despite its more flexibility and justifiability. This paper proposes a novel framework, called SibRank that seeks to improve the state of the art neighbor-based collaborative ranking methods. SibRank represents users' preferences as a signed bipartite network, and finds similar users, through a novel personalized ranking algorithm in signed networks.

Multiple Kernel Learning for adaptive graph regularized nonnegative matrix factorization

KAUST Repository

Wang, Jim Jing-Yan; AbdulJabbar, Mustafa Abdulmajeed

2012-01-01

Nonnegative Matrix Factorization (NMF) has been continuously evolving in several areas like pattern recognition and information retrieval methods. It factorizes a matrix into a product of 2 low-rank non-negative matrices that will define parts-based, and linear representation of non-negative data. Recently, Graph regularized NMF (GrNMF) is proposed to find a compact representation, which uncovers the hidden semantics and simultaneously respects the intrinsic geometric structure. In GNMF, an affinity graph is constructed from the original data space to encode the geometrical information. In this paper, we propose a novel idea which engages a Multiple Kernel Learning approach into refining the graph structure that reflects the factorization of the matrix and the new data space. The GrNMF is improved by utilizing the graph refined by the kernel learning, and then a novel kernel learning method is introduced under the GrNMF framework. Our approach shows encouraging results of the proposed algorithm in comparison to the state-of-the-art clustering algorithms like NMF, GrNMF, SVD etc.

Testing the encoding elaboration hypothesis: The effects of exemplar ranking on recognition and recall.

Science.gov (United States)

Schnur, P

1977-11-01

Two experiments investigated the effects of exemplar ranking on retention. High-ranking exemplars are words judged to be prototypical of a given category; low-ranking exemplars are words judged to be atypical of a given category. In Experiment 1, an incidental learning paradigm was used to measure reaction time to answer an encoding question as well as subsequent recognition. It was found that low-ranking exemplars were classified more slowly but recognized better than high-ranking exemplars. Other comparisons of the effects of category encoding, rhyme encoding, and typescript encoding on response latency and recognition replicated the results of Craik and Tulving (1975). In Experiment 2, unanticipated free recall of live previously learned paired associate lists revealed that a list composed of low-ranking exemplars was better recalled than a comparable list composed of high-ranking exemplars. Moreover, this was true only when the lists were studied in the context of appropriate category cues. These findings are discussed in terms of the encoding elaboration hypothesis.

Ranking nodes in growing networks: When PageRank fails.

Science.gov (United States)

Mariani, Manuel Sebastian; Medo, Matúš; Zhang, Yi-Cheng

2015-11-10

PageRank is arguably the most popular ranking algorithm which is being applied in real systems ranging from information to biological and infrastructure networks. Despite its outstanding popularity and broad use in different areas of science, the relation between the algorithm's efficacy and properties of the network on which it acts has not yet been fully understood. We study here PageRank's performance on a network model supported by real data, and show that realistic temporal effects make PageRank fail in individuating the most valuable nodes for a broad range of model parameters. Results on real data are in qualitative agreement with our model-based findings. This failure of PageRank reveals that the static approach to information filtering is inappropriate for a broad class of growing systems, and suggest that time-dependent algorithms that are based on the temporal linking patterns of these systems are needed to better rank the nodes.

Towards Google matrix of brain

Energy Technology Data Exchange (ETDEWEB)

Shepelyansky, D.L., E-mail: dima@irsamc.ups-tlse.f [Laboratoire de Physique Theorique (IRSAMC), Universite de Toulouse, UPS, F-31062 Toulouse (France); LPT - IRSAMC, CNRS, F-31062 Toulouse (France); Zhirov, O.V. [Budker Institute of Nuclear Physics, 630090 Novosibirsk (Russian Federation)

2010-07-12

We apply the approach of the Google matrix, used in computer science and World Wide Web, to description of properties of neuronal networks. The Google matrix G is constructed on the basis of neuronal network of a brain model discussed in PNAS 105 (2008) 3593. We show that the spectrum of eigenvalues of G has a gapless structure with long living relaxation modes. The PageRank of the network becomes delocalized for certain values of the Google damping factor {alpha}. The properties of other eigenstates are also analyzed. We discuss further parallels and similarities between the World Wide Web and neuronal networks.

Towards Google matrix of brain

International Nuclear Information System (INIS)

Shepelyansky, D.L.; Zhirov, O.V.

2010-01-01

We apply the approach of the Google matrix, used in computer science and World Wide Web, to description of properties of neuronal networks. The Google matrix G is constructed on the basis of neuronal network of a brain model discussed in PNAS 105 (2008) 3593. We show that the spectrum of eigenvalues of G has a gapless structure with long living relaxation modes. The PageRank of the network becomes delocalized for certain values of the Google damping factor α. The properties of other eigenstates are also analyzed. We discuss further parallels and similarities between the World Wide Web and neuronal networks.

Exploiting Data Sparsity In Covariance Matrix Computations on Heterogeneous Systems

KAUST Repository

Charara, Ali M.

2018-05-24

Covariance matrices are ubiquitous in computational sciences, typically describing the correlation of elements of large multivariate spatial data sets. For example, covari- ance matrices are employed in climate/weather modeling for the maximum likelihood estimation to improve prediction, as well as in computational ground-based astronomy to enhance the observed image quality by filtering out noise produced by the adap- tive optics instruments and atmospheric turbulence. The structure of these covariance matrices is dense, symmetric, positive-definite, and often data-sparse, therefore, hier- archically of low-rank. This thesis investigates the performance limit of dense matrix computations (e.g., Cholesky factorization) on covariance matrix problems as the number of unknowns grows, and in the context of the aforementioned applications. We employ recursive formulations of some of the basic linear algebra subroutines (BLAS) to accelerate the covariance matrix computation further, while reducing data traffic across the memory subsystems layers. However, dealing with large data sets (i.e., covariance matrices of billions in size) can rapidly become prohibitive in memory footprint and algorithmic complexity. Most importantly, this thesis investigates the tile low-rank data format (TLR), a new compressed data structure and layout, which is valuable in exploiting data sparsity by approximating the operator. The TLR com- pressed data structure allows approximating the original problem up to user-defined numerical accuracy. This comes at the expense of dealing with tasks with much lower arithmetic intensities than traditional dense computations. In fact, this thesis con- solidates the two trends of dense and data-sparse linear algebra for HPC. Not only does the thesis leverage recursive formulations for dense Cholesky-based matrix al- gorithms, but it also implements a novel TLR-Cholesky factorization using batched linear algebra operations to increase hardware occupancy and

RankProdIt: A web-interactive Rank Products analysis tool

Directory of Open Access Journals (Sweden)

Laing Emma

2010-08-01

Full Text Available Abstract Background The first objective of a DNA microarray experiment is typically to generate a list of genes or probes that are found to be differentially expressed or represented (in the case of comparative genomic hybridizations and/or copy number variation between two conditions or strains. Rank Products analysis comprises a robust algorithm for deriving such lists from microarray experiments that comprise small numbers of replicates, for example, less than the number required for the commonly used t-test. Currently, users wishing to apply Rank Products analysis to their own microarray data sets have been restricted to the use of command line-based software which can limit its usage within the biological community. Findings Here we have developed a web interface to existing Rank Products analysis tools allowing users to quickly process their data in an intuitive and step-wise manner to obtain the respective Rank Product or Rank Sum, probability of false prediction and p-values in a downloadable file. Conclusions The online interactive Rank Products analysis tool RankProdIt, for analysis of any data set containing measurements for multiple replicated conditions, is available at: http://strep-microarray.sbs.surrey.ac.uk/RankProducts

On efficient randomized algorithms for finding the PageRank vector

Science.gov (United States)

Gasnikov, A. V.; Dmitriev, D. Yu.

2015-03-01

Two randomized methods are considered for finding the PageRank vector; in other words, the solution of the system p T = p T P with a stochastic n × n matrix P, where n ˜ 107-109, is sought (in the class of probability distributions) with accuracy ɛ: ɛ ≫ n -1. Thus, the possibility of brute-force multiplication of P by the column is ruled out in the case of dense objects. The first method is based on the idea of Markov chain Monte Carlo algorithms. This approach is efficient when the iterative process p {/t+1 T} = p {/t T} P quickly reaches a steady state. Additionally, it takes into account another specific feature of P, namely, the nonzero off-diagonal elements of P are equal in rows (this property is used to organize a random walk over the graph with the matrix P). Based on modern concentration-of-measure inequalities, new bounds for the running time of this method are presented that take into account the specific features of P. In the second method, the search for a ranking vector is reduced to finding the equilibrium in the antagonistic matrix game where S n (1) is a unit simplex in ℝ n and I is the identity matrix. The arising problem is solved by applying a slightly modified Grigoriadis-Khachiyan algorithm (1995). This technique, like the Nazin-Polyak method (2009), is a randomized version of Nemirovski's mirror descent method. The difference is that randomization in the Grigoriadis-Khachiyan algorithm is used when the gradient is projected onto the simplex rather than when the stochastic gradient is computed. For sparse matrices P, the method proposed yields noticeably better results.

A mathematical formulation of the Mahaux-Weidenmueller formula for the scattering matrix

International Nuclear Information System (INIS)

Christiansen, T J; Zworski, M

2009-01-01

This paper gives a mathematical exposition of a formula for the scattering matrix for a manifold with infinite cylindrical ends or a waveguide. This formula is well known in the physics literature and we show that a variant of this formula gives the scattering matrix of the mathematics literature. Moreover, we bound the difference between the scattering matrix and an approximation of it computed using a finite rank approximation of the interaction matrix.

RankExplorer: Visualization of Ranking Changes in Large Time Series Data.

Science.gov (United States)

Shi, Conglei; Cui, Weiwei; Liu, Shixia; Xu, Panpan; Chen, Wei; Qu, Huamin

2012-12-01

For many applications involving time series data, people are often interested in the changes of item values over time as well as their ranking changes. For example, people search many words via search engines like Google and Bing every day. Analysts are interested in both the absolute searching number for each word as well as their relative rankings. Both sets of statistics may change over time. For very large time series data with thousands of items, how to visually present ranking changes is an interesting challenge. In this paper, we propose RankExplorer, a novel visualization method based on ThemeRiver to reveal the ranking changes. Our method consists of four major components: 1) a segmentation method which partitions a large set of time series curves into a manageable number of ranking categories; 2) an extended ThemeRiver view with embedded color bars and changing glyphs to show the evolution of aggregation values related to each ranking category over time as well as the content changes in each ranking category; 3) a trend curve to show the degree of ranking changes over time; 4) rich user interactions to support interactive exploration of ranking changes. We have applied our method to some real time series data and the case studies demonstrate that our method can reveal the underlying patterns related to ranking changes which might otherwise be obscured in traditional visualizations.

ACORNS, Covariance and Correlation Matrix Diagonalization

International Nuclear Information System (INIS)

Szondi, E.J.

1990-01-01

1 - Description of program or function: The program allows the user to verify the different types of covariance/correlation matrices used in the activation neutron spectrometry. 2 - Method of solution: The program performs the diagonalization of the input covariance/relative covariance/correlation matrices. The Eigen values are then analyzed to determine the rank of the matrices. If the Eigen vectors of the pertinent correlation matrix have also been calculated, the program can perform a complete factor analysis (generation of the factor matrix and its rotation in Kaiser's 'varimax' sense to select the origin of the correlations). 3 - Restrictions on the complexity of the problem: Matrix size is limited to 60 on PDP and to 100 on IBM PC/AT

Accelerating Matrix-Vector Multiplication on Hierarchical Matrices Using Graphical Processing Units

KAUST Repository

Boukaram, W.

2015-03-25

Large dense matrices arise from the discretization of many physical phenomena in computational sciences. In statistics very large dense covariance matrices are used for describing random fields and processes. One can, for instance, describe distribution of dust particles in the atmosphere, concentration of mineral resources in the earth\\'s crust or uncertain permeability coefficient in reservoir modeling. When the problem size grows, storing and computing with the full dense matrix becomes prohibitively expensive both in terms of computational complexity and physical memory requirements. Fortunately, these matrices can often be approximated by a class of data sparse matrices called hierarchical matrices (H-matrices) where various sub-blocks of the matrix are approximated by low rank matrices. These matrices can be stored in memory that grows linearly with the problem size. In addition, arithmetic operations on these H-matrices, such as matrix-vector multiplication, can be completed in almost linear time. Originally the H-matrix technique was developed for the approximation of stiffness matrices coming from partial differential and integral equations. Parallelizing these arithmetic operations on the GPU has been the focus of this work and we will present work done on the matrix vector operation on the GPU using the KSPARSE library.

A rank-based sequence aligner with applications in phylogenetic analysis.

Directory of Open Access Journals (Sweden)

Liviu P Dinu

Full Text Available Recent tools for aligning short DNA reads have been designed to optimize the trade-off between correctness and speed. This paper introduces a method for assigning a set of short DNA reads to a reference genome, under Local Rank Distance (LRD. The rank-based aligner proposed in this work aims to improve correctness over speed. However, some indexing strategies to speed up the aligner are also investigated. The LRD aligner is improved in terms of speed by storing [Formula: see text]-mer positions in a hash table for each read. Another improvement, that produces an approximate LRD aligner, is to consider only the positions in the reference that are likely to represent a good positional match of the read. The proposed aligner is evaluated and compared to other state of the art alignment tools in several experiments. A set of experiments are conducted to determine the precision and the recall of the proposed aligner, in the presence of contaminated reads. In another set of experiments, the proposed aligner is used to find the order, the family, or the species of a new (or unknown organism, given only a set of short Next-Generation Sequencing DNA reads. The empirical results show that the aligner proposed in this work is highly accurate from a biological point of view. Compared to the other evaluated tools, the LRD aligner has the important advantage of being very accurate even for a very low base coverage. Thus, the LRD aligner can be considered as a good alternative to standard alignment tools, especially when the accuracy of the aligner is of high importance. Source code and UNIX binaries of the aligner are freely available for future development and use at http://lrd.herokuapp.com/aligners. The software is implemented in C++ and Java, being supported on UNIX and MS Windows.

Grid-based lattice summation of electrostatic potentials by assembled rank-structured tensor approximation

Science.gov (United States)

Khoromskaia, Venera; Khoromskij, Boris N.

2014-12-01

Our recent method for low-rank tensor representation of sums of the arbitrarily positioned electrostatic potentials discretized on a 3D Cartesian grid reduces the 3D tensor summation to operations involving only 1D vectors however retaining the linear complexity scaling in the number of potentials. Here, we introduce and study a novel tensor approach for fast and accurate assembled summation of a large number of lattice-allocated potentials represented on 3D N × N × N grid with the computational requirements only weakly dependent on the number of summed potentials. It is based on the assembled low-rank canonical tensor representations of the collected potentials using pointwise sums of shifted canonical vectors representing the single generating function, say the Newton kernel. For a sum of electrostatic potentials over L × L × L lattice embedded in a box the required storage scales linearly in the 1D grid-size, O(N) , while the numerical cost is estimated by O(NL) . For periodic boundary conditions, the storage demand remains proportional to the 1D grid-size of a unit cell, n = N / L, while the numerical cost reduces to O(N) , that outperforms the FFT-based Ewald-type summation algorithms of complexity O(N3 log N) . The complexity in the grid parameter N can be reduced even to the logarithmic scale O(log N) by using data-sparse representation of canonical N-vectors via the quantics tensor approximation. For justification, we prove an upper bound on the quantics ranks for the canonical vectors in the overall lattice sum. The presented approach is beneficial in applications which require further functional calculus with the lattice potential, say, scalar product with a function, integration or differentiation, which can be performed easily in tensor arithmetics on large 3D grids with 1D cost. Numerical tests illustrate the performance of the tensor summation method and confirm the estimated bounds on the tensor ranks.

Accurate electron channeling contrast analysis of a low angle sub-grain boundary

International Nuclear Information System (INIS)

Mansour, H.; Crimp, M.A.; Gey, N.; Maloufi, N.

2015-01-01

High resolution selected area channeling pattern (HR-SACP) assisted accurate electron channeling contrast imaging (A-ECCI) was used to unambiguously characterize the structure of a low angle grain boundary in an interstitial-free-steel. The boundary dislocations were characterized using TEM-style contrast analysis. The boundary was determined to be tilt in nature with a misorientation angle of 0.13° consistent with the HR-SACP measurements. The results were verified using high accuracy electron backscatter diffraction (EBSD), confirming the approach as a discriminating tool for assessing low angle boundaries

Reduced-Rank Chip-Level MMSE Equalization for the 3G CDMA Forward Link with Code-Multiplexed Pilot

Directory of Open Access Journals (Sweden)

Goldstein J Scott

2002-01-01

Full Text Available This paper deals with synchronous direct-sequence code-division multiple access (CDMA transmission using orthogonal channel codes in frequency selective multipath, motivated by the forward link in 3G CDMA systems. The chip-level minimum mean square error (MMSE estimate of the (multiuser synchronous sum signal transmitted by the base, followed by a correlate and sum, has been shown to perform very well in saturated systems compared to a Rake receiver. In this paper, we present the reduced-rank, chip-level MMSE estimation based on the multistage nested Wiener filter (MSNWF. We show that, for the case of a known channel, only a small number of stages of the MSNWF is needed to achieve near full-rank MSE performance over a practical single-to-noise ratio (SNR range. This holds true even for an edge-of-cell scenario, where two base stations are contributing near equal-power signals, as well as for the single base station case. We then utilize the code-multiplexed pilot channel to train the MSNWF coefficients and show that adaptive MSNWF operating in a very low rank subspace performs slightly better than full-rank recursive least square (RLS and significantly better than least mean square (LMS. An important advantage of the MSNWF is that it can be implemented in a lattice structure, which involves significantly less computation than RLS. We also present structured MMSE equalizers that exploit the estimate of the multipath arrival times and the underlying channel structure to project the data vector onto a much lower dimensional subspace. Specifically, due to the sparseness of high-speed CDMA multipath channels, the channel vector lies in the subspace spanned by a small number of columns of the pulse shaping filter convolution matrix. We demonstrate that the performance of these structured low-rank equalizers is much superior to unstructured equalizers in terms of convergence speed and error rates.

Hierarchical low-rank approximation for high dimensional approximation

KAUST Repository

Nouy, Anthony

2016-01-07

Tensor methods are among the most prominent tools for the numerical solution of high-dimensional problems where functions of multiple variables have to be approximated. Such high-dimensional approximation problems naturally arise in stochastic analysis and uncertainty quantification. In many practical situations, the approximation of high-dimensional functions is made computationally tractable by using rank-structured approximations. In this talk, we present algorithms for the approximation in hierarchical tensor format using statistical methods. Sparse representations in a given tensor format are obtained with adaptive or convex relaxation methods, with a selection of parameters using crossvalidation methods.

Hierarchical low-rank approximation for high dimensional approximation

KAUST Repository

Nouy, Anthony

2016-01-01

Tensor methods are among the most prominent tools for the numerical solution of high-dimensional problems where functions of multiple variables have to be approximated. Such high-dimensional approximation problems naturally arise in stochastic analysis and uncertainty quantification. In many practical situations, the approximation of high-dimensional functions is made computationally tractable by using rank-structured approximations. In this talk, we present algorithms for the approximation in hierarchical tensor format using statistical methods. Sparse representations in a given tensor format are obtained with adaptive or convex relaxation methods, with a selection of parameters using crossvalidation methods.

PageRank as a method to rank biomedical literature by importance.

Science.gov (United States)

Yates, Elliot J; Dixon, Louise C

2015-01-01

Optimal ranking of literature importance is vital in overcoming article overload. Existing ranking methods are typically based on raw citation counts, giving a sum of 'inbound' links with no consideration of citation importance. PageRank, an algorithm originally developed for ranking webpages at the search engine, Google, could potentially be adapted to bibliometrics to quantify the relative importance weightings of a citation network. This article seeks to validate such an approach on the freely available, PubMed Central open access subset (PMC-OAS) of biomedical literature. On-demand cloud computing infrastructure was used to extract a citation network from over 600,000 full-text PMC-OAS articles. PageRanks and citation counts were calculated for each node in this network. PageRank is highly correlated with citation count (R = 0.905, P PageRank can be trivially computed on commodity cluster hardware and is linearly correlated with citation count. Given its putative benefits in quantifying relative importance, we suggest it may enrich the citation network, thereby overcoming the existing inadequacy of citation counts alone. We thus suggest PageRank as a feasible supplement to, or replacement of, existing bibliometric ranking methods.

Accurate measurement of indoor radon concentration using a low-effective volume radon monitor

International Nuclear Information System (INIS)

Tanaka, Aya; Minami, Nodoka; Mukai, Takahiro; Yasuoka, Yumi; Iimoto, Takeshi; Omori, Yasutaka; Nagahama, Hiroyuki; Muto, Jun

2017-01-01

AlphaGUARD is a low-effective volume detector and one of the most popular portable radon monitors which is currently available. This study investigated whether AlphaGUARD can accurately measure the variable indoor radon levels. The consistency of the radon-concentration data obtained by AlphaGUARD is evaluated against simultaneous measurements by two other monitors (each ∼10 times more sensitive than AlphaGUARD). When accurately measuring radon concentration with AlphaGUARD, we found that the net counts of the AlphaGUARD were required of at least 500 counts, <25% of the relative percent difference. AlphaGUARD can provide accurate measurements of radon concentration for the world average level (∼50 Bq m -3 ) and the reference level of workplace (1000 Bq m -3 ), using integrated data over at least 3 h and 10 min, respectively. (authors)

A Batch-Incremental Video Background Estimation Model using Weighted Low-Rank Approximation of Matrices

KAUST Repository

Dutta, Aritra

2017-07-02

Principal component pursuit (PCP) is a state-of-the-art approach for background estimation problems. Due to their higher computational cost, PCP algorithms, such as robust principal component analysis (RPCA) and its variants, are not feasible in processing high definition videos. To avoid the curse of dimensionality in those algorithms, several methods have been proposed to solve the background estimation problem in an incremental manner. We propose a batch-incremental background estimation model using a special weighted low-rank approximation of matrices. Through experiments with real and synthetic video sequences, we demonstrate that our method is superior to the state-of-the-art background estimation algorithms such as GRASTA, ReProCS, incPCP, and GFL.

A Batch-Incremental Video Background Estimation Model using Weighted Low-Rank Approximation of Matrices

KAUST Repository

Dutta, Aritra; Li, Xin; Richtarik, Peter

2017-01-01

Principal component pursuit (PCP) is a state-of-the-art approach for background estimation problems. Due to their higher computational cost, PCP algorithms, such as robust principal component analysis (RPCA) and its variants, are not feasible in processing high definition videos. To avoid the curse of dimensionality in those algorithms, several methods have been proposed to solve the background estimation problem in an incremental manner. We propose a batch-incremental background estimation model using a special weighted low-rank approximation of matrices. Through experiments with real and synthetic video sequences, we demonstrate that our method is superior to the state-of-the-art background estimation algorithms such as GRASTA, ReProCS, incPCP, and GFL.

Subspace-Based Noise Reduction for Speech Signals via Diagonal and Triangular Matrix Decompositions

DEFF Research Database (Denmark)

Hansen, Per Christian; Jensen, Søren Holdt

2007-01-01

We survey the definitions and use of rank-revealing matrix decompositions in single-channel noise reduction algorithms for speech signals. Our algorithms are based on the rank-reduction paradigm and, in particular, signal subspace techniques. The focus is on practical working algorithms, using both...... with working Matlab code and applications in speech processing....

Development of low rank coals upgrading and their CWM producing technology; Teihin`itan kaishitsu ni yoru CWM seizo gijutsu

Energy Technology Data Exchange (ETDEWEB)

Sugiyama, T [Center for Coal Utilization, Japan, Tokyo (Japan); Tsurui, M; Suto, Y; Asakura, M [JGC Corp., Tokyo (Japan); Ogawa, J; Yui, M; Takano, S [Japan COM Co. Ltd., Japan, Tokyo (Japan)

1996-09-01

A CWM manufacturing technology was developed by means of upgrading low rank coals. Even though some low rank coals have such advantages as low ash, low sulfur and high volatile matter content, many of them are merely used on a small scale in areas near the mine-mouths because of high moisture content, low calorification and high ignitability. Therefore, discussions were given on a coal fuel manufacturing technology by which coal will be irreversibly dehydrated with as much volatile matters as possible remaining in the coal, and the coal is made high-concentration CWM, thus the coal can be safely transported and stored. The technology uses a method to treat coal with hot water under high pressure and dry it with hot water. The method performs not only removal of water, but also irreversible dehydration without losing volatile matters by decomposing hydrophilic groups on surface and blocking micro pores with volatile matters in the coal (wax and tar). The upgrading effect was verified by processing coals in a pilot plant, which derived greater calorification and higher concentration CWM than with the conventional processes. A CWM combustion test proved lower NOx, lower SOx and higher combustion rate than for bituminous coal. The ash content was also found lower. This process suits a Texaco-type gasification furnace. For a production scale of three million tons a year, the production cost is lower by 2 yen per 10 {sup 3} kcal than for heavy oil with the same sulfur content. 11 figs., 15 tabs.

Ranking nodes in growing networks: When PageRank fails

Science.gov (United States)

Mariani, Manuel Sebastian; Medo, Matúš; Zhang, Yi-Cheng

2015-11-01

PageRank is arguably the most popular ranking algorithm which is being applied in real systems ranging from information to biological and infrastructure networks. Despite its outstanding popularity and broad use in different areas of science, the relation between the algorithm’s efficacy and properties of the network on which it acts has not yet been fully understood. We study here PageRank’s performance on a network model supported by real data, and show that realistic temporal effects make PageRank fail in individuating the most valuable nodes for a broad range of model parameters. Results on real data are in qualitative agreement with our model-based findings. This failure of PageRank reveals that the static approach to information filtering is inappropriate for a broad class of growing systems, and suggest that time-dependent algorithms that are based on the temporal linking patterns of these systems are needed to better rank the nodes.

Can free energy calculations be fast and accurate at the same time? Binding of low-affinity, non-peptide inhibitors to the SH2 domain of the src protein

Science.gov (United States)

Chipot, Christophe; Rozanska, Xavier; Dixit, Surjit B.

2005-11-01

The usefulness of free-energy calculations in non-academic environments, in general, and in the pharmaceutical industry, in particular, is a long-time debated issue, often considered from the angle of cost/performance criteria. In the context of the rational drug design of low-affinity, non-peptide inhibitors to the SH2 domain of the pp60src tyrosine kinase, the continuing difficulties encountered in an attempt to obtain accurate free-energy estimates are addressed. free-energy calculations can provide a convincing answer, assuming that two key-requirements are fulfilled: (i) thorough sampling of the configurational space is necessary to minimize the statistical error, hence raising the question: to which extent can we sacrifice the computational effort, yet without jeopardizing the precision of the free-energy calculation? (ii) the sensitivity of binding free-energies to the parameters utilized imposes an appropriate parametrization of the potential energy function, especially for non-peptide molecules that are usually poorly described by multipurpose macromolecular force fields. Employing the free-energy perturbation method, accurate ranking, within ±0.7 kcal/mol, is obtained in the case of four non-peptide mimes of a sequence recognized by the pp60src SH2 domain.

Obtaining Low Rank Coal Biotransforming Bacteria from Microhabitats Enriched with Carbonaceous Residues

International Nuclear Information System (INIS)

Valero Valero, Nelson; Rodriguez Salazar, Luz Nidia; Mancilla Gomez, Sandra; Contreras Bayona, Leydis

2012-01-01

Bacteria capable of low rank coal (LRC) biotransform were isolated from environmental samples altered with coal in the mine The Cerrejon. A protocol was designed to select strains more capable of LRC biotransform, the protocol includes isolation in a selective medium with LRC powder, qualitative and quantitative tests for LRC solubilization in solid and liquid culture medium. Of 75 bacterial strains isolated, 32 showed growth in minimal salts agar with 5 % carbon. The strains that produce higher values of humic substances (HS) have a mechanism of solubilization associated with pH changes in the culture medium, probably related to the production of extracellular alkaline substances by bacteria. The largest number of strains and bacteria with more solubilizing activity on LRC were isolated from sludge with high content of carbon residue and rhizosphere of Typha domingensis and Cenchrus ciliaris grown on sediments mixed with carbon particles, this result suggests that obtaining and solubilization capacity of LRC by bacteria may be related to the microhabitat where the populations originated.

Low Multilinear Rank Approximation of Tensors and Application in Missing Traffic Data

Directory of Open Access Journals (Sweden)

Huachun Tan

2014-02-01

Full Text Available The problem of missing data in multiway arrays (i.e., tensors is common in many fields such as bibliographic data analysis, image processing, and computer vision. We consider the problems of approximating a tensor by another tensor with low multilinear rank in the presence of missing data and possibly reconstructing it (i.e., tensor completion. In this paper, we propose a weighted Tucker model which models only the known elements for capturing the latent structure of the data and reconstructing the missing elements. To treat the nonuniqueness of the proposed weighted Tucker model, a novel gradient descent algorithm based on a Grassmann manifold, which is termed Tucker weighted optimization (Tucker-Wopt, is proposed for guaranteeing the global convergence to a local minimum of the problem. Based on extensive experiments, Tucker-Wopt is shown to successfully reconstruct tensors with noise and up to 95% missing data. Furthermore, the experiments on traffic flow volume data demonstrate the usefulness of our algorithm on real-world application.

Pra Desain Pabrik Substitute Natural Gas (SNG dari Low Rank Coal

Directory of Open Access Journals (Sweden)

Asti Permatasari

2014-09-01

rendah dan sedang yang sangat banyak, yaitu masing-masing sebesar 2.426,00 juta ton dan 186,00 juta ton. Maka dari itu, pabrik SNG dari low rank coal ini akan didirikan di Kecamatan Ilir Timur, Sumatera Selatan. Rencananya pabrik ini akan didirikan pada tahun 2016 dan siap beroperasi pada tahun 2018. Diperkirakan konsumsi gas alam pada tahun 2018 sebesar 906.599,3 MMSCF sehingga pendirian pabrik yang baru diharapkan dapat menggantikan kebutuhan gas alam sebesar 4% di Indonesia, yaitu sebanyak 36.295,502 MMSCF per tahun atau sebesar 109.986 MMSCFD. Proses pembuatan SNG dari low rank coal terdiri dari empat proses utama, yaitu coal preparation, gasifikasi, gas cleaning, dan metanasi. Dari analisa perhitungan ekonomi didapat Investasi 823.947.924 USD, IRR sebesar 13,12%, POT selama 5 tahun, dan BEP sebesar 68,55%.

RANK/RANK-Ligand/OPG: Ein neuer Therapieansatz in der Osteoporosebehandlung

Directory of Open Access Journals (Sweden)

Preisinger E

2007-01-01

Full Text Available Die Erforschung der Kopplungsmechanismen zur Osteoklastogenese, Knochenresorption und Remodellierung eröffnete neue mögliche Therapieansätze in der Behandlung der Osteoporose. Eine Schlüsselrolle beim Knochenabbau spielt der RANK- ("receptor activator of nuclear factor (NF- κB"- Ligand (RANKL. Durch die Bindung von RANKL an den Rezeptor RANK wird die Knochenresorption eingeleitet. OPG (Osteoprotegerin sowie der für den klinischen Gebrauch entwickelte humane monoklonale Antikörper (IgG2 Denosumab blockieren die Bindung von RANK-Ligand an RANK und verhindern den Knochenabbau.

Polychoric/Tetrachoric Matrix or Pearson Matrix? A methodological study

Directory of Open Access Journals (Sweden)

Dominguez Lara, Sergio Alexis

2014-04-01

Full Text Available The use of product-moment correlation of Pearson is common in most studies in factor analysis in psychology, but it is known that this statistic is only applicable when the variables related are in interval scale and normally distributed, and when are used in ordinal data may to produce a distorted correlation matrix . Thus is a suitable option using polychoric/tetrachoric matrices in item-level factor analysis when the items are in level measurement nominal or ordinal. The aim of this study was to show the differences in the KMO, Bartlett`s Test and Determinant of the Matrix, percentage of variance explained and factor loadings in depression trait scale of Depression Inventory Trait - State and the Neuroticism dimension of the short form of the Eysenck Personality Questionnaire -Revised, regarding the use of matrices polychoric/tetrachoric matrices and Pearson. These instruments was analyzed with different extraction methods (Maximum Likelihood, Minimum Rank Factor Analysis, Unweighted Least Squares and Principal Components, keeping constant the rotation method Promin were analyzed. Were observed differences regarding sample adequacy measures, as well as with respect to the explained variance and the factor loadings, for solutions having as polychoric/tetrachoric matrix. So it can be concluded that the polychoric / tetrachoric matrix give better results than Pearson matrices when it comes to item-level factor analysis using different methods.

Fully Decentralized Semi-supervised Learning via Privacy-preserving Matrix Completion.

Science.gov (United States)

Fierimonte, Roberto; Scardapane, Simone; Uncini, Aurelio; Panella, Massimo

2016-08-26

Distributed learning refers to the problem of inferring a function when the training data are distributed among different nodes. While significant work has been done in the contexts of supervised and unsupervised learning, the intermediate case of Semi-supervised learning in the distributed setting has received less attention. In this paper, we propose an algorithm for this class of problems, by extending the framework of manifold regularization. The main component of the proposed algorithm consists of a fully distributed computation of the adjacency matrix of the training patterns. To this end, we propose a novel algorithm for low-rank distributed matrix completion, based on the framework of diffusion adaptation. Overall, the distributed Semi-supervised algorithm is efficient and scalable, and it can preserve privacy by the inclusion of flexible privacy-preserving mechanisms for similarity computation. The experimental results and comparison on a wide range of standard Semi-supervised benchmarks validate our proposal.

Exchange-Hole Dipole Dispersion Model for Accurate Energy Ranking in Molecular Crystal Structure Prediction II: Nonplanar Molecules.

Science.gov (United States)

Whittleton, Sarah R; Otero-de-la-Roza, A; Johnson, Erin R

2017-11-14

The crystal structure prediction (CSP) of a given compound from its molecular diagram is a fundamental challenge in computational chemistry with implications in relevant technological fields. A key component of CSP is the method to calculate the lattice energy of a crystal, which allows the ranking of candidate structures. This work is the second part of our investigation to assess the potential of the exchange-hole dipole moment (XDM) dispersion model for crystal structure prediction. In this article, we study the relatively large, nonplanar, mostly flexible molecules in the first five blind tests held by the Cambridge Crystallographic Data Centre. Four of the seven experimental structures are predicted as the energy minimum, and thermal effects are demonstrated to have a large impact on the ranking of at least another compound. As in the first part of this series, delocalization error affects the results for a single crystal (compound X), in this case by detrimentally overstabilizing the π-conjugated conformation of the monomer. Overall, B86bPBE-XDM correctly predicts 16 of the 21 compounds in the five blind tests, a result similar to the one obtained using the best CSP method available to date (dispersion-corrected PW91 by Neumann et al.). Perhaps more importantly, the systems for which B86bPBE-XDM fails to predict the experimental structure as the energy minimum are mostly the same as with Neumann's method, which suggests that similar difficulties (absence of vibrational free energy corrections, delocalization error,...) are not limited to B86bPBE-XDM but affect GGA-based DFT-methods in general. Our work confirms B86bPBE-XDM as an excellent option for crystal energy ranking in CSP and offers a guide to identify crystals (organic salts, conjugated flexible systems) where difficulties may appear.

Critical review of methods for risk ranking of food related hazards, based on risks for human health

DEFF Research Database (Denmark)

van der Fels-Klerx, H. J.; van Asselt, E. D.; Raley, M.

2018-01-01

This study aimed to critically review methods for ranking risks related to food safety and dietary hazards on the basis of their anticipated human health impacts. A literature review was performed to identify and characterize methods for risk ranking from the fields of food, environmental science......, and the risk ranking method characterized. The methods were then clustered - based on their characteristics - into eleven method categories. These categories included: risk assessment, comparative risk assessment, risk ratio method, scoring method, cost of illness, health adjusted life years, multi......-criteria decision analysis, risk matrix, flow charts/decision trees, stated preference techniques and expert synthesis. Method categories were described by their characteristics, weaknesses and strengths, data resources, and fields of applications. It was concluded there is no single best method for risk ranking...

A multimedia retrieval framework based on semi-supervised ranking and relevance feedback.

Science.gov (United States)

Yang, Yi; Nie, Feiping; Xu, Dong; Luo, Jiebo; Zhuang, Yueting; Pan, Yunhe

2012-04-01

We present a new framework for multimedia content analysis and retrieval which consists of two independent algorithms. First, we propose a new semi-supervised algorithm called ranking with Local Regression and Global Alignment (LRGA) to learn a robust Laplacian matrix for data ranking. In LRGA, for each data point, a local linear regression model is used to predict the ranking scores of its neighboring points. A unified objective function is then proposed to globally align the local models from all the data points so that an optimal ranking score can be assigned to each data point. Second, we propose a semi-supervised long-term Relevance Feedback (RF) algorithm to refine the multimedia data representation. The proposed long-term RF algorithm utilizes both the multimedia data distribution in multimedia feature space and the history RF information provided by users. A trace ratio optimization problem is then formulated and solved by an efficient algorithm. The algorithms have been applied to several content-based multimedia retrieval applications, including cross-media retrieval, image retrieval, and 3D motion/pose data retrieval. Comprehensive experiments on four data sets have demonstrated its advantages in precision, robustness, scalability, and computational efficiency.

Social Rank, Stress, Fitness, and Life Expectancy in Wild Rabbits

Science.gov (United States)

von Holst, Dietrich; Hutzelmeyer, Hans; Kaetzke, Paul; Khaschei, Martin; Schönheiter, Ronald

Wild rabbits of the two sexes have separate linear rank orders, which are established and maintained by intensive fights. The social rank of individuals strongly influence their fitness: males and females that gain a high social rank, at least at the outset of their second breeding season, have a much higher lifetime fitness than subordinate individuals. This is because of two separate factors: a much higher fecundity and annual reproductive success and a 50% longer reproductive life span. These results are in contrast to the view in evolutionary biology that current reproduction can be increased only at the expense of future survival and/or fecundity. These concepts entail higher physiological costs in high-ranking mammals, which is not supported by our data: In wild rabbits the physiological costs of social positions are caused predominantly by differential psychosocial stress responses that are much lower in high-ranking than in low-ranking individuals.

The BACON Approach for Rank-Deficient Data

Directory of Open Access Journals (Sweden)

Athanassios Kondylis

2012-07-01

Full Text Available Normal 0 false false false EN-US X-NONE X-NONE /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-parent:""; mso-padding-alt:0in 5.4pt 0in 5.4pt; mso-para-margin:0in; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:10.0pt; font-family:"Times New Roman","serif";} Rank-deficient data are not uncommon in practice. They result from highly collinear variables and/or high-dimensional data. A special case of the latter occurs when the number of recorded variables exceeds the number of observations. The use of the BACON algorithm for outlier detection in multivariate data is extended here to include rank-deficient data. We present two approaches to identifying outliers in rank-deficient data based on the original BACON algorithm. The first algorithm projects the data onto a robust subspace of reduced dimension, while the second employs a ridge type regularization on the covariance matrix. Both algorithms are tested on real as well as simulated data sets with good results in terms of their effectiveness in outlier detection. They are also examined in terms of computational efficiency and found to be very fast, with particularly good scaling properties for increasing dimension.

On predicting student performance using low-rank matrix factorization techniques

DEFF Research Database (Denmark)

Lorenzen, Stephan Sloth; Pham, Dang Ninh; Alstrup, Stephen

2017-01-01

that require remedial support, generate adaptive hints, and improve the learning of students. This work focuses on predicting the score of students in the quiz system of the Clio Online learning platform, the largest Danish supplier of online learning materials, covering 90% of Danish elementary schools....... Experimental results in the Clio Online data set confirm that the proposed initialization methods lead to very fast convergence. Regarding the prediction accuracy, surprisingly, the advanced EM method is just slightly better than the baseline approach based on the global mean score and student/quiz bias...

Matrix-vector multiplication using digital partitioning for more accurate optical computing

Science.gov (United States)

Gary, C. K.

1992-01-01

Digital partitioning offers a flexible means of increasing the accuracy of an optical matrix-vector processor. This algorithm can be implemented with the same architecture required for a purely analog processor, which gives optical matrix-vector processors the ability to perform high-accuracy calculations at speeds comparable with or greater than electronic computers as well as the ability to perform analog operations at a much greater speed. Digital partitioning is compared with digital multiplication by analog convolution, residue number systems, and redundant number representation in terms of the size and the speed required for an equivalent throughput as well as in terms of the hardware requirements. Digital partitioning and digital multiplication by analog convolution are found to be the most efficient alogrithms if coding time and hardware are considered, and the architecture for digital partitioning permits the use of analog computations to provide the greatest throughput for a single processor.

Research of Subgraph Estimation Page Rank Algorithm for Web Page Rank

Directory of Open Access Journals (Sweden)

LI Lan-yin

2017-04-01

Full Text Available The traditional PageRank algorithm can not efficiently perform large data Webpage scheduling problem. This paper proposes an accelerated algorithm named topK-Rank，which is based on PageRank on the MapReduce platform. It can find top k nodes efficiently for a given graph without sacrificing accuracy. In order to identify top k nodes，topK-Rank algorithm prunes unnecessary nodes and edges in each iteration to dynamically construct subgraphs，and iteratively estimates lower/upper bounds of PageRank scores through subgraphs. Theoretical analysis shows that this method guarantees result exactness. Experiments show that topK-Rank algorithm can find k nodes much faster than the existing approaches.

The ranking of negative-cost emissions reduction measures

International Nuclear Information System (INIS)

Taylor, Simon

2012-01-01

A flaw has been identified in the calculation of the cost-effectiveness in marginal abatement cost curves (MACCs). The problem affects “negative-cost” emissions reduction measures—those that produce a return on investment. The resulting ranking sometimes favours measures that produce low emissions savings and is therefore unreliable. The issue is important because incorrect ranking means a potential failure to achieve the best-value outcome. A simple mathematical analysis shows that not only is the standard cost-effectiveness calculation inadequate for ranking negative-cost measures, but there is no possible replacement that satisfies reasonable requirements. Furthermore, the concept of negative cost-effectiveness is found to be unsound and its use should be avoided. Among other things, this means that MACCs are unsuitable for ranking negative-cost measures. As a result, MACCs produced by a range of organizations including UK government departments may need to be revised. An alternative partial ranking method has been devised by making use of Pareto optimization. The outcome can be presented as a stacked bar chart that indicates both the preferred ordering and the total emissions saving available for each measure without specifying a cost-effectiveness. - Highlights: ► Marginal abatement cost curves (MACCs) are used to rank emission reduction measures. ► There is a flaw in the standard ranking method for negative-cost measures. ► Negative values of cost-effectiveness (in £/tC or equivalent) are invalid. ► There may be errors in published MACCs. ► A method based on Pareto principles provides an alternative ranking method.

An algorithm for mass matrix calculation of internally constrained molecular geometries

International Nuclear Information System (INIS)

Aryanpour, Masoud; Dhanda, Abhishek; Pitsch, Heinz

2008-01-01

Dynamic models for molecular systems require the determination of corresponding mass matrix. For constrained geometries, these computations are often not trivial but need special considerations. Here, assembling the mass matrix of internally constrained molecular structures is formulated as an optimization problem. Analytical expressions are derived for the solution of the different possible cases depending on the rank of the constraint matrix. Geometrical interpretations are further used to enhance the solution concept. As an application, we evaluate the mass matrix for a constrained molecule undergoing an electron-transfer reaction. The preexponential factor for this reaction is computed based on the harmonic model

An algorithm for mass matrix calculation of internally constrained molecular geometries.

Science.gov (United States)

Aryanpour, Masoud; Dhanda, Abhishek; Pitsch, Heinz

2008-01-28

Dynamic models for molecular systems require the determination of corresponding mass matrix. For constrained geometries, these computations are often not trivial but need special considerations. Here, assembling the mass matrix of internally constrained molecular structures is formulated as an optimization problem. Analytical expressions are derived for the solution of the different possible cases depending on the rank of the constraint matrix. Geometrical interpretations are further used to enhance the solution concept. As an application, we evaluate the mass matrix for a constrained molecule undergoing an electron-transfer reaction. The preexponential factor for this reaction is computed based on the harmonic model.

Dynamic SPECT reconstruction from few projections: a sparsity enforced matrix factorization approach

Science.gov (United States)

Ding, Qiaoqiao; Zan, Yunlong; Huang, Qiu; Zhang, Xiaoqun

2015-02-01

The reconstruction of dynamic images from few projection data is a challenging problem, especially when noise is present and when the dynamic images are vary fast. In this paper, we propose a variational model, sparsity enforced matrix factorization (SEMF), based on low rank matrix factorization of unknown images and enforced sparsity constraints for representing both coefficients and bases. The proposed model is solved via an alternating iterative scheme for which each subproblem is convex and involves the efficient alternating direction method of multipliers (ADMM). The convergence of the overall alternating scheme for the nonconvex problem relies upon the Kurdyka-Łojasiewicz property, recently studied by Attouch et al (2010 Math. Oper. Res. 35 438) and Attouch et al (2013 Math. Program. 137 91). Finally our proof-of-concept simulation on 2D dynamic images shows the advantage of the proposed method compared to conventional methods.

Hierarchical matrix approximation of large covariance matrices

KAUST Repository

Litvinenko, Alexander; Genton, Marc G.; Sun, Ying

2015-01-01

We approximate large non-structured Matérn covariance matrices of size n×n in the H-matrix format with a log-linear computational cost and storage O(kn log n), where rank k ≪ n is a small integer. Applications are: spatial statistics, machine learning and image analysis, kriging and optimal design.

Hierarchical matrix approximation of large covariance matrices

KAUST Repository

Litvinenko, Alexander

2015-11-30

We approximate large non-structured Matérn covariance matrices of size n×n in the H-matrix format with a log-linear computational cost and storage O(kn log n), where rank k ≪ n is a small integer. Applications are: spatial statistics, machine learning and image analysis, kriging and optimal design.

Ranking Tehran’s Stock Exchange Top Fifty Stocks Using Fundamental Indexes and Fuzzy TOPSIS

Directory of Open Access Journals (Sweden)

E. S. Saleh

2017-08-01

Full Text Available Investment through the purchase of securities, constitute an important part of countries economic exchange. Therefore, making decisions about investing in a particular stock has become one of the most controversial areas of economic and financial research and various institutions have began to rank companies stock and determine priorities of stock purchase to investment. The current research, with the determination of important required indexes for companies ranking based on their shares value on the Tehran stock exchange, can greatly help to the accurate ranking of fifty premier listed companies. Initial ranking indicators are extracted and then a decision-making group (exchange experts with the use of the Delphi method and also non-parametric statistic methods, determines the final indexes. Then, by using Fuzzy ANP, weight criteria are obtained with taking into account their interaction with each other. Finally, using fuzzy TOPSIS and information extraction about the premier fifty listed companies of Tehran stock exchange in 2014 are ranked with the software "Rahavard Novin”. Sensitivity analysis to criteria weight and relevant analysis presentation was conducted at the end of the study procedures.

Deep Multimodal Distance Metric Learning Using Click Constraints for Image Ranking.

Science.gov (United States)

Yu, Jun; Yang, Xiaokang; Gao, Fei; Tao, Dacheng

2017-12-01

How do we retrieve images accurately? Also, how do we rank a group of images precisely and efficiently for specific queries? These problems are critical for researchers and engineers to generate a novel image searching engine. First, it is important to obtain an appropriate description that effectively represent the images. In this paper, multimodal features are considered for describing images. The images unique properties are reflected by visual features, which are correlated to each other. However, semantic gaps always exist between images visual features and semantics. Therefore, we utilize click feature to reduce the semantic gap. The second key issue is learning an appropriate distance metric to combine these multimodal features. This paper develops a novel deep multimodal distance metric learning (Deep-MDML) method. A structured ranking model is adopted to utilize both visual and click features in distance metric learning (DML). Specifically, images and their related ranking results are first collected to form the training set. Multimodal features, including click and visual features, are collected with these images. Next, a group of autoencoders is applied to obtain initially a distance metric in different visual spaces, and an MDML method is used to assign optimal weights for different modalities. Next, we conduct alternating optimization to train the ranking model, which is used for the ranking of new queries with click features. Compared with existing image ranking methods, the proposed method adopts a new ranking model to use multimodal features, including click features and visual features in DML. We operated experiments to analyze the proposed Deep-MDML in two benchmark data sets, and the results validate the effects of the method.

Development and validation of a job exposure matrix for physical risk factors in low back pain.

Science.gov (United States)

Solovieva, Svetlana; Pehkonen, Irmeli; Kausto, Johanna; Miranda, Helena; Shiri, Rahman; Kauppinen, Timo; Heliövaara, Markku; Burdorf, Alex; Husgafvel-Pursiainen, Kirsti; Viikari-Juntura, Eira

2012-01-01

The aim was to construct and validate a gender-specific job exposure matrix (JEM) for physical exposures to be used in epidemiological studies of low back pain (LBP). We utilized two large Finnish population surveys, one to construct the JEM and another to test matrix validity. The exposure axis of the matrix included exposures relevant to LBP (heavy physical work, heavy lifting, awkward trunk posture and whole body vibration) and exposures that increase the biomechanical load on the low back (arm elevation) or those that in combination with other known risk factors could be related to LBP (kneeling or squatting). Job titles with similar work tasks and exposures were grouped. Exposure information was based on face-to-face interviews. Validity of the matrix was explored by comparing the JEM (group-based) binary measures with individual-based measures. The predictive validity of the matrix against LBP was evaluated by comparing the associations of the group-based (JEM) exposures with those of individual-based exposures. The matrix includes 348 job titles, representing 81% of all Finnish job titles in the early 2000s. The specificity of the constructed matrix was good, especially in women. The validity measured with kappa-statistic ranged from good to poor, being fair for most exposures. In men, all group-based (JEM) exposures were statistically significantly associated with one-month prevalence of LBP. In women, four out of six group-based exposures showed an association with LBP. The gender-specific JEM for physical exposures showed relatively high specificity without compromising sensitivity. The matrix can therefore be considered as a valid instrument for exposure assessment in large-scale epidemiological studies, when more precise but more labour-intensive methods are not feasible. Although the matrix was based on Finnish data we foresee that it could be applicable, with some modifications, in other countries with a similar level of technology.

VaRank: a simple and powerful tool for ranking genetic variants

Directory of Open Access Journals (Sweden)

Véronique Geoffroy

2015-03-01

Full Text Available Background. Most genetic disorders are caused by single nucleotide variations (SNVs or small insertion/deletions (indels. High throughput sequencing has broadened the catalogue of human variation, including common polymorphisms, rare variations or disease causing mutations. However, identifying one variation among hundreds or thousands of others is still a complex task for biologists, geneticists and clinicians.Results. We have developed VaRank, a command-line tool for the ranking of genetic variants detected by high-throughput sequencing. VaRank scores and prioritizes variants annotated either by Alamut Batch or SnpEff. A barcode allows users to quickly view the presence/absence of variants (with homozygote/heterozygote status in analyzed samples. VaRank supports the commonly used VCF input format for variants analysis thus allowing it to be easily integrated into NGS bioinformatics analysis pipelines. VaRank has been successfully applied to disease-gene identification as well as to molecular diagnostics setup for several hundred patients.Conclusions. VaRank is implemented in Tcl/Tk, a scripting language which is platform-independent but has been tested only on Unix environment. The source code is available under the GNU GPL, and together with sample data and detailed documentation can be downloaded from http://www.lbgi.fr/VaRank/.

Spectral properties of Google matrix of Wikipedia and other networks

Science.gov (United States)

Ermann, Leonardo; Frahm, Klaus M.; Shepelyansky, Dima L.

2013-05-01

We study the properties of eigenvalues and eigenvectors of the Google matrix of the Wikipedia articles hyperlink network and other real networks. With the help of the Arnoldi method, we analyze the distribution of eigenvalues in the complex plane and show that eigenstates with significant eigenvalue modulus are located on well defined network communities. We also show that the correlator between PageRank and CheiRank vectors distinguishes different organizations of information flow on BBC and Le Monde web sites.

Sparse structure regularized ranking

KAUST Repository

Wang, Jim Jing-Yan

2014-04-17

Learning ranking scores is critical for the multimedia database retrieval problem. In this paper, we propose a novel ranking score learning algorithm by exploring the sparse structure and using it to regularize ranking scores. To explore the sparse structure, we assume that each multimedia object could be represented as a sparse linear combination of all other objects, and combination coefficients are regarded as a similarity measure between objects and used to regularize their ranking scores. Moreover, we propose to learn the sparse combination coefficients and the ranking scores simultaneously. A unified objective function is constructed with regard to both the combination coefficients and the ranking scores, and is optimized by an iterative algorithm. Experiments on two multimedia database retrieval data sets demonstrate the significant improvements of the propose algorithm over state-of-the-art ranking score learning algorithms.

Rigorous results of low-energy models of the analytic S-matrix theory

International Nuclear Information System (INIS)

Meshcheryakov, V.A.

1974-01-01

Results of analytic S-matrix theory, mainly dealing with the static limit of dispersion relations, are applied to pion-nucleon scattering in the low-energy region. Various approaches to solving equations of the chew-Low type are discussed. It is concluded that interesting results are obtained by reducing the equations to a system of nonlinear difference equations; the crucial element of this approach being the study of functions on the whole Riemann surface. Boundary and crossing symmetry conditions are studied. (HFdV)

Comparison between phase shift derived and exactly calculated nucleon--nucleon interaction matrix elements

International Nuclear Information System (INIS)

Gregersen, A.W.

1977-01-01

A comparison is made between matrix elements calculated using the uncoupled channel Sussex approach to second order in DWBA and matrix elements calculated using a square well potential. The square well potential illustrated the problem of the determining parameter independence balanced with the concept of phase shift difference. The super-soft core potential was used to discuss the systematics of the Sussex approach as a function of angular momentum as well as the relation between Sussex generated and effective interaction matrix elements. In the uncoupled channels the original Sussex method of extracting effective interaction matrix elements was found to be satisfactory. In the coupled channels emphasis was placed upon the 3 S 1 -- 3 D 1 coupled channel matrix elements. Comparison is made between exactly calculated matrix elements, and matrix elements derived using an extended formulation of the coupled channel Sussex method. For simplicity the potential used is a nonseparable cut-off oscillator. The eigenphases of this potential can be made to approximate the realistic nucleon--nucleon phase shifts at low energies. By using the cut-off oscillator test potential, the original coupled channel Sussex method of determining parameter independence was shown to be incapable of accurately reproducing the exact cut-off oscillator matrix elements. The extended Sussex method was found to be accurate to within 10 percent. The extended method is based upon more general coupled channel DWBA and a noninfinite oscillator wave function solution to the cut-off oscillator auxiliary potential. A comparison is made in the coupled channels between matrix elements generated using the original Sussex method and the extended method. Tables of matrix elements generated using the original uncoupled channel Sussex method and the extended coupled channel Sussex method are presented for all necessary angular momentum channels

Ranking filter methods for concentrating pathogens in lake water

Science.gov (United States)

Accurately comparing filtration methods for concentrating waterborne pathogens is difficult because of two important water matrix effects on recovery measurements, the effect on PCR quantification and the effect on filter performance. Regarding the first effect, we show how to create a control water...

Quantitative Analysis of Mixtures of Monoprotic Acids Applying Modified Model-Based Rank Annihilation Factor Analysis on Variation Matrices of Spectrophotometric Acid-Base Titrations

Directory of Open Access Journals (Sweden)

Ebrahim Ghorbani-Kalhor

2015-04-01

Full Text Available In the current work, a new version of rank annihilation factor analysis was developedto circumvent the rank deficiency problem in multivariate data measurements.Simultaneous determination of dissociation constant and concentration of monoprotic acids was performed by applying model-based rank annihilation factor analysis on variation matrices of spectrophotometric acid-base titrations data. Variation matrices can be obtained by subtracting first row of data matrix from all rows of the main data matrix. This method uses variation matrices instead of multivariate spectrophotometric acid-base titrations matrices to circumvent the rank deficiency problem in the rank quantitation step. The applicability of this approach was evaluated by simulated data at first stage, then the binary mixtures of ascorbic and sorbic acids as model compounds were investigated by the proposed method. At the end, the proposed method was successfully applied for resolving the ascorbic and sorbic acid in an orange juice real sample. Therefore, unique results were achieved by applying rank annihilation factor analysis on variation matrix and using hard soft model combination advantage without any problem and difficulty in rank determination. Normal 0 false false false EN-US X-NONE AR-SA /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin-top:0cm; mso-para-margin-right:0cm; mso-para-margin-bottom:10.0pt; mso-para-margin-left:0cm; line-height:115%; mso-pagination:widow-orphan; font-size:11.0pt; font-family:"Calibri","sans-serif"; mso-ascii-font-family:Calibri; mso-ascii-theme-font:minor-latin; mso-hansi-font-family:Calibri; mso-hansi-theme-font:minor-latin; mso-bidi-font-family:Arial; mso-bidi-theme-font:minor-bidi; mso-bidi-language:AR-SA;}    

Subspace-Based Noise Reduction for Speech Signals via Diagonal and Triangular Matrix Decompositions

DEFF Research Database (Denmark)

Hansen, Per Christian; Jensen, Søren Holdt

We survey the definitions and use of rank-revealing matrix decompositions in single-channel noise reduction algorithms for speech signals. Our algorithms are based on the rank-reduction paradigm and, in particular, signal subspace techniques. The focus is on practical working algorithms, using both...... diagonal (eigenvalue and singular value) decompositions and rank-revealing triangular decompositions (ULV, URV, VSV, ULLV and ULLIV). In addition we show how the subspace-based algorithms can be evaluated and compared by means of simple FIR filter interpretations. The algorithms are illustrated...... with working Matlab code and applications in speech processing....

Accurate phylogenetic classification of DNA fragments based onsequence composition

Energy Technology Data Exchange (ETDEWEB)

McHardy, Alice C.; Garcia Martin, Hector; Tsirigos, Aristotelis; Hugenholtz, Philip; Rigoutsos, Isidore

2006-05-01

Metagenome studies have retrieved vast amounts of sequenceout of a variety of environments, leading to novel discoveries and greatinsights into the uncultured microbial world. Except for very simplecommunities, diversity makes sequence assembly and analysis a verychallenging problem. To understand the structure a 5 nd function ofmicrobial communities, a taxonomic characterization of the obtainedsequence fragments is highly desirable, yet currently limited mostly tothose sequences that contain phylogenetic marker genes. We show that forclades at the rank of domain down to genus, sequence composition allowsthe very accurate phylogenetic 10 characterization of genomic sequence.We developed a composition-based classifier, PhyloPythia, for de novophylogenetic sequence characterization and have trained it on adata setof 340 genomes. By extensive evaluation experiments we show that themethodis accurate across all taxonomic ranks considered, even forsequences that originate fromnovel organisms and are as short as 1kb.Application to two metagenome datasets 15 obtained from samples ofphosphorus-removing sludge showed that the method allows the accurateclassification at genus level of most sequence fragments from thedominant populations, while at the same time correctly characterizingeven larger parts of the samples at higher taxonomic levels.

Alkaloid-derived molecules in low rank Argonne premium coals.

Energy Technology Data Exchange (ETDEWEB)

Winans, R. E.; Tomczyk, N. A.; Hunt, J. E.

2000-11-30

Molecules that are probably derived from alkaloids have been found in the extracts of the subbituminous and lignite Argonne Premium Coals. High resolution mass spectrometry (HRMS) and liquid chromatography mass spectrometry (LCMS) have been used to characterize pyridine and supercritical extracts. The supercritical extraction used an approach that has been successful for extracting alkaloids from natural products. The first indication that there might be these natural products in coals was the large number of molecules found containing multiple nitrogen and oxygen heteroatoms. These molecules are much less abundant in bituminous coals and absent in the higher rank coals.

The tensor hypercontracted parametric reduced density matrix algorithm: coupled-cluster accuracy with O(r(4)) scaling.

Science.gov (United States)

Shenvi, Neil; van Aggelen, Helen; Yang, Yang; Yang, Weitao; Schwerdtfeger, Christine; Mazziotti, David

2013-08-07

Tensor hypercontraction is a method that allows the representation of a high-rank tensor as a product of lower-rank tensors. In this paper, we show how tensor hypercontraction can be applied to both the electron repulsion integral tensor and the two-particle excitation amplitudes used in the parametric 2-electron reduced density matrix (p2RDM) algorithm. Because only O(r) auxiliary functions are needed in both of these approximations, our overall algorithm can be shown to scale as O(r(4)), where r is the number of single-particle basis functions. We apply our algorithm to several small molecules, hydrogen chains, and alkanes to demonstrate its low formal scaling and practical utility. Provided we use enough auxiliary functions, we obtain accuracy similar to that of the standard p2RDM algorithm, somewhere between that of CCSD and CCSD(T).

Spin Calogero Particles and Bispectral Solutions of the Matrix KP Hierarchy

International Nuclear Information System (INIS)

Bergvelt, Maarten; Gekhtman, Michael; Kasman, Alex

2009-01-01

Pairs of nxn matrices whose commutator differ from the identity by a matrix of rank r are used to construct bispectral differential operators with rxr matrix coefficients satisfying the Lax equations of the Matrix KP hierarchy. Moreover, the bispectral involution on these operators has dynamical significance for the spin Calogero particles system whose phase space such pairs represent. In the case r = 1, this reproduces well-known results of Wilson and others from the 1990's relating (spinless) Calogero-Moser systems to the bispectrality of (scalar) differential operators

Feature ranking and rank aggregation for automatic sleep stage classification: a comparative study.

Science.gov (United States)

Najdi, Shirin; Gharbali, Ali Abdollahi; Fonseca, José Manuel

2017-08-18

Nowadays, sleep quality is one of the most important measures of healthy life, especially considering the huge number of sleep-related disorders. Identifying sleep stages using polysomnographic (PSG) signals is the traditional way of assessing sleep quality. However, the manual process of sleep stage classification is time-consuming, subjective and costly. Therefore, in order to improve the accuracy and efficiency of the sleep stage classification, researchers have been trying to develop automatic classification algorithms. Automatic sleep stage classification mainly consists of three steps: pre-processing, feature extraction and classification. Since classification accuracy is deeply affected by the extracted features, a poor feature vector will adversely affect the classifier and eventually lead to low classification accuracy. Therefore, special attention should be given to the feature extraction and selection process. In this paper the performance of seven feature selection methods, as well as two feature rank aggregation methods, were compared. Pz-Oz EEG, horizontal EOG and submental chin EMG recordings of 22 healthy males and females were used. A comprehensive feature set including 49 features was extracted from these recordings. The extracted features are among the most common and effective features used in sleep stage classification from temporal, spectral, entropy-based and nonlinear categories. The feature selection methods were evaluated and compared using three criteria: classification accuracy, stability, and similarity. Simulation results show that MRMR-MID achieves the highest classification performance while Fisher method provides the most stable ranking. In our simulations, the performance of the aggregation methods was in the average level, although they are known to generate more stable results and better accuracy. The Borda and RRA rank aggregation methods could not outperform significantly the conventional feature ranking methods. Among

How to Rank Journals.

Science.gov (United States)

Bradshaw, Corey J A; Brook, Barry W

2016-01-01

There are now many methods available to assess the relative citation performance of peer-reviewed journals. Regardless of their individual faults and advantages, citation-based metrics are used by researchers to maximize the citation potential of their articles, and by employers to rank academic track records. The absolute value of any particular index is arguably meaningless unless compared to other journals, and different metrics result in divergent rankings. To provide a simple yet more objective way to rank journals within and among disciplines, we developed a κ-resampled composite journal rank incorporating five popular citation indices: Impact Factor, Immediacy Index, Source-Normalized Impact Per Paper, SCImago Journal Rank and Google 5-year h-index; this approach provides an index of relative rank uncertainty. We applied the approach to six sample sets of scientific journals from Ecology (n = 100 journals), Medicine (n = 100), Multidisciplinary (n = 50); Ecology + Multidisciplinary (n = 25), Obstetrics & Gynaecology (n = 25) and Marine Biology & Fisheries (n = 25). We then cross-compared the κ-resampled ranking for the Ecology + Multidisciplinary journal set to the results of a survey of 188 publishing ecologists who were asked to rank the same journals, and found a 0.68-0.84 Spearman's ρ correlation between the two rankings datasets. Our composite index approach therefore approximates relative journal reputation, at least for that discipline. Agglomerative and divisive clustering and multi-dimensional scaling techniques applied to the Ecology + Multidisciplinary journal set identified specific clusters of similarly ranked journals, with only Nature & Science separating out from the others. When comparing a selection of journals within or among disciplines, we recommend collecting multiple citation-based metrics for a sample of relevant and realistic journals to calculate the composite rankings and their relative uncertainty windows.

Predicting disease risk using bootstrap ranking and classification algorithms.

Directory of Open Access Journals (Sweden)

Ohad Manor

Full Text Available Genome-wide association studies (GWAS are widely used to search for genetic loci that underlie human disease. Another goal is to predict disease risk for different individuals given their genetic sequence. Such predictions could either be used as a "black box" in order to promote changes in life-style and screening for early diagnosis, or as a model that can be studied to better understand the mechanism of the disease. Current methods for risk prediction typically rank single nucleotide polymorphisms (SNPs by the p-value of their association with the disease, and use the top-associated SNPs as input to a classification algorithm. However, the predictive power of such methods is relatively poor. To improve the predictive power, we devised BootRank, which uses bootstrapping in order to obtain a robust prioritization of SNPs for use in predictive models. We show that BootRank improves the ability to predict disease risk of unseen individuals in the Wellcome Trust Case Control Consortium (WTCCC data and results in a more robust set of SNPs and a larger number of enriched pathways being associated with the different diseases. Finally, we show that combining BootRank with seven different classification algorithms improves performance compared to previous studies that used the WTCCC data. Notably, diseases for which BootRank results in the largest improvements were recently shown to have more heritability than previously thought, likely due to contributions from variants with low minimum allele frequency (MAF, suggesting that BootRank can be beneficial in cases where SNPs affecting the disease are poorly tagged or have low MAF. Overall, our results show that improving disease risk prediction from genotypic information may be a tangible goal, with potential implications for personalized disease screening and treatment.

The average number of critical rank-one approximations to a tensor

NARCIS (Netherlands)

Draisma, J.; Horobet, E.

2014-01-01

Motivated by the many potential applications of low-rank multi-way tensor approximations, we set out to count the rank-one tensors that are critical points of the distance function to a general tensor v. As this count depends on v, we average over v drawn from a Gaussian distribution, and find

Low molecular weight polylactic acid as a matrix for the delayed release of pesticides.

Science.gov (United States)

Zhao, Jing; Wilkins, Richard M

2005-05-18

Low molecular weight polylactic acid (LMW PLA) was used as a matrix to formulate biodegradable matrix granules and films with bromacil using a melt process. The compatibility of the PLA with bromacil was evaluated. The release characteristics of the formulations were investigated in vitro. The degradation and erosion of the formulations were monitored by pH and gravimetric analysis during the course of release. Various granules and films had similar biphasic release patterns, a delayed release followed by an explosive release. The release rates were independent of bromacil content in the matrix, but varied with the geometry of matrices. The mechanisms of diffusion and erosion were involved in the release. The delayed release of the formulations was dominantly governed by the degradation and erosion of PLA. LMW PLA underwent bulk erosion. LMW PLA-based matrix formulations could thus be useful for the application of pesticides to sensitive targets such as seed treatment.

Evaluation of the osteoclastogenic process associated with RANK / RANK-L / OPG in odontogenic myxomas

Science.gov (United States)

González-Galván, María del Carmen; Mosqueda-Taylor, Adalberto; Bologna-Molina, Ronell; Setien-Olarra, Amaia; Marichalar-Mendia, Xabier; Aguirre-Urizar, José-Manuel

2018-01-01

Background Odontogenic myxoma (OM) is a benign intraosseous neoplasm that exhibits local aggressiveness and high recurrence rates. Osteoclastogenesis is an important phenomenon in the tumor growth of maxillary neoplasms. RANK (Receptor Activator of Nuclear Factor κappa B) is the signaling receptor of RANK-L (Receptor activator of nuclear factor kappa-Β ligand) that activates the osteoclasts. OPG (osteoprotegerin) is a decoy receptor for RANK-L that inhibits pro-osteoclastogenesis. The RANK / RANKL / OPG system participates in the regulation of osteolytic activity under normal conditions, and its alteration has been associated with greater bone destruction, and also with tumor growth. Objectives To analyze the immunohistochemical expression of OPG, RANK and RANK-L proteins in odontogenic myxomas (OMs) and their relationship with the tumor size. Material and Methods Eighteen OMs, 4 small ( 3cm) and 18 dental follicles (DF) that were included as control were studied by means of standard immunohistochemical procedure with RANK, RANKL and OPG antibodies. For the evaluation, 5 fields (40x) of representative areas of OM and DF were selected where the expression of each antibody was determined. Descriptive and comparative statistical analyses were performed with the obtained data. Results There are significant differences in the expression of RANK in OM samples as compared to DF (p = 0.022) and among the OMSs and OMLs (p = 0.032). Also a strong association is recognized in the expression of RANK-L and OPG in OM samples. Conclusions Activation of the RANK / RANK-L / OPG triad seems to be involved in the mechanisms of bone balance and destruction, as well as associated with tumor growth in odontogenic myxomas. Key words:Odontogenic myxoma, dental follicle, RANK, RANK-L, OPG, osteoclastogenesis. PMID:29680857

Some spacetimes with higher rank Killing-Staeckel tensors

International Nuclear Information System (INIS)

Gibbons, G.W.; Houri, T.; Kubiznak, D.; Warnick, C.M.

2011-01-01

By applying the lightlike Eisenhart lift to several known examples of low-dimensional integrable systems admitting integrals of motion of higher-order in momenta, we obtain four- and higher-dimensional Lorentzian spacetimes with irreducible higher-rank Killing tensors. Such metrics, we believe, are first examples of spacetimes admitting higher-rank Killing tensors. Included in our examples is a four-dimensional supersymmetric pp-wave spacetime, whose geodesic flow is superintegrable. The Killing tensors satisfy a non-trivial Poisson-Schouten-Nijenhuis algebra. We discuss the extension to the quantum regime.

Sparse structure regularized ranking

KAUST Repository

Wang, Jim Jing-Yan; Sun, Yijun; Gao, Xin

2014-01-01

Learning ranking scores is critical for the multimedia database retrieval problem. In this paper, we propose a novel ranking score learning algorithm by exploring the sparse structure and using it to regularize ranking scores. To explore the sparse

Spectral properties of the Google matrix of the World Wide Web and other directed networks.

Science.gov (United States)

Georgeot, Bertrand; Giraud, Olivier; Shepelyansky, Dima L

2010-05-01

We study numerically the spectrum and eigenstate properties of the Google matrix of various examples of directed networks such as vocabulary networks of dictionaries and university World Wide Web networks. The spectra have gapless structure in the vicinity of the maximal eigenvalue for Google damping parameter α equal to unity. The vocabulary networks have relatively homogeneous spectral density, while university networks have pronounced spectral structures which change from one university to another, reflecting specific properties of the networks. We also determine specific properties of eigenstates of the Google matrix, including the PageRank. The fidelity of the PageRank is proposed as a characterization of its stability.

Generalized canonical formalism and the S-matrix of theories with constraints of the general type

International Nuclear Information System (INIS)

Fradkina, T.Ye.

1987-01-01

A canonical quantization method is given for systems with first and second class constraints of arbitrary rank. The effectiveness of the method is demonstrated using sample Yang-Mills and gravitational fields. A correct expression is derived for the S-matrix of theories that are momentum-quadratic within the scope of canonical gauges, including ghost fields. Generalized quantization is performed and the S-matrix is derived in configurational space for theories of relativistic membranes representing a generalization of theories of strings to the case of an extended spatial implementation. It is demonstrated that the theory of membranes in n+l-dimensional space is a system with rank-n constraints

Development and validation of a job exposure matrix for physical risk factors in low back pain.

Directory of Open Access Journals (Sweden)

Svetlana Solovieva

Full Text Available OBJECTIVES: The aim was to construct and validate a gender-specific job exposure matrix (JEM for physical exposures to be used in epidemiological studies of low back pain (LBP. MATERIALS AND METHODS: We utilized two large Finnish population surveys, one to construct the JEM and another to test matrix validity. The exposure axis of the matrix included exposures relevant to LBP (heavy physical work, heavy lifting, awkward trunk posture and whole body vibration and exposures that increase the biomechanical load on the low back (arm elevation or those that in combination with other known risk factors could be related to LBP (kneeling or squatting. Job titles with similar work tasks and exposures were grouped. Exposure information was based on face-to-face interviews. Validity of the matrix was explored by comparing the JEM (group-based binary measures with individual-based measures. The predictive validity of the matrix against LBP was evaluated by comparing the associations of the group-based (JEM exposures with those of individual-based exposures. RESULTS: The matrix includes 348 job titles, representing 81% of all Finnish job titles in the early 2000s. The specificity of the constructed matrix was good, especially in women. The validity measured with kappa-statistic ranged from good to poor, being fair for most exposures. In men, all group-based (JEM exposures were statistically significantly associated with one-month prevalence of LBP. In women, four out of six group-based exposures showed an association with LBP. CONCLUSIONS: The gender-specific JEM for physical exposures showed relatively high specificity without compromising sensitivity. The matrix can therefore be considered as a valid instrument for exposure assessment in large-scale epidemiological studies, when more precise but more labour-intensive methods are not feasible. Although the matrix was based on Finnish data we foresee that it could be applicable, with some modifications, in

A novel application of PageRank and user preference algorithms for assessing the relative performance of track athletes in competition.

Science.gov (United States)

Beggs, Clive B; Shepherd, Simon J; Emmonds, Stacey; Jones, Ben

2017-01-01

Ranking enables coaches, sporting authorities, and pundits to determine the relative performance of individual athletes and teams in comparison to their peers. While ranking is relatively straightforward in sports that employ traditional leagues, it is more difficult in sports where competition is fragmented (e.g. athletics, boxing, etc.), with not all competitors competing against each other. In such situations, complex points systems are often employed to rank athletes. However, these systems have the inherent weakness that they frequently rely on subjective assessments in order to gauge the calibre of the competitors involved. Here we show how two Internet derived algorithms, the PageRank (PR) and user preference (UP) algorithms, when utilised with a simple 'who beat who' matrix, can be used to accurately rank track athletes, avoiding the need for subjective assessment. We applied the PR and UP algorithms to the 2015 IAAF Diamond League men's 100m competition and compared their performance with the Keener, Colley and Massey ranking algorithms. The top five places computed by the PR and UP algorithms, and the Diamond League '2016' points system were all identical, with the Kendall's tau distance between the PR standings and '2016' points system standings being just 15, indicating that only 5.9% of pairs differed in their order between these two lists. By comparison, the UP and '2016' standings displayed a less strong relationship, with a tau distance of 95, indicating that 37.6% of the pairs differed in their order. When compared with the standings produced using the Keener, Colley and Massey algorithms, the PR standings appeared to be closest to the Keener standings (tau distance = 67, 26.5% pair order disagreement), whereas the UP standings were more similar to the Colley and Massey standings, with the tau distances between these ranking lists being only 48 (19.0% pair order disagreement) and 59 (23.3% pair order disagreement) respectively. In particular, the

A novel application of PageRank and user preference algorithms for assessing the relative performance of track athletes in competition.

Directory of Open Access Journals (Sweden)

Clive B Beggs

Full Text Available Ranking enables coaches, sporting authorities, and pundits to determine the relative performance of individual athletes and teams in comparison to their peers. While ranking is relatively straightforward in sports that employ traditional leagues, it is more difficult in sports where competition is fragmented (e.g. athletics, boxing, etc., with not all competitors competing against each other. In such situations, complex points systems are often employed to rank athletes. However, these systems have the inherent weakness that they frequently rely on subjective assessments in order to gauge the calibre of the competitors involved. Here we show how two Internet derived algorithms, the PageRank (PR and user preference (UP algorithms, when utilised with a simple 'who beat who' matrix, can be used to accurately rank track athletes, avoiding the need for subjective assessment. We applied the PR and UP algorithms to the 2015 IAAF Diamond League men's 100m competition and compared their performance with the Keener, Colley and Massey ranking algorithms. The top five places computed by the PR and UP algorithms, and the Diamond League '2016' points system were all identical, with the Kendall's tau distance between the PR standings and '2016' points system standings being just 15, indicating that only 5.9% of pairs differed in their order between these two lists. By comparison, the UP and '2016' standings displayed a less strong relationship, with a tau distance of 95, indicating that 37.6% of the pairs differed in their order. When compared with the standings produced using the Keener, Colley and Massey algorithms, the PR standings appeared to be closest to the Keener standings (tau distance = 67, 26.5% pair order disagreement, whereas the UP standings were more similar to the Colley and Massey standings, with the tau distances between these ranking lists being only 48 (19.0% pair order disagreement and 59 (23.3% pair order disagreement respectively. In

Thermal characteristics and surface morphology of char during co-pyrolysis of low-rank coal blended with microalgal biomass: Effects of Nannochloropsis and Chlorella.

Science.gov (United States)

Wu, Zhiqiang; Yang, Wangcai; Yang, Bolun

2018-02-01

In this work, the influence of Nannochloropsis and Chlorella on the thermal behavior and surface morphology of char during the co-pyrolysis process were explored. Thermogravimetric and iso-conversional methods were applied to analyzing the pyrolytic and kinetic characteristics for different mass ratios of microalgae and low-rank coal (0, 3:1, 1:1, 1:3 and 1). Fractal theory was used to quantitatively determine the effect of microalgae on the morphological texture of co-pyrolysis char. The result indicated that both the Nannochloropsis and Chlorella promoted the release of volatile from low-rank coal. Different synergistic effects on the thermal parameters and yield of volatile were observed, which could be attributed to the different compositions in the Nannochloropsis and Chlorella and operating condition. The distribution of activation energies shows nonadditive characteristics. Fractal dimensions of the co-pyrolysis char were higher than the individual char, indicating the promotion of disordered degree due to the addition of microalgae. Copyright © 2017 Elsevier Ltd. All rights reserved.

DebtRank: A Microscopic Foundation for Shock Propagation.

Science.gov (United States)

Bardoscia, Marco; Battiston, Stefano; Caccioli, Fabio; Caldarelli, Guido

2015-01-01

The DebtRank algorithm has been increasingly investigated as a method to estimate the impact of shocks in financial networks, as it overcomes the limitations of the traditional default-cascade approaches. Here we formulate a dynamical "microscopic" theory of instability for financial networks by iterating balance sheet identities of individual banks and by assuming a simple rule for the transfer of shocks from borrowers to lenders. By doing so, we generalise the DebtRank formulation, both providing an interpretation of the effective dynamics in terms of basic accounting principles and preventing the underestimation of losses on certain network topologies. Depending on the structure of the interbank leverage matrix the dynamics is either stable, in which case the asymptotic state can be computed analytically, or unstable, meaning that at least one bank will default. We apply this framework to a dataset of the top listed European banks in the period 2008-2013. We find that network effects can generate an amplification of exogenous shocks of a factor ranging between three (in normal periods) and six (during the crisis) when we stress the system with a 0.5% shock on external (i.e. non-interbank) assets for all banks.

Multireference configuration interaction theory using cumulant reconstruction with internal contraction of density matrix renormalization group wave function.

Science.gov (United States)

Saitow, Masaaki; Kurashige, Yuki; Yanai, Takeshi

2013-07-28

We report development of the multireference configuration interaction (MRCI) method that can use active space scalable to much larger size references than has previously been possible. The recent development of the density matrix renormalization group (DMRG) method in multireference quantum chemistry offers the ability to describe static correlation in a large active space. The present MRCI method provides a critical correction to the DMRG reference by including high-level dynamic correlation through the CI treatment. When the DMRG and MRCI theories are combined (DMRG-MRCI), the full internal contraction of the reference in the MRCI ansatz, including contraction of semi-internal states, plays a central role. However, it is thought to involve formidable complexity because of the presence of the five-particle rank reduced-density matrix (RDM) in the Hamiltonian matrix elements. To address this complexity, we express the Hamiltonian matrix using commutators, which allows the five-particle rank RDM to be canceled out without any approximation. Then we introduce an approximation to the four-particle rank RDM by using a cumulant reconstruction from lower-particle rank RDMs. A computer-aided approach is employed to derive the exceedingly complex equations of the MRCI in tensor-contracted form and to implement them into an efficient parallel computer code. This approach extends to the size-consistency-corrected variants of MRCI, such as the MRCI+Q, MR-ACPF, and MR-AQCC methods. We demonstrate the capability of the DMRG-MRCI method in several benchmark applications, including the evaluation of single-triplet gap of free-base porphyrin using 24 active orbitals.

RankProd 2.0: a refactored bioconductor package for detecting differentially expressed features in molecular profiling datasets.

Science.gov (United States)

Del Carratore, Francesco; Jankevics, Andris; Eisinga, Rob; Heskes, Tom; Hong, Fangxin; Breitling, Rainer

2017-09-01

The Rank Product (RP) is a statistical technique widely used to detect differentially expressed features in molecular profiling experiments such as transcriptomics, metabolomics and proteomics studies. An implementation of the RP and the closely related Rank Sum (RS) statistics has been available in the RankProd Bioconductor package for several years. However, several recent advances in the understanding of the statistical foundations of the method have made a complete refactoring of the existing package desirable. We implemented a completely refactored version of the RankProd package, which provides a more principled implementation of the statistics for unpaired datasets. Moreover, the permutation-based P -value estimation methods have been replaced by exact methods, providing faster and more accurate results. RankProd 2.0 is available at Bioconductor ( https://www.bioconductor.org/packages/devel/bioc/html/RankProd.html ) and as part of the mzMatch pipeline ( http://www.mzmatch.sourceforge.net ). rainer.breitling@manchester.ac.uk. Supplementary data are available at Bioinformatics online. © The Author(s) 2017. Published by Oxford University Press.

Ranked retrieval of segmented nuclei for objective assessment of cancer gene repositioning

Directory of Open Access Journals (Sweden)

Cukierski William J

2012-09-01

Full Text Available Abstract Background Correct segmentation is critical to many applications within automated microscopy image analysis. Despite the availability of advanced segmentation algorithms, variations in cell morphology, sample preparation, and acquisition settings often lead to segmentation errors. This manuscript introduces a ranked-retrieval approach using logistic regression to automate selection of accurately segmented nuclei from a set of candidate segmentations. The methodology is validated on an application of spatial gene repositioning in breast cancer cell nuclei. Gene repositioning is analyzed in patient tissue sections by labeling sequences with fluorescence in situ hybridization (FISH, followed by measurement of the relative position of each gene from the nuclear center to the nuclear periphery. This technique requires hundreds of well-segmented nuclei per sample to achieve statistical significance. Although the tissue samples in this study contain a surplus of available nuclei, automatic identification of the well-segmented subset remains a challenging task. Results Logistic regression was applied to features extracted from candidate segmented nuclei, including nuclear shape, texture, context, and gene copy number, in order to rank objects according to the likelihood of being an accurately segmented nucleus. The method was demonstrated on a tissue microarray dataset of 43 breast cancer patients, comprising approximately 40,000 imaged nuclei in which the HES5 and FRA2 genes were labeled with FISH probes. Three trained reviewers independently classified nuclei into three classes of segmentation accuracy. In man vs. machine studies, the automated method outperformed the inter-observer agreement between reviewers, as measured by area under the receiver operating characteristic (ROC curve. Robustness of gene position measurements to boundary inaccuracies was demonstrated by comparing 1086 manually and automatically segmented nuclei. Pearson

On low cycle fatigue in metal matrix composites

DEFF Research Database (Denmark)

Pedersen, Thomas Ø; Tvergaard, Viggo

2000-01-01

A numerical cell model analysis is used to study the development of fatigue damage in aluminium reinforced by aligned, short SiC fibres. The material is subjected to cyclic loading with either stress control or strain control, and the matrix material is represented by a cyclic plasticity model......, in which continuum damage mechanics is incorporated to model fatigue damage evolution. This material model uses a superposition of kinematic and isotropic hardening, and is able to account for the Bauschinger effect as well as ratchetting, mean stress relaxation, and cyclic hardening or softening. The cell...... model represents a material with transversely staggered fibres. With focus on low cyclic fatigue, the effect of different fibre aspect ratios, different triaxial stress states, and balanced as well as unbalanced cyclic loading is studied....

Orbifolds and Exact Solutions of Strongly-Coupled Matrix Models

Science.gov (United States)

Córdova, Clay; Heidenreich, Ben; Popolitov, Alexandr; Shakirov, Shamil

2018-02-01

We find an exact solution to strongly-coupled matrix models with a single-trace monomial potential. Our solution yields closed form expressions for the partition function as well as averages of Schur functions. The results are fully factorized into a product of terms linear in the rank of the matrix and the parameters of the model. We extend our formulas to include both logarithmic and finite-difference deformations, thereby generalizing the celebrated Selberg and Kadell integrals. We conjecture a formula for correlators of two Schur functions in these models, and explain how our results follow from a general orbifold-like procedure that can be applied to any one-matrix model with a single-trace potential.

Tensor Completion for Estimating Missing Values in Visual Data

KAUST Repository

Liu, Ji

2012-01-25

In this paper, we propose an algorithm to estimate missing values in tensors of visual data. The values can be missing due to problems in the acquisition process or because the user manually identified unwanted outliers. Our algorithm works even with a small amount of samples and it can propagate structure to fill larger missing regions. Our methodology is built on recent studies about matrix completion using the matrix trace norm. The contribution of our paper is to extend the matrix case to the tensor case by proposing the first definition of the trace norm for tensors and then by building a working algorithm. First, we propose a definition for the tensor trace norm that generalizes the established definition of the matrix trace norm. Second, similarly to matrix completion, the tensor completion is formulated as a convex optimization problem. Unfortunately, the straightforward problem extension is significantly harder to solve than the matrix case because of the dependency among multiple constraints. To tackle this problem, we developed three algorithms: simple low rank tensor completion (SiLRTC), fast low rank tensor completion (FaLRTC), and high accuracy low rank tensor completion (HaLRTC). The SiLRTC algorithm is simple to implement and employs a relaxation technique to separate the dependant relationships and uses the block coordinate descent (BCD) method to achieve a globally optimal solution; the FaLRTC algorithm utilizes a smoothing scheme to transform the original nonsmooth problem into a smooth one and can be used to solve a general tensor trace norm minimization problem; the HaLRTC algorithm applies the alternating direction method of multipliers (ADMMs) to our problem. Our experiments show potential applications of our algorithms and the quantitative evaluation indicates that our methods are more accurate and robust than heuristic approaches. The efficiency comparison indicates that FaLTRC and HaLRTC are more efficient than SiLRTC and between Fa

Tensor Completion for Estimating Missing Values in Visual Data

KAUST Repository

Liu, Ji; Musialski, Przemyslaw; Wonka, Peter; Ye, Jieping

2012-01-01

In this paper, we propose an algorithm to estimate missing values in tensors of visual data. The values can be missing due to problems in the acquisition process or because the user manually identified unwanted outliers. Our algorithm works even with a small amount of samples and it can propagate structure to fill larger missing regions. Our methodology is built on recent studies about matrix completion using the matrix trace norm. The contribution of our paper is to extend the matrix case to the tensor case by proposing the first definition of the trace norm for tensors and then by building a working algorithm. First, we propose a definition for the tensor trace norm that generalizes the established definition of the matrix trace norm. Second, similarly to matrix completion, the tensor completion is formulated as a convex optimization problem. Unfortunately, the straightforward problem extension is significantly harder to solve than the matrix case because of the dependency among multiple constraints. To tackle this problem, we developed three algorithms: simple low rank tensor completion (SiLRTC), fast low rank tensor completion (FaLRTC), and high accuracy low rank tensor completion (HaLRTC). The SiLRTC algorithm is simple to implement and employs a relaxation technique to separate the dependant relationships and uses the block coordinate descent (BCD) method to achieve a globally optimal solution; the FaLRTC algorithm utilizes a smoothing scheme to transform the original nonsmooth problem into a smooth one and can be used to solve a general tensor trace norm minimization problem; the HaLRTC algorithm applies the alternating direction method of multipliers (ADMMs) to our problem. Our experiments show potential applications of our algorithms and the quantitative evaluation indicates that our methods are more accurate and robust than heuristic approaches. The efficiency comparison indicates that FaLTRC and HaLRTC are more efficient than SiLRTC and between Fa

Tensor completion for estimating missing values in visual data.

Science.gov (United States)

Liu, Ji; Musialski, Przemyslaw; Wonka, Peter; Ye, Jieping

2013-01-01

In this paper, we propose an algorithm to estimate missing values in tensors of visual data. The values can be missing due to problems in the acquisition process or because the user manually identified unwanted outliers. Our algorithm works even with a small amount of samples and it can propagate structure to fill larger missing regions. Our methodology is built on recent studies about matrix completion using the matrix trace norm. The contribution of our paper is to extend the matrix case to the tensor case by proposing the first definition of the trace norm for tensors and then by building a working algorithm. First, we propose a definition for the tensor trace norm that generalizes the established definition of the matrix trace norm. Second, similarly to matrix completion, the tensor completion is formulated as a convex optimization problem. Unfortunately, the straightforward problem extension is significantly harder to solve than the matrix case because of the dependency among multiple constraints. To tackle this problem, we developed three algorithms: simple low rank tensor completion (SiLRTC), fast low rank tensor completion (FaLRTC), and high accuracy low rank tensor completion (HaLRTC). The SiLRTC algorithm is simple to implement and employs a relaxation technique to separate the dependent relationships and uses the block coordinate descent (BCD) method to achieve a globally optimal solution; the FaLRTC algorithm utilizes a smoothing scheme to transform the original nonsmooth problem into a smooth one and can be used to solve a general tensor trace norm minimization problem; the HaLRTC algorithm applies the alternating direction method of multipliers (ADMMs) to our problem. Our experiments show potential applications of our algorithms and the quantitative evaluation indicates that our methods are more accurate and robust than heuristic approaches. The efficiency comparison indicates that FaLTRC and HaLRTC are more efficient than SiLRTC and between FaLRTC an

Automatic vowels selection and ranking in Russian enciphered texts

Directory of Open Access Journals (Sweden)

Yuri I. Petrenko

2018-01-01

, defined as the difference between the conditional probabilities of vowel-consonant and vowelvowel diagram’s types. For an alphabet consisted of N characters the program defines a combination of a given number k of “vowels” by exhaustive search. This combination of k symbols maximizes Markov criterion. The order relation of the new “vowels” for k = 1, 2, 3... characterizes the descending of their “strength” and can be used to separate vowels from consonants. In texts of sufficient volume there are possible approximate ranking of the vowel’s set. A more accurate ranking is possible when as a measure of “symbol power” Markov criterion’s increments are used. The algorithm speed can be greatly accelerated by using some tricks of steepest descent method. The test program discovered the independence of Markov criterion from the text’s author as well as its unimodality for long texts. Using this criterion, the algorithm can separate vowels from consonants for short (up to 100 characters texts as well as the ranking of vowels for texts as small as 250-500 letters. The similarity of Markov criterion’s statistics of letters “ь”, “ъ” and standard vowels is discovered. These two letters are inseparable by Markov criterion method from the standard vowels. The test results showed that Markov criterion method can be used for cryptanalysis of short Russian texts as well as texts of the other consonant languages. 

Investigation of plasma-related matrix effects in inductively coupled plasma-atomic emission spectrometry caused by matrices with low second ionization potentials-identification of the secondary factor

International Nuclear Information System (INIS)

Chan, George C.-Y.; Hieftje, Gary M.

2006-01-01

Plasma-related matrix effects induced by a comprehensive list of matrix elements (a total of fifty-one matrices) in inductively coupled plasma-atomic emission spectrometry were investigated and used to confirm that matrix effects caused by elements with a low second ionization potential are more severe than those from matrix elements having a low first ionization potential. Although the matrix effect is correlated unambiguously with the second ionization potential of a matrix, the correlation is not monotonic, which suggests that at least one other factor is operative. Through study of a large pool of matrix elements, it becomes possible to identify another critical parameter that defines the magnitude of the matrix effect; namely the presence of low-lying energy levels in the doubly charged matrix ion. Penning ionization by Ar excited states is proposed as the dominant mechanism for both analyte ionization/excitation and matrix effects; matrices with a low second ionization potential can effectively quench the population of Ar excited states through successive Penning ionization followed by ion-electron recombination and lead to more severe matrix effects

Text mixing shapes the anatomy of rank-frequency distributions

Science.gov (United States)

Williams, Jake Ryland; Bagrow, James P.; Danforth, Christopher M.; Dodds, Peter Sheridan

2015-05-01

Natural languages are full of rules and exceptions. One of the most famous quantitative rules is Zipf's law, which states that the frequency of occurrence of a word is approximately inversely proportional to its rank. Though this "law" of ranks has been found to hold across disparate texts and forms of data, analyses of increasingly large corpora since the late 1990s have revealed the existence of two scaling regimes. These regimes have thus far been explained by a hypothesis suggesting a separability of languages into core and noncore lexica. Here we present and defend an alternative hypothesis that the two scaling regimes result from the act of aggregating texts. We observe that text mixing leads to an effective decay of word introduction, which we show provides accurate predictions of the location and severity of breaks in scaling. Upon examining large corpora from 10 languages in the Project Gutenberg eBooks collection, we find emphatic empirical support for the universality of our claim.

Multiple graph regularized protein domain ranking.

Science.gov (United States)

Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin

2012-11-19

Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.

Rank-dependant factorization of entanglement evolution

International Nuclear Information System (INIS)

Siomau, Michael

2016-01-01

Highlights: • In some cases the complex entanglement evolution can be factorized on simple terms. • We suggest factorization equations for multiqubit entanglement evolution. • The factorization is solely defined by the rank of the final state density matrices. • The factorization is independent on the local noisy channels and initial pure states. - Abstract: The description of the entanglement evolution of a complex quantum system can be significantly simplified due to the symmetries of the initial state and the quantum channels, which simultaneously affect parts of the system. Using concurrence as the entanglement measure, we study the entanglement evolution of few qubit systems, when each of the qubits is affected by a local unital channel independently on the others. We found that for low-rank density matrices of the final quantum state, such complex entanglement dynamics can be completely described by a combination of independent factors representing the evolution of entanglement of the initial state, when just one of the qubits is affected by a local channel. We suggest necessary conditions for the rank of the density matrices to represent the entanglement evolution through the factors. Our finding is supported with analytical examples and numerical simulations.

Multiplex PageRank.

Directory of Open Access Journals (Sweden)

Arda Halu

Full Text Available Many complex systems can be described as multiplex networks in which the same nodes can interact with one another in different layers, thus forming a set of interacting and co-evolving networks. Examples of such multiplex systems are social networks where people are involved in different types of relationships and interact through various forms of communication media. The ranking of nodes in multiplex networks is one of the most pressing and challenging tasks that research on complex networks is currently facing. When pairs of nodes can be connected through multiple links and in multiple layers, the ranking of nodes should necessarily reflect the importance of nodes in one layer as well as their importance in other interdependent layers. In this paper, we draw on the idea of biased random walks to define the Multiplex PageRank centrality measure in which the effects of the interplay between networks on the centrality of nodes are directly taken into account. In particular, depending on the intensity of the interaction between layers, we define the Additive, Multiplicative, Combined, and Neutral versions of Multiplex PageRank, and show how each version reflects the extent to which the importance of a node in one layer affects the importance the node can gain in another layer. We discuss these measures and apply them to an online multiplex social network. Findings indicate that taking the multiplex nature of the network into account helps uncover the emergence of rankings of nodes that differ from the rankings obtained from one single layer. Results provide support in favor of the salience of multiplex centrality measures, like Multiplex PageRank, for assessing the prominence of nodes embedded in multiple interacting networks, and for shedding a new light on structural properties that would otherwise remain undetected if each of the interacting networks were analyzed in isolation.

Multiplex PageRank.

Science.gov (United States)

Halu, Arda; Mondragón, Raúl J; Panzarasa, Pietro; Bianconi, Ginestra

2013-01-01

Many complex systems can be described as multiplex networks in which the same nodes can interact with one another in different layers, thus forming a set of interacting and co-evolving networks. Examples of such multiplex systems are social networks where people are involved in different types of relationships and interact through various forms of communication media. The ranking of nodes in multiplex networks is one of the most pressing and challenging tasks that research on complex networks is currently facing. When pairs of nodes can be connected through multiple links and in multiple layers, the ranking of nodes should necessarily reflect the importance of nodes in one layer as well as their importance in other interdependent layers. In this paper, we draw on the idea of biased random walks to define the Multiplex PageRank centrality measure in which the effects of the interplay between networks on the centrality of nodes are directly taken into account. In particular, depending on the intensity of the interaction between layers, we define the Additive, Multiplicative, Combined, and Neutral versions of Multiplex PageRank, and show how each version reflects the extent to which the importance of a node in one layer affects the importance the node can gain in another layer. We discuss these measures and apply them to an online multiplex social network. Findings indicate that taking the multiplex nature of the network into account helps uncover the emergence of rankings of nodes that differ from the rankings obtained from one single layer. Results provide support in favor of the salience of multiplex centrality measures, like Multiplex PageRank, for assessing the prominence of nodes embedded in multiple interacting networks, and for shedding a new light on structural properties that would otherwise remain undetected if each of the interacting networks were analyzed in isolation.

Google matrix analysis of the multiproduct world trade network

Science.gov (United States)

Ermann, Leonardo; Shepelyansky, Dima L.

2015-04-01

Using the United Nations COMTRADE database [United Nations Commodity Trade Statistics Database, available at: http://comtrade.un.org/db/. Accessed November (2014)] we construct the Google matrix G of multiproduct world trade between the UN countries and analyze the properties of trade flows on this network for years 1962-2010. This construction, based on Markov chains, treats all countries on equal democratic grounds independently of their richness and at the same time it considers the contributions of trade products proportionally to their trade volume. We consider the trade with 61 products for up to 227 countries. The obtained results show that the trade contribution of products is asymmetric: some of them are export oriented while others are import oriented even if the ranking by their trade volume is symmetric in respect to export and import after averaging over all world countries. The construction of the Google matrix allows to investigate the sensitivity of trade balance in respect to price variations of products, e.g. petroleum and gas, taking into account the world connectivity of trade links. The trade balance based on PageRank and CheiRank probabilities highlights the leading role of China and other BRICS countries in the world trade in recent years. We also show that the eigenstates of G with large eigenvalues select specific trade communities.

Batched Triangular Dense Linear Algebra Kernels for Very Small Matrix Sizes on GPUs

KAUST Repository

Charara, Ali; Keyes, David E.; Ltaief, Hatem

2017-01-01

Batched dense linear algebra kernels are becoming ubiquitous in scientific applications, ranging from tensor contractions in deep learning to data compression in hierarchical low-rank matrix approximation. Within a single API call, these kernels are capable of simultaneously launching up to thousands of similar matrix computations, removing the expensive overhead of multiple API calls while increasing the occupancy of the underlying hardware. A challenge is that for the existing hardware landscape (x86, GPUs, etc.), only a subset of the required batched operations is implemented by the vendors, with limited support for very small problem sizes. We describe the design and performance of a new class of batched triangular dense linear algebra kernels on very small data sizes using single and multiple GPUs. By deploying two-sided recursive formulations, stressing the register usage, maintaining data locality, reducing threads synchronization and fusing successive kernel calls, the new batched kernels outperform existing state-of-the-art implementations.

Batched Triangular Dense Linear Algebra Kernels for Very Small Matrix Sizes on GPUs

KAUST Repository

Charara, Ali

2017-03-06

Batched dense linear algebra kernels are becoming ubiquitous in scientific applications, ranging from tensor contractions in deep learning to data compression in hierarchical low-rank matrix approximation. Within a single API call, these kernels are capable of simultaneously launching up to thousands of similar matrix computations, removing the expensive overhead of multiple API calls while increasing the occupancy of the underlying hardware. A challenge is that for the existing hardware landscape (x86, GPUs, etc.), only a subset of the required batched operations is implemented by the vendors, with limited support for very small problem sizes. We describe the design and performance of a new class of batched triangular dense linear algebra kernels on very small data sizes using single and multiple GPUs. By deploying two-sided recursive formulations, stressing the register usage, maintaining data locality, reducing threads synchronization and fusing successive kernel calls, the new batched kernels outperform existing state-of-the-art implementations.

Multiple graph regularized protein domain ranking

KAUST Repository

Wang, Jim Jing-Yan

2012-11-19

Background: Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.Results: To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.Conclusion: The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. 2012 Wang et al; licensee BioMed Central Ltd.

Multiple graph regularized protein domain ranking

KAUST Repository

Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin

2012-01-01

Background: Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.Results: To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.Conclusion: The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. 2012 Wang et al; licensee BioMed Central Ltd.

Multiple graph regularized protein domain ranking

Directory of Open Access Journals (Sweden)

Wang Jim

2012-11-01

Full Text Available Abstract Background Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. Results To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. Conclusion The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.

Ceramic matrix and resin matrix composites - A comparison

Science.gov (United States)

Hurwitz, Frances I.

1987-01-01

The underlying theory of continuous fiber reinforcement of ceramic matrix and resin matrix composites, their fabrication, microstructure, physical and mechanical properties are contrasted. The growing use of organometallic polymers as precursors to ceramic matrices is discussed as a means of providing low temperature processing capability without the fiber degradation encountered with more conventional ceramic processing techniques. Examples of ceramic matrix composites derived from particulate-filled, high char yield polymers and silsesquioxane precursors are provided.

Ceramic matrix and resin matrix composites: A comparison

Science.gov (United States)

Hurwitz, Frances I.

1987-01-01

The underlying theory of continuous fiber reinforcement of ceramic matrix and resin matrix composites, their fabrication, microstructure, physical and mechanical properties are contrasted. The growing use of organometallic polymers as precursors to ceramic matrices is discussed as a means of providing low temperature processing capability without the fiber degradation encountered with more conventional ceramic processing techniques. Examples of ceramic matrix composites derived from particulate-filled, high char yield polymers and silsesquioxane precursors are provided.

On the viability of rank-six superstring models

International Nuclear Information System (INIS)

Campbell, B.A.; Olive, K.A.; Reiss, D.B.

1988-01-01

We consider the possibility of breaking a rank-six superstring model to the rank-four standard model. In particular, we point out the difficulties in generating two vacuum expectation values for the two standard model singlets contained in the 27 of E 6 . Although one expectation value is compatible with low energy phenomenology, a vev for ν c is problematic because of the absence of large neutrino masses and/or flavor changing neutral currents. We show that even simple models containing extra fields from incomplete multiplets or E 6 singlets do not resolve these problems. (orig.)

Improving Ranking Using Quantum Probability

OpenAIRE

Melucci, Massimo

2011-01-01

The paper shows that ranking information units by quantum probability differs from ranking them by classical probability provided the same data used for parameter estimation. As probability of detection (also known as recall or power) and probability of false alarm (also known as fallout or size) measure the quality of ranking, we point out and show that ranking by quantum probability yields higher probability of detection than ranking by classical probability provided a given probability of ...

Low rank alternating direction method of multipliers reconstruction for MR fingerprinting.

Science.gov (United States)

Assländer, Jakob; Cloos, Martijn A; Knoll, Florian; Sodickson, Daniel K; Hennig, Jürgen; Lattanzi, Riccardo

2018-01-01

The proposed reconstruction framework addresses the reconstruction accuracy, noise propagation and computation time for magnetic resonance fingerprinting. Based on a singular value decomposition of the signal evolution, magnetic resonance fingerprinting is formulated as a low rank (LR) inverse problem in which one image is reconstructed for each singular value under consideration. This LR approximation of the signal evolution reduces the computational burden by reducing the number of Fourier transformations. Also, the LR approximation improves the conditioning of the problem, which is further improved by extending the LR inverse problem to an augmented Lagrangian that is solved by the alternating direction method of multipliers. The root mean square error and the noise propagation are analyzed in simulations. For verification, in vivo examples are provided. The proposed LR alternating direction method of multipliers approach shows a reduced root mean square error compared to the original fingerprinting reconstruction, to a LR approximation alone and to an alternating direction method of multipliers approach without a LR approximation. Incorporating sensitivity encoding allows for further artifact reduction. The proposed reconstruction provides robust convergence, reduced computational burden and improved image quality compared to other magnetic resonance fingerprinting reconstruction approaches evaluated in this study. Magn Reson Med 79:83-96, 2018. © 2017 International Society for Magnetic Resonance in Medicine. © 2017 International Society for Magnetic Resonance in Medicine.

How Many Alternatives Can Be Ranked? A Comparison of the Paired Comparison and Ranking Methods.

Science.gov (United States)

Ock, Minsu; Yi, Nari; Ahn, Jeonghoon; Jo, Min-Woo

2016-01-01

To determine the feasibility of converting ranking data into paired comparison (PC) data and suggest the number of alternatives that can be ranked by comparing a PC and a ranking method. Using a total of 222 health states, a household survey was conducted in a sample of 300 individuals from the general population. Each respondent performed a PC 15 times and a ranking method 6 times (two attempts of ranking three, four, and five health states, respectively). The health states of the PC and the ranking method were constructed to overlap each other. We converted the ranked data into PC data and examined the consistency of the response rate. Applying probit regression, we obtained the predicted probability of each method. Pearson correlation coefficients were determined between the predicted probabilities of those methods. The mean absolute error was also assessed between the observed and the predicted values. The overall consistency of the response rate was 82.8%. The Pearson correlation coefficients were 0.789, 0.852, and 0.893 for ranking three, four, and five health states, respectively. The lowest mean absolute error was 0.082 (95% confidence interval [CI] 0.074-0.090) in ranking five health states, followed by 0.123 (95% CI 0.111-0.135) in ranking four health states and 0.126 (95% CI 0.113-0.138) in ranking three health states. After empirically examining the consistency of the response rate between a PC and a ranking method, we suggest that using five alternatives in the ranking method may be superior to using three or four alternatives. Copyright © 2016 International Society for Pharmacoeconomics and Outcomes Research (ISPOR). Published by Elsevier Inc. All rights reserved.

Development of immobilizing matrix for radioactive hearth ash of low activity level

International Nuclear Information System (INIS)

Greben'kov, A.J.; Kopets, Z.V.; Rytvinskaya, E.V.; Vecher, V.A.

2004-01-01

The incorporation of a certain quantity of the sorbing admixtures, i.e. the clay containing about 80 mas.% of montmorillonite, natural molding flask, into an ash-cement matrix allowed obtaining the hardened compounds with radioactive ash mass fraction of 40-60 mas.%, which physicochemical characteristics are significantly better that those required by regulations. This will facilitate the development of effective low active hearth ash utilization technologies. (authors)

Multimodal biometric system using rank-level fusion approach.

Science.gov (United States)

Monwar, Md Maruf; Gavrilova, Marina L

2009-08-01

In many real-world applications, unimodal biometric systems often face significant limitations due to sensitivity to noise, intraclass variability, data quality, nonuniversality, and other factors. Attempting to improve the performance of individual matchers in such situations may not prove to be highly effective. Multibiometric systems seek to alleviate some of these problems by providing multiple pieces of evidence of the same identity. These systems help achieve an increase in performance that may not be possible using a single-biometric indicator. This paper presents an effective fusion scheme that combines information presented by multiple domain experts based on the rank-level fusion integration method. The developed multimodal biometric system possesses a number of unique qualities, starting from utilizing principal component analysis and Fisher's linear discriminant methods for individual matchers (face, ear, and signature) identity authentication and utilizing the novel rank-level fusion method in order to consolidate the results obtained from different biometric matchers. The ranks of individual matchers are combined using the highest rank, Borda count, and logistic regression approaches. The results indicate that fusion of individual modalities can improve the overall performance of the biometric system, even in the presence of low quality data. Insights on multibiometric design using rank-level fusion and its performance on a variety of biometric databases are discussed in the concluding section.

Neophilia Ranking of Scientific Journals.

Science.gov (United States)

Packalen, Mikko; Bhattacharya, Jay

2017-01-01

The ranking of scientific journals is important because of the signal it sends to scientists about what is considered most vital for scientific progress. Existing ranking systems focus on measuring the influence of a scientific paper (citations)-these rankings do not reward journals for publishing innovative work that builds on new ideas. We propose an alternative ranking based on the proclivity of journals to publish papers that build on new ideas, and we implement this ranking via a text-based analysis of all published biomedical papers dating back to 1946. In addition, we compare our neophilia ranking to citation-based (impact factor) rankings; this comparison shows that the two ranking approaches are distinct. Prior theoretical work suggests an active role for our neophilia index in science policy. Absent an explicit incentive to pursue novel science, scientists underinvest in innovative work because of a coordination problem: for work on a new idea to flourish, many scientists must decide to adopt it in their work. Rankings that are based purely on influence thus do not provide sufficient incentives for publishing innovative work. By contrast, adoption of the neophilia index as part of journal-ranking procedures by funding agencies and university administrators would provide an explicit incentive for journals to publish innovative work and thus help solve the coordination problem by increasing scientists' incentives to pursue innovative work.

Hierarchical partial order ranking

International Nuclear Information System (INIS)

Carlsen, Lars

2008-01-01

Assessing the potential impact on environmental and human health from the production and use of chemicals or from polluted sites involves a multi-criteria evaluation scheme. A priori several parameters are to address, e.g., production tonnage, specific release scenarios, geographical and site-specific factors in addition to various substance dependent parameters. Further socio-economic factors may be taken into consideration. The number of parameters to be included may well appear to be prohibitive for developing a sensible model. The study introduces hierarchical partial order ranking (HPOR) that remedies this problem. By HPOR the original parameters are initially grouped based on their mutual connection and a set of meta-descriptors is derived representing the ranking corresponding to the single groups of descriptors, respectively. A second partial order ranking is carried out based on the meta-descriptors, the final ranking being disclosed though average ranks. An illustrative example on the prioritisation of polluted sites is given. - Hierarchical partial order ranking of polluted sites has been developed for prioritization based on a large number of parameters

Matrix Completion Optimization for Localization in Wireless Sensor Networks for Intelligent IoT

Directory of Open Access Journals (Sweden)

Thu L. N. Nguyen

2016-05-01

Full Text Available Localization in wireless sensor networks (WSNs is one of the primary functions of the intelligent Internet of Things (IoT that offers automatically discoverable services, while the localization accuracy is a key issue to evaluate the quality of those services. In this paper, we develop a framework to solve the Euclidean distance matrix completion problem, which is an important technical problem for distance-based localization in WSNs. The sensor network localization problem is described as a low-rank dimensional Euclidean distance completion problem with known nodes. The task is to find the sensor locations through recovery of missing entries of a squared distance matrix when the dimension of the data is small compared to the number of data points. We solve a relaxation optimization problem using a modification of Newton’s method, where the cost function depends on the squared distance matrix. The solution obtained in our scheme achieves a lower complexity and can perform better if we use it as an initial guess for an interactive local search of other higher precision localization scheme. Simulation results show the effectiveness of our approach.

Google matrix analysis of directed networks

Science.gov (United States)

Ermann, Leonardo; Frahm, Klaus M.; Shepelyansky, Dima L.

2015-10-01

In the past decade modern societies have developed enormous communication and social networks. Their classification and information retrieval processing has become a formidable task for the society. Because of the rapid growth of the World Wide Web, and social and communication networks, new mathematical methods have been invented to characterize the properties of these networks in a more detailed and precise way. Various search engines extensively use such methods. It is highly important to develop new tools to classify and rank a massive amount of network information in a way that is adapted to internal network structures and characteristics. This review describes the Google matrix analysis of directed complex networks demonstrating its efficiency using various examples including the World Wide Web, Wikipedia, software architectures, world trade, social and citation networks, brain neural networks, DNA sequences, and Ulam networks. The analytical and numerical matrix methods used in this analysis originate from the fields of Markov chains, quantum chaos, and random matrix theory.

Matrix completion by deep matrix factorization.

Science.gov (United States)

Fan, Jicong; Cheng, Jieyu

2018-02-01

Conventional methods of matrix completion are linear methods that are not effective in handling data of nonlinear structures. Recently a few researchers attempted to incorporate nonlinear techniques into matrix completion but there still exists considerable limitations. In this paper, a novel method called deep matrix factorization (DMF) is proposed for nonlinear matrix completion. Different from conventional matrix completion methods that are based on linear latent variable models, DMF is on the basis of a nonlinear latent variable model. DMF is formulated as a deep-structure neural network, in which the inputs are the low-dimensional unknown latent variables and the outputs are the partially observed variables. In DMF, the inputs and the parameters of the multilayer neural network are simultaneously optimized to minimize the reconstruction errors for the observed entries. Then the missing entries can be readily recovered by propagating the latent variables to the output layer. DMF is compared with state-of-the-art methods of linear and nonlinear matrix completion in the tasks of toy matrix completion, image inpainting and collaborative filtering. The experimental results verify that DMF is able to provide higher matrix completion accuracy than existing methods do and DMF is applicable to large matrices. Copyright © 2017 Elsevier Ltd. All rights reserved.