Improved bounds for subband-adaptive iterative shrinkage/thresholding algorithms.

This paper presents new methods for computing the step sizes of the subband-adaptive iterative shrinkage-thresholding algorithms proposed by Bayram & Selesnick and Vonesch & Unser. The method yields tighter wavelet-domain bounds of the system matrix, thus leading to improved convergence speeds. It is directly applicable to non-redundant wavelet bases, and we also adapt it for cases of redundant frames. It turns out that the simplest and most intuitive setting for the step sizes that ignores subband aliasing is often satisfactory in practice. We show that our methods can be used to advantage with reweighted least squares penalty functions as well as L1 penalties. We emphasize that the algorithms presented here are suitable for performing inverse filtering on very large datasets, including 3D data, since inversions are applied only to diagonal matrices and fast transforms are used to achieve all matrix-vector products.

Sequential Monte Carlo computation of the score and observed information matrix in state-space models with application to parameter estimation

Sequential Monte Carlo (SMC) methods are popular computational tools for Bayesian inference in non-linear non-Gaussian state-space models. For this class of models, we propose SMC algorithms to compute the score vector and observed information matrix recursively in time. We propose two different SMC implementations, one with computational complexity $\mathcal{O}(N)$ and the other with complexity $\mathcal{O}(N^{2})$ where $N$ is the number of importance sampling draws. Although cheaper, the performance of the $\mathcal{O}(N)$ method degrades quickly in time as it inherently relies on the SMC approximation of a sequence of probability distributions whose dimension is increasing linearly with time. In particular, even under strong \textit{mixing} assumptions, the variance of the estimates computed with the $\mathcal{O}(N)$ method increases at least quadratically in time. The $\mathcal{O}(N^{2})$ is a non-standard SMC implementation that does not suffer from this rapid degrade. We then show how both methods can be used to perform batch and recursive parameter estimation.

Nonparametric Bayesian sparse factor models with application to gene expression modeling

A nonparametric Bayesian extension of Factor Analysis (FA) is proposed where observed data $\mathbf{Y}$ is modeled as a linear superposition, $\mathbf{G}$, of a potentially infinite number of hidden factors, $\mathbf{X}$. The Indian Buffet Process (IBP) is used as a prior on $\mathbf{G}$ to incorporate sparsity and to allow the number of latent features to be inferred. The model's utility for modeling gene expression data is investigated using randomly generated data sets based on a known sparse connectivity matrix for E. Coli, and on three biological data sets of increasing complexity.

Generalized power method for sparse principal component analysis

In this paper we develop a new approach to sparse principal component analysis (sparse PCA). We propose two single-unit and two block optimization formulations of the sparse PCA problem, aimed at extracting a single sparse dominant principal component of a data matrix, or more components at once, respectively. While the initial formulations involve nonconvex functions, and are therefore computationally intractable, we rewrite them into the form of an optimization program involving maximization of a convex function on a compact set. The dimension of the search space is decreased enormously if the data matrix has many more columns (variables) than rows. We then propose and analyze a simple gradient method suited for the task. It appears that our algorithm has best convergence properties in the case when either the objective function or the feasible set are strongly convex, which is the case with our single-unit formulations and can be enforced in the block case. Finally, we demonstrate numerically on a set of random and gene expression test problems that our approach outperforms existing algorithms both in quality of the obtained solution and in computational speed. © 2010 Michel Journée, Yurii Nesterov, Peter Richtárik and Rodolphe Sepulchre.

Formation of composite organic thin film transistors with nanotubes and nanowires

Plastic electronics is a rapidly expanding topic, much of which has been focused on organic semiconductors. However, it is also of interest to find viable ways to integrate nanomaterials, such as silicon nanowires (SiNWs) and carbon nanotubes (CNTs), into this technology. Here, we present methods of fabrication of composite devices incorporating such nanostructured materials into an organic matrix. We investigate the formation of polymer/CNT composites, for which we use the semiconducting polymer poly(3,3‴-dialkyl-quaterthiophene) (PQT). We also report a method of fabricating polymer/SiNW TFTs, whereby sparse arrays of parallel oriented SiNWs are initially prepared on silicon dioxide substrates from forests of as-grown gold-catalysed SiNWs. Subsequent ink-jet printing of PQT on these arrays produces a polymer/SiNW composite film. We also present the electrical characterization of all composite devices. © 2007 Elsevier B.V. All rights reserved.

A microstructural investigation of deformation in fine SiC particulate- and whisker-reinforced aluminium-matrix composites

Aluminium-based composites, reinforced with low volume fractions of whiskers and small particles, have been formed by a powder route. The materials have been tested in tension, and the microstructures examined using transmission electron microscopy. The whisker composites showed an improvement in flow stress over the particulate composites, and this was linked to an initially enhanced work-hardening rate in the whisker composites. The overall dislocation densities were estimated to be somewhat higher in the whisker composites than the particulate composites, but in the early stages of deformation the distribution was rather different, with deformation in the whisker material being far more localized and inhomogeneous. This factor, together with differences in the internal stress distribution in the materials, is used to explain the difference in mechanical properties.

Microstructure, strain fields and flow stress in deformed metal matrix composites

An experimental study of local orientations around whiskers in deformed metal matrix composites has been used to determine the strain gradients existing in the material following tensile deformation. These strain fields have been represented as arrays of geometrically necessary dislocations, and the material flow stress predicted using a standard dislocation hardening model. Whilst the correlation between this and the measured flow stress is reasonable, the experimentally determined strain gradients are lower by a factor of 5-10 than values obtained in previous estimates made using continuum plasticity finite element models. The local orientations around the whiskers contain a large amount of detailed information about the strain patterns in the material, and a novel approach is made to representing some of this information and to correlating it with microstructural observations. © 1998 Acta Metallurgica Inc. Published by Elsevier Science Ltd. All rights reserved.