Optimal iterative schemes for computing the Moore-Penrose matrix inverse

Among the iterative schemes for computing the Moore — Penrose inverse of a woll-conditioned matrix, only those which have an order of convergence three or two are computationally efficient. A Fortran programme for these schemes is provided.

Coding for Two-User Gaussian MAC with PSK and PAM Signal Sets

Constellation Constrained (CC) capacity regions of a two-user Gaussian Multiple Access Channel(GMAC) have been recently reported. For such a channel, code pairs based on trellis coded modulation are proposed in this paper with MPSK and M-PAM alphabet pairs, for arbitrary values of M,toachieve sum rates close to the CC sum capacity of the GMAC. In particular, the structure of the sum alphabets of M-PSK and M-PAMmalphabet pairs are exploited to prove that, for certain angles of rotation between the alphabets, Ungerboeck labelling on the trellis of each user maximizes the guaranteed squared Euclidean distance of the sum trellis. Hence, such a labelling scheme can be used systematically,to construct trellis code pairs to achieve sum rates close to the CC sum capacity. More importantly, it is shown for the first time that ML decoding complexity at the destination is significantly reduced when M-PAM alphabet pairs are employed with almost no loss in the sum capacity.

Moore meets maxwell

Moore's Law has driven the semiconductor revolution enabling over four decades of scaling in frequency, size, complexity, and power. However, the limits of physics are preventing further scaling of speed, forcing a paradigm shift towards multicore computing and parallelization. In effect, the system is taking over the role that the single CPU was playing: high-speed signals running through chips but also packages and boards connect ever more complex systems. High-speed signals making their way through the entire system cause new challenges in the design of computing hardware. Inductance, phase shifts and velocity of light effects, material resonances, and wave behavior become not only prevalent but need to be calculated accurately and rapidly to enable short design cycle times. In essence, to continue scaling with Moore's Law requires the incorporation of Maxwell's equations in the design process. Incorporating Maxwell's equations into the design flow is only possible through the combined power that new algorithms, parallelization and high-speed computing provide. At the same time, incorporation of Maxwell-based models into circuit and system-level simulation presents a massive accuracy, passivity, and scalability challenge. In this tutorial, we navigate through the often confusing terminology and concepts behind field solvers, show how advances in field solvers enable integration into EDA flows, present novel methods for model generation and passivity assurance in large systems, and demonstrate the power of cloud computing in enabling the next generation of scalable Maxwell solvers and the next generation of Moore's Law scaling of systems. We intend to show the truly symbiotic growing relationship between Maxwell and Moore!

Evidence for a new metastable crystalline compound in Ge---Te system

Pressure dependence of the electrical resistivity of bulk, melt quenched GexTe100−x glasses (15 less-than-or-equals, slant x less-than-or-equals, slant 28) has been studied up to 8GPa pressure. All the glasses exhibit a sharp, discontinuous glass to crystal transition under pressure. The high pressure crystalline phases are identified to have a face centered cubic structure. The value of the cell constant is 0.779nm for 15 less-than-or-equals, slant x less-than-or-equals, slant 17, 0.642nm for x=20 and 0.55lnm for 22 ≤ x ≤ 28 samples respectively. The cell constants of the high pressure crystalline phases suggest the possible existance of a new metastable crystalline compound in the Ge---Te system with F.C.C. structure and cell constant equal to 1.109nm as reported by Moore et al.

Dynamics after a sweep through a quantum critical point

The coherent quantum evolution of a one-dimensional many-particle system after slowly sweeping the Hamiltonian through a critical point is studied using a generalized quantum Ising model containing both integrable and nonintegrable regimes. It is known from previous work that universal power laws of the sweep rate appear in such quantities as the mean number of excitations created by the sweep. Several other phenomena are found that are not reflected by such averages: there are two different scaling behaviors of the entanglement entropy and a relaxation that is power law in time rather than exponential. The final state of evolution after the quench is not characterized by any effective temperature, and the Loschmidt echo converges algebraically for long times, with cusplike singularities in the integrable case that are dynamically broadened by nonintegrable perturbations.

A unified construction of space-time codes with optimal rate-diversity tradeoff

