This study investigates the preparation of InSb-added TiO2 nanocomposite films by RF sputtering. The optical absorption spectra are obviously shifted to visible and near-infrared regions. High-resolution transmission electron microscopy indicates that sphere-shaped InSb nanocrystals with a size of about 15 nm are dispersed in a matrix. The X-ray diffraction result reveals that the matrix forms ...

A central problem in the delivery of intensity-modulated radiation therapy (IMRT) using a multileaf collimator (MLC) relies on finding a series of leaves configurations that can be shaped with the MLC to properly deliver a given treatment. In this paper, we analyse, from an algorithmic point of view, the power of using dual-layer MLCs and Rotating Collimators for this purpose. 1 Radiation thera...

A quantum compiling algorithm is an algorithm for decomposing (“compiling”) an arbitrary unitary matrix into a sequence of elementary operations (SEO). Suppose Uin is an NB-bit unstructured unitary matrix (a unitary matrix with no special symmetries) that we wish to compile. For NB > 10, expressing Uin as a SEO requires more than a million CNOTs. This calls for a method for finding a unitary ma...

© 2014 Jianjun Huang et al. 167 http://dx.doi.org/10.4218/etrij.14.0213.0033 In this letter, we propose an unsupervised framework for speech noise reduction based on the recent development of low-rank and sparse matrix decomposition. The proposed framework directly separates the speech signal from noisy speech by decomposing the noisy speech spectrogram into three submatrices: the noise structu...

Intensity modulated radiation therapy (IMRT) is one of the most effective modalities for modern cancer treatment. The key to successful IMRT treatment hinges on the delivery of a two-dimensional discrete radiation intensity matrix using a device called a multileaf collimator (MLC). Mathematically, the delivery of an intensity matrix using an MLC can be viewed as the problem of representing a no...

A quantum compiler is a software program for decomposing (“compiling”) an arbitrary unitary matrix into a sequence of elementary operations (SEO). Coppersmith showed that the NB-bit Discrete Fourier Transform matrix UFT can be decomposed in a very efficient way, as a sequence of order(NB ) elementary operations. Can a quantum compiler that doesn’t know a priori about Coppersmith’s decomposition...

In this talk we investigate some classes of structures that are preserved by applying a QR step on a matrix A. We will handle two classes of such structures: the first we call polynomial structures, for example a matrix being Hermitian or Hermitian up to a rank one correction, and the second we call rank structures, which are encountered for example in all kinds of what we could call Hessenberg...

General 3×3 linear or 4×4 homogenous matrices can be formed by composing primitive matrices for translation, rotation, scale, shear, and perspective. Current 3-D computer graphics systems manipulate and interpolate parametric forms of these primitives to generate scenes and motion. For this and other reasons, decomposing a composite matrix in a meaningful way has been a longstanding challenge. ...

We present some methods for graphing distributions of covariance matrices and demonstrate them on several models, including the Wishart, inverse-Wishart, and scaled inverse-Wishart families in different dimensions. Our visualizations follow the principle of decomposing a covariance matrix into scale parameters and correlations, pulling out marginal summaries where possible and using two and thr...