Massive Asynchronous Parallelization of Sparse Matrix Factorizations
Energy Technology Data Exchange (ETDEWEB)
Chow, Edmond [Georgia Inst. of Technology, Atlanta, GA (United States)
2018-01-08
Solving sparse problems is at the core of many DOE computational science applications. We focus on the challenge of developing sparse algorithms that can fully exploit the parallelism in extreme-scale computing systems, in particular systems with massive numbers of cores per node. Our approach is to express a sparse matrix factorization as a large number of bilinear constraint equations, and then solving these equations via an asynchronous iterative method. The unknowns in these equations are the matrix entries of the factorization that is desired.
Enforced Sparse Non-Negative Matrix Factorization
2016-01-23
proposals quotas opec legislation revenue england ico iraq vote passenger yen producer iranian surplus Figure 4. Example NMF with and without sparsity...preprint arXiv:1007.0380, 2010. [22] A. Cichocki and P. Anh-Huy, “Fast local algorithms for large scale nonnegative matrix and tensor factorizations
Sparse-matrix factorizations for fast symmetric Fourier transforms
International Nuclear Information System (INIS)
Sequel, J.
1987-01-01
This work proposes new fast algorithms computing the discrete Fourier transform of certain families of symmetric sequences. Sequences commonly found in problems of structure determination by x-ray crystallography and in numerical solutions of boundary-value problems in partial differential equations are dealt with. In the algorithms presented, the redundancies in the input and output data, due to the presence of symmetries in the input data sequence, were eliminated. Using ring-theoretical methods a matrix representation is obtained for the remaining calculations; which factors as the product of a complex block-diagonal matrix times as integral matrix. A basic two-step algorithm scheme arises from this factorization with a first step consisting of pre-additions and a second step containing the calculations involved in computing with the blocks in the block-diagonal factor. These blocks are structured as block-Hankel matrices, and two sparse-matrix factoring formulas are developed in order to diminish their arithmetic complexity
Sparse Nonnegative Matrix Factorization Strategy for Cochlear Implants
Directory of Open Access Journals (Sweden)
Hongmei Hu
2015-12-01
Full Text Available Current cochlear implant (CI strategies carry speech information via the waveform envelope in frequency subbands. CIs require efficient speech processing to maximize information transfer to the brain, especially in background noise, where the speech envelope is not robust to noise interference. In such conditions, the envelope, after decomposition into frequency bands, may be enhanced by sparse transformations, such as nonnegative matrix factorization (NMF. Here, a novel CI processing algorithm is described, which works by applying NMF to the envelope matrix (envelopogram of 22 frequency channels in order to improve performance in noisy environments. It is evaluated for speech in eight-talker babble noise. The critical sparsity constraint parameter was first tuned using objective measures and then evaluated with subjective speech perception experiments for both normal hearing and CI subjects. Results from vocoder simulations with 10 normal hearing subjects showed that the algorithm significantly enhances speech intelligibility with the selected sparsity constraints. Results from eight CI subjects showed no significant overall improvement compared with the standard advanced combination encoder algorithm, but a trend toward improvement of word identification of about 10 percentage points at +15 dB signal-to-noise ratio (SNR was observed in the eight CI subjects. Additionally, a considerable reduction of the spread of speech perception performance from 40% to 93% for advanced combination encoder to 80% to 100% for the suggested NMF coding strategy was observed.
Xuan, Junyu; Lu, Jie; Zhang, Guangquan; Xu, Richard Yi Da; Luo, Xiangfeng
2018-05-01
Sparse nonnegative matrix factorization (SNMF) aims to factorize a data matrix into two optimized nonnegative sparse factor matrices, which could benefit many tasks, such as document-word co-clustering. However, the traditional SNMF typically assumes the number of latent factors (i.e., dimensionality of the factor matrices) to be fixed. This assumption makes it inflexible in practice. In this paper, we propose a doubly sparse nonparametric NMF framework to mitigate this issue by using dependent Indian buffet processes (dIBP). We apply a correlation function for the generation of two stick weights associated with each column pair of factor matrices while still maintaining their respective marginal distribution specified by IBP. As a consequence, the generation of two factor matrices will be columnwise correlated. Under this framework, two classes of correlation function are proposed: 1) using bivariate Beta distribution and 2) using Copula function. Compared with the single IBP-based NMF, this paper jointly makes two factor matrices nonparametric and sparse, which could be applied to broader scenarios, such as co-clustering. This paper is seen to be much more flexible than Gaussian process-based and hierarchial Beta process-based dIBPs in terms of allowing the two corresponding binary matrix columns to have greater variations in their nonzero entries. Our experiments on synthetic data show the merits of this paper compared with the state-of-the-art models in respect of factorization efficiency, sparsity, and flexibility. Experiments on real-world data sets demonstrate the efficiency of this paper in document-word co-clustering tasks.
Turbo-SMT: Parallel Coupled Sparse Matrix-Tensor Factorizations and Applications
Papalexakis, Evangelos E.; Faloutsos, Christos; Mitchell, Tom M.; Talukdar, Partha Pratim; Sidiropoulos, Nicholas D.; Murphy, Brian
2016-01-01
How can we correlate the neural activity in the human brain as it responds to typed words, with properties of these terms (like ’edible’, ’fits in hand’)? In short, we want to find latent variables, that jointly explain both the brain activity, as well as the behavioral responses. This is one of many settings of the Coupled Matrix-Tensor Factorization (CMTF) problem. Can we enhance any CMTF solver, so that it can operate on potentially very large datasets that may not fit in main memory? We introduce Turbo-SMT, a meta-method capable of doing exactly that: it boosts the performance of any CMTF algorithm, produces sparse and interpretable solutions, and parallelizes any CMTF algorithm, producing sparse and interpretable solutions (up to 65 fold). Additionally, we improve upon ALS, the work-horse algorithm for CMTF, with respect to efficiency and robustness to missing values. We apply Turbo-SMT to BrainQ, a dataset consisting of a (nouns, brain voxels, human subjects) tensor and a (nouns, properties) matrix, with coupling along the nouns dimension. Turbo-SMT is able to find meaningful latent variables, as well as to predict brain activity with competitive accuracy. Finally, we demonstrate the generality of Turbo-SMT, by applying it on a Facebook dataset (users, ’friends’, wall-postings); there, Turbo-SMT spots spammer-like anomalies. PMID:27672406
Sparse modeling of EELS and EDX spectral imaging data by nonnegative matrix factorization
Energy Technology Data Exchange (ETDEWEB)
Shiga, Motoki, E-mail: shiga_m@gifu-u.ac.jp [Department of Electrical, Electronic and Computer Engineering, Gifu University, 1-1, Yanagido, Gifu 501-1193 (Japan); Tatsumi, Kazuyoshi; Muto, Shunsuke [Advanced Measurement Technology Center, Institute of Materials and Systems for Sustainability, Nagoya University, Chikusa-ku, Nagoya 464-8603 (Japan); Tsuda, Koji [Graduate School of Frontier Sciences, University of Tokyo, 5-1-5 Kashiwanoha, Kashiwa 277-8561 (Japan); Center for Materials Research by Information Integration, National Institute for Materials Science, 1-2-1 Sengen, Tsukuba 305-0047 (Japan); Biotechnology Research Institute for Drug Discovery, National Institute of Advanced Industrial Science and Technology, 2-4-7 Aomi Koto-ku, Tokyo 135-0064 (Japan); Yamamoto, Yuta [High-Voltage Electron Microscope Laboratory, Institute of Materials and Systems for Sustainability, Nagoya University, Chikusa-ku, Nagoya 464-8603 (Japan); Mori, Toshiyuki [Environment and Energy Materials Division, National Institute for Materials Science, 1-1 Namiki, Tsukuba 305-0044 (Japan); Tanji, Takayoshi [Division of Materials Research, Institute of Materials and Systems for Sustainability, Nagoya University, Chikusa-ku, Nagoya 464-8603 (Japan)
2016-11-15
Advances in scanning transmission electron microscopy (STEM) techniques have enabled us to automatically obtain electron energy-loss (EELS)/energy-dispersive X-ray (EDX) spectral datasets from a specified region of interest (ROI) at an arbitrary step width, called spectral imaging (SI). Instead of manually identifying the potential constituent chemical components from the ROI and determining the chemical state of each spectral component from the SI data stored in a huge three-dimensional matrix, it is more effective and efficient to use a statistical approach for the automatic resolution and extraction of the underlying chemical components. Among many different statistical approaches, we adopt a non-negative matrix factorization (NMF) technique, mainly because of the natural assumption of non-negative values in the spectra and cardinalities of chemical components, which are always positive in actual data. This paper proposes a new NMF model with two penalty terms: (i) an automatic relevance determination (ARD) prior, which optimizes the number of components, and (ii) a soft orthogonal constraint, which clearly resolves each spectrum component. For the factorization, we further propose a fast optimization algorithm based on hierarchical alternating least-squares. Numerical experiments using both phantom and real STEM-EDX/EELS SI datasets demonstrate that the ARD prior successfully identifies the correct number of physically meaningful components. The soft orthogonal constraint is also shown to be effective, particularly for STEM-EELS SI data, where neither the spatial nor spectral entries in the matrices are sparse. - Highlights: • Automatic resolution of chemical components from spectral imaging is considered. • We propose a new non-negative matrix factorization with two new penalties. • The first penalty is sparseness to choose the number of components from data. • Experimental results with real data demonstrate effectiveness of our method.
DEFF Research Database (Denmark)
Montoya-Martinez, Jair; Artes-Rodriguez, Antonio; Pontil, Massimiliano
2014-01-01
We consider the estimation of the Brain Electrical Sources (BES) matrix from noisy electroencephalographic (EEG) measurements, commonly named as the EEG inverse problem. We propose a new method to induce neurophysiological meaningful solutions, which takes into account the smoothness, structured...... sparsity, and low rank of the BES matrix. The method is based on the factorization of the BES matrix as a product of a sparse coding matrix and a dense latent source matrix. The structured sparse-low-rank structure is enforced by minimizing a regularized functional that includes the ℓ21-norm of the coding...... matrix and the squared Frobenius norm of the latent source matrix. We develop an alternating optimization algorithm to solve the resulting nonsmooth-nonconvex minimization problem. We analyze the convergence of the optimization procedure, and we compare, under different synthetic scenarios...
Parallel Sparse Matrix - Vector Product
DEFF Research Database (Denmark)
Alexandersen, Joe; Lazarov, Boyan Stefanov; Dammann, Bernd
This technical report contains a case study of a sparse matrix-vector product routine, implemented for parallel execution on a compute cluster with both pure MPI and hybrid MPI-OpenMP solutions. C++ classes for sparse data types were developed and the report shows how these class can be used...
Sparse matrix test collections
Energy Technology Data Exchange (ETDEWEB)
Duff, I.
1996-12-31
This workshop will discuss plans for coordinating and developing sets of test matrices for the comparison and testing of sparse linear algebra software. We will talk of plans for the next release (Release 2) of the Harwell-Boeing Collection and recent work on improving the accessibility of this Collection and others through the World Wide Web. There will only be three talks of about 15 to 20 minutes followed by a discussion from the floor.
Lin, Chuang; Wang, Binghui; Jiang, Ning; Farina, Dario
2018-04-01
Objective. This paper proposes a novel simultaneous and proportional multiple degree of freedom (DOF) myoelectric control method for active prostheses. Approach. The approach is based on non-negative matrix factorization (NMF) of surface EMG signals with the inclusion of sparseness constraints. By applying a sparseness constraint to the control signal matrix, it is possible to extract the basis information from arbitrary movements (quasi-unsupervised approach) for multiple DOFs concurrently. Main Results. In online testing based on target hitting, able-bodied subjects reached a greater throughput (TP) when using sparse NMF (SNMF) than with classic NMF or with linear regression (LR). Accordingly, the completion time (CT) was shorter for SNMF than NMF or LR. The same observations were made in two patients with unilateral limb deficiencies. Significance. The addition of sparseness constraints to NMF allows for a quasi-unsupervised approach to myoelectric control with superior results with respect to previous methods for the simultaneous and proportional control of multi-DOF. The proposed factorization algorithm allows robust simultaneous and proportional control, is superior to previous supervised algorithms, and, because of minimal supervision, paves the way to online adaptation in myoelectric control.
Sparse Non-negative Matrix Factor 2-D Deconvolution for Automatic Transcription of Polyphonic Music
DEFF Research Database (Denmark)
Schmidt, Mikkel N.; Mørup, Morten
2006-01-01
We present a novel method for automatic transcription of polyphonic music based on a recently published algorithm for non-negative matrix factor 2-D deconvolution. The method works by simultaneously estimating a time-frequency model for an instrument and a pattern corresponding to the notes which...... are played based on a log-frequency spectrogram of the music....
Better Size Estimation for Sparse Matrix Products
DEFF Research Database (Denmark)
Amossen, Rasmus Resen; Campagna, Andrea; Pagh, Rasmus
2010-01-01
We consider the problem of doing fast and reliable estimation of the number of non-zero entries in a sparse Boolean matrix product. Let n denote the total number of non-zero entries in the input matrices. We show how to compute a 1 ± ε approximation (with small probability of error) in expected t...
Noniterative MAP reconstruction using sparse matrix representations.
Cao, Guangzhi; Bouman, Charles A; Webb, Kevin J
2009-09-01
We present a method for noniterative maximum a posteriori (MAP) tomographic reconstruction which is based on the use of sparse matrix representations. Our approach is to precompute and store the inverse matrix required for MAP reconstruction. This approach has generally not been used in the past because the inverse matrix is typically large and fully populated (i.e., not sparse). In order to overcome this problem, we introduce two new ideas. The first idea is a novel theory for the lossy source coding of matrix transformations which we refer to as matrix source coding. This theory is based on a distortion metric that reflects the distortions produced in the final matrix-vector product, rather than the distortions in the coded matrix itself. The resulting algorithms are shown to require orthonormal transformations of both the measurement data and the matrix rows and columns before quantization and coding. The second idea is a method for efficiently storing and computing the required orthonormal transformations, which we call a sparse-matrix transform (SMT). The SMT is a generalization of the classical FFT in that it uses butterflies to compute an orthonormal transform; but unlike an FFT, the SMT uses the butterflies in an irregular pattern, and is numerically designed to best approximate the desired transforms. We demonstrate the potential of the noniterative MAP reconstruction with examples from optical tomography. The method requires offline computation to encode the inverse transform. However, once these offline computations are completed, the noniterative MAP algorithm is shown to reduce both storage and computation by well over two orders of magnitude, as compared to a linear iterative reconstruction methods.
Multi-threaded Sparse Matrix Sparse Matrix Multiplication for Many-Core and GPU Architectures.
Energy Technology Data Exchange (ETDEWEB)
Deveci, Mehmet [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Trott, Christian Robert [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Rajamanickam, Sivasankaran [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2018-01-01
Sparse Matrix-Matrix multiplication is a key kernel that has applications in several domains such as scientific computing and graph analysis. Several algorithms have been studied in the past for this foundational kernel. In this paper, we develop parallel algorithms for sparse matrix- matrix multiplication with a focus on performance portability across different high performance computing architectures. The performance of these algorithms depend on the data structures used in them. We compare different types of accumulators in these algorithms and demonstrate the performance difference between these data structures. Furthermore, we develop a meta-algorithm, kkSpGEMM, to choose the right algorithm and data structure based on the characteristics of the problem. We show performance comparisons on three architectures and demonstrate the need for the community to develop two phase sparse matrix-matrix multiplication implementations for efficient reuse of the data structures involved.
SparseM: A Sparse Matrix Package for R *
Directory of Open Access Journals (Sweden)
Roger Koenker
2003-02-01
Full Text Available SparseM provides some basic R functionality for linear algebra with sparse matrices. Use of the package is illustrated by a family of linear model fitting functions that implement least squares methods for problems with sparse design matrices. Significant performance improvements in memory utilization and computational speed are possible for applications involving large sparse matrices.
Institute of Scientific and Technical Information of China (English)
Xu Liu; Tiao-Tiao Liu; Wen-Wen Bai; Hu Yi; Shuang-Yan Li; Xin Tian
2013-01-01
Working memory plays an important role in human cognition.This study investigated how working memory was encoded by the power of multi-channel local field potentials (LFPs) based on sparse nonnegative matrix factorization (SNMF).SNMF was used to extract features from LFPs recorded from the prefrontal cortex of four Sprague-Dawley rats during a memory task in a Y maze,with 10 trials for each rat.Then the power-increased LFP components were selected as working memory-related features and the other components were removed.After that,the inverse operation of SNMF was used to study the encoding of working memory in the timefrequency domain.We demonstrated that theta and gamma power increased significantly during the working memory task.The results suggested that postsynaptic activity was simulated well by the sparse activity model.The theta and gamma bands were meaningful for encoding working memory.
User's Manual for PCSMS (Parallel Complex Sparse Matrix Solver). Version 1.
Reddy, C. J.
2000-01-01
PCSMS (Parallel Complex Sparse Matrix Solver) is a computer code written to make use of the existing real sparse direct solvers to solve complex, sparse matrix linear equations. PCSMS converts complex matrices into real matrices and use real, sparse direct matrix solvers to factor and solve the real matrices. The solution vector is reconverted to complex numbers. Though, this utility is written for Silicon Graphics (SGI) real sparse matrix solution routines, it is general in nature and can be easily modified to work with any real sparse matrix solver. The User's Manual is written to make the user acquainted with the installation and operation of the code. Driver routines are given to aid the users to integrate PCSMS routines in their own codes.
Xie, Jianwen; Douglas, Pamela K; Wu, Ying Nian; Brody, Arthur L; Anderson, Ariana E
2017-04-15
Brain networks in fMRI are typically identified using spatial independent component analysis (ICA), yet other mathematical constraints provide alternate biologically-plausible frameworks for generating brain networks. Non-negative matrix factorization (NMF) would suppress negative BOLD signal by enforcing positivity. Spatial sparse coding algorithms (L1 Regularized Learning and K-SVD) would impose local specialization and a discouragement of multitasking, where the total observed activity in a single voxel originates from a restricted number of possible brain networks. The assumptions of independence, positivity, and sparsity to encode task-related brain networks are compared; the resulting brain networks within scan for different constraints are used as basis functions to encode observed functional activity. These encodings are then decoded using machine learning, by using the time series weights to predict within scan whether a subject is viewing a video, listening to an audio cue, or at rest, in 304 fMRI scans from 51 subjects. The sparse coding algorithm of L1 Regularized Learning outperformed 4 variations of ICA (pcoding algorithms. Holding constant the effect of the extraction algorithm, encodings using sparser spatial networks (containing more zero-valued voxels) had higher classification accuracy (pcoding algorithms suggests that algorithms which enforce sparsity, discourage multitasking, and promote local specialization may capture better the underlying source processes than those which allow inexhaustible local processes such as ICA. Negative BOLD signal may capture task-related activations. Copyright © 2017 Elsevier B.V. All rights reserved.
Efficient implementations of block sparse matrix operations on shared memory vector machines
International Nuclear Information System (INIS)
Washio, T.; Maruyama, K.; Osoda, T.; Doi, S.; Shimizu, F.
2000-01-01
In this paper, we propose vectorization and shared memory-parallelization techniques for block-type random sparse matrix operations in finite element (FEM) applications. Here, a block corresponds to unknowns on one node in the FEM mesh and we assume that the block size is constant over the mesh. First, we discuss some basic vectorization ideas (the jagged diagonal (JAD) format and the segmented scan algorithm) for the sparse matrix-vector product. Then, we extend these ideas to the shared memory parallelization. After that, we show that the techniques can be applied not only to the sparse matrix-vector product but also to the sparse matrix-matrix product, the incomplete or complete sparse LU factorization and preconditioning. Finally, we report the performance evaluation results obtained on an NEC SX-4 shared memory vector machine for linear systems in some FEM applications. (author)
Fast sparse matrix-vector multiplication by partitioning and reordering
Yzelman, A.N.
2011-01-01
The thesis introduces a cache-oblivious method for the sparse matrix-vector (SpMV) multiplication, which is an important computational kernel in many applications. The method works by permuting rows and columns of the input matrix so that the resulting reordered matrix induces cache-friendly
Porting of the DBCSR library for Sparse Matrix-Matrix Multiplications to Intel Xeon Phi systems
Bethune, Iain; Gloess, Andeas; Hutter, Juerg; Lazzaro, Alfio; Pabst, Hans; Reid, Fiona
2017-01-01
Multiplication of two sparse matrices is a key operation in the simulation of the electronic structure of systems containing thousands of atoms and electrons. The highly optimized sparse linear algebra library DBCSR (Distributed Block Compressed Sparse Row) has been specifically designed to efficiently perform such sparse matrix-matrix multiplications. This library is the basic building block for linear scaling electronic structure theory and low scaling correlated methods in CP2K. It is para...
Sparse Matrix for ECG Identification with Two-Lead Features
Directory of Open Access Journals (Sweden)
Kuo-Kun Tseng
2015-01-01
Full Text Available Electrocardiograph (ECG human identification has the potential to improve biometric security. However, improvements in ECG identification and feature extraction are required. Previous work has focused on single lead ECG signals. Our work proposes a new algorithm for human identification by mapping two-lead ECG signals onto a two-dimensional matrix then employing a sparse matrix method to process the matrix. And that is the first application of sparse matrix techniques for ECG identification. Moreover, the results of our experiments demonstrate the benefits of our approach over existing methods.
Massively parallel sparse matrix function calculations with NTPoly
Dawson, William; Nakajima, Takahito
2018-04-01
We present NTPoly, a massively parallel library for computing the functions of sparse, symmetric matrices. The theory of matrix functions is a well developed framework with a wide range of applications including differential equations, graph theory, and electronic structure calculations. One particularly important application area is diagonalization free methods in quantum chemistry. When the input and output of the matrix function are sparse, methods based on polynomial expansions can be used to compute matrix functions in linear time. We present a library based on these methods that can compute a variety of matrix functions. Distributed memory parallelization is based on a communication avoiding sparse matrix multiplication algorithm. OpenMP task parallellization is utilized to implement hybrid parallelization. We describe NTPoly's interface and show how it can be integrated with programs written in many different programming languages. We demonstrate the merits of NTPoly by performing large scale calculations on the K computer.
Sparse Matrix-Vector Multiplication on Multicore and Accelerators
Energy Technology Data Exchange (ETDEWEB)
Williams, Samuel W. [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Bell, Nathan [NVIDIA Research, Santa Clara, CA (United States); Choi, Jee Whan [Georgia Inst. of Technology, Atlanta, GA (United States); Garland, Michael [NVIDIA Research, Santa Clara, CA (United States); Oliker, Leonid [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Vuduc, Richard [Georgia Inst. of Technology, Atlanta, GA (United States)
2010-12-07
This chapter consolidates recent work on the development of high performance multicore and accelerator-based implementations of sparse matrix-vector multiplication (SpMV). As an object of study, SpMV is an interesting computation for two key reasons. First, it appears widely in applications in scientific and engineering computing, financial and economic modeling, and information retrieval, among others, and is therefore of great practical interest. Secondly, it is both simple to describe but challenging to implement well, since its performance is limited by a variety of factors, including low computational intensity, potentially highly irregular memory access behavior, and a strong input dependence that be known only at run time. Thus, we believe SpMV is both practically important and provides important insights for understanding the algorithmic and implementation principles necessary to making effective use of state-of-the-art systems.
Vector sparse representation of color image using quaternion matrix analysis.
Xu, Yi; Yu, Licheng; Xu, Hongteng; Zhang, Hao; Nguyen, Truong
2015-04-01
Traditional sparse image models treat color image pixel as a scalar, which represents color channels separately or concatenate color channels as a monochrome image. In this paper, we propose a vector sparse representation model for color images using quaternion matrix analysis. As a new tool for color image representation, its potential applications in several image-processing tasks are presented, including color image reconstruction, denoising, inpainting, and super-resolution. The proposed model represents the color image as a quaternion matrix, where a quaternion-based dictionary learning algorithm is presented using the K-quaternion singular value decomposition (QSVD) (generalized K-means clustering for QSVD) method. It conducts the sparse basis selection in quaternion space, which uniformly transforms the channel images to an orthogonal color space. In this new color space, it is significant that the inherent color structures can be completely preserved during vector reconstruction. Moreover, the proposed sparse model is more efficient comparing with the current sparse models for image restoration tasks due to lower redundancy between the atoms of different color channels. The experimental results demonstrate that the proposed sparse image model avoids the hue bias issue successfully and shows its potential as a general and powerful tool in color image analysis and processing domain.
Simulation of sparse matrix array designs
Boehm, Rainer; Heckel, Thomas
2018-04-01
Matrix phased array probes are becoming more prominently used in industrial applications. The main drawbacks, using probes incorporating a very large number of transducer elements, are needed for an appropriate cabling and an ultrasonic device offering many parallel channels. Matrix arrays designed for extended functionality feature at least 64 or more elements. Typical arrangements are square matrices, e.g., 8 by 8 or 11 by 11 or rectangular matrixes, e.g., 8 by 16 or 10 by 12 to fit a 128-channel phased array system. In some phased array systems, the number of simultaneous active elements is limited to a certain number, e.g., 32 or 64. Those setups do not allow running the probe with all elements active, which may cause a significant change in the directivity pattern of the resulting sound beam. When only a subset of elements can be used during a single acquisition, different strategies may be applied to collect enough data for rebuilding the missing information from the echo signal. Omission of certain elements may be one approach, overlay of subsequent shots with different active areas may be another one. This paper presents the influence of a decreased number of active elements on the sound field and their distribution on the array. Solutions using subsets with different element activity patterns on matrix arrays and their advantages and disadvantages concerning the sound field are evaluated using semi-analytical simulation tools. Sound field criteria are discussed, which are significant for non-destructive testing results and for the system setup.
A framework for general sparse matrix-matrix multiplication on GPUs and heterogeneous processors
DEFF Research Database (Denmark)
Liu, Weifeng; Vinter, Brian
2015-01-01
General sparse matrix-matrix multiplication (SpGEMM) is a fundamental building block for numerous applications such as algebraic multigrid method (AMG), breadth first search and shortest path problem. Compared to other sparse BLAS routines, an efficient parallel SpGEMM implementation has to handle...... extra irregularity from three aspects: (1) the number of nonzero entries in the resulting sparse matrix is unknown in advance, (2) very expensive parallel insert operations at random positions in the resulting sparse matrix dominate the execution time, and (3) load balancing must account for sparse data...... memory space and efficiently utilizes the very limited on-chip scratchpad memory. Parallel insert operations of the nonzero entries are implemented through the GPU merge path algorithm that is experimentally found to be the fastest GPU merge approach. Load balancing builds on the number of necessary...
An Efficient GPU General Sparse Matrix-Matrix Multiplication for Irregular Data
DEFF Research Database (Denmark)
Liu, Weifeng; Vinter, Brian
2014-01-01
General sparse matrix-matrix multiplication (SpGEMM) is a fundamental building block for numerous applications such as algebraic multigrid method, breadth first search and shortest path problem. Compared to other sparse BLAS routines, an efficient parallel SpGEMM algorithm has to handle extra...... irregularity from three aspects: (1) the number of the nonzero entries in the result sparse matrix is unknown in advance, (2) very expensive parallel insert operations at random positions in the result sparse matrix dominate the execution time, and (3) load balancing must account for sparse data in both input....... Load balancing builds on the number of the necessary arithmetic operations on the nonzero entries and is guaranteed in all stages. Compared with the state-of-the-art GPU SpGEMM methods in the CUSPARSE library and the CUSP library and the latest CPU SpGEMM method in the Intel Math Kernel Library, our...
Multi scales based sparse matrix spectral clustering image segmentation
Liu, Zhongmin; Chen, Zhicai; Li, Zhanming; Hu, Wenjin
2018-04-01
In image segmentation, spectral clustering algorithms have to adopt the appropriate scaling parameter to calculate the similarity matrix between the pixels, which may have a great impact on the clustering result. Moreover, when the number of data instance is large, computational complexity and memory use of the algorithm will greatly increase. To solve these two problems, we proposed a new spectral clustering image segmentation algorithm based on multi scales and sparse matrix. We devised a new feature extraction method at first, then extracted the features of image on different scales, at last, using the feature information to construct sparse similarity matrix which can improve the operation efficiency. Compared with traditional spectral clustering algorithm, image segmentation experimental results show our algorithm have better degree of accuracy and robustness.
Fast convolutional sparse coding using matrix inversion lemma
Czech Academy of Sciences Publication Activity Database
Šorel, Michal; Šroubek, Filip
2016-01-01
Roč. 55, č. 1 (2016), s. 44-51 ISSN 1051-2004 R&D Projects: GA ČR GA13-29225S Institutional support: RVO:67985556 Keywords : Convolutional sparse coding * Feature learning * Deconvolution networks * Shift-invariant sparse coding Subject RIV: JD - Computer Applications, Robotics Impact factor: 2.337, year: 2016 http://library.utia.cas.cz/separaty/2016/ZOI/sorel-0459332.pdf
Multi-threaded Sparse Matrix-Matrix Multiplication for Many-Core and GPU Architectures.
Energy Technology Data Exchange (ETDEWEB)
Deveci, Mehmet [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Rajamanickam, Sivasankaran [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Trott, Christian Robert [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2017-12-01
Sparse Matrix-Matrix multiplication is a key kernel that has applications in several domains such as scienti c computing and graph analysis. Several algorithms have been studied in the past for this foundational kernel. In this paper, we develop parallel algorithms for sparse matrix-matrix multiplication with a focus on performance portability across different high performance computing architectures. The performance of these algorithms depend on the data structures used in them. We compare different types of accumulators in these algorithms and demonstrate the performance difference between these data structures. Furthermore, we develop a meta-algorithm, kkSpGEMM, to choose the right algorithm and data structure based on the characteristics of the problem. We show performance comparisons on three architectures and demonstrate the need for the community to develop two phase sparse matrix-matrix multiplication implementations for efficient reuse of the data structures involved.
Ab initio nuclear structure - the large sparse matrix eigenvalue problem
Energy Technology Data Exchange (ETDEWEB)
Vary, James P; Maris, Pieter [Department of Physics, Iowa State University, Ames, IA, 50011 (United States); Ng, Esmond; Yang, Chao [Computational Research Division, Lawrence Berkeley National Laboratory, Berkeley, CA 94720 (United States); Sosonkina, Masha, E-mail: jvary@iastate.ed [Scalable Computing Laboratory, Ames Laboratory, Iowa State University, Ames, IA, 50011 (United States)
2009-07-01
The structure and reactions of light nuclei represent fundamental and formidable challenges for microscopic theory based on realistic strong interaction potentials. Several ab initio methods have now emerged that provide nearly exact solutions for some nuclear properties. The ab initio no core shell model (NCSM) and the no core full configuration (NCFC) method, frame this quantum many-particle problem as a large sparse matrix eigenvalue problem where one evaluates the Hamiltonian matrix in a basis space consisting of many-fermion Slater determinants and then solves for a set of the lowest eigenvalues and their associated eigenvectors. The resulting eigenvectors are employed to evaluate a set of experimental quantities to test the underlying potential. For fundamental problems of interest, the matrix dimension often exceeds 10{sup 10} and the number of nonzero matrix elements may saturate available storage on present-day leadership class facilities. We survey recent results and advances in solving this large sparse matrix eigenvalue problem. We also outline the challenges that lie ahead for achieving further breakthroughs in fundamental nuclear theory using these ab initio approaches.
Ab initio nuclear structure - the large sparse matrix eigenvalue problem
International Nuclear Information System (INIS)
Vary, James P; Maris, Pieter; Ng, Esmond; Yang, Chao; Sosonkina, Masha
2009-01-01
The structure and reactions of light nuclei represent fundamental and formidable challenges for microscopic theory based on realistic strong interaction potentials. Several ab initio methods have now emerged that provide nearly exact solutions for some nuclear properties. The ab initio no core shell model (NCSM) and the no core full configuration (NCFC) method, frame this quantum many-particle problem as a large sparse matrix eigenvalue problem where one evaluates the Hamiltonian matrix in a basis space consisting of many-fermion Slater determinants and then solves for a set of the lowest eigenvalues and their associated eigenvectors. The resulting eigenvectors are employed to evaluate a set of experimental quantities to test the underlying potential. For fundamental problems of interest, the matrix dimension often exceeds 10 10 and the number of nonzero matrix elements may saturate available storage on present-day leadership class facilities. We survey recent results and advances in solving this large sparse matrix eigenvalue problem. We also outline the challenges that lie ahead for achieving further breakthroughs in fundamental nuclear theory using these ab initio approaches.
A fast algorithm for sparse matrix computations related to inversion
International Nuclear Information System (INIS)
Li, S.; Wu, W.; Darve, E.
2013-01-01
We have developed a fast algorithm for computing certain entries of the inverse of a sparse matrix. Such computations are critical to many applications, such as the calculation of non-equilibrium Green’s functions G r and G for nano-devices. The FIND (Fast Inverse using Nested Dissection) algorithm is optimal in the big-O sense. However, in practice, FIND suffers from two problems due to the width-2 separators used by its partitioning scheme. One problem is the presence of a large constant factor in the computational cost of FIND. The other problem is that the partitioning scheme used by FIND is incompatible with most existing partitioning methods and libraries for nested dissection, which all use width-1 separators. Our new algorithm resolves these problems by thoroughly decomposing the computation process such that width-1 separators can be used, resulting in a significant speedup over FIND for realistic devices — up to twelve-fold in simulation. The new algorithm also has the added advantage that desired off-diagonal entries can be computed for free. Consequently, our algorithm is faster than the current state-of-the-art recursive methods for meshes of any size. Furthermore, the framework used in the analysis of our algorithm is the first attempt to explicitly apply the widely-used relationship between mesh nodes and matrix computations to the problem of multiple eliminations with reuse of intermediate results. This framework makes our algorithm easier to generalize, and also easier to compare against other methods related to elimination trees. Finally, our accuracy analysis shows that the algorithms that require back-substitution are subject to significant extra round-off errors, which become extremely large even for some well-conditioned matrices or matrices with only moderately large condition numbers. When compared to these back-substitution algorithms, our algorithm is generally a few orders of magnitude more accurate, and our produced round-off errors
Robust and Sparse Factor Modelling
DEFF Research Database (Denmark)
Croux, Christophe; Exterkate, Peter
Factor construction methods are widely used to summarize a large panel of variables by means of a relatively small number of representative factors. We propose a novel factor construction procedure that enjoys the properties of robustness to outliers and of sparsity; that is, having relatively few...... nonzero factor loadings. Compared to the traditional factor construction method, we find that this procedure leads to a favorable forecasting performance in the presence of outliers and to better interpretable factors. We investigate the performance of the method in a Monte Carlo experiment...
Sparse and Robust Factor Modelling
C. Croux (Christophe); P. Exterkate (Peter)
2011-01-01
textabstractFactor construction methods are widely used to summarize a large panel of variables by means of a relatively small number of representative factors. We propose a novel factor construction procedure that enjoys the properties of robustness to outliers and of sparsity; that is, having
Sparse Covariance Matrix Estimation by DCA-Based Algorithms.
Phan, Duy Nhat; Le Thi, Hoai An; Dinh, Tao Pham
2017-11-01
This letter proposes a novel approach using the [Formula: see text]-norm regularization for the sparse covariance matrix estimation (SCME) problem. The objective function of SCME problem is composed of a nonconvex part and the [Formula: see text] term, which is discontinuous and difficult to tackle. Appropriate DC (difference of convex functions) approximations of [Formula: see text]-norm are used that result in approximation SCME problems that are still nonconvex. DC programming and DCA (DC algorithm), powerful tools in nonconvex programming framework, are investigated. Two DC formulations are proposed and corresponding DCA schemes developed. Two applications of the SCME problem that are considered are classification via sparse quadratic discriminant analysis and portfolio optimization. A careful empirical experiment is performed through simulated and real data sets to study the performance of the proposed algorithms. Numerical results showed their efficiency and their superiority compared with seven state-of-the-art methods.
Scalable group level probabilistic sparse factor analysis
DEFF Research Database (Denmark)
Hinrich, Jesper Løve; Nielsen, Søren Føns Vind; Riis, Nicolai Andre Brogaard
2017-01-01
Many data-driven approaches exist to extract neural representations of functional magnetic resonance imaging (fMRI) data, but most of them lack a proper probabilistic formulation. We propose a scalable group level probabilistic sparse factor analysis (psFA) allowing spatially sparse maps, component...... pruning using automatic relevance determination (ARD) and subject specific heteroscedastic spatial noise modeling. For task-based and resting state fMRI, we show that the sparsity constraint gives rise to components similar to those obtained by group independent component analysis. The noise modeling...... shows that noise is reduced in areas typically associated with activation by the experimental design. The psFA model identifies sparse components and the probabilistic setting provides a natural way to handle parameter uncertainties. The variational Bayesian framework easily extends to more complex...
Algorithms for sparse, symmetric, definite quadratic lambda-matrix eigenproblems
International Nuclear Information System (INIS)
Scott, D.S.; Ward, R.C.
1981-01-01
Methods are presented for computing eigenpairs of the quadratic lambda-matrix, M lambda 2 + C lambda + K, where M, C, and K are large and sparse, and have special symmetry-type properties. These properties are sufficient to insure that all the eigenvalues are real and that theory analogous to the standard symmetric eigenproblem exists. The methods employ some standard techniques such as partial tri-diagonalization via the Lanczos Method and subsequent eigenpair calculation, shift-and- invert strategy and subspace iteration. The methods also employ some new techniques such as Rayleigh-Ritz quadratic roots and the inertia of symmetric, definite, quadratic lambda-matrices
A fast algorithm for sparse matrix computations related to inversion
Energy Technology Data Exchange (ETDEWEB)
Li, S., E-mail: lisong@stanford.edu [Institute for Computational and Mathematical Engineering, Stanford University, 496 Lomita Mall, Durand Building, Stanford, CA 94305 (United States); Wu, W. [Department of Electrical Engineering, Stanford University, 350 Serra Mall, Packard Building, Room 268, Stanford, CA 94305 (United States); Darve, E. [Institute for Computational and Mathematical Engineering, Stanford University, 496 Lomita Mall, Durand Building, Stanford, CA 94305 (United States); Department of Mechanical Engineering, Stanford University, 496 Lomita Mall, Durand Building, Room 209, Stanford, CA 94305 (United States)
2013-06-01
We have developed a fast algorithm for computing certain entries of the inverse of a sparse matrix. Such computations are critical to many applications, such as the calculation of non-equilibrium Green’s functions G{sup r} and G{sup <} for nano-devices. The FIND (Fast Inverse using Nested Dissection) algorithm is optimal in the big-O sense. However, in practice, FIND suffers from two problems due to the width-2 separators used by its partitioning scheme. One problem is the presence of a large constant factor in the computational cost of FIND. The other problem is that the partitioning scheme used by FIND is incompatible with most existing partitioning methods and libraries for nested dissection, which all use width-1 separators. Our new algorithm resolves these problems by thoroughly decomposing the computation process such that width-1 separators can be used, resulting in a significant speedup over FIND for realistic devices — up to twelve-fold in simulation. The new algorithm also has the added advantage that desired off-diagonal entries can be computed for free. Consequently, our algorithm is faster than the current state-of-the-art recursive methods for meshes of any size. Furthermore, the framework used in the analysis of our algorithm is the first attempt to explicitly apply the widely-used relationship between mesh nodes and matrix computations to the problem of multiple eliminations with reuse of intermediate results. This framework makes our algorithm easier to generalize, and also easier to compare against other methods related to elimination trees. Finally, our accuracy analysis shows that the algorithms that require back-substitution are subject to significant extra round-off errors, which become extremely large even for some well-conditioned matrices or matrices with only moderately large condition numbers. When compared to these back-substitution algorithms, our algorithm is generally a few orders of magnitude more accurate, and our produced round
Joint-2D-SL0 Algorithm for Joint Sparse Matrix Reconstruction
Directory of Open Access Journals (Sweden)
Dong Zhang
2017-01-01
Full Text Available Sparse matrix reconstruction has a wide application such as DOA estimation and STAP. However, its performance is usually restricted by the grid mismatch problem. In this paper, we revise the sparse matrix reconstruction model and propose the joint sparse matrix reconstruction model based on one-order Taylor expansion. And it can overcome the grid mismatch problem. Then, we put forward the Joint-2D-SL0 algorithm which can solve the joint sparse matrix reconstruction problem efficiently. Compared with the Kronecker compressive sensing method, our proposed method has a higher computational efficiency and acceptable reconstruction accuracy. Finally, simulation results validate the superiority of the proposed method.
New sparse matrix solver in the KIKO3D 3-dimensional reactor dynamics code
International Nuclear Information System (INIS)
Panka, I.; Kereszturi, A.; Hegedus, C.
2005-01-01
The goal of this paper is to present a more effective method Bi-CGSTAB for accelerating the large sparse matrix equation solution in the KIKO3D code. This equation system is obtained by using the factorization of the improved quasi static (IQS) method for the time dependent nodal kinetic equations. In the old methodology standard large sparse matrix techniques were considered, where Gauss-Seidel preconditioning and a GMRES-type solver were applied. The validation of KIKO3D using Bi-CGSTAB has been performed by solving of a VVER-1000 kinetic benchmark problem. Additionally, the convergence characteristics were investigated in given macro time steps of Control Rod Ejection transients. The results have been obtained by the old GMRES and new Bi-CGSTAB methods are compared. (author)
Stoykov, S.; Atanassov, E.; Margenov, S.
2016-10-01
Many of the scientific applications involve sparse or dense matrix operations, such as solving linear systems, matrix-matrix products, eigensolvers, etc. In what concerns structural nonlinear dynamics, the computations of periodic responses and the determination of stability of the solution are of primary interest. Shooting method iswidely used for obtaining periodic responses of nonlinear systems. The method involves simultaneously operations with sparse and dense matrices. One of the computationally expensive operations in the method is multiplication of sparse by dense matrices. In the current work, a new algorithm for sparse matrix by dense matrix products is presented. The algorithm takes into account the structure of the sparse matrix, which is obtained by space discretization of the nonlinear Mindlin's plate equation of motion by the finite element method. The algorithm is developed to use the vector engine of Intel Xeon Phi coprocessors. It is compared with the standard sparse matrix by dense matrix algorithm and the one developed by Intel MKL and it is shown that by considering the properties of the sparse matrix better algorithms can be developed.
Efficient MATLAB computations with sparse and factored tensors.
Energy Technology Data Exchange (ETDEWEB)
Bader, Brett William; Kolda, Tamara Gibson (Sandia National Lab, Livermore, CA)
2006-12-01
In this paper, the term tensor refers simply to a multidimensional or N-way array, and we consider how specially structured tensors allow for efficient storage and computation. First, we study sparse tensors, which have the property that the vast majority of the elements are zero. We propose storing sparse tensors using coordinate format and describe the computational efficiency of this scheme for various mathematical operations, including those typical to tensor decomposition algorithms. Second, we study factored tensors, which have the property that they can be assembled from more basic components. We consider two specific types: a Tucker tensor can be expressed as the product of a core tensor (which itself may be dense, sparse, or factored) and a matrix along each mode, and a Kruskal tensor can be expressed as the sum of rank-1 tensors. We are interested in the case where the storage of the components is less than the storage of the full tensor, and we demonstrate that many elementary operations can be computed using only the components. All of the efficiencies described in this paper are implemented in the Tensor Toolbox for MATLAB.
A performance study of sparse Cholesky factorization on INTEL iPSC/860
Zubair, M.; Ghose, M.
1992-01-01
The problem of Cholesky factorization of a sparse matrix has been very well investigated on sequential machines. A number of efficient codes exist for factorizing large unstructured sparse matrices. However, there is a lack of such efficient codes on parallel machines in general, and distributed machines in particular. Some of the issues that are critical to the implementation of sparse Cholesky factorization on a distributed memory parallel machine are ordering, partitioning and mapping, load balancing, and ordering of various tasks within a processor. Here, we focus on the effect of various partitioning schemes on the performance of sparse Cholesky factorization on the Intel iPSC/860. Also, a new partitioning heuristic for structured as well as unstructured sparse matrices is proposed, and its performance is compared with other schemes.
On affine non-negative matrix factorization
DEFF Research Database (Denmark)
Laurberg, Hans; Hansen, Lars Kai
2007-01-01
We generalize the non-negative matrix factorization (NMF) generative model to incorporate an explicit offset. Multiplicative estimation algorithms are provided for the resulting sparse affine NMF model. We show that the affine model has improved uniqueness properties and leads to more accurate id...
A sparse matrix based full-configuration interaction algorithm
International Nuclear Information System (INIS)
Rolik, Zoltan; Szabados, Agnes; Surjan, Peter R.
2008-01-01
We present an algorithm related to the full-configuration interaction (FCI) method that makes complete use of the sparse nature of the coefficient vector representing the many-electron wave function in a determinantal basis. Main achievements of the presented sparse FCI (SFCI) algorithm are (i) development of an iteration procedure that avoids the storage of FCI size vectors; (ii) development of an efficient algorithm to evaluate the effect of the Hamiltonian when both the initial and the product vectors are sparse. As a result of point (i) large disk operations can be skipped which otherwise may be a bottleneck of the procedure. At point (ii) we progress by adopting the implementation of the linear transformation by Olsen et al. [J. Chem Phys. 89, 2185 (1988)] for the sparse case, getting the algorithm applicable to larger systems and faster at the same time. The error of a SFCI calculation depends only on the dropout thresholds for the sparse vectors, and can be tuned by controlling the amount of system memory passed to the procedure. The algorithm permits to perform FCI calculations on single node workstations for systems previously accessible only by supercomputers
Pulse-Width-Modulation of Neutral-Point-Clamped Sparse Matrix Converter
DEFF Research Database (Denmark)
Loh, P.C.; Blaabjerg, Frede; Gao, F.
2007-01-01
input current and output voltage can be achieved with minimized rectification switching loss, rendering the sparse matrix converter as a competitive choice for interfacing the utility grid to (e.g.) defense facilities that require a different frequency supply. As an improvement, sparse matrix converter...... with improved waveform quality. Performances and practicalities of the designed schemes are verified in simulation and experimentally using an implemented laboratory prototype with some representative results captured and presented in the paper....
Design Patterns for Sparse-Matrix Computations on Hybrid CPU/GPU Platforms
Directory of Open Access Journals (Sweden)
Valeria Cardellini
2014-01-01
Full Text Available We apply object-oriented software design patterns to develop code for scientific software involving sparse matrices. Design patterns arise when multiple independent developments produce similar designs which converge onto a generic solution. We demonstrate how to use design patterns to implement an interface for sparse matrix computations on NVIDIA GPUs starting from PSBLAS, an existing sparse matrix library, and from existing sets of GPU kernels for sparse matrices. We also compare the throughput of the PSBLAS sparse matrix–vector multiplication on two platforms exploiting the GPU with that obtained by a CPU-only PSBLAS implementation. Our experiments exhibit encouraging results regarding the comparison between CPU and GPU executions in double precision, obtaining a speedup of up to 35.35 on NVIDIA GTX 285 with respect to AMD Athlon 7750, and up to 10.15 on NVIDIA Tesla C2050 with respect to Intel Xeon X5650.
Directory of Open Access Journals (Sweden)
Vibha Tiwari
2015-12-01
Full Text Available Compressive sensing theory enables faithful reconstruction of signals, sparse in domain $ \\Psi $, at sampling rate lesser than Nyquist criterion, while using sampling or sensing matrix $ \\Phi $ which satisfies restricted isometric property. The role played by sensing matrix $ \\Phi $ and sparsity matrix $ \\Psi $ is vital in faithful reconstruction. If the sensing matrix is dense then it takes large storage space and leads to high computational cost. In this paper, effort is made to design sparse sensing matrix with least incurred computational cost while maintaining quality of reconstructed image. The design approach followed is based on sparse block circulant matrix (SBCM with few modifications. The other used sparse sensing matrix consists of 15 ones in each column. The medical images used are acquired from US, MRI and CT modalities. The image quality measurement parameters are used to compare the performance of reconstructed medical images using various sensing matrices. It is observed that, since Gram matrix of dictionary matrix ($ \\Phi \\Psi \\mathrm{} $ is closed to identity matrix in case of proposed modified SBCM, therefore, it helps to reconstruct the medical images of very good quality.
Kreutzer, Moritz; Hager, Georg; Wellein, Gerhard; Fehske, Holger; Basermann, Achim; Bishop, Alan R.
2011-01-01
Sparse matrix-vector multiplication (spMVM) is the dominant operation in many sparse solvers. We investigate performance properties of spMVM with matrices of various sparsity patterns on the nVidia “Fermi” class of GPGPUs. A new “padded jagged diagonals storage” (pJDS) format is proposed which may substantially reduce the memory overhead intrinsic to the widespread ELLPACK-R scheme while making no assumptions about the matrix structure. In our test scenarios the pJDS format cuts the ...
Energy Technology Data Exchange (ETDEWEB)
Aktulga, Hasan Metin [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Buluc, Aydin [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Williams, Samuel [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Yang, Chao [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
2014-08-14
Obtaining highly accurate predictions on the properties of light atomic nuclei using the configuration interaction (CI) approach requires computing a few extremal Eigen pairs of the many-body nuclear Hamiltonian matrix. In the Many-body Fermion Dynamics for nuclei (MFDn) code, a block Eigen solver is used for this purpose. Due to the large size of the sparse matrices involved, a significant fraction of the time spent on the Eigen value computations is associated with the multiplication of a sparse matrix (and the transpose of that matrix) with multiple vectors (SpMM and SpMM-T). Existing implementations of SpMM and SpMM-T significantly underperform expectations. Thus, in this paper, we present and analyze optimized implementations of SpMM and SpMM-T. We base our implementation on the compressed sparse blocks (CSB) matrix format and target systems with multi-core architectures. We develop a performance model that allows us to understand and estimate the performance characteristics of our SpMM kernel implementations, and demonstrate the efficiency of our implementation on a series of real-world matrices extracted from MFDn. In particular, we obtain 3-4 speedup on the requisite operations over good implementations based on the commonly used compressed sparse row (CSR) matrix format. The improvements in the SpMM kernel suggest we may attain roughly a 40% speed up in the overall execution time of the block Eigen solver used in MFDn.
Performance modeling and optimization of sparse matrix-vector multiplication on NVIDIA CUDA platform
Xu, S.; Xue, W.; Lin, H.X.
2011-01-01
In this article, we discuss the performance modeling and optimization of Sparse Matrix-Vector Multiplication (SpMV) on NVIDIA GPUs using CUDA. SpMV has a very low computation-data ratio and its performance is mainly bound by the memory bandwidth. We propose optimization of SpMV based on ELLPACK from
Energy Technology Data Exchange (ETDEWEB)
1978-01-01
The program and abstracts of the SIAM 1978 fall meeting in Knoxville, Tennessee, are given, along with those of the associated symposium on sparse matrix computations. The papers dealt with both pure mathematics and mathematics applied to many different subject areas. (RWR)
Sparse subspace clustering for data with missing entries and high-rank matrix completion.
Fan, Jicong; Chow, Tommy W S
2017-09-01
Many methods have recently been proposed for subspace clustering, but they are often unable to handle incomplete data because of missing entries. Using matrix completion methods to recover missing entries is a common way to solve the problem. Conventional matrix completion methods require that the matrix should be of low-rank intrinsically, but most matrices are of high-rank or even full-rank in practice, especially when the number of subspaces is large. In this paper, a new method called Sparse Representation with Missing Entries and Matrix Completion is proposed to solve the problems of incomplete-data subspace clustering and high-rank matrix completion. The proposed algorithm alternately computes the matrix of sparse representation coefficients and recovers the missing entries of a data matrix. The proposed algorithm recovers missing entries through minimizing the representation coefficients, representation errors, and matrix rank. Thorough experimental study and comparative analysis based on synthetic data and natural images were conducted. The presented results demonstrate that the proposed algorithm is more effective in subspace clustering and matrix completion compared with other existing methods. Copyright © 2017 Elsevier Ltd. All rights reserved.
Matrix completion by deep matrix factorization.
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.
Uncovering Transcriptional Regulatory Networks by Sparse Bayesian Factor Model
Directory of Open Access Journals (Sweden)
Qi Yuan(Alan
2010-01-01
Full Text Available Abstract The problem of uncovering transcriptional regulation by transcription factors (TFs based on microarray data is considered. A novel Bayesian sparse correlated rectified factor model (BSCRFM is proposed that models the unknown TF protein level activity, the correlated regulations between TFs, and the sparse nature of TF-regulated genes. The model admits prior knowledge from existing database regarding TF-regulated target genes based on a sparse prior and through a developed Gibbs sampling algorithm, a context-specific transcriptional regulatory network specific to the experimental condition of the microarray data can be obtained. The proposed model and the Gibbs sampling algorithm were evaluated on the simulated systems, and results demonstrated the validity and effectiveness of the proposed approach. The proposed model was then applied to the breast cancer microarray data of patients with Estrogen Receptor positive ( status and Estrogen Receptor negative ( status, respectively.
Bustamam, A.; Ulul, E. D.; Hura, H. F. A.; Siswantining, T.
2017-07-01
Hierarchical clustering is one of effective methods in creating a phylogenetic tree based on the distance matrix between DNA (deoxyribonucleic acid) sequences. One of the well-known methods to calculate the distance matrix is k-mer method. Generally, k-mer is more efficient than some distance matrix calculation techniques. The steps of k-mer method are started from creating k-mer sparse matrix, and followed by creating k-mer singular value vectors. The last step is computing the distance amongst vectors. In this paper, we analyze the sequences of MERS-CoV (Middle East Respiratory Syndrome - Coronavirus) DNA by implementing hierarchical clustering using k-mer sparse matrix in order to perform the phylogenetic analysis. Our results show that the ancestor of our MERS-CoV is coming from Egypt. Moreover, we found that the MERS-CoV infection that occurs in one country may not necessarily come from the same country of origin. This suggests that the process of MERS-CoV mutation might not only be influenced by geographical factor.
Inference algorithms and learning theory for Bayesian sparse factor analysis
International Nuclear Information System (INIS)
Rattray, Magnus; Sharp, Kevin; Stegle, Oliver; Winn, John
2009-01-01
Bayesian sparse factor analysis has many applications; for example, it has been applied to the problem of inferring a sparse regulatory network from gene expression data. We describe a number of inference algorithms for Bayesian sparse factor analysis using a slab and spike mixture prior. These include well-established Markov chain Monte Carlo (MCMC) and variational Bayes (VB) algorithms as well as a novel hybrid of VB and Expectation Propagation (EP). For the case of a single latent factor we derive a theory for learning performance using the replica method. We compare the MCMC and VB/EP algorithm results with simulated data to the theoretical prediction. The results for MCMC agree closely with the theory as expected. Results for VB/EP are slightly sub-optimal but show that the new algorithm is effective for sparse inference. In large-scale problems MCMC is infeasible due to computational limitations and the VB/EP algorithm then provides a very useful computationally efficient alternative.
Inference algorithms and learning theory for Bayesian sparse factor analysis
Energy Technology Data Exchange (ETDEWEB)
Rattray, Magnus; Sharp, Kevin [School of Computer Science, University of Manchester, Manchester M13 9PL (United Kingdom); Stegle, Oliver [Max-Planck-Institute for Biological Cybernetics, Tuebingen (Germany); Winn, John, E-mail: magnus.rattray@manchester.ac.u [Microsoft Research Cambridge, Roger Needham Building, Cambridge, CB3 0FB (United Kingdom)
2009-12-01
Bayesian sparse factor analysis has many applications; for example, it has been applied to the problem of inferring a sparse regulatory network from gene expression data. We describe a number of inference algorithms for Bayesian sparse factor analysis using a slab and spike mixture prior. These include well-established Markov chain Monte Carlo (MCMC) and variational Bayes (VB) algorithms as well as a novel hybrid of VB and Expectation Propagation (EP). For the case of a single latent factor we derive a theory for learning performance using the replica method. We compare the MCMC and VB/EP algorithm results with simulated data to the theoretical prediction. The results for MCMC agree closely with the theory as expected. Results for VB/EP are slightly sub-optimal but show that the new algorithm is effective for sparse inference. In large-scale problems MCMC is infeasible due to computational limitations and the VB/EP algorithm then provides a very useful computationally efficient alternative.
Runcie, Daniel E; Mukherjee, Sayan
2013-07-01
Quantitative genetic studies that model complex, multivariate phenotypes are important for both evolutionary prediction and artificial selection. For example, changes in gene expression can provide insight into developmental and physiological mechanisms that link genotype and phenotype. However, classical analytical techniques are poorly suited to quantitative genetic studies of gene expression where the number of traits assayed per individual can reach many thousand. Here, we derive a Bayesian genetic sparse factor model for estimating the genetic covariance matrix (G-matrix) of high-dimensional traits, such as gene expression, in a mixed-effects model. The key idea of our model is that we need consider only G-matrices that are biologically plausible. An organism's entire phenotype is the result of processes that are modular and have limited complexity. This implies that the G-matrix will be highly structured. In particular, we assume that a limited number of intermediate traits (or factors, e.g., variations in development or physiology) control the variation in the high-dimensional phenotype, and that each of these intermediate traits is sparse - affecting only a few observed traits. The advantages of this approach are twofold. First, sparse factors are interpretable and provide biological insight into mechanisms underlying the genetic architecture. Second, enforcing sparsity helps prevent sampling errors from swamping out the true signal in high-dimensional data. We demonstrate the advantages of our model on simulated data and in an analysis of a published Drosophila melanogaster gene expression data set.
Directory of Open Access Journals (Sweden)
Anil S Thakur
2007-10-01
Full Text Available Crystallization is a major bottleneck in the process of macromolecular structure determination by X-ray crystallography. Successful crystallization requires the formation of nuclei and their subsequent growth to crystals of suitable size. Crystal growth generally occurs spontaneously in a supersaturated solution as a result of homogenous nucleation. However, in a typical sparse matrix screening experiment, precipitant and protein concentration are not sampled extensively, and supersaturation conditions suitable for nucleation are often missed.We tested the effect of nine potential heterogenous nucleating agents on crystallization of ten test proteins in a sparse matrix screen. Several nucleating agents induced crystal formation under conditions where no crystallization occurred in the absence of the nucleating agent. Four nucleating agents: dried seaweed; horse hair; cellulose and hydroxyapatite, had a considerable overall positive effect on crystallization success. This effect was further enhanced when these nucleating agents were used in combination with each other.Our results suggest that the addition of heterogeneous nucleating agents increases the chances of crystal formation when using sparse matrix screens.
Sparse and smooth canonical correlation analysis through rank-1 matrix approximation
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.
Library designs for generic C++ sparse matrix computations of iterative methods
Energy Technology Data Exchange (ETDEWEB)
Pozo, R.
1996-12-31
A new library design is presented for generic sparse matrix C++ objects for use in iterative algorithms and preconditioners. This design extends previous work on C++ numerical libraries by providing a framework in which efficient algorithms can be written *independent* of the matrix layout or format. That is, rather than supporting different codes for each (element type) / (matrix format) combination, only one version of the algorithm need be maintained. This not only reduces the effort for library developers, but also simplifies the calling interface seen by library users. Furthermore, the underlying matrix library can be naturally extended to support user-defined objects, such as hierarchical block-structured matrices, or application-specific preconditioners. Utilizing optimized kernels whenever possible, the resulting performance of such framework can be shown to be competitive with optimized Fortran programs.
Galiatsatos, P. G.; Tennyson, J.
2012-11-01
The most time consuming step within the framework of the UK R-matrix molecular codes is that of the diagonalization of the inner region Hamiltonian matrix (IRHM). Here we present the method that we follow to speed up this step. We use shared memory machines (SMM), distributed memory machines (DMM), the OpenMP directive based parallel language, the MPI function based parallel language, the sparse matrix diagonalizers ARPACK and PARPACK, a variation for real symmetric matrices of the official coordinate sparse matrix format and finally a parallel sparse matrix-vector product (PSMV). The efficient application of the previous techniques rely on two important facts: the sparsity of the matrix is large enough (more than 98%) and in order to get back converged results we need a small only part of the matrix spectrum.
Directory of Open Access Journals (Sweden)
Wang Wen-qin
2015-02-01
Full Text Available The waveforms used in Multiple-Input Multiple-Output (MIMO Synthetic Aperture Radar (SAR should have a large time-bandwidth product and good ambiguity function performance. A scheme to design multiple orthogonal MIMO SAR Orthogonal Frequency Division Multiplexing (OFDM chirp waveforms by combinational sparse matrix and correlation optimization is proposed. First, the problem of MIMO SAR waveform design amounts to the associated design of hopping frequency and amplitudes. Then a iterative exhaustive search algorithm is adopted to optimally design the code matrix with the constraints minimizing the block correlation coefficient of sparse matrix and the sum of cross-correlation peaks. And the amplitudes matrix are adaptively designed by minimizing the cross-correlation peaks with the genetic algorithm. Additionally, the impacts of waveform number, hopping frequency interval and selectable frequency index are also analyzed. The simulation results verify the proposed scheme can design multiple orthogonal large time-bandwidth product OFDM chirp waveforms with low cross-correlation peak and sidelobes and it improves ambiguity performance.
HIGH DIMENSIONAL COVARIANCE MATRIX ESTIMATION IN APPROXIMATE FACTOR MODELS.
Fan, Jianqing; Liao, Yuan; Mincheva, Martina
2011-01-01
The variance covariance matrix plays a central role in the inferential theories of high dimensional factor models in finance and economics. Popular regularization methods of directly exploiting sparsity are not directly applicable to many financial problems. Classical methods of estimating the covariance matrices are based on the strict factor models, assuming independent idiosyncratic components. This assumption, however, is restrictive in practical applications. By assuming sparse error covariance matrix, we allow the presence of the cross-sectional correlation even after taking out common factors, and it enables us to combine the merits of both methods. We estimate the sparse covariance using the adaptive thresholding technique as in Cai and Liu (2011), taking into account the fact that direct observations of the idiosyncratic components are unavailable. The impact of high dimensionality on the covariance matrix estimation based on the factor structure is then studied.
Parallelized preconditioned model building algorithm for matrix factorization
Kaya, Kamer; Birbil, İlker; Birbil, Ilker; Öztürk, Mehmet Kaan; Ozturk, Mehmet Kaan; Gohari, Amir
2017-01-01
Matrix factorization is a common task underlying several machine learning applications such as recommender systems, topic modeling, or compressed sensing. Given a large and possibly sparse matrix A, we seek two smaller matrices W and H such that their product is as close to A as possible. The objective is minimizing the sum of square errors in the approximation. Typically such problems involve hundreds of thousands of unknowns, so an optimizer must be exceptionally efficient. In this study, a...
Incremental Nonnegative Matrix Factorization for Face Recognition
Directory of Open Access Journals (Sweden)
Wen-Sheng Chen
2008-01-01
Full Text Available Nonnegative matrix factorization (NMF is a promising approach for local feature extraction in face recognition tasks. However, there are two major drawbacks in almost all existing NMF-based methods. One shortcoming is that the computational cost is expensive for large matrix decomposition. The other is that it must conduct repetitive learning, when the training samples or classes are updated. To overcome these two limitations, this paper proposes a novel incremental nonnegative matrix factorization (INMF for face representation and recognition. The proposed INMF approach is based on a novel constraint criterion and our previous block strategy. It thus has some good properties, such as low computational complexity, sparse coefficient matrix. Also, the coefficient column vectors between different classes are orthogonal. In particular, it can be applied to incremental learning. Two face databases, namely FERET and CMU PIE face databases, are selected for evaluation. Compared with PCA and some state-of-the-art NMF-based methods, our INMF approach gives the best performance.
Nonlocal low-rank and sparse matrix decomposition for spectral CT reconstruction
Niu, Shanzhou; Yu, Gaohang; Ma, Jianhua; Wang, Jing
2018-02-01
Spectral computed tomography (CT) has been a promising technique in research and clinics because of its ability to produce improved energy resolution images with narrow energy bins. However, the narrow energy bin image is often affected by serious quantum noise because of the limited number of photons used in the corresponding energy bin. To address this problem, we present an iterative reconstruction method for spectral CT using nonlocal low-rank and sparse matrix decomposition (NLSMD), which exploits the self-similarity of patches that are collected in multi-energy images. Specifically, each set of patches can be decomposed into a low-rank component and a sparse component, and the low-rank component represents the stationary background over different energy bins, while the sparse component represents the rest of the different spectral features in individual energy bins. Subsequently, an effective alternating optimization algorithm was developed to minimize the associated objective function. To validate and evaluate the NLSMD method, qualitative and quantitative studies were conducted by using simulated and real spectral CT data. Experimental results show that the NLSMD method improves spectral CT images in terms of noise reduction, artifact suppression and resolution preservation.
A Novel CSR-Based Sparse Matrix-Vector Multiplication on GPUs
Directory of Open Access Journals (Sweden)
Guixia He
2016-01-01
Full Text Available Sparse matrix-vector multiplication (SpMV is an important operation in scientific computations. Compressed sparse row (CSR is the most frequently used format to store sparse matrices. However, CSR-based SpMVs on graphic processing units (GPUs, for example, CSR-scalar and CSR-vector, usually have poor performance due to irregular memory access patterns. This motivates us to propose a perfect CSR-based SpMV on the GPU that is called PCSR. PCSR involves two kernels and accesses CSR arrays in a fully coalesced manner by introducing a middle array, which greatly alleviates the deficiencies of CSR-scalar (rare coalescing and CSR-vector (partial coalescing. Test results on a single C2050 GPU show that PCSR fully outperforms CSR-scalar, CSR-vector, and CSRMV and HYBMV in the vendor-tuned CUSPARSE library and is comparable with a most recently proposed CSR-based algorithm, CSR-Adaptive. Furthermore, we extend PCSR on a single GPU to multiple GPUs. Experimental results on four C2050 GPUs show that no matter whether the communication between GPUs is considered or not PCSR on multiple GPUs achieves good performance and has high parallel efficiency.
Graph Transformation and Designing Parallel Sparse Matrix Algorithms beyond Data Dependence Analysis
Directory of Open Access Journals (Sweden)
H.X. Lin
2004-01-01
Full Text Available Algorithms are often parallelized based on data dependence analysis manually or by means of parallel compilers. Some vector/matrix computations such as the matrix-vector products with simple data dependence structures (data parallelism can be easily parallelized. For problems with more complicated data dependence structures, parallelization is less straightforward. The data dependence graph is a powerful means for designing and analyzing parallel algorithms. However, for sparse matrix computations, parallelization based on solely exploiting the existing parallelism in an algorithm does not always give satisfactory results. For example, the conventional Gaussian elimination algorithm for the solution of a tri-diagonal system is inherently sequential, so algorithms specially for parallel computation has to be designed. After briefly reviewing different parallelization approaches, a powerful graph formalism for designing parallel algorithms is introduced. This formalism will be discussed using a tri-diagonal system as an example. Its application to general matrix computations is also discussed. Its power in designing parallel algorithms beyond the ability of data dependence analysis is shown by means of a new algorithm called ACER (Alternating Cyclic Elimination and Reduction algorithm.
Multiple-Factor Based Sparse Urban Travel Time Prediction
Directory of Open Access Journals (Sweden)
Xinyan Zhu
2018-02-01
Full Text Available The prediction of travel time is challenging given the sparseness of real-time traffic data and the uncertainty of travel, because it is influenced by multiple factors on the congested urban road networks. In our paper, we propose a three-layer neural network from big probe vehicles data incorporating multi-factors to estimate travel time. The procedure includes the following three steps. First, we aggregate data according to the travel time of a single taxi traveling a target link on working days as traffic flows display similar traffic patterns over a weekly cycle. We then extract feature relationships between target and adjacent links at 30 min interval. About 224,830,178 records are extracted from probe vehicles. Second, we design a three-layer artificial neural network model. The number of neurons in input layer is eight, and the number of neurons in output layer is one. Finally, the trained neural network model is used for link travel time prediction. Different factors are included to examine their influence on the link travel time. Our model is verified using historical data from probe vehicles collected from May to July 2014 in Wuhan, China. The results show that we could obtain the link travel time prediction results using the designed artificial neural network model and detect the influence of different factors on link travel time.
Robust and sparse correlation matrix estimation for the analysis of high-dimensional genomics data.
Serra, Angela; Coretto, Pietro; Fratello, Michele; Tagliaferri, Roberto; Stegle, Oliver
2018-02-15
Microarray technology can be used to study the expression of thousands of genes across a number of different experimental conditions, usually hundreds. The underlying principle is that genes sharing similar expression patterns, across different samples, can be part of the same co-expression system, or they may share the same biological functions. Groups of genes are usually identified based on cluster analysis. Clustering methods rely on the similarity matrix between genes. A common choice to measure similarity is to compute the sample correlation matrix. Dimensionality reduction is another popular data analysis task which is also based on covariance/correlation matrix estimates. Unfortunately, covariance/correlation matrix estimation suffers from the intrinsic noise present in high-dimensional data. Sources of noise are: sampling variations, presents of outlying sample units, and the fact that in most cases the number of units is much larger than the number of genes. In this paper, we propose a robust correlation matrix estimator that is regularized based on adaptive thresholding. The resulting method jointly tames the effects of the high-dimensionality, and data contamination. Computations are easy to implement and do not require hand tunings. Both simulated and real data are analyzed. A Monte Carlo experiment shows that the proposed method is capable of remarkable performances. Our correlation metric is more robust to outliers compared with the existing alternatives in two gene expression datasets. It is also shown how the regularization allows to automatically detect and filter spurious correlations. The same regularization is also extended to other less robust correlation measures. Finally, we apply the ARACNE algorithm on the SyNTreN gene expression data. Sensitivity and specificity of the reconstructed network is compared with the gold standard. We show that ARACNE performs better when it takes the proposed correlation matrix estimator as input. The R
Abdelfattah, Ahmad
2016-05-23
Simulations of many multi-component PDE-based applications, such as petroleum reservoirs or reacting flows, are dominated by the solution, on each time step and within each Newton step, of large sparse linear systems. The standard solver is a preconditioned Krylov method. Along with application of the preconditioner, memory-bound Sparse Matrix-Vector Multiplication (SpMV) is the most time-consuming operation in such solvers. Multi-species models produce Jacobians with a dense block structure, where the block size can be as large as a few dozen. Failing to exploit this dense block structure vastly underutilizes hardware capable of delivering high performance on dense BLAS operations. This paper presents a GPU-accelerated SpMV kernel for block-sparse matrices. Dense matrix-vector multiplications within the sparse-block structure leverage optimization techniques from the KBLAS library, a high performance library for dense BLAS kernels. The design ideas of KBLAS can be applied to block-sparse matrices. Furthermore, a technique is proposed to balance the workload among thread blocks when there are large variations in the lengths of nonzero rows. Multi-GPU performance is highlighted. The proposed SpMV kernel outperforms existing state-of-the-art implementations using matrices with real structures from different applications. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.
Abdelfattah, Ahmad; Ltaief, Hatem; Keyes, David E.; Dongarra, Jack
2016-01-01
Simulations of many multi-component PDE-based applications, such as petroleum reservoirs or reacting flows, are dominated by the solution, on each time step and within each Newton step, of large sparse linear systems. The standard solver is a preconditioned Krylov method. Along with application of the preconditioner, memory-bound Sparse Matrix-Vector Multiplication (SpMV) is the most time-consuming operation in such solvers. Multi-species models produce Jacobians with a dense block structure, where the block size can be as large as a few dozen. Failing to exploit this dense block structure vastly underutilizes hardware capable of delivering high performance on dense BLAS operations. This paper presents a GPU-accelerated SpMV kernel for block-sparse matrices. Dense matrix-vector multiplications within the sparse-block structure leverage optimization techniques from the KBLAS library, a high performance library for dense BLAS kernels. The design ideas of KBLAS can be applied to block-sparse matrices. Furthermore, a technique is proposed to balance the workload among thread blocks when there are large variations in the lengths of nonzero rows. Multi-GPU performance is highlighted. The proposed SpMV kernel outperforms existing state-of-the-art implementations using matrices with real structures from different applications. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.
Archer, A.W.; Maples, C.G.
1989-01-01
Numerous departures from ideal relationships are revealed by Monte Carlo simulations of widely accepted binomial coefficients. For example, simulations incorporating varying levels of matrix sparseness (presence of zeros indicating lack of data) and computation of expected values reveal that not only are all common coefficients influenced by zero data, but also that some coefficients do not discriminate between sparse or dense matrices (few zero data). Such coefficients computationally merge mutually shared and mutually absent information and do not exploit all the information incorporated within the standard 2 ?? 2 contingency table; therefore, the commonly used formulae for such coefficients are more complicated than the actual range of values produced. Other coefficients do differentiate between mutual presences and absences; however, a number of these coefficients do not demonstrate a linear relationship to matrix sparseness. Finally, simulations using nonrandom matrices with known degrees of row-by-row similarities signify that several coefficients either do not display a reasonable range of values or are nonlinear with respect to known relationships within the data. Analyses with nonrandom matrices yield clues as to the utility of certain coefficients for specific applications. For example, coefficients such as Jaccard, Dice, and Baroni-Urbani and Buser are useful if correction of sparseness is desired, whereas the Russell-Rao coefficient is useful when sparseness correction is not desired. ?? 1989 International Association for Mathematical Geology.
Optimization of sparse matrix-vector multiplication on emerging multicore platforms
Energy Technology Data Exchange (ETDEWEB)
Williams, Samuel [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Univ. of California, Berkeley, CA (United States); Oliker, Leonid [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Vuduc, Richard [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Shalf, John [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Yelick, Katherine [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Univ. of California, Berkeley, CA (United States); Demmel, James [Univ. of California, Berkeley, CA (United States)
2007-01-01
We are witnessing a dramatic change in computer architecture due to the multicore paradigm shift, as every electronic device from cell phones to supercomputers confronts parallelism of unprecedented scale. To fully unleash the potential of these systems, the HPC community must develop multicore specific optimization methodologies for important scientific computations. In this work, we examine sparse matrix-vector multiply (SpMV) - one of the most heavily used kernels in scientific computing - across a broad spectrum of multicore designs. Our experimental platform includes the homogeneous AMD dual-core and Intel quad-core designs, the heterogeneous STI Cell, as well as the first scientific study of the highly multithreaded Sun Niagara2. We present several optimization strategies especially effective for the multicore environment, and demonstrate significant performance improvements compared to existing state-of-the-art serial and parallel SpMV implementations. Additionally, we present key insights into the architectural tradeoffs of leading multicore design strategies, in the context of demanding memory-bound numerical algorithms.
Optimization of Sparse Matrix-Vector Multiplication on Emerging Multicore Platforms
Energy Technology Data Exchange (ETDEWEB)
Williams, Samuel; Oliker, Leonid; Vuduc, Richard; Shalf, John; Yelick, Katherine; Demmel, James
2008-10-16
We are witnessing a dramatic change in computer architecture due to the multicore paradigm shift, as every electronic device from cell phones to supercomputers confronts parallelism of unprecedented scale. To fully unleash the potential of these systems, the HPC community must develop multicore specific-optimization methodologies for important scientific computations. In this work, we examine sparse matrix-vector multiply (SpMV) - one of the most heavily used kernels in scientific computing - across a broad spectrum of multicore designs. Our experimental platform includes the homogeneous AMD quad-core, AMD dual-core, and Intel quad-core designs, the heterogeneous STI Cell, as well as one of the first scientific studies of the highly multithreaded Sun Victoria Falls (a Niagara2 SMP). We present several optimization strategies especially effective for the multicore environment, and demonstrate significant performance improvements compared to existing state-of-the-art serial and parallel SpMV implementations. Additionally, we present key insights into the architectural trade-offs of leading multicore design strategies, in the context of demanding memory-bound numerical algorithms.
TRASYS form factor matrix normalization
Tsuyuki, Glenn T.
1992-01-01
A method has been developed for adjusting a TRASYS enclosure form factor matrix to unity. This approach is not limited to closed geometries, and in fact, it is primarily intended for use with open geometries. The purpose of this approach is to prevent optimistic form factors to space. In this method, nodal form factor sums are calculated within 0.05 of unity using TRASYS, although deviations as large as 0.10 may be acceptable, and then, a process is employed to distribute the difference amongst the nodes. A specific example has been analyzed with this method, and a comparison was performed with a standard approach for calculating radiation conductors. In this comparison, hot and cold case temperatures were determined. Exterior nodes exhibited temperature differences as large as 7 C and 3 C for the hot and cold cases, respectively when compared with the standard approach, while interior nodes demonstrated temperature differences from 0 C to 5 C. These results indicate that temperature predictions can be artificially biased if the form factor computation error is lumped into the individual form factors to space.
Directory of Open Access Journals (Sweden)
Bérenger Bramas
2018-04-01
Full Text Available The sparse matrix-vector product (SpMV is a fundamental operation in many scientific applications from various fields. The High Performance Computing (HPC community has therefore continuously invested a lot of effort to provide an efficient SpMV kernel on modern CPU architectures. Although it has been shown that block-based kernels help to achieve high performance, they are difficult to use in practice because of the zero padding they require. In the current paper, we propose new kernels using the AVX-512 instruction set, which makes it possible to use a blocking scheme without any zero padding in the matrix memory storage. We describe mask-based sparse matrix formats and their corresponding SpMV kernels highly optimized in assembly language. Considering that the optimal blocking size depends on the matrix, we also provide a method to predict the best kernel to be used utilizing a simple interpolation of results from previous executions. We compare the performance of our approach to that of the Intel MKL CSR kernel and the CSR5 open-source package on a set of standard benchmark matrices. We show that we can achieve significant improvements in many cases, both for sequential and for parallel executions. Finally, we provide the corresponding code in an open source library, called SPC5.
Zhang, Haicang; Gao, Yujuan; Deng, Minghua; Wang, Chao; Zhu, Jianwei; Li, Shuai Cheng; Zheng, Wei-Mou; Bu, Dongbo
2016-03-25
Strategies for correlation analysis in protein contact prediction often encounter two challenges, namely, the indirect coupling among residues, and the background correlations mainly caused by phylogenetic biases. While various studies have been conducted on how to disentangle indirect coupling, the removal of background correlations still remains unresolved. Here, we present an approach for removing background correlations via low-rank and sparse decomposition (LRS) of a residue correlation matrix. The correlation matrix can be constructed using either local inference strategies (e.g., mutual information, or MI) or global inference strategies (e.g., direct coupling analysis, or DCA). In our approach, a correlation matrix was decomposed into two components, i.e., a low-rank component representing background correlations, and a sparse component representing true correlations. Finally the residue contacts were inferred from the sparse component of correlation matrix. We trained our LRS-based method on the PSICOV dataset, and tested it on both GREMLIN and CASP11 datasets. Our experimental results suggested that LRS significantly improves the contact prediction precision. For example, when equipped with the LRS technique, the prediction precision of MI and mfDCA increased from 0.25 to 0.67 and from 0.58 to 0.70, respectively (Top L/10 predicted contacts, sequence separation: 5 AA, dataset: GREMLIN). In addition, our LRS technique also consistently outperforms the popular denoising technique APC (average product correction), on both local (MI_LRS: 0.67 vs MI_APC: 0.34) and global measures (mfDCA_LRS: 0.70 vs mfDCA_APC: 0.67). Interestingly, we found out that when equipped with our LRS technique, local inference strategies performed in a comparable manner to that of global inference strategies, implying that the application of LRS technique narrowed down the performance gap between local and global inference strategies. Overall, our LRS technique greatly facilitates
Speculative segmented sum for sparse matrix-vector multiplication on heterogeneous processors
DEFF Research Database (Denmark)
Liu, Weifeng; Vinter, Brian
2015-01-01
of the same chip is triggered to re-arrange the predicted partial sums for a correct resulting vector. On three heterogeneous processors from Intel, AMD and nVidia, using 20 sparse matrices as a benchmark suite, the experimental results show that our method obtains significant performance improvement over...
Convex nonnegative matrix factorization with manifold regularization.
Hu, Wenjun; Choi, Kup-Sze; Wang, Peiliang; Jiang, Yunliang; Wang, Shitong
2015-03-01
Nonnegative Matrix Factorization (NMF) has been extensively applied in many areas, including computer vision, pattern recognition, text mining, and signal processing. However, nonnegative entries are usually required for the data matrix in NMF, which limits its application. Besides, while the basis and encoding vectors obtained by NMF can represent the original data in low dimension, the representations do not always reflect the intrinsic geometric structure embedded in the data. Motivated by manifold learning and Convex NMF (CNMF), we propose a novel matrix factorization method called Graph Regularized and Convex Nonnegative Matrix Factorization (GCNMF) by introducing a graph regularized term into CNMF. The proposed matrix factorization technique not only inherits the intrinsic low-dimensional manifold structure, but also allows the processing of mixed-sign data matrix. Clustering experiments on nonnegative and mixed-sign real-world data sets are conducted to demonstrate the effectiveness of the proposed method. Copyright © 2014 Elsevier Ltd. All rights reserved.
The application of sparse estimation of covariance matrix to quadratic discriminant analysis
Sun, Jiehuan; Zhao, Hongyu
2015-01-01
Background Although Linear Discriminant Analysis (LDA) is commonly used for classification, it may not be directly applied in genomics studies due to the large p, small n problem in these studies. Different versions of sparse LDA have been proposed to address this significant challenge. One implicit assumption of various LDA-based methods is that the covariance matrices are the same across different classes. However, rewiring of genetic networks (therefore different covariance matrices) acros...
Nonnegative Matrix Factorization with Rank Regularization and Hard Constraint.
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.
The application of sparse estimation of covariance matrix to quadratic discriminant analysis.
Sun, Jiehuan; Zhao, Hongyu
2015-02-18
Although Linear Discriminant Analysis (LDA) is commonly used for classification, it may not be directly applied in genomics studies due to the large p, small n problem in these studies. Different versions of sparse LDA have been proposed to address this significant challenge. One implicit assumption of various LDA-based methods is that the covariance matrices are the same across different classes. However, rewiring of genetic networks (therefore different covariance matrices) across different diseases has been observed in many genomics studies, which suggests that LDA and its variations may be suboptimal for disease classifications. However, it is not clear whether considering differing genetic networks across diseases can improve classification in genomics studies. We propose a sparse version of Quadratic Discriminant Analysis (SQDA) to explicitly consider the differences of the genetic networks across diseases. Both simulation and real data analysis are performed to compare the performance of SQDA with six commonly used classification methods. SQDA provides more accurate classification results than other methods for both simulated and real data. Our method should prove useful for classification in genomics studies and other research settings, where covariances differ among classes.
An Adaptive Multilevel Factorized Sparse Approximate Inverse Preconditioning
Czech Academy of Sciences Publication Activity Database
Kopal, Jiří; Rozložník, Miroslav; Tůma, Miroslav
2017-01-01
Roč. 113, November (2017), s. 19-24 ISSN 0965-9978 R&D Projects: GA ČR GA13-06684S Grant - others:GA MŠk(CZ) LL1202 Institutional support: RVO:67985807 Keywords : approximate inverse * Gram–Schmidt orthogonalization * incomplete factorization * multilevel methods * preconditioned conjugate gradient method Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 3.000, year: 2016
Sparse Probabilistic Parallel Factor Analysis for the Modeling of PET and Task-fMRI Data
DEFF Research Database (Denmark)
Beliveau, Vincent; Papoutsakis, Georgios; Hinrich, Jesper Løve
2017-01-01
Modern datasets are often multiway in nature and can contain patterns common to a mode of the data (e.g. space, time, and subjects). Multiway decomposition such as parallel factor analysis (PARAFAC) take into account the intrinsic structure of the data, and sparse versions of these methods improv...
Mohr, Stephan; Dawson, William; Wagner, Michael; Caliste, Damien; Nakajima, Takahito; Genovese, Luigi
2017-10-10
We present CheSS, the "Chebyshev Sparse Solvers" library, which has been designed to solve typical problems arising in large-scale electronic structure calculations using localized basis sets. The library is based on a flexible and efficient expansion in terms of Chebyshev polynomials and presently features the calculation of the density matrix, the calculation of matrix powers for arbitrary powers, and the extraction of eigenvalues in a selected interval. CheSS is able to exploit the sparsity of the matrices and scales linearly with respect to the number of nonzero entries, making it well-suited for large-scale calculations. The approach is particularly adapted for setups leading to small spectral widths of the involved matrices and outperforms alternative methods in this regime. By coupling CheSS to the DFT code BigDFT, we show that such a favorable setup is indeed possible in practice. In addition, the approach based on Chebyshev polynomials can be massively parallelized, and CheSS exhibits excellent scaling up to thousands of cores even for relatively small matrix sizes.
International Nuclear Information System (INIS)
Yang, C L; Wei, H Y; Soleimani, M; Adler, A
2013-01-01
Electrical impedance tomography (EIT) is a fast and cost-effective technique to provide a tomographic conductivity image of a subject from boundary current–voltage data. This paper proposes a time and memory efficient method for solving a large scale 3D EIT inverse problem using a parallel conjugate gradient (CG) algorithm. The 3D EIT system with a large number of measurement data can produce a large size of Jacobian matrix; this could cause difficulties in computer storage and the inversion process. One of challenges in 3D EIT is to decrease the reconstruction time and memory usage, at the same time retaining the image quality. Firstly, a sparse matrix reduction technique is proposed using thresholding to set very small values of the Jacobian matrix to zero. By adjusting the Jacobian matrix into a sparse format, the element with zeros would be eliminated, which results in a saving of memory requirement. Secondly, a block-wise CG method for parallel reconstruction has been developed. The proposed method has been tested using simulated data as well as experimental test samples. Sparse Jacobian with a block-wise CG enables the large scale EIT problem to be solved efficiently. Image quality measures are presented to quantify the effect of sparse matrix reduction in reconstruction results. (paper)
Yang, C L; Wei, H Y; Adler, A; Soleimani, M
2013-06-01
Electrical impedance tomography (EIT) is a fast and cost-effective technique to provide a tomographic conductivity image of a subject from boundary current-voltage data. This paper proposes a time and memory efficient method for solving a large scale 3D EIT inverse problem using a parallel conjugate gradient (CG) algorithm. The 3D EIT system with a large number of measurement data can produce a large size of Jacobian matrix; this could cause difficulties in computer storage and the inversion process. One of challenges in 3D EIT is to decrease the reconstruction time and memory usage, at the same time retaining the image quality. Firstly, a sparse matrix reduction technique is proposed using thresholding to set very small values of the Jacobian matrix to zero. By adjusting the Jacobian matrix into a sparse format, the element with zeros would be eliminated, which results in a saving of memory requirement. Secondly, a block-wise CG method for parallel reconstruction has been developed. The proposed method has been tested using simulated data as well as experimental test samples. Sparse Jacobian with a block-wise CG enables the large scale EIT problem to be solved efficiently. Image quality measures are presented to quantify the effect of sparse matrix reduction in reconstruction results.
Effects of Ordering Strategies and Programming Paradigms on Sparse Matrix Computations
Oliker, Leonid; Li, Xiaoye; Husbands, Parry; Biswas, Rupak; Biegel, Bryan (Technical Monitor)
2002-01-01
The Conjugate Gradient (CG) algorithm is perhaps the best-known iterative technique to solve sparse linear systems that are symmetric and positive definite. For systems that are ill-conditioned, it is often necessary to use a preconditioning technique. In this paper, we investigate the effects of various ordering and partitioning strategies on the performance of parallel CG and ILU(O) preconditioned CG (PCG) using different programming paradigms and architectures. Results show that for this class of applications: ordering significantly improves overall performance on both distributed and distributed shared-memory systems, that cache reuse may be more important than reducing communication, that it is possible to achieve message-passing performance using shared-memory constructs through careful data ordering and distribution, and that a hybrid MPI+OpenMP paradigm increases programming complexity with little performance gains. A implementation of CG on the Cray MTA does not require special ordering or partitioning to obtain high efficiency and scalability, giving it a distinct advantage for adaptive applications; however, it shows limited scalability for PCG due to a lack of thread level parallelism.
Luo, Xin; Zhou, MengChu; Li, Shuai; You, Zhuhong; Xia, Yunni; Zhu, Qingsheng
2016-03-01
Nonnegative matrix factorization (NMF)-based models possess fine representativeness of a target matrix, which is critically important in collaborative filtering (CF)-based recommender systems. However, current NMF-based CF recommenders suffer from the problem of high computational and storage complexity, as well as slow convergence rate, which prevents them from industrial usage in context of big data. To address these issues, this paper proposes an alternating direction method (ADM)-based nonnegative latent factor (ANLF) model. The main idea is to implement the ADM-based optimization with regard to each single feature, to obtain high convergence rate as well as low complexity. Both computational and storage costs of ANLF are linear with the size of given data in the target matrix, which ensures high efficiency when dealing with extremely sparse matrices usually seen in CF problems. As demonstrated by the experiments on large, real data sets, ANLF also ensures fast convergence and high prediction accuracy, as well as the maintenance of nonnegativity constraints. Moreover, it is simple and easy to implement for real applications of learning systems.
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.
A hierarchical model for ordinal matrix factorization
DEFF Research Database (Denmark)
Paquet, Ulrich; Thomson, Blaise; Winther, Ole
2012-01-01
This paper proposes a hierarchical probabilistic model for ordinal matrix factorization. Unlike previous approaches, we model the ordinal nature of the data and take a principled approach to incorporating priors for the hidden variables. Two algorithms are presented for inference, one based...
Shifted Non-negative Matrix Factorization
DEFF Research Database (Denmark)
Mørup, Morten; Madsen, Kristoffer Hougaard; Hansen, Lars Kai
2007-01-01
Non-negative matrix factorization (NMF) has become a widely used blind source separation technique due to its part based representation and ease of interpretability. We currently extend the NMF model to allow for delays between sources and sensors. This is a natural extension for spectrometry data...
Matrix factorization on a hypercube multiprocessor
International Nuclear Information System (INIS)
Geist, G.A.; Heath, M.T.
1985-08-01
This paper is concerned with parallel algorithms for matrix factorization on distributed-memory, message-passing multiprocessors, with special emphasis on the hypercube. Both Cholesky factorization of symmetric positive definite matrices and LU factorization of nonsymmetric matrices using partial pivoting are considered. The use of the resulting triangular factors to solve systems of linear equations by forward and back substitutions is also considered. Efficiencies of various parallel computational approaches are compared in terms of empirical results obtained on an Intel iPSC hypercube. 19 refs., 6 figs., 2 tabs
Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model
DEFF Research Database (Denmark)
Bender, Michael A.; Brodal, Gerth Stølting; Fagerberg, Rolf
2010-01-01
of nonzero entries is kN, i.e., where the average number of nonzero entries per column is k. We investigate what is the external worst-case complexity, i.e., the best possible upper bound on the number of I/Os, as a function of k and N. We determine this complexity up to a constant factor for all meaningful...
Max–min distance nonnegative matrix factorization
Wang, Jim Jing-Yan; Gao, Xin
2014-01-01
Nonnegative Matrix Factorization (NMF) has been a popular representation method for pattern classification problems. It tries to decompose a nonnegative matrix of data samples as the product of a nonnegative basis matrix and a nonnegative coefficient matrix. The columns of the coefficient matrix can be used as new representations of these data samples. However, traditional NMF methods ignore class labels of the data samples. In this paper, we propose a novel supervised NMF algorithm to improve the discriminative ability of the new representation by using the class labels. Using the class labels, we separate all the data sample pairs into within-class pairs and between-class pairs. To improve the discriminative ability of the new NMF representations, we propose to minimize the maximum distance of the within-class pairs in the new NMF space, and meanwhile to maximize the minimum distance of the between-class pairs. With this criterion, we construct an objective function and optimize it with regard to basis and coefficient matrices, and slack variables alternatively, resulting in an iterative algorithm. The proposed algorithm is evaluated on three pattern classification problems and experiment results show that it outperforms the state-of-the-art supervised NMF methods.
Max–min distance nonnegative matrix factorization
Wang, Jim Jing-Yan
2014-10-26
Nonnegative Matrix Factorization (NMF) has been a popular representation method for pattern classification problems. It tries to decompose a nonnegative matrix of data samples as the product of a nonnegative basis matrix and a nonnegative coefficient matrix. The columns of the coefficient matrix can be used as new representations of these data samples. However, traditional NMF methods ignore class labels of the data samples. In this paper, we propose a novel supervised NMF algorithm to improve the discriminative ability of the new representation by using the class labels. Using the class labels, we separate all the data sample pairs into within-class pairs and between-class pairs. To improve the discriminative ability of the new NMF representations, we propose to minimize the maximum distance of the within-class pairs in the new NMF space, and meanwhile to maximize the minimum distance of the between-class pairs. With this criterion, we construct an objective function and optimize it with regard to basis and coefficient matrices, and slack variables alternatively, resulting in an iterative algorithm. The proposed algorithm is evaluated on three pattern classification problems and experiment results show that it outperforms the state-of-the-art supervised NMF methods.
Hine, N D M; Haynes, P D; Mostofi, A A; Payne, M C
2010-09-21
We present calculations of formation energies of defects in an ionic solid (Al(2)O(3)) extrapolated to the dilute limit, corresponding to a simulation cell of infinite size. The large-scale calculations required for this extrapolation are enabled by developments in the approach to parallel sparse matrix algebra operations, which are central to linear-scaling density-functional theory calculations. The computational cost of manipulating sparse matrices, whose sizes are determined by the large number of basis functions present, is greatly improved with this new approach. We present details of the sparse algebra scheme implemented in the ONETEP code using hierarchical sparsity patterns, and demonstrate its use in calculations on a wide range of systems, involving thousands of atoms on hundreds to thousands of parallel processes.
A new scheduling algorithm for parallel sparse LU factorization with static pivoting
Energy Technology Data Exchange (ETDEWEB)
Grigori, Laura; Li, Xiaoye S.
2002-08-20
In this paper we present a static scheduling algorithm for parallel sparse LU factorization with static pivoting. The algorithm is divided into mapping and scheduling phases, using the symmetric pruned graphs of L' and U to represent dependencies. The scheduling algorithm is designed for driving the parallel execution of the factorization on a distributed-memory architecture. Experimental results and comparisons with SuperLU{_}DIST are reported after applying this algorithm on real world application matrices on an IBM SP RS/6000 distributed memory machine.
Matrix factorizations, minimal models and Massey products
International Nuclear Information System (INIS)
Knapp, Johanna; Omer, Harun
2006-01-01
We present a method to compute the full non-linear deformations of matrix factorizations for ADE minimal models. This method is based on the calculation of higher products in the cohomology, called Massey products. The algorithm yields a polynomial ring whose vanishing relations encode the obstructions of the deformations of the D-branes characterized by these matrix factorizations. This coincides with the critical locus of the effective superpotential which can be computed by integrating these relations. Our results for the effective superpotential are in agreement with those obtained from solving the A-infinity relations. We point out a relation to the superpotentials of Kazama-Suzuki models. We will illustrate our findings by various examples, putting emphasis on the E 6 minimal model
Wu, Jibing; Meng, Qinggang; Deng, Su; Huang, Hongbin; Wu, Yahui; Badii, Atta
2017-01-01
Heterogeneous information networks (e.g. bibliographic networks and social media networks) that consist of multiple interconnected objects are ubiquitous. Clustering analysis is an effective method to understand the semantic information and interpretable structure of the heterogeneous information networks, and it has attracted the attention of many researchers in recent years. However, most studies assume that heterogeneous information networks usually follow some simple schemas, such as bi-typed networks or star network schema, and they can only cluster one type of object in the network each time. In this paper, a novel clustering framework is proposed based on sparse tensor factorization for heterogeneous information networks, which can cluster multiple types of objects simultaneously in a single pass without any network schema information. The types of objects and the relations between them in the heterogeneous information networks are modeled as a sparse tensor. The clustering issue is modeled as an optimization problem, which is similar to the well-known Tucker decomposition. Then, an Alternating Least Squares (ALS) algorithm and a feasible initialization method are proposed to solve the optimization problem. Based on the tensor factorization, we simultaneously partition different types of objects into different clusters. The experimental results on both synthetic and real-world datasets have demonstrated that our proposed clustering framework, STFClus, can model heterogeneous information networks efficiently and can outperform state-of-the-art clustering algorithms as a generally applicable single-pass clustering method for heterogeneous network which is network schema agnostic.
Multiple graph regularized nonnegative matrix factorization
Wang, Jim Jing-Yan
2013-10-01
Non-negative matrix factorization (NMF) has been widely used as a data representation method based on components. To overcome the disadvantage of NMF in failing to consider the manifold structure of a data set, graph regularized NMF (GrNMF) has been proposed by Cai et al. by constructing an affinity graph and searching for a matrix factorization that respects graph structure. Selecting a graph model and its corresponding parameters is critical for this strategy. This process is usually carried out by cross-validation or discrete grid search, which are time consuming and prone to overfitting. In this paper, we propose a GrNMF, called MultiGrNMF, in which the intrinsic manifold is approximated by a linear combination of several graphs with different models and parameters inspired by ensemble manifold regularization. Factorization metrics and linear combination coefficients of graphs are determined simultaneously within a unified object function. They are alternately optimized in an iterative algorithm, thus resulting in a novel data representation algorithm. Extensive experiments on a protein subcellular localization task and an Alzheimer\\'s disease diagnosis task demonstrate the effectiveness of the proposed algorithm. © 2013 Elsevier Ltd. All rights reserved.
Multithreading for synchronization tolerance in matrix factorization
International Nuclear Information System (INIS)
Buttari, Alfredo; Dongarra, Jack; Husbands, Parry; Kurzak, Jakub; Yelick, Katherine
2007-01-01
Physical constraints such as power, leakage and pin bandwidth are currently driving the HPC industry to produce systems with unprecedented levels of concurrency. In these parallel systems, synchronization and memory operations are becoming considerably more expensive than before. In this work we study parallel matrix factorization codes and conclude that they need to be re-engineered to avoid unnecessary (and expensive) synchronization. We propose the use of multithreading combined with intelligent schedulers and implement representative algorithms in this style. Our results indicate that this strategy can significantly outperform traditional codes
Zhou, Yan; Wang, Pei; Wang, Xianlong; Zhu, Ji; Song, Peter X-K
2017-01-01
The multivariate regression model is a useful tool to explore complex associations between two kinds of molecular markers, which enables the understanding of the biological pathways underlying disease etiology. For a set of correlated response variables, accounting for such dependency can increase statistical power. Motivated by integrative genomic data analyses, we propose a new methodology-sparse multivariate factor analysis regression model (smFARM), in which correlations of response variables are assumed to follow a factor analysis model with latent factors. This proposed method not only allows us to address the challenge that the number of association parameters is larger than the sample size, but also to adjust for unobserved genetic and/or nongenetic factors that potentially conceal the underlying response-predictor associations. The proposed smFARM is implemented by the EM algorithm and the blockwise coordinate descent algorithm. The proposed methodology is evaluated and compared to the existing methods through extensive simulation studies. Our results show that accounting for latent factors through the proposed smFARM can improve sensitivity of signal detection and accuracy of sparse association map estimation. We illustrate smFARM by two integrative genomics analysis examples, a breast cancer dataset, and an ovarian cancer dataset, to assess the relationship between DNA copy numbers and gene expression arrays to understand genetic regulatory patterns relevant to the disease. We identify two trans-hub regions: one in cytoband 17q12 whose amplification influences the RNA expression levels of important breast cancer genes, and the other in cytoband 9q21.32-33, which is associated with chemoresistance in ovarian cancer. © 2016 WILEY PERIODICALS, INC.
Non-negative Matrix Factorization for Binary Data
DEFF Research Database (Denmark)
Larsen, Jacob Søgaard; Clemmensen, Line Katrine Harder
We propose the Logistic Non-negative Matrix Factorization for decomposition of binary data. Binary data are frequently generated in e.g. text analysis, sensory data, market basket data etc. A common method for analysing non-negative data is the Non-negative Matrix Factorization, though...... this is in theory not appropriate for binary data, and thus we propose a novel Non-negative Matrix Factorization based on the logistic link function. Furthermore we generalize the method to handle missing data. The formulation of the method is compared to a previously proposed method (Tome et al., 2015). We compare...... the performance of the Logistic Non-negative Matrix Factorization to Least Squares Non-negative Matrix Factorization and Kullback-Leibler (KL) Non-negative Matrix Factorization on sets of binary data: a synthetic dataset, a set of student comments on their professors collected in a binary term-document matrix...
Low-Rank Matrix Factorization With Adaptive Graph Regularizer.
Lu, Gui-Fu; Wang, Yong; Zou, Jian
2016-05-01
In this paper, we present a novel low-rank matrix factorization algorithm with adaptive graph regularizer (LMFAGR). We extend the recently proposed low-rank matrix with manifold regularization (MMF) method with an adaptive regularizer. Different from MMF, which constructs an affinity graph in advance, LMFAGR can simultaneously seek graph weight matrix and low-dimensional representations of data. That is, graph construction and low-rank matrix factorization are incorporated into a unified framework, which results in an automatically updated graph rather than a predefined one. The experimental results on some data sets demonstrate that the proposed algorithm outperforms the state-of-the-art low-rank matrix factorization methods.
Fast wavelet based sparse approximate inverse preconditioner
Energy Technology Data Exchange (ETDEWEB)
Wan, W.L. [Univ. of California, Los Angeles, CA (United States)
1996-12-31
Incomplete LU factorization is a robust preconditioner for both general and PDE problems but unfortunately not easy to parallelize. Recent study of Huckle and Grote and Chow and Saad showed that sparse approximate inverse could be a potential alternative while readily parallelizable. However, for special class of matrix A that comes from elliptic PDE problems, their preconditioners are not optimal in the sense that independent of mesh size. A reason may be that no good sparse approximate inverse exists for the dense inverse matrix. Our observation is that for this kind of matrices, its inverse entries typically have piecewise smooth changes. We can take advantage of this fact and use wavelet compression techniques to construct a better sparse approximate inverse preconditioner. We shall show numerically that our approach is effective for this kind of matrices.
Doubly sparse factor models for unifying feature transformation and feature selection
International Nuclear Information System (INIS)
Katahira, Kentaro; Okanoya, Kazuo; Okada, Masato; Matsumoto, Narihisa; Sugase-Miyamoto, Yasuko
2010-01-01
A number of unsupervised learning methods for high-dimensional data are largely divided into two groups based on their procedures, i.e., (1) feature selection, which discards irrelevant dimensions of the data, and (2) feature transformation, which constructs new variables by transforming and mixing over all dimensions. We propose a method that both selects and transforms features in a common Bayesian inference procedure. Our method imposes a doubly automatic relevance determination (ARD) prior on the factor loading matrix. We propose a variational Bayesian inference for our model and demonstrate the performance of our method on both synthetic and real data.
Doubly sparse factor models for unifying feature transformation and feature selection
Energy Technology Data Exchange (ETDEWEB)
Katahira, Kentaro; Okanoya, Kazuo; Okada, Masato [ERATO, Okanoya Emotional Information Project, Japan Science Technology Agency, Saitama (Japan); Matsumoto, Narihisa; Sugase-Miyamoto, Yasuko, E-mail: okada@k.u-tokyo.ac.j [Human Technology Research Institute, National Institute of Advanced Industrial Science and Technology, Ibaraki (Japan)
2010-06-01
A number of unsupervised learning methods for high-dimensional data are largely divided into two groups based on their procedures, i.e., (1) feature selection, which discards irrelevant dimensions of the data, and (2) feature transformation, which constructs new variables by transforming and mixing over all dimensions. We propose a method that both selects and transforms features in a common Bayesian inference procedure. Our method imposes a doubly automatic relevance determination (ARD) prior on the factor loading matrix. We propose a variational Bayesian inference for our model and demonstrate the performance of our method on both synthetic and real data.
International Nuclear Information System (INIS)
Zhou, Jian; Qi, Jinyi
2014-01-01
A factorized system matrix utilizing an image domain resolution model is attractive in fully 3D time-of-flight PET image reconstruction using list-mode data. In this paper, we study a factored model based on sparse matrix factorization that is comprised primarily of a simplified geometrical projection matrix and an image blurring matrix. Beside the commonly-used Siddon’s ray-tracer, we propose another more simplified geometrical projector based on the Bresenham’s ray-tracer which further reduces the computational cost. We discuss in general how to obtain an image blurring matrix associated with a geometrical projector, and provide theoretical analysis that can be used to inspect the efficiency in model factorization. In simulation studies, we investigate the performance of the proposed sparse factorization model in terms of spatial resolution, noise properties and computational cost. The quantitative results reveal that the factorization model can be as efficient as a non-factored model, while its computational cost can be much lower. In addition we conduct Monte Carlo simulations to identify the conditions under which the image resolution model can become more efficient in terms of image contrast recovery. We verify our observations using the provided theoretical analysis. The result offers a general guide to achieve the optimal reconstruction performance based on a sparse factorization model with an image domain resolution model. (paper)
An Extended-Tag-Induced Matrix Factorization Technique for Recommender Systems
Directory of Open Access Journals (Sweden)
Huirui Han
2018-06-01
Full Text Available Social tag information has been used by recommender systems to handle the problem of data sparsity. Recently, the relationships between users/items and tags are considered by most tag-induced recommendation methods. However, sparse tag information is challenging to most existing methods. In this paper, we propose an Extended-Tag-Induced Matrix Factorization technique for recommender systems, which exploits correlations among tags derived by co-occurrence of tags to improve the performance of recommender systems, even in the case of sparse tag information. The proposed method integrates coupled similarity between tags, which is calculated by the co-occurrences of tags in the same items, to extend each item’s tags. Finally, item similarity based on extended tags is utilized as an item relationship regularization term to constrain the process of matrix factorization. MovieLens dataset and Book-Crossing dataset are adopted to evaluate the performance of the proposed algorithm. The results of experiments show that the proposed method can alleviate the impact of tag sparsity and improve the performance of recommender systems.
Nonnegative Matrix Factorizations Performing Object Detection and Localization
Directory of Open Access Journals (Sweden)
G. Casalino
2012-01-01
Full Text Available We study the problem of detecting and localizing objects in still, gray-scale images making use of the part-based representation provided by nonnegative matrix factorizations. Nonnegative matrix factorization represents an emerging example of subspace methods, which is able to extract interpretable parts from a set of template image objects and then to additively use them for describing individual objects. In this paper, we present a prototype system based on some nonnegative factorization algorithms, which differ in the additional properties added to the nonnegative representation of data, in order to investigate if any additional constraint produces better results in general object detection via nonnegative matrix factorizations.
ImWalkMF: Joint matrix factorization and implicit walk integrative learning for recommendation
Zhang, Chuxu
2018-01-15
Data sparsity and cold-start problems are prevalent in recommender systems. To address such problems, both the observable explicit social information (e.g., user-user trust connections) and the inferable implicit correlations (e.g., implicit neighbors computed by similarity measurement) have been introduced to complement user-item ratings data for improving the performances of traditional model-based recommendation algorithms such as matrix factorization. Although effective, (1) the utilization of the explicit user-user social relationships suffers from the weakness of unavailability in real systems such as Netflix or the issue of sparse observable content like 0.03% trust density in Epinions, thus there is no or little explicit social information that can be employed to improve baseline model in real applications; (2) the current similarity measurement approaches focus on inferring implicit correlations between a user (item) and their direct neighbors or top-k similar neighbors based on user-item ratings bipartite network, so that they fail to comprehensively unfold the indirect potential relationships among users and items. To solve these issues regarding both explicit/implicit social recommendation algorithms, we design a joint model of matrix factorization and implicit walk integrative learning, i.e., ImWalkMF, which only uses explicit ratings information yet models both direct rating feedbacks and multiple direct/indirect implicit correlations among users and items from a random walk perspective. We further propose a combined strategy for training two independent components in the proposed model based on sampling. The experimental results on two real-world sparse datasets demonstrate that ImWalkMF outperforms the traditional regularized/probabilistic matrix factorization models as well as other competitive baselines that utilize explicit/implicit social information.
Convergence Improvement of Response Matrix Method with Large Discontinuity Factors
International Nuclear Information System (INIS)
Yamamoto, Akio
2003-01-01
In the response matrix method, a numerical divergence problem has been reported when extremely small or large discontinuity factors are utilized in the calculations. In this paper, an alternative response matrix formulation to solve the divergence problem is discussed, and properties of iteration matrixes are investigated through eigenvalue analyses. In the conventional response matrix formulation, partial currents between adjacent nodes are assumed to be discontinuous, and outgoing partial currents are converted into incoming partial currents by the discontinuity factor matrix. Namely, the partial currents of the homogeneous system (i.e., homogeneous partial currents) are treated in the conventional response matrix formulation. In this approach, the spectral radius of an iteration matrix for the partial currents may exceed unity when an extremely small or large discontinuity factor is used. Contrary to this, an alternative response matrix formulation using heterogeneous partial currents is discussed in this paper. In the latter approach, partial currents are assumed to be continuous between adjacent nodes, and discontinuity factors are directly considered in the coefficients of a response matrix. From the eigenvalue analysis of the iteration matrix for the one-group, one-dimensional problem, the spectral radius for the heterogeneous partial current formulation does not exceed unity even if an extremely small or large discontinuity factor is used in the calculation; numerical stability of the alternative formulation is superior to the conventional one. The numerical stability of the heterogeneous partial current formulation is also confirmed by the two-dimensional light water reactor core analysis. Since the heterogeneous partial current formulation does not require any approximation, the converged solution exactly reproduces the reference solution when the discontinuity factors are directly derived from the reference calculation
Multiplicative algorithms for constrained non-negative matrix factorization
Peng, Chengbin; Wong, Kachun; Rockwood, Alyn; Zhang, Xiangliang; Jiang, Jinling; Keyes, David E.
2012-01-01
Non-negative matrix factorization (NMF) provides the advantage of parts-based data representation through additive only combinations. It has been widely adopted in areas like item recommending, text mining, data clustering, speech denoising, etc
Normalization Of Thermal-Radiation Form-Factor Matrix
Tsuyuki, Glenn T.
1994-01-01
Report describes algorithm that adjusts form-factor matrix in TRASYS computer program, which calculates intraspacecraft radiative interchange among various surfaces and environmental heat loading from sources such as sun.
An Elementary Proof of the Polynomial Matrix Spectral Factorization Theorem
Ephremidze, Lasha
2010-01-01
A very simple and short proof of the polynomial matrix spectral factorization theorem (on the unit circle as well as on the real line) is presented, which relies on elementary complex analysis and linear algebra.
Matrix factorizations and homological mirror symmetry on the torus
International Nuclear Information System (INIS)
Knapp, Johanna; Omer, Harun
2007-01-01
We consider matrix factorizations and homological mirror symmetry on the torus T 2 using a Landau-Ginzburg description. We identify the basic matrix factorizations of the Landau-Ginzburg superpotential and compute the full spectrum taking into account the explicit dependence on bulk and boundary moduli. We verify homological mirror symmetry by comparing three-point functions in the A-model and the B-model
Strong factor in the SO(2,3) S matrix
International Nuclear Information System (INIS)
Amado, R.D.; Sparrow, D.A.
1986-01-01
The group theoretic S matrix of Alhassid, Iachello, and Wu is factorable into a product of Coulomb and strong factors. The strong factor is examined with a view to relating it to more fa- miliar potential and phase shift descriptions. We find simple approximate expressions for the phase shifts which are very accurate for heavy-ion-type applications. For peripheral scattering it is possible to obtain simple expressions relating the strong factor to an effective potential
Data fusion in metabolomics using coupled matrix and tensor factorizations
DEFF Research Database (Denmark)
Evrim, Acar Ataman; Bro, Rasmus; Smilde, Age Klaas
2015-01-01
of heterogeneous (i.e., in the form of higher order tensors and matrices) data sets with shared/unshared factors. In order to jointly analyze such heterogeneous data sets, we formulate data fusion as a coupled matrix and tensor factorization (CMTF) problem, which has already proved useful in many data mining...
Directory of Open Access Journals (Sweden)
Seyed Sina Sebtahmadi
2016-11-01
Full Text Available A rotational d-q current control scheme based on a Particle Swarm Optimization- Proportional-Integral (PSO-PI controller, is used to drive an induction motor (IM through an Ultra Sparse Z-source Matrix Converter (USZSMC. To minimize the overall size of the system, the lowest feasible values of Z-source elements are calculated by considering the both timing and aspects of the circuit. A meta-heuristic method is integrated to the control system in order to find optimal coefficient values in a single multimodal problem. Henceforth, the effect of all coefficients in minimizing the total harmonic distortion (THD and balancing the stator current are considered simultaneously. Through changing the reference point of magnitude or frequency, the modulation index can be automatically adjusted and respond to changes without heavy computational cost. The focus of this research is on a reliable and lightweight system with low computational resources. The proposed scheme is validated through both simulation and experimental results.
Dictionary Learning Based on Nonnegative Matrix Factorization Using Parallel Coordinate Descent
Directory of Open Access Journals (Sweden)
Zunyi Tang
2013-01-01
Full Text Available Sparse representation of signals via an overcomplete dictionary has recently received much attention as it has produced promising results in various applications. Since the nonnegativities of the signals and the dictionary are required in some applications, for example, multispectral data analysis, the conventional dictionary learning methods imposed simply with nonnegativity may become inapplicable. In this paper, we propose a novel method for learning a nonnegative, overcomplete dictionary for such a case. This is accomplished by posing the sparse representation of nonnegative signals as a problem of nonnegative matrix factorization (NMF with a sparsity constraint. By employing the coordinate descent strategy for optimization and extending it to multivariable case for processing in parallel, we develop a so-called parallel coordinate descent dictionary learning (PCDDL algorithm, which is structured by iteratively solving the two optimal problems, the learning process of the dictionary and the estimating process of the coefficients for constructing the signals. Numerical experiments demonstrate that the proposed algorithm performs better than the conventional nonnegative K-SVD (NN-KSVD algorithm and several other algorithms for comparison. What is more, its computational consumption is remarkably lower than that of the compared algorithms.
Wang, Hua; Huang, Heng; Ding, Chris; Nie, Feiping
2013-04-01
Protein interactions are central to all the biological processes and structural scaffolds in living organisms, because they orchestrate a number of cellular processes such as metabolic pathways and immunological recognition. Several high-throughput methods, for example, yeast two-hybrid system and mass spectrometry method, can help determine protein interactions, which, however, suffer from high false-positive rates. Moreover, many protein interactions predicted by one method are not supported by another. Therefore, computational methods are necessary and crucial to complete the interactome expeditiously. In this work, we formulate the problem of predicting protein interactions from a new mathematical perspective--sparse matrix completion, and propose a novel nonnegative matrix factorization (NMF)-based matrix completion approach to predict new protein interactions from existing protein interaction networks. Through using manifold regularization, we further develop our method to integrate different biological data sources, such as protein sequences, gene expressions, protein structure information, etc. Extensive experimental results on four species, Saccharomyces cerevisiae, Drosophila melanogaster, Homo sapiens, and Caenorhabditis elegans, have shown that our new methods outperform related state-of-the-art protein interaction prediction methods.
Estimating Depolarization with the Jones Matrix Quality Factor
Hilfiker, James N.; Hale, Jeffrey S.; Herzinger, Craig M.; Tiwald, Tom; Hong, Nina; Schöche, Stefan; Arwin, Hans
2017-11-01
Mueller matrix (MM) measurements offer the ability to quantify the depolarization capability of a sample. Depolarization can be estimated using terms such as the depolarization index or the average degree of polarization. However, these calculations require measurement of the complete MM. We propose an alternate depolarization metric, termed the Jones matrix quality factor, QJM, which does not require the complete MM. This metric provides a measure of how close, in a least-squares sense, a Jones matrix can be found to the measured Mueller matrix. We demonstrate and compare the use of QJM to other traditional calculations of depolarization for both isotropic and anisotropic depolarizing samples; including non-uniform coatings, anisotropic crystal substrates, and beetle cuticles that exhibit both depolarization and circular diattenuation.
Implicit vs. Explicit Trust in Social Matrix Factorization
Fazeli, Soude; Loni, Babak; Bellogin, Alejandro; Drachsler, Hendrik; Sloep, Peter
2014-01-01
Incorporating social trust in Matrix Factorization (MF) methods demonstrably improves accuracy of rating prediction. Such approaches mainly use the trust scores explicitly expressed by users. However, it is often challenging to have users provide explicit trust scores of each other. There exist
An integrating factor matrix method to find first integrals
International Nuclear Information System (INIS)
Saputra, K V I; Quispel, G R W; Van Veen, L
2010-01-01
In this paper we develop an integrating factor matrix method to derive conditions for the existence of first integrals. We use this novel method to obtain first integrals, along with the conditions for their existence, for two- and three-dimensional Lotka-Volterra systems with constant terms. The results are compared to previous results obtained by other methods.
Extracellular matrix organization modulates fibroblast growth and growth factor responsiveness.
Nakagawa, S; Pawelek, P; Grinnell, F
1989-06-01
To learn more about the relationship between extracellular matrix organization, cell shape, and cell growth control, we studied DNA synthesis by fibroblasts in collagen gels that were either attached to culture dishes or floating in culture medium during gel contraction. After 4 days of contraction, the collagen density (initially 1.5 mg/ml) reached 22 mg/ml in attached gels and 55 mg/ml in floating gels. After contraction, attached collagen gels were well organized; collagen fibrils were aligned in the plane of cell spreading; and fibroblasts had an elongated, bipolar morphology. Floating collagen gels, however, were unorganized; collagen fibrils were arranged randomly; and fibroblasts had a stellate morphology. DNA synthesis by fibroblasts in contracted collagen gels was suppressed if the gels were floating in medium but not if the gels were attached, and inhibition was independent of the extent of gel contraction. Therefore, growth of fibroblasts in contracted collagen gels could be regulated by differences in extracellular matrix organization and cell shape independently of extracellular matrix density. We also compared the responses of fibroblasts in contracted collagen gels and monolayer culture to peptide growth factors including fibroblast growth factor, platelet-derived growth factor, transforming growth factor-beta, and interleukin 1. Cells in floating collagen gels were generally unresponsive to any of the growth factors. Cells in attached collagen gels and monolayer culture were affected similarly by fibroblast growth factor but not by the others. Our results indicate that extracellular matrix organization influenced not only cell growth, but also fibroblast responsiveness to peptide growth factors.
Calabi-Yau structures on categories of matrix factorizations
Shklyarov, Dmytro
2017-09-01
Using tools of complex geometry, we construct explicit proper Calabi-Yau structures, that is, non-degenerate cyclic cocycles on differential graded categories of matrix factorizations of regular functions with isolated critical points. The formulas involve the Kapustin-Li trace and its higher corrections. From the physics perspective, our result yields explicit 'off-shell' models for categories of topological D-branes in B-twisted Landau-Ginzburg models.
Multiple Kernel Learning for adaptive graph regularized nonnegative matrix factorization
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.
Technique detection software for Sparse Matrices
Directory of Open Access Journals (Sweden)
KHAN Muhammad Taimoor
2009-12-01
Full Text Available Sparse storage formats are techniques for storing and processing the sparse matrix data efficiently. The performance of these storage formats depend upon the distribution of non-zeros, within the matrix in different dimensions. In order to have better results we need a technique that suits best the organization of data in a particular matrix. So the decision of selecting a better technique is the main step towards improving the system's results otherwise the efficiency can be decreased. The purpose of this research is to help identify the best storage format in case of reduced storage size and high processing efficiency for a sparse matrix.
Metal matrix composites: History, status, factors and future
Cyriac, Ajith James
The history, status, and future of metal matrix composites are presented by evaluating the progression of available literature through time. The trends that existed and issues that still prevail are discussed and a prediction of the future for MMCs is presented. The factors that govern the performance of metal matrix composites are also discussed. In many developed countries and in several developing countries there exists continued interest in MMCs. Researchers tried numerous combinations of matrices and reinforcements since work strictly on MMCs began in the 1950s. This led to developments for aerospace and defense applications, but resultant commercial applications were limited. The introduction of ceramic whiskers as reinforcement and the development of 'in-situ' eutectics in the 1960s aided high temperature applications in aircraft engines. In the late 1970s the automobile industries started to take MMCs seriously. In the last 20 years, MMCs evolved from laboratories to a class of materials with numerous applications and commercial markets. After the collapse of the Berlin Wall, prevailing order in the world changed drastically. This effect was evident in the progression of metal matrix composites. The internet connected the world like never before and tremendous information was available for researchers around the world. Globalization and the internet resulted in the transformation of the world to a more level playing field, and this effect is evident in the nature and source of research on metal matrix composites happening around the world.
Siren, J; Ovaskainen, O; Merilä, J
2017-10-01
The genetic variance-covariance matrix (G) is a quantity of central importance in evolutionary biology due to its influence on the rate and direction of multivariate evolution. However, the predictive power of empirically estimated G-matrices is limited for two reasons. First, phenotypes are high-dimensional, whereas traditional statistical methods are tuned to estimate and analyse low-dimensional matrices. Second, the stability of G to environmental effects and over time remains poorly understood. Using Bayesian sparse factor analysis (BSFG) designed to estimate high-dimensional G-matrices, we analysed levels variation and covariation in 10,527 expressed genes in a large (n = 563) half-sib breeding design of three-spined sticklebacks subject to two temperature treatments. We found significant differences in the structure of G between the treatments: heritabilities and evolvabilities were higher in the warm than in the low-temperature treatment, suggesting more and faster opportunity to evolve in warm (stressful) conditions. Furthermore, comparison of G and its phenotypic equivalent P revealed the latter is a poor substitute of the former. Most strikingly, the results suggest that the expected impact of G on evolvability-as well as the similarity among G-matrices-may depend strongly on the number of traits included into analyses. In our results, the inclusion of only few traits in the analyses leads to underestimation in the differences between the G-matrices and their predicted impacts on evolution. While the results highlight the challenges involved in estimating G, they also illustrate that by enabling the estimation of large G-matrices, the BSFG method can improve predicted evolutionary responses to selection. © 2017 John Wiley & Sons Ltd.
A flexible R package for nonnegative matrix factorization
Directory of Open Access Journals (Sweden)
Seoighe Cathal
2010-07-01
Full Text Available Abstract Background Nonnegative Matrix Factorization (NMF is an unsupervised learning technique that has been applied successfully in several fields, including signal processing, face recognition and text mining. Recent applications of NMF in bioinformatics have demonstrated its ability to extract meaningful information from high-dimensional data such as gene expression microarrays. Developments in NMF theory and applications have resulted in a variety of algorithms and methods. However, most NMF implementations have been on commercial platforms, while those that are freely available typically require programming skills. This limits their use by the wider research community. Results Our objective is to provide the bioinformatics community with an open-source, easy-to-use and unified interface to standard NMF algorithms, as well as with a simple framework to help implement and test new NMF methods. For that purpose, we have developed a package for the R/BioConductor platform. The package ports public code to R, and is structured to enable users to easily modify and/or add algorithms. It includes a number of published NMF algorithms and initialization methods and facilitates the combination of these to produce new NMF strategies. Commonly used benchmark data and visualization methods are provided to help in the comparison and interpretation of the results. Conclusions The NMF package helps realize the potential of Nonnegative Matrix Factorization, especially in bioinformatics, providing easy access to methods that have already yielded new insights in many applications. Documentation, source code and sample data are available from CRAN.
Contribution of non-negative matrix factorization to the classification of remote sensing images
Karoui, M. S.; Deville, Y.; Hosseini, S.; Ouamri, A.; Ducrot, D.
2008-10-01
Remote sensing has become an unavoidable tool for better managing our environment, generally by realizing maps of land cover using classification techniques. The classification process requires some pre-processing, especially for data size reduction. The most usual technique is Principal Component Analysis. Another approach consists in regarding each pixel of the multispectral image as a mixture of pure elements contained in the observed area. Using Blind Source Separation (BSS) methods, one can hope to unmix each pixel and to perform the recognition of the classes constituting the observed scene. Our contribution consists in using Non-negative Matrix Factorization (NMF) combined with sparse coding as a solution to BSS, in order to generate new images (which are at least partly separated images) using HRV SPOT images from Oran area, Algeria). These images are then used as inputs of a supervised classifier integrating textural information. The results of classifications of these "separated" images show a clear improvement (correct pixel classification rate improved by more than 20%) compared to classification of initial (i.e. non separated) images. These results show the contribution of NMF as an attractive pre-processing for classification of multispectral remote sensing imagery.
Supervised Transfer Sparse Coding
Al-Shedivat, Maruan
2014-07-27
A combination of the sparse coding and transfer learn- ing techniques was shown to be accurate and robust in classification tasks where training and testing objects have a shared feature space but are sampled from differ- ent underlying distributions, i.e., belong to different do- mains. The key assumption in such case is that in spite of the domain disparity, samples from different domains share some common hidden factors. Previous methods often assumed that all the objects in the target domain are unlabeled, and thus the training set solely comprised objects from the source domain. However, in real world applications, the target domain often has some labeled objects, or one can always manually label a small num- ber of them. In this paper, we explore such possibil- ity and show how a small number of labeled data in the target domain can significantly leverage classifica- tion accuracy of the state-of-the-art transfer sparse cod- ing methods. We further propose a unified framework named supervised transfer sparse coding (STSC) which simultaneously optimizes sparse representation, domain transfer and classification. Experimental results on three applications demonstrate that a little manual labeling and then learning the model in a supervised fashion can significantly improve classification accuracy.
Factors associated with continuance commitment to FAA matrix teams.
1993-11-01
Several organizations within the FAA employ matrix teams to achieve cross-functional coordination. Matrix team members typically represent different organizational functions required for project accomplishment (e.g., research and development, enginee...
Symmetric nonnegative matrix factorization: algorithms and applications to probabilistic clustering.
He, Zhaoshui; Xie, Shengli; Zdunek, Rafal; Zhou, Guoxu; Cichocki, Andrzej
2011-12-01
Nonnegative matrix factorization (NMF) is an unsupervised learning method useful in various applications including image processing and semantic analysis of documents. This paper focuses on symmetric NMF (SNMF), which is a special case of NMF decomposition. Three parallel multiplicative update algorithms using level 3 basic linear algebra subprograms directly are developed for this problem. First, by minimizing the Euclidean distance, a multiplicative update algorithm is proposed, and its convergence under mild conditions is proved. Based on it, we further propose another two fast parallel methods: α-SNMF and β -SNMF algorithms. All of them are easy to implement. These algorithms are applied to probabilistic clustering. We demonstrate their effectiveness for facial image clustering, document categorization, and pattern clustering in gene expression.
Efficient multitasking of Choleski matrix factorization on CRAY supercomputers
Overman, Andrea L.; Poole, Eugene L.
1991-01-01
A Choleski method is described and used to solve linear systems of equations that arise in large scale structural analysis. The method uses a novel variable-band storage scheme and is structured to exploit fast local memory caches while minimizing data access delays between main memory and vector registers. Several parallel implementations of this method are described for the CRAY-2 and CRAY Y-MP computers demonstrating the use of microtasking and autotasking directives. A portable parallel language, FORCE, is used for comparison with the microtasked and autotasked implementations. Results are presented comparing the matrix factorization times for three representative structural analysis problems from runs made in both dedicated and multi-user modes on both computers. CPU and wall clock timings are given for the parallel implementations and are compared to single processor timings of the same algorithm.
SHMF: Interest Prediction Model with Social Hub Matrix Factorization
Directory of Open Access Journals (Sweden)
Chaoyuan Cui
2017-01-01
Full Text Available With the development of social networks, microblog has become the major social communication tool. There is a lot of valuable information such as personal preference, public opinion, and marketing in microblog. Consequently, research on user interest prediction in microblog has a positive practical significance. In fact, how to extract information associated with user interest orientation from the constantly updated blog posts is not so easy. Existing prediction approaches based on probabilistic factor analysis use blog posts published by user to predict user interest. However, these methods are not very effective for the users who post less but browse more. In this paper, we propose a new prediction model, which is called SHMF, using social hub matrix factorization. SHMF constructs the interest prediction model by combining the information of blogs posts published by both user and direct neighbors in user’s social hub. Our proposed model predicts user interest by integrating user’s historical behavior and temporal factor as well as user’s friendships, thus achieving accurate forecasts of user’s future interests. The experimental results on Sina Weibo show the efficiency and effectiveness of our proposed model.
Multiplicative algorithms for constrained non-negative matrix factorization
Peng, Chengbin
2012-12-01
Non-negative matrix factorization (NMF) provides the advantage of parts-based data representation through additive only combinations. It has been widely adopted in areas like item recommending, text mining, data clustering, speech denoising, etc. In this paper, we provide an algorithm that allows the factorization to have linear or approximatly linear constraints with respect to each factor. We prove that if the constraint function is linear, algorithms within our multiplicative framework will converge. This theory supports a large variety of equality and inequality constraints, and can facilitate application of NMF to a much larger domain. Taking the recommender system as an example, we demonstrate how a specialized weighted and constrained NMF algorithm can be developed to fit exactly for the problem, and the tests justify that our constraints improve the performance for both weighted and unweighted NMF algorithms under several different metrics. In particular, on the Movielens data with 94% of items, the Constrained NMF improves recall rate 3% compared to SVD50 and 45% compared to SVD150, which were reported as the best two in the top-N metric. © 2012 IEEE.
Sparse PCA with Oracle Property.
Gu, Quanquan; Wang, Zhaoran; Liu, Han
In this paper, we study the estimation of the k -dimensional sparse principal subspace of covariance matrix Σ in the high-dimensional setting. We aim to recover the oracle principal subspace solution, i.e., the principal subspace estimator obtained assuming the true support is known a priori. To this end, we propose a family of estimators based on the semidefinite relaxation of sparse PCA with novel regularizations. In particular, under a weak assumption on the magnitude of the population projection matrix, one estimator within this family exactly recovers the true support with high probability, has exact rank- k , and attains a [Formula: see text] statistical rate of convergence with s being the subspace sparsity level and n the sample size. Compared to existing support recovery results for sparse PCA, our approach does not hinge on the spiked covariance model or the limited correlation condition. As a complement to the first estimator that enjoys the oracle property, we prove that, another estimator within the family achieves a sharper statistical rate of convergence than the standard semidefinite relaxation of sparse PCA, even when the previous assumption on the magnitude of the projection matrix is violated. We validate the theoretical results by numerical experiments on synthetic datasets.
Drug-Target Interaction Prediction with Graph Regularized Matrix Factorization.
Ezzat, Ali; Zhao, Peilin; Wu, Min; Li, Xiao-Li; Kwoh, Chee-Keong
2017-01-01
Experimental determination of drug-target interactions is expensive and time-consuming. Therefore, there is a continuous demand for more accurate predictions of interactions using computational techniques. Algorithms have been devised to infer novel interactions on a global scale where the input to these algorithms is a drug-target network (i.e., a bipartite graph where edges connect pairs of drugs and targets that are known to interact). However, these algorithms had difficulty predicting interactions involving new drugs or targets for which there are no known interactions (i.e., "orphan" nodes in the network). Since data usually lie on or near to low-dimensional non-linear manifolds, we propose two matrix factorization methods that use graph regularization in order to learn such manifolds. In addition, considering that many of the non-occurring edges in the network are actually unknown or missing cases, we developed a preprocessing step to enhance predictions in the "new drug" and "new target" cases by adding edges with intermediate interaction likelihood scores. In our cross validation experiments, our methods achieved better results than three other state-of-the-art methods in most cases. Finally, we simulated some "new drug" and "new target" cases and found that GRMF predicted the left-out interactions reasonably well.
Data Reduction Algorithm Using Nonnegative Matrix Factorization with Nonlinear Constraints
Sembiring, Pasukat
2017-12-01
Processing ofdata with very large dimensions has been a hot topic in recent decades. Various techniques have been proposed in order to execute the desired information or structure. Non- Negative Matrix Factorization (NMF) based on non-negatives data has become one of the popular methods for shrinking dimensions. The main strength of this method is non-negative object, the object model by a combination of some basic non-negative parts, so as to provide a physical interpretation of the object construction. The NMF is a dimension reduction method thathasbeen used widely for numerous applications including computer vision,text mining, pattern recognitions,and bioinformatics. Mathematical formulation for NMF did not appear as a convex optimization problem and various types of algorithms have been proposed to solve the problem. The Framework of Alternative Nonnegative Least Square(ANLS) are the coordinates of the block formulation approaches that have been proven reliable theoretically and empirically efficient. This paper proposes a new algorithm to solve NMF problem based on the framework of ANLS.This algorithm inherits the convergenceproperty of the ANLS framework to nonlinear constraints NMF formulations.
Z4-symmetric factorized S-matrix in two space-time dimensions
International Nuclear Information System (INIS)
Zamolodchikov, A.B.
1979-01-01
The factorized S-matrix with internal symmetry Z 4 is constructed in two space-time dimensions. The two-particle amplitudes are obtained by means of solving the factorization, unitarity and analyticity equations. The solution of factorization equations can be expressed in terms of elliptic functions. The S-matrix cotains the resonance poles naturally. The simple formal relation between the general factorized S-matrices and the Baxter-type lattice transfer matrices is found. In the sense of this relation the Z 4 -symmetric S-matrix corresponds to the Baxter transfer matrix itself. (orig.)
Yoon, Junghyo; Korkmaz Zirpel, Nuriye; Park, Hyun-Ji; Han, Sewoon; Hwang, Kyung Hoon; Shin, Jisoo; Cho, Seung-Woo; Nam, Chang-Hoon; Chung, Seok
2016-01-21
Here, a growth-factor-integrated natural extracellular matrix of type I collagen is presented that induces angiogenesis. The developed matrix adapts type I collagen nanofibers integrated with synthetic colloidal particles of recombinant bacteriophages that display vascular endothelial growth factor (VEGF). The integration is achieved during or after gelation of the type I collagen and the matrix enables spatial delivery of VEGF into a desired region. Endothelial cells that contact the VEGF are found to invade into the matrix to form tube-like structures both in vitro and in vivo, proving the angiogenic potential of the matrix. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Manifold regularized discriminative nonnegative matrix factorization with fast gradient descent.
Guan, Naiyang; Tao, Dacheng; Luo, Zhigang; Yuan, Bo
2011-07-01
Nonnegative matrix factorization (NMF) has become a popular data-representation method and has been widely used in image processing and pattern-recognition problems. This is because the learned bases can be interpreted as a natural parts-based representation of data and this interpretation is consistent with the psychological intuition of combining parts to form a whole. For practical classification tasks, however, NMF ignores both the local geometry of data and the discriminative information of different classes. In addition, existing research results show that the learned basis is unnecessarily parts-based because there is neither explicit nor implicit constraint to ensure the representation parts-based. In this paper, we introduce the manifold regularization and the margin maximization to NMF and obtain the manifold regularized discriminative NMF (MD-NMF) to overcome the aforementioned problems. The multiplicative update rule (MUR) can be applied to optimizing MD-NMF, but it converges slowly. In this paper, we propose a fast gradient descent (FGD) to optimize MD-NMF. FGD contains a Newton method that searches the optimal step length, and thus, FGD converges much faster than MUR. In addition, FGD includes MUR as a special case and can be applied to optimizing NMF and its variants. For a problem with 165 samples in R(1600), FGD converges in 28 s, while MUR requires 282 s. We also apply FGD in a variant of MD-NMF and experimental results confirm its efficiency. Experimental results on several face image datasets suggest the effectiveness of MD-NMF.
Multi-view clustering via multi-manifold regularized non-negative matrix factorization.
Zong, Linlin; Zhang, Xianchao; Zhao, Long; Yu, Hong; Zhao, Qianli
2017-04-01
Non-negative matrix factorization based multi-view clustering algorithms have shown their competitiveness among different multi-view clustering algorithms. However, non-negative matrix factorization fails to preserve the locally geometrical structure of the data space. In this paper, we propose a multi-manifold regularized non-negative matrix factorization framework (MMNMF) which can preserve the locally geometrical structure of the manifolds for multi-view clustering. MMNMF incorporates consensus manifold and consensus coefficient matrix with multi-manifold regularization to preserve the locally geometrical structure of the multi-view data space. We use two methods to construct the consensus manifold and two methods to find the consensus coefficient matrix, which leads to four instances of the framework. Experimental results show that the proposed algorithms outperform existing non-negative matrix factorization based algorithms for multi-view clustering. Copyright © 2017 Elsevier Ltd. All rights reserved.
Directory of Open Access Journals (Sweden)
Philip Wong
Full Text Available Accurate reconstruction of 3D photoacoustic (PA images requires detection of photoacoustic signals from many angles. Several groups have adopted staring ultrasound arrays, but assessment of array performance has been limited. We previously reported on a method to calibrate a 3D PA tomography (PAT staring array system and analyze system performance using singular value decomposition (SVD. The developed SVD metric, however, was impractical for large system matrices, which are typical of 3D PAT problems. The present study consisted of two main objectives. The first objective aimed to introduce the crosstalk matrix concept to the field of PAT for system design. Figures-of-merit utilized in this study were root mean square error, peak signal-to-noise ratio, mean absolute error, and a three dimensional structural similarity index, which were derived between the normalized spatial crosstalk matrix and the identity matrix. The applicability of this approach for 3D PAT was validated by observing the response of the figures-of-merit in relation to well-understood PAT sampling characteristics (i.e. spatial and temporal sampling rate. The second objective aimed to utilize the figures-of-merit to characterize and improve the performance of a near-spherical staring array design. Transducer arrangement, array radius, and array angular coverage were the design parameters examined. We observed that the performance of a 129-element staring transducer array for 3D PAT could be improved by selection of optimal values of the design parameters. The results suggested that this formulation could be used to objectively characterize 3D PAT system performance and would enable the development of efficient strategies for system design optimization.
Form factors in quantum integrable models with GL(3)-invariant R-matrix
Energy Technology Data Exchange (ETDEWEB)
Pakuliak, S., E-mail: pakuliak@theor.jinr.ru [Laboratory of Theoretical Physics, JINR, 141980 Dubna, Moscow Reg. (Russian Federation); Moscow Institute of Physics and Technology, 141700 Dolgoprudny, Moscow Reg. (Russian Federation); Institute of Theoretical and Experimental Physics, 117259 Moscow (Russian Federation); Ragoucy, E., E-mail: eric.ragoucy@lapth.cnrs.fr [Laboratoire de Physique Théorique LAPTH, CNRS and Université de Savoie, BP 110, 74941 Annecy-le-Vieux Cedex (France); Slavnov, N.A., E-mail: nslavnov@mi.ras.ru [Steklov Mathematical Institute, Moscow (Russian Federation)
2014-04-15
We study integrable models solvable by the nested algebraic Bethe ansatz and possessing GL(3)-invariant R-matrix. We obtain determinant representations for form factors of off-diagonal entries of the monodromy matrix. These representations can be used for the calculation of form factors and correlation functions of the XXX SU(3)-invariant Heisenberg chain.
Sparse structure regularized ranking
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
Color normalization of histology slides using graph regularized sparse NMF
Sha, Lingdao; Schonfeld, Dan; Sethi, Amit
2017-03-01
Computer based automatic medical image processing and quantification are becoming popular in digital pathology. However, preparation of histology slides can vary widely due to differences in staining equipment, procedures and reagents, which can reduce the accuracy of algorithms that analyze their color and texture information. To re- duce the unwanted color variations, various supervised and unsupervised color normalization methods have been proposed. Compared with supervised color normalization methods, unsupervised color normalization methods have advantages of time and cost efficient and universal applicability. Most of the unsupervised color normaliza- tion methods for histology are based on stain separation. Based on the fact that stain concentration cannot be negative and different parts of the tissue absorb different stains, nonnegative matrix factorization (NMF), and particular its sparse version (SNMF), are good candidates for stain separation. However, most of the existing unsupervised color normalization method like PCA, ICA, NMF and SNMF fail to consider important information about sparse manifolds that its pixels occupy, which could potentially result in loss of texture information during color normalization. Manifold learning methods like Graph Laplacian have proven to be very effective in interpreting high-dimensional data. In this paper, we propose a novel unsupervised stain separation method called graph regularized sparse nonnegative matrix factorization (GSNMF). By considering the sparse prior of stain concentration together with manifold information from high-dimensional image data, our method shows better performance in stain color deconvolution than existing unsupervised color deconvolution methods, especially in keeping connected texture information. To utilized the texture information, we construct a nearest neighbor graph between pixels within a spatial area of an image based on their distances using heat kernal in lαβ space. The
Non-negative matrix factorization in texture feature for classification of dementia with MRI data
Sarwinda, D.; Bustamam, A.; Ardaneswari, G.
2017-07-01
This paper investigates applications of non-negative matrix factorization as feature selection method to select the features from gray level co-occurrence matrix. The proposed approach is used to classify dementia using MRI data. In this study, texture analysis using gray level co-occurrence matrix is done to feature extraction. In the feature extraction process of MRI data, we found seven features from gray level co-occurrence matrix. Non-negative matrix factorization selected three features that influence of all features produced by feature extractions. A Naïve Bayes classifier is adapted to classify dementia, i.e. Alzheimer's disease, Mild Cognitive Impairment (MCI) and normal control. The experimental results show that non-negative factorization as feature selection method able to achieve an accuracy of 96.4% for classification of Alzheimer's and normal control. The proposed method also compared with other features selection methods i.e. Principal Component Analysis (PCA).
SLAP, Large Sparse Linear System Solution Package
International Nuclear Information System (INIS)
Greenbaum, A.
1987-01-01
1 - Description of program or function: SLAP is a set of routines for solving large sparse systems of linear equations. One need not store the entire matrix - only the nonzero elements and their row and column numbers. Any nonzero structure is acceptable, so the linear system solver need not be modified when the structure of the matrix changes. Auxiliary storage space is acquired and released within the routines themselves by use of the LRLTRAN POINTER statement. 2 - Method of solution: SLAP contains one direct solver, a band matrix factorization and solution routine, BAND, and several interactive solvers. The iterative routines are as follows: JACOBI, Jacobi iteration; GS, Gauss-Seidel Iteration; ILUIR, incomplete LU decomposition with iterative refinement; DSCG and ICCG, diagonal scaling and incomplete Cholesky decomposition with conjugate gradient iteration (for symmetric positive definite matrices only); DSCGN and ILUGGN, diagonal scaling and incomplete LU decomposition with conjugate gradient interaction on the normal equations; DSBCG and ILUBCG, diagonal scaling and incomplete LU decomposition with bi-conjugate gradient iteration; and DSOMN and ILUOMN, diagonal scaling and incomplete LU decomposition with ORTHOMIN iteration
Semi-Supervised Half-Quadratic Nonnegative Matrix Factorization for Face Recognition
Alghamdi, Masheal M.
2014-01-01
complications to the face recognition research. Many algorithms are devoted to solving the face recognition problem, among which the family of nonnegative matrix factorization (NMF) algorithms has been widely used as a compact data representation method
DEFF Research Database (Denmark)
Møller, Martin Nue; Werther, Kim; Nalla, Amarnadh
2010-01-01
Vascular endothelial growth factor (VEGF) and matrix metalloproteinases (MMPs) are potent mediators of tumor angiogenesis. It has been demonstrated that vestibular schwannoma VEGF expression correlates with tumor growth pattern, whereas knowledge on the expression of MMPs is lacking. This study...
On the Road to Genetic Boolean Matrix Factorization
Czech Academy of Sciences Publication Activity Database
Snášel, V.; Platoš, J.; Krömer, P.; Húsek, Dušan; Frolov, A.
2007-01-01
Roč. 17, č. 6 (2007), s. 675-688 ISSN 1210-0552 Institutional research plan: CEZ:AV0Z10300504 Keywords : data mining * genetic algorithms * Boolean factorization * binary data * machine learning * feature extraction Subject RIV: IN - Informatics, Computer Science Impact factor: 0.280, year: 2007
A Spectral Algorithm for Envelope Reduction of Sparse Matrices
Barnard, Stephen T.; Pothen, Alex; Simon, Horst D.
1993-01-01
The problem of reordering a sparse symmetric matrix to reduce its envelope size is considered. A new spectral algorithm for computing an envelope-reducing reordering is obtained by associating a Laplacian matrix with the given matrix and then sorting the components of a specified eigenvector of the Laplacian. This Laplacian eigenvector solves a continuous relaxation of a discrete problem related to envelope minimization called the minimum 2-sum problem. The permutation vector computed by the spectral algorithm is a closest permutation vector to the specified Laplacian eigenvector. Numerical results show that the new reordering algorithm usually computes smaller envelope sizes than those obtained from the current standard algorithms such as Gibbs-Poole-Stockmeyer (GPS) or SPARSPAK reverse Cuthill-McKee (RCM), in some cases reducing the envelope by more than a factor of two.
Calculation of the Cholesky factor directly from the stiffness matrix of the structural element
International Nuclear Information System (INIS)
Prates, C.L.M.; Soriano, H.L.
1978-01-01
The analysis of the structures of nuclear power plants requires the evaluation of the internal forces. This is attained by the solution of a system of equations. This solution takes most of the computing time and memory. One of the ways it can be achieved is based on the Cholesky factor. The structural matrix of the coeficients is transformed into an upper triangular matrix by the Cholesky decomposition. Cholesky factor can be obtained directly from the stiffness matrix of the structural element. The result can thus be obtained in a more precise and quick way. (Author)
Space Vector Modulation for an Indirect Matrix Converter with Improved Input Power Factor
Directory of Open Access Journals (Sweden)
Nguyen Dinh Tuyen
2017-04-01
Full Text Available Pulse width modulation strategies have been developed for indirect matrix converters (IMCs in order to improve their performance. In indirect matrix converters, the LC input filter is used to remove input current harmonics and electromagnetic interference problems. Unfortunately, due to the existence of the input filter, the input power factor is diminished, especially during operation at low voltage outputs. In this paper, a new space vector modulation (SVM is proposed to compensate for the input power factor of the indirect matrix converter. Both computer simulation and experimental studies through hardware implementation were performed to verify the effectiveness of the proposed modulation strategy.
International Nuclear Information System (INIS)
Tanaka, Yuho; Uruma, Kazunori; Furukawa, Toshihiro; Nakao, Tomoki; Izumi, Kenya; Utsumi, Hiroaki
2017-01-01
This paper deals with an analysis problem for diffusion-ordered NMR spectroscopy (DOSY). DOSY is formulated as a matrix factorization problem of a given observed matrix. In order to solve this problem, a direct exponential curve resolution algorithm (DECRA) is well known. DECRA is based on singular value decomposition; the advantage of this algorithm is that the initial value is not required. However, DECRA requires a long calculating time, depending on the size of the given observed matrix due to the singular value decomposition, and this is a serious problem in practical use. Thus, this paper proposes a new analysis algorithm for DOSY to achieve a short calculating time. In order to solve matrix factorization for DOSY without using singular value decomposition, this paper focuses on the size of the given observed matrix. The observed matrix in DOSY is also a rectangular matrix with more columns than rows, due to limitation of the measuring time; thus, the proposed algorithm transforms the given observed matrix into a small observed matrix. The proposed algorithm applies the eigenvalue decomposition and the difference approximation to the small observed matrix, and the matrix factorization problem for DOSY is solved. The simulation and a data analysis show that the proposed algorithm achieves a lower calculating time than DECRA as well as similar analysis result results to DECRA. (author)
Biclustering via Sparse Singular Value Decomposition
Lee, Mihee
2010-02-16
Sparse singular value decomposition (SSVD) is proposed as a new exploratory analysis tool for biclustering or identifying interpretable row-column associations within high-dimensional data matrices. SSVD seeks a low-rank, checkerboard structured matrix approximation to data matrices. The desired checkerboard structure is achieved by forcing both the left- and right-singular vectors to be sparse, that is, having many zero entries. By interpreting singular vectors as regression coefficient vectors for certain linear regressions, sparsity-inducing regularization penalties are imposed to the least squares regression to produce sparse singular vectors. An efficient iterative algorithm is proposed for computing the sparse singular vectors, along with some discussion of penalty parameter selection. A lung cancer microarray dataset and a food nutrition dataset are used to illustrate SSVD as a biclustering method. SSVD is also compared with some existing biclustering methods using simulated datasets. © 2010, The International Biometric Society.
Permuting sparse rectangular matrices into block-diagonal form
Energy Technology Data Exchange (ETDEWEB)
Aykanat, Cevdet; Pinar, Ali; Catalyurek, Umit V.
2002-12-09
This work investigates the problem of permuting a sparse rectangular matrix into block diagonal form. Block diagonal form of a matrix grants an inherent parallelism for the solution of the deriving problem, as recently investigated in the context of mathematical programming, LU factorization and QR factorization. We propose graph and hypergraph models to represent the nonzero structure of a matrix, which reduce the permutation problem to those of graph partitioning by vertex separator and hypergraph partitioning, respectively. Besides proposing the models to represent sparse matrices and investigating related combinatorial problems, we provide a detailed survey of relevant literature to bridge the gap between different societies, investigate existing techniques for partitioning and propose new ones, and finally present a thorough empirical study of these techniques. Our experiments on a wide range of matrices, using state-of-the-art graph and hypergraph partitioning tools MeTiS and PaT oH, revealed that the proposed methods yield very effective solutions both in terms of solution quality and run time.
Directory of Open Access Journals (Sweden)
Qing Li
2018-04-01
Full Text Available High-speed remote transmission and large-capacity data storage are difficult issues in signals acquisition of rotating machines condition monitoring. To address these concerns, a novel multichannel signals reconstruction approach based on tunable Q-factor wavelet transform-morphological component analysis (TQWT-MCA and sparse Bayesian iteration algorithm combined with step-impulse dictionary is proposed under the frame of compressed sensing (CS. To begin with, to prevent the periodical impulses loss and effectively separate periodical impulses from the external noise and additive interference components, the TQWT-MCA method is introduced to divide the raw vibration signal into low-resonance component (LRC, i.e., periodical impulses and high-resonance component (HRC, thus, the periodical impulses are preserved effectively. Then, according to the amplitude range of generated LRC, the step-impulse dictionary atom is designed to match the physical structure of periodical impulses. Furthermore, the periodical impulses and HRC are reconstructed by the sparse Bayesian iteration combined with step-impulse dictionary, respectively, finally, the final reconstructed raw signals are obtained by adding the LRC and HRC, meanwhile, the fidelity of the final reconstructed signals is tested by the envelop spectrum and error analysis, respectively. In this work, the proposed algorithm is applied to simulated signal and engineering multichannel signals of a gearbox with multiple faults. Experimental results demonstrate that the proposed approach significantly improves the reconstructive accuracy compared with the state-of-the-art methods such as non-convex Lq (q = 0.5 regularization, spatiotemporal sparse Bayesian learning (SSBL and L1-norm, etc. Additionally, the processing time, i.e., speed of storage and transmission has increased dramatically, more importantly, the fault characteristics of the gearbox with multiple faults are detected and saved, i.e., the
Directory of Open Access Journals (Sweden)
Yudan Ren
Full Text Available Functional neuroimaging is widely used to examine changes in brain function associated with age, gender or neuropsychiatric conditions. FMRI (functional magnetic resonance imaging studies employ either laboratory-designed tasks that engage the brain with abstracted and repeated stimuli, or resting state paradigms with little behavioral constraint. Recently, novel neuroimaging paradigms using naturalistic stimuli are gaining increasing attraction, as they offer an ecologically-valid condition to approximate brain function in real life. Wider application of naturalistic paradigms in exploring individual differences in brain function, however, awaits further advances in statistical methods for modeling dynamic and complex dataset. Here, we developed a novel data-driven strategy that employs group sparse representation to assess gender differences in brain responses during naturalistic emotional experience. Comparing to independent component analysis (ICA, sparse coding algorithm considers the intrinsic sparsity of neural coding and thus could be more suitable in modeling dynamic whole-brain fMRI signals. An online dictionary learning and sparse coding algorithm was applied to the aggregated fMRI signals from both groups, which was subsequently factorized into a common time series signal dictionary matrix and the associated weight coefficient matrix. Our results demonstrate that group sparse representation can effectively identify gender differences in functional brain network during natural viewing, with improved sensitivity and reliability over ICA-based method. Group sparse representation hence offers a superior data-driven strategy for examining brain function during naturalistic conditions, with great potential for clinical application in neuropsychiatric disorders.
International Nuclear Information System (INIS)
Hiraki, Y.; Inoue, H.; Asada, A.; Suzuki, F.
1990-01-01
The growth-promoting actions of cartilage extracts (CE) on rabbit cultured chondrocytes were studied to assess the role of local acting growth factors in the generation and expansion of highly differentiated cells. In the present study, DNA synthesis and proteoglycan synthesis in the cultured chondrocytes were monitored by flow cytofluorometry and double-isotope autoradiography by using ( 3 H)thymidine and ( 35 S)sulfate. We report here that actions of the same set of growth factors extracted from cartilage evokes differential cellular responses depending upon cell density. Growth factors in the optimal dose of CE (2 micrograms/ml) or epidermal growth factor (EGF, 40 ng/ml) did not reveal such a cell density-dependent effect on cellular proliferation. However, growth factors in CE induced proteoglycan synthesis selectively in nonproliferating and expressing cells in confluent culture
Rotational image deblurring with sparse matrices
DEFF Research Database (Denmark)
Hansen, Per Christian; Nagy, James G.; Tigkos, Konstantinos
2014-01-01
We describe iterative deblurring algorithms that can handle blur caused by a rotation along an arbitrary axis (including the common case of pure rotation). Our algorithms use a sparse-matrix representation of the blurring operation, which allows us to easily handle several different boundary...
Zhang, Tianzhu
2015-06-01
Sparse representation has been applied to visual tracking by finding the best target candidate with minimal reconstruction error by use of target templates. However, most sparse representation based trackers only consider holistic or local representations and do not make full use of the intrinsic structure among and inside target candidates, thereby making the representation less effective when similar objects appear or under occlusion. In this paper, we propose a novel Structural Sparse Tracking (SST) algorithm, which not only exploits the intrinsic relationship among target candidates and their local patches to learn their sparse representations jointly, but also preserves the spatial layout structure among the local patches inside each target candidate. We show that our SST algorithm accommodates most existing sparse trackers with the respective merits. Both qualitative and quantitative evaluations on challenging benchmark image sequences demonstrate that the proposed SST algorithm performs favorably against several state-of-the-art methods.
HPC-NMF: A High-Performance Parallel Algorithm for Nonnegative Matrix Factorization
Energy Technology Data Exchange (ETDEWEB)
2016-08-22
NMF is a useful tool for many applications in different domains such as topic modeling in text mining, background separation in video analysis, and community detection in social networks. Despite its popularity in the data mining community, there is a lack of efficient distributed algorithms to solve the problem for big data sets. We propose a high-performance distributed-memory parallel algorithm that computes the factorization by iteratively solving alternating non-negative least squares (NLS) subproblems for $\\WW$ and $\\HH$. It maintains the data and factor matrices in memory (distributed across processors), uses MPI for interprocessor communication, and, in the dense case, provably minimizes communication costs (under mild assumptions). As opposed to previous implementation, our algorithm is also flexible: It performs well for both dense and sparse matrices, and allows the user to choose any one of the multiple algorithms for solving the updates to low rank factors $\\WW$ and $\\HH$ within the alternating iterations.
Nonnegative Matrix Factor 2-D Deconvolution for Blind Single Channel Source Separation
DEFF Research Database (Denmark)
Schmidt, Mikkel N.; Mørup, Morten
2006-01-01
We present a novel method for blind separation of instruments in polyphonic music based on a non-negative matrix factor 2-D deconvolution algorithm. Using a model which is convolutive in both time and frequency we factorize a spectrogram representation of music into components corresponding...
Hellweg, Christine E.; Langen, Britta; Klimow, Galina; Ruscher, Roland; Schmitz, Claudia; Baumstark-Khan, Christa; Reitz, Günther
2009-10-01
Radiation is a potentially limiting factor for manned long-term space missions. Prolonged exposure to galactic cosmic rays may shorten the healthy life-span after return to Earth due to cancer induction. During the mission, a solar flare can be life threatening. For better risk estimation and development of appropriate countermeasures, the study of the cellular radiation response is necessary. Since apoptosis may be a mechanism the body uses to eliminate damaged cells, the induction by cosmic radiation of the nuclear anti-apoptotic transcription factor nuclear factor κB (NF-κB) could influence the cancer risk of astronauts exposed to cosmic radiation by improving the survival of radiation-damaged cells. In previous studies using a screening assay for the detection of NF-κB-dependent gene induction (HEK-pNF-κB-d2EGFP/Neo cells), the activation of this transcription factor by heavy ions was shown [Baumstark-Khan, C., Hellweg, C.E., Arenz, A., Meier, M.M. Cellular monitoring of the nuclear factor kappa B pathway for assessment of space environmental radiation. Radiat. Res. 164, 527-530, 2005]. Studies with NF-κB inhibitors can map functional details of the NF-κB pathway and the influence of radiation-induced NF-κB activation on various cellular outcomes such as survival or cell cycle arrest. In this work, the efficacy and cytotoxicity of four different NF-κB inhibitors, caffeic acid phenethyl ester (CAPE), capsaicin, the proteasome inhibitor MG-132, and the cell permeable peptide NF-κB SN50 were analyzed using HEK-pNF-κB-d2EGFP/Neo cells. In the recommended concentration range, only CAPE displayed considerable cytotoxicity. CAPE and capsaicin partially inhibited NF-κB activation by the cytokine tumor necrosis factor α. MG-132 completely abolished the activation and was therefore used for experiments with X-rays. NF-κB SN-50 could not reduce NF-κB dependent expression of the reporter destabilized Enhanced Green Fluorescent Protein (d2EGFP). MG-132
International Nuclear Information System (INIS)
Chan, C.K.; Hoffman, D.K.; Evans, J.W.
1985-01-01
Local, i.e., multiplicative, operators satisfy well-known linear factorization relations wherein matrix elements (between states associated with a complete set of wave functions) can be obtained as a linear combination of those out of the ground state (the input data). Analytic derivation of factorization relations for general state input data results in singular integral expressions for the coefficients, which can, however, be regularized using consistency conditions between matrix elements out of a single (nonground) state. Similar results hold for suitable ''symmetry class'' averaged matrix elements where the symmetry class projection operators are ''complete.'' In several cases where the wave functions or projection operators incorporate orthogonal polynomial dependence, we show that the ground state factorization relations have a simplified structure allowing an alternative derivation of the general factorization relations via an infinite matrix inversion procedure. This form is shown to have some advantages over previous versions. In addition, this matrix inversion procedure obtains all consistency conditions (which is not always the case from regularization of singular integrals)
Yu, Yan; Qiu, Robin G
2014-01-01
Microblog that provides us a new communication and information sharing platform has been growing exponentially since it emerged just a few years ago. To microblog users, recommending followees who can serve as high quality information sources is a competitive service. To address this problem, in this paper we propose a matrix factorization model with structural regularization to improve the accuracy of followee recommendation in microblog. More specifically, we adapt the matrix factorization model in traditional item recommender systems to followee recommendation in microblog and use structural regularization to exploit structure information of social network to constrain matrix factorization model. The experimental analysis on a real-world dataset shows that our proposed model is promising.
Single-channel source separation using non-negative matrix factorization
DEFF Research Database (Denmark)
Schmidt, Mikkel Nørgaard
-determined and its solution relies on making appropriate assumptions concerning the sources. This dissertation is concerned with model-based probabilistic single-channel source separation based on non-negative matrix factorization, and consists of two parts: i) three introductory chapters and ii) five published...... papers. The first part introduces the single-channel source separation problem as well as non-negative matrix factorization and provides a comprehensive review of existing approaches, applications, and practical algorithms. This serves to provide context for the second part, the published papers......, in which a number of methods for single-channel source separation based on non-negative matrix factorization are presented. In the papers, the methods are applied to separating audio signals such as speech and musical instruments and separating different types of tissue in chemical shift imaging....
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.
Directory of Open Access Journals (Sweden)
Qu Li
2014-01-01
Full Text Available Online friend recommendation is a fast developing topic in web mining. In this paper, we used SVD matrix factorization to model user and item feature vector and used stochastic gradient descent to amend parameter and improve accuracy. To tackle cold start problem and data sparsity, we used KNN model to influence user feature vector. At the same time, we used graph theory to partition communities with fairly low time and space complexity. What is more, matrix factorization can combine online and offline recommendation. Experiments showed that the hybrid recommendation algorithm is able to recommend online friends with good accuracy.
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
Development and validation of a job exposure matrix for physical risk factors in low back pain.
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.
Parallel transposition of sparse data structures
DEFF Research Database (Denmark)
Wang, Hao; Liu, Weifeng; Hou, Kaixi
2016-01-01
Many applications in computational sciences and social sciences exploit sparsity and connectivity of acquired data. Even though many parallel sparse primitives such as sparse matrix-vector (SpMV) multiplication have been extensively studied, some other important building blocks, e.g., parallel tr...... transposition in the latest vendor-supplied library on an Intel multicore CPU platform, and the MergeTrans approach achieves on average of 3.4-fold (up to 11.7-fold) speedup on an Intel Xeon Phi many-core processor....
Structure-based bayesian sparse reconstruction
Quadeer, Ahmed Abdul
2012-12-01
Sparse signal reconstruction algorithms have attracted research attention due to their wide applications in various fields. In this paper, we present a simple Bayesian approach that utilizes the sparsity constraint and a priori statistical information (Gaussian or otherwise) to obtain near optimal estimates. In addition, we make use of the rich structure of the sensing matrix encountered in many signal processing applications to develop a fast sparse recovery algorithm. The computational complexity of the proposed algorithm is very low compared with the widely used convex relaxation methods as well as greedy matching pursuit techniques, especially at high sparsity. © 1991-2012 IEEE.
Sparse structure regularized ranking
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.
Zhang, Tianzhu; Yang, Ming-Hsuan; Ahuja, Narendra; Ghanem, Bernard; Yan, Shuicheng; Xu, Changsheng; Liu, Si
2015-01-01
candidate. We show that our SST algorithm accommodates most existing sparse trackers with the respective merits. Both qualitative and quantitative evaluations on challenging benchmark image sequences demonstrate that the proposed SST algorithm performs
Enhancing Scalability of Sparse Direct Methods
International Nuclear Information System (INIS)
Li, Xiaoye S.; Demmel, James; Grigori, Laura; Gu, Ming; Xia, Jianlin; Jardin, Steve; Sovinec, Carl; Lee, Lie-Quan
2007-01-01
TOPS is providing high-performance, scalable sparse direct solvers, which have had significant impacts on the SciDAC applications, including fusion simulation (CEMM), accelerator modeling (COMPASS), as well as many other mission-critical applications in DOE and elsewhere. Our recent developments have been focusing on new techniques to overcome scalability bottleneck of direct methods, in both time and memory. These include parallelizing symbolic analysis phase and developing linear-complexity sparse factorization methods. The new techniques will make sparse direct methods more widely usable in large 3D simulations on highly-parallel petascale computers
Diffusion Indexes with Sparse Loadings
DEFF Research Database (Denmark)
Kristensen, Johannes Tang
The use of large-dimensional factor models in forecasting has received much attention in the literature with the consensus being that improvements on forecasts can be achieved when comparing with standard models. However, recent contributions in the literature have demonstrated that care needs...... to the problem by using the LASSO as a variable selection method to choose between the possible variables and thus obtain sparse loadings from which factors or diffusion indexes can be formed. This allows us to build a more parsimonious factor model which is better suited for forecasting compared...... it to be an important alternative to PC....
Directory of Open Access Journals (Sweden)
Ling-Yun Dai
2017-01-01
Full Text Available Differential expression plays an important role in cancer diagnosis and classification. In recent years, many methods have been used to identify differentially expressed genes. However, the recognition rate and reliability of gene selection still need to be improved. In this paper, a novel constrained method named robust nonnegative matrix factorization via joint graph Laplacian and discriminative information (GLD-RNMF is proposed for identifying differentially expressed genes, in which manifold learning and the discriminative label information are incorporated into the traditional nonnegative matrix factorization model to train the objective matrix. Specifically, L2,1-norm minimization is enforced on both the error function and the regularization term which is robust to outliers and noise in gene data. Furthermore, the multiplicative update rules and the details of convergence proof are shown for the new model. The experimental results on two publicly available cancer datasets demonstrate that GLD-RNMF is an effective method for identifying differentially expressed genes.
Parallel sparse direct solver for integrated circuit simulation
Chen, Xiaoming; Yang, Huazhong
2017-01-01
This book describes algorithmic methods and parallelization techniques to design a parallel sparse direct solver which is specifically targeted at integrated circuit simulation problems. The authors describe a complete flow and detailed parallel algorithms of the sparse direct solver. They also show how to improve the performance by simple but effective numerical techniques. The sparse direct solver techniques described can be applied to any SPICE-like integrated circuit simulator and have been proven to be high-performance in actual circuit simulation. Readers will benefit from the state-of-the-art parallel integrated circuit simulation techniques described in this book, especially the latest parallel sparse matrix solution techniques. · Introduces complicated algorithms of sparse linear solvers, using concise principles and simple examples, without complex theory or lengthy derivations; · Describes a parallel sparse direct solver that can be adopted to accelerate any SPICE-like integrated circuit simulato...
Parallelism in matrix computations
Gallopoulos, Efstratios; Sameh, Ahmed H
2016-01-01
This book is primarily intended as a research monograph that could also be used in graduate courses for the design of parallel algorithms in matrix computations. It assumes general but not extensive knowledge of numerical linear algebra, parallel architectures, and parallel programming paradigms. The book consists of four parts: (I) Basics; (II) Dense and Special Matrix Computations; (III) Sparse Matrix Computations; and (IV) Matrix functions and characteristics. Part I deals with parallel programming paradigms and fundamental kernels, including reordering schemes for sparse matrices. Part II is devoted to dense matrix computations such as parallel algorithms for solving linear systems, linear least squares, the symmetric algebraic eigenvalue problem, and the singular-value decomposition. It also deals with the development of parallel algorithms for special linear systems such as banded ,Vandermonde ,Toeplitz ,and block Toeplitz systems. Part III addresses sparse matrix computations: (a) the development of pa...
High performance matrix inversion based on LU factorization for multicore architectures
Dongarra, Jack
2011-01-01
The goal of this paper is to present an efficient implementation of an explicit matrix inversion of general square matrices on multicore computer architecture. The inversion procedure is split into four steps: 1) computing the LU factorization, 2) inverting the upper triangular U factor, 3) solving a linear system, whose solution yields inverse of the original matrix and 4) applying backward column pivoting on the inverted matrix. Using a tile data layout, which represents the matrix in the system memory with an optimized cache-aware format, the computation of the four steps is decomposed into computational tasks. A directed acyclic graph is generated on the fly which represents the program data flow. Its nodes represent tasks and edges the data dependencies between them. Previous implementations of matrix inversions, available in the state-of-the-art numerical libraries, are suffer from unnecessary synchronization points, which are non-existent in our implementation in order to fully exploit the parallelism of the underlying hardware. Our algorithmic approach allows to remove these bottlenecks and to execute the tasks with loose synchronization. A runtime environment system called QUARK is necessary to dynamically schedule our numerical kernels on the available processing units. The reported results from our LU-based matrix inversion implementation significantly outperform the state-of-the-art numerical libraries such as LAPACK (5x), MKL (5x) and ScaLAPACK (2.5x) on a contemporary AMD platform with four sockets and the total of 48 cores for a matrix of size 24000. A power consumption analysis shows that our high performance implementation is also energy efficient and substantially consumes less power than its competitors. © 2011 ACM.
Large-Scale Distributed Bayesian Matrix Factorization using Stochastic Gradient MCMC
Ahn, S.; Korattikara, A.; Liu, N.; Rajan, S.; Welling, M.
2015-01-01
Despite having various attractive qualities such as high prediction accuracy and the ability to quantify uncertainty and avoid ovrfitting, Bayesian Matrix Factorization has not been widely adopted because of the prohibitive cost of inference. In this paper, we propose a scalable distributed Bayesian
A Transfer Learning Approach for Applying Matrix Factorization to Small ITS Datasets
Voß, Lydia; Schatten, Carlotta; Mazziotti, Claudia; Schmidt-Thieme, Lars
2015-01-01
Machine Learning methods for Performance Prediction in Intelligent Tutoring Systems (ITS) have proven their efficacy; specific methods, e.g. Matrix Factorization (MF), however suffer from the lack of available information about new tasks or new students. In this paper we show how this problem could be solved by applying Transfer Learning (TL),…
A Fast Gradient Method for Nonnegative Sparse Regression With Self-Dictionary
Gillis, Nicolas; Luce, Robert
2018-01-01
A nonnegative matrix factorization (NMF) can be computed efficiently under the separability assumption, which asserts that all the columns of the given input data matrix belong to the cone generated by a (small) subset of them. The provably most robust methods to identify these conic basis columns are based on nonnegative sparse regression and self dictionaries, and require the solution of large-scale convex optimization problems. In this paper we study a particular nonnegative sparse regression model with self dictionary. As opposed to previously proposed models, this model yields a smooth optimization problem where the sparsity is enforced through linear constraints. We show that the Euclidean projection on the polyhedron defined by these constraints can be computed efficiently, and propose a fast gradient method to solve our model. We compare our algorithm with several state-of-the-art methods on synthetic data sets and real-world hyperspectral images.
Removing flicker based on sparse color correspondences in old film restoration
Huang, Xi; Ding, Youdong; Yu, Bing; Xia, Tianran
2018-04-01
In the long history of human civilization, archived film is an indispensable part of it, and using digital method to repair damaged film is also a mainstream trend nowadays. In this paper, we propose a sparse color correspondences based technique to remove fading flicker for old films. Our model, combined with multi frame images to establish a simple correction model, includes three key steps. Firstly, we recover sparse color correspondences in the input frames to build a matrix with many missing entries. Secondly, we present a low-rank matrix factorization approach to estimate the unknown parameters of this model. Finally, we adopt a two-step strategy that divide the estimated parameters into reference frame parameters for color recovery correction and other frame parameters for color consistency correction to remove flicker. Our method combined multi-frames takes continuity of the input sequence into account, and the experimental results show the method can remove fading flicker efficiently.
arXiv On Matrix Factorizations, Residue Pairings and Homological Mirror Symmetry
Lerche, Wolfgang
We argue how boundary B-type Landau-Ginzburg models based on matrix factorizations can be used to compute exact superpotentials for intersecting D-brane configurations on compact Calabi-Yau spaces. In this paper, we consider the dependence of open-string, boundary changing correlators on bulk moduli. This determines, via mirror symmetry, non-trivial disk instanton corrections in the A-model. As crucial ingredient we propose a differential equation that involves matrix analogs of Saito's higher residue pairings. As example, we compute from this for the elliptic curve certain quantum products m_2 and m_3, which reproduce genuine boundary changing, open Gromov-Witten invariants.
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.
Compound nucleus in Livsic open-system theory: Factorization of the S matrix
International Nuclear Information System (INIS)
Avishai, Y.
1988-01-01
The compound-nucleus system fits into a mathematical theory of open systems in physics developed by the mathematician M. Livsic [Translations of Mathematical Monographs (American Mathematical Society, Providence, Rhode Island, 1973), Vol. 34]. In this article we review some basic concepts of the above theory and apply it to study the structure of the compound-nucleus S matrix. One of the results is a factorization of the S matrix in the form S(ω) = S +iA/sub k//(tau/sub k/-ω)], where A/sub k/ are known matrices and tau/sub k/ are the complex resonance energies
Constructing the tree-level Yang-Mills S-matrix using complex factorization
Schuster, Philip C.; Toro, Natalia
2009-06-01
A remarkable connection between BCFW recursion relations and constraints on the S-matrix was made by Benincasa and Cachazo in 0705.4305, who noted that mutual consistency of different BCFW constructions of four-particle amplitudes generates non-trivial (but familiar) constraints on three-particle coupling constants — these include gauge invariance, the equivalence principle, and the lack of non-trivial couplings for spins > 2. These constraints can also be derived with weaker assumptions, by demanding the existence of four-point amplitudes that factorize properly in all unitarity limits with complex momenta. From this starting point, we show that the BCFW prescription can be interpreted as an algorithm for fully constructing a tree-level S-matrix, and that complex factorization of general BCFW amplitudes follows from the factorization of four-particle amplitudes. The allowed set of BCFW deformations is identified, formulated entirely as a statement on the three-particle sector, and using only complex factorization as a guide. Consequently, our analysis based on the physical consistency of the S-matrix is entirely independent of field theory. We analyze the case of pure Yang-Mills, and outline a proof for gravity. For Yang-Mills, we also show that the well-known scaling behavior of BCFW-deformed amplitudes at large z is a simple consequence of factorization. For gravity, factorization in certain channels requires asymptotic behavior ~ 1/z2.
Constructing the tree-level Yang-Mills S-matrix using complex factorization
International Nuclear Information System (INIS)
Schuster, Philip C.; Toro, Natalia
2009-01-01
A remarkable connection between BCFW recursion relations and constraints on the S-matrix was made by Benincasa and Cachazo in 0705.4305, who noted that mutual consistency of different BCFW constructions of four-particle amplitudes generates non-trivial (but familiar) constraints on three-particle coupling constants - these include gauge invariance, the equivalence principle, and the lack of non-trivial couplings for spins > 2. These constraints can also be derived with weaker assumptions, by demanding the existence of four-point amplitudes that factorize properly in all unitarity limits with complex momenta. From this starting point, we show that the BCFW prescription can be interpreted as an algorithm for fully constructing a tree-level S-matrix, and that complex factorization of general BCFW amplitudes follows from the factorization of four-particle amplitudes. The allowed set of BCFW deformations is identified, formulated entirely as a statement on the three-particle sector, and using only complex factorization as a guide. Consequently, our analysis based on the physical consistency of the S-matrix is entirely independent of field theory. We analyze the case of pure Yang-Mills, and outline a proof for gravity. For Yang-Mills, we also show that the well-known scaling behavior of BCFW-deformed amplitudes at large z is a simple consequence of factorization. For gravity, factorization in certain channels requires asymptotic behavior ∼ 1/z 2 .
Sparse distributed memory overview
Raugh, Mike
1990-01-01
The Sparse Distributed Memory (SDM) project is investigating the theory and applications of massively parallel computing architecture, called sparse distributed memory, that will support the storage and retrieval of sensory and motor patterns characteristic of autonomous systems. The immediate objectives of the project are centered in studies of the memory itself and in the use of the memory to solve problems in speech, vision, and robotics. Investigation of methods for encoding sensory data is an important part of the research. Examples of NASA missions that may benefit from this work are Space Station, planetary rovers, and solar exploration. Sparse distributed memory offers promising technology for systems that must learn through experience and be capable of adapting to new circumstances, and for operating any large complex system requiring automatic monitoring and control. Sparse distributed memory is a massively parallel architecture motivated by efforts to understand how the human brain works. Sparse distributed memory is an associative memory, able to retrieve information from cues that only partially match patterns stored in the memory. It is able to store long temporal sequences derived from the behavior of a complex system, such as progressive records of the system's sensory data and correlated records of the system's motor controls.
International Nuclear Information System (INIS)
Dzhamay, Anton
2009-01-01
We study factorizations of rational matrix functions with simple poles on the Riemann sphere. For the quadratic case (two poles) we show, using multiplicative representations of such matrix functions, that a good coordinate system on this space is given by a mix of residue eigenvectors of the matrix and its inverse. Our approach is motivated by the theory of discrete isomonodromic transformations and their relationship with difference Painleve equations. In particular, in these coordinates, basic isomonodromic transformations take the form of the discrete Euler-Lagrange equations. Secondly we show that dPV equations, previously obtained in this context by D Arinkin and A Borodin, can be understood as simple relationships between the residues of such matrices and their inverses.
All-at-once Optimization for Coupled Matrix and Tensor Factorizations
DEFF Research Database (Denmark)
Evrim, Acar Ataman; Kolda, Tamara G.; Dunlavy, Daniel M.
2011-01-01
.g., the person by person social network matrix or the restaurant by category matrix, and higher-order tensors, e.g., the "ratings" tensor of the form restaurant by meal by person. In this paper, we are particularly interested in fusing data sets with the goal of capturing their underlying latent structures. We...... formulate this problem as a coupled matrix and tensor factorization (CMTF) problem where heterogeneous data sets are modeled by fitting outer-product models to higher-order tensors and matrices in a coupled manner. Unlike traditional approaches solving this problem using alternating algorithms, we propose...... an all-at-once optimization approach called CMTF-OPT (CMTF-OPTimization), which is a gradient-based optimization approach for joint analysis of matrices and higher-order tensors. We also extend the algorithm to handle coupled incomplete data sets. Using numerical experiments, we demonstrate...
Wiener-Hopf factorization of piecewise meromorphic matrix-valued functions
International Nuclear Information System (INIS)
Adukov, Victor M
2009-01-01
Let D + be a multiply connected domain bounded by a contour Γ, let D - be the complement of D + union Γ in C-bar=C union {∞}, and a(t) be a continuous invertible matrix-valued function on Γ which can be meromorphically extended into the open disconnected set D - (as a piecewise meromorphic matrix-valued function). An explicit solution of the Wiener-Hopf factorization problem for a(t) is obtained and the partial factorization indices of a(t) are calculated. Here an explicit solution of a factorization problem is meant in the sense of reducing it to the investigation of finitely many systems of linear algebraic equations with matrices expressed in closed form, that is, in quadratures. Bibliography: 15 titles.
Efficient convolutional sparse coding
Wohlberg, Brendt
2017-06-20
Computationally efficient algorithms may be applied for fast dictionary learning solving the convolutional sparse coding problem in the Fourier domain. More specifically, efficient convolutional sparse coding may be derived within an alternating direction method of multipliers (ADMM) framework that utilizes fast Fourier transforms (FFT) to solve the main linear system in the frequency domain. Such algorithms may enable a significant reduction in computational cost over conventional approaches by implementing a linear solver for the most critical and computationally expensive component of the conventional iterative algorithm. The theoretical computational cost of the algorithm may be reduced from O(M.sup.3N) to O(MN log N), where N is the dimensionality of the data and M is the number of elements in the dictionary. This significant improvement in efficiency may greatly increase the range of problems that can practically be addressed via convolutional sparse representations.
Sparse approximation with bases
2015-01-01
This book systematically presents recent fundamental results on greedy approximation with respect to bases. Motivated by numerous applications, the last decade has seen great successes in studying nonlinear sparse approximation. Recent findings have established that greedy-type algorithms are suitable methods of nonlinear approximation in both sparse approximation with respect to bases and sparse approximation with respect to redundant systems. These insights, combined with some previous fundamental results, form the basis for constructing the theory of greedy approximation. Taking into account the theoretical and practical demand for this kind of theory, the book systematically elaborates a theoretical framework for greedy approximation and its applications. The book addresses the needs of researchers working in numerical mathematics, harmonic analysis, and functional analysis. It quickly takes the reader from classical results to the latest frontier, but is written at the level of a graduate course and do...
Directory of Open Access Journals (Sweden)
H. Fang
2018-04-01
Full Text Available Due to the limited spatial resolution of remote hyperspectral sensors, pixels are usually highly mixed in the hyperspectral images. Endmember extraction refers to the process identifying the pure endmember signatures from the mixture, which is an important step towards the utilization of hyperspectral data. Nonnegative matrix factorization (NMF is a widely used method of endmember extraction due to its effectiveness and convenience. While most NMF-based methods have single-layer structures, which may have difficulties in effectively learning the structures of highly mixed and complex data. On the other hand, multilayer algorithms have shown great advantages in learning data features and been widely studied in many fields. In this paper, we presented a L1 sparsityconstrained multilayer NMF method for endmember extraction of highly mixed data. Firstly, the multilayer NMF structure was obtained by unfolding NMF into a certain number of layers. In each layer, the abundance matrix was decomposed into the endmember matrix and abundance matrix of the next layer. Besides, to improve the performance of NMF, we incorporated sparsity constraints to the multilayer NMF model by adding a L1 regularizer of the abundance matrix to each layer. At last, a layer-wise optimization method based on NeNMF was proposed to train the multilayer NMF structure. Experiments were conducted on both synthetic data and real data. The results demonstrate that our proposed algorithm can achieve better results than several state-of-art approaches.
Castro-Mondragon, Jaime Abraham; Jaeger, Sébastien; Thieffry, Denis; Thomas-Chollier, Morgane; van Helden, Jacques
2017-07-27
Transcription factor (TF) databases contain multitudes of binding motifs (TFBMs) from various sources, from which non-redundant collections are derived by manual curation. The advent of high-throughput methods stimulated the production of novel collections with increasing numbers of motifs. Meta-databases, built by merging these collections, contain redundant versions, because available tools are not suited to automatically identify and explore biologically relevant clusters among thousands of motifs. Motif discovery from genome-scale data sets (e.g. ChIP-seq) also produces redundant motifs, hampering the interpretation of results. We present matrix-clustering, a versatile tool that clusters similar TFBMs into multiple trees, and automatically creates non-redundant TFBM collections. A feature unique to matrix-clustering is its dynamic visualisation of aligned TFBMs, and its capability to simultaneously treat multiple collections from various sources. We demonstrate that matrix-clustering considerably simplifies the interpretation of combined results from multiple motif discovery tools, and highlights biologically relevant variations of similar motifs. We also ran a large-scale application to cluster ∼11 000 motifs from 24 entire databases, showing that matrix-clustering correctly groups motifs belonging to the same TF families, and drastically reduced motif redundancy. matrix-clustering is integrated within the RSAT suite (http://rsat.eu/), accessible through a user-friendly web interface or command-line for its integration in pipelines. © The Author(s) 2017. Published by Oxford University Press on behalf of Nucleic Acids Research.
Supervised Convolutional Sparse Coding
Affara, Lama Ahmed
2018-04-08
Convolutional Sparse Coding (CSC) is a well-established image representation model especially suited for image restoration tasks. In this work, we extend the applicability of this model by proposing a supervised approach to convolutional sparse coding, which aims at learning discriminative dictionaries instead of purely reconstructive ones. We incorporate a supervised regularization term into the traditional unsupervised CSC objective to encourage the final dictionary elements to be discriminative. Experimental results show that using supervised convolutional learning results in two key advantages. First, we learn more semantically relevant filters in the dictionary and second, we achieve improved image reconstruction on unseen data.
A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
Czech Academy of Sciences Publication Activity Database
Benzi, M.; Tůma, Miroslav
1998-01-01
Roč. 19, č. 3 (1998), s. 968-994 ISSN 1064-8275 R&D Projects: GA ČR GA201/93/0067; GA AV ČR IAA230401 Keywords : large sparse systems * interative methods * preconditioning * approximate inverse * sparse linear systems * sparse matrices * incomplete factorizations * conjugate gradient -type methods Subject RIV: BA - General Mathematics Impact factor: 1.378, year: 1998
Ma, Yuanyuan; Hu, Xiaohua; He, Tingting; Jiang, Xingpeng
2016-12-01
Nonnegative matrix factorization (NMF) has received considerable attention due to its interpretation of observed samples as combinations of different components, and has been successfully used as a clustering method. As an extension of NMF, Symmetric NMF (SNMF) inherits the advantages of NMF. Unlike NMF, however, SNMF takes a nonnegative similarity matrix as an input, and two lower rank nonnegative matrices (H, H T ) are computed as an output to approximate the original similarity matrix. Laplacian regularization has improved the clustering performance of NMF and SNMF. However, Laplacian regularization (LR), as a classic manifold regularization method, suffers some problems because of its weak extrapolating ability. In this paper, we propose a novel variant of SNMF, called Hessian regularization based symmetric nonnegative matrix factorization (HSNMF), for this purpose. In contrast to Laplacian regularization, Hessian regularization fits the data perfectly and extrapolates nicely to unseen data. We conduct extensive experiments on several datasets including text data, gene expression data and HMP (Human Microbiome Project) data. The results show that the proposed method outperforms other methods, which suggests the potential application of HSNMF in biological data clustering. Copyright Â© 2016. Published by Elsevier Inc.
Directory of Open Access Journals (Sweden)
Mikaël M Martino
2015-04-01
Full Text Available Blood vessel growth plays a key role in regenerative medicine, both to restore blood supply to ischemic tissues and to ensure rapid vascularization of clinical-size tissue-engineered grafts. For example, vascular endothelial growth factor (VEGF is the master regulator of physiological blood vessel growth and is one of the main molecular targets of therapeutic angiogenesis approaches. However, angiogenesis is a complex process and there is a need to develop rational therapeutic strategies based on a firm understanding of basic vascular biology principles, as evidenced by the disappointing results of initial clinical trials of angiogenic factor delivery. In particular, the spatial localization of angiogenic signals in the extracellular matrix is crucial to ensure the proper assembly and maturation of new vascular structures. Here we discuss the therapeutic implications of matrix interactions of angiogenic factors, with a special emphasis on VEGF, as well as provide an overview of current approaches, based on protein and biomaterial engineering that mimic the regulatory functions of extracellular matrix to optimize the signaling microenvironment of vascular growth factors.
Insulin-like growth factor I has independent effects on bone matrix formation and cell replication
International Nuclear Information System (INIS)
Hock, J.M.; Centrella, M.; Canalis, E.
1988-01-01
The effects of insulin-like growth factor-I (IGF-I) and insulin on bone matrix synthesis and bone cell replication were studied in cultured 21-day-old fetal rat calvariae. Histomorphometry techniques were developed to measure the incorporation of [2,3- 3 H]proline and [methyl- 3 H]thymidine into bone matrix and bone cell nuclei, respectively, using autoradiographs of sagittal sections of calvariae cultured with IGF-I, insulin, or vehicle for up to 96 h. To confirm an effect on bone formation, IGF-I was also studied for its effects on [ 3 H]proline incorporation into collagenase-digestible protein (CDP) and noncollagen protein and on [ 3 H]thymidine incorporation into acid-precipitable material (DNA). IGF-I at 10(-9)-10(-7) M significantly increased the rate of bone matrix apposition and CDP after 24 h by 45-50% and increased cell labeling by 8-fold in the osteoprogenitor cell zone, by 4-fold in the osteoblast cell zone, and by 2-fold in the periosteal fibroblast zone. Insulin at 10(-9)-10(-6) M also increased matrix apposition rate and CDP by 40-50%, but increased cell labeling by 2-fold only at a concentration of 10(-7) M or higher and then only in the osteoprogenitor cell zone. When hydroxyurea was added to IGF-I-treated bones, the effects of IGF-I on DNA synthesis were abolished, but the increase in bone matrix apposition induced by IGF-I was only partly diminished. In conclusion, IGF-I stimulates matrix synthesis in calvariae, an effect that is partly, although not completely, dependent on its stimulatory effect on DNA synthesis
Hua, Cong; Feng, Yan; Yuan, Hongyan; Song, Hongmei
2016-01-01
Abstract Chronic subdural hematoma (CSDH) is an inflammatory and angiogenic disease. Vascular endothelial growth factor (VEGF) has an important effect on the pathological progression of CSDH. The matrix metalloproteinases (MMPs) and VEGF also play a significant role in pathological angiogenesis. Our research was to investigate the level of MMPs and VEGF in serum and hematoma fluid. Magnetic Resonance Imaging (MRI) shows the characteristics of different stages of CSDH. We also analyzed the relationship between the level of VEGF in subdural hematoma fluid and the appearances of the patients' MRI. We performed a study comparing serum and hematoma fluid in 37 consecutive patients with primary CSDHs using enzyme-linked immunosorbent assay (ELISA). MMP-2 and MMP-9 activity was assayed by the gelatin zymography method. The patients were divided into five groups according to the appearance of the hematomas on MRI: group 1 (T1-weighted low, T2-weighted low, n=4), group 2 (T1-weighted high, T2-weighted low, n=11), group 3 (T1-weighted mixed, T2-weighted mixed, n=9), group 4 (T1-weighted high, T2-weighted high, n=5), and group 5 (T1-weighted low, T2-weighted high, n=8). Neurological status was assessed by Markwalder score on admission and at follow-up. The mean age, sex, and Markwalder score were not significantly different among groups. The mean concentration of VEGF, MMP-2, and MMP-9 were significantly higher in hematoma fluid than in serum (phematoma fluid (phematoma fluid (phematoma fluid, suggesting that the MMPs/VEGF system may be involved in the angiogenesis of CSDH. We also demonstrate a significant correlation between the concentrations of VEGF and MRI appearance. This finding supports the hypothesis that high VEGF concentration in the hematoma fluid is of major pathophysiological importance in the generation and steady increase of the hematoma volume, as well as the determination of MRI appearance. PMID:25646653
Dynamic SPECT reconstruction from few projections: a sparsity enforced matrix factorization approach
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.
Sparse Linear Identifiable Multivariate Modeling
DEFF Research Database (Denmark)
Henao, Ricardo; Winther, Ole
2011-01-01
and bench-marked on artificial and real biological data sets. SLIM is closest in spirit to LiNGAM (Shimizu et al., 2006), but differs substantially in inference, Bayesian network structure learning and model comparison. Experimentally, SLIM performs equally well or better than LiNGAM with comparable......In this paper we consider sparse and identifiable linear latent variable (factor) and linear Bayesian network models for parsimonious analysis of multivariate data. We propose a computationally efficient method for joint parameter and model inference, and model comparison. It consists of a fully...
Alternating optimization method based on nonnegative matrix factorizations for deep neural networks
Sakurai, Tetsuya; Imakura, Akira; Inoue, Yuto; Futamura, Yasunori
2016-01-01
The backpropagation algorithm for calculating gradients has been widely used in computation of weights for deep neural networks (DNNs). This method requires derivatives of objective functions and has some difficulties finding appropriate parameters such as learning rate. In this paper, we propose a novel approach for computing weight matrices of fully-connected DNNs by using two types of semi-nonnegative matrix factorizations (semi-NMFs). In this method, optimization processes are performed b...
Factors that impact the stability of vitamin C at intermediate temperatures in a food matrix
Herbig, Anna-Lena
2017-01-01
The study comprises a systematic and quantitative evaluation of potential intrinsic and extrinsic factors that impact vitamin C degradation in a real food matrix. The supernatant of centrifuged apple purée was fortified in vitamin C, and degradation was followed without stirring. Model discrimination indicated better fit for the zero order model than the first order model which was hence chosen for determination of rate constants. pH influenced strongly vitamin C degradation in citrate-phosph...
Exarchakis, Georgios; Lücke, Jörg
2017-11-01
Sparse coding algorithms with continuous latent variables have been the subject of a large number of studies. However, discrete latent spaces for sparse coding have been largely ignored. In this work, we study sparse coding with latents described by discrete instead of continuous prior distributions. We consider the general case in which the latents (while being sparse) can take on any value of a finite set of possible values and in which we learn the prior probability of any value from data. This approach can be applied to any data generated by discrete causes, and it can be applied as an approximation of continuous causes. As the prior probabilities are learned, the approach then allows for estimating the prior shape without assuming specific functional forms. To efficiently train the parameters of our probabilistic generative model, we apply a truncated expectation-maximization approach (expectation truncation) that we modify to work with a general discrete prior. We evaluate the performance of the algorithm by applying it to a variety of tasks: (1) we use artificial data to verify that the algorithm can recover the generating parameters from a random initialization, (2) use image patches of natural images and discuss the role of the prior for the extraction of image components, (3) use extracellular recordings of neurons to present a novel method of analysis for spiking neurons that includes an intuitive discretization strategy, and (4) apply the algorithm on the task of encoding audio waveforms of human speech. The diverse set of numerical experiments presented in this letter suggests that discrete sparse coding algorithms can scale efficiently to work with realistic data sets and provide novel statistical quantities to describe the structure of the data.
Augmenting matrix factorization technique with the combination of tags and genres
Ma, Tinghuai; Suo, Xiafei; Zhou, Jinjuan; Tang, Meili; Guan, Donghai; Tian, Yuan; Al-Dhelaan, Abdullah; Al-Rodhaan, Mznah
2016-11-01
Recommender systems play an important role in our daily life and are becoming popular tools for users to find what they are really interested in. Matrix factorization methods, which are popular recommendation methods, have gained high attention these years. With the rapid growth of the Internet, lots of information has been created, like social network information, tags and so on. Along with these, a few matrix factorization approaches have been proposed which incorporate the personalized information of users or items. However, except for ratings, most of the matrix factorization models have utilized only one kind of information to understand users' interests. Considering the sparsity of information, in this paper, we try to investigate the combination of different information, like tags and genres, to reveal users' interests accurately. With regard to the generalization of genres, a constraint is added when genres are utilized to find users' similar ;soulmates;. In addition, item regularizer is also considered based on latent semantic indexing (LSI) method with the item tags. Our experiments are conducted on two real datasets: Movielens dataset and Douban dataset. The experimental results demonstrate that the combination of tags and genres is really helpful to reveal users' interests.
Non-negative matrix factorization by maximizing correntropy for cancer clustering
Wang, Jim Jing-Yan; Wang, Xiaolei; Gao, Xin
2013-01-01
Background: Non-negative matrix factorization (NMF) has been shown to be a powerful tool for clustering gene expression data, which are widely used to classify cancers. NMF aims to find two non-negative matrices whose product closely approximates the original matrix. Traditional NMF methods minimize either the l2 norm or the Kullback-Leibler distance between the product of the two matrices and the original matrix. Correntropy was recently shown to be an effective similarity measurement due to its stability to outliers or noise.Results: We propose a maximum correntropy criterion (MCC)-based NMF method (NMF-MCC) for gene expression data-based cancer clustering. Instead of minimizing the l2 norm or the Kullback-Leibler distance, NMF-MCC maximizes the correntropy between the product of the two matrices and the original matrix. The optimization problem can be solved by an expectation conditional maximization algorithm.Conclusions: Extensive experiments on six cancer benchmark sets demonstrate that the proposed method is significantly more accurate than the state-of-the-art methods in cancer clustering. 2013 Wang et al.; licensee BioMed Central Ltd.
Non-negative matrix factorization by maximizing correntropy for cancer clustering
Wang, Jim Jing-Yan
2013-03-24
Background: Non-negative matrix factorization (NMF) has been shown to be a powerful tool for clustering gene expression data, which are widely used to classify cancers. NMF aims to find two non-negative matrices whose product closely approximates the original matrix. Traditional NMF methods minimize either the l2 norm or the Kullback-Leibler distance between the product of the two matrices and the original matrix. Correntropy was recently shown to be an effective similarity measurement due to its stability to outliers or noise.Results: We propose a maximum correntropy criterion (MCC)-based NMF method (NMF-MCC) for gene expression data-based cancer clustering. Instead of minimizing the l2 norm or the Kullback-Leibler distance, NMF-MCC maximizes the correntropy between the product of the two matrices and the original matrix. The optimization problem can be solved by an expectation conditional maximization algorithm.Conclusions: Extensive experiments on six cancer benchmark sets demonstrate that the proposed method is significantly more accurate than the state-of-the-art methods in cancer clustering. 2013 Wang et al.; licensee BioMed Central Ltd.
Minimally invasive esthetic ridge preservation with growth-factor enhanced bone matrix.
Nevins, Marc L; Said, Sherif
2017-12-28
Extraction socket preservation procedures are critical to successful esthetic implant therapy. Conventional surgical approaches are technique sensitive and often result in alteration of the soft tissue architecture, which then requires additional corrective surgical procedures. This case series report presents the ability of flapless surgical techniques combined with a growth factor-enhanced bone matrix to provide esthetic ridge preservation at the time of extraction for compromised sockets. When considering esthetic dental implant therapy, preservation, or further enhancement of the available tissue support at the time of tooth extraction may provide an improved esthetic outcome with reduced postoperative sequelae and decreased treatment duration. Advances in minimally invasive surgical techniques combined with recombinant growth factor technology offer an alternative for bone reconstruction while maintaining the gingival architecture for enhanced esthetic outcome. The combination of freeze-dried bone allograft (FDBA) and rhPDGF-BB (platelet-derived growth factor-BB) provides a growth-factor enhanced matrix to induce bone and soft tissue healing. The use of a growth-factor enhanced matrix is an option for minimally invasive ridge preservation procedures for sites with advanced bone loss. Further studies including randomized clinical trials are needed to better understand the extent and limits of these procedures. The use of minimally invasive techniques with growth factors for esthetic ridge preservation reduces patient morbidity associated with more invasive approaches and increases the predictability for enhanced patient outcomes. By reducing the need for autogenous bone grafts the use of this technology is favorable for patient acceptance and ease of treatment process for esthetic dental implant therapy. © 2017 Wiley Periodicals, Inc.
DEFF Research Database (Denmark)
Sugiyama, Nami; Varjosalo, Markku; Meller, Pipsa
2010-01-01
/stroma border and tumor invasion front. The strongest overall coexpression was found in prostate carcinoma. Studies with cultured prostate carcinoma cell lines showed that the FGFR4-R388 variant, which has previously been associated with poor cancer prognosis, increased MT1-MMP-dependent collagen invasion......Aberrant expression and polymorphism of fibroblast growth factor receptor 4 (FGFR4) has been linked to tumor progression and anticancer drug resistance. We describe here a novel mechanism of tumor progression by matrix degradation involving epithelial-to-mesenchymal transition in response...... to membrane-type 1 matrix metalloproteinase (MT1-MMP, MMP-14) induction at the edge of tumors expressing the FGFR4-R388 risk variant. Both FGFR4 and MT1-MMP were upregulated in tissue biopsies from several human cancer types including breast adenocarcinomas, where they were partially coexpressed at the tumor...
Jiao, Pengfei; Cai, Fei; Feng, Yiding; Wang, Wenjun
2017-08-21
Link predication aims at forecasting the latent or unobserved edges in the complex networks and has a wide range of applications in reality. Almost existing methods and models only take advantage of one class organization of the networks, which always lose important information hidden in other organizations of the network. In this paper, we propose a link predication framework which makes the best of the structure of networks in different level of organizations based on nonnegative matrix factorization, which is called NMF 3 here. We first map the observed network into another space by kernel functions, which could get the different order organizations. Then we combine the adjacency matrix of the network with one of other organizations, which makes us obtain the objective function of our framework for link predication based on the nonnegative matrix factorization. Third, we derive an iterative algorithm to optimize the objective function, which converges to a local optimum, and we propose a fast optimization strategy for large networks. Lastly, we test the proposed framework based on two kernel functions on a series of real world networks under different sizes of training set, and the experimental results show the feasibility, effectiveness, and competitiveness of the proposed framework.
Diffusion Indexes With Sparse Loadings
DEFF Research Database (Denmark)
Kristensen, Johannes Tang
2017-01-01
The use of large-dimensional factor models in forecasting has received much attention in the literature with the consensus being that improvements on forecasts can be achieved when comparing with standard models. However, recent contributions in the literature have demonstrated that care needs...... to the problem by using the least absolute shrinkage and selection operator (LASSO) as a variable selection method to choose between the possible variables and thus obtain sparse loadings from which factors or diffusion indexes can be formed. This allows us to build a more parsimonious factor model...... in forecasting accuracy and thus find it to be an important alternative to PC. Supplementary materials for this article are available online....
Sparse inpainting and isotropy
Energy Technology Data Exchange (ETDEWEB)
Feeney, Stephen M.; McEwen, Jason D.; Peiris, Hiranya V. [Department of Physics and Astronomy, University College London, Gower Street, London, WC1E 6BT (United Kingdom); Marinucci, Domenico; Cammarota, Valentina [Department of Mathematics, University of Rome Tor Vergata, via della Ricerca Scientifica 1, Roma, 00133 (Italy); Wandelt, Benjamin D., E-mail: s.feeney@imperial.ac.uk, E-mail: marinucc@axp.mat.uniroma2.it, E-mail: jason.mcewen@ucl.ac.uk, E-mail: h.peiris@ucl.ac.uk, E-mail: wandelt@iap.fr, E-mail: cammarot@axp.mat.uniroma2.it [Kavli Institute for Theoretical Physics, Kohn Hall, University of California, 552 University Road, Santa Barbara, CA, 93106 (United States)
2014-01-01
Sparse inpainting techniques are gaining in popularity as a tool for cosmological data analysis, in particular for handling data which present masked regions and missing observations. We investigate here the relationship between sparse inpainting techniques using the spherical harmonic basis as a dictionary and the isotropy properties of cosmological maps, as for instance those arising from cosmic microwave background (CMB) experiments. In particular, we investigate the possibility that inpainted maps may exhibit anisotropies in the behaviour of higher-order angular polyspectra. We provide analytic computations and simulations of inpainted maps for a Gaussian isotropic model of CMB data, suggesting that the resulting angular trispectrum may exhibit small but non-negligible deviations from isotropy.
Interface discontinuity factors in the modal Eigenspace of the multigroup diffusion matrix
International Nuclear Information System (INIS)
Garcia-Herranz, N.; Herrero, J.J.; Cuervo, D.; Ahnert, C.
2011-01-01
Interface discontinuity factors based on the Generalized Equivalence Theory are commonly used in nodal homogenized diffusion calculations so that diffusion average values approximate heterogeneous higher order solutions. In this paper, an additional form of interface correction factors is presented in the frame of the Analytic Coarse Mesh Finite Difference Method (ACMFD), based on a correction of the modal fluxes instead of the physical fluxes. In the ACMFD formulation, implemented in COBAYA3 code, the coupled multigroup diffusion equations inside a homogenized region are reduced to a set of uncoupled modal equations through diagonalization of the multigroup diffusion matrix. Then, physical fluxes are transformed into modal fluxes in the Eigenspace of the diffusion matrix. It is possible to introduce interface flux discontinuity jumps as the difference of heterogeneous and homogeneous modal fluxes instead of introducing interface discontinuity factors as the ratio of heterogeneous and homogeneous physical fluxes. The formulation in the modal space has been implemented in COBAYA3 code and assessed by comparison with solutions using classical interface discontinuity factors in the physical space. (author)
International Nuclear Information System (INIS)
Choy, M.; Armstrong, M.T.; Armstrong, P.B.
1990-01-01
Proliferation of atrioventricular cushion mesenchyme of the embryonic avian heart maintained in three-dimensional aggregate culture is stimulated by interaction with the interstitial matrix. Chicken serum or transforming growth factor-beta 1, which stimulates proliferation, induces matrix deposition in regions of the aggregate showing high labeling indices with tritiated thymidine. Dispersed heart mesenchyme interstitial matrix introduced into serum-free culture is incorporated into the aggregate and stimulates cellular proliferation similar to serum or transforming growth factor-beta 1. Proliferation is reversibly inhibited by the peptide Gly-Arg-Gly-Asp-Ser-Pro. It is suggested that transforming growth factor-beta 1 stimulates the production of interstitial matrix and that a sufficient stimulus for proliferation in this system is the presence of the matrix, which acts as the adhesive support for cellular anchorage
Jia, Yan; Yue, Yu; Hu, Dan-Ning; Chen, Ji-Li; Zhou, Ji-Bo
2017-01-01
The present study aims to investigate the association of transforming growth factor-β2 (TGF-β2) and matrix metalloproteinases (MMPs), MMP-2 and MMP-3, and tissue inhibitors of matrix metalloproteinases (TIMPs), TIMP-1, TIMP-2 and TIMP-3 in the aqueous humor of patients with high myopia or cataracts. The levels of TGF-β2 and MMPs/TIMPs were measured with the Luminex xMAP Technology using commercially available Milliplex xMAP kits. The association between TGF-β2 and MMPs/TIMPs levels was analyz...
A Recursive Formulation of Cholesky Factorization of a Matrix in Packed Storage Format
DEFF Research Database (Denmark)
Andersen, Bjarne Stig; Gustavson, Fred; Wasniewski, Jerzy
2001-01-01
. Algorithm RPC is based on level-3 BLAS and requires variants of algorithms {\\$\\backslash\\$bf TRSM} and {\\$\\backslash\\$bf SYRK} that work on RPF. We call these {\\$\\backslash\\$bf RP\\$\\backslash\\$\\_TRSM} and {\\$\\backslash\\$bf RP\\$\\backslash\\$\\_SYRK} and find that they do most of their work by calling...... matrix. Second, RPC gives a level-3 implementation of Cholesky factorization whereas standard packed implementations are only level 2. Hence, the performance of our RPC implementation is decidedly superior. Third, unlike fixed block size algorithms, RPC requires no block size tuning parameter. We present...
On the Equivalence of Nonnegative Matrix Factorization and K-means- Spectral Clustering
Energy Technology Data Exchange (ETDEWEB)
Ding, Chris; He, Xiaofeng; Simon, Horst D.; Jin, Rong
2005-12-04
We provide a systematic analysis of nonnegative matrix factorization (NMF) relating to data clustering. We generalize the usual X = FG{sup T} decomposition to the symmetric W = HH{sup T} and W = HSH{sup T} decompositions. We show that (1) W = HH{sup T} is equivalent to Kernel K-means clustering and the Laplacian-based spectral clustering. (2) X = FG{sup T} is equivalent to simultaneous clustering of rows and columns of a bipartite graph. We emphasizes the importance of orthogonality in NMF and soft clustering nature of NMF. These results are verified with experiments on face images and newsgroups.
Tasić, M.; Mijić, Z.; Rajšić, S.; Stojić, A.; Radenković, M.; Joksić, J.
2009-04-01
The primary objective of the present study was to assess anthropogenic impacts of heavy metals to the environment by determination of total atmospheric deposition of heavy metals. Atmospheric depositions (wet + dry) were collected monthly, from June 2002 to December 2006, at three urban locations in Belgrade, using bulk deposition samplers. Concentrations of Fe, Al, Pb, Zn, Cu, Ni, Mn, Cr, V, As and Cd were analyzed using atomic absorption spectrometry. Based upon these results, the study attempted to examine elemental associations in atmospheric deposition and to elucidate the potential sources of heavy metal contaminants in the region by the use of multivariate receptor model Positive Matrix Factorization (PMF).
International Nuclear Information System (INIS)
Tasic, M; Mijic, Z; Rajsic, S; Stojic, A; Radenkovic, M; Joksic, J
2009-01-01
The primary objective of the present study was to assess anthropogenic impacts of heavy metals to the environment by determination of total atmospheric deposition of heavy metals. Atmospheric depositions (wet + dry) were collected monthly, from June 2002 to December 2006, at three urban locations in Belgrade, using bulk deposition samplers. Concentrations of Fe, Al, Pb, Zn, Cu, Ni, Mn, Cr, V, As and Cd were analyzed using atomic absorption spectrometry. Based upon these results, the study attempted to examine elemental associations in atmospheric deposition and to elucidate the potential sources of heavy metal contaminants in the region by the use of multivariate receptor model Positive Matrix Factorization (PMF).
Directory of Open Access Journals (Sweden)
Biçer Cenker
2016-01-01
Full Text Available In this paper, the stability of the adaptive fading extended Kalman filter with the matrix forgetting factor when applied to the state estimation problem with noise terms in the non–linear discrete–time stochastic systems has been analysed. The analysis is conducted in a similar manner to the standard extended Kalman filter’s stability analysis based on stochastic framework. The theoretical results show that under certain conditions on the initial estimation error and the noise terms, the estimation error remains bounded and the state estimation is stable.
Absence of particle production and factorization of the s-matrix in 1 + 1 dimensional models
International Nuclear Information System (INIS)
Parke, S.
1980-01-01
In massive, 1 + 1 dimensional, local, quantum field theories the existence of two conserved charges is shown to be a sufficient condition for the absence of particle production and factorization of the s-matrix. These charges must commute and be integrals of local current densities. Their transformation properties under the Lorentz group must be different and also different from the transformation properties under the Lorentz group must be different and also different from the transformation properties pf a vector or a scalar. Also, they must not annihilate any single-particle momentum eigenstate. (orig.)
DEFF Research Database (Denmark)
Ågren, Magnus S.; Andersen, Thomas L.; Andersen, Line
2011-01-01
Increased matrix metalloproteinase (MMP) activity has been implicated in the pathogenesis of colorectal anastomotic leakage. Tumor necrosis factor-a (TNF-a) induces MMPs and may influence anastomosis repair....
Compressed sensing & sparse filtering
Carmi, Avishy Y; Godsill, Simon J
2013-01-01
This book is aimed at presenting concepts, methods and algorithms ableto cope with undersampled and limited data. One such trend that recently gained popularity and to some extent revolutionised signal processing is compressed sensing. Compressed sensing builds upon the observation that many signals in nature are nearly sparse (or compressible, as they are normally referred to) in some domain, and consequently they can be reconstructed to within high accuracy from far fewer observations than traditionally held to be necessary.Â Apart from compressed sensing this book contains other related app
Wang, Jim Jing-Yan; Gao, Xin
2014-01-01
Sparse coding approximates the data sample as a sparse linear combination of some basic codewords and uses the sparse codes as new presentations. In this paper, we investigate learning discriminative sparse codes by sparse coding in a semi-supervised manner, where only a few training samples are labeled. By using the manifold structure spanned by the data set of both labeled and unlabeled samples and the constraints provided by the labels of the labeled samples, we learn the variable class labels for all the samples. Furthermore, to improve the discriminative ability of the learned sparse codes, we assume that the class labels could be predicted from the sparse codes directly using a linear classifier. By solving the codebook, sparse codes, class labels and classifier parameters simultaneously in a unified objective function, we develop a semi-supervised sparse coding algorithm. Experiments on two real-world pattern recognition problems demonstrate the advantage of the proposed methods over supervised sparse coding methods on partially labeled data sets.
Wang, Jim Jing-Yan
2014-07-06
Sparse coding approximates the data sample as a sparse linear combination of some basic codewords and uses the sparse codes as new presentations. In this paper, we investigate learning discriminative sparse codes by sparse coding in a semi-supervised manner, where only a few training samples are labeled. By using the manifold structure spanned by the data set of both labeled and unlabeled samples and the constraints provided by the labels of the labeled samples, we learn the variable class labels for all the samples. Furthermore, to improve the discriminative ability of the learned sparse codes, we assume that the class labels could be predicted from the sparse codes directly using a linear classifier. By solving the codebook, sparse codes, class labels and classifier parameters simultaneously in a unified objective function, we develop a semi-supervised sparse coding algorithm. Experiments on two real-world pattern recognition problems demonstrate the advantage of the proposed methods over supervised sparse coding methods on partially labeled data sets.
Ullah, Farman; Sarwar, Ghulam; Lee, Sungchang
2014-01-01
We propose a network and visual quality aware N-Screen content recommender system. N-Screen provides more ways than ever before to access multimedia content through multiple devices and heterogeneous access networks. The heterogeneity of devices and access networks present new questions of QoS (quality of service) in the realm of user experience with content. We propose, a recommender system that ensures a better visual quality on user's N-screen devices and the efficient utilization of available access network bandwidth with user preferences. The proposed system estimates the available bandwidth and visual quality on users N-Screen devices and integrates it with users preferences and contents genre information to personalize his N-Screen content. The objective is to recommend content that the user's N-Screen device and access network are capable of displaying and streaming with the user preferences that have not been supported in existing systems. Furthermore, we suggest a joint matrix factorization approach to jointly factorize the users rating matrix with the users N-Screen device similarity and program genres similarity. Finally, the experimental results show that we also enhance the prediction and recommendation accuracy, sparsity, and cold start issues.
Neighborhood Regularized Logistic Matrix Factorization for Drug-Target Interaction Prediction.
Liu, Yong; Wu, Min; Miao, Chunyan; Zhao, Peilin; Li, Xiao-Li
2016-02-01
In pharmaceutical sciences, a crucial step of the drug discovery process is the identification of drug-target interactions. However, only a small portion of the drug-target interactions have been experimentally validated, as the experimental validation is laborious and costly. To improve the drug discovery efficiency, there is a great need for the development of accurate computational approaches that can predict potential drug-target interactions to direct the experimental verification. In this paper, we propose a novel drug-target interaction prediction algorithm, namely neighborhood regularized logistic matrix factorization (NRLMF). Specifically, the proposed NRLMF method focuses on modeling the probability that a drug would interact with a target by logistic matrix factorization, where the properties of drugs and targets are represented by drug-specific and target-specific latent vectors, respectively. Moreover, NRLMF assigns higher importance levels to positive observations (i.e., the observed interacting drug-target pairs) than negative observations (i.e., the unknown pairs). Because the positive observations are already experimentally verified, they are usually more trustworthy. Furthermore, the local structure of the drug-target interaction data has also been exploited via neighborhood regularization to achieve better prediction accuracy. We conducted extensive experiments over four benchmark datasets, and NRLMF demonstrated its effectiveness compared with five state-of-the-art approaches.
Directory of Open Access Journals (Sweden)
Farman Ullah
2014-01-01
Full Text Available We propose a network and visual quality aware N-Screen content recommender system. N-Screen provides more ways than ever before to access multimedia content through multiple devices and heterogeneous access networks. The heterogeneity of devices and access networks present new questions of QoS (quality of service in the realm of user experience with content. We propose, a recommender system that ensures a better visual quality on user’s N-screen devices and the efficient utilization of available access network bandwidth with user preferences. The proposed system estimates the available bandwidth and visual quality on users N-Screen devices and integrates it with users preferences and contents genre information to personalize his N-Screen content. The objective is to recommend content that the user’s N-Screen device and access network are capable of displaying and streaming with the user preferences that have not been supported in existing systems. Furthermore, we suggest a joint matrix factorization approach to jointly factorize the users rating matrix with the users N-Screen device similarity and program genres similarity. Finally, the experimental results show that we also enhance the prediction and recommendation accuracy, sparsity, and cold start issues.
Yang, Haixuan; Seoighe, Cathal
2016-01-01
Nonnegative Matrix Factorization (NMF) has proved to be an effective method for unsupervised clustering analysis of gene expression data. By the nonnegativity constraint, NMF provides a decomposition of the data matrix into two matrices that have been used for clustering analysis. However, the decomposition is not unique. This allows different clustering results to be obtained, resulting in different interpretations of the decomposition. To alleviate this problem, some existing methods directly enforce uniqueness to some extent by adding regularization terms in the NMF objective function. Alternatively, various normalization methods have been applied to the factor matrices; however, the effects of the choice of normalization have not been carefully investigated. Here we investigate the performance of NMF for the task of cancer class discovery, under a wide range of normalization choices. After extensive evaluations, we observe that the maximum norm showed the best performance, although the maximum norm has not previously been used for NMF. Matlab codes are freely available from: http://maths.nuigalway.ie/~haixuanyang/pNMF/pNMF.htm.
Graph regularized nonnegative matrix factorization for temporal link prediction in dynamic networks
Ma, Xiaoke; Sun, Penggang; Wang, Yu
2018-04-01
Many networks derived from society and nature are temporal and incomplete. The temporal link prediction problem in networks is to predict links at time T + 1 based on a given temporal network from time 1 to T, which is essential to important applications. The current algorithms either predict the temporal links by collapsing the dynamic networks or collapsing features derived from each network, which are criticized for ignoring the connection among slices. to overcome the issue, we propose a novel graph regularized nonnegative matrix factorization algorithm (GrNMF) for the temporal link prediction problem without collapsing the dynamic networks. To obtain the feature for each network from 1 to t, GrNMF factorizes the matrix associated with networks by setting the rest networks as regularization, which provides a better way to characterize the topological information of temporal links. Then, the GrNMF algorithm collapses the feature matrices to predict temporal links. Compared with state-of-the-art methods, the proposed algorithm exhibits significantly improved accuracy by avoiding the collapse of temporal networks. Experimental results of a number of artificial and real temporal networks illustrate that the proposed method is not only more accurate but also more robust than state-of-the-art approaches.
International Nuclear Information System (INIS)
Pinnera, I.; Perez, G.; Ramos, M.; Guibert, R.; Aldape, F.; Flores M, J.; Martinez, M.; Molina, E.; Fernandez, A.
2011-01-01
In previous study a set of samples of fine and coarse airborne particulate matter collected in a urban area of Havana City were analyzed by Particle-Induced X-ray Emission (PIXE) technique. The concentrations of 14 elements (S, Cl, K, Ca, Ti, V, Cr, Mn, Fe, Ni, Cu, Zn, Br and Pb) were consistently determined in both particle sizes. The analytical database provided by PIXE was statistically analyzed in order to determine the local pollution sources. The Positive Matrix Factorization (PMF) technique was applied to fine particle data in order to identify possible pollution sources. These sources were further verified by enrichment factor (EF) calculation. A general discussion about these results is presented in this work. (Author)
Orthogonal sparse linear discriminant analysis
Liu, Zhonghua; Liu, Gang; Pu, Jiexin; Wang, Xiaohong; Wang, Haijun
2018-03-01
Linear discriminant analysis (LDA) is a linear feature extraction approach, and it has received much attention. On the basis of LDA, researchers have done a lot of research work on it, and many variant versions of LDA were proposed. However, the inherent problem of LDA cannot be solved very well by the variant methods. The major disadvantages of the classical LDA are as follows. First, it is sensitive to outliers and noises. Second, only the global discriminant structure is preserved, while the local discriminant information is ignored. In this paper, we present a new orthogonal sparse linear discriminant analysis (OSLDA) algorithm. The k nearest neighbour graph is first constructed to preserve the locality discriminant information of sample points. Then, L2,1-norm constraint on the projection matrix is used to act as loss function, which can make the proposed method robust to outliers in data points. Extensive experiments have been performed on several standard public image databases, and the experiment results demonstrate the performance of the proposed OSLDA algorithm.
Extracellular Matrix and Growth Factors Improve the Efficacy of Intramuscular Islet Transplantation.
Directory of Open Access Journals (Sweden)
Haruyuki Tsuchiya
Full Text Available The efficacy of intramuscular islet transplantation is poor despite being technically simple, safe, and associated with reduced rates of severe complications. We evaluated the efficacy of combined treatment with extracellular matrix (ECM and growth factors in intramuscular islet transplantation.Male BALB/C mice were used for the in vitro and transplantation studies. The following three groups were evaluated: islets without treatment (islets-only group, islets embedded in ECM with growth factors (Matrigel group, and islets embedded in ECM without growth factors [growth factor-reduced (GFR Matrigel group]. The viability and insulin-releasing function of islets cultured for 96 h were significantly improved in Matrigel and GFR Matrigel groups compared with the islets-only group.Blood glucose and serum insulin levels immediately following transplantation were significantly improved in the Matrigel and GFR Matrigel groups and remained significantly improved in the Matrigel group at postoperative day (POD 28. On histological examination, significantly decreased numbers of TdT-mediated deoxyuridine triphosphate-biotin nick end labeling-positive islet cells and significantly increased numbers of Ki67-positive cells were observed in the Matrigel and GFR Matrigel groups at POD 3. Peri-islet revascularization was most prominent in the Matrigel group at POD 14.The efficacy of intramuscular islet transplantation was improved by combination treatment with ECM and growth factors through the inhibition of apoptosis, increased proliferation of islet cells, and promotion of revascularization.
Extracellular Matrix and Growth Factors Improve the Efficacy of Intramuscular Islet Transplantation.
Tsuchiya, Haruyuki; Sakata, Naoaki; Yoshimatsu, Gumpei; Fukase, Masahiko; Aoki, Takeshi; Ishida, Masaharu; Katayose, Yu; Egawa, Shinichi; Unno, Michiaki
2015-01-01
The efficacy of intramuscular islet transplantation is poor despite being technically simple, safe, and associated with reduced rates of severe complications. We evaluated the efficacy of combined treatment with extracellular matrix (ECM) and growth factors in intramuscular islet transplantation. Male BALB/C mice were used for the in vitro and transplantation studies. The following three groups were evaluated: islets without treatment (islets-only group), islets embedded in ECM with growth factors (Matrigel group), and islets embedded in ECM without growth factors [growth factor-reduced (GFR) Matrigel group]. The viability and insulin-releasing function of islets cultured for 96 h were significantly improved in Matrigel and GFR Matrigel groups compared with the islets-only group. Blood glucose and serum insulin levels immediately following transplantation were significantly improved in the Matrigel and GFR Matrigel groups and remained significantly improved in the Matrigel group at postoperative day (POD) 28. On histological examination, significantly decreased numbers of TdT-mediated deoxyuridine triphosphate-biotin nick end labeling-positive islet cells and significantly increased numbers of Ki67-positive cells were observed in the Matrigel and GFR Matrigel groups at POD 3. Peri-islet revascularization was most prominent in the Matrigel group at POD 14. The efficacy of intramuscular islet transplantation was improved by combination treatment with ECM and growth factors through the inhibition of apoptosis, increased proliferation of islet cells, and promotion of revascularization.
Directory of Open Access Journals (Sweden)
I. M. Ulbrich
2009-05-01
Full Text Available The organic aerosol (OA dataset from an Aerodyne Aerosol Mass Spectrometer (Q-AMS collected at the Pittsburgh Air Quality Study (PAQS in September 2002 was analyzed with Positive Matrix Factorization (PMF. Three components – hydrocarbon-like organic aerosol OA (HOA, a highly-oxygenated OA (OOA-1 that correlates well with sulfate, and a less-oxygenated, semi-volatile OA (OOA-2 that correlates well with nitrate and chloride – are identified and interpreted as primary combustion emissions, aged SOA, and semivolatile, less aged SOA, respectively. The complexity of interpreting the PMF solutions of unit mass resolution (UMR AMS data is illustrated by a detailed analysis of the solutions as a function of number of components and rotational forcing. A public web-based database of AMS spectra has been created to aid this type of analysis. Realistic synthetic data is also used to characterize the behavior of PMF for choosing the best number of factors, and evaluating the rotations of non-unique solutions. The ambient and synthetic data indicate that the variation of the PMF quality of fit parameter (Q, a normalized chi-squared metric vs. number of factors in the solution is useful to identify the minimum number of factors, but more detailed analysis and interpretation are needed to choose the best number of factors. The maximum value of the rotational matrix is not useful for determining the best number of factors. In synthetic datasets, factors are "split" into two or more components when solving for more factors than were used in the input. Elements of the "splitting" behavior are observed in solutions of real datasets with several factors. Significant structure remains in the residual of the real dataset after physically-meaningful factors have been assigned and an unrealistic number of factors would be required to explain the remaining variance. This residual structure appears to be due to variability in the spectra of the components
Evaluation of the validity of job exposure matrix for psychosocial factors at work.
Directory of Open Access Journals (Sweden)
Svetlana Solovieva
Full Text Available To study the performance of a developed job exposure matrix (JEM for the assessment of psychosocial factors at work in terms of accuracy, possible misclassification bias and predictive ability to detect known associations with depression and low back pain (LBP.We utilized two large population surveys (the Health 2000 Study and the Finnish Work and Health Surveys, one to construct the JEM and another to test matrix performance. In the first study, information on job demands, job control, monotonous work and social support at work was collected via face-to-face interviews. Job strain was operationalized based on job demands and job control using quadrant approach. In the second study, the sensitivity and specificity were estimated applying a Bayesian approach. The magnitude of misclassification error was examined by calculating the biased odds ratios as a function of the sensitivity and specificity of the JEM and fixed true prevalence and odds ratios. Finally, we adjusted for misclassification error the observed associations between JEM measures and selected health outcomes.The matrix showed a good accuracy for job control and job strain, while its performance for other exposures was relatively low. Without correction for exposure misclassification, the JEM was able to detect the association between job strain and depression in men and between monotonous work and LBP in both genders.Our results suggest that JEM more accurately identifies occupations with low control and high strain than those with high demands or low social support. Overall, the present JEM is a useful source of job-level psychosocial exposures in epidemiological studies lacking individual-level exposure information. Furthermore, we showed the applicability of a Bayesian approach in the evaluation of the performance of the JEM in a situation where, in practice, no gold standard of exposure assessment exists.
Evaluation of the validity of job exposure matrix for psychosocial factors at work.
Solovieva, Svetlana; Pensola, Tiina; Kausto, Johanna; Shiri, Rahman; Heliövaara, Markku; Burdorf, Alex; Husgafvel-Pursiainen, Kirsti; Viikari-Juntura, Eira
2014-01-01
To study the performance of a developed job exposure matrix (JEM) for the assessment of psychosocial factors at work in terms of accuracy, possible misclassification bias and predictive ability to detect known associations with depression and low back pain (LBP). We utilized two large population surveys (the Health 2000 Study and the Finnish Work and Health Surveys), one to construct the JEM and another to test matrix performance. In the first study, information on job demands, job control, monotonous work and social support at work was collected via face-to-face interviews. Job strain was operationalized based on job demands and job control using quadrant approach. In the second study, the sensitivity and specificity were estimated applying a Bayesian approach. The magnitude of misclassification error was examined by calculating the biased odds ratios as a function of the sensitivity and specificity of the JEM and fixed true prevalence and odds ratios. Finally, we adjusted for misclassification error the observed associations between JEM measures and selected health outcomes. The matrix showed a good accuracy for job control and job strain, while its performance for other exposures was relatively low. Without correction for exposure misclassification, the JEM was able to detect the association between job strain and depression in men and between monotonous work and LBP in both genders. Our results suggest that JEM more accurately identifies occupations with low control and high strain than those with high demands or low social support. Overall, the present JEM is a useful source of job-level psychosocial exposures in epidemiological studies lacking individual-level exposure information. Furthermore, we showed the applicability of a Bayesian approach in the evaluation of the performance of the JEM in a situation where, in practice, no gold standard of exposure assessment exists.
Calculation of the fast multiplication factor by the fission matrix method
International Nuclear Information System (INIS)
Naumov, V.A.; Rozin, S.G.; Ehl'perin, T.I.
1976-01-01
A variation of the Monte Carlo method to calculate an effective breeding factor of a nuclear reactor is described. The evaluation procedure of reactivity perturbations by the Monte Carlo method in the first order perturbation theory is considered. The method consists in reducing an integral neutron transport equation to a set of linear algebraic equations. The coefficients of this set are elements of a fission matrix. The fission matrix being a Grin function of the neutron transport equation, is evaluated by the Monte Carlo method. In the program realizing the suggested algorithm, the game for initial neutron energy of a fission spectrum and then for the region of neutron birth, ΔVsub(f)sup(i)has been played in proportion to the product of Σsub(f)sup(i)ΔVsub(f)sup(i), where Σsub(f)sup(i) is a macroscopic cross section in the region numbered at the birth energy. Further iterations of a space distribution of neutrons in the system are performed by the generation method. In the adopted scheme of simulation of neutron histories the emission of secondary neutrons is controlled by weights; it occurs at every collision and not only in the end on the history. The breeding factor is calculated simultaneously with the space distribution of neutron worth in the system relative to the fission process and neutron flux. Efficiency of the described procedure has been tested on the calculation of the breeding factor for the Godiva assembly, simulating a fast reactor with a hard spectrum. A high accuracy of calculations at moderate number of zones in the core and reasonable statistics has been stated
Partitioning sparse rectangular matrices for parallel processing
Energy Technology Data Exchange (ETDEWEB)
Kolda, T.G.
1998-05-01
The authors are interested in partitioning sparse rectangular matrices for parallel processing. The partitioning problem has been well-studied in the square symmetric case, but the rectangular problem has received very little attention. They will formalize the rectangular matrix partitioning problem and discuss several methods for solving it. They will extend the spectral partitioning method for symmetric matrices to the rectangular case and compare this method to three new methods -- the alternating partitioning method and two hybrid methods. The hybrid methods will be shown to be best.
Factors that impact the stability of vitamin C at intermediate temperatures in a food matrix.
Herbig, Anna-Lena; Renard, Catherine M G C
2017-04-01
The study comprises a systematic and quantitative evaluation of potential intrinsic and extrinsic factors that impact vitamin C degradation in a real food matrix. The supernatant of centrifuged apple purée was fortified in vitamin C, and degradation was followed without stirring. Model discrimination indicated better fit for the zero order model than the first order model which was hence chosen for determination of rate constants. pH influenced strongly vitamin C degradation in citrate-phosphate buffer but not in the apple purée serum. To get an idea of the impact of the food matrix, stability in apple purée serum was compared with that in carrot purée. In the latter, stability was slightly higher. Vitamin C degradation rates were not influenced by its initial concentration. The temperature effect was only marked in the temperature range 40-60°C. In the range 60-80°C, filling height of tubes had the greatest impact. Copyright © 2016 Elsevier Ltd. All rights reserved.
Exploring Mixed Membership Stochastic Block Models via Non-negative Matrix Factorization
Peng, Chengbin
2014-12-01
Many real-world phenomena can be modeled by networks in which entities and connections are represented by nodes and edges respectively. When certain nodes are highly connected with each other, those nodes forms a cluster, which is called community in our context. It is usually assumed that each node belongs to one community only, but evidences in biology and social networks reveal that the communities often overlap with each other. In other words, one node can probably belong to multiple communities. In light of that, mixed membership stochastic block models (MMB) have been developed to model those networks with overlapping communities. Such a model contains three matrices: two incidence matrices indicating in and out connections and one probability matrix. When the probability of connections for nodes between communities are significantly small, the parameter inference problem to this model can be solved by a constrained non-negative matrix factorization (NMF) algorithm. In this paper, we explore the connection between the two models and propose an algorithm based on NMF to infer the parameters of MMB. The proposed algorithms can detect overlapping communities regardless of knowing or not the number of communities. Experiments show that our algorithm can achieve a better community detection performance than the traditional NMF algorithm. © 2014 IEEE.
Beyond cross-domain learning: Multiple-domain nonnegative matrix factorization
Wang, Jim Jing-Yan; Gao, Xin
2014-01-01
Traditional cross-domain learning methods transfer learning from a source domain to a target domain. In this paper, we propose the multiple-domain learning problem for several equally treated domains. The multiple-domain learning problem assumes that samples from different domains have different distributions, but share the same feature and class label spaces. Each domain could be a target domain, while also be a source domain for other domains. A novel multiple-domain representation method is proposed for the multiple-domain learning problem. This method is based on nonnegative matrix factorization (NMF), and tries to learn a basis matrix and coding vectors for samples, so that the domain distribution mismatch among different domains will be reduced under an extended variation of the maximum mean discrepancy (MMD) criterion. The novel algorithm - multiple-domain NMF (MDNMF) - was evaluated on two challenging multiple-domain learning problems - multiple user spam email detection and multiple-domain glioma diagnosis. The effectiveness of the proposed algorithm is experimentally verified. © 2013 Elsevier Ltd. All rights reserved.
Beyond cross-domain learning: Multiple-domain nonnegative matrix factorization
Wang, Jim Jing-Yan
2014-02-01
Traditional cross-domain learning methods transfer learning from a source domain to a target domain. In this paper, we propose the multiple-domain learning problem for several equally treated domains. The multiple-domain learning problem assumes that samples from different domains have different distributions, but share the same feature and class label spaces. Each domain could be a target domain, while also be a source domain for other domains. A novel multiple-domain representation method is proposed for the multiple-domain learning problem. This method is based on nonnegative matrix factorization (NMF), and tries to learn a basis matrix and coding vectors for samples, so that the domain distribution mismatch among different domains will be reduced under an extended variation of the maximum mean discrepancy (MMD) criterion. The novel algorithm - multiple-domain NMF (MDNMF) - was evaluated on two challenging multiple-domain learning problems - multiple user spam email detection and multiple-domain glioma diagnosis. The effectiveness of the proposed algorithm is experimentally verified. © 2013 Elsevier Ltd. All rights reserved.
Bayesian Nonnegative Matrix Factorization with Volume Prior for Unmixing of Hyperspectral Images
DEFF Research Database (Denmark)
Arngren, Morten; Schmidt, Mikkel Nørgaard; Larsen, Jan
2009-01-01
based unmixing algorithms are based on sparsity regularization encouraging pure spectral endmembers, but this is not optimal for certain applications, such as foods, where abundances are not sparse. The pixels will theoretically lie on a simplex and hence the endmembers can be estimated as the vertices...
Zhang, Qing; Wang, Ping; Shao, Ming; Chen, Shi-Wen; Xu, Zhi-Feng; Xu, Feng; Yang, Zhong-Yin; Liu, Bing-Ya; Gu, Qin-Long; Zhang, Wen-Jian; Li, Yong
2015-01-01
Keratinocyte growth factor (KGF) is reported to be implicated in the growth of some cancer cells. Matrix metalloproteinase 9 (MMP-9) is thought to enhance the tumor invasion and metastasis ability. This study was aimed at analyzing the relationship between KGF and MMP-9 expression and patients' clinicopathological characteristics to clarify the clinical significance of the expression of KGF and MMP-9 in gastric cancer. Tissue samples from 161 patients with primary gastric cancer were investigated using immunohistochemistry. The relationship between KGF and/or MMP-9 expression and clinicopathological characteristics was analyzed. KGF expression and MMP-9 expression in gastric cancer tissue were observed in 62 cases (38.5%) and 97 cases (60.2%), respectively. MMP-9 was significantly associated with depth of invasion, lymph node metastasis and TNM stage. The prognosis of MMP-9-positive patients was significantly poorer than that of MMP-9-negative patients (p = 0.009). KGF expression was positively correlated with MMP-9 expression in gastric cancer, and the prognosis of patients with both KGF- and MMP-9-positive tumors was significantly worse than that of patients with negative tumors for either factor (p = 0.045). Expression of MMP-9 was revealed to be an independent prognostic factor (p = 0.026). Coexpression of KGF and MMP-9 in gastric cancer could be a useful prognostic factor, and MMP-9 might also serve as a novel target for both prognostic prediction and therapeutics.
International Nuclear Information System (INIS)
Wang Degao; Tian Fulin; Yang Meng; Liu Chenlin; Li Yifan
2009-01-01
Soil derived sources of polycyclic aromatic hydrocarbons (PAHs) in the region of Dalian, China were investigated using positive matrix factorization (PMF). Three factors were separated based on PMF for the statistical investigation of the datasets both in summer and winter. These factors were dominated by the pattern of single sources or groups of similar sources, showing seasonal and regional variations. The main sources of PAHs in Dalian soil in summer were the emissions from coal combustion average (46%), diesel engine (30%), and gasoline engine (24%). In winter, the main sources were the emissions from coal-fired boiler (72%), traffic average (20%), and gasoline engine (8%). These factors with strong seasonality indicated that coal combustion in winter and traffic exhaust in summer dominated the sources of PAHs in soil. These results suggested that PMF model was a proper approach to identify the sources of PAHs in soil. - PMF model is a proper approach to identify potential sources of PAHs in soil based on the PAH profiles measured in the field and those published in the literature.
Convex Banding of the Covariance Matrix.
Bien, Jacob; Bunea, Florentina; Xiao, Luo
2016-01-01
We introduce a new sparse estimator of the covariance matrix for high-dimensional models in which the variables have a known ordering. Our estimator, which is the solution to a convex optimization problem, is equivalently expressed as an estimator which tapers the sample covariance matrix by a Toeplitz, sparsely-banded, data-adaptive matrix. As a result of this adaptivity, the convex banding estimator enjoys theoretical optimality properties not attained by previous banding or tapered estimators. In particular, our convex banding estimator is minimax rate adaptive in Frobenius and operator norms, up to log factors, over commonly-studied classes of covariance matrices, and over more general classes. Furthermore, it correctly recovers the bandwidth when the true covariance is exactly banded. Our convex formulation admits a simple and efficient algorithm. Empirical studies demonstrate its practical effectiveness and illustrate that our exactly-banded estimator works well even when the true covariance matrix is only close to a banded matrix, confirming our theoretical results. Our method compares favorably with all existing methods, in terms of accuracy and speed. We illustrate the practical merits of the convex banding estimator by showing that it can be used to improve the performance of discriminant analysis for classifying sound recordings.
Denning, Peter J.
1989-01-01
Sparse distributed memory was proposed be Pentti Kanerva as a realizable architecture that could store large patterns and retrieve them based on partial matches with patterns representing current sensory inputs. This memory exhibits behaviors, both in theory and in experiment, that resemble those previously unapproached by machines - e.g., rapid recognition of faces or odors, discovery of new connections between seemingly unrelated ideas, continuation of a sequence of events when given a cue from the middle, knowing that one doesn't know, or getting stuck with an answer on the tip of one's tongue. These behaviors are now within reach of machines that can be incorporated into the computing systems of robots capable of seeing, talking, and manipulating. Kanerva's theory is a break with the Western rationalistic tradition, allowing a new interpretation of learning and cognition that respects biology and the mysteries of individual human beings.
Chen, Zigang; Li, Lixiang; Peng, Haipeng; Liu, Yuhong; Yang, Yixian
2018-04-01
Community mining for complex social networks with link and attribute information plays an important role according to different application needs. In this paper, based on our proposed general non-negative matrix factorization (GNMF) algorithm without dimension matching constraints in our previous work, we propose the joint GNMF with graph Laplacian (LJGNMF) to implement community mining of complex social networks with link and attribute information according to different application needs. Theoretical derivation result shows that the proposed LJGNMF is fully compatible with previous methods of integrating traditional NMF and symmetric NMF. In addition, experimental results show that the proposed LJGNMF can meet the needs of different community minings by adjusting its parameters, and the effect is better than traditional NMF in the community vertices attributes entropy.
Categorical dimensions of human odor descriptor space revealed by non-negative matrix factorization
Energy Technology Data Exchange (ETDEWEB)
Chennubhotla, Chakra [University of Pittsburgh School of Medicine, Pittsburgh PA; Castro, Jason [Bates College
2013-01-01
In contrast to most other sensory modalities, the basic perceptual dimensions of olfaction remain un- clear. Here, we use non-negative matrix factorization (NMF) - a dimensionality reduction technique - to uncover structure in a panel of odor profiles, with each odor defined as a point in multi-dimensional descriptor space. The properties of NMF are favorable for the analysis of such lexical and perceptual data, and lead to a high-dimensional account of odor space. We further provide evidence that odor di- mensions apply categorically. That is, odor space is not occupied homogenously, but rather in a discrete and intrinsically clustered manner. We discuss the potential implications of these results for the neural coding of odors, as well as for developing classifiers on larger datasets that may be useful for predicting perceptual qualities from chemical structures.
Nishiyama, Keita; Nakamata, Koichi; Ueno, Shintaro; Terao, Akari; Aryantini, Ni Putu Desy; Sujaya, I Nengah; Fukuda, Kenji; Urashima, Tadasu; Yamamoto, Yuji; Mukai, Takao
2015-01-01
We previously described potential probiotic Lactobacillus rhamnosus strains, isolated from fermented mare milk produced in Sumbawa Island, Indonesia, which showed high adhesion to porcine colonic mucin (PCM) and extracellular matrix (ECM) proteins. Recently, mucus-binding factor (MBF) was found in the GG strain of L. rhamnosus as a mucin-binding protein. In this study, we assessed the ability of recombinant MBF protein from the FSMM22 strain, one of the isolates of L. rhamnosus from fermented Sumbawa mare milk, to adhere to PCM and ECM proteins by overlay dot blot and Biacore assays. MBF bound to PCM, laminin, collagen IV, and fibronectin with submicromolar dissociation constants. Adhesion of the FSMM22 mbf mutant strain to PCM and ECM proteins was significantly less than that of the wild-type strain. Collectively, these results suggested that MBF contribute to L. rhamnosus host colonization via mucin and ECM protein binding.
Approximate L0 constrained Non-negative Matrix and Tensor Factorization
DEFF Research Database (Denmark)
Mørup, Morten; Madsen, Kristoffer Hougaard; Hansen, Lars Kai
2008-01-01
Non-negative matrix factorization (NMF), i.e. V = WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based representation. The NMF decomposition is not in general unique and a part based representation not guaranteed. However...... constraint. In general, solving for a given L0 norm is an NP hard problem thus convex relaxatin to regularization by the L1 norm is often considered, i.e., minimizing ( 1/2 ||V-WHk||^2+lambda|H|_1). An open problem is to control the degree of sparsity imposed. We here demonstrate that a full regularization......, the L1 regularization strength lambda that best approximates a given L0 can be directly accessed and in effect used to control the sparsity of H. The MATLAB code for the NLARS algorithm is available for download....
Mizumoto, Shuji; Yamada, Shuhei; Sugahara, Kazuyuki
2015-10-01
Recent functional studies on chondroitin sulfate-dermatan sulfate (CS-DS) demonstrated its indispensable roles in various biological events including brain development and cancer. CS-DS proteoglycans exert their physiological activity through interactions with specific proteins including growth factors, cell surface receptors, and matrix proteins. The characterization of these interactions is essential for regulating the biological functions of CS-DS proteoglycans. Although amino acid sequences on the bioactive proteins required for these interactions have already been elucidated, the specific saccharide sequences involved in the binding of CS-DS to target proteins have not yet been sufficiently identified. In this review, recent findings are described on the interaction between CS-DS and some proteins which are especially involved in the central nervous system and cancer development/metastasis. Copyright © 2015. Published by Elsevier Ltd.
International Nuclear Information System (INIS)
Abdel Malak, C.A.; Karawya, E.M.; Hammouda, G.A.; Zakhary, N.I.
2003-01-01
In the present study, the serum levels of some cytokines and the matrix metalloproteinase-9 (MMP-9) were studied in an attempt to find suitable markers for early diagnosis of non- Hodgkin's lymphoma (NHL) and to assess their role in differentiating between disseminated and non disseminated cases. The present study was conducted on 60 patients with non disseminated NHL, 14 patients with disseminated NHL, in addition to 10 healthy controls. Their sera were used to determine tumor necrosis factor-α (TNF--α), tumor necrosis factor--β (TNF-β), interferon---α), (IFN--α), interferon-γ (IFN--γ) and Matrix Metalloproteinase-9 (MMP-9) using the ELISA technique. The results showed that the serum level of TNF---α), and IFN---α), can be used to differentiate between the control group and the group of NHL patients. However, they could not differentiate between non disseminated NHL (nd- NHL) and disseminated NHL (d- NHL). On the other hand, the serum level of TNF-β) can be used to differentiate between nd- NHL and d- NHL, but not between the control group and nd-NHL. Each of [FN--γ and MMP-9 were not useful in discrimination between the control group and the diseased ones. Our data revealed no correlation between serum level of the parameters investigated and the gender of the patients. The present results revealed that TNF-α) and INF-α), can be used as diagnostic tools for NHL. On the other hand, TNF-β) is useful in the differentiation between nd-NHL and d-NHL
Matrix factorization-based data fusion for the prediction of lncRNA-disease associations.
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
Sparse decompositions in 'incoherent' dictionaries
DEFF Research Database (Denmark)
Gribonval, R.; Nielsen, Morten
2003-01-01
a unique sparse representation in such a dictionary. In particular, it is proved that the result of Donoho and Huo, concerning the replacement of a combinatorial optimization problem with a linear programming problem when searching for sparse representations, has an analog for dictionaries that may...
Energy Technology Data Exchange (ETDEWEB)
Xu, Ren; Spencer, Virginia A.; Bissell, Mina J.
2006-05-25
Extracellular cues play crucial roles in the transcriptional regulation of tissue-specific genes, but whether and how these signals lead to chromatin remodeling is not understood and subject to debate. Using chromatin immunoprecipitation (ChIP) assays and mammary-specific genes as models, we show here that extracellular matrix (ECM) molecules and prolactin cooperate to induce histone acetylation and binding of transcription factors and the SWI/SNF complex to the {beta}- and ?-casein promoters. Introduction of a dominant negative Brg1, an ATPase subunit of SWI/SNF complex, significantly reduced both {beta}- and ?-casein expression, suggesting that SWI/SNF-dependent chromatin remodeling is required for transcription of mammary-specific genes. ChIP analyses demonstrated that the ATPase activity of SWI/SNF is necessary for recruitment of RNA transcriptional machinery, but not for binding of transcription factors or for histone acetylation. Coimmunoprecipitation analyses showed that the SWI/SNF complex is associated with STAT5, C/EBP{beta}, and glucocorticoid receptor (GR). Thus, ECM- and prolactin-regulated transcription of the mammary-specific casein genes requires the concerted action of chromatin remodeling enzymes and transcription factors.
Source apportionment and location by selective wind sampling and Positive Matrix Factorization.
Venturini, Elisa; Vassura, Ivano; Raffo, Simona; Ferroni, Laura; Bernardi, Elena; Passarini, Fabrizio
2014-10-01
In order to determine the pollution sources in a suburban area and identify the main direction of their origin, PM2.5 was collected with samplers coupled with a wind select sensor and then subjected to Positive Matrix Factorization (PMF) analysis. In each sample, soluble ions, organic carbon, elemental carbon, levoglucosan, metals, and Polycyclic Aromatic Hydrocarbons (PAHs) were determined. PMF results identified six main sources affecting the area: natural gas home appliances, motor vehicles, regional transport, biomass combustion, manufacturing activities, and secondary aerosol. The connection of factor temporal trends with other parameters (i.e., temperature, PM2.5 concentration, and photochemical processes) confirms factor attributions. PMF analysis indicated that the main source of PM2.5 in the area is secondary aerosol. This should be mainly due to regional contributions, owing to both the secondary nature of the source itself and the higher concentration registered in inland air masses. The motor vehicle emission source contribution is also important. This source likely has a prevalent local origin. The most toxic determined components, i.e., PAHs, Cd, Pb, and Ni, are mainly due to vehicular traffic. Even if this is not the main source in the study area, it is the one of greatest concern. The application of PMF analysis to PM2.5 collected with this new sampling technique made it possible to obtain more detailed results on the sources affecting the area compared to a classical PMF analysis.
Alpay, D.; Dijksma, A.; Langer, H.
2004-01-01
We prove that a 2 × 2 matrix polynomial which is J-unitary on the real line can be written as a product of normalized elementary J-unitary factors and a J-unitary constant. In the second part we give an algorithm for this factorization using an analog of the Schur transformation.
Tensor-GMRES method for large sparse systems of nonlinear equations
Feng, Dan; Pulliam, Thomas H.
1994-01-01
This paper introduces a tensor-Krylov method, the tensor-GMRES method, for large sparse systems of nonlinear equations. This method is a coupling of tensor model formation and solution techniques for nonlinear equations with Krylov subspace projection techniques for unsymmetric systems of linear equations. Traditional tensor methods for nonlinear equations are based on a quadratic model of the nonlinear function, a standard linear model augmented by a simple second order term. These methods are shown to be significantly more efficient than standard methods both on nonsingular problems and on problems where the Jacobian matrix at the solution is singular. A major disadvantage of the traditional tensor methods is that the solution of the tensor model requires the factorization of the Jacobian matrix, which may not be suitable for problems where the Jacobian matrix is large and has a 'bad' sparsity structure for an efficient factorization. We overcome this difficulty by forming and solving the tensor model using an extension of a Newton-GMRES scheme. Like traditional tensor methods, we show that the new tensor method has significant computational advantages over the analogous Newton counterpart. Consistent with Krylov subspace based methods, the new tensor method does not depend on the factorization of the Jacobian matrix. As a matter of fact, the Jacobian matrix is never needed explicitly.
Directory of Open Access Journals (Sweden)
Bin Ju
Full Text Available Predicting what items will be selected by a target user in the future is an important function for recommendation systems. Matrix factorization techniques have been shown to achieve good performance on temporal rating-type data, but little is known about temporal item selection data. In this paper, we developed a unified model that combines Multi-task Non-negative Matrix Factorization and Linear Dynamical Systems to capture the evolution of user preferences. Specifically, user and item features are projected into latent factor space by factoring co-occurrence matrices into a common basis item-factor matrix and multiple factor-user matrices. Moreover, we represented both within and between relationships of multiple factor-user matrices using a state transition matrix to capture the changes in user preferences over time. The experiments show that our proposed algorithm outperforms the other algorithms on two real datasets, which were extracted from Netflix movies and Last.fm music. Furthermore, our model provides a novel dynamic topic model for tracking the evolution of the behavior of a user over time.
Ju, Bin; Qian, Yuntao; Ye, Minchao; Ni, Rong; Zhu, Chenxi
2015-01-01
Predicting what items will be selected by a target user in the future is an important function for recommendation systems. Matrix factorization techniques have been shown to achieve good performance on temporal rating-type data, but little is known about temporal item selection data. In this paper, we developed a unified model that combines Multi-task Non-negative Matrix Factorization and Linear Dynamical Systems to capture the evolution of user preferences. Specifically, user and item features are projected into latent factor space by factoring co-occurrence matrices into a common basis item-factor matrix and multiple factor-user matrices. Moreover, we represented both within and between relationships of multiple factor-user matrices using a state transition matrix to capture the changes in user preferences over time. The experiments show that our proposed algorithm outperforms the other algorithms on two real datasets, which were extracted from Netflix movies and Last.fm music. Furthermore, our model provides a novel dynamic topic model for tracking the evolution of the behavior of a user over time.
Directory of Open Access Journals (Sweden)
2012-09-01
Material and Method: IIn this study, the threats, opportunities, weaknesses and strengths were evaluated by one of the tools named SWOT, in one of the assembly industries company in Iran, in order to controlling the operations in this company considering to safety and health standard (OHSAS18001. A comparison of the company’s performance in implementing the safety and health standards was done between years 1387 and 1388 contain in the Company considered, and weighted scoring weaknesses, strengths, threats and opportunities using the matrix of internal factors (strengths and weaknesses and external factors (treats and opportunities then, the importance of each factor were determined in the company’s implementation and enforcement of those standards. . Result: Focusing on the strengths and weaknesses, opportunities and threats, some strategies to improve the implementation were presented. Any points were weighted based on the most important weaknesses identified as the lack of monitoring contractors, lack of management commitment for implementation of OHSAS18001, no attempt to identify the risks of change, lack of training needs assessment, main strengths identified in the context of adequate budget health and safety, environmental efforts, identify risk for abnormal conditions, the most important threats for immediate delivery customer orders and the opportunity to support the safety and health plans, were determined. . Conclusion: Sum of the weighted scores in year 87 were obtained for the external factors (opportunities and threats, 2.16 and internal factors (strengths and weaknesses 1.66. Both of these scores were less than 2.5 (minimum amount of the acceptable rate so, the company has been poor performance in the implementation of this standard for the year 87 and a weak reaction in the use of opportunities and the minimize threats has. In case of internal factors, it was worse than external one and the situation was more bold of the weaknesses companies to
Barbolina, Maria V.; Adley, Brian P.; Kelly, David L.; Shepard, Jaclyn; Fought, Angela J.; Scholtens, Denise; Penzes, Peter; Shea, Lonnie D.; Sharon Stack, M
2010-01-01
Epithelial ovarian carcinoma (EOC) is a leading cause of death from gynecologic malignancy, due mainly to the prevalence of undetected metastatic disease. The process of cell invasion during intra-peritoneal anchoring of metastatic lesions requires concerted regulation of many processes, including modulation of adhesion to the extracellular matrix and localized invasion. Exploratory cDNA microarray analysis of early response genes (altered after 4 hours of 3-dimensional collagen culture) coupled with confirmatory real-time RT-PCR, multiple three-dimensional cell culture matrices, Western blot, immunostaining, adhesion, migration, and invasion assays were used to identify modulators of adhesion pertinent to EOC progression and metastasis. cDNA microarray analysis indicated a dramatic downregulation of connective tissue growth factor (CTGF) in EOC cells placed in invasion-mimicking conditions (3-dimensional type I collagen). Examination of human EOC specimens revealed that CTGF expression was absent in 46% of the tested samples (n=41), but was present in 100% of normal ovarian epithelium samples (n=7). Reduced CTGF expression occurs in many types of cells and may be a general phenomenon displayed by cells encountering a 3D environment. CTGF levels were inversely correlated with invasion such that downregulation of CTGF increased, while its upregulation reduced, collagen invasion. Cells adhered preferentially to a surface comprised of both collagen I and CTGF relative to either component alone using α6β1 and α3β1 integrins. Together these data suggest that downregulation of CTGF in EOC cells may be important for cell invasion through modulation of cell-matrix adhesion. PMID:19382180
Directory of Open Access Journals (Sweden)
Hadil F Al-Jallad
2011-01-01
Full Text Available Transglutaminase activity, arising potentially from transglutaminase 2 (TG2 and Factor XIIIA (FXIIIA, has been linked to osteoblast differentiation where it is required for type I collagen and fibronectin matrix deposition. In this study we have used an irreversible TG-inhibitor to 'block -and-track' enzyme(s targeted during osteoblast differentiation. We show that the irreversible TG-inhibitor is highly potent in inhibiting osteoblast differentiation and mineralization and reduces secretion of both fibronectin and type I collagen and their release from the cell surface. Tracking of the dansyl probe by Western blotting and immunofluorescence microscopy demonstrated that the inhibitor targets plasma membrane-associated FXIIIA. TG2 appears not to contribute to crosslinking activity on the osteoblast surface. Inhibition of FXIIIA with NC9 resulted in defective secretory vesicle delivery to the plasma membrane which was attributable to a disorganized microtubule network and decreased microtubule association with the plasma membrane. NC9 inhibition of FXIIIA resulted in destabilization of microtubules as assessed by cellular Glu-tubulin levels. Furthermore, NC9 blocked modification of Glu-tubulin into 150 kDa high-molecular weight Glu-tubulin form which was specifically localized to the plasma membrane. FXIIIA enzyme and its crosslinking activity were colocalized with plasma membrane-associated tubulin, and thus, it appears that FXIIIA crosslinking activity is directed towards stabilizing the interaction of microtubules with the plasma membrane. Our work provides the first mechanistic cues as to how transglutaminase activity could affect protein secretion and matrix deposition in osteoblasts and suggests a novel function for plasma membrane FXIIIA in microtubule dynamics.
Zawilla, N H; Darweesh, H; Mansour, N; Helal, S; Taha, F M; Awadallah, M; El Shazly, R
2014-06-01
Lumbar disc degeneration (LDD) is a process that begins early in life, contributing to the development of low back pain. LDD is a consequence of a variety of factors, and its etiology remains poorly understood. Objectives to investigate occupational and genetic risk factors inducing lumbar disc degeneration, and to evaluate the possible association of genetic polymorphisms of matrix metalloproteinase 3 (MMP-3) and vitamin D receptor (VDR) with the severity of LDD in an Egyptian population. A case control study involving 84 LDD and 60 controls was carried out. Five types of work related factors were investigated by questionnaire, complete neurological examination for all subjects and MRI for the cases. Polymerase chain reaction and restriction fragment length polymorphism methods were applied to detect polymorphisms in MMP-3 Promoter (-1,171 6A/5A) (rs 731236) and VDR-Apa (rs 35068180). We found that family history, back injury, smoking, high level of sitting, bending/twisting, physical workload, lifting, whole body vibration, mutant allele 5A of MMP-3 and mutant allele T of VDR were significantly associated with LDD (OR = 2.9, 3.1, 2.1, 11.1, 15.9, 11.7, 8.2, 12.6, 2.5 and 3.1 respectively, p < 0.05). Cases that carry allele 5A and/or allele T were associated with LDD severity. LDD is closely associated in occurrence and severity with occupational, environmental risk factors and susceptibility genes namely MMP-3, and VDR (ApaI). This study throws light on the importance of screening for early detection of susceptible individuals and disease prevention.
Gene Ranking of RNA-Seq Data via Discriminant Non-Negative Matrix Factorization.
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.
Consensus Convolutional Sparse Coding
Choudhury, Biswarup
2017-12-01
Convolutional sparse coding (CSC) is a promising direction for unsupervised learning in computer vision. In contrast to recent supervised methods, CSC allows for convolutional image representations to be learned that are equally useful for high-level vision tasks and low-level image reconstruction and can be applied to a wide range of tasks without problem-specific retraining. Due to their extreme memory requirements, however, existing CSC solvers have so far been limited to low-dimensional problems and datasets using a handful of low-resolution example images at a time. In this paper, we propose a new approach to solving CSC as a consensus optimization problem, which lifts these limitations. By learning CSC features from large-scale image datasets for the first time, we achieve significant quality improvements in a number of imaging tasks. Moreover, the proposed method enables new applications in high-dimensional feature learning that has been intractable using existing CSC methods. This is demonstrated for a variety of reconstruction problems across diverse problem domains, including 3D multispectral demosaicing and 4D light field view synthesis.
Consensus Convolutional Sparse Coding
Choudhury, Biswarup
2017-04-11
Convolutional sparse coding (CSC) is a promising direction for unsupervised learning in computer vision. In contrast to recent supervised methods, CSC allows for convolutional image representations to be learned that are equally useful for high-level vision tasks and low-level image reconstruction and can be applied to a wide range of tasks without problem-specific retraining. Due to their extreme memory requirements, however, existing CSC solvers have so far been limited to low-dimensional problems and datasets using a handful of low-resolution example images at a time. In this paper, we propose a new approach to solving CSC as a consensus optimization problem, which lifts these limitations. By learning CSC features from large-scale image datasets for the first time, we achieve significant quality improvements in a number of imaging tasks. Moreover, the proposed method enables new applications in high dimensional feature learning that has been intractable using existing CSC methods. This is demonstrated for a variety of reconstruction problems across diverse problem domains, including 3D multispectral demosaickingand 4D light field view synthesis.
Consensus Convolutional Sparse Coding
Choudhury, Biswarup; Swanson, Robin; Heide, Felix; Wetzstein, Gordon; Heidrich, Wolfgang
2017-01-01
Convolutional sparse coding (CSC) is a promising direction for unsupervised learning in computer vision. In contrast to recent supervised methods, CSC allows for convolutional image representations to be learned that are equally useful for high-level vision tasks and low-level image reconstruction and can be applied to a wide range of tasks without problem-specific retraining. Due to their extreme memory requirements, however, existing CSC solvers have so far been limited to low-dimensional problems and datasets using a handful of low-resolution example images at a time. In this paper, we propose a new approach to solving CSC as a consensus optimization problem, which lifts these limitations. By learning CSC features from large-scale image datasets for the first time, we achieve significant quality improvements in a number of imaging tasks. Moreover, the proposed method enables new applications in high-dimensional feature learning that has been intractable using existing CSC methods. This is demonstrated for a variety of reconstruction problems across diverse problem domains, including 3D multispectral demosaicing and 4D light field view synthesis.
Balanced and sparse Tamo-Barg codes
Halbawi, Wael; Duursma, Iwan; Dau, Hoang; Hassibi, Babak
2017-01-01
We construct balanced and sparse generator matrices for Tamo and Barg's Locally Recoverable Codes (LRCs). More specifically, for a cyclic Tamo-Barg code of length n, dimension k and locality r, we show how to deterministically construct a generator matrix where the number of nonzeros in any two columns differs by at most one, and where the weight of every row is d + r - 1, where d is the minimum distance of the code. Since LRCs are designed mainly for distributed storage systems, the results presented in this work provide a computationally balanced and efficient encoding scheme for these codes. The balanced property ensures that the computational effort exerted by any storage node is essentially the same, whilst the sparse property ensures that this effort is minimal. The work presented in this paper extends a similar result previously established for Reed-Solomon (RS) codes, where it is now known that any cyclic RS code possesses a generator matrix that is balanced as described, but is sparsest, meaning that each row has d nonzeros.
Balanced and sparse Tamo-Barg codes
Halbawi, Wael
2017-08-29
We construct balanced and sparse generator matrices for Tamo and Barg\\'s Locally Recoverable Codes (LRCs). More specifically, for a cyclic Tamo-Barg code of length n, dimension k and locality r, we show how to deterministically construct a generator matrix where the number of nonzeros in any two columns differs by at most one, and where the weight of every row is d + r - 1, where d is the minimum distance of the code. Since LRCs are designed mainly for distributed storage systems, the results presented in this work provide a computationally balanced and efficient encoding scheme for these codes. The balanced property ensures that the computational effort exerted by any storage node is essentially the same, whilst the sparse property ensures that this effort is minimal. The work presented in this paper extends a similar result previously established for Reed-Solomon (RS) codes, where it is now known that any cyclic RS code possesses a generator matrix that is balanced as described, but is sparsest, meaning that each row has d nonzeros.
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.
Romero, L; Ros, B; Arráez, M A; Ríus, F; González, L; Martín, A; Carrasco, A; Segura, M
2015-10-01
The aim of this study was to analyze risk factors for the development of hydrocephalus in newborn infants with germinal matrix (GM) hemorrhage. The study comprised 271 patients admitted to Carlos Haya University Hospital in Malaga with GM hemorrhage. The following data were recorded: gestational age, gender, twin birth, head circumference at birth, weight at birth, and Papile grade. Severe obstetrical (abruption, chorioamnionitis, pregnancy-induced hypertension, tocolytic treatment) and neonatal disorders (respiratory distress syndrome, neonatal infection, coagulation disorder, patent ductus arteriosus, necrotizing enterocolitis) were also recorded. Symptomatic hydrocephalus was diagnosed in the event of a progressive increase in head circumference and ventricular indices requiring shunting. Of the 271 patients, 139 (51%) developed posthemorrhagic ventriculomegaly; 47 patients (17%) developed symptomatic hydrocephalus and needed shunt implantation. We found a significant relationship between the development of symptomatic hydrocephalus and Papile grade, lower gestational age, lower birth weight, twin birth, and neonatal infection. Awareness of risk factors for the development of hydrocephalus in newborn infants with GM hemorrhage should be emphasized in order to enable an early diagnosis of ventriculomegaly and symptomatic hydrocephalus and thus make a correct therapeutic decision.
Turbulent flows over sparse canopies
Sharma, Akshath; García-Mayoral, Ricardo
2018-04-01
Turbulent flows over sparse and dense canopies exerting a similar drag force on the flow are investigated using Direct Numerical Simulations. The dense canopies are modelled using a homogeneous drag force, while for the sparse canopy, the geometry of the canopy elements is represented. It is found that on using the friction velocity based on the local shear at each height, the streamwise velocity fluctuations and the Reynolds stress within the sparse canopy are similar to those from a comparable smooth-wall case. In addition, when scaled with the local friction velocity, the intensity of the off-wall peak in the streamwise vorticity for sparse canopies also recovers a value similar to a smooth-wall. This indicates that the sparse canopy does not significantly disturb the near-wall turbulence cycle, but causes its rescaling to an intensity consistent with a lower friction velocity within the canopy. In comparison, the dense canopy is found to have a higher damping effect on the turbulent fluctuations. For the case of the sparse canopy, a peak in the spectral energy density of the wall-normal velocity, and Reynolds stress is observed, which may indicate the formation of Kelvin-Helmholtz-like instabilities. It is also found that a sparse canopy is better modelled by a homogeneous drag applied on the mean flow alone, and not the turbulent fluctuations.
Simian, Marina; Hirai, Yohei; Navre, Marc; Werb, Zena; Lochter, Andre; Bissell, Mina J.
2001-01-01
The mammary gland develops its adult form by a process referred to as branching morphogenesis. Many factors have been reported to affect this process. We have used cultured primary mammary epithelial organoids and mammary epithelial cell lines in three-dimensional collagen gels to elucidate which growth factors, matrix metalloproteinases (MMPs) and mammary morphogens interact in branching morphogenesis. Branching stimulated by stromal fibroblasts, epidermal growth factor, fibroblast growth fa...
Sparse Regression by Projection and Sparse Discriminant Analysis
Qi, Xin; Luo, Ruiyan; Carroll, Raymond J.; Zhao, Hongyu
2015-01-01
predictions. We introduce a new framework, regression by projection, and its sparse version to analyze high-dimensional data. The unique nature of this framework is that the directions of the regression coefficients are inferred first, and the lengths
In Defense of Sparse Tracking: Circulant Sparse Tracker
Zhang, Tianzhu; Bibi, Adel Aamer; Ghanem, Bernard
2016-01-01
Sparse representation has been introduced to visual tracking by finding the best target candidate with minimal reconstruction error within the particle filter framework. However, most sparse representation based trackers have high computational cost, less than promising tracking performance, and limited feature representation. To deal with the above issues, we propose a novel circulant sparse tracker (CST), which exploits circulant target templates. Because of the circulant structure property, CST has the following advantages: (1) It can refine and reduce particles using circular shifts of target templates. (2) The optimization can be efficiently solved entirely in the Fourier domain. (3) High dimensional features can be embedded into CST to significantly improve tracking performance without sacrificing much computation time. Both qualitative and quantitative evaluations on challenging benchmark sequences demonstrate that CST performs better than all other sparse trackers and favorably against state-of-the-art methods.
In Defense of Sparse Tracking: Circulant Sparse Tracker
Zhang, Tianzhu
2016-12-13
Sparse representation has been introduced to visual tracking by finding the best target candidate with minimal reconstruction error within the particle filter framework. However, most sparse representation based trackers have high computational cost, less than promising tracking performance, and limited feature representation. To deal with the above issues, we propose a novel circulant sparse tracker (CST), which exploits circulant target templates. Because of the circulant structure property, CST has the following advantages: (1) It can refine and reduce particles using circular shifts of target templates. (2) The optimization can be efficiently solved entirely in the Fourier domain. (3) High dimensional features can be embedded into CST to significantly improve tracking performance without sacrificing much computation time. Both qualitative and quantitative evaluations on challenging benchmark sequences demonstrate that CST performs better than all other sparse trackers and favorably against state-of-the-art methods.
Identification of the sources of PM10 in a subway tunnel using positive matrix factorization.
Park, Duckshin; Lee, Taejeong; Hwang, Doyeon; Jung, Wonseok; Lee, Yongil; Cho, KiChul; Kim, Dongsool; Lees, Kiyoung
2014-12-01
The level of particulate matter of less than 10 μm diameter (PM10) at subway platforms can be significantly reduced by installing a platform screen-door system. However, both workers and passengers might be exposed to higher PM10 levels while the cars are within the tunnel because it is a more confined environment. This study determined the PM10 levels in a subway tunnel, and identified the sources of PM10 using elemental analysis and receptor modeling. Forty-four PM10 samples were collected in the tunnel between the Gireum and Mia stations on Line 4 in metropolitan Seoul and analyzed using inductively coupled plasma-atomic emission spectrometry and ion chromatography. The major PM10 sources were identified using positive matrix factorization (PMF). The average PM10 concentration in the tunnels was 200.8 ± 22.0 μg/m3. Elemental analysis indicated that the PM10 consisted of 40.4% inorganic species, 9.1% anions, 4.9% cations, and 45.6% other materials. Iron was the most abundant element, with an average concentration of 72.5 ± 10.4 μg/m3. The PM10 sources characterized by PMF included rail, wheel, and brake wear (59.6%), soil combustion (17.0%), secondary aerosols (10.0%), electric cable wear (8.1%), and soil and road dust (5.4%). Internal sources comprising rail, wheel, brake, and electric cable wear made the greatest contribution to the PM10 (67.7%) in tunnel air. Implications: With installation of a platform screen door, PM10 levels in subway tunnels were higher than those on platforms. Tunnel PM10 levels exceeded 150 µg/m3 of the Korean standard for subway platform. Elemental analysis of PM10 in a tunnel showed that Fe was the most abundant element. Five PM10 sources in tunnel were identified by positive matrix factorization. Railroad-related sources contributed 68% of PM10 in the subway tunnel.
Directory of Open Access Journals (Sweden)
M. H. Sowlat
2016-04-01
Full Text Available In this study, the positive matrix factorization (PMF receptor model (version 5.0 was used to identify and quantify major sources contributing to particulate matter (PM number concentrations, using PM number size distributions in the range of 13 nm to 10 µm combined with several auxiliary variables, including black carbon (BC, elemental and organic carbon (EC/OC, PM mass concentrations, gaseous pollutants, meteorological, and traffic counts data, collected for about 9 months between August 2014 and 2015 in central Los Angeles, CA. Several parameters, including particle number and volume size distribution profiles, profiles of auxiliary variables, contributions of different factors in different seasons to the total number concentrations, diurnal variations of each of the resolved factors in the cold and warm phases, weekday/weekend analysis for each of the resolved factors, and correlation between auxiliary variables and the relative contribution of each of the resolved factors, were used to identify PM sources. A six-factor solution was identified as the optimum for the aforementioned input data. The resolved factors comprised nucleation, traffic 1, traffic 2 (with a larger mode diameter than traffic 1 factor, urban background aerosol, secondary aerosol, and soil/road dust. Traffic sources (1 and 2 were the major contributor to PM number concentrations, collectively making up to above 60 % (60.8–68.4 % of the total number concentrations during the study period. Their contribution was also significantly higher in the cold phase compared to the warm phase. Nucleation was another major factor significantly contributing to the total number concentrations (an overall contribution of 17 %, ranging from 11.7 to 24 %, with a larger contribution during the warm phase than in the cold phase. The other identified factors were urban background aerosol, secondary aerosol, and soil/road dust, with relative contributions of approximately 12
Ordering sparse matrices for cache-based systems
International Nuclear Information System (INIS)
Biswas, Rupak; Oliker, Leonid
2001-01-01
The Conjugate Gradient (CG) algorithm is the oldest and best-known Krylov subspace method used to solve sparse linear systems. Most of the coating-point operations within each CG iteration is spent performing sparse matrix-vector multiplication (SPMV). We examine how various ordering and partitioning strategies affect the performance of CG and SPMV when different programming paradigms are used on current commercial cache-based computers. However, a multithreaded implementation on the cacheless Cray MTA demonstrates high efficiency and scalability without any special ordering or partitioning
Wen, Y L; Li, L
2015-12-29
The aim of this study was to investigate the correlation between the expression of matrix metalloproteinase-9 (MMP-9) and vascular endothelial growth factor (VEGF) and clinicopathological features of lung adenocarcinoma. The expression of MMP-9 and VEGF was evaluated by immunohistochemistry of 30 samples from lung adenocarcinoma patients and 12 paratumoral (normal) tissue samples. In addition, the change in VEGF or MMP-9 expression after MMP-9 or VEGF blockade, respectively, was measured using western blot in lung adenocarcinoma A549 cells. High expression of MMP-9 was found in 63.3% of adenocarcinoma tissues versus 16.7% in normal tissues (P correlation was identified between MMP-9 and VEGF expression (correlation coefficient = 0.7094, P < 0.001), and their mutual overexpression was associated with clinical staging and lymph node status (P < 0.05). In addition, an decrease in VEGF protein expression was observed after MMP-9 blockade by an MMP-9-specific monoclonal antibody. Similarly, a decrease in MMP-9 protein expression was found after VEGF blockade by a VEGF-specific monoclonal antibody. In conclusion, VEGF and MMP-9 are overexpressed in lung adenocarcinoma tissues, and they have a synergistic effect on the invasion and metastasis of adenocarcinoma.
Source Apportionment of PM10 by Positive Matrix Factorization in Urban Area of Mumbai, India
Directory of Open Access Journals (Sweden)
Indrani Gupta
2012-01-01
Full Text Available Particulate Matter (PM10 has been one of the main air pollutants exceeding the ambient standards in most of the major cities in India. During last few years, receptor models such as Chemical Mass Balance, Positive Matrix Factorization (PMF, PCA–APCS and UNMIX have been used to provide solutions to the source identification and contributions which are accepted for developing effective and efficient air quality management plans. Each site poses different complexities while resolving PM10 contributions. This paper reports the variability of four sites within Mumbai city using PMF. Industrial area of Mahul showed sources such as residual oil combustion and paved road dust (27%, traffic (20%, coal fired boiler (17%, nitrate (15%. Residential area of Khar showed sources such as residual oil combustion and construction (25%, motor vehicles (23%, marine aerosol and nitrate (19%, paved road dust (18% compared to construction and natural dust (27%, motor vehicles and smelting work (25%, nitrate (16% and biomass burning and paved road dust (15% in Dharavi, a low income slum residential area. The major contributors of PM10 at Colaba were marine aerosol, wood burning and ammonium sulphate (24%, motor vehicles and smelting work (22%, Natural soil (19%, nitrate and oil burning (18%.
Luce, R.; Hildebrandt, P.; Kuhlmann, U.; Liesen, J.
2016-09-01
The key challenge of time-resolved Raman spectroscopy is the identification of the constituent species and the analysis of the kinetics of the underlying reaction network. In this work we present an integral approach that allows for determining both the component spectra and the rate constants simultaneously from a series of vibrational spectra. It is based on an algorithm for non-negative matrix factorization which is applied to the experimental data set following a few pre-processing steps. As a prerequisite for physically unambiguous solutions, each component spectrum must include one vibrational band that does not significantly interfere with vibrational bands of other species. The approach is applied to synthetic "experimental" spectra derived from model systems comprising a set of species with component spectra differing with respect to their degree of spectral interferences and signal-to-noise ratios. In each case, the species involved are connected via monomolecular reaction pathways. The potential and limitations of the approach for recovering the respective rate constants and component spectra are discussed.
Wang, Jim Jing-Yan
2014-09-20
Nonnegative matrix factorization (NMF), a popular part-based representation technique, does not capture the intrinsic local geometric structure of the data space. Graph regularized NMF (GNMF) was recently proposed to avoid this limitation by regularizing NMF with a nearest neighbor graph constructed from the input data set. However, GNMF has two main bottlenecks. First, using the original feature space directly to construct the graph is not necessarily optimal because of the noisy and irrelevant features and nonlinear distributions of data samples. Second, one possible way to handle the nonlinear distribution of data samples is by kernel embedding. However, it is often difficult to choose the most suitable kernel. To solve these bottlenecks, we propose two novel graph-regularized NMF methods, AGNMFFS and AGNMFMK, by introducing feature selection and multiple-kernel learning to the graph regularized NMF, respectively. Instead of using a fixed graph as in GNMF, the two proposed methods learn the nearest neighbor graph that is adaptive to the selected features and learned multiple kernels, respectively. For each method, we propose a unified objective function to conduct feature selection/multi-kernel learning, NMF and adaptive graph regularization simultaneously. We further develop two iterative algorithms to solve the two optimization problems. Experimental results on two challenging pattern classification tasks demonstrate that the proposed methods significantly outperform state-of-the-art data representation methods.
Benhalouche, Fatima Zohra; Karoui, Moussa Sofiane; Deville, Yannick; Ouamri, Abdelaziz
2017-04-01
This paper proposes three multisharpening approaches to enhance the spatial resolution of urban hyperspectral remote sensing images. These approaches, related to linear-quadratic spectral unmixing techniques, use a linear-quadratic nonnegative matrix factorization (NMF) multiplicative algorithm. These methods begin by unmixing the observable high-spectral/low-spatial resolution hyperspectral and high-spatial/low-spectral resolution multispectral images. The obtained high-spectral/high-spatial resolution features are then recombined, according to the linear-quadratic mixing model, to obtain an unobservable multisharpened high-spectral/high-spatial resolution hyperspectral image. In the first designed approach, hyperspectral and multispectral variables are independently optimized, once they have been coherently initialized. These variables are alternately updated in the second designed approach. In the third approach, the considered hyperspectral and multispectral variables are jointly updated. Experiments, using synthetic and real data, are conducted to assess the efficiency, in spatial and spectral domains, of the designed approaches and of linear NMF-based approaches from the literature. Experimental results show that the designed methods globally yield very satisfactory spectral and spatial fidelities for the multisharpened hyperspectral data. They also prove that these methods significantly outperform the used literature approaches.
Watanabe, Takanori; Tunc, Birkan; Parker, Drew; Kim, Junghoon; Verma, Ragini
2016-10-01
In this paper, we present a novel method for obtaining a low dimensional representation of a complex brain network that: (1) can be interpreted in a neurobiologically meaningful way, (2) emphasizes group differences by accounting for label information, and (3) captures the variation in disease subtypes/severity by respecting the intrinsic manifold structure underlying the data. Our method is a supervised variant of non-negative matrix factorization (NMF), and achieves dimensionality reduction by extracting an orthogonal set of subnetworks that are interpretable, reconstructive of the original data, and also discriminative at the group level. In addition, the method includes a manifold regularizer that encourages the low dimensional representations to be smooth with respect to the intrinsic geometry of the data, allowing subjects with similar disease-severity to share similar network representations. While the method is generalizable to other types of non-negative network data, in this work we have used structural connectomes (SCs) derived from diffusion data to identify the cortical/subcortical connections that have been disrupted in abnormal neurological state. Experiments on a traumatic brain injury (TBI) dataset demonstrate that our method can identify subnetworks that can reliably classify TBI from controls and also reveal insightful connectivity patterns that may be indicative of a biomarker.
Hessian regularization based non-negative matrix factorization for gene expression data clustering.
Liu, Xiao; Shi, Jun; Wang, Congzhi
2015-01-01
Since a key step in the analysis of gene expression data is to detect groups of genes that have similar expression patterns, clustering technique is then commonly used to analyze gene expression data. Data representation plays an important role in clustering analysis. The non-negative matrix factorization (NMF) is a widely used data representation method with great success in machine learning. Although the traditional manifold regularization method, Laplacian regularization (LR), can improve the performance of NMF, LR still suffers from the problem of its weak extrapolating power. Hessian regularization (HR) is a newly developed manifold regularization method, whose natural properties make it more extrapolating, especially for small sample data. In this work, we propose the HR-based NMF (HR-NMF) algorithm, and then apply it to represent gene expression data for further clustering task. The clustering experiments are conducted on five commonly used gene datasets, and the results indicate that the proposed HR-NMF outperforms LR-based NMM and original NMF, which suggests the potential application of HR-NMF for gene expression data.
A Global Sampling Based Image Matting Using Non-Negative Matrix Factorization
Directory of Open Access Journals (Sweden)
NAVEED ALAM
2017-10-01
Full Text Available Image matting is a technique in which a foreground is separated from the background of a given image along with the pixel wise opacity. This foreground can then be seamlessly composited in a different background to obtain a novel scene. This paper presents a global non-parametric sampling algorithm over image patches and utilizes a dimension reduction technique known as NMF (Non-Negative Matrix Factorization. Although some existing non-parametric approaches use large nearby foreground and background regions to sample patches but these approaches fail to take the whole image to sample patches. It is because of the high memory and computational requirements. The use of NMF in the proposed algorithm allows the dimension reduction which reduces the computational cost and memory requirement. The use of NMF also allow the proposed approach to use the whole foreground and background region in the image and reduces the patch complexity and help in efficient patch sampling. The use of patches not only allows the incorporation of the pixel colour but also the local image structure. The use of local structures in the image is important to estimate a high-quality alpha matte especially in the images which have regions containing high texture. The proposed algorithm is evaluated on the standard data set and obtained results are comparable to the state-of-the-art matting techniques
A global sampling based image matting using non-negative matrix factorization
International Nuclear Information System (INIS)
Alam, N.; Sarim, M.; Shaikh, A.B.
2017-01-01
Image matting is a technique in which a foreground is separated from the background of a given image along with the pixel wise opacity. This foreground can then be seamlessly composited in a different background to obtain a novel scene. This paper presents a global non-parametric sampling algorithm over image patches and utilizes a dimension reduction technique known as NMF (Non-Negative Matrix Factorization). Although some existing non-parametric approaches use large nearby foreground and background regions to sample patches but these approaches fail to take the whole image to sample patches. It is because of the high memory and computational requirements. The use of NMF in the proposed algorithm allows the dimension reduction which reduces the computational cost and memory requirement. The use of NMF also allow the proposed approach to use the whole foreground and background region in the image and reduces the patch complexity and help in efficient patch sampling. The use of patches not only allows the incorporation of the pixel colour but also the local image structure. The use of local structures in the image is important to estimate a high-quality alpha matte especially in the images which have regions containing high texture. The proposed algorithm is evaluated on the standard data set and obtained results are comparable to the state-of-the-art matting techniques. (author)
ARMA Cholesky Factor Models for the Covariance Matrix of Linear Models.
Lee, Keunbaik; Baek, Changryong; Daniels, Michael J
2017-11-01
In longitudinal studies, serial dependence of repeated outcomes must be taken into account to make correct inferences on covariate effects. As such, care must be taken in modeling the covariance matrix. However, estimation of the covariance matrix is challenging because there are many parameters in the matrix and the estimated covariance matrix should be positive definite. To overcomes these limitations, two Cholesky decomposition approaches have been proposed: modified Cholesky decomposition for autoregressive (AR) structure and moving average Cholesky decomposition for moving average (MA) structure, respectively. However, the correlations of repeated outcomes are often not captured parsimoniously using either approach separately. In this paper, we propose a class of flexible, nonstationary, heteroscedastic models that exploits the structure allowed by combining the AR and MA modeling of the covariance matrix that we denote as ARMACD. We analyze a recent lung cancer study to illustrate the power of our proposed methods.
Language Recognition via Sparse Coding
2016-09-08
explanation is that sparse coding can achieve a near-optimal approximation of much complicated nonlinear relationship through local and piecewise linear...training examples, where x(i) ∈ RN is the ith example in the batch. Optionally, X can be normalized and whitened before sparse coding for better result...normalized input vectors are then ZCA- whitened [20]. Em- pirically, we choose ZCA- whitening over PCA- whitening , and there is no dimensionality reduction
Hedberg, Emma; Gidhagen, Lars; Johansson, Christer
Sampling of particles (PM10) was conducted during a one-year period at two rural sites in Central Chile, Quillota and Linares. The samples were analyzed for elemental composition. The data sets have undergone source-receptor analyses in order to estimate the sources and their abundance's in the PM10 size fraction, by using the factor analytical method positive matrix factorization (PMF). The analysis showed that PM10 was dominated by soil resuspension at both sites during the summer months, while during winter traffic dominated the particle mass at Quillota and local wood burning dominated the particle mass at Linares. Two copper smelters impacted the Quillota station, and contributed to 10% and 16% of PM10 as an average during summer and winter, respectively. One smelter impacted Linares by 8% and 19% of PM10 in the summer and winter, respectively. For arsenic the two smelters accounted for 87% of the monitored arsenic levels at Quillota and at Linares one smelter contributed with 72% of the measured mass. In comparison with PMF, the use of a dispersion model tended to overestimate the smelter contribution to arsenic levels at both sites. The robustness of the PMF model was tested by using randomly reduced data sets, where 85%, 70%, 50% and 33% of the samples were included. In this way the ability of the model to reconstruct the sources initially found by the original data set could be tested. On average for all sources the relative standard deviation increased from 7% to 25% for the variables identifying the sources, when decreasing the data set from 85% to 33% of the samples, indicating that the solution initially found was very stable to begin with. But it was also noted that sources due to industrial or combustion processes were more sensitive for the size of the data set, compared to the natural sources as local soil and sea spray sources.
Directory of Open Access Journals (Sweden)
Bisakha Ray
2017-08-01
Full Text Available The amounts and types of available multimodal tumor data are rapidly increasing, and their integration is critical for fully understanding the underlying cancer biology and personalizing treatment. However, the development of methods for effectively integrating multimodal data in a principled manner is lagging behind our ability to generate the data. In this article, we introduce an extension to a multiview nonnegative matrix factorization algorithm (NNMF for dimensionality reduction and integration of heterogeneous data types and compare the predictive modeling performance of the method on unimodal and multimodal data. We also present a comparative evaluation of our novel multiview approach and current data integration methods. Our work provides an efficient method to extend an existing dimensionality reduction method. We report rigorous evaluation of the method on large-scale quantitative protein and phosphoprotein tumor data from the Clinical Proteomic Tumor Analysis Consortium (CPTAC acquired using state-of-the-art liquid chromatography mass spectrometry. Exome sequencing and RNA-Seq data were also available from The Cancer Genome Atlas for the same tumors. For unimodal data, in case of breast cancer, transcript levels were most predictive of estrogen and progesterone receptor status and copy number variation of human epidermal growth factor receptor 2 status. For ovarian and colon cancers, phosphoprotein and protein levels were most predictive of tumor grade and stage and residual tumor, respectively. When multiview NNMF was applied to multimodal data to predict outcomes, the improvement in performance is not overall statistically significant beyond unimodal data, suggesting that proteomics data may contain more predictive information regarding tumor phenotypes than transcript levels, probably due to the fact that proteins are the functional gene products and therefore a more direct measurement of the functional state of the tumor. Here, we
Févotte, Cédric; Bertin, Nancy; Durrieu, Jean-Louis
2009-03-01
This letter presents theoretical, algorithmic, and experimental results about nonnegative matrix factorization (NMF) with the Itakura-Saito (IS) divergence. We describe how IS-NMF is underlaid by a well-defined statistical model of superimposed gaussian components and is equivalent to maximum likelihood estimation of variance parameters. This setting can accommodate regularization constraints on the factors through Bayesian priors. In particular, inverse-gamma and gamma Markov chain priors are considered in this work. Estimation can be carried out using a space-alternating generalized expectation-maximization (SAGE) algorithm; this leads to a novel type of NMF algorithm, whose convergence to a stationary point of the IS cost function is guaranteed. We also discuss the links between the IS divergence and other cost functions used in NMF, in particular, the Euclidean distance and the generalized Kullback-Leibler (KL) divergence. As such, we describe how IS-NMF can also be performed using a gradient multiplicative algorithm (a standard algorithm structure in NMF) whose convergence is observed in practice, though not proven. Finally, we report a furnished experimental comparative study of Euclidean-NMF, KL-NMF, and IS-NMF algorithms applied to the power spectrogram of a short piano sequence recorded in real conditions, with various initializations and model orders. Then we show how IS-NMF can successfully be employed for denoising and upmix (mono to stereo conversion) of an original piece of early jazz music. These experiments indicate that IS-NMF correctly captures the semantics of audio and is better suited to the representation of music signals than NMF with the usual Euclidean and KL costs.
Yu, Hui; Mao, Kui-Tao; Shi, Jian-Yu; Huang, Hua; Chen, Zhi; Dong, Kai; Yiu, Siu-Ming
2018-04-11
Drug-drug interactions (DDIs) always cause unexpected and even adverse drug reactions. It is important to identify DDIs before drugs are used in the market. However, preclinical identification of DDIs requires much money and time. Computational approaches have exhibited their abilities to predict potential DDIs on a large scale by utilizing pre-market drug properties (e.g. chemical structure). Nevertheless, none of them can predict two comprehensive types of DDIs, including enhancive and degressive DDIs, which increases and decreases the behaviors of the interacting drugs respectively. There is a lack of systematic analysis on the structural relationship among known DDIs. Revealing such a relationship is very important, because it is able to help understand how DDIs occur. Both the prediction of comprehensive DDIs and the discovery of structural relationship among them play an important guidance when making a co-prescription. In this work, treating a set of comprehensive DDIs as a signed network, we design a novel model (DDINMF) for the prediction of enhancive and degressive DDIs based on semi-nonnegative matrix factorization. Inspiringly, DDINMF achieves the conventional DDI prediction (AUROC = 0.872 and AUPR = 0.605) and the comprehensive DDI prediction (AUROC = 0.796 and AUPR = 0.579). Compared with two state-of-the-art approaches, DDINMF shows it superiority. Finally, representing DDIs as a binary network and a signed network respectively, an analysis based on NMF reveals crucial knowledge hidden among DDIs. Our approach is able to predict not only conventional binary DDIs but also comprehensive DDIs. More importantly, it reveals several key points about the DDI network: (1) both binary and signed networks show fairly clear clusters, in which both drug degree and the difference between positive degree and negative degree show significant distribution; (2) the drugs having large degrees tend to have a larger difference between positive degree
DEFF Research Database (Denmark)
Alstrøm, Tommy Sonne; Frøhling, Kasper Bayer; Larsen, Jan
2014-01-01
a Bayesian Non-negative Matrix Factorization (NMF) approach to identify locations of target molecules. The proposed method is able to successfully analyze the spectra and extract the target spectrum. A visualization of the loadings of the basis vector is created and the results show a clear SNR enhancement...
International Nuclear Information System (INIS)
Jowzani-Moghaddam, A.
1981-01-01
An integral transport method of calculating the geometrical shadowing factor in multiregion annular cells for infinite closely packed lattices in cylindrical geometry is developed. This analytical method has been programmed in the TPGS code. This method is based upon a consideration of the properties of the integral transport method for a nonuniform body, which together with Bonalumi's approximations allows the determination of the approximate multiregion collision probability matrix for infinite closely packed lattices with sufficient accuracy. The multiregion geometrical shadowing factors have been calculated for variations in fuel pin annular segment rings in a geometry of annular cells. These shadowing factors can then be used in the calculation of neutron transport from one annulus to another in an infinite lattice. The result of this new geometrical shadowing and collision probability matrix are compared with the Dancoff-Ginsburg correction and the probability matrix using constant shadowing on Yankee fuel elements in an infinite lattice. In these cases the Dancoff-Ginsburg correction factor and collision probability matrix using constant shadowing are in difference by at most 6.2% and 6%, respectively
Directory of Open Access Journals (Sweden)
Peng Luo
2017-09-01
Full Text Available Matrix factorization based methods have widely been used in data representation. Among them, Non-negative Matrix Factorization (NMF is a promising technique owing to its psychological and physiological interpretation of spontaneously occurring data. On one hand, although traditional Laplacian regularization can enhance the performance of NMF, it still suffers from the problem of its weak extrapolating ability. On the other hand, standard NMF disregards the discriminative information hidden in the data and cannot guarantee the sparsity of the factor matrices. In this paper, a novel algorithm called ℓ 2 , 1 norm and Hessian Regularized Non-negative Matrix Factorization with Discriminability (ℓ 2 , 1 HNMFD, is developed to overcome the aforementioned problems. In ℓ 2 , 1 HNMFD, Hessian regularization is introduced in the framework of NMF to capture the intrinsic manifold structure of the data. ℓ 2 , 1 norm constraints and approximation orthogonal constraints are added to assure the group sparsity of encoding matrix and characterize the discriminative information of the data simultaneously. To solve the objective function, an efficient optimization scheme is developed to settle it. Our experimental results on five benchmark data sets have demonstrated that ℓ 2 , 1 HNMFD can learn better data representation and provide better clustering results.
Kucharczyk, Mateusz; Kurek, Anna; Detka, Jan; Slusarczyk, Joanna; Papp, Mariusz; Tota, Katarzyna; Basta-Kaim, Agnieszka; Kubera, Marta; Lason, Wladyslaw; Budziszewska, Bogusława
2016-04-01
Stress is generally a beneficial experience that motivates an organism to action to overcome the stressful challenge. In particular situations, when stress becomes chronic might be harmful and devastating. The hypothalamus is a critical coordinator of stress and the metabolic response; therefore, disruptions in this structure may be a significant cause of the hormonal and metabolic disturbances observed in depression. Chronic stress induces adverse changes in the morphology of neural cells that are often associated with a deficiency of neurotrophic factors (NTFs); additionally, many studies indicate that insufficient NTF synthesis may participate in the pathogenesis of depression. The aim of the present study was to determine the expression of the nerve growth factor (NGF) in the hypothalamus of male rats subjected to chronic mild stress (CMS) or to prenatal stress (PS) and to PS in combination with an acute stress event (AS). It has been found that chronic mild stress, but not prenatal stress, acute stress or a combination of PS with AS, decreased the concentration of the mature form of NGF (m-NGF) in the rat hypothalamus. A discrepancy between an increase in the Ngf mRNA and a decrease in the m-NGF levels suggested that chronic mild stress inhibited NGF maturation or enhanced the degradation of this factor. We have shown that NGF degradation in the hypothalamus of rats subjected to chronic mild stress is matrix metalloproteinase-dependent and related to an increase in the active forms of some metalloproteinases (MMP), including MMP2, MMP3, MMP9 and MMP13, while the NGF maturation process does not seem to be changed. We suggested that activated MMP2 and MMP9 potently cleave the mature but not the pro- form of NGF into biologically inactive products, which is the reason for m-NGF decomposition. In turn, the enhanced expression of Ngf in the hypothalamus of these rats is an attempt to overcome the reduced levels of m-NGF. Additionally, the decreased level of m
International Nuclear Information System (INIS)
Ibrahim Ijang; Bohari Yaacob; Nordiana, N.R.
2011-01-01
This study was to investigate effect of neutron activation on the physicochemical properties and in vitro dissolution of sustained-release matrix tablets. The tablets incorporation of Samarium oxide (Sm 2 O 3 ) and were compared before and after irradiation with thermal neutron for 5 minutes at 1.2 x 10 12 neutron cm -2 s -1 . The neutron activation factor did not influence the compression properties of the tablets. The dissolution tests showed that irradiation increased the release of the model drug ketoprofen from the tablets. This effect might be explained by polymer degradation. Incorporation of Sm 2 O 3 in the matrix tablets did not influence the release. (author)
DEFF Research Database (Denmark)
Heinemeier, K M; Bjerrum, S S; Schjerling, P
2013-01-01
Acute kicking exercise induces collagen synthesis in both tendon and muscle in humans, but it is not known if this relates to increased collagen transcription and if other matrix genes are regulated. Young men performed 1 h of one-leg kicking at 67% of max workload. Biopsies were taken from...... the patellar tendon and vastus lateralis muscle of each leg at 2 (n = 10), 6 (n = 11), or 26 h (n = 10) after exercise. Levels of messenger ribonucleic acid mRNA for collagens, noncollagenous matrix proteins, and growth factors were measured with real-time reverse transcription polymerase chain reaction...
Sparse Representation Denoising for Radar High Resolution Range Profiling
Directory of Open Access Journals (Sweden)
Min Li
2014-01-01
Full Text Available Radar high resolution range profile has attracted considerable attention in radar automatic target recognition. In practice, radar return is usually contaminated by noise, which results in profile distortion and recognition performance degradation. To deal with this problem, in this paper, a novel denoising method based on sparse representation is proposed to remove the Gaussian white additive noise. The return is sparsely described in the Fourier redundant dictionary and the denoising problem is described as a sparse representation model. Noise level of the return, which is crucial to the denoising performance but often unknown, is estimated by performing subspace method on the sliding subsequence correlation matrix. Sliding window process enables noise level estimation using only one observation sequence, not only guaranteeing estimation efficiency but also avoiding the influence of profile time-shift sensitivity. Experimental results show that the proposed method can effectively improve the signal-to-noise ratio of the return, leading to a high-quality profile.
P-SPARSLIB: A parallel sparse iterative solution package
Energy Technology Data Exchange (ETDEWEB)
Saad, Y. [Univ. of Minnesota, Minneapolis, MN (United States)
1994-12-31
Iterative methods are gaining popularity in engineering and sciences at a time where the computational environment is changing rapidly. P-SPARSLIB is a project to build a software library for sparse matrix computations on parallel computers. The emphasis is on iterative methods and the use of distributed sparse matrices, an extension of the domain decomposition approach to general sparse matrices. One of the goals of this project is to develop a software package geared towards specific applications. For example, the author will test the performance and usefulness of P-SPARSLIB modules on linear systems arising from CFD applications. Equally important is the goal of portability. In the long run, the author wishes to ensure that this package is portable on a variety of platforms, including SIMD environments and shared memory environments.
Wright, L.; Coddington, O.; Pilewskie, P.
2017-12-01
Hyperspectral instruments are a growing class of Earth observing sensors designed to improve remote sensing capabilities beyond discrete multi-band sensors by providing tens to hundreds of continuous spectral channels. Improved spectral resolution, range and radiometric accuracy allow the collection of large amounts of spectral data, facilitating thorough characterization of both atmospheric and surface properties. We describe the development of an Informed Non-Negative Matrix Factorization (INMF) spectral unmixing method to exploit this spectral information and separate atmospheric and surface signals based on their physical sources. INMF offers marked benefits over other commonly employed techniques including non-negativity, which avoids physically impossible results; and adaptability, which tailors the method to hyperspectral source separation. The INMF algorithm is adapted to separate contributions from physically distinct sources using constraints on spectral and spatial variability, and library spectra to improve the initial guess. Using this INMF algorithm we decompose hyperspectral imagery from the NASA Hyperspectral Imager for the Coastal Ocean (HICO), with a focus on separating surface and atmospheric signal contributions. HICO's coastal ocean focus provides a dataset with a wide range of atmospheric and surface conditions. These include atmospheres with varying aerosol optical thicknesses and cloud cover. HICO images also provide a range of surface conditions including deep ocean regions, with only minor contributions from the ocean surfaces; and more complex shallow coastal regions with contributions from the seafloor or suspended sediments. We provide extensive comparison of INMF decomposition results against independent measurements of physical properties. These include comparison against traditional model-based retrievals of water-leaving, aerosol, and molecular scattering radiances and other satellite products, such as aerosol optical thickness from
Semi-Supervised Half-Quadratic Nonnegative Matrix Factorization for Face Recognition
Alghamdi, Masheal M.
2014-05-01
Face recognition is a challenging problem in computer vision. Difficulties such as slight differences between similar faces of different people, changes in facial expressions, light and illumination condition, and pose variations add extra complications to the face recognition research. Many algorithms are devoted to solving the face recognition problem, among which the family of nonnegative matrix factorization (NMF) algorithms has been widely used as a compact data representation method. Different versions of NMF have been proposed. Wang et al. proposed the graph-based semi-supervised nonnegative learning (S2N2L) algorithm that uses labeled data in constructing intrinsic and penalty graph to enforce separability of labeled data, which leads to a greater discriminating power. Moreover the geometrical structure of labeled and unlabeled data is preserved through using the smoothness assumption by creating a similarity graph that conserves the neighboring information for all labeled and unlabeled data. However, S2N2L is sensitive to light changes, illumination, and partial occlusion. In this thesis, we propose a Semi-Supervised Half-Quadratic NMF (SSHQNMF) algorithm that combines the benefits of S2N2L and the robust NMF by the half- quadratic minimization (HQNMF) algorithm.Our algorithm improves upon the S2N2L algorithm by replacing the Frobenius norm with a robust M-Estimator loss function. A multiplicative update solution for our SSHQNMF algorithmis driven using the half- 4 quadratic (HQ) theory. Extensive experiments on ORL, Yale-A and a subset of the PIE data sets for nine M-estimator loss functions for both SSHQNMF and HQNMF algorithms are investigated, and compared with several state-of-the-art supervised and unsupervised algorithms, along with the original S2N2L algorithm in the context of classification, clustering, and robustness against partial occlusion. The proposed algorithm outperformed the other algorithms. Furthermore, SSHQNMF with Maximum Correntropy
Directory of Open Access Journals (Sweden)
T. Chen
2008-05-01
Full Text Available Source contributions to ambient PM10 (particles with an aerodynamic diameter of 10 μm or less in Beijing, China were determined with positive matrix factorization (PMF based on ambient PM10 composition data including concentrations of organic carbon (OC, elemental carbon (EC, ions and metal elements, which were simultaneously obtained at six sites through January, April, July and October in 2004. Results from PMF indicated that seven major sources of ambient PM10 were urban fugitive dust, crustal soil, coal combustion, secondary sulfate, secondary nitrate, biomass burning with municipal incineration, and vehicle emission, respectively. In paticular, urban fugitive dust and crustal soil as two types of dust sources with similar chemical characteristics were differentiated by PMF. Urban fugitive dust contributed the most, accounting for 34.4% of total PM10 mass on an annual basis, with relatively high contributions in all four months, and even covered 50% in April. It also showed higher contributions in southwestern and southeastern areas than in central urban areas. Coal combustion was found to be the primary contributor in January, showing higher contributions in urban areas than in suburban areas with seasonal variation peaking in winter, which accounted for 15.5% of the annual average PM10 concentration. Secondary sulfate and secondary nitrate combined as the largest contributor to PM10 in July and October, with strong seasonal variation peaking in summer, accounting for 38.8% and 31.5% of the total PM10 mass in July and October, respectively. Biomass burning with municipal incineration contributions were found in all four months and accounted for 9.8% of the annual average PM10 mass concentration, with obviously higher contribution in October than in other months. Incineration sources were probably located in southwestern Beijing. Contribution from vehicle emission accounted for 5.0% and exhibited no significant seasonal variation. In sum
Lu, Na; Li, Tengfei; Pan, Jinjin; Ren, Xiaodong; Feng, Zuren; Miao, Hongyu
2015-05-01
Electroencephalogram (EEG) provides a non-invasive approach to measure the electrical activities of brain neurons and has long been employed for the development of brain-computer interface (BCI). For this purpose, various patterns/features of EEG data need to be extracted and associated with specific events like cue-paced motor imagery. However, this is a challenging task since EEG data are usually non-stationary time series with a low signal-to-noise ratio. In this study, we propose a novel method, called structure constrained semi-nonnegative matrix factorization (SCS-NMF), to extract the key patterns of EEG data in time domain by imposing the mean envelopes of event-related potentials (ERPs) as constraints on the semi-NMF procedure. The proposed method is applicable to general EEG time series, and the extracted temporal features by SCS-NMF can also be combined with other features in frequency domain to improve the performance of motor imagery classification. Real data experiments have been performed using the SCS-NMF approach for motor imagery classification, and the results clearly suggest the superiority of the proposed method. Comparison experiments have also been conducted. The compared methods include ICA, PCA, Semi-NMF, Wavelets, EMD and CSP, which further verified the effectivity of SCS-NMF. The SCS-NMF method could obtain better or competitive performance over the state of the art methods, which provides a novel solution for brain pattern analysis from the perspective of structure constraint. Copyright © 2015 Elsevier Ltd. All rights reserved.
Farsad-Naeimi, Alireza; Alizadeh, Mohammad; Esfahani, Ali; Darvish Aminabad, Esmaeil
2018-04-25
A growing body of evidence indicates that inflammation is associated with tumorigenesis, metastasis and chemotherapeutic resistance in patients with colorectal cancer (CRC). Natural flavonoids are promising agents for inflammation-related tumor progression in patients with CRC. This study aimed to assess the efficacy of flavonoid fisetin supplementation on the inflammatory status and matrix metalloproteinase (MMP) levels in these patients. In this double-blind, randomized placebo-controlled clinical trial, 37 CRC patients undergoing chemotherapy were assigned to receive either 100 mg fisetin (n = 18) or placebo (n = 19) for seven consecutive weeks. The supplementation began one week before chemotherapy and continued until the end of the second chemotherapy cycle. Levels of interleukin (IL)-8, IL-10, high-sensitivity C-reactive protein (hs-CRP), MMP-7, and MMP-9 were measured in plasma using ELISA, before and after the intervention. The trial was registered at http://www.irct.ir (code: IRCT2015110511288N9). The participants were 55.59 ± 15.46 years old with 62.16% being male. After the intervention, the plasma levels of IL-8 and hs-CRP reduced significantly in the fisetin group (p < 0.04 and p < 0.01, respectively). Additionally, fisetin supplementation suppressed the values of MMP-7 levels (p < 0.02). However, significant changes were observed only in IL-8 concentrations in the fisetin group when compared with the placebo group (p < 0.03). The changes in the levels of other metabolic factors were not statistically significant. According to the results, fisetin could improve the inflammatory status in CRC patients, suggesting it as a novel complementary antitumor agent for these patients and warranting further studies.
Fast alternating projected gradient descent algorithms for recovering spectrally sparse signals
Cho, Myung
2016-06-24
We propose fast algorithms that speed up or improve the performance of recovering spectrally sparse signals from un-derdetermined measurements. Our algorithms are based on a non-convex approach of using alternating projected gradient descent for structured matrix recovery. We apply this approach to two formulations of structured matrix recovery: Hankel and Toeplitz mosaic structured matrix, and Hankel structured matrix. Our methods provide better recovery performance, and faster signal recovery than existing algorithms, including atomic norm minimization.
Fast alternating projected gradient descent algorithms for recovering spectrally sparse signals
Cho, Myung; Cai, Jian-Feng; Liu, Suhui; Eldar, Yonina C.; Xu, Weiyu
2016-01-01
We propose fast algorithms that speed up or improve the performance of recovering spectrally sparse signals from un-derdetermined measurements. Our algorithms are based on a non-convex approach of using alternating projected gradient descent for structured matrix recovery. We apply this approach to two formulations of structured matrix recovery: Hankel and Toeplitz mosaic structured matrix, and Hankel structured matrix. Our methods provide better recovery performance, and faster signal recovery than existing algorithms, including atomic norm minimization.
Hoy, Erik P; Mazziotti, David A
2015-08-14
Tensor factorization of the 2-electron integral matrix is a well-known technique for reducing the computational scaling of ab initio electronic structure methods toward that of Hartree-Fock and density functional theories. The simplest factorization that maintains the positive semidefinite character of the 2-electron integral matrix is the Cholesky factorization. In this paper, we introduce a family of positive semidefinite factorizations that generalize the Cholesky factorization. Using an implementation of the factorization within the parametric 2-RDM method [D. A. Mazziotti, Phys. Rev. Lett. 101, 253002 (2008)], we study several inorganic molecules, alkane chains, and potential energy curves and find that this generalized factorization retains the accuracy and size extensivity of the Cholesky factorization, even in the presence of multi-reference correlation. The generalized family of positive semidefinite factorizations has potential applications to low-scaling ab initio electronic structure methods that treat electron correlation with a computational cost approaching that of the Hartree-Fock method or density functional theory.
Energy Technology Data Exchange (ETDEWEB)
Hoy, Erik P.; Mazziotti, David A., E-mail: damazz@uchicago.edu [Department of Chemistry and The James Franck Institute, The University of Chicago, Chicago, Illinois 60637 (United States)
2015-08-14
Tensor factorization of the 2-electron integral matrix is a well-known technique for reducing the computational scaling of ab initio electronic structure methods toward that of Hartree-Fock and density functional theories. The simplest factorization that maintains the positive semidefinite character of the 2-electron integral matrix is the Cholesky factorization. In this paper, we introduce a family of positive semidefinite factorizations that generalize the Cholesky factorization. Using an implementation of the factorization within the parametric 2-RDM method [D. A. Mazziotti, Phys. Rev. Lett. 101, 253002 (2008)], we study several inorganic molecules, alkane chains, and potential energy curves and find that this generalized factorization retains the accuracy and size extensivity of the Cholesky factorization, even in the presence of multi-reference correlation. The generalized family of positive semidefinite factorizations has potential applications to low-scaling ab initio electronic structure methods that treat electron correlation with a computational cost approaching that of the Hartree-Fock method or density functional theory.
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...
Sparse BLIP: BLind Iterative Parallel imaging reconstruction using compressed sensing.
She, Huajun; Chen, Rong-Rong; Liang, Dong; DiBella, Edward V R; Ying, Leslie
2014-02-01
To develop a sensitivity-based parallel imaging reconstruction method to reconstruct iteratively both the coil sensitivities and MR image simultaneously based on their prior information. Parallel magnetic resonance imaging reconstruction problem can be formulated as a multichannel sampling problem where solutions are sought analytically. However, the channel functions given by the coil sensitivities in parallel imaging are not known exactly and the estimation error usually leads to artifacts. In this study, we propose a new reconstruction algorithm, termed Sparse BLind Iterative Parallel, for blind iterative parallel imaging reconstruction using compressed sensing. The proposed algorithm reconstructs both the sensitivity functions and the image simultaneously from undersampled data. It enforces the sparseness constraint in the image as done in compressed sensing, but is different from compressed sensing in that the sensing matrix is unknown and additional constraint is enforced on the sensitivities as well. Both phantom and in vivo imaging experiments were carried out with retrospective undersampling to evaluate the performance of the proposed method. Experiments show improvement in Sparse BLind Iterative Parallel reconstruction when compared with Sparse SENSE, JSENSE, IRGN-TV, and L1-SPIRiT reconstructions with the same number of measurements. The proposed Sparse BLind Iterative Parallel algorithm reduces the reconstruction errors when compared to the state-of-the-art parallel imaging methods. Copyright © 2013 Wiley Periodicals, Inc.
Sparse random matrices: The eigenvalue spectrum revisited
International Nuclear Information System (INIS)
Semerjian, Guilhem; Cugliandolo, Leticia F.
2003-08-01
We revisit the derivation of the density of states of sparse random matrices. We derive a recursion relation that allows one to compute the spectrum of the matrix of incidence for finite trees that determines completely the low concentration limit. Using the iterative scheme introduced by Biroli and Monasson [J. Phys. A 32, L255 (1999)] we find an approximate expression for the density of states expected to hold exactly in the opposite limit of large but finite concentration. The combination of the two methods yields a very simple geometric interpretation of the tails of the spectrum. We test the analytic results with numerical simulations and we suggest an indirect numerical method to explore the tails of the spectrum. (author)
Shearlets and Optimally Sparse Approximations
DEFF Research Database (Denmark)
Kutyniok, Gitta; Lemvig, Jakob; Lim, Wang-Q
2012-01-01
Multivariate functions are typically governed by anisotropic features such as edges in images or shock fronts in solutions of transport-dominated equations. One major goal both for the purpose of compression as well as for an efficient analysis is the provision of optimally sparse approximations...... optimally sparse approximations of this model class in 2D as well as 3D. Even more, in contrast to all other directional representation systems, a theory for compactly supported shearlet frames was derived which moreover also satisfy this optimality benchmark. This chapter shall serve as an introduction...... to and a survey about sparse approximations of cartoon-like images by band-limited and also compactly supported shearlet frames as well as a reference for the state-of-the-art of this research field....
Sparse Representations of Hyperspectral Images
Swanson, Robin J.
2015-01-01
Hyperspectral image data has long been an important tool for many areas of sci- ence. The addition of spectral data yields significant improvements in areas such as object and image classification, chemical and mineral composition detection, and astronomy. Traditional capture methods for hyperspectral data often require each wavelength to be captured individually, or by sacrificing spatial resolution. Recently there have been significant improvements in snapshot hyperspectral captures using, in particular, compressed sensing methods. As we move to a compressed sensing image formation model the need for strong image priors to shape our reconstruction, as well as sparse basis become more important. Here we compare several several methods for representing hyperspectral images including learned three dimensional dictionaries, sparse convolutional coding, and decomposable nonlocal tensor dictionaries. Addi- tionally, we further explore their parameter space to identify which parameters provide the most faithful and sparse representations.
Sparse Representations of Hyperspectral Images
Swanson, Robin J.
2015-11-23
Hyperspectral image data has long been an important tool for many areas of sci- ence. The addition of spectral data yields significant improvements in areas such as object and image classification, chemical and mineral composition detection, and astronomy. Traditional capture methods for hyperspectral data often require each wavelength to be captured individually, or by sacrificing spatial resolution. Recently there have been significant improvements in snapshot hyperspectral captures using, in particular, compressed sensing methods. As we move to a compressed sensing image formation model the need for strong image priors to shape our reconstruction, as well as sparse basis become more important. Here we compare several several methods for representing hyperspectral images including learned three dimensional dictionaries, sparse convolutional coding, and decomposable nonlocal tensor dictionaries. Addi- tionally, we further explore their parameter space to identify which parameters provide the most faithful and sparse representations.
Image understanding using sparse representations
Thiagarajan, Jayaraman J; Turaga, Pavan; Spanias, Andreas
2014-01-01
Image understanding has been playing an increasingly crucial role in several inverse problems and computer vision. Sparse models form an important component in image understanding, since they emulate the activity of neural receptors in the primary visual cortex of the human brain. Sparse methods have been utilized in several learning problems because of their ability to provide parsimonious, interpretable, and efficient models. Exploiting the sparsity of natural signals has led to advances in several application areas including image compression, denoising, inpainting, compressed sensing, blin
NMF-mGPU: non-negative matrix factorization on multi-GPU systems.
Mejía-Roa, Edgardo; Tabas-Madrid, Daniel; Setoain, Javier; García, Carlos; Tirado, Francisco; Pascual-Montano, Alberto
2015-02-13
In the last few years, the Non-negative Matrix Factorization ( NMF ) technique has gained a great interest among the Bioinformatics community, since it is able to extract interpretable parts from high-dimensional datasets. However, the computing time required to process large data matrices may become impractical, even for a parallel application running on a multiprocessors cluster. In this paper, we present NMF-mGPU, an efficient and easy-to-use implementation of the NMF algorithm that takes advantage of the high computing performance delivered by Graphics-Processing Units ( GPUs ). Driven by the ever-growing demands from the video-games industry, graphics cards usually provided in PCs and laptops have evolved from simple graphics-drawing platforms into high-performance programmable systems that can be used as coprocessors for linear-algebra operations. However, these devices may have a limited amount of on-board memory, which is not considered by other NMF implementations on GPU. NMF-mGPU is based on CUDA ( Compute Unified Device Architecture ), the NVIDIA's framework for GPU computing. On devices with low memory available, large input matrices are blockwise transferred from the system's main memory to the GPU's memory, and processed accordingly. In addition, NMF-mGPU has been explicitly optimized for the different CUDA architectures. Finally, platforms with multiple GPUs can be synchronized through MPI ( Message Passing Interface ). In a four-GPU system, this implementation is about 120 times faster than a single conventional processor, and more than four times faster than a single GPU device (i.e., a super-linear speedup). Applications of GPUs in Bioinformatics are getting more and more attention due to their outstanding performance when compared to traditional processors. In addition, their relatively low price represents a highly cost-effective alternative to conventional clusters. In life sciences, this results in an excellent opportunity to facilitate the
Cai, Yun; Gu, Hong; Kenney, Toby
2017-08-31
Learning the structure of microbial communities is critical in understanding the different community structures and functions of microbes in distinct individuals. We view microbial communities as consisting of many subcommunities which are formed by certain groups of microbes functionally dependent on each other. The focus of this paper is on methods for extracting the subcommunities from the data, in particular Non-Negative Matrix Factorization (NMF). Our methods can be applied to both OTU data and functional metagenomic data. We apply the existing unsupervised NMF method and also develop a new supervised NMF method for extracting interpretable information from classification problems. The relevance of the subcommunities identified by NMF is demonstrated by their excellent performance for classification. Through three data examples, we demonstrate how to interpret the features identified by NMF to draw meaningful biological conclusions and discover hitherto unidentified patterns in the data. Comparing whole metagenomes of various mammals, (Muegge et al., Science 332:970-974, 2011), the biosynthesis of macrolides pathway is found in hindgut-fermenting herbivores, but not carnivores. This is consistent with results in veterinary science that macrolides should not be given to non-ruminant herbivores. For time series microbiome data from various body sites (Caporaso et al., Genome Biol 12:50, 2011), a shift in the microbial communities is identified for one individual. The shift occurs at around the same time in the tongue and gut microbiomes, indicating that the shift is a genuine biological trait, rather than an artefact of the method. For whole metagenome data from IBD patients and healthy controls (Qin et al., Nature 464:59-65, 2010), we identify differences in a number of pathways (some known, others new). NMF is a powerful tool for identifying the key features of microbial communities. These identified features can not only be used to perform difficult
Masoumi, Kambiz; Forouzan, Arash; Barzegari, Hassan; Asgari Darian, Ali; Rahim, Fakher; Zohrevandi, Behzad; Nabi, Somayeh
2016-01-01
Traffic accidents are the 8(th) cause of mortality in different countries and are expected to rise to the 3(rd) rank by 2020. Based on the Haddon matrix numerous factors such as environment, host, and agent can affect the severity of traffic-related traumas. Therefore, the present study aimed to evaluate the effective factors in severity of these traumas based on Haddon matrix. In the present 1-month cross-sectional study, all the patients injured in traffic accidents, who were referred to the ED of Imam Khomeini and Golestan Hospitals, Ahvaz, Iran, during March 2013 were evaluated. Based on the Haddon matrix, effective factors in accident occurrence were defined in 3 groups of host, agent, and environment. Demographic data of the patients and data regarding Haddon risk factors were extracted and analyzed using SPSS version 20. 700 injured people with the mean age of 29.66 ± 12.64 years (3-82) were evaluated (92.4% male). Trauma mechanism was car-pedestrian in 308 (44%) of the cases and car-motorcycle in 175 (25%). 610 (87.1%) cases were traffic accidents and 371 (53%) occurred in the time between 2 pm and 8 pm. Violation of speed limit was the most common violation with 570 (81.4%) cases, followed by violation of right-of-way in 57 (8.1%) patients. 59.9% of the severe and critical injuries had occurred on road accidents, while 61.3% of the injuries caused by traffic accidents were mild to moderate (p accidents (p severity of traffic accident-related traumas were age over 50, not using safety tools, and undertaking among host-related factors; insufficient environment safety, road accidents and time between 2 pm and 8 pm among environmental factors; and finally, rollover, car-pedestrian, and motorcycle-pedestrian accidents among the agent factors.
Ploeger, Diana T. A.; van Putten, Sander M.; Koerts, Jasper A.; van Luyn, Marja J. A.; Harmsen, Martin C.
Macrophages are important in inflammation as well as in tissue repair processes. They can be activated by various stimuli and classified into two major groups: M1 (classically activated) or M2 (alternatively activated). Inflammation, angiogenesis and matrix remodeling play a major role in tissue
BJUT at TREC 2015 Microblog Track: Real-Time Filtering Using Non-negative Matrix Factorization
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
High performance matrix inversion based on LU factorization for multicore architectures
Dongarra, Jack; Faverge, Mathieu; Ltaief, Hatem; Luszczek, Piotr R.
2011-01-01
on the available processing units. The reported results from our LU-based matrix inversion implementation significantly outperform the state-of-the-art numerical libraries such as LAPACK (5x), MKL (5x) and ScaLAPACK (2.5x) on a contemporary AMD platform with four
Mixed matrix membranes (MMMs) consisting of ZSM-5 zeolite particles dispersed in silicone rubber exhibited ethanol-water pervaporation permselectivities up to 5 times that of silicone rubber alone and 3 times higher than simple vapor-liquid equilibrium (VLE). A number of conditi...
Matrix metalloproteinase-2 is a consistent prognostic factor in gastric cancer.
Kubben, F.J.G.M.; Sier, C.F.M.; Duijn, W. van; Griffioen, G.; Hanemaaijer, R.; Velde, C.J. van de; Krieken, J.H.J.M. van; Lamers, C.B.H.W.; Verspaget, H.W.
2006-01-01
In a pioneer study, we showed 10 years ago that enhanced tissue levels of the matrix metalloproteinases (MMPs) MMP-2 and MMP-9 in gastric cancers, as determined by zymography, were related with worse overall survival of the patients. To corroborate these observations, we now assessed MMP-2 and MMP-9
Matrix metalloproteinase-2 is a consistent prognostic factor in gastric cancer
Kubben, F.J.G.M.; Sier, C.F.M.; Duijn, W. van; Griffioen, G.; Hanemaaijer, R.; Velde, C.J.H. van de; Krieken, J.H.J.M. van; Lamers, C.B.H.W.; Verspaget, H.W.
2006-01-01
In a pioneer study, we showed 10 years ago that enhanced tissue levels of the matrix metalloproteinases (MMPs) MMP-2 and MMP-9 in gastric cancers, as determined by zymography, were related with worse overall survival of the patients. To corroborate these observations, we now assessed MMP-2 and MMP-9
IgE-mediated basophil tumour necrosis factor alpha induces matrix metalloproteinase-9 from monocytes
DEFF Research Database (Denmark)
Falkencrone, Sidsel; Poulsen, Lars K.; Bindslev-Jensen, Carsten
2013-01-01
IgE-mediated activation of mast cells has been reported to induce the release of tumour necrosis alpha (TNF-α), which may display autocrine effects on these cells by inducing the generation of the tissue remodelling protease matrix metalloproteinase-9 (MMP-9). While mast cells and basophils have...
Wang, Lu; Albera, Laurent; Kachenoura, Amar; Shu, Huazhong; Senhadji, Lotfi
2014-12-01
Semi-symmetric three-way arrays are essential tools in blind source separation (BSS) particularly in independent component analysis (ICA). These arrays can be built by resorting to higher order statistics of the data. The canonical polyadic (CP) decomposition of such semi-symmetric three-way arrays allows us to identify the so-called mixing matrix, which contains the information about the intensities of some latent source signals present in the observation channels. In addition, in many applications, such as the magnetic resonance spectroscopy (MRS), the columns of the mixing matrix are viewed as relative concentrations of the spectra of the chemical components. Therefore, the two loading matrices of the three-way array, which are equal to the mixing matrix, are nonnegative. Most existing CP algorithms handle the symmetry and the nonnegativity separately. Up to now, very few of them consider both the semi-nonnegativity and the semi-symmetry structure of the three-way array. Nevertheless, like all the methods based on line search, trust region strategies, and alternating optimization, they appear to be dependent on initialization, requiring in practice a multi-initialization procedure. In order to overcome this drawback, we propose two new methods, called [InlineEquation not available: see fulltext.] and [InlineEquation not available: see fulltext.], to solve the problem of CP decomposition of semi-nonnegative semi-symmetric three-way arrays. Firstly, we rewrite the constrained optimization problem as an unconstrained one. In fact, the nonnegativity constraint of the two symmetric modes is ensured by means of a square change of variable. Secondly, a Jacobi-like optimization procedure is adopted because of its good convergence property. More precisely, the two new methods use LU and QR matrix factorizations, respectively, which consist in formulating high-dimensional optimization problems into several sequential polynomial and rational subproblems. By using both LU
A Matrix Splitting Method for Composite Function Minimization
Yuan, Ganzhao
2016-12-07
Composite function minimization captures a wide spectrum of applications in both computer vision and machine learning. It includes bound constrained optimization and cardinality regularized optimization as special cases. This paper proposes and analyzes a new Matrix Splitting Method (MSM) for minimizing composite functions. It can be viewed as a generalization of the classical Gauss-Seidel method and the Successive Over-Relaxation method for solving linear systems in the literature. Incorporating a new Gaussian elimination procedure, the matrix splitting method achieves state-of-the-art performance. For convex problems, we establish the global convergence, convergence rate, and iteration complexity of MSM, while for non-convex problems, we prove its global convergence. Finally, we validate the performance of our matrix splitting method on two particular applications: nonnegative matrix factorization and cardinality regularized sparse coding. Extensive experiments show that our method outperforms existing composite function minimization techniques in term of both efficiency and efficacy.
A Matrix Splitting Method for Composite Function Minimization
Yuan, Ganzhao; Zheng, Wei-Shi; Ghanem, Bernard
2016-01-01
Composite function minimization captures a wide spectrum of applications in both computer vision and machine learning. It includes bound constrained optimization and cardinality regularized optimization as special cases. This paper proposes and analyzes a new Matrix Splitting Method (MSM) for minimizing composite functions. It can be viewed as a generalization of the classical Gauss-Seidel method and the Successive Over-Relaxation method for solving linear systems in the literature. Incorporating a new Gaussian elimination procedure, the matrix splitting method achieves state-of-the-art performance. For convex problems, we establish the global convergence, convergence rate, and iteration complexity of MSM, while for non-convex problems, we prove its global convergence. Finally, we validate the performance of our matrix splitting method on two particular applications: nonnegative matrix factorization and cardinality regularized sparse coding. Extensive experiments show that our method outperforms existing composite function minimization techniques in term of both efficiency and efficacy.
High-SNR spectrum measurement based on Hadamard encoding and sparse reconstruction
Wang, Zhaoxin; Yue, Jiang; Han, Jing; Li, Long; Jin, Yong; Gao, Yuan; Li, Baoming
2017-12-01
The denoising capabilities of the H-matrix and cyclic S-matrix based on the sparse reconstruction, employed in the Pixel of Focal Plane Coded Visible Spectrometer for spectrum measurement are investigated, where the spectrum is sparse in a known basis. In the measurement process, the digital micromirror device plays an important role, which implements the Hadamard coding. In contrast with Hadamard transform spectrometry, based on the shift invariability, this spectrometer may have the advantage of a high efficiency. Simulations and experiments show that the nonlinear solution with a sparse reconstruction has a better signal-to-noise ratio than the linear solution and the H-matrix outperforms the cyclic S-matrix whether the reconstruction method is nonlinear or linear.
A FPC-ROOT Algorithm for 2D-DOA Estimation in Sparse Array
Directory of Open Access Journals (Sweden)
Wenhao Zeng
2016-01-01
Full Text Available To improve the performance of two-dimensional direction-of-arrival (2D DOA estimation in sparse array, this paper presents a Fixed Point Continuation Polynomial Roots (FPC-ROOT algorithm. Firstly, a signal model for DOA estimation is established based on matrix completion and it can be proved that the proposed model meets Null Space Property (NSP. Secondly, left and right singular vectors of received signals matrix are achieved using the matrix completion algorithm. Finally, 2D DOA estimation can be acquired through solving the polynomial roots. The proposed algorithm can achieve high accuracy of 2D DOA estimation in sparse array, without solving autocorrelation matrix of received signals and scanning of two-dimensional spectral peak. Besides, it decreases the number of antennas and lowers computational complexity and meanwhile avoids the angle ambiguity problem. Computer simulations demonstrate that the proposed FPC-ROOT algorithm can obtain the 2D DOA estimation precisely in sparse array.
Solving sparse linear least squares problems on some supercomputers by using large dense blocks
DEFF Research Database (Denmark)
Hansen, Per Christian; Ostromsky, T; Sameh, A
1997-01-01
technique is preferable to sparse matrix technique when the matrices are not large, because the high computational speed compensates fully the disadvantages of using more arithmetic operations and more storage. For very large matrices the computations must be organized as a sequence of tasks in each......Efficient subroutines for dense matrix computations have recently been developed and are available on many high-speed computers. On some computers the speed of many dense matrix operations is near to the peak-performance. For sparse matrices storage and operations can be saved by operating only...... and storing only nonzero elements. However, the price is a great degradation of the speed of computations on supercomputers (due to the use of indirect addresses, to the need to insert new nonzeros in the sparse storage scheme, to the lack of data locality, etc.). On many high-speed computers a dense matrix...
Sparse modeling of spatial environmental variables associated with asthma.
Chang, Timothy S; Gangnon, Ronald E; David Page, C; Buckingham, William R; Tandias, Aman; Cowan, Kelly J; Tomasallo, Carrie D; Arndt, Brian G; Hanrahan, Lawrence P; Guilbert, Theresa W
2015-02-01
Geographically distributed environmental factors influence the burden of diseases such as asthma. Our objective was to identify sparse environmental variables associated with asthma diagnosis gathered from a large electronic health record (EHR) dataset while controlling for spatial variation. An EHR dataset from the University of Wisconsin's Family Medicine, Internal Medicine and Pediatrics Departments was obtained for 199,220 patients aged 5-50years over a three-year period. Each patient's home address was geocoded to one of 3456 geographic census block groups. Over one thousand block group variables were obtained from a commercial database. We developed a Sparse Spatial Environmental Analysis (SASEA). Using this method, the environmental variables were first dimensionally reduced with sparse principal component analysis. Logistic thin plate regression spline modeling was then used to identify block group variables associated with asthma from sparse principal components. The addresses of patients from the EHR dataset were distributed throughout the majority of Wisconsin's geography. Logistic thin plate regression spline modeling captured spatial variation of asthma. Four sparse principal components identified via model selection consisted of food at home, dog ownership, household size, and disposable income variables. In rural areas, dog ownership and renter occupied housing units from significant sparse principal components were associated with asthma. Our main contribution is the incorporation of sparsity in spatial modeling. SASEA sequentially added sparse principal components to Logistic thin plate regression spline modeling. This method allowed association of geographically distributed environmental factors with asthma using EHR and environmental datasets. SASEA can be applied to other diseases with environmental risk factors. Copyright © 2014 Elsevier Inc. All rights reserved.
Link predication based on matrix factorization by fusion of multi class organizations of the network
Jiao, Pengfei; Cai, Fei; Feng, Yiding; Wang, Wenjun
2017-01-01
Link predication aims at forecasting the latent or unobserved edges in the complex networks and has a wide range of applications in reality. Almost existing methods and models only take advantage of one class organization of the networks, which always lose important information hidden in other organizations of the network. In this paper, we propose a link predication framework which makes the best of the structure of networks in different level of organizations based on nonnegative matrix fac...
Sparse Regression by Projection and Sparse Discriminant Analysis
Qi, Xin
2015-04-03
© 2015, © American Statistical Association, Institute of Mathematical Statistics, and Interface Foundation of North America. Recent years have seen active developments of various penalized regression methods, such as LASSO and elastic net, to analyze high-dimensional data. In these approaches, the direction and length of the regression coefficients are determined simultaneously. Due to the introduction of penalties, the length of the estimates can be far from being optimal for accurate predictions. We introduce a new framework, regression by projection, and its sparse version to analyze high-dimensional data. The unique nature of this framework is that the directions of the regression coefficients are inferred first, and the lengths and the tuning parameters are determined by a cross-validation procedure to achieve the largest prediction accuracy. We provide a theoretical result for simultaneous model selection consistency and parameter estimation consistency of our method in high dimension. This new framework is then generalized such that it can be applied to principal components analysis, partial least squares, and canonical correlation analysis. We also adapt this framework for discriminant analysis. Compared with the existing methods, where there is relatively little control of the dependency among the sparse components, our method can control the relationships among the components. We present efficient algorithms and related theory for solving the sparse regression by projection problem. Based on extensive simulations and real data analysis, we demonstrate that our method achieves good predictive performance and variable selection in the regression setting, and the ability to control relationships between the sparse components leads to more accurate classification. In supplementary materials available online, the details of the algorithms and theoretical proofs, and R codes for all simulation studies are provided.
International Nuclear Information System (INIS)
Pilipchuk, L. A.; Pilipchuk, A. S.
2015-01-01
In this paper we propose the theory of decomposition, methods, technologies, applications and implementation in Wol-fram Mathematica for the constructing the solutions of the sparse linear systems. One of the applications is the Sensor Location Problem for the symmetric graph in the case when split ratios of some arc flows can be zeros. The objective of that application is to minimize the number of sensors that are assigned to the nodes. We obtain a sparse system of linear algebraic equations and research its matrix rank. Sparse systems of these types appear in generalized network flow programming problems in the form of restrictions and can be characterized as systems with a large sparse sub-matrix representing the embedded network structure
The application of sparse linear prediction dictionary to compressive sensing in speech signals
Directory of Open Access Journals (Sweden)
YOU Hanxu
2016-04-01
Full Text Available Appling compressive sensing (CS,which theoretically guarantees that signal sampling and signal compression can be achieved simultaneously,into audio and speech signal processing is one of the most popular research topics in recent years.In this paper,K-SVD algorithm was employed to learn a sparse linear prediction dictionary regarding as the sparse basis of underlying speech signals.Compressed signals was obtained by applying random Gaussian matrix to sample original speech frames.Orthogonal matching pursuit (OMP and compressive sampling matching pursuit (CoSaMP were adopted to recovery original signals from compressed one.Numbers of experiments were carried out to investigate the impact of speech frames length,compression ratios,sparse basis and reconstruction algorithms on CS performance.Results show that sparse linear prediction dictionary can advance the performance of speech signals reconstruction compared with discrete cosine transform (DCT matrix.
Energy Technology Data Exchange (ETDEWEB)
Pilipchuk, L. A., E-mail: pilipchik@bsu.by [Belarussian State University, 220030 Minsk, 4, Nezavisimosti avenue, Republic of Belarus (Belarus); Pilipchuk, A. S., E-mail: an.pilipchuk@gmail.com [The Natural Resources and Environmental Protestion Ministry of the Republic of Belarus, 220004 Minsk, 10 Kollektornaya Street, Republic of Belarus (Belarus)
2015-11-30
In this paper we propose the theory of decomposition, methods, technologies, applications and implementation in Wol-fram Mathematica for the constructing the solutions of the sparse linear systems. One of the applications is the Sensor Location Problem for the symmetric graph in the case when split ratios of some arc flows can be zeros. The objective of that application is to minimize the number of sensors that are assigned to the nodes. We obtain a sparse system of linear algebraic equations and research its matrix rank. Sparse systems of these types appear in generalized network flow programming problems in the form of restrictions and can be characterized as systems with a large sparse sub-matrix representing the embedded network structure.
Stone, Austin V.; Loeser, Richard F.; Vanderman, Kadie S.; Long, David L.; Clark, Stephanie C.; Ferguson, Cristin M.
2014-01-01
Objective Meniscus injury increases the risk of osteoarthritis; however, the biologic mechanism remains unknown. We hypothesized that pro-inflammatory stimulation of meniscus would increase production of matrix-degrading enzymes, cytokines and chemokines which cause joint tissue destruction and could contribute to osteoarthritis development. Design Meniscus and cartilage tissue from healthy tissue donors and total knee arthroplasties was cultured. Primary cell cultures were stimulated with pro-inflammatory factors [IL-1β, IL-6, or fibronectin fragments (FnF)] and cellular responses were analyzed by real-time PCR, protein arrays and immunoblots. To determine if NF-κB was required for MMP production, meniscus cultures were treated with inflammatory factors with and without the NF-κB inhibitor, hypoestoxide. Results Normal and osteoarthritic meniscus cells increased their MMP secretion in response to stimulation, but specific patterns emerged that were unique to each stimulus with the greatest number of MMPs expressed in response to FnF. Meniscus collagen and connective tissue growth factor gene expression was reduced. Expression of cytokines (IL-1α, IL-1β, IL-6), chemokines (IL-8, CXCL1, CXCL2, CSF1) and components of the NF-κB and tumor necrosis factor (TNF) family were significantly increased. Cytokine and chemokine protein production was also increased by stimulation. When primary cell cultures were treated with hypoestoxide in conjunction with pro-inflammatory stimulation, p65 activation was reduced as were MMP-1 and MMP-3 production. Conclusions Pro-inflammatory stimulation of meniscus cells increased matrix metalloproteinase production and catabolic gene expression. The meniscus could have an active biologic role in osteoarthritis development following joint injury through increased production of cytokines, chemokines, and matrix-degrading enzymes. PMID:24315792
Penerapan Sparse Matrix pada Rekomendasi Berita Personal untuk Pengguna Anonim
Mulki, Rizqi
2015-01-01
Online news links are being spread through the social media by news agencies in order to encourage people to read news from their site. After users have logged in to their site, users will keep on reading news that is relevant to their personalized news recommendation. But, nowadays personalized recommendation could be provided to users only if the site has recorded much of users browsing history and it‟s mandatory that users have to log in to the site. This could be problematic if the news r...
A Computing Platform for Parallel Sparse Matrix Computations
2016-01-05
REPORT NUMBER 19a. NAME OF RESPONSIBLE PERSON 19b. TELEPHONE NUMBER Ahmed Sameh Ahmed H. Sameh, Alicia Klinvex, Yao Zhu 611103 c. THIS PAGE The...PERCENT_SUPPORTEDNAME FTE Equivalent: Total Number: Discipline Yao Zhu 0.50 Alicia Klinvex 0.10 0.60 2 Names of Post Doctorates Names of Faculty Supported...PERCENT_SUPPORTEDNAME FTE Equivalent: Total Number: NAME Total Number: NAME Total Number: Yao Zhu Alicia Klinvex 2 ...... ...... Sub Contractors (DD882) Names of other
A parton shower based on factorization of the quantum density matrix
Nagy, Zoltan; Soper, Davison E.
2014-01-01
We present first results from a new parton shower event generator, D eductor . Anticipating a need for an improved treatment of parton color and spin, the structure of the generator is based on the quantum density matrix in color and spin space. So far, D eductor implements only a standard spin-averaged treatment of spin in parton splittings. Although D eductor implements an improved treatment of color, in this paper we present results in the standard leading color approximation so that we ca...
Remembrance of Dead Cells Past: Discovering That the Extracellular Matrix Is a Cell Survival Factor
Schwartz, Martin A.
2010-01-01
In 1992, Jere Meredith and I followed up on a serendipitous observation and showed that matrix deprivation can lead to apoptosis. Our article in Molecular Biology of the Cell, together with work form Steve Frisch's lab, helped establish the paradigm that integrin signals control cell survival in a variety of systems. It has been a pleasure to watch that work take on a life of its own as other investigators have explored its role in processes such as cavitation, regression of the mammary gland...
A parton shower based on factorization of the quantum density matrix
International Nuclear Information System (INIS)
Nagy, Zoltan; Soper, Davison E.
2014-01-01
We present rst results from a new parton shower event generator, DEDUCTOR. Anticipating a need for an improved treatment of parton color and spin, the structure of the generator is based on the quantum density matrix in color and spin space. So far, DEDUCTOR implements only a standard spin-averaged treatment of spin in parton splittings. Although DEDUCTOR implements an improved treatment of color, in this paper we present results in the standard leading color approximation so that we can compare to the generator PYTHIA. The algorithms used incorporate a virtuality based shower ordering parameter and massive initial state bottom and charm quarks.
Solving symmetric-definite quadratic lambda-matrix problems without factorization
International Nuclear Information System (INIS)
Scott, D.S.; Ward, R.C.
1982-01-01
Algorithms are presented for computing some of the eigenvalues and their associated eigenvectors of the quadratic lambda-matrix M lambda 2 C lambda + K. M, C, and K are assumed to have special symmetry-type properties which insure that theory analogous to the standard symmetric eigenproblem exists. The algorithms are based on a generalization of the Rayleigh quotient and the Lanczos method for computing eigenpairs of standard symmetric eigenproblems. Monotone quadratic convergence of the basic method is proved. Test examples are presented
Directory of Open Access Journals (Sweden)
Kambiz Masoumi
2016-04-01
Full Text Available Introduction: Traffic accidents are the 8th cause of mortality in different countries and are expected to rise to the 3rd rank by 2020. Based on the Haddon matrix numerous factors such as environment, host, and agent can affect the severity of traffic-related traumas. Therefore, the present study aimed to evaluate the effective factors in severity of these traumas based on Haddon matrix. Methods: In the present 1-month cross-sectional study, all the patients injured in traffic accidents, who were referred to the ED of Imam Khomeini and Golestan Hospitals, Ahvaz, Iran, during March 2013 were evaluated. Based on the Haddon matrix, effective factors in accident occurrence were defined in 3 groups of host, agent, and environment. Demographic data of the patients and data regarding Haddon risk factors were extracted and analyzed using SPSS version 20. Results: 700 injured people with the mean age of 29.66 ± 12.64 years (3-82 were evaluated (92.4% male. Trauma mechanism was car-pedestrian in 308 (44% of the cases and car-motorcycle in 175 (25%. 610 (87.1% cases were traffic accidents and 371 (53% occurred in the time between 2 pm and 8 pm. Violation of speed limit was the most common violation with 570 (81.4% cases, followed by violation of right-of-way in 57 (8.1% patients. 59.9% of the severe and critical injuries had occurred on road accidents, while 61.3% of the injuries caused by traffic accidents were mild to moderate (p < 0.001. The most common mechanisms of trauma for critical injuries were rollover (72.5%, motorcycle-pedestrian (23.8%, and car-motorcycle (13.14% accidents (p < 0.001. Conclusion: Based on the results of the present study, the most important effective factors in severity of traffic accident-related traumas were age over 50, not using safety tools, and undertaking among host-related factors; insufficient environment safety, road accidents and time between 2 pm and 8 pm among environmental factors; and finally, rollover, car
Non-adiabatic quantum evolution: The S matrix as a geometrical phase factor
Energy Technology Data Exchange (ETDEWEB)
Saadi, Y., E-mail: S_yahiadz@yahoo.fr [Laboratoire de Physique Quantique et Systèmes Dynamiques, Faculté des Sciences, Université Ferhat Abbas de Sétif, Sétif 19000 (Algeria); Maamache, M. [Laboratoire de Physique Quantique et Systèmes Dynamiques, Faculté des Sciences, Université Ferhat Abbas de Sétif, Sétif 19000 (Algeria)
2012-03-19
We present a complete derivation of the exact evolution of quantum mechanics for the case when the underlying spectrum is continuous. We base our discussion on the use of the Weyl eigendifferentials. We show that a quantum system being in an eigenstate of an invariant will remain in the subspace generated by the eigenstates of the invariant, thereby acquiring a generalized non-adiabatic or Aharonov–Anandan geometric phase linked to the diagonal element of the S matrix. The modified Pöschl–Teller potential and the time-dependent linear potential are worked out as illustrations. -- Highlights: ► In this Letter we study the exact quantum evolution for continuous spectra problems. ► We base our discussion on the use of the Weyl eigendifferentials. ► We give a generalized Lewis and Riesenfeld phase for continuous spectra. ► This generalized phase or Aharonov–Anandan geometric phase is linked to the S matrix. ► The modified Pöschl–Teller and the linear potential are worked out as illustrations.
Low-rank sparse learning for robust visual tracking
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.
DEFF Research Database (Denmark)
Mørup, Morten; Hansen, Lars Kai; Parnas, Josef
2006-01-01
We demonstrate how non-negative matrix factorization (NMF) can be used to decompose the inter trial phase coherence (ITPC) of multi-channel EEG to yield a unique decomposition of time-frequency signatures present in various degrees in the recording channels. The NMF optimization is easily...... generalized to a parallel factor (PARAFAC) model to form a non-negative multi-way factorization (NMWF). While the NMF can examine subject specific activities the NMWF can effectively extract the most similar activities across subjects and or conditions. The methods are tested on a proprioceptive stimulus...... consisting of a weight change in a handheld load. While somatosensory gamma oscillations have previously only been evoked by electrical stimuli we hypothesized that a natural proprioceptive stimulus also would be able to evoke gamma oscillations. ITPC maxima were determined by visual inspection...
Directory of Open Access Journals (Sweden)
Kicošev Vesna
2015-01-01
Full Text Available Salt steppes and marshes represent the most valuable ecosystems in the world, providing numerous ecosystem services that are extremely vulnerable to anthropogenic influences. These types of habitat in the territory of Serbia are most dominant in Banat and a significant portion of them is under protection or in the process of becoming protected. The section surrounding the protected areas of Slano Kopovo Special Nature Reserve, Rusanda Nature Park and Okanj Bara Special Nature Reserve with the non-building area of Novi Bečej, Kumane, Melenci, Elemir and Taraš cadastral municipalities, has been chosen for the analysis. The aim of this paper was to assess the influence of specific anthropogenic factors on the elements of an ecological network using the analytical method that can generate the required results in a manner suitable for presentation to various stakeholders. To achieve this aim, the Leopold matrix model, used for assessing anthropogenic influence on the environment, has been chosen. The specificity of this issue of protecting and preserving elements of an ecological network resulted in the need to isolate and evaluate the factors affecting the preservation of habitats and functionality of ecosystems, unlike the concept of Leopold matrix, which treats all factors as equally important in the process of evaluation. Evaluation results indicate significant effects of historical, perennial manner of using the area and other resources in the non-building area.
DEFF Research Database (Denmark)
Seredynska-Sobecka, Bozena; Stedmon, Colin; Boe-Hansen, Rasmus
2011-01-01
Fluorescence Excitation–Emission Matrix spectroscopy combined with parallel factor analysis was employed to monitor water quality and organic contamination in swimming pools. The fluorescence signal of the swimming pool organic matter was low but increased slightly through the day. The analysis...... revealed that the organic matter fluorescence was characterised by five different components, one of which was unique to swimming pool organic matter and one which was specific to organic contamination. The latter component had emission peaks at 420nm and was found to be a sensitive indicator of organic...... loading in swimming pool water. The fluorescence at 420nm gradually increased during opening hours and represented material accumulating through the day....
Energy Technology Data Exchange (ETDEWEB)
Simian, M.; Harail, Y.; Navre, M.; Werb, Z.; Lochter, A.; Bissell, M.J.
2002-03-06
The mammary gland develops its adult form by a process referred to as branching morphogenesis. Many factors have been reported to affect this process. We have used cultured primary mammary epithelial organoids and mammary epithelial cell lines in three-dimensional collagen gels to elucidate which growth factors, matrix metalloproteinases (MMPs) and mammary morphogens interact in branching morphogenesis. Branching stimulated by stromal fibroblasts, epidermal growth factor, fibroblast growth factor 7, fibroblast growth factor 2 and hepatocyte growth factor was strongly reduced by inhibitors of MMPs, indicating the requirement of MMPs for three-dimensional growth involved in morphogenesis. Recombinant stromelysin 1/MMP-3 alone was sufficient to drive branching in the absence of growth factors in the organoids. Plasmin also stimulated branching; however, plasmin-dependent branching was abolished by both inhibitors of plasmin and MMPs, suggesting that plasmin activates MMPs. To differentiate between signals for proliferation and morphogenesis, we used a cloned mammary epithelial cell line that lacks epimorphin, an essential mammary morphogen. Both epimorphin and MMPs were required for morphogenesis, but neither was required for epithelial cell proliferation. These results provide direct evidence for a critical role of MMPs in branching in mammary epithelium and suggest that, in addition to epimorphin, MMP activity is a minimum requirement for branching morphogenesis in the mammary gland.
International Nuclear Information System (INIS)
Simian, Marina; Hirai, Yohei; Navre, Marc; Werb, Zena; Lochter, Andre; Bissell, Mina J.
2002-01-01
The mammary gland develops its adult form by a process referred to as branching morphogenesis. Many factors have been reported to affect this process. We have used cultured primary mammary epithelial organoids and mammary epithelial cell lines in three-dimensional collagen gels to elucidate which growth factors, matrix metalloproteinases (MMPs) and mammary morphogens interact in branching morphogenesis. Branching stimulated by stromal fibroblasts, epidermal growth factor, fibroblast growth factor 7, fibroblast growth factor 2 and hepatocyte growth factor was strongly reduced by inhibitors of MMPs, indicating the requirement of MMPs for three-dimensional growth involved in morphogenesis. Recombinant stromelysin 1/MMP-3 alone was sufficient to drive branching in the absence of growth factors in the organoids. Plasmin also stimulated branching; however, plasmin-dependent branching was abolished by both inhibitors of plasmin and MMPs, suggesting that plasmin activates MMPs. To differentiate between signals for proliferation and morphogenesis, we used a cloned mammary epithelial cell line that lacks epimorphin, an essential mammary morphogen. Both epimorphin and MMPs were required for morphogenesis, but neither was required for epithelial cell proliferation. These results provide direct evidence for a critical role of MMPs in branching in mammary epithelium and suggest that, in addition to epimorphin, MMP activity is a minimum requirement for branching morphogenesis in the mammary gland
Directory of Open Access Journals (Sweden)
Gladys P. Arango
1997-01-01
Full Text Available Con el propósito de facilitar el diagnóstico clínico de la hemorragia de la matriz germinal del prematuro, se diseñó un estudio de casos (n: 56 y controles (n: 66 para determinar los factores de riesgo de la madre y del niño; también se buscó asociación entre dichos factores y la gravedad del evento. No se halló relación entre los factores de riesgo maternos y la presencia o gravedad de la hemorragia. En cuanto a los niños, la edad gestacional menor de 31 semanas, el uso de ventilación mecánica y la persistencia del ductus arterioso mostraron una relación estadística con el evento (p < 0.05, mientras que la sumatoria de tres o más riesgos la tuvo con la gravedad del mismo (p < 0.05. Se concluye que los mencionados factores de riesgo pueden ser indicativos del desarrollo de la hemorragia de la matriz germinal en el prematuro. To facilitate clinical diagnosis of germinal matrix hemorrhage In preterm infants, a study of cases {n: 56 and controls {n: 66 was carried out. Association was investigated between hemorrhage and maternal and neonatal risk factors; also included was the correlation between such factors and seriousness of the hemorrhagic episode. No correlation was found between maternal risk factors and hemorrhage or its seriousness. Concerning neonatal risks, gestational age under 31 weeks, the use of mechanical ventilation and persistence of ductus arteriosus, independently, showed statistical correlation with the hemorrhage {p < 0.05, whereas the simultaneous presence of three or more risks correlated with intensity of hemorrhage {p < 0.05. We conclude that the abovementioned neonatal risk factors can be suggestive of the development of germinal matrix hemorrhage in preterm Infants.
Natural gas in Brazil's energy matrix: demand for 1995-2010 and usage factors
International Nuclear Information System (INIS)
Fernandes, Elton; Fonseca, Marcus Vinicius de A; Alonso, P.S.R.
2005-01-01
This paper describes and analyzes the constraints hampering achievement of the 12% share planned for natural gas in Brazil's energy matrix by 2010, and advises policies for reaching that goal on the basis of forecasts and three probable scenarios for the development of the Brazilian economy. The 12% share goal was established in 1993 by the Ministry of Mines and Energy and confirmed in 2000, and is now in full development. The figures used to represent the estimates of natural gas demands in the three scenarios were obtained from the Integrated Energy Planning Model (MIPE--Modelo Integrado de Planejamento Energetico), which is a technical and economic forecasting model developed by a group of researchers linked to the Energy Planning Program run by the Graduate Engineering Programs Coordination Unit at the Rio de Janeiro Federal University (COPPE-UFRJ) under the sponsorship of Petrobras (a Brazilian enterprise operating in the oil and gas segment) and Eletrobras (a Brazilian enterprise in charge of electricity demand planning). The analysis of the constraints take place under the aegis of the objective proposed by the Brazilian Government. The authors suggest specific actions to be taken in four application areas of natural gas: industrial, electric power generation, domestic distribution and vehicular fleet conversions. All the actions proposed encourage the use of a fuel with low environmental impacts and high calorie power, replacing firewood and other polluting fuels and are evaluated relative to the impacts occurring in society, especially from the standpoint of social welfare in a developing country. The necessity of developing the goods and services infrastructure in the country to support the natural gas insertion in the Brazilian energy matrix is also addressed
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.
Yun, Younghee; Jung, Wonmo; Kim, Hyunho; Jang, Bo-Hyoung; Kim, Min-Hee; Noh, Jiseong; Ko, Seong-Gyu; Choi, Inhwa
2017-08-01
Syndrome differentiation (SD) results in a diagnostic conclusion based on a cluster of concurrent symptoms and signs, including pulse form and tongue color. In Korea, there is a strong interest in the standardization of Traditional Medicine (TM). In order to standardize TM treatment, standardization of SD should be given priority. The aim of this study was to explore the SD, or symptom clusters, of patients with atopic dermatitis (AD) using non-negative factorization methods and k-means clustering analysis. We screened 80 patients and enrolled 73 eligible patients. One TM dermatologist evaluated the symptoms/signs using an existing clinical dataset from patients with AD. This dataset was designed to collect 15 dermatologic and 18 systemic symptoms/signs associated with AD. Non-negative matrix factorization was used to decompose the original data into a matrix with three features and a weight matrix. The point of intersection of the three coordinates from each patient was placed in three-dimensional space. With five clusters, the silhouette score reached 0.484, and this was the best silhouette score obtained from two to nine clusters. Patients were clustered according to the varying severity of concurrent symptoms/signs. Through the distribution of the null hypothesis generated by 10,000 permutation tests, we found significant cluster-specific symptoms/signs from the confidence intervals in the upper and lower 2.5% of the distribution. Patients in each cluster showed differences in symptoms/signs and severity. In a clinical situation, SD and treatment are based on the practitioners' observations and clinical experience. SD, identified through informatics, can contribute to development of standardized, objective, and consistent SD for each disease. Copyright © 2017. Published by Elsevier Ltd.
The Real-Valued Sparse Direction of Arrival (DOA Estimation Based on the Khatri-Rao Product
Directory of Open Access Journals (Sweden)
Tao Chen
2016-05-01
Full Text Available There is a problem that complex operation which leads to a heavy calculation burden is required when the direction of arrival (DOA of a sparse signal is estimated by using the array covariance matrix. The solution of the multiple measurement vectors (MMV model is difficult. In this paper, a real-valued sparse DOA estimation algorithm based on the Khatri-Rao (KR product called the L1-RVSKR is proposed. The proposed algorithm is based on the sparse representation of the array covariance matrix. The array covariance matrix is transformed to a real-valued matrix via a unitary transformation so that a real-valued sparse model is achieved. The real-valued sparse model is vectorized for transforming to a single measurement vector (SMV model, and a new virtual overcomplete dictionary is constructed according to the KR product’s property. Finally, the sparse DOA estimation is solved by utilizing the idea of a sparse representation of array covariance vectors (SRACV. The simulation results demonstrate the superior performance and the low computational complexity of the proposed algorithm.
Drakouli, Sotiria; Lyberopoulou, Aggeliki; Papathanassiou, Maria; Mylonis, Ilias; Georgatsou, Eleni
2017-08-01
Scaffold attachment factor B1 (SAFB1) is an integral component of the nuclear matrix of vertebrate cells. It binds to DNA on scaffold/matrix attachment region elements, as well as to RNA and a multitude of different proteins, affecting basic cellular activities such as transcription, splicing and DNA damage repair. In the present study, we show that enhancer of rudimentary homologue (ERH) is a new molecular partner of SAFB1 and its 70% homologous paralogue, scaffold attachment factor B2 (SAFB2). ERH interacts directly in the nucleus with the C-terminal Arg-Gly-rich region of SAFB1/2 and co-localizes with it in the insoluble nuclear fraction. ERH, a small ubiquitous protein with striking homology among species and a unique structure, has also been implicated in fundamental cellular mechanisms. Our functional analyses suggest that the SAFB/ERH interaction does not affect SAFB1/2 function in transcription (e.g. as oestrogen receptor α co-repressors), although it reverses the inhibition exerted by SAFB1/2 on the splicing kinase SR protein kinase 1 (SRPK1), which also binds on the C-terminus of SAFB1/2. Accordingly, ERH silencing decreases lamin B receptor and SR protein phosphorylation, which are major SRPK1 substrates, further substantiating the role of SAFB1 and SAFB2 in the co-ordination of nuclear function. © 2017 Federation of European Biochemical Societies.
Xue, Jian-long; Zhi, Yu-you; Yang, Li-ping; Shi, Jia-chun; Zeng, Ling-zao; Wu, Lao-sheng
2014-06-01
Chemical compositions of soil samples are multivariate in nature and provide datasets suitable for the application of multivariate factor analytical techniques. One of the analytical techniques, the positive matrix factorization (PMF), uses a weighted least square by fitting the data matrix to determine the weights of the sources based on the error estimates of each data point. In this research, PMF was employed to apportion the sources of heavy metals in 104 soil samples taken within a 1-km radius of a lead battery plant contaminated site in Changxing County, Zhejiang Province, China. The site is heavily contaminated with high concentrations of lead (Pb) and cadmium (Cd). PMF successfully partitioned the variances into sources related to soil background, agronomic practices, and the lead battery plants combined with a geostatistical approach. It was estimated that the lead battery plants and the agronomic practices contributed 55.37 and 29.28%, respectively, for soil Pb of the total source. Soil Cd mainly came from the lead battery plants (65.92%), followed by the agronomic practices (21.65%), and soil parent materials (12.43%). This research indicates that PMF combined with geostatistics is a useful tool for source identification and apportionment.
Sparse Matrices in Frame Theory
DEFF Research Database (Denmark)
Lemvig, Jakob; Krahmer, Felix; Kutyniok, Gitta
2014-01-01
Frame theory is closely intertwined with signal processing through a canon of methodologies for the analysis of signals using (redundant) linear measurements. The canonical dual frame associated with a frame provides a means for reconstruction by a least squares approach, but other dual frames...... yield alternative reconstruction procedures. The novel paradigm of sparsity has recently entered the area of frame theory in various ways. Of those different sparsity perspectives, we will focus on the situations where frames and (not necessarily canonical) dual frames can be written as sparse matrices...
Programming for Sparse Minimax Optimization
DEFF Research Database (Denmark)
Jonasson, K.; Madsen, Kaj
1994-01-01
We present an algorithm for nonlinear minimax optimization which is well suited for large and sparse problems. The method is based on trust regions and sequential linear programming. On each iteration, a linear minimax problem is solved for a basic step. If necessary, this is followed...... by the determination of a minimum norm corrective step based on a first-order Taylor approximation. No Hessian information needs to be stored. Global convergence is proved. This new method has been extensively tested and compared with other methods, including two well known codes for nonlinear programming...
Dynamic Representations of Sparse Graphs
DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Fagerberg, Rolf
1999-01-01
We present a linear space data structure for maintaining graphs with bounded arboricity—a large class of sparse graphs containing e.g. planar graphs and graphs of bounded treewidth—under edge insertions, edge deletions, and adjacency queries. The data structure supports adjacency queries in worst...... case O(c) time, and edge insertions and edge deletions in amortized O(1) and O(c+log n) time, respectively, where n is the number of nodes in the graph, and c is the bound on the arboricity....
Zhang, Zhichun; Tian, Hua; Lv, Ping; Wang, Weiping; Jia, Zhuqing; Wang, Sainan; Zhou, Chunyan; Gao, Xuejun
2015-01-01
Mutation of distal-less homeobox 3 (DLX3) is responsible for human tricho-dento-osseous syndrome (TDO) with amelogenesis imperfecta, indicating a crucial role of DLX3 in amelogenesis. However, the expression pattern of DLX3 and its specific function in amelogenesis remain largely unknown. The aim of this study was to investigate the effects of DLX3 on enamel matrix protein (EMP) genes. By immunohistochemistry assays of mouse tooth germs, stronger immunostaining of DLX3 protein was identified in ameloblasts in the secretory stage than in the pre-secretory and maturation stages, and the same pattern was found for Dlx3 mRNA using Realtime PCR. In a mouse ameloblast cell lineage, forced expression of DLX3 up-regulated the expression of the EMP genes Amelx, Enam, Klk4, and Odam, whereas knockdown of DLX3 down-regulated these four EMP genes. Further, bioinformatics, chromatin immunoprecipitation, and luciferase assays revealed that DLX3 transactivated Enam, Amelx, and Odam through direct binding to their enhancer regions. Particularly, over-expression of mutant-DLX3 (c.571_574delGGGG, responsible for TDO) inhibited the activation function of DLX3 on expression levels and promoter activities of the Enam, Amelx, and Odam genes. Together, our data show that DLX3 promotes the expression of the EMP genes Amelx, Enam, Klk4, and Odam in amelogenesis, while mutant-DLX3 disrupts this regulatory function, thus providing insights into the molecular mechanisms underlying the enamel defects of TDO disease.
Occupancy classification of position weight matrix-inferred transcription factor binding sites.
Directory of Open Access Journals (Sweden)
Hollis Wright
Full Text Available BACKGROUND: Computational prediction of Transcription Factor Binding Sites (TFBS from sequence data alone is difficult and error-prone. Machine learning techniques utilizing additional environmental information about a predicted binding site (such as distances from the site to particular chromatin features to determine its occupancy/functionality class show promise as methods to achieve more accurate prediction of true TFBS in silico. We evaluate the Bayesian Network (BN and Support Vector Machine (SVM machine learning techniques on four distinct TFBS data sets and analyze their performance. We describe the features that are most useful for classification and contrast and compare these feature sets between the factors. RESULTS: Our results demonstrate good performance of classifiers both on TFBS for transcription factors used for initial training and for TFBS for other factors in cross-classification experiments. We find that distances to chromatin modifications (specifically, histone modification islands as well as distances between such modifications to be effective predictors of TFBS occupancy, though the impact of individual predictors is largely TF specific. In our experiments, Bayesian network classifiers outperform SVM classifiers. CONCLUSIONS: Our results demonstrate good performance of machine learning techniques on the problem of occupancy classification, and demonstrate that effective classification can be achieved using distances to chromatin features. We additionally demonstrate that cross-classification of TFBS is possible, suggesting the possibility of constructing a generalizable occupancy classifier capable of handling TFBS for many different transcription factors.
International Nuclear Information System (INIS)
Yan, Y.T.
1991-01-01
The transverse motion of charged particles in a circular accelerator can be well represented by a one-turn high-order Taylor map. For particles without energy deviation, the one-turn Taylor map is a 4-dimensional polynomials of four variables. The four variables are the transverse canonical coordinates and their conjugate momenta. To include the energy deviation (off-momentum) effects, the map has to be parameterized with a smallness factor representing the off-momentum and so the Taylor map becomes a 4-dimensional polynomials of five variables. It is for this type of parameterized Taylor map that a mehtod is presented for converting it into a parameterized Dragt-Finn factorization map. Parameterized nonlinear normal form and parameterized kick factorization can thus be obtained with suitable modification of the existing technique
Murray, David B.; Levick, Scott P; Brower, Gregory L.; Janicki, Joseph S.
2010-01-01
Aim TNF-α is known to cause adverse myocardial remodeling. While we have previously shown a role for cardiac mast cells in mediating myocardial TNF-α, matrix metalloproteinases (MMP) activation of TNF-α may also be contributory. We sought to determine the relative roles of MMPs and cardiac mast cells in the activation of TNF-α in the hearts of rats subjected to chronic volume overload. Methods Interventions with the broad spectrum MMP inhibitor, GM6001, or the mast cell stabilizer, nedocromil, were performed in the rat aortocaval fistula (ACF) model of volume overload. Results Myocardial TNF-α levels were significantly increased in the ACF. This increase was prevented by MMP inhibition with GM6001 (p ≤ 0.001 vs. ACF). Conversely, myocardial TNF-α levels were increased in the ACF + nedocromil treated fistula groups (p ≤ 0.001 vs. sham). The degradation of interstitial collagen volume fraction seen in the untreated ACF group was prevented in both the GM6001 and nedocromil treated hearts. Significant increases in LV myocardial ET-1 levels also occurred in the ACF group at 3 days post-fistula. Whereas administration of GM6001 significantly attenuated this increase, mast cell stabilization with nedocromil markedly exacerbated the increase, producing ET-1 levels 6.5 fold and 2 fold greater than that in the sham-operated control and ACF group, respectively. Conclusion The efficacy of the MMP inhibitor, GM6001, to prevent increased levels of myocardial TNF-α is indicative of MMP-mediated cleavage of latent extracellular membrane bound TNF-α protein as the primary source of bioactive TNF-α in the myocardium of the volume-overload heart. PMID:20403361
Directory of Open Access Journals (Sweden)
Zhichun Zhang
Full Text Available Mutation of distal-less homeobox 3 (DLX3 is responsible for human tricho-dento-osseous syndrome (TDO with amelogenesis imperfecta, indicating a crucial role of DLX3 in amelogenesis. However, the expression pattern of DLX3 and its specific function in amelogenesis remain largely unknown. The aim of this study was to investigate the effects of DLX3 on enamel matrix protein (EMP genes. By immunohistochemistry assays of mouse tooth germs, stronger immunostaining of DLX3 protein was identified in ameloblasts in the secretory stage than in the pre-secretory and maturation stages, and the same pattern was found for Dlx3 mRNA using Realtime PCR. In a mouse ameloblast cell lineage, forced expression of DLX3 up-regulated the expression of the EMP genes Amelx, Enam, Klk4, and Odam, whereas knockdown of DLX3 down-regulated these four EMP genes. Further, bioinformatics, chromatin immunoprecipitation, and luciferase assays revealed that DLX3 transactivated Enam, Amelx, and Odam through direct binding to their enhancer regions. Particularly, over-expression of mutant-DLX3 (c.571_574delGGGG, responsible for TDO inhibited the activation function of DLX3 on expression levels and promoter activities of the Enam, Amelx, and Odam genes. Together, our data show that DLX3 promotes the expression of the EMP genes Amelx, Enam, Klk4, and Odam in amelogenesis, while mutant-DLX3 disrupts this regulatory function, thus providing insights into the molecular mechanisms underlying the enamel defects of TDO disease.
Sparse Bayesian Learning for Nonstationary Data Sources
Fujimaki, Ryohei; Yairi, Takehisa; Machida, Kazuo
This paper proposes an online Sparse Bayesian Learning (SBL) algorithm for modeling nonstationary data sources. Although most learning algorithms implicitly assume that a data source does not change over time (stationary), one in the real world usually does due to such various factors as dynamically changing environments, device degradation, sudden failures, etc (nonstationary). The proposed algorithm can be made useable for stationary online SBL by setting time decay parameters to zero, and as such it can be interpreted as a single unified framework for online SBL for use with stationary and nonstationary data sources. Tests both on four types of benchmark problems and on actual stock price data have shown it to perform well.
Bayesian Inference Methods for Sparse Channel Estimation
DEFF Research Database (Denmark)
Pedersen, Niels Lovmand
2013-01-01
This thesis deals with sparse Bayesian learning (SBL) with application to radio channel estimation. As opposed to the classical approach for sparse signal representation, we focus on the problem of inferring complex signals. Our investigations within SBL constitute the basis for the development...... of Bayesian inference algorithms for sparse channel estimation. Sparse inference methods aim at finding the sparse representation of a signal given in some overcomplete dictionary of basis vectors. Within this context, one of our main contributions to the field of SBL is a hierarchical representation...... analysis of the complex prior representation, where we show that the ability to induce sparse estimates of a given prior heavily depends on the inference method used and, interestingly, whether real or complex variables are inferred. We also show that the Bayesian estimators derived from the proposed...
Directory of Open Access Journals (Sweden)
Hu Xiaohua
2011-07-01
Full Text Available Abstract Background The wide use of high-throughput DNA microarray technology provide an increasingly detailed view of human transcriptome from hundreds to thousands of genes. Although biomedical researchers typically design microarray experiments to explore specific biological contexts, the relationships between genes are hard to identified because they are complex and noisy high-dimensional data and are often hindered by low statistical power. The main challenge now is to extract valuable biological information from the colossal amount of data to gain insight into biological processes and the mechanisms of human disease. To overcome the challenge requires mathematical and computational methods that are versatile enough to capture the underlying biological features and simple enough to be applied efficiently to large datasets. Methods Unsupervised machine learning approaches provide new and efficient analysis of gene expression profiles. In our study, two unsupervised knowledge-based matrix factorization methods, independent component analysis (ICA and nonnegative matrix factorization (NMF are integrated to identify significant genes and related pathways in microarray gene expression dataset of Alzheimer’s disease. The advantage of these two approaches is they can be performed as a biclustering method by which genes and conditions can be clustered simultaneously. Furthermore, they can group genes into different categories for identifying related diagnostic pathways and regulatory networks. The difference between these two method lies in ICA assume statistical independence of the expression modes, while NMF need positivity constrains to generate localized gene expression profiles. Results In our work, we performed FastICA and non-smooth NMF methods on DNA microarray gene expression data of Alzheimer’s disease respectively. The simulation results shows that both of the methods can clearly classify severe AD samples from control samples, and
Energy Technology Data Exchange (ETDEWEB)
Zhang, Le; Yu, Yu; Zhang, Pengjie, E-mail: lezhang@sjtu.edu.cn [Department of Astronomy, Shanghai Jiao Tong University, Shanghai, 200240 (China)
2017-10-10
Photo- z error is one of the major sources of systematics degrading the accuracy of weak-lensing cosmological inferences. Zhang et al. proposed a self-calibration method combining galaxy–galaxy correlations and galaxy–shear correlations between different photo- z bins. Fisher matrix analysis shows that it can determine the rate of photo- z outliers at a level of 0.01%–1% merely using photometric data and do not rely on any prior knowledge. In this paper, we develop a new algorithm to implement this method by solving a constrained nonlinear optimization problem arising in the self-calibration process. Based on the techniques of fixed-point iteration and non-negative matrix factorization, the proposed algorithm can efficiently and robustly reconstruct the scattering probabilities between the true- z and photo- z bins. The algorithm has been tested extensively by applying it to mock data from simulated stage IV weak-lensing projects. We find that the algorithm provides a successful recovery of the scatter rates at the level of 0.01%–1%, and the true mean redshifts of photo- z bins at the level of 0.001, which may satisfy the requirements in future lensing surveys.
A preconditioned inexact newton method for nonlinear sparse electromagnetic imaging
Desmal, Abdulla
2015-03-01
A nonlinear inversion scheme for the electromagnetic microwave imaging of domains with sparse content is proposed. Scattering equations are constructed using a contrast-source (CS) formulation. The proposed method uses an inexact Newton (IN) scheme to tackle the nonlinearity of these equations. At every IN iteration, a system of equations, which involves the Frechet derivative (FD) matrix of the CS operator, is solved for the IN step. A sparsity constraint is enforced on the solution via thresholded Landweber iterations, and the convergence is significantly increased using a preconditioner that levels the FD matrix\\'s singular values associated with contrast and equivalent currents. To increase the accuracy, the weight of the regularization\\'s penalty term is reduced during the IN iterations consistently with the scheme\\'s quadratic convergence. At the end of each IN iteration, an additional thresholding, which removes small \\'ripples\\' that are produced by the IN step, is applied to maintain the solution\\'s sparsity. Numerical results demonstrate the applicability of the proposed method in recovering sparse and discontinuous dielectric profiles with high contrast values.
Image fusion using sparse overcomplete feature dictionaries
Brumby, Steven P.; Bettencourt, Luis; Kenyon, Garrett T.; Chartrand, Rick; Wohlberg, Brendt
2015-10-06
Approaches for deciding what individuals in a population of visual system "neurons" are looking for using sparse overcomplete feature dictionaries are provided. A sparse overcomplete feature dictionary may be learned for an image dataset and a local sparse representation of the image dataset may be built using the learned feature dictionary. A local maximum pooling operation may be applied on the local sparse representation to produce a translation-tolerant representation of the image dataset. An object may then be classified and/or clustered within the translation-tolerant representation of the image dataset using a supervised classification algorithm and/or an unsupervised clustering algorithm.
Sparse Image Reconstruction in Computed Tomography
DEFF Research Database (Denmark)
Jørgensen, Jakob Sauer
In recent years, increased focus on the potentially harmful effects of x-ray computed tomography (CT) scans, such as radiation-induced cancer, has motivated research on new low-dose imaging techniques. Sparse image reconstruction methods, as studied for instance in the field of compressed sensing...... applications. This thesis takes a systematic approach toward establishing quantitative understanding of conditions for sparse reconstruction to work well in CT. A general framework for analyzing sparse reconstruction methods in CT is introduced and two sets of computational tools are proposed: 1...... contributions to a general set of computational characterization tools. Thus, the thesis contributions help advance sparse reconstruction methods toward routine use in...
Exploiting Data Sparsity for Large-Scale Matrix Computations
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.
Exploiting Data Sparsity for Large-Scale Matrix Computations
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.
Sparse Channel Estimation Including the Impact of the Transceiver Filters with Application to OFDM
DEFF Research Database (Denmark)
Barbu, Oana-Elena; Pedersen, Niels Lovmand; Manchón, Carles Navarro
2014-01-01
Traditionally, the dictionary matrices used in sparse wireless channel estimation have been based on the discrete Fourier transform, following the assumption that the channel frequency response (CFR) can be approximated as a linear combination of a small number of multipath components, each one......) and receive (demodulation) filters. Hence, the assumption of the CFR being sparse in the canonical Fourier dictionary may no longer hold. In this work, we derive a signal model and subsequently a novel dictionary matrix for sparse estimation that account for the impact of transceiver filters. Numerical...... results obtained in an OFDM transmission scenario demonstrate the superior accuracy of a sparse estimator that uses our proposed dictionary rather than the classical Fourier dictionary, and its robustness against a mismatch in the assumed transmit filter characteristics....
Combinatorial Algorithms for Computing Column Space Bases ThatHave Sparse Inverses
Energy Technology Data Exchange (ETDEWEB)
Pinar, Ali; Chow, Edmond; Pothen, Alex
2005-03-18
This paper presents a combinatorial study on the problem ofconstructing a sparse basis forthe null-space of a sparse, underdetermined, full rank matrix, A. Such a null-space is suitable forsolving solving many saddle point problems. Our approach is to form acolumn space basis of A that has a sparse inverse, by selecting suitablecolumns of A. This basis is then used to form a sparse null-space basisin fundamental form. We investigate three different algorithms forcomputing the column space basis: Two greedy approaches that rely onmatching, and a third employing a divide and conquer strategy implementedwith hypergraph partitioning followed by the greedy approach. We alsodiscuss the complexity of selecting a column basis when it is known thata block diagonal basis exists with a small given block size.
Using Matrix and Tensor Factorizations for the Single-Trial Analysis of Population Spike Trains.
Directory of Open Access Journals (Sweden)
Arno Onken
2016-11-01
Full Text Available Advances in neuronal recording techniques are leading to ever larger numbers of simultaneously monitored neurons. This poses the important analytical challenge of how to capture compactly all sensory information that neural population codes carry in their spatial dimension (differences in stimulus tuning across neurons at different locations, in their temporal dimension (temporal neural response variations, or in their combination (temporally coordinated neural population firing. Here we investigate the utility of tensor factorizations of population spike trains along space and time. These factorizations decompose a dataset of single-trial population spike trains into spatial firing patterns (combinations of neurons firing together, temporal firing patterns (temporal activation of these groups of neurons and trial-dependent activation coefficients (strength of recruitment of such neural patterns on each trial. We validated various factorization methods on simulated data and on populations of ganglion cells simultaneously recorded in the salamander retina. We found that single-trial tensor space-by-time decompositions provided low-dimensional data-robust representations of spike trains that capture efficiently both their spatial and temporal information about sensory stimuli. Tensor decompositions with orthogonality constraints were the most efficient in extracting sensory information, whereas non-negative tensor decompositions worked well even on non-independent and overlapping spike patterns, and retrieved informative firing patterns expressed by the same population in response to novel stimuli. Our method showed that populations of retinal ganglion cells carried information in their spike timing on the ten-milliseconds-scale about spatial details of natural images. This information could not be recovered from the spike counts of these cells. First-spike latencies carried the majority of information provided by the whole spike train about fine
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....
Masalmah, Yahya M.; Vélez-Reyes, Miguel
2007-04-01
The authors proposed in previous papers the use of the constrained Positive Matrix Factorization (cPMF) to perform unsupervised unmixing of hyperspectral imagery. Two iterative algorithms were proposed to compute the cPMF based on the Gauss-Seidel and penalty approaches to solve optimization problems. Results presented in previous papers have shown the potential of the proposed method to perform unsupervised unmixing in HYPERION and AVIRIS imagery. The performance of iterative methods is highly dependent on the initialization scheme. Good initialization schemes can improve convergence speed, whether or not a global minimum is found, and whether or not spectra with physical relevance are retrieved as endmembers. In this paper, different initializations using random selection, longest norm pixels, and standard endmembers selection routines are studied and compared using simulated and real data.
Energy Technology Data Exchange (ETDEWEB)
Gittens, Alex; Devarakonda, Aditya; Racah, Evan; Ringenburg, Michael; Gerhardt, Lisa; Kottalam, Jey; Liu, Jialin; Maschhoff, Kristyn; Canon, Shane; Chhugani, Jatin; Sharma, Pramod; Yang, Jiyan; Demmel, James; Harrell, Jim; Krishnamurthy, Venkat; Mahoney, Michael; Prabhat, Mr
2016-05-12
We explore the trade-offs of performing linear algebra using Apache Spark, compared to traditional C and MPI implementations on HPC platforms. Spark is designed for data analytics on cluster computing platforms with access to local disks and is optimized for data-parallel tasks. We examine three widely-used and important matrix factorizations: NMF (for physical plausibility), PCA (for its ubiquity) and CX (for data interpretability). We apply these methods to 1.6TB particle physics, 2.2TB and 16TB climate modeling and 1.1TB bioimaging data. The data matrices are tall-and-skinny which enable the algorithms to map conveniently into Spark’s data parallel model. We perform scaling experiments on up to 1600 Cray XC40 nodes, describe the sources of slowdowns, and provide tuning guidance to obtain high performance.
When sparse coding meets ranking: a joint framework for learning sparse codes and ranking scores
Wang, Jim Jing-Yan; Cui, Xuefeng; Yu, Ge; Guo, Lili; Gao, Xin
2017-01-01
Sparse coding, which represents a data point as a sparse reconstruction code with regard to a dictionary, has been a popular data representation method. Meanwhile, in database retrieval problems, learning the ranking scores from data points plays
Sparse inverse covariance estimation with the graphical lasso.
Friedman, Jerome; Hastie, Trevor; Tibshirani, Robert
2008-07-01
We consider the problem of estimating sparse graphs by a lasso penalty applied to the inverse covariance matrix. Using a coordinate descent procedure for the lasso, we develop a simple algorithm--the graphical lasso--that is remarkably fast: It solves a 1000-node problem ( approximately 500,000 parameters) in at most a minute and is 30-4000 times faster than competing methods. It also provides a conceptual link between the exact problem and the approximation suggested by Meinshausen and Bühlmann (2006). We illustrate the method on some cell-signaling data from proteomics.
International Nuclear Information System (INIS)
Finkelstein, J.N.; Johnston, C.J.; Baggs, R.; Rubin, P.
1994-01-01
Fibrosis, characterized by the accumulation of collagen, is a late result of thoracic irradiation. The expression of late radiation injury can be found immediately after irradiation by measuring messenger RNA (mRNA) abundance. To determine if extracellular matrix mRNA and transforming growth factor beta abundance was affected acutely after irradiation, the authors measured mRNA levels of collagen I (CI), collagen III (CIII), collagen IV (CIV), fibronectin (FN), and transforming growth factor β (TGFβ 1,2ampersand3 ) in mouse lungs on day 1 and day 14 after graded doses of radiation. C57BL/6 female mice were irradiated with a single dose to the thorax of 5 or 12.5 Gy. Total lung RNA was prepared and immobilized by Northern and slot blotting and hybridized with radiolabelled cDNA probes for CI, CIII, CIV, FN, TGFβ 1,2ampersand3 and a control probe encoding for glyceraldehyde-3-phosphate dehydrogenase (GAPDH). Autoradiographic data were quantified by video densitometry and results normalized to GAPDH. Changes in the expression of CI, CIII, CIV, FN and TGFβ 1,2ampersand3 were observed as early as 1 day after exposure. Through 14 days, changes in mRNA up to 5-fold were seen for any one dose. Dose related changes as high as 10-fold were also evident. The CI:CIII ratio increased gradually for the 5 Gy dose at 14 days postirradiation while the CI:CII ratio for the 12.5 Gy dose decreased by approximately 4-fold as compared to the control. These studies suggest that alterations in expression of extracellular matrix and TGFβ mRNA occur very early after radiation injury even at low doses and may play a role in the development of chronic fibrosis. 37 refs., 6 figs
Neural Network for Sparse Reconstruction
Directory of Open Access Journals (Sweden)
Qingfa Li
2014-01-01
Full Text Available We construct a neural network based on smoothing approximation techniques and projected gradient method to solve a kind of sparse reconstruction problems. Neural network can be implemented by circuits and can be seen as an important method for solving optimization problems, especially large scale problems. Smoothing approximation is an efficient technique for solving nonsmooth optimization problems. We combine these two techniques to overcome the difficulties of the choices of the step size in discrete algorithms and the item in the set-valued map of differential inclusion. In theory, the proposed network can converge to the optimal solution set of the given problem. Furthermore, some numerical experiments show the effectiveness of the proposed network in this paper.
Sparse and stable Markowitz portfolios.
Brodie, Joshua; Daubechies, Ingrid; De Mol, Christine; Giannone, Domenico; Loris, Ignace
2009-07-28
We consider the problem of portfolio selection within the classical Markowitz mean-variance framework, reformulated as a constrained least-squares regression problem. We propose to add to the objective function a penalty proportional to the sum of the absolute values of the portfolio weights. This penalty regularizes (stabilizes) the optimization problem, encourages sparse portfolios (i.e., portfolios with only few active positions), and allows accounting for transaction costs. Our approach recovers as special cases the no-short-positions portfolios, but does allow for short positions in limited number. We implement this methodology on two benchmark data sets constructed by Fama and French. Using only a modest amount of training data, we construct portfolios whose out-of-sample performance, as measured by Sharpe ratio, is consistently and significantly better than that of the naïve evenly weighted portfolio.
SPARSE FARADAY ROTATION MEASURE SYNTHESIS
International Nuclear Information System (INIS)
Andrecut, M.; Stil, J. M.; Taylor, A. R.
2012-01-01
Faraday rotation measure synthesis is a method for analyzing multichannel polarized radio emissions, and it has emerged as an important tool in the study of Galactic and extragalactic magnetic fields. The method requires the recovery of the Faraday dispersion function from measurements restricted to limited wavelength ranges, which is an ill-conditioned deconvolution problem. Here, we discuss a recovery method that assumes a sparse approximation of the Faraday dispersion function in an overcomplete dictionary of functions. We discuss the general case when both thin and thick components are included in the model, and we present the implementation of a greedy deconvolution algorithm. We illustrate the method with several numerical simulations that emphasize the effect of the covered range and sampling resolution in the Faraday depth space, and the effect of noise on the observed data.
Sparse Reconstruction Schemes for Nonlinear Electromagnetic Imaging
Desmal, Abdulla
2016-03-01
Electromagnetic imaging is the problem of determining material properties from scattered fields measured away from the domain under investigation. Solving this inverse problem is a challenging task because (i) it is ill-posed due to the presence of (smoothing) integral operators used in the representation of scattered fields in terms of material properties, and scattered fields are obtained at a finite set of points through noisy measurements; and (ii) it is nonlinear simply due the fact that scattered fields are nonlinear functions of the material properties. The work described in this thesis tackles the ill-posedness of the electromagnetic imaging problem using sparsity-based regularization techniques, which assume that the scatterer(s) occupy only a small fraction of the investigation domain. More specifically, four novel imaging methods are formulated and implemented. (i) Sparsity-regularized Born iterative method iteratively linearizes the nonlinear inverse scattering problem and each linear problem is regularized using an improved iterative shrinkage algorithm enforcing the sparsity constraint. (ii) Sparsity-regularized nonlinear inexact Newton method calls for the solution of a linear system involving the Frechet derivative matrix of the forward scattering operator at every iteration step. For faster convergence, the solution of this matrix system is regularized under the sparsity constraint and preconditioned by leveling the matrix singular values. (iii) Sparsity-regularized nonlinear Tikhonov method directly solves the nonlinear minimization problem using Landweber iterations, where a thresholding function is applied at every iteration step to enforce the sparsity constraint. (iv) This last scheme is accelerated using a projected steepest descent method when it is applied to three-dimensional investigation domains. Projection replaces the thresholding operation and enforces the sparsity constraint. Numerical experiments, which are carried out using
Directory of Open Access Journals (Sweden)
Mingliang Sun
2017-01-01
Full Text Available Mesenchymal stem cells are an attractive cell type for cytotherapy in wound healing. The authors recently developed a novel, adipose-tissue-derived, injectable extracellular matrix/stromal vascular fraction gel (ECM/SVF-gel for stem cell therapy. This study was designed to assess the therapeutic effects of ECM/SVF-gel on wound healing and potential mechanisms. ECM/SVF-gel was prepared for use in nude mouse excisional wound healing model. An SVF cell suspension and phosphate-buffered saline injection served as the control. The expression levels of vascular endothelial growth factor (VEGF, basic fibroblast growth factor (bFGF, and monocyte chemotactic protein-1 (MCP-1 in ECM/SVF-gel were analyzed at different time points. Angiogenesis (tube formation assays of ECM/SVF-gel extracts were evaluated, and vessels density in skin was determined. The ECM/SVF-gel extract promoted tube formation in vitro and increased the expression of the angiogenic factors VEGF and bFGF compared with those in the control. The expression of the inflammatory chemoattractant MCP-1 was high in ECM/SVF-gel at the early stage and decreased sharply during the late stage of wound healing. The potent angiogenic effects exerted by ECM/SVF-gel may contribute to the improvement of wound healing, and these effects could be related to the enhanced inflammatory response in ECM/SVF-gel during the early stage of wound healing.
Directory of Open Access Journals (Sweden)
Jung Soonwoong
2012-06-01
Full Text Available Abstract Background The amygdala plays an essential role in controlling emotional behaviors and has numerous connections to other brain regions. The functional role of the amygdala has been highlighted by various studies of stress-induced behavioral changes. Here we investigated gene expression changes in the amygdala in the chronic immobilization stress (CIS-induced depression model. Results Eight genes were decreased in the amygdala of CIS mice, including genes for neurotrophic factors and extracellular matrix proteins. Among these, osteoglycin, fibromodulin, insulin-like growth factor 2 (Igf2, and insulin-like growth factor binding protein 2 (Igfbp2 were further analyzed for histological expression changes. The expression of osteoglycin and fibromodulin simultaneously decreased in the medial, basolateral, and central amygdala regions. However, Igf2 and Igfbp2 decreased specifically in the central nucleus of the amygdala. Interestingly, this decrease was found only in the amygdala of mice showing higher immobility, but not in mice displaying lower immobility, although the CIS regimen was the same for both groups. Conclusions These results suggest that the responsiveness of the amygdala may play a role in the sensitivity of CIS-induced behavioral changes in mice.
Ward, Thomas
2013-10-01
A new electromagnetic neutral-current quark mixing matrix, analog to the well-known Cabibbo-Kobayashi-Maskawa (CKM) weak charge-current matrix, is proposed to account for the strange quark content of the neutron and proton and part of the anomalous axial vector magnetic moments. The EM-CKM matrix is shown to be equivalent to the weak-CKM matrix following an EM to weak gauge symmetry transformation, demonstrating the universality of the Standard Model (SM) CKM quark mixing matrix. The electric and magnetic form factors are reformulated using a new QCD three quark nucleon gyromagnetic factor, Dirac and Pauli form factors and anomalous kappa factors. The old 1943 Jauch form factors which have been systematically used and developed for many years is shown to be in stark disagreement with the new global set of experimental polarized electron-proton scattering data whereas the reformulated SM parameter set of this study is shown to agree very well, lending strong support for this new EM SM approach.
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.
Low-Rank Sparse Coding for Image Classification
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
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.
Covariance matrix estimation for stationary time series
Xiao, Han; Wu, Wei Biao
2011-01-01
We obtain a sharp convergence rate for banded covariance matrix estimates of stationary processes. A precise order of magnitude is derived for spectral radius of sample covariance matrices. We also consider a thresholded covariance matrix estimator that can better characterize sparsity if the true covariance matrix is sparse. As our main tool, we implement Toeplitz [Math. Ann. 70 (1911) 351–376] idea and relate eigenvalues of covariance matrices to the spectral densities or Fourier transforms...
Numerical solution of large sparse linear systems
International Nuclear Information System (INIS)
Meurant, Gerard; Golub, Gene.
1982-02-01
This note is based on one of the lectures given at the 1980 CEA-EDF-INRIA Numerical Analysis Summer School whose aim is the study of large sparse linear systems. The main topics are solving least squares problems by orthogonal transformation, fast Poisson solvers and solution of sparse linear system by iterative methods with a special emphasis on preconditioned conjuguate gradient method [fr
Sparse seismic imaging using variable projection
Aravkin, Aleksandr Y.; Tu, Ning; van Leeuwen, Tristan
2013-01-01
We consider an important class of signal processing problems where the signal of interest is known to be sparse, and can be recovered from data given auxiliary information about how the data was generated. For example, a sparse Green's function may be recovered from seismic experimental data using
Basu, Jayasri; Agamasu, Enyonam; Bendek, Bolek; Salafia, Carolyn M; Mishra, Aruna; Lopez, Julia Vasquez; Kroes, Jessica; Dragich, Sharon Claire; Thakur, Ashley; Mikhail, Magdy
2018-04-01
Matrix metalloproteinases (MMPs), specifically MMP-9 plays a role in human placentation. The enzyme confers an invasive ability to cytotrophoblasts and degrades the endometrial matrix as the cells infiltrate the decidua to keep up with placental growth. Since tumor necrosis factor-α (TNF-α) can induce the synthesis of MMP-9, we investigated the patterns of changes in and correlation between placental villous MMP-9 and TNF-α expressions throughout normal human gestation. Placentas were obtained from 179 normal pregnant women who underwent elective abortion or term delivery. Chorionic villi isolated from placental samples were grouped as first, second, and third trimester (7 0/7 -13 0/7 , 13 1/7 -23 6/7 , and 37 0/7 -42 4/7 weeks, respectively). Chorionic villous TNF-α and MMP-9 proteins were assayed using enzyme immunoassay kits. There were significant differences in MMP-9 and TNF-α protein expressions among the trimester groups ( P = .001). The MMP-9 protein increased progressively with an increase in gestational age (GA), but TNF-α peaked in the second trimester. Within each trimester group, we searched for the effects of variation of GA in days on the 2 variables. A significant positive correlation between MMP-9 and GA was noted in the first trimester ( r = 0.364, P = .005). No other comparisons were significant. When GA was controlled for, partial correlation revealed a significant positive correlation between TNF-α and MMP-9 only in the second trimester ( r = 0.300, P = .018). We hypothesize that the TNF-α peak and the positive correlation between TNF-α and MMP-9 in the second trimester of normal human gestation could contribute toward a successful pregnancy outcome.
Yang, Cailing; Yan, Jianguo; Yuan, Guoyan; Zhang, Yinghua; Lu, Derong; Ren, Mingxin; Cui, Weigang
2014-09-01
Icotinib is an epidermal growth factor receptor tyrosine kinase inhibitor, which has been revealed to inhibit proliferation in tumor cells. However, the effect of icotinib on cancer cell metastasis remains to be explained. This study examines the effect of icotinib on the migration and invasion of squamous cells of tongue carcinoma (Tca8113 cells) in vitro . The results of the Boyden chamber invasion assay demonstrated that icotinib reduced cell invasion, suppressed the protein levels of matrix metalloproteinases (MMPs), MMP-2 and MMP-9, and increased the expression of tissue inhibitor of metalloproteinase-1. In addition, icotinib was found to significantly decrease the protein levels of nuclear factor κB (NF-κB) p65, which suggested that icotinib inhibits NF-κB activity. Furthermore, treatment with the NF-κB inhibitor, pyrrolidine dithiocarbamate, suppressed cell invasion and MMP-2 expression. These results suggested that icotinib inhibits the invasion of Tca8113 cells by downregulating MMP via the inactivation of the NF-κB signaling pathways.
Directory of Open Access Journals (Sweden)
Yaron Orenstein
Full Text Available The new technology of protein binding microarrays (PBMs allows simultaneous measurement of the binding intensities of a transcription factor to tens of thousands of synthetic double-stranded DNA probes, covering all possible 10-mers. A key computational challenge is inferring the binding motif from these data. We present a systematic comparison of four methods developed specifically for reconstructing a binding site motif represented as a positional weight matrix from PBM data. The reconstructed motifs were evaluated in terms of three criteria: concordance with reference motifs from the literature and ability to predict in vivo and in vitro bindings. The evaluation encompassed over 200 transcription factors and some 300 assays. The results show a tradeoff between how the methods perform according to the different criteria, and a dichotomy of method types. Algorithms that construct motifs with low information content predict PBM probe ranking more faithfully, while methods that produce highly informative motifs match reference motifs better. Interestingly, in predicting high-affinity binding, all methods give far poorer results for in vivo assays compared to in vitro assays.
Ray, Sumanta; Maulik, Ujjwal
2016-12-20
Detecting perturbation in modular structure during HIV-1 disease progression is an important step to understand stage specific infection pattern of HIV-1 virus in human cell. In this article, we proposed a novel methodology on integration of multiple biological information to identify such disruption in human gene module during different stages of HIV-1 infection. We integrate three different biological information: gene expression information, protein-protein interaction information and gene ontology information in single gene meta-module, through non negative matrix factorization (NMF). As the identified metamodules inherit those information so, detecting perturbation of these, reflects the changes in expression pattern, in PPI structure and in functional similarity of genes during the infection progression. To integrate modules of different data sources into strong meta-modules, NMF based clustering is utilized here. Perturbation in meta-modular structure is identified by investigating the topological and intramodular properties and putting rank to those meta-modules using a rank aggregation algorithm. We have also analyzed the preservation structure of significant GO terms in which the human proteins of the meta-modules participate. Moreover, we have performed an analysis to show the change of coregulation pattern of identified transcription factors (TFs) over the HIV progression stages.
Directory of Open Access Journals (Sweden)
D Kuraitis
2011-09-01
Full Text Available Although many regenerative cell therapies are being developed to replace or regenerate ischaemic muscle, the lack of vasculature and poor persistence of the therapeutic cells represent major limiting factors to successful tissue restoration. In response to ischaemia, stromal cell-derived factor-1 (SDF-1 is up-regulated by the affected tissue to stimulate stem cell-mediated regenerative responses. Therefore, we encapsulated SDF-1 into alginate microspheres and further incorporated these into an injectable collagen-based matrix in order to improve local delivery. Microsphere-matrix impregnation reduced the time for matrix thermogelation, and also increased the viscosity reached. This double-incorporation prolonged the release of SDF-1, which maintained adhesive and migratory bioactivity, attributed to chemotaxis in response to SDF-1. In vivo, treatment of ischaemic hindlimb muscle with microsphere-matrix led to increased mobilisation of bone marrow-derived progenitor cells, and also improved recruitment of angiogenic cells expressing the SDF-1 receptor (CXCR4 from bone marrow and local tissues. Both matrix and SDF-1-releasing matrix were successful at restoring perfusion, but SDF-1 treatment appeared to play an earlier role, as evidenced by arterioles that are phenotypically older and by increased angiogenic cytokine production, stimulating the generation of a qualitative microenvironment for a rapid and therefore more efficient regeneration. These results support the release of implanted SDF-1 as a promising method for enhancing progenitor cell responses and restoring perfusion to ischaemic tissues via neovascularisation.
Bhanuprasad, S. G.; Venkataraman, Chandra; Bhushan, Mani
The sources of aerosols on a regional scale over India have only recently received attention in studies using back trajectory analysis and chemical transport modelling. Receptor modelling approaches such as positive matrix factorization (PMF) and the potential source contribution function (PSCF) are effective tools in source identification of urban and regional-scale pollution. In this work, PMF and PSCF analysis is applied to identify categories and locations of sources that influenced surface concentrations of aerosols in the Indian Ocean Experiment (INDOEX) domain measured on-board the research vessel Ron Brown [Quinn, P.K., Coffman, D.J., Bates, T.S., Miller, T.L., Johnson, J.E., Welton, E.J., et al., 2002. Aerosol optical properties during INDOEX 1999: means, variability, and controlling factors. Journal of Geophysical Research 107, 8020, doi:10.1029/2000JD000037]. Emissions inventory information is used to identify sources co-located with probable source regions from PSCF. PMF analysis identified six factors influencing PM concentrations during the INDOEX cruise of the Ron Brown including a biomass combustion factor (35-40%), three industrial emissions factors (35-40%), primarily secondary sulphate-nitrate, balance trace elements and Zn, and two dust factors (20-30%) of Si- and Ca-dust. The identified factors effectively predict the measured submicron PM concentrations (slope of regression line=0.90±0.20; R2=0.76). Probable source regions shifted based on changes in surface and elevated flows during different times in the ship cruise. They were in India in the early part of the cruise, but in west Asia, south-east Asia and Africa, during later parts of the cruise. Co-located sources include coal-fired electric utilities, cement, metals and petroleum production in India and west Asia, biofuel combustion for energy and crop residue burning in India, woodland/forest burning in north sub-Saharan Africa and forest burning in south-east Asia. Significant findings
Mini-lecture course: Introduction into hierarchical matrix technique
Litvinenko, Alexander
2017-01-01
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).
Spectra of sparse random matrices
International Nuclear Information System (INIS)
Kuehn, Reimer
2008-01-01
We compute the spectral density for ensembles of sparse symmetric random matrices using replica. Our formulation of the replica-symmetric ansatz shares the symmetries of that suggested in a seminal paper by Rodgers and Bray (symmetry with respect to permutation of replica and rotation symmetry in the space of replica), but uses a different representation in terms of superpositions of Gaussians. It gives rise to a pair of integral equations which can be solved by a stochastic population-dynamics algorithm. Remarkably our representation allows us to identify pure-point contributions to the spectral density related to the existence of normalizable eigenstates. Our approach is not restricted to matrices defined on graphs with Poissonian degree distribution. Matrices defined on regular random graphs or on scale-free graphs, are easily handled. We also look at matrices with row constraints such as discrete graph Laplacians. Our approach naturally allows us to unfold the total density of states into contributions coming from vertices of different local coordinations and an example of such an unfolding is presented. Our results are well corroborated by numerical diagonalization studies of large finite random matrices
International Nuclear Information System (INIS)
Baly, L.; Martín, G.; Quesada, I.; Padilla, F.; Arteche, R.
2015-01-01
A new approach based on the Monte Carlo simulation is used to calculate the infinite matrix dose rate correction factors of gamma, beta and internal conversion radiations for 250 μm diameter grains of quartz and TLD500 chips. Here, the dependence of the correction factor on the radiation energy is initially calculated for each type of emitted particle and with this result the correction factors for the 232 Th and 238 U series and 40 K are determined. This analysis is made for dry soil and also for different levels of water content in it. The obtained beta correction factors for quartz are in good agreement with those previously reported. For the TLD500 chip certain differences with previously reported data are found. The analysis of the gamma water correction factor for quartz based on Zimmerman equation shows the correspondence with the similar correction factor for electrons. In the case of TLD500 chip a gamma water correction factor value of 1.0 was found. - Highlights: • A new approach based on Monte Carlo simulation is used to compute infinite matrix dose rate correction factors. • Infinite matrix models with real dimensions were analyzed within 3% uncertainties. • The dependence of grain size attenuation on particle energy is determined. • The same dependence for water correction factors is also analyzed
Directory of Open Access Journals (Sweden)
Schultz Bruce
2006-02-01
Full Text Available Abstract Background Three transcription factors that are expressed at high levels in embryonic stem cells (ESCs are Nanog, Oct-4 and Sox-2. These transcription factors regulate the expression of other genes during development and are found at high levels in the pluripotent cells of the inner cell mass. The downregulation of these three transcription factors correlates with the loss of pluripotency and self-renewal, and the beginning of subsequent differentiation steps. The roles of Nanog, Oct-4 and Sox-2 have not been fully elucidated. They are important in embryonic development and maintenance of pluripotency in ESCs. We studied the expression of these transcription factors in porcine umbilical cord (PUC matrix cells. Methods Cells were isolated from Wharton's jelly of porcine umbilical cords (PUC and histochemically assayed for the presence of alkaline phosphatase and the presence of Nanog, Oct-4 and Sox-2 mRNA and protein. PCR amplicons were sequenced and compared with known sequences. The synthesis of Oct-4 and Nanog protein was analyzed using immunocytochemistry. FACS analysis was utilized to evaluate Hoechst 33342 dye-stained cells. Results PUC isolates were maintained in culture and formed colonies that express alkaline phosphatase. FACS analysis revealed a side population of Hoechst dye-excluding cells, the Hoechst exclusion was verapamil sensitive. Quantitative and non-quantitative RT-PCR reactions revealed expression of Nanog, Oct-4 and Sox-2 in day 15 embryonic discs, PUC cell isolates and porcine fibroblasts. Immunocytochemical analysis detected Nanog immunoreactivity in PUC cell nuclei, and faint labeling in fibroblasts. Oct-4 immunoreactivity was detected in the nuclei of some PUC cells, but not in fibroblasts. Conclusion Cells isolated from PUC express three transcription factors found in pluripotent stem cell markers both at the mRNA and protein level. The presence of these transcription factors, along with the other
Threshold partitioning of sparse matrices and applications to Markov chains
Energy Technology Data Exchange (ETDEWEB)
Choi, Hwajeong; Szyld, D.B. [Temple Univ., Philadelphia, PA (United States)
1996-12-31
It is well known that the order of the variables and equations of a large, sparse linear system influences the performance of classical iterative methods. In particular if, after a symmetric permutation, the blocks in the diagonal have more nonzeros, classical block methods have a faster asymptotic rate of convergence. In this paper, different ordering and partitioning algorithms for sparse matrices are presented. They are modifications of PABLO. In the new algorithms, in addition to the location of the nonzeros, the values of the entries are taken into account. The matrix resulting after the symmetric permutation has dense blocks along the diagonal, and small entries in the off-diagonal blocks. Parameters can be easily adjusted to obtain, for example, denser blocks, or blocks with elements of larger magnitude. In particular, when the matrices represent Markov chains, the permuted matrices are well suited for block iterative methods that find the corresponding probability distribution. Applications to three types of methods are explored: (1) Classical block methods, such as Block Gauss Seidel. (2) Preconditioned GMRES, where a block diagonal preconditioner is used. (3) Iterative aggregation method (also called aggregation/disaggregation) where the partition obtained from the ordering algorithm with certain parameters is used as an aggregation scheme. In all three cases, experiments are presented which illustrate the performance of the methods with the new orderings. The complexity of the new algorithms is linear in the number of nonzeros and the order of the matrix, and thus adding little computational effort to the overall solution.
Hou, Tianyong; Li, Zhiqiang; Luo, Fei; Xie, Zhao; Wu, Xuehui; Xing, Junchao; Dong, Shiwu; Xu, Jianzhong
2014-07-01
The need for suitable bone grafts is high; however, there are limitations to all current graft sources, such as limited availability, the invasive harvest procedure, insufficient osteoinductive properties, poor biocompatibility, ethical problems, and degradation properties. The lack of osteoinductive properties is a common problem. As an allogenic bone graft, demineralized bone matrix (DBM) can overcome issues such as limited sources and comorbidities caused by invasive harvest; however, DBM is not sufficiently osteoinductive. Bone marrow has been known to magnify osteoinductive components for bone reconstruction because it contains osteogenic cells and factors. Mesenchymal stem cells (MSCs) derived from bone marrow are the gold standard for cell seeding in tissue-engineered biomaterials for bone repair, and these cells have demonstrated beneficial effects. However, the associated high cost and the complicated procedures limit the use of tissue-engineered bone constructs. To easily enrich more osteogenic cells and factors to DBM by selective cell retention technology, DBM is modified by a nanoscale self-assembling peptide (SAP) to form a composite DBM/SAP scaffold. By decreasing the pore size and increasing the charge interaction, DBM/SAP scaffolds possess a much higher enriching yield for osteogenic cells and factors compared with DBM alone scaffolds. At the same time, SAP can build a cellular microenvironment for cell adhesion, proliferation, and differentiation that promotes bone reconstruction. As a result, a suitable bone graft fabricated by DBM/SAP scaffolds and bone marrow represents a new strategy and product for bone transplantation in the clinic. Copyright © 2014 Elsevier Ltd. All rights reserved.
Zeichner, S S; Colman, A S; Koch, P L; Polo-Silva, C; Galván-Magaña, F; Kim, S L
Sharks migrate annually over large distances and occupy a wide variety of habitats, complicating analysis of lifestyle and diet. A biogeochemical technique often used to reconstruct shark diet and environment preferences is stable isotope analysis, which is minimally invasive and integrates through time and space. There are previous studies that focus on isotopic analysis of shark soft tissues, but there are limited applications to shark teeth. However, shark teeth offer an advantage of multiple ecological snapshots and minimum invasiveness during removal because of their distinct conveyor belt tooth replacement system. In this study, we analyze δ 13 C and δ 15 N values of the organic matrix in leopard shark teeth (Triakis semifasciata) from a captive experiment and report discrimination factors as well as incorporation rates. We found differences in tooth discrimination factors for individuals fed different prey sources (mean ± SD; Δ 13 C squid = 4.7‰ ± 0.5‰, Δ 13 C tilapia = 3.1‰ ± 1.0‰, Δ 15 N squid = 2.0‰ ± 0.7‰, Δ 15 N tilapia = 2.8‰ ± 0.6‰). In addition, these values differed from previously published discrimination factors for plasma, red blood cells, and muscle of the same leopard sharks. Incorporation rates of shark teeth were similar for carbon and nitrogen (mean ± SE; λ C = 0.021 ± 0.009, λ N = 0.024 ± 0.007) and comparable to those of plasma. We emphasize the difference in biological parameters on the basis of tissue substrate and diet items to interpret stable isotope data and apply our results to stable isotope values from blue shark (Prionace glauca) teeth to illustrate the importance of biological parameters to interpret the complex ecology of a migratory shark.
M3: Matrix Multiplication on MapReduce
DEFF Research Database (Denmark)
Silvestri, Francesco; Ceccarello, Matteo
2015-01-01
M3 is an Hadoop library for performing dense and sparse matrix multiplication in MapReduce. The library is based on multi-round algorithms exploiting the 3D decomposition of the problem.......M3 is an Hadoop library for performing dense and sparse matrix multiplication in MapReduce. The library is based on multi-round algorithms exploiting the 3D decomposition of the problem....
Discriminative sparse coding on multi-manifolds
Wang, J.J.-Y.; Bensmail, H.; Yao, N.; Gao, Xin
2013-01-01
Sparse coding has been popularly used as an effective data representation method in various applications, such as computer vision, medical imaging and bioinformatics. However, the conventional sparse coding algorithms and their manifold-regularized variants (graph sparse coding and Laplacian sparse coding), learn codebooks and codes in an unsupervised manner and neglect class information that is available in the training set. To address this problem, we propose a novel discriminative sparse coding method based on multi-manifolds, that learns discriminative class-conditioned codebooks and sparse codes from both data feature spaces and class labels. First, the entire training set is partitioned into multiple manifolds according to the class labels. Then, we formulate the sparse coding as a manifold-manifold matching problem and learn class-conditioned codebooks and codes to maximize the manifold margins of different classes. Lastly, we present a data sample-manifold matching-based strategy to classify the unlabeled data samples. Experimental results on somatic mutations identification and breast tumor classification based on ultrasonic images demonstrate the efficacy of the proposed data representation and classification approach. 2013 The Authors. All rights reserved.
Discriminative sparse coding on multi-manifolds
Wang, J.J.-Y.
2013-09-26
Sparse coding has been popularly used as an effective data representation method in various applications, such as computer vision, medical imaging and bioinformatics. However, the conventional sparse coding algorithms and their manifold-regularized variants (graph sparse coding and Laplacian sparse coding), learn codebooks and codes in an unsupervised manner and neglect class information that is available in the training set. To address this problem, we propose a novel discriminative sparse coding method based on multi-manifolds, that learns discriminative class-conditioned codebooks and sparse codes from both data feature spaces and class labels. First, the entire training set is partitioned into multiple manifolds according to the class labels. Then, we formulate the sparse coding as a manifold-manifold matching problem and learn class-conditioned codebooks and codes to maximize the manifold margins of different classes. Lastly, we present a data sample-manifold matching-based strategy to classify the unlabeled data samples. Experimental results on somatic mutations identification and breast tumor classification based on ultrasonic images demonstrate the efficacy of the proposed data representation and classification approach. 2013 The Authors. All rights reserved.
Sparse Localization with a Mobile Beacon Based on LU Decomposition in Wireless Sensor Networks
Directory of Open Access Journals (Sweden)
Chunhui Zhao
2015-09-01
Full Text Available Node localization is the core in wireless sensor network. It can be solved by powerful beacons, which are equipped with global positioning system devices to know their location information. In this article, we present a novel sparse localization approach with a mobile beacon based on LU decomposition. Our scheme firstly translates node localization problem into a 1-sparse vector recovery problem by establishing sparse localization model. Then, LU decomposition pre-processing is adopted to solve the problem that measurement matrix does not meet the re¬stricted isometry property. Later, the 1-sparse vector can be exactly recovered by compressive sensing. Finally, as the 1-sparse vector is approximate sparse, weighted Cen¬troid scheme is introduced to accurately locate the node. Simulation and analysis show that our scheme has better localization performance and lower requirement for the mobile beacon than MAP+GC, MAP-M, and MAP-MN schemes. In addition, the obstacles and DOI have little effect on the novel scheme, and it has great localization performance under low SNR, thus, the scheme proposed is robust.
Gueddida, Saber; Yan, Zeyin; Kibalin, Iurii; Voufack, Ariste Bolivard; Claiser, Nicolas; Souhassou, Mohamed; Lecomte, Claude; Gillon, Béatrice; Gillet, Jean-Michel
2018-04-28
In this paper, we propose a simple cluster model with limited basis sets to reproduce the unpaired electron distributions in a YTiO 3 ferromagnetic crystal. The spin-resolved one-electron-reduced density matrix is reconstructed simultaneously from theoretical magnetic structure factors and directional magnetic Compton profiles using our joint refinement algorithm. This algorithm is guided by the rescaling of basis functions and the adjustment of the spin population matrix. The resulting spin electron density in both position and momentum spaces from the joint refinement model is in agreement with theoretical and experimental results. Benefits brought from magnetic Compton profiles to the entire spin density matrix are illustrated. We studied the magnetic properties of the YTiO 3 crystal along the Ti-O 1 -Ti bonding. We found that the basis functions are mostly rescaled by means of magnetic Compton profiles, while the molecular occupation numbers are mainly modified by the magnetic structure factors.
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
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
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
Regression with Sparse Approximations of Data
DEFF Research Database (Denmark)
Noorzad, Pardis; Sturm, Bob L.
2012-01-01
We propose sparse approximation weighted regression (SPARROW), a method for local estimation of the regression function that uses sparse approximation with a dictionary of measurements. SPARROW estimates the regression function at a point with a linear combination of a few regressands selected...... by a sparse approximation of the point in terms of the regressors. We show SPARROW can be considered a variant of \\(k\\)-nearest neighbors regression (\\(k\\)-NNR), and more generally, local polynomial kernel regression. Unlike \\(k\\)-NNR, however, SPARROW can adapt the number of regressors to use based...
Sparse adaptive filters for echo cancellation
Paleologu, Constantin
2011-01-01
Adaptive filters with a large number of coefficients are usually involved in both network and acoustic echo cancellation. Consequently, it is important to improve the convergence rate and tracking of the conventional algorithms used for these applications. This can be achieved by exploiting the sparseness character of the echo paths. Identification of sparse impulse responses was addressed mainly in the last decade with the development of the so-called ``proportionate''-type algorithms. The goal of this book is to present the most important sparse adaptive filters developed for echo cancellati
International Nuclear Information System (INIS)
Pindado, O.; Perez, R. M.; Garcia, S.
2013-01-01
The Positive Matrix Factorization (PMF) application to a set of PM2.5 data collected in a rural area of Madrid for a period of 1 year has been developed. Results has let describing the particulate faction of atmospheric aerosol collected in Chapineria according to 7 factor, among them fossil fuel combustion by traffic, wax plants, primary emissions of organic carbon, crustal material, and secondary organic aerosol. Five of these factors are related to primary particles; meanwhile only one factor has been associated to secondary particles. Finally, a factor has not been associated to any known source of particulate matter. (Author)
Sparse optimization for inverse problems in atmospheric modelling
Czech Academy of Sciences Publication Activity Database
Adam, Lukáš; Branda, Martin
2016-01-01
Roč. 79, č. 3 (2016), s. 256-266 ISSN 1364-8152 R&D Projects: GA MŠk(CZ) 7F14287 Institutional support: RVO:67985556 Keywords : Inverse modelling * Sparse optimization * Integer optimization * Least squares * European tracer experiment * Free Matlab codes Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 4.404, year: 2016 http://library.utia.cas.cz/separaty/2016/MTR/adam-0457037.pdf
Directory of Open Access Journals (Sweden)
Anna Janowska-Wieczorek
2012-07-01
Full Text Available Membrane type-1 matrix metalloproteinase (MT1-MMP has been implicated in tumor invasion, as well as trafficking of normal hematopoietic cells, and acts as a physiologic activator of proMMP-2. In this study we examined MT1-MMP expression in primary acute myeloid leukemia (AML cells. Because tumor necrosis factor (TNF-α is known to be elevated in AML, we also investigated the effect of TNF-α on MT1-MMP expression. We found (i MT1-MMP mRNA expression in 41 out of 43 primary AML samples tested; (ii activation of proMMP-2 in co-cultures of AML cells with normal bone marrow stromal cells; and (iii inhibition of proMMP-2 activation and trans-Matrigel migration of AML cells by gene silencing using MT1-MMP siRNA. Moreover, recombinant human TNF-α upregulated MT1-MMP expression in AML cells resulting in enhanced proMMP-2 activation and trans-Matrigel migration. Thus, AML cells express MT1-MMP and TNF-α enhances it leading to increased MMP-2 activation and most likely contributing to the invasive phenotype. We suggest that MT1-MMP, together with TNF-α, should be investigated as potential therapeutic targets in AML.
Sun, Weiwei; Ma, Jun; Yang, Gang; Du, Bo; Zhang, Liangpei
2017-06-01
A new Bayesian method named Poisson Nonnegative Matrix Factorization with Parameter Subspace Clustering Constraint (PNMF-PSCC) has been presented to extract endmembers from Hyperspectral Imagery (HSI). First, the method integrates the liner spectral mixture model with the Bayesian framework and it formulates endmember extraction into a Bayesian inference problem. Second, the Parameter Subspace Clustering Constraint (PSCC) is incorporated into the statistical program to consider the clustering of all pixels in the parameter subspace. The PSCC could enlarge differences among ground objects and helps finding endmembers with smaller spectrum divergences. Meanwhile, the PNMF-PSCC method utilizes the Poisson distribution as the prior knowledge of spectral signals to better explain the quantum nature of light in imaging spectrometer. Third, the optimization problem of PNMF-PSCC is formulated into maximizing the joint density via the Maximum A Posterior (MAP) estimator. The program is finally solved by iteratively optimizing two sub-problems via the Alternating Direction Method of Multipliers (ADMM) framework and the FURTHESTSUM initialization scheme. Five state-of-the art methods are implemented to make comparisons with the performance of PNMF-PSCC on both the synthetic and real HSI datasets. Experimental results show that the PNMF-PSCC outperforms all the five methods in Spectral Angle Distance (SAD) and Root-Mean-Square-Error (RMSE), and especially it could identify good endmembers for ground objects with smaller spectrum divergences.
International Nuclear Information System (INIS)
Marquez-Curtis, Leah A.; Shirvaikar, Neeta; Turner, A. Robert; Mirza, Imran; Surmawala, Amir; Larratt, Loree M.; Janowska-Wieczorek, Anna
2012-01-01
Membrane type-1 matrix metalloproteinase (MT1-MMP) has been implicated in tumor invasion, as well as trafficking of normal hematopoietic cells, and acts as a physiologic activator of proMMP-2. In this study we examined MT1-MMP expression in primary acute myeloid leukemia (AML) cells. Because tumor necrosis factor (TNF)-α is known to be elevated in AML, we also investigated the effect of TNF-α on MT1-MMP expression. We found (i) MT1-MMP mRNA expression in 41 out of 43 primary AML samples tested; (ii) activation of proMMP-2 in co-cultures of AML cells with normal bone marrow stromal cells; and (iii) inhibition of proMMP-2 activation and trans-Matrigel migration of AML cells by gene silencing using MT1-MMP siRNA. Moreover, recombinant human TNF-α upregulated MT1-MMP expression in AML cells resulting in enhanced proMMP-2 activation and trans-Matrigel migration. Thus, AML cells express MT1-MMP and TNF-α enhances it leading to increased MMP-2 activation and most likely contributing to the invasive phenotype. We suggest that MT1-MMP, together with TNF-α, should be investigated as potential therapeutic targets in AML
Lü, Li-Sha; Zhao, Wei-Hong; Miao, Hui
2013-03-01
Using excitation-emission matrix spectrum(EEMs) combined with parallel factor analysis (PARAFAC) examine the fluorescent components feature of dissolved organic matter (DOM) sampled from East China Sea in the summer and autumn was examined. The type, distribution and origin of the fluorescence dissolved organic matter were also discussed. Three fluorescent components were identified by PARAFAC, including protein-like component C1 (235, 280/330), terrestrial or marine humic-like component C2 (255, 330/400) and terrestrial humic-like component C3 (275, 360/480). The good linearity of the two humic-like components showed the same source or some relationship between the chemical constitutions. As a whole, the level of the fluorescence intensity in coastal ocean was higher than that of the open ocean in different water layers in two seasons. The relationship of three components with chlorophyll-a and salinity showed the DOM in the study area is almost not influenced by the living algal matter, but the fresh water outflow of the Yangtze River might be the source of them in the Yangtze River estuary in Summer. From what has been discussed above, we can draw the conclusion that the application of EEM-PARAFAC modeling will exert a profound influence upon the research of the dissolved organic matter.
Directory of Open Access Journals (Sweden)
R.R. Guerra
2009-11-01
Full Text Available Nutritional substances associated to some hormones enhance liver regeneration when injected intraperitoneally, being denominated hepatotrophic factors (HF. Here we verified if a solution of HF (glucose, vitamins, salts, amino acids, glucagon, insulin, and triiodothyronine can revert liver cirrhosis and how some extracellular matrices are affected. Cirrhosis was induced for 14 weeks in 45 female Wistar rats (200 mg by intraperitoneal injections of thioacetamide (200 mg/kg. Twenty-five rats received intraperitoneal HF twice a day for 10 days (40 mL·kg-1·day-1 and 20 rats received physiological saline. Fifteen rats were used as control. The HF applied to cirrhotic rats significantly: a reduced the relative mRNA expression of the genes: Col-α1 (-53%, TIMP-1 (-31.7%, TGF-β1 (-57.7%, and MMP-2 (-41.6%, whereas Plau mRNA remained unchanged; b reduced GGT (-43.1%, ALT (-17.6%, and AST (-12.2% serum levels; c increased liver weight (11.3%, and reduced liver collagen (-37.1%, regenerative nodules size (-22.1%, and fibrous septum thickness. Progranulin protein (immunohistochemistry and mRNA (in situ hybridization were found in fibrous septa and areas of bile duct proliferation in cirrhotic livers. Concluding, HF improved the histology and serum biochemistry of liver cirrhosis, with an important reduction of interstitial collagen and increased extracelullar matrix degradation by reducing profibrotic gene expression.
Guo, Wei-Dong; Huang, Jian-Ping; Hong, Hua-Sheng; Xu, Jing; Deng, Xun
2010-06-01
The distribution and estuarine behavior of fluorescent components of chromophoric dissolved organic matter (CDOM) from Jiulong Estuary were determined by fluorescence excitation emission matrix spectroscopy (EEMs) combined with parallel factor analysis (PARAFAC). The feasibility of these components as tracers for organic pollution in estuarine environments was also evaluated. Four separate fluorescent components were identified by PARAFAC, including three humic-like components (C1: 240, 310/382 nm; C2: 230, 250, 340/422 nm; C4: 260, 390/482 nm) and one protein-like components (C3: 225, 275/342 nm). These results indicated that UV humic-like peak A area designated by traditional "peak-picking method" was not a single peak but actually a combination of several fluorescent components, and it also had inherent links to so-called marine humic-like peak M or terrestrial humic-like peak C. Component C2 which include peak M decreased with increase of salinity in Jiulong Estuary, demonstrating that peak M can not be thought as the specific indicator of the "marine" humic-like component. Two humic-like components C1 and C2 showed additional behavior in the turbidity maximum region (salinity CDOM may provide a fast in-situ way to monitor the variation of the degree of organic pollution in estuarine environments.
Energy Technology Data Exchange (ETDEWEB)
Broekelmann, T.J.; Limper, A.H.; McDonald, J.A. (Washington Univ., St. Louis, MO (United States)); Colby, T.V. (Mayo Clinic, Rochester, MN (United States))
1991-08-01
Idiopathic pulmonary fibrosis is an inexorably fatal disorder characterized by connective tissue deposition within the terminal air spaces resulting in loss of lung function and eventual respiratory failure. Previously, the authors demonstrated that foci of activated fibroblasts expressing high levels of fibronectin, procollagen, and smooth muscle actin and thus resembling those found in healing wounds are responsible for the connective tissue deposition and scarring in idiopathic pulmonary fibrosis. Using in situ hybridization and immunohistochemistry, they now demonstrate the presence of transforming growth factor {beta}{sub 1} (TGF-{beta}{sub 1}), a potent profibrotic cytokine, in the foci containing these activated fibroblasts. These results suggest that matrix-associated TGF-{beta}{sub 1} may serve as a stimulus for the persistent expression of connective tissue genes. One potential source of the TGF-{beta}{sub 1} is the alveolar macrophage, and they demonstrate the expression of abundant TGF-{beta}{sub 1} mRNA in alveolar macrophages in lung tissue from patients with idiopathic pulmonary fibrosis.
Domínguez-Sáez, Aida; Viana, Mar; Barrios, Carmen C; Rubio, Jose R; Amato, Fulvio; Pujadas, Manuel; Querol, Xavier
2012-10-16
A novel on-board system was tested to characterize size-resolved particle number emission patterns under real-world driving conditions, running in a EURO4 diesel vehicle and in a typical urban circuit in Madrid (Spain). Emission profiles were determined as a function of driving conditions. Source apportionment by Positive Matrix Factorization (PMF) was carried out to interpret the real-world driving conditions. Three emission patterns were identified: (F1) cruise conditions, with medium-high speeds, contributing in this circuit with 60% of total particle number and a particle size distribution dominated by particles >52 nm and around 60 nm; (F2) transient conditions, stop-and-go conditions at medium-high speed, contributing with 25% of the particle number and mainly emitting particles in the nucleation mode; and (F3) creep-idle conditions, representing traffic congestion and frequent idling periods, contributing with 14% to the total particle number and with particles in the nucleation mode (emissions depending on particle size and driving conditions. Differences between real-world emission patterns and regulatory cycles (NEDC) are also presented, which evidence that detecting particle number emissions real-world driving conditions.
Ferdous, Zannatul; Wei, Victoria Mariko; Iozzo, Renato; Höök, Magnus; Grande-Allen, Kathryn Jane
2007-12-07
The small leucine-rich proteoglycan decorin has been demonstrated to be a key regulator of collagen fibrillogenesis; decorin deficiencies lead to irregularly shaped collagen fibrils and weakened material behavior in postnatal murine connective tissues. In an in vitro investigation of the contributions of decorin to tissue organization and material behavior, model tissues were engineered by seeding embryonic fibroblasts, harvested from 12.5-13.5 days gestational aged decorin null (Dcn(-/-)) or wild-type mice, within type I collagen gels. The resulting three-dimensional collagen matrices were cultured for 4 weeks under static tension. The collagen matrices seeded with Dcn(-/-) cells exhibited greater contraction, cell density, ultimate tensile strength, and elastic modulus than those seeded with wild-type cells. Ultrastructurally, the matrices seeded with Dcn(-/-) cells contained a greater density of collagen. The decorin-null tissues contained more biglycan than control tissues, suggesting that this related proteoglycan compensated for the absence of decorin. The effect of transforming growth factor-beta (TGF-beta), which is normally sequestered by decorin, was also investigated in this study. The addition of TGF-beta1 to the matrices seeded with wild-type cells improved their contraction and mechanical strength, whereas blocking TGF-beta1 in the Dcn(-/-) cell-seeded matrices significantly reduced the collagen gel contraction. These results indicate that the inhibitory interaction between decorin and TGF-beta1 significantly influenced the matrix organization and material behavior of these in vitro model tissues.
Benhalouche, Fatima Zohra; Karoui, Moussa Sofiane; Deville, Yannick; Ouamri, Abdelaziz
2015-10-01
In this paper, a new Spectral-Unmixing-based approach, using Nonnegative Matrix Factorization (NMF), is proposed to locally multi-sharpen hyperspectral data by integrating a Digital Surface Model (DSM) obtained from LIDAR data. In this new approach, the nature of the local mixing model is detected by using the local variance of the object elevations. The hyper/multispectral images are explored using small zones. In each zone, the variance of the object elevations is calculated from the DSM data in this zone. This variance is compared to a threshold value and the adequate linear/linearquadratic spectral unmixing technique is used in the considered zone to independently unmix hyperspectral and multispectral data, using an adequate linear/linear-quadratic NMF-based approach. The obtained spectral and spatial information thus respectively extracted from the hyper/multispectral images are then recombined in the considered zone, according to the selected mixing model. Experiments based on synthetic hyper/multispectral data are carried out to evaluate the performance of the proposed multi-sharpening approach and literature linear/linear-quadratic approaches used on the whole hyper/multispectral data. In these experiments, real DSM data are used to generate synthetic data containing linear and linear-quadratic mixed pixel zones. The DSM data are also used for locally detecting the nature of the mixing model in the proposed approach. Globally, the proposed approach yields good spatial and spectral fidelities for the multi-sharpened data and significantly outperforms the used literature methods.
Zhou, Y; Wen, F; Zhang, P; Tang, R; Li, Q
2013-03-01
Malignant ascites is common in various types of cancers and is difficult to manage. Vascular endothelial growth factor (VEGF) has a pivotal role in malignant ascites. The matrix protein of vesicular stomatitis virus (VSVMP) has been shown to inhibit host gene expression and induce the apoptosis of cancer cells. The present study was designed to determine whether VSVMP suppresses the formation of ascites in ascites-producing peritoneal carcinomatosis. BALB/c female mice, 6-8 weeks old, bearing peritoneal tumors of H22 or MethA cells received an intraperitoneal administration of 50 μg VSVMP/250 μg liposome complexes, 50 μg empty plasmid/250 μg liposome complexes or 0.9% NaCl solution, respectively, every 2 days for 3 weeks. Administration of VSVMP resulted in a significant inhibition in ascites formation, improvement in health condition and prolonged survival of the treated mice. Decreased peritoneum osmolarity and reduced tumor vascularity coincided with dramatic reductions in the VEGF level in ascites fluid and plasma. Examination of floating tumor cells collected from the peritoneal wash revealed an apparently increased number of apoptotic cells and profound downregulation of VEGF mRNA in the VSVMP-treated mice. Our data indicate for the first time that in BALB/c mice bearing H22 or MethA cell peritoneal tumors, VSVMP may inhibit VEGF production and suppress angiogenesis, consequently abolishing ascites formation.
Maqbool, Tahir; Quang, Viet Ly; Cho, Jinwoo; Hur, Jin
2016-06-01
In this study, we successfully tracked the dynamic changes in different constitutes of bound extracellular polymeric substances (bEPS), soluble microbial products (SMP), and permeate during the operation of bench scale membrane bioreactors (MBRs) via fluorescence excitation-emission matrix (EEM) combined with parallel factor analysis (PARAFAC). Three fluorescent groups were identified, including two protein-like (tryptophan-like C1 and tyrosine-like C2) and one microbial humic-like components (C3). In bEPS, protein-like components were consistently more dominant than C3 during the MBR operation, while their relative abundance in SMP depended on aeration intensities. C1 of bEPS exhibited a linear correlation (R(2)=0.738; pbEPS amounts in sludge, and C2 was closely related to the stability of sludge. The protein-like components were more greatly responsible for membrane fouling. Our study suggests that EEM-PARAFAC can be a promising monitoring tool to provide further insight into process evaluation and membrane fouling during MBR operation. Copyright © 2016 Elsevier Ltd. All rights reserved.
Wang, Wenhui; Qi, Yuanling; Xu, Qian; Ren, Haipeng
2016-03-01
To detect the expression of kisspeptin-1 (KISS-1), matrix metalloproteinase-2 (MMP-2) and vascular endothelial growth factor (VEGF) in the tissue of colon cancer, and analyze the relativity between KISS-1, MMP-2, VEGF and pathological characteristics of colon cancer. A total of 60 colon cancer patients and 60 patients with benign colorectal disease who received surgical treatment in our hospital from January 2009 to June 2010 were selected as observation group and control group respectively. The cancer tissue samples and excision samples collected from them were used to detect KISS-1, MMP-2 and VEGF with immunohistochemistry. The positive rates of KISS-1, MMP-2 and VEGF were 31.7%, 58.3% and 78.3% in observation group, and 73.3%, 16.7% and 33.3% in control group. The positive rate of KISS-1 in observation group was lower than that in control group (χ(2)=23.489, Pcolon cancer (χ(2)=8.997, P=0.011; χ(2)=6.163, P=0.013; χ(2)=8.519, P=0.014; χ(2)=9.160, P=0.002; χ(2)=16.577, Pclinical stage of colon cancer and provide evidence for clinical diagnosis and prognosis prediction by detecting KISS-1, MMP-2 and VEGF.
Energy Technology Data Exchange (ETDEWEB)
Marquez-Curtis, Leah A.; Shirvaikar, Neeta [Canadian Blood Services R& D, Edmonton, Alberta T6G 2R8 (Canada); Turner, A. Robert [Departments of Medicine and Oncology, University of Alberta, Edmonton, Alberta T6G 2G3 (Canada); Mirza, Imran [Department of Laboratory Medicine and Pathology, University of Alberta, Edmonton, Alberta T6G 2B7 (Canada); Surmawala, Amir; Larratt, Loree M. [Departments of Medicine and Oncology, University of Alberta, Edmonton, Alberta T6G 2G3 (Canada); Janowska-Wieczorek, Anna, E-mail: anna.janowska@blood.ca [Canadian Blood Services R& D, Edmonton, Alberta T6G 2R8 (Canada); Departments of Medicine and Oncology, University of Alberta, Edmonton, Alberta T6G 2G3 (Canada)
2012-07-25
Membrane type-1 matrix metalloproteinase (MT1-MMP) has been implicated in tumor invasion, as well as trafficking of normal hematopoietic cells, and acts as a physiologic activator of proMMP-2. In this study we examined MT1-MMP expression in primary acute myeloid leukemia (AML) cells. Because tumor necrosis factor (TNF)-α is known to be elevated in AML, we also investigated the effect of TNF-α on MT1-MMP expression. We found (i) MT1-MMP mRNA expression in 41 out of 43 primary AML samples tested; (ii) activation of proMMP-2 in co-cultures of AML cells with normal bone marrow stromal cells; and (iii) inhibition of proMMP-2 activation and trans-Matrigel migration of AML cells by gene silencing using MT1-MMP siRNA. Moreover, recombinant human TNF-α upregulated MT1-MMP expression in AML cells resulting in enhanced proMMP-2 activation and trans-Matrigel migration. Thus, AML cells express MT1-MMP and TNF-α enhances it leading to increased MMP-2 activation and most likely contributing to the invasive phenotype. We suggest that MT1-MMP, together with TNF-α, should be investigated as potential therapeutic targets in AML.
Directory of Open Access Journals (Sweden)
Jong-Shiaw Jin
2006-01-01
Full Text Available Aim: Extracellular matrix metalloprotease inducer (EMMPRIN expression was demonstrated in several cancers, but its expression profile in colorectal cancers remains unclear. Epidermal growth factor receptor (EGFR was reported to regulate EMMPRIN expression in human epithelial cancers. Our purpose was to determine EMMPRIN expression and its relationship with EGFR in colorectal cancers.
Jespersen, S.; Koedam, J.A.; Hoogerbrugge, C.M.; Tjaden, U.R.; Greef, J. van der; Brande, J.L. van den
1996-01-01
High molecular weight precursors of insulin-like growth factor II (IGF-II) were isolated from Cohn fraction IV of human plasma by ultrafiltration, affinity chromatography and reversed-phase high-performance liquid chromatography. Molecular weight determination by matrix-assisted laser
Codesign of Beam Pattern and Sparse Frequency Waveforms for MIMO Radar
Directory of Open Access Journals (Sweden)
Chaoyun Mai
2015-01-01
Full Text Available Multiple-input multiple-output (MIMO radar takes the advantages of high degrees of freedom for beam pattern design and waveform optimization, because each antenna in centralized MIMO radar system can transmit different signal waveforms. When continuous band is divided into several pieces, sparse frequency radar waveforms play an important role due to the special pattern of the sparse spectrum. In this paper, we start from the covariance matrix of the transmitted waveform and extend the concept of sparse frequency design to the study of MIMO radar beam pattern. With this idea in mind, we first solve the problem of semidefinite constraint by optimization tools and get the desired covariance matrix of the ideal beam pattern. Then, we use the acquired covariance matrix and generalize the objective function by adding the constraint of both constant modulus of the signals and corresponding spectrum. Finally, we solve the objective function by the cyclic algorithm and obtain the sparse frequency MIMO radar waveforms with desired beam pattern. The simulation results verify the effectiveness of this method.
Global Convergence of Schubert’s Method for Solving Sparse Nonlinear Equations
Directory of Open Access Journals (Sweden)
Huiping Cao
2014-01-01
Full Text Available Schubert’s method is an extension of Broyden’s method for solving sparse nonlinear equations, which can preserve the zero-nonzero structure defined by the sparse Jacobian matrix and can retain many good properties of Broyden’s method. In particular, Schubert’s method has been proved to be locally and q-superlinearly convergent. In this paper, we globalize Schubert’s method by using a nonmonotone line search. Under appropriate conditions, we show that the proposed algorithm converges globally and superlinearly. Some preliminary numerical experiments are presented, which demonstrate that our algorithm is effective for large-scale problems.
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.
Structure-based bayesian sparse reconstruction
Quadeer, Ahmed Abdul; Al-Naffouri, Tareq Y.
2012-01-01
Sparse signal reconstruction algorithms have attracted research attention due to their wide applications in various fields. In this paper, we present a simple Bayesian approach that utilizes the sparsity constraint and a priori statistical
Tunable Sparse Network Coding for Multicast Networks
DEFF Research Database (Denmark)
Feizi, Soheil; Roetter, Daniel Enrique Lucani; Sørensen, Chres Wiant
2014-01-01
This paper shows the potential and key enabling mechanisms for tunable sparse network coding, a scheme in which the density of network coded packets varies during a transmission session. At the beginning of a transmission session, sparsely coded packets are transmitted, which benefits decoding...... complexity. At the end of a transmission, when receivers have accumulated degrees of freedom, coding density is increased. We propose a family of tunable sparse network codes (TSNCs) for multicast erasure networks with a controllable trade-off between completion time performance to decoding complexity...... a mechanism to perform efficient Gaussian elimination over sparse matrices going beyond belief propagation but maintaining low decoding complexity. Supporting simulation results are provided showing the trade-off between decoding complexity and completion time....
SPARSE ELECTROMAGNETIC IMAGING USING NONLINEAR LANDWEBER ITERATIONS
Desmal, Abdulla; Bagci, Hakan
2015-01-01
minimization problem is solved using nonlinear Landweber iterations, where at each iteration a thresholding function is applied to enforce the sparseness-promoting L0/L1-norm constraint. The thresholded nonlinear Landweber iterations are applied to several two
Fast Solution in Sparse LDA for Binary Classification
Moghaddam, Baback
2010-01-01
An algorithm that performs sparse linear discriminant analysis (Sparse-LDA) finds near-optimal solutions in far less time than the prior art when specialized to binary classification (of 2 classes). Sparse-LDA is a type of feature- or variable- selection problem with numerous applications in statistics, machine learning, computer vision, computational finance, operations research, and bio-informatics. Because of its combinatorial nature, feature- or variable-selection problems are NP-hard or computationally intractable in cases involving more than 30 variables or features. Therefore, one typically seeks approximate solutions by means of greedy search algorithms. The prior Sparse-LDA algorithm was a greedy algorithm that considered the best variable or feature to add/ delete to/ from its subsets in order to maximally discriminate between multiple classes of data. The present algorithm is designed for the special but prevalent case of 2-class or binary classification (e.g. 1 vs. 0, functioning vs. malfunctioning, or change versus no change). The present algorithm provides near-optimal solutions on large real-world datasets having hundreds or even thousands of variables or features (e.g. selecting the fewest wavelength bands in a hyperspectral sensor to do terrain classification) and does so in typical computation times of minutes as compared to days or weeks as taken by the prior art. Sparse LDA requires solving generalized eigenvalue problems for a large number of variable subsets (represented by the submatrices of the input within-class and between-class covariance matrices). In the general (fullrank) case, the amount of computation scales at least cubically with the number of variables and thus the size of the problems that can be solved is limited accordingly. However, in binary classification, the principal eigenvalues can be found using a special analytic formula, without resorting to costly iterative techniques. The present algorithm exploits this analytic
Learning sparse generative models of audiovisual signals
Monaci, Gianluca; Sommer, Friedrich T.; Vandergheynst, Pierre
2008-01-01
This paper presents a novel framework to learn sparse represen- tations for audiovisual signals. An audiovisual signal is modeled as a sparse sum of audiovisual kernels. The kernels are bimodal functions made of synchronous audio and video components that can be positioned independently and arbitrarily in space and time. We design an algorithm capable of learning sets of such audiovi- sual, synchronous, shift-invariant functions by alternatingly solving a coding and a learning pr...
Relaxations to Sparse Optimization Problems and Applications
Skau, Erik West
Parsimony is a fundamental property that is applied to many characteristics in a variety of fields. Of particular interest are optimization problems that apply rank, dimensionality, or support in a parsimonious manner. In this thesis we study some optimization problems and their relaxations, and focus on properties and qualities of the solutions of these problems. The Gramian tensor decomposition problem attempts to decompose a symmetric tensor as a sum of rank one tensors.We approach the Gramian tensor decomposition problem with a relaxation to a semidefinite program. We study conditions which ensure that the solution of the relaxed semidefinite problem gives the minimal Gramian rank decomposition. Sparse representations with learned dictionaries are one of the leading image modeling techniques for image restoration. When learning these dictionaries from a set of training images, the sparsity parameter of the dictionary learning algorithm strongly influences the content of the dictionary atoms.We describe geometrically the content of trained dictionaries and how it changes with the sparsity parameter.We use statistical analysis to characterize how the different content is used in sparse representations. Finally, a method to control the structure of the dictionaries is demonstrated, allowing us to learn a dictionary which can later be tailored for specific applications. Variations of dictionary learning can be broadly applied to a variety of applications.We explore a pansharpening problem with a triple factorization variant of coupled dictionary learning. Another application of dictionary learning is computer vision. Computer vision relies heavily on object detection, which we explore with a hierarchical convolutional dictionary learning model. Data fusion of disparate modalities is a growing topic of interest.We do a case study to demonstrate the benefit of using social media data with satellite imagery to estimate hazard extents. In this case study analysis we
Hyperspectral Unmixing with Robust Collaborative Sparse Regression
Directory of Open Access Journals (Sweden)
Chang Li
2016-07-01
Full Text Available Recently, sparse unmixing (SU of hyperspectral data has received particular attention for analyzing remote sensing images. However, most SU methods are based on the commonly admitted linear mixing model (LMM, which ignores the possible nonlinear effects (i.e., nonlinearity. In this paper, we propose a new method named robust collaborative sparse regression (RCSR based on the robust LMM (rLMM for hyperspectral unmixing. The rLMM takes the nonlinearity into consideration, and the nonlinearity is merely treated as outlier, which has the underlying sparse property. The RCSR simultaneously takes the collaborative sparse property of the abundance and sparsely distributed additive property of the outlier into consideration, which can be formed as a robust joint sparse regression problem. The inexact augmented Lagrangian method (IALM is used to optimize the proposed RCSR. The qualitative and quantitative experiments on synthetic datasets and real hyperspectral images demonstrate that the proposed RCSR is efficient for solving the hyperspectral SU problem compared with the other four state-of-the-art algorithms.
Mantas, E.; Remoundaki, E.; Halari, I.; Kassomenos, P.; Theodosi, C.; Hatzikioseyian, A.; Mihalopoulos, N.
2014-09-01
A systematic monitoring of PM2.5 was carried out during a period of three years (from February 2010 to April 2013) at an urban site, at the National Technical University of Athens campus. Two types of 24-h PM2.5 samples have been collected: 271 samples on PTFE and 116 samples on quartz filters. Daily PM2.5 concentrations were determined for both types of samples. Total sulfur, crustal origin elements and elements of a major crustal component (Al, Si, Fe, Ca, K, Mg, Ti) trace elements (Zn, Pb, Cu, Ni, P, V, Cr, Mn) and water soluble ions (Cl-, NO3-, SO42-, Na+, K+, NH4+, Ca2+, Mg2+) were determined on the PTFE samples. Organic carbon (OC), elemental carbon (EC) and water soluble ions were determined on the quartz samples. For the mass closure six components were considered: Secondary Inorganic Aerosol (SIA), Organic Matter (OM), Elemental Carbon (EC), Dust, Mineral anthropogenic component (MIN) and Sea Salt (SS). SIA and OM contributed in the mass of PM2.5 almost equally: 30-36% and 30% respectively. EC, SS and MIN accounted for 5, 4 and 3% respectively of the total PM2.5 mass. Dust accounted for about 3-5% in absence of dust transport event and reached a much higher percentage in case of dust transport event. These contributions justify at least 80% of the PM2.5 mass. Source apportionment analysis has been performed by Positive Matrix Factorization. The combination of the PMF results obtained by both data sets lead to the definition of six factors: 1. SO42-, NH4+, OC (industrial/regional sources, secondary aerosol) 2. EC, OC, K and trace metals (traffic and heating by biomass burning, locally emitted aerosol). 3. Ca, EC, OC and trace metals (urban-resuspended road dust reflecting exhaust emissions), 4. Secondary nitrates 5. Na, Cl (marine source) 6. Si, Al, Ti, Ca, Fe (Dust transported from Sahara). These factors reflect not only main sources contributions but also underline the key role of atmospheric dynamics and aerosol ageing processes in this Mediterranean
SAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos
Energy Technology Data Exchange (ETDEWEB)
Ahlfeld, R., E-mail: r.ahlfeld14@imperial.ac.uk; Belkouchi, B.; Montomoli, F.
2016-09-01
A new arbitrary Polynomial Chaos (aPC) method is presented for moderately high-dimensional problems characterised by limited input data availability. The proposed methodology improves the algorithm of aPC and extends the method, that was previously only introduced as tensor product expansion, to moderately high-dimensional stochastic problems. The fundamental idea of aPC is to use the statistical moments of the input random variables to develop the polynomial chaos expansion. This approach provides the possibility to propagate continuous or discrete probability density functions and also histograms (data sets) as long as their moments exist, are finite and the determinant of the moment matrix is strictly positive. For cases with limited data availability, this approach avoids bias and fitting errors caused by wrong assumptions. In this work, an alternative way to calculate the aPC is suggested, which provides the optimal polynomials, Gaussian quadrature collocation points and weights from the moments using only a handful of matrix operations on the Hankel matrix of moments. It can therefore be implemented without requiring prior knowledge about statistical data analysis or a detailed understanding of the mathematics of polynomial chaos expansions. The extension to more input variables suggested in this work, is an anisotropic and adaptive version of Smolyak's algorithm that is solely based on the moments of the input probability distributions. It is referred to as SAMBA (PC), which is short for Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos. It is illustrated that for moderately high-dimensional problems (up to 20 different input variables or histograms) SAMBA can significantly simplify the calculation of sparse Gaussian quadrature rules. SAMBA's efficiency for multivariate functions with regard to data availability is further demonstrated by analysing higher order convergence and accuracy for a set of nonlinear test functions with 2, 5
SAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos
International Nuclear Information System (INIS)
Ahlfeld, R.; Belkouchi, B.; Montomoli, F.
2016-01-01
A new arbitrary Polynomial Chaos (aPC) method is presented for moderately high-dimensional problems characterised by limited input data availability. The proposed methodology improves the algorithm of aPC and extends the method, that was previously only introduced as tensor product expansion, to moderately high-dimensional stochastic problems. The fundamental idea of aPC is to use the statistical moments of the input random variables to develop the polynomial chaos expansion. This approach provides the possibility to propagate continuous or discrete probability density functions and also histograms (data sets) as long as their moments exist, are finite and the determinant of the moment matrix is strictly positive. For cases with limited data availability, this approach avoids bias and fitting errors caused by wrong assumptions. In this work, an alternative way to calculate the aPC is suggested, which provides the optimal polynomials, Gaussian quadrature collocation points and weights from the moments using only a handful of matrix operations on the Hankel matrix of moments. It can therefore be implemented without requiring prior knowledge about statistical data analysis or a detailed understanding of the mathematics of polynomial chaos expansions. The extension to more input variables suggested in this work, is an anisotropic and adaptive version of Smolyak's algorithm that is solely based on the moments of the input probability distributions. It is referred to as SAMBA (PC), which is short for Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos. It is illustrated that for moderately high-dimensional problems (up to 20 different input variables or histograms) SAMBA can significantly simplify the calculation of sparse Gaussian quadrature rules. SAMBA's efficiency for multivariate functions with regard to data availability is further demonstrated by analysing higher order convergence and accuracy for a set of nonlinear test functions with 2, 5 and 10
DEFF Research Database (Denmark)
Bundgaard, Eva; Livi, Francesco; Hagemann, Ole
2015-01-01
The results presented demonstrate how the screening of 104 light-absorbing low band gap polymers for suitability in roll coated polymer solar cells can be accomplished through rational synthesis according to a matrix where 8 donor and 13 acceptor units are organized in rows and columns. Synthesis...... silver comb back electrode structure. The matrix organization enables fast identification of active layer materials according to a weighted merit factor that includes more than simply the power conversion efficiency and is used as a method to identify the lead candidates. Based on several characteristics...
Fu, Szu-Wei; Li, Pei-Chun; Lai, Ying-Hui; Yang, Cheng-Chien; Hsieh, Li-Chun; Tsao, Yu
2017-11-01
Objective: This paper focuses on machine learning based voice conversion (VC) techniques for improving the speech intelligibility of surgical patients who have had parts of their articulators removed. Because of the removal of parts of the articulator, a patient's speech may be distorted and difficult to understand. To overcome this problem, VC methods can be applied to convert the distorted speech such that it is clear and more intelligible. To design an effective VC method, two key points must be considered: 1) the amount of training data may be limited (because speaking for a long time is usually difficult for postoperative patients); 2) rapid conversion is desirable (for better communication). Methods: We propose a novel joint dictionary learning based non-negative matrix factorization (JD-NMF) algorithm. Compared to conventional VC techniques, JD-NMF can perform VC efficiently and effectively with only a small amount of training data. Results: The experimental results demonstrate that the proposed JD-NMF method not only achieves notably higher short-time objective intelligibility (STOI) scores (a standardized objective intelligibility evaluation metric) than those obtained using the original unconverted speech but is also significantly more efficient and effective than a conventional exemplar-based NMF VC method. Conclusion: The proposed JD-NMF method may outperform the state-of-the-art exemplar-based NMF VC method in terms of STOI scores under the desired scenario. Significance: We confirmed the advantages of the proposed joint training criterion for the NMF-based VC. Moreover, we verified that the proposed JD-NMF can effectively improve the speech intelligibility scores of oral surgery patients. Objective: This paper focuses on machine learning based voice conversion (VC) techniques for improving the speech intelligibility of surgical patients who have had parts of their articulators removed. Because of the removal of parts of the articulator, a patient
Marsh, Erica E; Chibber, Shani; Wu, Ju; Siegersma, Kendra; Kim, Julie; Bulun, Serdar
2016-04-01
To determine the presence, differential expression, and regulation of epidermal growth factor-containing fibulin-like extracellular matrix protein 1 (EFEMP1) in uterine leiomyomas. Laboratory in vivo and in vitro study with the use of human leiomyoma and myometrial tissue and primary cells. Academic medical center. Leiomyoma and myometrial tissue samples and cultured cells. 5-Aza-2'-deoxycytidine (5-aza-dC) treatment. Fold-change difference between EFEMP1 and fibulin-3 expression in leiomyoma tissue and cells compared with matched myometrial samples, and fold-change difference in EFEMP1 expression with 5-Aza-dC treatment. In vivo, EFEMP1 expression was 3.19-fold higher in myometrial tissue than in leiomyoma tissue. EFEMP1 expression in vitro was 5.03-fold higher in myometrial cells than in leiomyoma cells. Western blot and immunohistochemistry staining of tissue and cells confirmed similar findings in protein expression. Treatment of leiomyoma cells with 5-Aza-dC resulted in increased expression of EFEMP1 in vitro. The EFEMP1 gene and its protein product, fibulin-3, are both significantly down-regulated in leiomyoma compared with myometrium when studied both in vivo and in vitro. The increase in EFEMP1 expression in leiomyoma cells with 5-Aza-dC treatment suggest that differential methylation is responsible, in part, for the differences seen in gene expression. Copyright © 2016 American Society for Reproductive Medicine. Published by Elsevier Inc. All rights reserved.
Directory of Open Access Journals (Sweden)
Wen-Yuan Ho
2018-06-01
Full Text Available Fine particulate matter (PM2.5 has a small particle size, which allows it to directly enter the respiratory mucosa and reach the alveoli and even the blood. Many countries are already aware of the adverse effects of PM2.5, and determination of the sources of PM2.5 is a critical step in reducing its concentration to protect public health. This study monitored PM2.5 in the summer (during the southwest monsoon season of 2017. Three online monitoring systems were used to continuously collect hourly concentrations of key chemical components of PM2.5, including anions, cations, carbon, heavy metals, and precursor gases, for 24 h per day. The sum of the concentrations of each compound obtained from the online monitoring systems is similar to the actual PM2.5 concentration (98.75%. This result suggests that the on-line monitoring system of this study covers relatively complete chemical compounds. Positive matrix factorization (PMF was adopted to explore and examine the proportion of each source that contributed to the total PM2.5 concentration. According to the source contribution analysis, 55% of PM2.5 can be attributed to local pollutant sources, and the remaining 45% can be attributed to pollutants emitted outside Taipei City. During the high-PM2.5-concentration (episode period, the pollutant conversion rates were higher than usual due to the occurrence of vigorous photochemical reactions. Moreover, once pollutants are emitted by external stationary pollutant sources, they move with pollution air masses and undergo photochemical reactions, resulting in increases in the secondary pollutant concentrations of PM2.5. The vertical monitoring data indicate that there is a significant increase in PM2.5 concentration at high altitudes. High-altitude PM2.5 will descend to the ground and thereby affect the ground-level PM2.5 concentration.
Directory of Open Access Journals (Sweden)
J. S. Han
2006-01-01
Full Text Available Size- and time-resolved aerosol samples were collected using an eight-stage Davis rotating unit for monitoring (DRUM sampler from 29 March to 29 May in 2002 at Gosan, Jeju Island, Korea, which is one of the representative background sites in East Asia. These samples were analyzed using synchrotron X-ray fluorescence for 3-h average concentrations of 19 elements consisting of S, Si, Al, Fe, Ca, Cl, Cu, Zn, Ti, K, Mn, Pb, Ni, V, Se, As, Rb, Cr, Br. The size-resolved data sets were then analyzed using the positive matrix factorization (PMF technique in order to identify possible sources and estimate their contribution to particulate matter mass. PMF analysis uses the uncertainty of the measured data to provide an optimal weighting. Fifteen sources were resolved in eight size ranges (0.07~12 μm and included continental soil, local soil, sea salt, biomass/biofuel burning, coal combustion, oil heating furnace, residual oil fired boiler, municipal incineration, nonferrous metal source, ferrous metal source, gasoline vehicle, diesel vehicle, copper smelter and volcanic emission. PMF analysis of size-resolved source contributions showed that natural sources represented by local soil, sea salt and continental soil contributed about 79% to the predicted primary particulate matter (PM mass in the coarse size range (1.15~12 μm. On the other hand, anthropogenic sources such as coal combustion and biomass/biofuel burning contributed about 60% in the fine size range (0.56~2.5 μm. The diesel vehicle source contributed the most in the ultra-fine size range (0.07~0.56 μm and was responsible for about 52% of the primary PM mass.
International Nuclear Information System (INIS)
Bashkin, P.; Doctrow, S.; Klagsbrun, M.; Svahn, C.M.; Folkman, J.; Vlodavsky, I.
1989-01-01
Basic fibroblast growth factor (bFGF) exhibits specific binding to the extracellular matrix (ECM) produced by cultured endothelial cells. Binding was saturable as a function both of time and of concentration of 125 I-bFGF. Scatchard analysis of FGF binding revealed the presence of about 1.5 x 10 12 binding sites/mm 2 ECM with an apparent k D of 610 nM. FGF binds to heparan sulfate (HS) in ECM as evidenced by (i) inhibition of binding in the presence of heparin or HS at 0.1-1 μg/mL, but not by chondroitin sulfate, keratan sulfate, or hyaluronic acid at 10 μg/mL, (ii) lack of binding to ECM pretreated with heparitinase, but not with chondroitinase ABC, and (iii) rapid release of up to 90% of ECM-bound FGF by exposure to heparin, HS, or heparitinase, but not to chondroitin sulfate, keratan sulfate, hyaluronic acid, or chondroitinase ABC. Oligosaccharides derived from depolymerized heparin, and as small as the tetrasaccharide, released the ECM-bound FGF, but there was little or no release of FGF by modified nonanticoagulant heparins such as totally desulfated heparin, N-desulfated heparin, and N-acetylated heparin. FGF released from ECM was biologically active, as indicated by its stimulation of cell proliferation and DNA synthesis in vascular endothelial cells and 3T3 fibroblasts. Similar results were obtained in studies on release of endogenous FGF-like mitogenic activity from Descement's membranes of bovine corneas. It is suggested that ECM storage and release of bFGF provide a novel mechanism for regulation of capillary blood vessel growth. Whereas ECM-bound FGF may be prevented from acting on endothelial cells, its displacement by heparin-like molecules and/or HS-degrading enzymes may elicit a neovascular response
Misra, Sanjay; Misra, Khamal D; Glockner, James F.
2010-01-01
Purpose To determine the expression of vascular endothelial growth factor-A (VEGF-A), macrophage migration inhibition factor (MIF), and matrix metalloproteinase-1 (MMP-1) in the porcine remnant kidney model and quantify renal blood flow and volume using phase contrast magnetic resonance imaging with magnetic resonance angiography (PC MRI/MRA). Material and methods In 23 pigs, the left renal artery was completely embolized using polyvinyl acrylide (PVA) particles and the right kidney partially embolized (remnant kidney) while six pigs served as controls. The animals were sacrificed early (day 3, 7, and 14, N=3), day 24 (D24, N=5), day 37 (D37, N=3), day 42 (D42, N=9), and day 84 (D84, N=3). MRI/PC MRA of the kidneys was performed prior to sacrifice. The remnant and control kidneys were harvested for Western blotting of VEGF-A, MMP-1, and MIF. Blood was removed for BUN and creatinine prior to embolization and at time of sacrifice. Results The kidney function after the embolization was characterized by chronic renal insufficiency. The renal artery blood flow, volume, and weight of the remnant kidney increased significantly over time when compared to controls. At early time points, there was increased expression of MIF and MMP-1 followed by an increase in the expression of VEGF-A by day 37 (P<0.05 when compared to control). Masson's trichrome staining of the remnant kidney revealed scarring in the tubulointerstitial space. Conclusions In this model, renal blood flow and volume increase as the remnant kidney hypertrophies and scars. There is increased expression of MIF, VEGF-A, and MMP-1 in the remnant kidney. PMID:20610182
Sparse direct solver for large finite element problems based on the minimum degree algorithm
Czech Academy of Sciences Publication Activity Database
Pařík, Petr; Plešek, Jiří
2017-01-01
Roč. 113, November (2017), s. 2-6 ISSN 0965-9978 R&D Projects: GA ČR(CZ) GA15-20666S; GA MŠk(CZ) EF15_003/0000493 Institutional support: RVO:61388998 Keywords : sparse direct solution * finite element method * large sparse Linear systems Subject RIV: JR - Other Machinery OBOR OECD: Mechanical engineering Impact factor: 3.000, year: 2016 https://www.sciencedirect.com/science/article/pii/S0965997817302582
Yihaa Roodhiyah, Lisa’; Tjong, Tiffany; Nurhasan; Sutarno, D.
2018-04-01
The late research, linear matrices of vector finite element in two dimensional(2-D) magnetotelluric (MT) responses modeling was solved by non-sparse direct solver in TE mode. Nevertheless, there is some weakness which have to be improved especially accuracy in the low frequency (10-3 Hz-10-5 Hz) which is not achieved yet and high cost computation in dense mesh. In this work, the solver which is used is sparse direct solver instead of non-sparse direct solverto overcome the weaknesses of solving linear matrices of vector finite element metod using non-sparse direct solver. Sparse direct solver will be advantageous in solving linear matrices of vector finite element method because of the matrix properties which is symmetrical and sparse. The validation of sparse direct solver in solving linear matrices of vector finite element has been done for a homogen half-space model and vertical contact model by analytical solution. Thevalidation result of sparse direct solver in solving linear matrices of vector finite element shows that sparse direct solver is more stable than non-sparse direct solver in computing linear problem of vector finite element method especially in low frequency. In the end, the accuracy of 2D MT responses modelling in low frequency (10-3 Hz-10-5 Hz) has been reached out under the efficient allocation memory of array and less computational time consuming.
Group sparse canonical correlation analysis for genomic data integration.
Lin, Dongdong; Zhang, Jigang; Li, Jingyao; Calhoun, Vince D; Deng, Hong-Wen; Wang, Yu-Ping
2013-08-12
The emergence of high-throughput genomic datasets from different sources and platforms (e.g., gene expression, single nucleotide polymorphisms (SNP), and copy number variation (CNV)) has greatly enhanced our understandings of the interplay of these genomic factors as well as their influences on the complex diseases. It is challenging to explore the relationship between these different types of genomic data sets. In this paper, we focus on a multivariate statistical method, canonical correlation analysis (CCA) method for this problem. Conventional CCA method does not work effectively if the number of data samples is significantly less than that of biomarkers, which is a typical case for genomic data (e.g., SNPs). Sparse CCA (sCCA) methods were introduced to overcome such difficulty, mostly using penalizations with l-1 norm (CCA-l1) or the combination of l-1and l-2 norm (CCA-elastic net). However, they overlook the structural or group effect within genomic data in the analysis, which often exist and are important (e.g., SNPs spanning a gene interact and work together as a group). We propose a new group sparse CCA method (CCA-sparse group) along with an effective numerical algorithm to study the mutual relationship between two different types of genomic data (i.e., SNP and gene expression). We then extend the model to a more general formulation that can include the existing sCCA models. We apply the model to feature/variable selection from two data sets and compare our group sparse CCA method with existing sCCA methods on both simulation and two real datasets (human gliomas data and NCI60 data). We use a graphical representation of the samples with a pair of canonical variates to demonstrate the discriminating characteristic of the selected features. Pathway analysis is further performed for biological interpretation of those features. The CCA-sparse group method incorporates group effects of features into the correlation analysis while performs individual feature
Mills, S J; Farrar, M D; Ashcroft, G S; Griffiths, C E M; Hardman, M J; Rhodes, L E
2014-07-01
Animal studies report photodynamic therapy (PDT) to improve healing of excisional wounds; the mechanism is uncertain and equivalent human studies are lacking. To explore the impact of methyl aminolaevulinate (MAL)-PDT on clinical and microscopic parameters of human cutaneous excisional wound healing, examining potential modulation through production of transforming growth factor (TGF)-β isoforms. In 27 healthy older men (60-77 years), a 4-mm punch biopsy wound was created in skin of the upper inner arm and treated with MAL-PDT three times over 5 days. An identical control wound to the contralateral arm was untreated and both wounds left to heal by secondary intention. Wounds were re-excised during the inflammatory phase (7 days, n = 10), matrix remodelling (3 weeks, n = 8) and cosmetic outcome/dermal structure (9 months, n = 9). Production of TGF-β1, TGF-β3 and matrix metalloproteinases (MMPs) was assessed by immunohistochemistry alongside microscopic measurement of wound size/area and clinical assessment of wound appearance. MAL-PDT delayed re-epithelialization at 7 days, associated with increased inflammation. However, 3 weeks postwounding, treated wounds were smaller with higher production of MMP-1 (P = 0·01), MMP-9 (P = 0·04) and TGF-β3 (P = 0·03). TGF-β1 was lower than control at 7 days and higher at 3 weeks (both P = 0·03). At 9 months, MAL-PDT-treated wounds showed greater, more ordered deposition of collagen I, collagen III and elastin (all P < 0·05). MAL-PDT increases MMP-1, MMP-9 and TGF-β3 production during matrix remodelling, ultimately producing scars with improved dermal matrix architecture. © 2014 British Association of Dermatologists.
Quaglino, D; Nanney, L B; Kennedy, R; Davidson, J M
1990-09-01
The effect of transforming growth factor-beta 1 (TGF-beta 1) on matrix gene expression has been investigated during the process of wound repair, where the formation of new connective tissue represents a critical step in restoring tissue integrity. Split-thickness excisional wounds in the pig were studied by in situ hybridization in order to obtain subjective findings on the activity and location of cells involved in matrix gene expression after the administration of recombinant TGF-beta 1. Data focus on the stimulatory role of this growth factor in granulation tissue formation, on the enhanced mRNA content of collagen types I and III, fibronectin, TGF-beta 1 itself, and on the reduction in stromelysin mRNA, suggesting that increased matrix formation measured after treatment with TGF-beta 1 is due to fibroplasia regulated by the abundance of mRNAs for several different structural, matrix proteins as well as inhibition of proteolytic phenomena elicited by metalloproteinases. These studies reveal elastin mRNA early in the repair process, and elastin mRNA expression is enhanced by administration of TGF-beta 1. Moreover, we show that TGF-beta 1 was auto-stimulating in wounds, accounting, at least in part, for the persistent effects of single doses of this multipotential cytokine.
When sparse coding meets ranking: a joint framework for learning sparse codes and ranking scores
Wang, Jim Jing-Yan
2017-06-28
Sparse coding, which represents a data point as a sparse reconstruction code with regard to a dictionary, has been a popular data representation method. Meanwhile, in database retrieval problems, learning the ranking scores from data points plays an important role. Up to now, these two problems have always been considered separately, assuming that data coding and ranking are two independent and irrelevant problems. However, is there any internal relationship between sparse coding and ranking score learning? If yes, how to explore and make use of this internal relationship? In this paper, we try to answer these questions by developing the first joint sparse coding and ranking score learning algorithm. To explore the local distribution in the sparse code space, and also to bridge coding and ranking problems, we assume that in the neighborhood of each data point, the ranking scores can be approximated from the corresponding sparse codes by a local linear function. By considering the local approximation error of ranking scores, the reconstruction error and sparsity of sparse coding, and the query information provided by the user, we construct a unified objective function for learning of sparse codes, the dictionary and ranking scores. We further develop an iterative algorithm to solve this optimization problem.
Sparse Learning with Stochastic Composite Optimization.
Zhang, Weizhong; Zhang, Lijun; Jin, Zhongming; Jin, Rong; Cai, Deng; Li, Xuelong; Liang, Ronghua; He, Xiaofei
2017-06-01
In this paper, we study Stochastic Composite Optimization (SCO) for sparse learning that aims to learn a sparse solution from a composite function. Most of the recent SCO algorithms have already reached the optimal expected convergence rate O(1/λT), but they often fail to deliver sparse solutions at the end either due to the limited sparsity regularization during stochastic optimization (SO) or due to the limitation in online-to-batch conversion. Even when the objective function is strongly convex, their high probability bounds can only attain O(√{log(1/δ)/T}) with δ is the failure probability, which is much worse than the expected convergence rate. To address these limitations, we propose a simple yet effective two-phase Stochastic Composite Optimization scheme by adding a novel powerful sparse online-to-batch conversion to the general Stochastic Optimization algorithms. We further develop three concrete algorithms, OptimalSL, LastSL and AverageSL, directly under our scheme to prove the effectiveness of the proposed scheme. Both the theoretical analysis and the experiment results show that our methods can really outperform the existing methods at the ability of sparse learning and at the meantime we can improve the high probability bound to approximately O(log(log(T)/δ)/λT).
In-place sparse suffix sorting
DEFF Research Database (Denmark)
Prezza, Nicola
2018-01-01
information regarding the lexicographical order of a size-b subset of all n text suffixes is often needed. Such information can be stored space-efficiently (in b words) in the sparse suffix array (SSA). The SSA and its relative sparse LCP array (SLCP) can be used as a space-efficient substitute of the sparse...... suffix tree. Very recently, Gawrychowski and Kociumaka [11] showed that the sparse suffix tree (and therefore SSA and SLCP) can be built in asymptotically optimal O(b) space with a Monte Carlo algorithm running in O(n) time. The main reason for using the SSA and SLCP arrays in place of the sparse suffix...... tree is, however, their reduced space of b words each. This leads naturally to the quest for in-place algorithms building these arrays. Franceschini and Muthukrishnan [8] showed that the full suffix array can be built in-place and in optimal running time. On the other hand, finding sub-quadratic in...
A fast sparse reconstruction algorithm for electrical tomography
International Nuclear Information System (INIS)
Zhao, Jia; Xu, Yanbin; Tan, Chao; Dong, Feng
2014-01-01
Electrical tomography (ET) has been widely investigated due to its advantages of being non-radiative, low-cost and high-speed. However, the image reconstruction of ET is a nonlinear and ill-posed inverse problem and the imaging results are easily affected by measurement noise. A sparse reconstruction algorithm based on L 1 regularization is robust to noise and consequently provides a high quality of reconstructed images. In this paper, a sparse reconstruction by separable approximation algorithm (SpaRSA) is extended to solve the ET inverse problem. The algorithm is competitive with the fastest state-of-the-art algorithms in solving the standard L 2 −L 1 problem. However, it is computationally expensive when the dimension of the matrix is large. To further improve the calculation speed of solving inverse problems, a projection method based on the Krylov subspace is employed and combined with the SpaRSA algorithm. The proposed algorithm is tested with image reconstruction of electrical resistance tomography (ERT). Both simulation and experimental results demonstrate that the proposed method can reduce the computational time and improve the noise robustness for the image reconstruction. (paper)
Visual recognition and inference using dynamic overcomplete sparse learning.
Murray, Joseph F; Kreutz-Delgado, Kenneth
2007-09-01
We present a hierarchical architecture and learning algorithm for visual recognition and other visual inference tasks such as imagination, reconstruction of occluded images, and expectation-driven segmentation. Using properties of biological vision for guidance, we posit a stochastic generative world model and from it develop a simplified world model (SWM) based on a tractable variational approximation that is designed to enforce sparse coding. Recent developments in computational methods for learning overcomplete representations (Lewicki & Sejnowski, 2000; Teh, Welling, Osindero, & Hinton, 2003) suggest that overcompleteness can be useful for visual tasks, and we use an overcomplete dictionary learning algorithm (Kreutz-Delgado, et al., 2003) as a preprocessing stage to produce accurate, sparse codings of images. Inference is performed by constructing a dynamic multilayer network with feedforward, feedback, and lateral connections, which is trained to approximate the SWM. Learning is done with a variant of the back-propagation-through-time algorithm, which encourages convergence to desired states within a fixed number of iterations. Vision tasks require large networks, and to make learning efficient, we take advantage of the sparsity of each layer to update only a small subset of elements in a large weight matrix at each iteration. Experiments on a set of rotated objects demonstrate various types of visual inference and show that increasing the degree of overcompleteness improves recognition performance in difficult scenes with occluded objects in clutter.
Sparse representation based image interpolation with nonlocal autoregressive modeling.
Dong, Weisheng; Zhang, Lei; Lukac, Rastislav; Shi, Guangming
2013-04-01
Sparse representation is proven to be a promising approach to image super-resolution, where the low-resolution (LR) image is usually modeled as the down-sampled version of its high-resolution (HR) counterpart after blurring. When the blurring kernel is the Dirac delta function, i.e., the LR image is directly down-sampled from its HR counterpart without blurring, the super-resolution problem becomes an image interpolation problem. In such cases, however, the conventional sparse representation models (SRM) become less effective, because the data fidelity term fails to constrain the image local structures. In natural images, fortunately, many nonlocal similar patches to a given patch could provide nonlocal constraint to the local structure. In this paper, we incorporate the image nonlocal self-similarity into SRM for image interpolation. More specifically, a nonlocal autoregressive model (NARM) is proposed and taken as the data fidelity term in SRM. We show that the NARM-induced sampling matrix is less coherent with the representation dictionary, and consequently makes SRM more effective for image interpolation. Our extensive experimental results demonstrate that the proposed NARM-based image interpolation method can effectively reconstruct the edge structures and suppress the jaggy/ringing artifacts, achieving the best image interpolation results so far in terms of PSNR as well as perceptual quality metrics such as SSIM and FSIM.
Decentralized modal identification using sparse blind source separation
International Nuclear Information System (INIS)
Sadhu, A; Hazra, B; Narasimhan, S; Pandey, M D
2011-01-01
Popular ambient vibration-based system identification methods process information collected from a dense array of sensors centrally to yield the modal properties. In such methods, the need for a centralized processing unit capable of satisfying large memory and processing demands is unavoidable. With the advent of wireless smart sensor networks, it is now possible to process information locally at the sensor level, instead. The information at the individual sensor level can then be concatenated to obtain the global structure characteristics. A novel decentralized algorithm based on wavelet transforms to infer global structure mode information using measurements obtained using a small group of sensors at a time is proposed in this paper. The focus of the paper is on algorithmic development, while the actual hardware and software implementation is not pursued here. The problem of identification is cast within the framework of under-determined blind source separation invoking transformations of measurements to the time–frequency domain resulting in a sparse representation. The partial mode shape coefficients so identified are then combined to yield complete modal information. The transformations are undertaken using stationary wavelet packet transform (SWPT), yielding a sparse representation in the wavelet domain. Principal component analysis (PCA) is then performed on the resulting wavelet coefficients, yielding the partial mixing matrix coefficients from a few measurement channels at a time. This process is repeated using measurements obtained from multiple sensor groups, and the results so obtained from each group are concatenated to obtain the global modal characteristics of the structure
Decentralized modal identification using sparse blind source separation
Sadhu, A.; Hazra, B.; Narasimhan, S.; Pandey, M. D.
2011-12-01
Popular ambient vibration-based system identification methods process information collected from a dense array of sensors centrally to yield the modal properties. In such methods, the need for a centralized processing unit capable of satisfying large memory and processing demands is unavoidable. With the advent of wireless smart sensor networks, it is now possible to process information locally at the sensor level, instead. The information at the individual sensor level can then be concatenated to obtain the global structure characteristics. A novel decentralized algorithm based on wavelet transforms to infer global structure mode information using measurements obtained using a small group of sensors at a time is proposed in this paper. The focus of the paper is on algorithmic development, while the actual hardware and software implementation is not pursued here. The problem of identification is cast within the framework of under-determined blind source separation invoking transformations of measurements to the time-frequency domain resulting in a sparse representation. The partial mode shape coefficients so identified are then combined to yield complete modal information. The transformations are undertaken using stationary wavelet packet transform (SWPT), yielding a sparse representation in the wavelet domain. Principal component analysis (PCA) is then performed on the resulting wavelet coefficients, yielding the partial mixing matrix coefficients from a few measurement channels at a time. This process is repeated using measurements obtained from multiple sensor groups, and the results so obtained from each group are concatenated to obtain the global modal characteristics of the structure.
Low-Complexity Bayesian Estimation of Cluster-Sparse Channels
Ballal, Tarig; Al-Naffouri, Tareq Y.; Ahmed, Syed
2015-01-01
This paper addresses the problem of channel impulse response estimation for cluster-sparse channels under the Bayesian estimation framework. We develop a novel low-complexity minimum mean squared error (MMSE) estimator by exploiting the sparsity of the received signal profile and the structure of the measurement matrix. It is shown that due to the banded Toeplitz/circulant structure of the measurement matrix, a channel impulse response, such as underwater acoustic channel impulse responses, can be partitioned into a number of orthogonal or approximately orthogonal clusters. The orthogonal clusters, the sparsity of the channel impulse response and the structure of the measurement matrix, all combined, result in a computationally superior realization of the MMSE channel estimator. The MMSE estimator calculations boil down to simpler in-cluster calculations that can be reused in different clusters. The reduction in computational complexity allows for a more accurate implementation of the MMSE estimator. The proposed approach is tested using synthetic Gaussian channels, as well as simulated underwater acoustic channels. Symbol-error-rate performance and computation time confirm the superiority of the proposed method compared to selected benchmark methods in systems with preamble-based training signals transmitted over clustersparse channels.
Low-Complexity Bayesian Estimation of Cluster-Sparse Channels
Ballal, Tarig
2015-09-18
This paper addresses the problem of channel impulse response estimation for cluster-sparse channels under the Bayesian estimation framework. We develop a novel low-complexity minimum mean squared error (MMSE) estimator by exploiting the sparsity of the received signal profile and the structure of the measurement matrix. It is shown that due to the banded Toeplitz/circulant structure of the measurement matrix, a channel impulse response, such as underwater acoustic channel impulse responses, can be partitioned into a number of orthogonal or approximately orthogonal clusters. The orthogonal clusters, the sparsity of the channel impulse response and the structure of the measurement matrix, all combined, result in a computationally superior realization of the MMSE channel estimator. The MMSE estimator calculations boil down to simpler in-cluster calculations that can be reused in different clusters. The reduction in computational complexity allows for a more accurate implementation of the MMSE estimator. The proposed approach is tested using synthetic Gaussian channels, as well as simulated underwater acoustic channels. Symbol-error-rate performance and computation time confirm the superiority of the proposed method compared to selected benchmark methods in systems with preamble-based training signals transmitted over clustersparse channels.
Directory of Open Access Journals (Sweden)
Jing Yuan
2013-04-01
Full Text Available AIM:To elucidate the relation between tissue factor pathway inhibitor-2(TFPI-2expression and the expression of matrix metalloproteinases(MMPsin keratocytes. METHODS: Primary culture and subculture of rabbit keratocytes were established in vitro. Plasmid vector pBos-Cite-neo/TFPI-2 was transfected into keratocytes with Lipofectamine 2000. After being selected by G418, three groups of cells including TFPI-2 gene transfected cells K-TFPI-2, empty vector transfected cells K-V and non-transfected cells K-P were screened for TFPI-2 mRNA and protein by reverse transcription-polymerase chain reaction and Western blot analysis, respectively. The activity of MMPs in the three groups of cells was detected by substrate zymography and compared by ANOVA. RESULTS: Expression of mRNA and protein of TFPI-2 was more in the cells of K-TFPI-2 than in the other cells of K-P and K-V with a significant difference(mRNA:0.79±0.02 vs 0.51±0.03 and 0.48±0.02, P=0.000 and P=0.000; Protein:24.5±0.8 vs 15.5±0.5 and 14.9±0.9,P=0.000 and P=0.000. Compared with the two groups of K-P and K-V, the cells of K-TFPI-2 had a significant decreased activity of MMP1(12.3±0.7 vs 16.7±1.2 and 15.9±0.7, P=0.001 and P=0.003and MMP2(15.4±1.3 vs 18.2±1.1 and 17.8±1.1, P=0.027 and P=0.046. CONCLUSION: It is suggested that the expression of TFPI-2 may strongly inhibit the activity of MMPs in keratocytes in vitro, which provides an experimental basis for curing CNV with gene therapy.
Directory of Open Access Journals (Sweden)
Đorđević-Jocić Jasmina
2012-01-01
Full Text Available Background/Aim. Transforming growth factor-b1 (TGF-b1, oxidative stress and imbalance between matrix metalloproteinases (MMPs and their tissue inhibitors (TIMPs may play an important role in pathogenesis of pseudoexfoliation syndrome/glaucoma (PEX Sy/Gl. The aim of the study was to measure concentrations of TGF- b1, MMP-2, TIMP-2 in the aqueous humor in the examined group, as well as to compare the biochemical findings with the following clinical parameters: degree of chamber angle pigmantation, presence of pseudoexfoliation and the value of intraocular pressure (IOP. Methods. Aqueous samples from 30 patients with cataract, 30 patients with PEX Sy, 36 patients with PEX Gl, and 42 patients with primary open-angle glaucoma (POAG were collected during phacoemulsification cataract surgery. TGF b1, MMP-2, TIMP-2 Fluotokine Multi Analyze Profiling kits and Luminex technology were used to simultaneously measure TGF b1, MMP-2 and TIMP-2. Results. TGF- β1, MMP-2, TIMP-2 were detected in human aqueous from all the groups with the highest level in the group with PEX Gl. Statistically, a significant correlation between the levels of TGF b1, MMP-2, TIMP-2 in the aqueous humor of the patients with PEX Gl and the IOP value was confirmed (p < 0.05. In this group, the positive correlations between the TGF b1 concentration in the aqueous humor and the presence of pseudoexfoliation (p < 0.01, on the one hand, and between the TIMP-2 level and the presence of pseudoexfoliation (p < 0.05, on the other, were reported. A statistically significant positive correlation of TGF-b1 and MMP-2, and the degree of chamber angle pigmentation in the PEX Gl group was confirmed (p < 0.05. In the POAG group, TIMP-2 values were in a negative correlation with the degree of pigmentation (p < 0.05, and the IOP value (p < 0.05. Conclusion. TGF b1 and MMP-2 affect the degree of chamber angle pigmentation and the degree of pseudoexfoliation in patients with pseudoexfoliative glaucoma.
Salient Object Detection via Structured Matrix Decomposition.
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.
He, Xingyu; Tong, Ningning; Hu, Xiaowei
2018-01-01
Compressive sensing has been successfully applied to inverse synthetic aperture radar (ISAR) imaging of moving targets. By exploiting the block sparse structure of the target image, sparse solution for multiple measurement vectors (MMV) can be applied in ISAR imaging and a substantial performance improvement can be achieved. As an effective sparse recovery method, sparse Bayesian learning (SBL) for MMV involves a matrix inverse at each iteration. Its associated computational complexity grows significantly with the problem size. To address this problem, we develop a fast inverse-free (IF) SBL method for MMV. A relaxed evidence lower bound (ELBO), which is computationally more amiable than the traditional ELBO used by SBL, is obtained by invoking fundamental property for smooth functions. A variational expectation-maximization scheme is then employed to maximize the relaxed ELBO, and a computationally efficient IF-MSBL algorithm is proposed. Numerical results based on simulated and real data show that the proposed method can reconstruct row sparse signal accurately and obtain clear superresolution ISAR images. Moreover, the running time and computational complexity are reduced to a great extent compared with traditional SBL methods.