The problem of constructing space-time (ST) block codes over a fixed, desired signal constellation is considered. In this situation, there is a tradeoff between the transmission rate as measured in constellation symbols per channel use and the transmit diversity gain achieved by the code. The transmit diversity is a measure of the rate of polynomial decay of pairwise error probability of the code with increase in the signal-to-noise ratio (SNR). In the setting of a quasi-static channel model, let n(t) denote the number of transmit antennas and T the block interval. For any n(t) <= T, a unified construction of (n(t) x T) ST codes is provided here, for a class of signal constellations that includes the familiar pulse-amplitude (PAM), quadrature-amplitude (QAM), and 2(K)-ary phase-shift-keying (PSK) modulations as special cases. The construction is optimal as measured by the rate-diversity tradeoff and can achieve any given integer point on the rate-diversity tradeoff curve. An estimate of the coding gain realized is given. Other results presented here include i) an extension of the optimal unified construction to the multiple fading block case, ii) a version of the optimal unified construction in which the underlying binary block codes are replaced by trellis codes, iii) the providing of a linear dispersion form for the underlying binary block codes, iv) a Gray-mapped version of the unified construction, and v) a generalization of construction of the S-ary case corresponding to constellations of size S-K. Items ii) and iii) are aimed at simplifying the decoding of this class of ST codes.

Ring-Opening-Induced Toughening of a Low-Permittivity Polymer-Metal Interface

Integrating low dielectric permittivity (low-k) polymers to metals is an exacting fundamental challenge because poor bonding between low-polarizability moieties and metals precludes good interfacial adhesion. Conventional adhesion-enhancing methods such as using intermediary layers are unsuitable for engineering polymer/metal interfaces for many applications because of the collateral increase in dielectric permittivity. Here, we demonstrate a completely new approach without surface treatments or intermediary layers to obtain an excellent interfacial fracture toughness of > 13 J/m(2) in a model system comprising copper. and a cross-linked polycarbosilane with k similar to 2.7 obtained by curing a cyclolinear polycarbosilane in air.Our results suggest that interfacial oxygen catalyzed molecularring-opening and anchoring of the opened ring moieties of the polymer to copper is the main toughening mechanism. This novel approach of realizing adherent low-k polymer/metal structures without intermediary layers by activating metal-anchoring polymer moieties at the interface could be adapted for applications such as device wiring and packaging, and laminates and composites.

Ordering near the percolation threshold in models of two-dimensional interacting bosons with quenched dilution

Randomly diluted quantum boson and spin models in two dimensions combine the physics of classical percolation with the well-known dimensionality dependence of ordering in quantum lattice models. This combination is rather subtle for models that order in two dimensions but have no true order in one dimension, as the percolation cluster near threshold is a fractal of dimension between 1 and 2: two experimentally relevant examples are the O(2) quantum rotor and the Heisenberg antiferromagnet. We study two analytic descriptions of the O(2) quantum rotor near the percolation threshold. First a spin-wave expansion is shown to predict long-ranged order, but there are statistically rare points on the cluster that violate the standard assumptions of spin-wave theory. A real-space renormalization group (RSRG) approach is then used to understand how these rare points modify ordering of the O(2) rotor. A new class of fixed points of the RSRG equations for disordered one-dimensional bosons is identified and shown to support the existence of long-range order on the percolation backbone in two dimensions. These results are relevant to experiments on bosons in optical lattices and superconducting arrays, and also (qualitatively) for the diluted Heisenberg antiferromagnet La-2(Zn,Mg)(x)Cu1-xO4.

An algorithm to find distant repeats in a pair of protein sequences

Distant repeats between a pair of protein sequences can be exploited to study the various aspects of proteins such as structure-function relationship, disorders due to protein malfunction, evolutionary analysis, etc. An in-depth analysis of the distant repeats would facilitate to establish a stable evolutionary relation of the repeats with respect to their three-dimensional structure. To this effect, an algorithm has been devised to identify the distant repeats in a pair of protein sequences by essentially using the scores of PAM (Percent Accepted Mutation) matrices. The proposed algorithm will be of much use to researchers involved in the comparative study of various organisms based on the amino-acid repeats in protein sequences. (C) 2010 Elsevier B.V. All rights reserved.

Genome-wide expression profiling identifies deregulated miRNAs in malignant astrocytoma

Malignant astrocytoma includes anaplastic astrocytoma (grade III) and glioblastoma (grade IV). Among them, glioblastoma is the most common primary brain tumor with dismal responses to all therapeutic modalities. We performed a large-scale, genome-wide microRNA (miRNA) (n=756) expression profiling of 26 glioblastoma, 13 anaplastic astrocytoma and 7 normal brain samples with an aim to find deregulated miRNA in malignant astrocytoma. We identified several differentially regulated miRNAs between these groups, which could differentiate glioma grades and normal brain as recognized by PCA. More importantly, we identified a most discriminatory 23-miRNA expression signature, by using PAM, which precisely distinguished glioblastoma from anaplastic astrocytoma with an accuracy of 95%. The differential expression pattern of nine miRNAs was further validated by real-time RT-PCR on an independent set of malignant astrocytomas (n-72) and normal samples (n=7). Inhibition of two glioblastoma-upregulated miRNAs (miR-21 and miR-23a) and exogenous overexpression of two glioblastoma-downregulated miRNAs (miR-218 and miR-219-5p) resulted in reduced soft agar colony formation but showed varying effects on cell proliferation and chemosensitivity. Thus we have identified the miRNA expression signature for malignant astrocytoma, in particular glioblastoma, and showed the miRNA involvement and their importance in astrocytoma development. Modern Pathology (2010) 23, 1404-1417; doi:10.1038/modpathol.2010.135; published online 13 August 2010

