Data-resolution based optimization of the data-collection strategy for near infrared diffuse optical tomography

Purpose: To optimize the data-collection strategy for diffuse optical tomography and to obtain a set of independent measurements among the total measurements using the model based data-resolution matrix characteristics. Methods: The data-resolution matrix is computed based on the sensitivity matrix and the regularization scheme used in the reconstruction procedure by matching the predicted data with the actual one. The diagonal values of data-resolution matrix show the importance of a particular measurement and the magnitude of off-diagonal entries shows the dependence among measurements. Based on the closeness of diagonal value magnitude to off-diagonal entries, the independent measurements choice is made. The reconstruction results obtained using all measurements were compared to the ones obtained using only independent measurements in both numerical and experimental phantom cases. The traditional singular value analysis was also performed to compare the results obtained using the proposed method. Results: The results indicate that choosing only independent measurements based on data-resolution matrix characteristics for the image reconstruction does not compromise the reconstructed image quality significantly, in turn reduces the data-collection time associated with the procedure. When the same number of measurements (equivalent to independent ones) are chosen at random, the reconstruction results were having poor quality with major boundary artifacts. The number of independent measurements obtained using data-resolution matrix analysis is much higher compared to that obtained using the singular value analysis. Conclusions: The data-resolution matrix analysis is able to provide the high level of optimization needed for effective data-collection in diffuse optical imaging. The analysis itself is independent of noise characteristics in the data, resulting in an universal framework to characterize and optimize a given data-collection strategy. (C) 2012 American Association of Physicists in Medicine. http://dx.doi.org/10.1118/1.4736820]

Ising model on a random network with annealed or quenched disorder

We study the equilibrium properties of an Ising model on a disordered random network where the disorder can be quenched or annealed. The network consists of fourfold coordinated sites connected via variable length one-dimensional chains. Our emphasis is on nonuniversal properties and we consider the transition temperature and other equilibrium thermodynamic properties, including those associated with one-dimensional fluctuations arising from the chains. We use analytic methods in the annealed case, and a Monte Carlo simulation for the quenched disorder. Our objective is to study the difference between quenched and annealed results with a broad random distribution of interaction parameters. The former represents a situation where the time scale associated with the randomness is very long and the corresponding degrees of freedom can be viewed as frozen, while the annealed case models the situation where this is not so. We find that the transition temperature and the entropy associated with one-dimensional fluctuations are always higher for quenched disorder than in the annealed case. These differences increase with the strength of the disorder up to a saturating value. We discuss our results in connection to physical systems where a broad distribution of interaction strengths is present.

Inverse Sensitivity Analysis of Singular Solutions of FRF matrix in Structural System Identification

The problem of structural damage detection based on measured frequency response functions of the structure in its damaged and undamaged states is considered. A novel procedure that is based on inverse sensitivity of the singular solutions of the system FRF matrix is proposed. The treatment of possibly ill-conditioned set of equations via regularization scheme and questions on spatial incompleteness of measurements are considered. The application of the method in dealing with systems with repeated natural frequencies and (or) packets of closely spaced modes is demonstrated. The relationship between the proposed method and the methods based on inverse sensitivity of eigensolutions and frequency response functions is noted. The numerical examples on a 5-degree of freedom system, a one span free-free beam and a spatially periodic multi-span beam demonstrate the efficacy of the proposed method and its superior performance vis-a-vis methods based on inverse eigensensitivity.

Regulation of extracellular matrix genes by arecoline in primary gingival fibroblasts requires epithelial factors

Background and Objective: Oral submucous fibrosis, a disease of collagen disorder, has been attributed to arecoline present in the saliva of betel quid chewers. However, the molecular basis of the action of arecoline in the pathogenesis of oral submucous fibrosis is poorly understood. The basic aim of our study was to elucidate the mechanism underlying the action of arecoline on the expression of genes in oral fibroblasts. Material and Methods: Human keratinocytes (HaCaT cells) and primary human gingival fibroblasts were treated with arecoline in combination with various pathway inhibitors, and the expression of transforming growth factor-beta isoform genes and of collagen isoforms was assessed using reverse transcription polymerase chain reaction analysis. Results: We observed the induction of transforming growth factor-beta2 by arecoline in HaCaT cells and this induction was found to be caused by activation of the M-3 muscarinic acid receptor via the induction of calcium and the protein kinase C pathway. Most importantly, we showed that transforming growth factor-beta2 was significantly overexpressed in oral submucous fibrosis tissues (p = 0.008), with a median of 2.13 (n = 21) compared with 0.75 (n = 18) in normal buccal mucosal tissues. Furthermore, arecoline down-regulated the expression of collagens 1A1 and 3A1 in human primary gingival fibroblasts; however these collagens were induced by arecoline in the presence of spent medium of cultured human keratinocytes. Treatment with a transforming growth factor-beta blocker, transforming growth factor-beta1 latency-associated peptide, reversed this up-regulation of collagen, suggesting a role for profibrotic cytokines, such as transforming growth factor-beta, in the induction of collagens. Conclusion: Taken together, our data highlight the importance of arecoline-induced epithelial changes in the pathogenesis of oral submucous fibrosis.