Tuning the electronic effective mass in double-doped SrTiO3

We elucidate the relationship between effective mass and carrier concentration in an oxide semiconductor controlled by a double-doping mechanism. In this model oxide system, Sr1-xLaxTiO3-delta, we can tune the effective mass ranging from 6 to 20m(e) as a function of filling (carrier concentration) and the scattering mechanism, which are dependent on the chosen lanthanum-and oxygen-vacancy concentrations. The effective mass values were calculated from the Boltzmann transport equation using the measured transport properties of thin films of Sr1-xLaxTiO3-delta. We show that the effective mass decreases with carrier concentration in this large-band-gap, low-mobility oxide, and this behavior is contrary to the traditional high-mobility, small-effective-mass semiconductors.

On Two-User Gaussian Multiple Access Channels With Finite Input Constellations

Constellation Constrained (CC) capacity regions of two-user Single-Input Single-Output (SISO) Gaussian Multiple Access Channels (GMAC) are computed for several Non-Orthogonal Multiple Access schemes (NO-MA) and Orthogonal Multiple Access schemes (O-MA). For NO-MA schemes, a metric is proposed to compute the angle(s) of rotation between the input constellations such that the CC capacity regions are maximally enlarged. Further, code pairs based on Trellis Coded Modulation (TCM) are designed with PSK constellation pairs and PAM constellation pairs such that any rate pair within the CC capacity region can be approached. Such a NO-MA scheme which employs CC capacity approaching trellis codes is referred to as Trellis Coded Multiple Access (TCMA). Then, CC capacity regions of O-MA schemes such as Frequency Division Multiple Access (FDMA) and Time Division Multiple Access (TDMA) are also computed and it is shown that, unlike the Gaussian distributed continuous constellations case, the CC capacity regions with FDMA are strictly contained inside the CC capacity regions with TCMA. Hence, for finite constellations, a NO-MA scheme such as TCMA is better than FDMA and TDMA which makes NO-MA schemes worth pursuing in practice for two-user GMAC. Then, the idea of introducing rotations between the input constellations is used to construct Space-Time Block Code (STBC) pairs for two-user Multiple-Input Single-Output (MISO) fading MAC. The proposed STBCs are shown to have reduced Maximum Likelihood (ML) decoding complexity and information-losslessness property. Finally, STBC pairs with reduced sphere decoding complexity are proposed for two-user Multiple-Input Multiple-Output (MIMO) fading MAC.

Concise row-pruning algorithm to invert a matrix

Presented here, in a vector formulation, is an O(mn2) direct concise algorithm that prunes/identifies the linearly dependent (ld) rows of an arbitrary m X n matrix A and computes its reflexive type minimum norm inverse A(mr)-, which will be the true inverse A-1 if A is nonsingular and the Moore-Penrose inverse A+ if A is full row-rank. The algorithm, without any additional computation, produces the projection operator P = (I - A(mr)- A) that provides a means to compute any of the solutions of the consistent linear equation Ax = b since the general solution may be expressed as x = A(mr)+b + Pz, where z is an arbitrary vector. The rank r of A will also be produced in the process. Some of the salient features of this algorithm are that (i) the algorithm is concise, (ii) the minimum norm least squares solution for consistent/inconsistent equations is readily computable when A is full row-rank (else, a minimum norm solution for consistent equations is obtainable), (iii) the algorithm identifies ld rows, if any, and reduces concerned computation and improves accuracy of the result, (iv) error-bounds for the inverse as well as the solution x for Ax = b are readily computable, (v) error-free computation of the inverse, solution vector, rank, and projection operator and its inherent parallel implementation are straightforward, (vi) it is suitable for vector (pipeline) machines, and (vii) the inverse produced by the algorithm can be used to solve under-/overdetermined linear systems.

Modeling of wheeled mobile robots using dextrous manipulation kinematics

Abstract—This document introduces a new kinematic simulation of a wheeled mobile robot operating on uneven terrain. Our modeling method borrows concepts from dextrous manipulation. This allows for an accurate simulation of the way 3-dimensional wheels roll over a smooth ground surface. The purpose of the simulation is to validate a new concept for design of off-road wheel suspensions, called Passive Variable Camber (PVC). We show that PVC eliminates kinematic slip for an outdoor robot. Both forward and inverse kinematics are discussed and simulation results are presented.