Resistometric studies of solute-vacancy interactions and clustering kinetics in an FCC matrix [AlZn Alloy with Ag, Ce, Dy, Li, Nb, Pt, Sb, Y, or Yb]

Al-4.4 a/oZn and Al-4.4 a/oZn with Ag, Ce, Dy, Li, Nb, Pt, Y, or Yb, alloys have been investigated by resistometry with a view to study the solute-vacancy interactions and clustering kinetics in these alloys. Solute-vacancy binding energies have been evaluated for all these elements by making use of appropriate methods of evaluation. Ag and Dy additions yield some interesting results and these have been discussed in the thesis. Solute-vacancy binding energy values obtained here have been compared with other available values and discussed. A study of the type of interaction between vacancies and solute atoms indicates that the valency effect is more predominant than the elastic effect.

S-matrix for magnons in the D1-D5 system

We show that integrability and symmetries of the near horizon geometry of the D1-D5 system determine the S-matrix for the scattering of magnons with polarizations in AdS(3) x S-3 completely up to a phase. Using semi-classical methods we evaluate the phase to the leading and to the one-loop approximation in the strong coupling expansion. We then show that the phase obeys the unitarity constraint implied by the crossing relations to the one-loop order. We also verify that the dispersion relation obeyed by these magnons is one-loop exact at strong coupling which is consistent with their BPS nature.

Relationship Between The Impedance Matrix And The Transfer Matrix With Specific Reference To Symmetrical, Reciprocal And Conservative Systems

Impedance matrix and transfer matrix methods are often used in the analysis of linear dynamical systems. In this paper, general relationships between these matrices are derived. The properties of the impedance matrix and the transfer matrix of symmetrical systems, reciprocal systems and conservative systems are investigated. In the process, the following observations are made: (a) symmetrical systems are not a subset of reciprocal systems, as is often misunderstood; (b) the cascading of reciprocal systems again results in a reciprocal system, whereas cascading of symmetrical systems does not necessarily result in a symmetrical system; (c) the determinant of the transfer matrix, being ±1, is a property of both symmetrical systems and reciprocal systems, but this condition, however, is not sufficient to establish either the reciprocity or the symmetry of the system; (d) the impedance matrix of a conservative system is skew-Hermitian.

Weighted subspace methods and spatial smoothing: analysis and comparison

The effect of using a spatially smoothed forward-backward covariance matrix on the performance of weighted eigen-based state space methods/ESPRIT, and weighted MUSIC for direction-of-arrival (DOA) estimation is analyzed. Expressions for the mean-squared error in the estimates of the signal zeros and the DOA estimates, along with some general properties of the estimates and optimal weighting matrices, are derived. A key result is that optimally weighted MUSIC and weighted state-space methods/ESPRIT have identical asymptotic performance. Moreover, by properly choosing the number of subarrays, the performance of unweighted state space methods can be significantly improved. It is also shown that the mean-squared error in the DOA estimates is independent of the exact distribution of the source amplitudes. This results in a unified framework for dealing with DOA estimation using a uniformly spaced linear sensor array and the time series frequency estimation problems.

FIR system identification based on subspaces of a higher order cumulant matrix

A new linear algebraic approach for identification of a nonminimum phase FIR system of known order using only higher order (>2) cumulants of the output process is proposed. It is first shown that a matrix formed from a set of cumulants of arbitrary order can be expressed as a product of structured matrices. The subspaces of this matrix are then used to obtain the parameters of the FIR system using a set of linear equations. Theoretical analysis and numerical simulation studies are presented to characterize the performance of the proposed methods.

Parallel computing concepts and methods for floquet analysis of helicopter trim and stability

Floquet analysis is widely used for small-order systems (say, order M < 100) to find trim results of control inputs and periodic responses, and stability results of damping levels and frequencies, Presently, however, it is practical neither for design applications nor for comprehensive analysis models that lead to large systems (M > 100); the run time on a sequential computer is simply prohibitive, Accordingly, a massively parallel Floquet analysis is developed with emphasis on large systems, and it is implemented on two SIMD or single-instruction, multiple-data computers with 4096 and 8192 processors, The focus of this development is a parallel shooting method with damped Newton iteration to generate trim results; the Floquet transition matrix (FTM) comes out as a byproduct, The eigenvalues and eigenvectors of the FTM are computed by a parallel QR method, and thereby stability results are generated, For illustration, flap and flap-lag stability of isolated rotors are treated by the parallel analysis and by a corresponding sequential analysis with the conventional shooting and QR methods; linear quasisteady airfoil aerodynamics and a finite-state three-dimensional wake model are used, Computational reliability is quantified by the condition numbers of the Jacobian matrices in Newton iteration, the condition numbers of the eigenvalues and the residual errors of the eigenpairs, and reliability figures are comparable in both the parallel and sequential analyses, Compared to the sequential analysis, the parallel analysis reduces the run time of large systems dramatically, and the reduction increases with increasing system order; this finding offers considerable promise for design and comprehensive-analysis applications.

NMR methods for fast data acquisition

NMR spectroscopy has witnessed tremendous advancements in recent years with the development of new methodologies for structure determination and availability of high-field strength spectrometers equipped with cryogenic probes. Supported by these advancements, a new dimension in NMR research has emerged which aims to increase the speed with data is collected and analyzed. Several novel methodologies have been proposed in this direction. This review focuses on the principles on which these different approaches are based with an emphasis on G-matrix Fourier transform NMR spectroscopy.

On the microstructure-tensile property correlations in bulk metallic glass matrix composites with crystalline dendrites

Bulk metallic glass (BMG) matrix composites with crystalline dendrites as reinforcements exhibit a wide variance in their microstructures (and thus mechanical properties), which in turn can be attributed to the processing route employed, which affects the size and distribution of the dendrites. A critical investigation on the microstructure and tensile properties of Zr/Ti-based BMG composites of the same composition, but produced by different routes, was conducted so as to identify ``structure-property'' connections in these materials. This was accomplished by employing four different processing methods-arc melting, suction casting, semi-solid forging and induction melting on a water-cooled copper boat-on composites with two different dendrite volume fractions, V-d. The change in processing parameters only affects microstructural length scales such as the interdendritic spacing, lambda, and dendrite size, delta, whereas compositions of the matrix and dendrite are unaffected. Broadly, the composite's properties are insensitive to the microstructural length scales when V-d is high (similar to 75%), whereas they become process dependent for relatively lower V-d (similar to 55%). Larger delta in arc-melted and forged specimens result in higher ductility (7-9%) and lower hardening rates, whereas smaller dendrites increase the hardening rate. A bimodal distribution of dendrites offers excellent ductility at a marginal cost of yield strength. Finer lambda result in marked improvements in both ductility and yield strength, due to the confinement of shear band nucleation sites in smaller volumes of the glassy phase. Forging in the semi-solid state imparts such a microstructure. (c) 2012 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Efficient Methods for Robust Classification Under Uncertainty in Kernel Matrices

In this paper we study the problem of designing SVM classifiers when the kernel matrix, K, is affected by uncertainty. Specifically K is modeled as a positive affine combination of given positive semi definite kernels, with the coefficients ranging in a norm-bounded uncertainty set. We treat the problem using the Robust Optimization methodology. This reduces the uncertain SVM problem into a deterministic conic quadratic problem which can be solved in principle by a polynomial time Interior Point (IP) algorithm. However, for large-scale classification problems, IP methods become intractable and one has to resort to first-order gradient type methods. The strategy we use here is to reformulate the robust counterpart of the uncertain SVM problem as a saddle point problem and employ a special gradient scheme which works directly on the convex-concave saddle function. The algorithm is a simplified version of a general scheme due to Juditski and Nemirovski (2011). It achieves an O(1/T-2) reduction of the initial error after T iterations. A comprehensive empirical study on both synthetic data and real-world protein structure data sets show that the proposed formulations achieve the desired robustness, and the saddle point based algorithm outperforms the IP method significantly.

Fast acoustic likelihood computation using low-rank matrix approximation

Acoustic modeling using mixtures of multivariate Gaussians is the prevalent approach for many speech processing problems. Computing likelihoods against a large set of Gaussians is required as a part of many speech processing systems and it is the computationally dominant phase for LVCSR systems. We express the likelihood computation as a multiplication of matrices representing augmented feature vectors and Gaussian parameters. The computational gain of this approach over traditional methods is by exploiting the structure of these matrices and efficient implementation of their multiplication.In particular, we explore direct low-rank approximation of the Gaussian parameter matrix and indirect derivation of low-rank factors of the Gaussian parameter matrix by optimum approximation of the likelihood matrix. We show that both the methods lead to similar speedups but the latter leads to far lesser impact on the recognition accuracy. Experiments on a 1138 word vocabulary RM1 task using Sphinx 3.7 system show that, for a typical case the matrix multiplication approach leads to overall speedup of 46%. Both the low-rank approximation methods increase the speedup to around 60%, with the former method increasing the word error rate (WER) from 3.2% to 6.6%, while the latter increases the WER from 3.2% to 3.5%.

The Ginibre Ensemble and Gaussian Analytic Functions

We show that as n changes, the characteristic polynomial of the n x n random matrix with i.i.d. complex Gaussian entries can be described recursively through a process analogous to Polya's urn scheme. As a result, we get a random analytic function in the limit, which is given by a mixture of Gaussian analytic functions. This suggests another reason why the zeros of Gaussian analytic functions and the Ginibre ensemble exhibit similar local repulsion, but different global behavior. Our approach gives new explicit formulas for the limiting analytic function.