The Interpolation Theory of Radial Basis Functions

NASA Astrophysics Data System (ADS)

Baxter, Brad

2010-06-01

In this dissertation, it is first shown that, when the radial basis function is a p-norm and 1 < p < 2, interpolation is always possible when the points are all different and there are at least two of them. We then show that interpolation is not always possible when p > 2. Specifically, for every p > 2, we construct a set of different points in some Rd for which the interpolation matrix is singular. The greater part of this work investigates the sensitivity of radial basis function interpolants to changes in the function values at the interpolation points. Our early results show that it is possible to recast the work of Ball, Narcowich and Ward in the language of distributional Fourier transforms in an elegant way. We then use this language to study the interpolation matrices generated by subsets of regular grids. In particular, we are able to extend the classical theory of Toeplitz operators to calculate sharp bounds on the spectra of such matrices. Applying our understanding of these spectra, we construct preconditioners for the conjugate gradient solution of the interpolation equations. Our main result is that the number of steps required to achieve solution of the linear system to within a required tolerance can be independent of the number of interpolation points. The Toeplitz structure allows us to use fast Fourier transform techniques, which imp lies that the total number of operations is a multiple of n log n, where n is the number of interpolation points. Finally, we use some of our methods to study the behaviour of the multiquadric when its shape parameter increases to infinity. We find a surprising link with the sinus cardinalis or sinc function of Whittaker. Consequently, it can be highly useful to use a large shape parameter when approximating band-limited functions.

Some New Sets of Sequences of Fuzzy Numbers with Respect to the Partial Metric

PubMed Central

Ozluk, Muharrem

2015-01-01

In this paper, we essentially deal with Köthe-Toeplitz duals of fuzzy level sets defined using a partial metric. Since the utilization of Zadeh's extension principle is quite difficult in practice, we prefer the idea of level sets in order to construct some classical notions. In this paper, we present the sets of bounded, convergent, and null series and the set of sequences of bounded variation of fuzzy level sets, based on the partial metric. We examine the relationships between these sets and their classical forms and give some properties including definitions, propositions, and various kinds of partial metric spaces of fuzzy level sets. Furthermore, we study some of their properties like completeness and duality. Finally, we obtain the Köthe-Toeplitz duals of fuzzy level sets with respect to the partial metric based on a partial ordering. PMID:25695102

The interplay between group crossed products, semigroup crossed products and toeplitz algebras

NASA Astrophysics Data System (ADS)

Yusnitha, I.

2018-05-01

Realization of group crossed products constructed by decomposition, as semigroup crossed products. And connected it to Toeplitz algebra of ordered group quotient to get some preliminaries description for the further study on the structure of Toeplitz algebras of ordered group which is finitely generated.

A systematic linear space approach to solving partially described inverse eigenvalue problems

NASA Astrophysics Data System (ADS)

Hu, Sau-Lon James; Li, Haujun

2008-06-01

Most applications of the inverse eigenvalue problem (IEP), which concerns the reconstruction of a matrix from prescribed spectral data, are associated with special classes of structured matrices. Solving the IEP requires one to satisfy both the spectral constraint and the structural constraint. If the spectral constraint consists of only one or few prescribed eigenpairs, this kind of inverse problem has been referred to as the partially described inverse eigenvalue problem (PDIEP). This paper develops an efficient, general and systematic approach to solve the PDIEP. Basically, the approach, applicable to various structured matrices, converts the PDIEP into an ordinary inverse problem that is formulated as a set of simultaneous linear equations. While solving simultaneous linear equations for model parameters, the singular value decomposition method is applied. Because of the conversion to an ordinary inverse problem, other constraints associated with the model parameters can be easily incorporated into the solution procedure. The detailed derivation and numerical examples to implement the newly developed approach to symmetric Toeplitz and quadratic pencil (including mass, damping and stiffness matrices of a linear dynamic system) PDIEPs are presented. Excellent numerical results for both kinds of problem are achieved under the situations that have either unique or infinitely many solutions.

Spectral analysis of GEOS-3 altimeter data and frequency domain collocation. [to estimate gravity anomalies

NASA Technical Reports Server (NTRS)

Eren, K.

1980-01-01

The mathematical background in spectral analysis as applied to geodetic applications is summarized. The resolution (cut-off frequency) of the GEOS 3 altimeter data is examined by determining the shortest wavelength (corresponding to the cut-off frequency) recoverable. The data from some 18 profiles are used. The total power (variance) in the sea surface topography with respect to the reference ellipsoid as well as with respect to the GEM-9 surface is computed. A fast inversion algorithm for matrices of simple and block Toeplitz matrices and its application to least squares collocation is explained. This algorithm yields a considerable gain in computer time and storage in comparison with conventional least squares collocation. Frequency domain least squares collocation techniques are also introduced and applied to estimating gravity anomalies from GEOS 3 altimeter data. These techniques substantially reduce the computer time and requirements in storage associated with the conventional least squares collocation. Numerical examples given demonstrate the efficiency and speed of these techniques.

Commutative Algebras of Toeplitz Operators in Action

NASA Astrophysics Data System (ADS)

Vasilevski, Nikolai

2011-09-01

We will discuss a quite unexpected phenomenon in the theory of Toeplitz operators on the Bergman space: the existence of a reach family of commutative C*-algebras generated by Toeplitz operators with non-trivial symbols. As it tuns out the smoothness properties of symbols do not play any role in the commutativity, the symbols can be merely measurable. Everything is governed here by the geometry of the underlying manifold, the hyperbolic geometry of the unit disk. We mention as well that the complete characterization of these commutative C*-algebras of Toeplitz operators requires the Berezin quantization procedure. These commutative algebras come with a powerful research tool, the spectral type representation for the operators under study, which permit us to answer to many important questions in the area.

Conjugate-gradient preconditioning methods for shift-variant PET image reconstruction.

PubMed

Fessler, J A; Booth, S D

1999-01-01

Gradient-based iterative methods often converge slowly for tomographic image reconstruction and image restoration problems, but can be accelerated by suitable preconditioners. Diagonal preconditioners offer some improvement in convergence rate, but do not incorporate the structure of the Hessian matrices in imaging problems. Circulant preconditioners can provide remarkable acceleration for inverse problems that are approximately shift-invariant, i.e., for those with approximately block-Toeplitz or block-circulant Hessians. However, in applications with nonuniform noise variance, such as arises from Poisson statistics in emission tomography and in quantum-limited optical imaging, the Hessian of the weighted least-squares objective function is quite shift-variant, and circulant preconditioners perform poorly. Additional shift-variance is caused by edge-preserving regularization methods based on nonquadratic penalty functions. This paper describes new preconditioners that approximate more accurately the Hessian matrices of shift-variant imaging problems. Compared to diagonal or circulant preconditioning, the new preconditioners lead to significantly faster convergence rates for the unconstrained conjugate-gradient (CG) iteration. We also propose a new efficient method for the line-search step required by CG methods. Applications to positron emission tomography (PET) illustrate the method.

Berezin-Toeplitz quantization and naturally defined star products for Kähler manifolds

NASA Astrophysics Data System (ADS)

Schlichenmaier, Martin

2018-04-01

For compact quantizable Kähler manifolds the Berezin-Toeplitz quantization schemes, both operator and deformation quantization (star product) are reviewed. The treatment includes Berezin's covariant symbols and the Berezin transform. The general compact quantizable case was done by Bordemann-Meinrenken-Schlichenmaier, Schlichenmaier, and Karabegov-Schlichenmaier. For star products on Kähler manifolds, separation of variables, or equivalently star product of (anti-) Wick type, is a crucial property. As canonically defined star products the Berezin-Toeplitz, Berezin, and the geometric quantization are treated. It turns out that all three are equivalent, but different.

Fast calculation of the `ILC norm' in iterative learning control

NASA Astrophysics Data System (ADS)

Rice, Justin K.; van Wingerden, Jan-Willem

2013-06-01

In this paper, we discuss and demonstrate a method for the exploitation of matrix structure in computations for iterative learning control (ILC). In Barton, Bristow, and Alleyne [International Journal of Control, 83(2), 1-8 (2010)], a special insight into the structure of the lifted convolution matrices involved in ILC is used along with a modified Lanczos method to achieve very fast computational bounds on the learning convergence, by calculating the 'ILC norm' in ? computational complexity. In this paper, we show how their method is equivalent to a special instance of the sequentially semi-separable (SSS) matrix arithmetic, and thus can be extended to many other computations in ILC, and specialised in some cases to even faster methods. Our SSS-based methodology will be demonstrated on two examples: a linear time-varying example resulting in the same ? complexity as in Barton et al., and a linear time-invariant example where our approach reduces the computational complexity to ?, thus decreasing the computation time, for an example, from the literature by a factor of almost 100. This improvement is achieved by transforming the norm computation via a linear matrix inequality into a check of positive definiteness - which allows us to further exploit the almost-Toeplitz properties of the matrix, and additionally provides explicit upper and lower bounds on the norm of the matrix, instead of the indirect Ritz estimate. These methods are now implemented in a MATLAB toolbox, freely available on the Internet.

Subspace algorithms for identifying separable-in-denominator 2D systems with deterministic-stochastic inputs

NASA Astrophysics Data System (ADS)

Ramos, José A.; Mercère, Guillaume

2016-12-01

In this paper, we present an algorithm for identifying two-dimensional (2D) causal, recursive and separable-in-denominator (CRSD) state-space models in the Roesser form with deterministic-stochastic inputs. The algorithm implements the N4SID, PO-MOESP and CCA methods, which are well known in the literature on 1D system identification, but here we do so for the 2D CRSD Roesser model. The algorithm solves the 2D system identification problem by maintaining the constraint structure imposed by the problem (i.e. Toeplitz and Hankel) and computes the horizontal and vertical system orders, system parameter matrices and covariance matrices of a 2D CRSD Roesser model. From a computational point of view, the algorithm has been presented in a unified framework, where the user can select which of the three methods to use. Furthermore, the identification task is divided into three main parts: (1) computing the deterministic horizontal model parameters, (2) computing the deterministic vertical model parameters and (3) computing the stochastic components. Specific attention has been paid to the computation of a stabilised Kalman gain matrix and a positive real solution when required. The efficiency and robustness of the unified algorithm have been demonstrated via a thorough simulation example.

Tensor Sparse Coding for Positive Definite Matrices.

PubMed

Sivalingam, Ravishankar; Boley, Daniel; Morellas, Vassilios; Papanikolopoulos, Nikos

2013-08-02

In recent years, there has been extensive research on sparse representation of vector-valued signals. In the matrix case, the data points are merely vectorized and treated as vectors thereafter (for e.g., image patches). However, this approach cannot be used for all matrices, as it may destroy the inherent structure of the data. Symmetric positive definite (SPD) matrices constitute one such class of signals, where their implicit structure of positive eigenvalues is lost upon vectorization. This paper proposes a novel sparse coding technique for positive definite matrices, which respects the structure of the Riemannian manifold and preserves the positivity of their eigenvalues, without resorting to vectorization. Synthetic and real-world computer vision experiments with region covariance descriptors demonstrate the need for and the applicability of the new sparse coding model. This work serves to bridge the gap between the sparse modeling paradigm and the space of positive definite matrices.

Tensor sparse coding for positive definite matrices.

PubMed

Sivalingam, Ravishankar; Boley, Daniel; Morellas, Vassilios; Papanikolopoulos, Nikolaos

2014-03-01

In recent years, there has been extensive research on sparse representation of vector-valued signals. In the matrix case, the data points are merely vectorized and treated as vectors thereafter (for example, image patches). However, this approach cannot be used for all matrices, as it may destroy the inherent structure of the data. Symmetric positive definite (SPD) matrices constitute one such class of signals, where their implicit structure of positive eigenvalues is lost upon vectorization. This paper proposes a novel sparse coding technique for positive definite matrices, which respects the structure of the Riemannian manifold and preserves the positivity of their eigenvalues, without resorting to vectorization. Synthetic and real-world computer vision experiments with region covariance descriptors demonstrate the need for and the applicability of the new sparse coding model. This work serves to bridge the gap between the sparse modeling paradigm and the space of positive definite matrices.

Wideband Direction of Arrival Estimation in the Presence of Unknown Mutual Coupling

PubMed Central

Li, Weixing; Zhang, Yue; Lin, Jianzhi; Guo, Rui; Chen, Zengping

2017-01-01

This paper investigates a subarray based algorithm for direction of arrival (DOA) estimation of wideband uniform linear array (ULA), under the presence of frequency-dependent mutual coupling effects. Based on the Toeplitz structure of mutual coupling matrices, the whole array is divided into the middle subarray and the auxiliary subarray. Then two-sided correlation transformation is applied to the correlation matrix of the middle subarray instead of the whole array. In this way, the mutual coupling effects can be eliminated. Finally, the multiple signal classification (MUSIC) method is utilized to derive the DOAs. For the condition when the blind angles exist, we refine DOA estimation by using a simple approach based on the frequency-dependent mutual coupling matrixes (MCMs). The proposed method can achieve high estimation accuracy without any calibration sources. It has a low computational complexity because iterative processing is not required. Simulation results validate the effectiveness and feasibility of the proposed algorithm. PMID:28178177

An efficient numerical method for the solution of the problem of elasticity for 3D-homogeneous elastic medium with cracks and inclusions

NASA Astrophysics Data System (ADS)

Kanaun, S.; Markov, A.

2017-06-01

An efficient numerical method for solution of static problems of elasticity for an infinite homogeneous medium containing inhomogeneities (cracks and inclusions) is developed. Finite number of heterogeneous inclusions and planar parallel cracks of arbitrary shapes is considered. The problem is reduced to a system of surface integral equations for crack opening vectors and volume integral equations for stress tensors inside the inclusions. For the numerical solution of these equations, a class of Gaussian approximating functions is used. The method based on these functions is mesh free. For such functions, the elements of the matrix of the discretized system are combinations of explicit analytical functions and five standard 1D-integrals that can be tabulated. Thus, the numerical integration is excluded from the construction of the matrix of the discretized problem. For regular node grids, the matrix of the discretized system has Toeplitz's properties, and Fast Fourier Transform technique can be used for calculation matrix-vector products of such matrices.

Communication Optimal Parallel Multiplication of Sparse Random Matrices

DTIC Science & Technology

2013-02-21

Definition 2.1), and (2) the algorithm is sparsity- independent, where the computation is statically partitioned to processors independent of the sparsity...struc- ture of the input matrices (see Definition 2.5). The second assumption applies to nearly all existing al- gorithms for general sparse matrix-matrix...where A and B are n× n ER(d) matrices: Definition 2.1 An ER(d) matrix is an adjacency matrix of an Erdős-Rényi graph with parameters n and d/n. That

Orthogonal polynomials, Laguerre Fock space, and quasi-classical asymptotics

NASA Astrophysics Data System (ADS)

Engliš, Miroslav; Ali, S. Twareque

2015-07-01

Continuing our earlier investigation of the Hermite case [S. T. Ali and M. Engliš, J. Math. Phys. 55, 042102 (2014)], we study an unorthodox variant of the Berezin-Toeplitz quantization scheme associated with Laguerre polynomials. In particular, we describe a "Laguerre analogue" of the classical Fock (Segal-Bargmann) space and the relevant semi-classical asymptotics of its Toeplitz operators; the former actually turns out to coincide with the Hilbert space appearing in the construction of the well-known Barut-Girardello coherent states. Further extension to the case of Legendre polynomials is likewise discussed.

A fast direct method for block triangular Toeplitz-like with tri-diagonal block systems from time-fractional partial differential equations

NASA Astrophysics Data System (ADS)

Ke, Rihuan; Ng, Michael K.; Sun, Hai-Wei

2015-12-01

In this paper, we study the block lower triangular Toeplitz-like with tri-diagonal blocks system which arises from the time-fractional partial differential equation. Existing fast numerical solver (e.g., fast approximate inversion method) cannot handle such linear system as the main diagonal blocks are different. The main contribution of this paper is to propose a fast direct method for solving this linear system, and to illustrate that the proposed method is much faster than the classical block forward substitution method for solving this linear system. Our idea is based on the divide-and-conquer strategy and together with the fast Fourier transforms for calculating Toeplitz matrix-vector multiplication. The complexity needs O (MNlog2 ⁡ M) arithmetic operations, where M is the number of blocks (the number of time steps) in the system and N is the size (number of spatial grid points) of each block. Numerical examples from the finite difference discretization of time-fractional partial differential equations are also given to demonstrate the efficiency of the proposed method.

Robust Angle Estimation for MIMO Radar with the Coexistence of Mutual Coupling and Colored Noise.

PubMed

Wang, Junxiang; Wang, Xianpeng; Xu, Dingjie; Bi, Guoan

2018-03-09

This paper deals with joint estimation of direction-of-departure (DOD) and direction-of- arrival (DOA) in bistatic multiple-input multiple-output (MIMO) radar with the coexistence of unknown mutual coupling and spatial colored noise by developing a novel robust covariance tensor-based angle estimation method. In the proposed method, a third-order tensor is firstly formulated for capturing the multidimensional nature of the received data. Then taking advantage of the temporal uncorrelated characteristic of colored noise and the banded complex symmetric Toeplitz structure of the mutual coupling matrices, a novel fourth-order covariance tensor is constructed for eliminating the influence of both spatial colored noise and mutual coupling. After a robust signal subspace estimation is obtained by using the higher-order singular value decomposition (HOSVD) technique, the rotational invariance technique is applied to achieve the DODs and DOAs. Compared with the existing HOSVD-based subspace methods, the proposed method can provide superior angle estimation performance and automatically jointly perform the DODs and DOAs. Results from numerical experiments are presented to verify the effectiveness of the proposed method.

Robust Angle Estimation for MIMO Radar with the Coexistence of Mutual Coupling and Colored Noise

PubMed Central

Wang, Junxiang; Wang, Xianpeng; Xu, Dingjie; Bi, Guoan

2018-01-01

This paper deals with joint estimation of direction-of-departure (DOD) and direction-of- arrival (DOA) in bistatic multiple-input multiple-output (MIMO) radar with the coexistence of unknown mutual coupling and spatial colored noise by developing a novel robust covariance tensor-based angle estimation method. In the proposed method, a third-order tensor is firstly formulated for capturing the multidimensional nature of the received data. Then taking advantage of the temporal uncorrelated characteristic of colored noise and the banded complex symmetric Toeplitz structure of the mutual coupling matrices, a novel fourth-order covariance tensor is constructed for eliminating the influence of both spatial colored noise and mutual coupling. After a robust signal subspace estimation is obtained by using the higher-order singular value decomposition (HOSVD) technique, the rotational invariance technique is applied to achieve the DODs and DOAs. Compared with the existing HOSVD-based subspace methods, the proposed method can provide superior angle estimation performance and automatically jointly perform the DODs and DOAs. Results from numerical experiments are presented to verify the effectiveness of the proposed method. PMID:29522499

Super-resolution Doppler beam sharpening method using fast iterative adaptive approach-based spectral estimation

NASA Astrophysics Data System (ADS)

Mao, Deqing; Zhang, Yin; Zhang, Yongchao; Huang, Yulin; Yang, Jianyu

2018-01-01

Doppler beam sharpening (DBS) is a critical technology for airborne radar ground mapping in forward-squint region. In conventional DBS technology, the narrow-band Doppler filter groups formed by fast Fourier transform (FFT) method suffer from low spectral resolution and high side lobe levels. The iterative adaptive approach (IAA), based on the weighted least squares (WLS), is applied to the DBS imaging applications, forming narrower Doppler filter groups than the FFT with lower side lobe levels. Regrettably, the IAA is iterative, and requires matrix multiplication and inverse operation when forming the covariance matrix, its inverse and traversing the WLS estimate for each sampling point, resulting in a notably high computational complexity for cubic time. We propose a fast IAA (FIAA)-based super-resolution DBS imaging method, taking advantage of the rich matrix structures of the classical narrow-band filtering. First, we formulate the covariance matrix via the FFT instead of the conventional matrix multiplication operation, based on the typical Fourier structure of the steering matrix. Then, by exploiting the Gohberg-Semencul representation, the inverse of the Toeplitz covariance matrix is computed by the celebrated Levinson-Durbin (LD) and Toeplitz-vector algorithm. Finally, the FFT and fast Toeplitz-vector algorithm are further used to traverse the WLS estimates based on the data-dependent trigonometric polynomials. The method uses the Hermitian feature of the echo autocorrelation matrix R to achieve its fast solution and uses the Toeplitz structure of R to realize its fast inversion. The proposed method enjoys a lower computational complexity without performance loss compared with the conventional IAA-based super-resolution DBS imaging method. The results based on simulations and measured data verify the imaging performance and the operational efficiency.

Discrete Painlevé equations for a class of PVI τ-functions given as U(N) averages

NASA Astrophysics Data System (ADS)

Forrester, P. J.; Witte, N. S.

2005-09-01

In a recent work, difference equations (Laguerre-Freud equations) for the bi-orthogonal polynomials and related quantities corresponding to the weight on the unit circle w(z)=\\prod^m_{j=1}(z-z_j(t))^{\\rho_j} were derived. It is shown here that in the case m = 3, these difference equations, when applied to the calculation of the underlying U(N) average, reduce to a coupled system identifiable with that obtained by Adler and van Moerbeke, using the methods of the Toeplitz lattice and Virasoro constraints. Moreover, it is shown that this coupled system can be reduced to yield the discrete fifth Painlevé equation dPV as it occurs in the theory of the sixth Painlevé system. Methods based on affine Weyl group symmetries of Bäcklund transformations have previously yielded the dPV equation, but with different parameters for the same problem. We find an explicit mapping between the two forms. Applications of our results are made to give recurrences for the gap probabilities and moments in the circular unitary ensemble of random matrices, and to the diagonal spin-spin correlation function of the square lattice Ising model.

Convex Banding of the Covariance Matrix

PubMed Central

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. PMID:28042189

Convex Banding of the Covariance Matrix.

PubMed

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.

On Schrödinger's bridge problem

NASA Astrophysics Data System (ADS)

Friedland, S.

2017-11-01

In the first part of this paper we generalize Georgiou-Pavon's result that a positive square matrix can be scaled uniquely to a column stochastic matrix which maps a given positive probability vector to another given positive probability vector. In the second part we prove that a positive quantum channel can be scaled to another positive quantum channel which maps a given positive definite density matrix to another given positive definite density matrix using Brouwer's fixed point theorem. This result proves the Georgiou-Pavon conjecture for two positive definite density matrices, made in their recent paper. We show that the fixed points are unique for certain pairs of positive definite density matrices. Bibliography: 15 titles.

Noncommutative coherent states and related aspects of Berezin-Toeplitz quantization

NASA Astrophysics Data System (ADS)

Hasibul Hassan Chowdhury, S.; Twareque Ali, S.; Engliš, Miroslav

2017-05-01

In this paper, we construct noncommutative coherent states using various families of unitary irreducible representations (UIRs) of Gnc , a connected, simply connected nilpotent Lie group, which was identified as the kinematical symmetry group of noncommutative quantum mechanics for a system of two degrees of freedom in an earlier paper. Similarly described are the degenerate noncommutative coherent states arising from the degenerate UIRs of Gnc . We then compute the reproducing kernels associated with both these families of coherent states and study the Berezin-Toeplitz quantization of the observables on the underlying 4-dimensional phase space, analyzing in particular the semi-classical asymptotics for both these cases. Dedicated by the first and the third authors to the memory of the second author, with gratitude for his friendship and for all they learnt from him.

Fungible Correlation Matrices: A Method for Generating Nonsingular, Singular, and Improper Correlation Matrices for Monte Carlo Research.

PubMed

Waller, Niels G

2016-01-01

For a fixed set of standardized regression coefficients and a fixed coefficient of determination (R-squared), an infinite number of predictor correlation matrices will satisfy the implied quadratic form. I call such matrices fungible correlation matrices. In this article, I describe an algorithm for generating positive definite (PD), positive semidefinite (PSD), or indefinite (ID) fungible correlation matrices that have a random or fixed smallest eigenvalue. The underlying equations of this algorithm are reviewed from both algebraic and geometric perspectives. Two simulation studies illustrate that fungible correlation matrices can be profitably used in Monte Carlo research. The first study uses PD fungible correlation matrices to compare penalized regression algorithms. The second study uses ID fungible correlation matrices to compare matrix-smoothing algorithms. R code for generating fungible correlation matrices is presented in the supplemental materials.

Applications of multiple-constraint matrix updates to the optimal control of large structures

NASA Technical Reports Server (NTRS)

Smith, S. W.; Walcott, B. L.

1992-01-01

Low-authority control or vibration suppression in large, flexible space structures can be formulated as a linear feedback control problem requiring computation of displacement and velocity feedback gain matrices. To ensure stability in the uncontrolled modes, these gain matrices must be symmetric and positive definite. In this paper, efficient computation of symmetric, positive-definite feedback gain matrices is accomplished through the use of multiple-constraint matrix update techniques originally developed for structural identification applications. Two systems were used to illustrate the application: a simple spring-mass system and a planar truss. From these demonstrations, use of this multiple-constraint technique is seen to provide a straightforward approach for computing the low-authority gains.

Tensor Dictionary Learning for Positive Definite Matrices.

PubMed

Sivalingam, Ravishankar; Boley, Daniel; Morellas, Vassilios; Papanikolopoulos, Nikolaos

2015-11-01

Sparse models have proven to be extremely successful in image processing and computer vision. However, a majority of the effort has been focused on sparse representation of vectors and low-rank models for general matrices. The success of sparse modeling, along with popularity of region covariances, has inspired the development of sparse coding approaches for these positive definite descriptors. While in earlier work, the dictionary was formed from all, or a random subset of, the training signals, it is clearly advantageous to learn a concise dictionary from the entire training set. In this paper, we propose a novel approach for dictionary learning over positive definite matrices. The dictionary is learned by alternating minimization between sparse coding and dictionary update stages, and different atom update methods are described. A discriminative version of the dictionary learning approach is also proposed, which simultaneously learns dictionaries for different classes in classification or clustering. Experimental results demonstrate the advantage of learning dictionaries from data both from reconstruction and classification viewpoints. Finally, a software library is presented comprising C++ binaries for all the positive definite sparse coding and dictionary learning approaches presented here.

Hermite polynomials and quasi-classical asymptotics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ali, S. Twareque, E-mail: twareque.ali@concordia.ca; Engliš, Miroslav, E-mail: englis@math.cas.cz

2014-04-15

We study an unorthodox variant of the Berezin-Toeplitz type of quantization scheme, on a reproducing kernel Hilbert space generated by the real Hermite polynomials and work out the associated quasi-classical asymptotics.

Computation of transform domain covariance matrices

NASA Technical Reports Server (NTRS)

Fino, B. J.; Algazi, V. R.

1975-01-01

It is often of interest in applications to compute the covariance matrix of a random process transformed by a fast unitary transform. Here, the recursive definition of fast unitary transforms is used to derive recursive relations for the covariance matrices of the transformed process. These relations lead to fast methods of computation of covariance matrices and to substantial reductions of the number of arithmetic operations required.

Almost commuting self-adjoint matrices: The real and self-dual cases

NASA Astrophysics Data System (ADS)

Loring, Terry A.; Sørensen, Adam P. W.

2016-08-01

We show that a pair of almost commuting self-adjoint, symmetric matrices is close to a pair of commuting self-adjoint, symmetric matrices (in a uniform way). Moreover, we prove that the same holds with self-dual in place of symmetric and also for paths of self-adjoint matrices. Since a symmetric, self-adjoint matrix is real, we get a real version of Huaxin Lin’s famous theorem on almost commuting matrices. Similarly, the self-dual case gives a version for matrices over the quaternions. To prove these results, we develop a theory of semiprojectivity for real C*-algebras and also examine various definitions of low-rank for real C*-algebras.

Matric potential

Treesearch

Melvin T. Tyree

2003-01-01

Matric potential, r, is a component of water potential, ?, but has different meanings in plant physiology vs. soil science. A rigorous definition of r requires a reference to principles of thermodynamics (both classical and irreversible thermodynamics). A rigorous treatment is beyond the scope of this brief overview. Readers...

Approximate Joint Diagonalization and Geometric Mean of Symmetric Positive Definite Matrices

PubMed Central

Congedo, Marco; Afsari, Bijan; Barachant, Alexandre; Moakher, Maher

2015-01-01

We explore the connection between two problems that have arisen independently in the signal processing and related fields: the estimation of the geometric mean of a set of symmetric positive definite (SPD) matrices and their approximate joint diagonalization (AJD). Today there is a considerable interest in estimating the geometric mean of a SPD matrix set in the manifold of SPD matrices endowed with the Fisher information metric. The resulting mean has several important invariance properties and has proven very useful in diverse engineering applications such as biomedical and image data processing. While for two SPD matrices the mean has an algebraic closed form solution, for a set of more than two SPD matrices it can only be estimated by iterative algorithms. However, none of the existing iterative algorithms feature at the same time fast convergence, low computational complexity per iteration and guarantee of convergence. For this reason, recently other definitions of geometric mean based on symmetric divergence measures, such as the Bhattacharyya divergence, have been considered. The resulting means, although possibly useful in practice, do not satisfy all desirable invariance properties. In this paper we consider geometric means of covariance matrices estimated on high-dimensional time-series, assuming that the data is generated according to an instantaneous mixing model, which is very common in signal processing. We show that in these circumstances we can approximate the Fisher information geometric mean by employing an efficient AJD algorithm. Our approximation is in general much closer to the Fisher information geometric mean as compared to its competitors and verifies many invariance properties. Furthermore, convergence is guaranteed, the computational complexity is low and the convergence rate is quadratic. The accuracy of this new geometric mean approximation is demonstrated by means of simulations. PMID:25919667

Equality of the Spectral and Dynamical Definitions of Reflection

NASA Astrophysics Data System (ADS)

Breuer, Jonathan; Ryckman, Eric; Simon, Barry

2010-04-01

For full-line Jacobi matrices, Schrödinger operators, and CMV matrices, we show that being reflectionless, in the sense of the well-known property of m-functions, is equivalent to a lack of reflection in the dynamics in the sense that any state that goes entirely to x = -∞ as t → -∞ goes entirely to x = ∞ as t → ∞. This allows us to settle a conjecture of Deift and Simon from 1983 regarding ergodic Jacobi matrices.

3D Weight Matrices in Modeling Real Estate Prices

NASA Astrophysics Data System (ADS)

Mimis, A.

2016-10-01

Central role in spatial econometric models of real estate data has the definition of the weight matrix by which we capture the spatial dependence between the observations. The weight matrices presented in literature so far, treats space in a two dimensional manner leaving out the effect of the third dimension or in our case the difference in height where the property resides. To overcome this, we propose a new definition of the weight matrix including the third dimensional effect by using the Hadamard product. The results illustrated that the level effect can be absorbed into the new weight matrix.

Quantum knots and the number of knot mosaics

NASA Astrophysics Data System (ADS)

Oh, Seungsang; Hong, Kyungpyo; Lee, Ho; Lee, Hwa Jeong

2015-03-01

Lomonaco and Kauffman developed a knot mosaic system to introduce a precise and workable definition of a quantum knot system. This definition is intended to represent an actual physical quantum system. A knot -mosaic is an matrix of mosaic tiles ( through depicted in the introduction) representing a knot or a link by adjoining properly that is called suitably connected. is the total number of all knot -mosaics. This value indicates the dimension of the Hilbert space of these quantum knot system. is already found for by the authors. In this paper, we construct an algorithm producing the precise value of for that uses recurrence relations of state matrices that turn out to be remarkably efficient to count knot mosaics. where matrices and are defined by for , with matrices and . Here denotes the sum of all entries of a matrix . For , means the identity matrix of size.

Singular boundary method for wave propagation analysis in periodic structures

NASA Astrophysics Data System (ADS)

Fu, Zhuojia; Chen, Wen; Wen, Pihua; Zhang, Chuanzeng

2018-07-01

A strong-form boundary collocation method, the singular boundary method (SBM), is developed in this paper for the wave propagation analysis at low and moderate wavenumbers in periodic structures. The SBM is of several advantages including mathematically simple, easy-to-program, meshless with the application of the concept of origin intensity factors in order to eliminate the singularity of the fundamental solutions and avoid the numerical evaluation of the singular integrals in the boundary element method. Due to the periodic behaviors of the structures, the SBM coefficient matrix can be represented as a block Toeplitz matrix. By employing three different fast Toeplitz-matrix solvers, the computational time and storage requirements are significantly reduced in the proposed SBM analysis. To demonstrate the effectiveness of the proposed SBM formulation for wave propagation analysis in periodic structures, several benchmark examples are presented and discussed The proposed SBM results are compared with the analytical solutions, the reference results and the COMSOL software.

Fast, exact k-space sample density compensation for trajectories composed of rotationally symmetric segments, and the SNR-optimized image reconstruction from non-Cartesian samples.

PubMed

Mitsouras, Dimitris; Mulkern, Robert V; Rybicki, Frank J

2008-08-01

A recently developed method for exact density compensation of non uniformly arranged samples relies on the analytically known cross-correlations of Fourier basis functions corresponding to the traced k-space trajectory. This method produces a linear system whose solution represents compensated samples that normalize the contribution of each independent element of information that can be expressed by the underlying trajectory. Unfortunately, linear system-based density compensation approaches quickly become computationally demanding with increasing number of samples (i.e., image resolution). Here, it is shown that when a trajectory is composed of rotationally symmetric interleaves, such as spiral and PROPELLER trajectories, this cross-correlations method leads to a highly simplified system of equations. Specifically, it is shown that the system matrix is circulant block-Toeplitz so that the linear system is easily block-diagonalized. The method is described and demonstrated for 32-way interleaved spiral trajectories designed for 256 image matrices; samples are compensated non iteratively in a few seconds by solving the small independent block-diagonalized linear systems in parallel. Because the method is exact and considers all the interactions between all acquired samples, up to a 10% reduction in reconstruction error concurrently with an up to 30% increase in signal to noise ratio are achieved compared to standard density compensation methods. (c) 2008 Wiley-Liss, Inc.

Characterizing the impact of model error in hydrologic time series recovery inverse problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hansen, Scott K.; He, Jiachuan; Vesselinov, Velimir V.

Hydrologic models are commonly over-smoothed relative to reality, owing to computational limitations and to the difficulty of obtaining accurate high-resolution information. When used in an inversion context, such models may introduce systematic biases which cannot be encapsulated by an unbiased “observation noise” term of the type assumed by standard regularization theory and typical Bayesian formulations. Despite its importance, model error is difficult to encapsulate systematically and is often neglected. In this paper, model error is considered for an important class of inverse problems that includes interpretation of hydraulic transients and contaminant source history inference: reconstruction of a time series thatmore » has been convolved against a transfer function (i.e., impulse response) that is only approximately known. Using established harmonic theory along with two results established here regarding triangular Toeplitz matrices, upper and lower error bounds are derived for the effect of systematic model error on time series recovery for both well-determined and over-determined inverse problems. It is seen that use of additional measurement locations does not improve expected performance in the face of model error. A Monte Carlo study of a realistic hydraulic reconstruction problem is presented, and the lower error bound is seen informative about expected behavior. Finally, a possible diagnostic criterion for blind transfer function characterization is also uncovered.« less

A non-stochastic iterative computational method to model light propagation in turbid media

NASA Astrophysics Data System (ADS)

McIntyre, Thomas J.; Zemp, Roger J.

2015-03-01

Monte Carlo models are widely used to model light transport in turbid media, however their results implicitly contain stochastic variations. These fluctuations are not ideal, especially for inverse problems where Jacobian matrix errors can lead to large uncertainties upon matrix inversion. Yet Monte Carlo approaches are more computationally favorable than solving the full Radiative Transport Equation. Here, a non-stochastic computational method of estimating fluence distributions in turbid media is proposed, which is called the Non-Stochastic Propagation by Iterative Radiance Evaluation method (NSPIRE). Rather than using stochastic means to determine a random walk for each photon packet, the propagation of light from any element to all other elements in a grid is modelled simultaneously. For locally homogeneous anisotropic turbid media, the matrices used to represent scattering and projection are shown to be block Toeplitz, which leads to computational simplifications via convolution operators. To evaluate the accuracy of the algorithm, 2D simulations were done and compared against Monte Carlo models for the cases of an isotropic point source and a pencil beam incident on a semi-infinite turbid medium. The model was shown to have a mean percent error less than 2%. The algorithm represents a new paradigm in radiative transport modelling and may offer a non-stochastic alternative to modeling light transport in anisotropic scattering media for applications where the diffusion approximation is insufficient.

Characterizing the impact of model error in hydrologic time series recovery inverse problems

DOE PAGES

Hansen, Scott K.; He, Jiachuan; Vesselinov, Velimir V.

2017-10-28

Hydrologic models are commonly over-smoothed relative to reality, owing to computational limitations and to the difficulty of obtaining accurate high-resolution information. When used in an inversion context, such models may introduce systematic biases which cannot be encapsulated by an unbiased “observation noise” term of the type assumed by standard regularization theory and typical Bayesian formulations. Despite its importance, model error is difficult to encapsulate systematically and is often neglected. In this paper, model error is considered for an important class of inverse problems that includes interpretation of hydraulic transients and contaminant source history inference: reconstruction of a time series thatmore » has been convolved against a transfer function (i.e., impulse response) that is only approximately known. Using established harmonic theory along with two results established here regarding triangular Toeplitz matrices, upper and lower error bounds are derived for the effect of systematic model error on time series recovery for both well-determined and over-determined inverse problems. It is seen that use of additional measurement locations does not improve expected performance in the face of model error. A Monte Carlo study of a realistic hydraulic reconstruction problem is presented, and the lower error bound is seen informative about expected behavior. Finally, a possible diagnostic criterion for blind transfer function characterization is also uncovered.« less

Remediating Non-Positive Definite State Covariances for Collision Probability Estimation

NASA Technical Reports Server (NTRS)

Hall, Doyle T.; Hejduk, Matthew D.; Johnson, Lauren C.

2017-01-01

The NASA Conjunction Assessment Risk Analysis team estimates the probability of collision (Pc) for a set of Earth-orbiting satellites. The Pc estimation software processes satellite position+velocity states and their associated covariance matri-ces. On occasion, the software encounters non-positive definite (NPD) state co-variances, which can adversely affect or prevent the Pc estimation process. Inter-polation inaccuracies appear to account for the majority of such covariances, alt-hough other mechanisms contribute also. This paper investigates the origin of NPD state covariance matrices, three different methods for remediating these co-variances when and if necessary, and the associated effects on the Pc estimation process.

Space station data system analysis/architecture study. Task 4: System definition report. Appendix

NASA Technical Reports Server (NTRS)

1985-01-01

Appendices to the systems definition study for the space station Data System are compiled. Supplemental information on external interface specification, simulation and modeling, and function design characteristics is presented along with data flow diagrams, a data dictionary, and function allocation matrices.

Analytically solvable model of an electronic Mach-Zehnder interferometer

NASA Astrophysics Data System (ADS)

Ngo Dinh, Stéphane; Bagrets, Dmitry A.; Mirlin, Alexander D.

2013-05-01

We consider a class of models of nonequilibrium electronic Mach-Zehnder interferometers built on integer quantum Hall edges states. The models are characterized by the electron-electron interaction being restricted to the inner part of the interferometer and transmission coefficients of the quantum quantum point contacts, defining the interferometer, which may take arbitrary values from zero to one. We establish an exact solution of these models in terms of single-particle quantities, determinants and resolvents of Fredholm integral operators. In the general situation, the results can be obtained numerically. In the case of strong charging interaction, the operators acquire the block Toeplitz form. Analyzing the corresponding Riemann-Hilbert problem, we reduce the result to certain singular single-channel determinants (which are a generalization of Toeplitz determinants with Fisher-Hartwig singularities) and obtain an analytic result for the interference current (and, in particular, for the visibility of Aharonov-Bohm oscillations). Our results, which are in good agreement with experimental observations, show an intimate connection between the observed “lobe” structure in the visibility of Aharonov-Bohm oscillations and multiple branches in the asymptotics of singular integral determinants.

A family of Nikishin systems with periodic recurrence coefficients

DOE Office of Scientific and Technical Information (OSTI.GOV)

Delvaux, Steven; Lopez, Abey; Lopez, Guillermo L

2013-01-31

Suppose we have a Nikishin system of p measures with the kth generating measure of the Nikishin system supported on an interval {Delta}{sub k} subset of R with {Delta}{sub k} Intersection {Delta}{sub k+1} = Empty-Set for all k. It is well known that the corresponding staircase sequence of multiple orthogonal polynomials satisfies a (p+2)-term recurrence relation whose recurrence coefficients, under appropriate assumptions on the generating measures, have periodic limits of period p. (The limit values depend only on the positions of the intervals {Delta}{sub k}.) Taking these periodic limit values as the coefficients of a new (p+2)-term recurrence relation, wemore » construct a canonical sequence of monic polynomials {l_brace}P{sub n}{r_brace}{sub n=0}{sup {infinity}}, the so-called Chebyshev-Nikishin polynomials. We show that the polynomials P{sub n} themselves form a sequence of multiple orthogonal polynomials with respect to some Nikishin system of measures, with the kth generating measure being absolutely continuous on {Delta}{sub k}. In this way we generalize a result of the third author and Rocha [22] for the case p=2. The proof uses the connection with block Toeplitz matrices, and with a certain Riemann surface of genus zero. We also obtain strong asymptotics and an exact Widom-type formula for functions of the second kind of the Nikishin system for {l_brace}P{sub n}{r_brace}{sub n=0}{sup {infinity}}. Bibliography: 27 titles.« less

A Bayesian approach to multivariate measurement system assessment

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hamada, Michael Scott

This article considers system assessment for multivariate measurements and presents a Bayesian approach to analyzing gauge R&R study data. The evaluation of variances for univariate measurement becomes the evaluation of covariance matrices for multivariate measurements. The Bayesian approach ensures positive definite estimates of the covariance matrices and easily provides their uncertainty. Furthermore, various measurement system assessment criteria are easily evaluated. The approach is illustrated with data from a real gauge R&R study as well as simulated data.

A Bayesian approach to multivariate measurement system assessment

DOE PAGES

Hamada, Michael Scott

2016-07-01

This article considers system assessment for multivariate measurements and presents a Bayesian approach to analyzing gauge R&R study data. The evaluation of variances for univariate measurement becomes the evaluation of covariance matrices for multivariate measurements. The Bayesian approach ensures positive definite estimates of the covariance matrices and easily provides their uncertainty. Furthermore, various measurement system assessment criteria are easily evaluated. The approach is illustrated with data from a real gauge R&R study as well as simulated data.

On Generalizations of Cochran’s Theorem and Projection Matrices.

DTIC Science & Technology

1980-08-01

Definiteness of the Estimated Dispersion Matrix in a Multivariate Linear Model ," F. Pukelsheim and George P.H. Styan, May 1978. TECHNICAL REPORTS...with applications to the analysis of covariance," Proc. Cambridge Philos. Soc., 30, pp. 178-191. Graybill , F. A. and Marsaglia, G. (1957...34Idempotent matrices and quad- ratic forms in the general linear hypothesis," Ann. Math. Statist., 28, pp. 678-686. Greub, W. (1975). Linear Algebra (4th ed

A split band-Cholesky equation solving strategy for finite element analysis of transient field problems. [in fluid mechanics

NASA Technical Reports Server (NTRS)

Cooke, C. H.

1978-01-01

The paper describes the split-Cholesky strategy for banded matrices arising from the large systems of equations in certain fluid mechanics problems. The basic idea is that for a banded matrix the computation can be carried out in pieces, with only a small portion of the matrix residing in core. Mesh considerations are discussed by demonstrating the manner in which the assembly of finite element equations proceeds for linear trial functions on a triangular mesh. The FORTRAN code which implements the out-of-core decomposition strategy for banded symmetric positive definite matrices (mass matrices) of a coupled initial value problem is given.

Recursive inverse factorization.

PubMed

Rubensson, Emanuel H; Bock, Nicolas; Holmström, Erik; Niklasson, Anders M N

2008-03-14

A recursive algorithm for the inverse factorization S(-1)=ZZ(*) of Hermitian positive definite matrices S is proposed. The inverse factorization is based on iterative refinement [A.M.N. Niklasson, Phys. Rev. B 70, 193102 (2004)] combined with a recursive decomposition of S. As the computational kernel is matrix-matrix multiplication, the algorithm can be parallelized and the computational effort increases linearly with system size for systems with sufficiently sparse matrices. Recent advances in network theory are used to find appropriate recursive decompositions. We show that optimization of the so-called network modularity results in an improved partitioning compared to other approaches. In particular, when the recursive inverse factorization is applied to overlap matrices of irregularly structured three-dimensional molecules.

Recursive inversion of externally defined linear systems

NASA Technical Reports Server (NTRS)

Bach, Ralph E., Jr.; Baram, Yoram

1988-01-01

The approximate inversion of an internally unknown linear system, given by its impulse response sequence, by an inverse system having a finite impulse response, is considered. The recursive least squares procedure is shown to have an exact initialization, based on the triangular Toeplitz structure of the matrix involved. The proposed approach also suggests solutions to the problems of system identification and compensation.

Standards application and development plan for solar thermal technologies

NASA Astrophysics Data System (ADS)

Cobb, H. R. W.

1981-07-01

Functional and standards matrices, developed from input from ST users and from the industry that will be continually reviewed and updated as commercial aspects develop are presented. The matrices highlight codes, standards, test methods, functions and definitions that need to be developed. They will be submitted through ANSI for development by national consensus bodies. A contingency action is proposed for standards development if specific input is lacking at the committee level or if early development of a standard would hasten commercialization or gain needed jurisdictional acceptance.

Jensen-Bregman LogDet Divergence for Efficient Similarity Computations on Positive Definite Tensors

DTIC Science & Technology

2012-05-02

function of Legendre-type on int(domS) [29]. From (7) the following properties of dφ(x, y) are apparent: strict convexity in x; asym- metry; non ...tensor imaging. An important task in all of these applications is to compute the distance between covariance matrices using a (dis)similarity function ...important task in all of these applications is to compute the distance between covariance matrices using a (dis)similarity function , for which the natural

MALDI matrices for low molecular weight compounds: an endless story?

PubMed

Calvano, Cosima Damiana; Monopoli, Antonio; Cataldi, Tommaso R I; Palmisano, Francesco

2018-04-23

Since its introduction in the 1980s, matrix-assisted laser desorption/ionization mass spectrometry (MALDI MS) has gained a prominent role in the analysis of high molecular weight biomolecules such as proteins, peptides, oligonucleotides, and polysaccharides. Its application to low molecular weight compounds has remained for long time challenging due to the spectral interferences produced by conventional organic matrices in the low m/z window. To overcome this problem, specific sample preparation such as analyte/matrix derivatization, addition of dopants, or sophisticated deposition technique especially useful for imaging experiments, have been proposed. Alternative approaches based on second generation (rationally designed) organic matrices, ionic liquids, and inorganic matrices, including metallic nanoparticles, have been the object of intense and continuous research efforts. Definite evidences are now provided that MALDI MS represents a powerful and invaluable analytical tool also for small molecules, including their quantification, thus opening new, exciting applications in metabolomics and imaging mass spectrometry. This review is intended to offer a concise critical overview of the most recent achievements about MALDI matrices capable of specifically address the challenging issue of small molecules analysis. Graphical abstract An ideal Book of matrices for MALDI MS of small molecules.

Application of Semi-Definite Programming for Many-Fermion Systems

NASA Astrophysics Data System (ADS)

Zhao, Zhengji; Braams, Bastiaan; Fukuda, Mituhiro; Overton, Michael

2003-03-01

The ground state energy and other important observables of a many-fermion system with one- and two-body interactions only can all be obtained from the first order and second order Reduced Density Matrices (RDM's) of the system. Using these density matrices and a family of associated representability conditions one may obtain an approximation method for electronic structure theory that is in the mathematical form of Semi-Definite Programming (SDP): minimize a linear matrix functional over a space of positive semidefinite matrices subject to linear constraints. The representability conditions are some known necessary conditions, starting with the well-known P, Q, and G conditions [Claude Garrod and Jerome K. Percus, Reducation of the N-Particle Variational Problem, J. Math. Phys. 5 (1964) 1756-1776]. The RDM method with SDP has great potential advantages over the wave function method when the particle number N is large. The dimension of the full configuration space increases exponentially with N, but in RDM method with SDP the dimension of the objective matrix (which includes RDM's) increases only polynomially with N. We will report on the effect of adding the generalized three-index conditions proposed in [R. M. Erdahl, Representability, Int. J. Quantum Chem. 13 (1978) 697-718].

Recursive inversion of externally defined linear systems by FIR filters

NASA Technical Reports Server (NTRS)

Bach, Ralph E., Jr.; Baram, Yoram

1989-01-01

The approximate inversion of an internally unknown linear system, given by its impulse response sequence, by an inverse system having a finite impulse response, is considered. The recursive least-squares procedure is shown to have an exact initialization, based on the triangular Toeplitz structure of the matrix involved. The proposed approach also suggests solutions to the problem of system identification and compensation.

The spectra of reducible matrices over complete commutative idempotent semifields and their spectral lattices

NASA Astrophysics Data System (ADS)

José Valverde-Albacete, Francisco; Peláez-Moreno, Carmen

2016-02-01

Previous work has shown a relation between L-valued extensions of Formal Concept Analysis and the spectra of some matrices related to L-valued contexts. To clarify this relation, we investigated elsewhere the nature of the spectra of irreducible matrices over idempotent semifields in the framework of dioids, naturally ordered semirings, that encompass several of those extensions. This initial work already showed many differences with respect to their counterparts over incomplete idempotent semifields, in what concerns the definition of the spectrum and the eigenvectors. Considering special sets of eigenvectors also brought out complete lattices in the picture and we argue that such structure may be more important than standard eigenspace structure for matrices over completed idempotent semifields. In this paper, we complete that investigation in the sense that we consider the spectra of reducible matrices over completed idempotent semifields and dioids, giving, as a result, a constructive solution to the all-eigenvectors problem in this setting. This solution shows that the relation of complete lattices to eigenspaces is even tighter than suspected.

XENOBIOTIC METHODS DEVELOPMENT FOR HUMAN EXPOSURE ASSESSMENT RESEARCH

EPA Science Inventory

Biomarkers from blood, breath, urine, and other physiological matrices can provide useful information regarding exposures to environmental pollutants. Once developed and applied appropriately, specific and sensitive methods can often provide definitive data identifying the vario...

Kramers problem: Numerical Wiener-Hopf-like model characteristics

NASA Astrophysics Data System (ADS)

Ezin, A. N.; Samgin, A. L.

2010-11-01

Since the Kramers problem cannot be, in general, solved in terms of elementary functions, various numerical techniques or approximate methods must be employed. We present a study of characteristics for a particle in a damped well, which can be considered as a discretized version of the Melnikov [Phys. Rev. E 48, 3271 (1993)]10.1103/PhysRevE.48.3271 turnover theory. The main goal is to justify the direct computational scheme to the basic Wiener-Hopf model. In contrast to the Melnikov approach, which implements factorization through a Cauchy-theorem-based formulation, we employ the Wiener-Levy theorem to reduce the Kramers problem to a Wiener-Hopf sum equation written in terms of Toeplitz matrices. This latter can provide a stringent test for the reliability of analytic approximations for energy distribution functions occurring in the Kramers problems at arbitrary damping. For certain conditions, the simulated characteristics are compared well with those determined using the conventional Fourier-integral formulas, but sometimes may differ slightly depending on the value of a dissipation parameter. Another important feature is that, with our method, we can avoid some complications inherent to the Melnikov method. The calculational technique reported in the present paper may gain particular importance in situations where the energy losses of the particle to the bath are a complex-shaped function of the particle energy and analytic solutions of desired accuracy are not at hand. In order to appreciate more readily the significance and scope of the present numerical approach, we also discuss concrete aspects relating to the field of superionic conductors.

Problems of Terminology in the Teaching of Plant Water Relations

ERIC Educational Resources Information Center

Bradbeer, Philip A.; And Others

1976-01-01

Recommends use by teachers of new terminology regarding plant water relations. Includes definitions and Greek symbols for the following terms: water potential, water potential of cell, osmotic potential, matric potential, and pressure potential. (CS)

Symmetric tridiagonal structure preserving finite element model updating problem for the quadratic model

NASA Astrophysics Data System (ADS)

Rakshit, Suman; Khare, Swanand R.; Datta, Biswa Nath

2018-07-01

One of the most important yet difficult aspect of the Finite Element Model Updating Problem is to preserve the finite element inherited structures in the updated model. Finite element matrices are in general symmetric, positive definite (or semi-definite) and banded (tridiagonal, diagonal, penta-diagonal, etc.). Though a large number of papers have been published in recent years on various aspects of solutions of this problem, papers dealing with structure preservation almost do not exist. A novel optimization based approach that preserves the symmetric tridiagonal structures of the stiffness and damping matrices is proposed in this paper. An analytical expression for the global minimum solution of the associated optimization problem along with the results of numerical experiments obtained by both the analytical expressions and by an appropriate numerical optimization algorithm are presented. The results of numerical experiments support the validity of the proposed method.

Inverse Scattering for Electron Density Profile Determination. Volume I.

DTIC Science & Technology

1981-09-24

Ant. Prop., AP-24, 906-7, 1976. 39. T. Kailath, A. Vierra, and M. Morf, "Inverses of Toeplitz Operators, Innovations, and Orthogonal Polynomials ...aspect of these results is the tremendous amount of new insight into the basic physics of inverse scattering (and, indeed, into fundamental field...inhomogeneous media in general and on scattering by the ionosphere in particular were identified. These results have important implications for other

Computing partial traces and reduced density matrices

NASA Astrophysics Data System (ADS)

Maziero, Jonas

Taking partial traces (PTrs) for computing reduced density matrices, or related functions, is a ubiquitous procedure in the quantum mechanics of composite systems. In this paper, we present a thorough description of this function and analyze the number of elementary operations (ops) needed, under some possible alternative implementations, to compute it on a classical computer. As we note, it is worthwhile doing some analytical developments in order to avoid making null multiplications and sums, what can considerably reduce the ops. For instance, for a bipartite system ℋa⊗ℋb with dimensions da=dimℋa and db=dimℋb and for da,db≫1, while a direct use of PTr definition applied to ℋb requires 𝒪(da6db6) ops, its optimized implementation entails 𝒪(da2db) ops. In the sequence, we regard the computation of PTrs for general multipartite systems and describe Fortran code provided to implement it numerically. We also consider the calculation of reduced density matrices via Bloch’s parametrization with generalized Gell Mann’s matrices.

Dimensionality reduction based on distance preservation to local mean for symmetric positive definite matrices and its application in brain-computer interfaces

NASA Astrophysics Data System (ADS)

Davoudi, Alireza; Shiry Ghidary, Saeed; Sadatnejad, Khadijeh

2017-06-01

Objective. In this paper, we propose a nonlinear dimensionality reduction algorithm for the manifold of symmetric positive definite (SPD) matrices that considers the geometry of SPD matrices and provides a low-dimensional representation of the manifold with high class discrimination in a supervised or unsupervised manner. Approach. The proposed algorithm tries to preserve the local structure of the data by preserving distances to local means (DPLM) and also provides an implicit projection matrix. DPLM is linear in terms of the number of training samples. Main results. We performed several experiments on the multi-class dataset IIa from BCI competition IV and two other datasets from BCI competition III including datasets IIIa and IVa. The results show that our approach as dimensionality reduction technique—leads to superior results in comparison with other competitors in the related literature because of its robustness against outliers and the way it preserves the local geometry of the data. Significance. The experiments confirm that the combination of DPLM with filter geodesic minimum distance to mean as the classifier leads to superior performance compared with the state of the art on brain-computer interface competition IV dataset IIa. Also the statistical analysis shows that our dimensionality reduction method performs significantly better than its competitors.

Six steps to an effective denials management program.

PubMed

Robertson, Brian; Doré, Alexander

2005-09-01

The following six steps can help you manage denials management issues in your organization: Create standard definitions of denial types. Establish a denial hierarchy. Establish a centralized denial database. Develop key performance indicators. Build responsibility matrices. Measure, monitor, and take action.

Regularized Reconstruction of Dynamic Contrast-Enhanced MR Images for Evaluation of Breast Lesions

DTIC Science & Technology

2011-01-01

Magnetic resonance imaging contrast-enhanced relaxometry of breast tumors: an MRI multicenter investigation concerning 100 patients,” Mag. Res. Im., vol...The overall goal of this project was to develop, implement, and evaluate methods for im- proving image quality in dynamic magnetic resonance imaging ...Olafsson, H. R. Shi, and D. C. Noll, “Toeplitz-based iterative image reconstruction for MRI with correction for magnetic field inhomogeneity,” IEEE

A computer package for the design and eigenproblem solution of damped linear multidegree of freedom systems

NASA Technical Reports Server (NTRS)

Ahmadian, M.; Inman, D. J.

1982-01-01

Systems described by the matrix differental equation are considered. An interactive design routine is presented for positive definite mass, damping, and stiffness matrices. Designing is accomplished by adjusting the mass, damping, and stiffness matrices to obtain a desired oscillation behavior. The algorithm also features interactively modifying the physical structure of the system, obtaining the matrix structure and a number of other system properties. In case of a general system, where the M, C, and K matrices lack any special properties, a routine for the eigenproblem solution of the system is developed. The latent roots are obtained by computing the characteristic polynomial of the system and solving for its roots. The above routines are prepared in FORTRAN IV and prove to be usable for the machines with low core memory.

Definition of a parametric form of nonsingular Mueller matrices.

PubMed

Devlaminck, Vincent; Terrier, Patrick

2008-11-01

The goal of this paper is to propose a mathematical framework to define and analyze a general parametric form of an arbitrary nonsingular Mueller matrix. Starting from previous results about nondepolarizing matrices, we generalize the method to any nonsingular Mueller matrix. We address this problem in a six-dimensional space in order to introduce a transformation group with the same number of degrees of freedom and explain why subsets of O(5,1), the orthogonal group associated with six-dimensional Minkowski space, is a physically admissible solution to this question. Generators of this group are used to define possible expressions of an arbitrary nonsingular Mueller matrix. Ultimately, the problem of decomposition of these matrices is addressed, and we point out that the "reverse" and "forward" decomposition concepts recently introduced may be inferred from the formalism we propose.

A Generalization of the Simultaneous Diagonalization of Hermitian Matrices and its Relation to Quantum Estimation Theory

NASA Astrophysics Data System (ADS)

Nagaoka, Hiroshi

We study the problem of minimizing a quadratic quantity defined for given two Hermitian matrices X, Y and a positive-definite Hermitian matrix. This problem is reduced to the simultaneous diagonalization of X, Y when XY = YX. We derive a lower bound for the quantity, and in some special cases solve the problem by showing that the lower bound is achievable. This problem is closely related to a simultaneous measurement of quantum mechanical observables which are not commuting and has an application in the theory of quantum state estimation.

Machine learning with quantum relative entropy

NASA Astrophysics Data System (ADS)

Tsuda, Koji

2009-12-01

Density matrices are a central tool in quantum physics, but it is also used in machine learning. A positive definite matrix called kernel matrix is used to represent the similarities between examples. Positive definiteness assures that the examples are embedded in an Euclidean space. When a positive definite matrix is learned from data, one has to design an update rule that maintains the positive definiteness. Our update rule, called matrix exponentiated gradient update, is motivated by the quantum relative entropy. Notably, the relative entropy is an instance of Bregman divergences, which are asymmetric distance measures specifying theoretical properties of machine learning algorithms. Using the calculus commonly used in quantum physics, we prove an upperbound of the generalization error of online learning.

An Improved DOA Estimation Approach Using Coarray Interpolation and Matrix Denoising

PubMed Central

Guo, Muran; Chen, Tao; Wang, Ben

2017-01-01

Co-prime arrays can estimate the directions of arrival (DOAs) of O(MN) sources with O(M+N) sensors, and are convenient to analyze due to their closed-form expression for the locations of virtual lags. However, the number of degrees of freedom is limited due to the existence of holes in difference coarrays if subspace-based algorithms such as the spatial smoothing multiple signal classification (MUSIC) algorithm are utilized. To address this issue, techniques such as positive definite Toeplitz completion and array interpolation have been proposed in the literature. Another factor that compromises the accuracy of DOA estimation is the limitation of the number of snapshots. Coarray-based processing is particularly sensitive to the discrepancy between the sample covariance matrix and the ideal covariance matrix due to the finite number of snapshots. In this paper, coarray interpolation based on matrix completion (MC) followed by a denoising operation is proposed to detect more sources with a higher accuracy. The effectiveness of the proposed method is based on the capability of MC to fill in holes in the virtual sensors and that of MC denoising operation to reduce the perturbation in the sample covariance matrix. The results of numerical simulations verify the superiority of the proposed approach. PMID:28509886

An Improved DOA Estimation Approach Using Coarray Interpolation and Matrix Denoising.

PubMed

Guo, Muran; Chen, Tao; Wang, Ben

2017-05-16

Co-prime arrays can estimate the directions of arrival (DOAs) of O ( M N ) sources with O ( M + N ) sensors, and are convenient to analyze due to their closed-form expression for the locations of virtual lags. However, the number of degrees of freedom is limited due to the existence of holes in difference coarrays if subspace-based algorithms such as the spatial smoothing multiple signal classification (MUSIC) algorithm are utilized. To address this issue, techniques such as positive definite Toeplitz completion and array interpolation have been proposed in the literature. Another factor that compromises the accuracy of DOA estimation is the limitation of the number of snapshots. Coarray-based processing is particularly sensitive to the discrepancy between the sample covariance matrix and the ideal covariance matrix due to the finite number of snapshots. In this paper, coarray interpolation based on matrix completion (MC) followed by a denoising operation is proposed to detect more sources with a higher accuracy. The effectiveness of the proposed method is based on the capability of MC to fill in holes in the virtual sensors and that of MC denoising operation to reduce the perturbation in the sample covariance matrix. The results of numerical simulations verify the superiority of the proposed approach.

Tensor discriminant color space for face recognition.

PubMed

Wang, Su-Jing; Yang, Jian; Zhang, Na; Zhou, Chun-Guang

2011-09-01

Recent research efforts reveal that color may provide useful information for face recognition. For different visual tasks, the choice of a color space is generally different. How can a color space be sought for the specific face recognition problem? To address this problem, this paper represents a color image as a third-order tensor and presents the tensor discriminant color space (TDCS) model. The model can keep the underlying spatial structure of color images. With the definition of n-mode between-class scatter matrices and within-class scatter matrices, TDCS constructs an iterative procedure to obtain one color space transformation matrix and two discriminant projection matrices by maximizing the ratio of these two scatter matrices. The experiments are conducted on two color face databases, AR and Georgia Tech face databases, and the results show that both the performance and the efficiency of the proposed method are better than those of the state-of-the-art color image discriminant model, which involve one color space transformation matrix and one discriminant projection matrix, specifically in a complicated face database with various pose variations.

Local conservation laws in spin-\\frac{1}{2} XY chains with open boundary conditions

NASA Astrophysics Data System (ADS)

Fagotti, Maurizio

2016-06-01

We revisit the conserved quantities of the spin-\\frac{1}{2} XY model with open boundary conditions. In the absence of a transverse field, we find new families of local charges and show that half of the seeming conservation laws are conserved only if the number of sites is odd. In even chains the set of noninteracting charges is abelian, like in the periodic case when the number of sites is odd. In odd chains the set is doubled and becomes non-abelian, like in even periodic chains. The dependence of the charges on the parity of the chain’s size undermines the common belief that the thermodynamic limit of diagonal ensembles exists. We consider also the transverse-field Ising chain, where the situation is more ordinary. The generalization to the XY model in a transverse field is not straightforward and we propose a general framework to carry out similar calculations. We conjecture the form of the bulk part of the local charges and discuss the emergence of quasilocal conserved quantities. We provide evidence that in a region of the parameter space there is a reduction of the number of quasilocal conservation laws invariant under chain inversion. As a by-product, we study a class of block-Toeplitz-plus-Hankel operators and identify the conditions that their symbols satisfy in order to commute with a given block-Toeplitz.

True randomness from an incoherent source

NASA Astrophysics Data System (ADS)

Qi, Bing

2017-11-01

Quantum random number generators (QRNGs) harness the intrinsic randomness in measurement processes: the measurement outputs are truly random, given the input state is a superposition of the eigenstates of the measurement operators. In the case of trusted devices, true randomness could be generated from a mixed state ρ so long as the system entangled with ρ is well protected. We propose a random number generation scheme based on measuring the quadrature fluctuations of a single mode thermal state using an optical homodyne detector. By mixing the output of a broadband amplified spontaneous emission (ASE) source with a single mode local oscillator (LO) at a beam splitter and performing differential photo-detection, we can selectively detect the quadrature fluctuation of a single mode output of the ASE source, thanks to the filtering function of the LO. Experimentally, a quadrature variance about three orders of magnitude larger than the vacuum noise has been observed, suggesting this scheme can tolerate much higher detector noise in comparison with QRNGs based on measuring the vacuum noise. The high quality of this entropy source is evidenced by the small correlation coefficients of the acquired data. A Toeplitz-hashing extractor is applied to generate unbiased random bits from the Gaussian distributed raw data, achieving an efficiency of 5.12 bits per sample. The output of the Toeplitz extractor successfully passes all the NIST statistical tests for random numbers.

An algebraic equation solution process formulated in anticipation of banded linear equations.

DOT National Transportation Integrated Search

1971-01-01

A general method for the solution of large, sparsely banded, positive-definite, coefficient matrices is presented. The goal in developing the method was to produce an efficient and reliable solution process and to provide the user-programmer with a p...

A transfer matrix approach to vibration localization in mistuned blade assemblies

NASA Technical Reports Server (NTRS)

Ottarson, Gisli; Pierre, Chritophe

1993-01-01

A study of mode localization in mistuned bladed disks is performed using transfer matrices. The transfer matrix approach yields the free response of a general, mono-coupled, perfectly cyclic assembly in closed form. A mistuned structure is represented by random transfer matrices, and the expansion of these matrices in terms of the small mistuning parameter leads to the definition of a measure of sensitivity to mistuning. An approximation of the localization factor, the spatially averaged rate of exponential attenuation per blade-disk sector, is obtained through perturbation techniques in the limits of high and low sensitivity. The methodology is applied to a common model of a bladed disk and the results verified by Monte Carlo simulations. The easily calculated sensitivity measure may prove to be a valuable design tool due to its system-independent quantification of mistuning effects such as mode localization.

Generalized Eigenvalues for pairs on heritian matrices

NASA Technical Reports Server (NTRS)

Rublein, George

1988-01-01

A study was made of certain special cases of a generalized eigenvalue problem. Let A and B be nxn matrics. One may construct a certain polynomial, P(A,B, lambda) which specializes to the characteristic polynomial of B when A equals I. In particular, when B is hermitian, that characteristic polynomial, P(I,B, lambda) has real roots, and one can ask: are the roots of P(A,B, lambda) real when B is hermitian. We consider the case where A is positive definite and show that when N equals 3, the roots are indeed real. The basic tools needed in the proof are Shur's theorem on majorization for eigenvalues of hermitian matrices and the interlacing theorem for the eigenvalues of a positive definite hermitian matrix and one of its principal (n-1)x(n-1) minors. The method of proof first reduces the general problem to one where the diagonal of B has a certain structure: either diag (B) = diag (1,1,1) or diag (1,1,-1), or else the 2 x 2 principal minors of B are all 1. According as B has one of these three structures, we use an appropriate method to replace A by a positive diagonal matrix. Since it can be easily verified that P(D,B, lambda) has real roots, the result follows. For other configurations of B, a scaling and a continuity argument are used to prove the result in general.

Recursive partitioned inversion of large (1500 x 1500) symmetric matrices

NASA Technical Reports Server (NTRS)

Putney, B. H.; Brownd, J. E.; Gomez, R. A.

1976-01-01

A recursive algorithm was designed to invert large, dense, symmetric, positive definite matrices using small amounts of computer core, i.e., a small fraction of the core needed to store the complete matrix. The described algorithm is a generalized Gaussian elimination technique. Other algorithms are also discussed for the Cholesky decomposition and step inversion techniques. The purpose of the inversion algorithm is to solve large linear systems of normal equations generated by working geodetic problems. The algorithm was incorporated into a computer program called SOLVE. In the past the SOLVE program has been used in obtaining solutions published as the Goddard earth models.

Multivariate statistics of the Jacobian matrices in tensor based morphometry and their application to HIV/AIDS.

PubMed

Lepore, Natasha; Brun, Caroline A; Chiang, Ming-Chang; Chou, Yi-Yu; Dutton, Rebecca A; Hayashi, Kiralee M; Lopez, Oscar L; Aizenstein, Howard J; Toga, Arthur W; Becker, James T; Thompson, Paul M

2006-01-01

Tensor-based morphometry (TBM) is widely used in computational anatomy as a means to understand shape variation between structural brain images. A 3D nonlinear registration technique is typically used to align all brain images to a common neuroanatomical template, and the deformation fields are analyzed statistically to identify group differences in anatomy. However, the differences are usually computed solely from the determinants of the Jacobian matrices that are associated with the deformation fields computed by the registration procedure. Thus, much of the information contained within those matrices gets thrown out in the process. Only the magnitude of the expansions or contractions is examined, while the anisotropy and directional components of the changes are ignored. Here we remedy this problem by computing multivariate shape change statistics using the strain matrices. As the latter do not form a vector space, means and covariances are computed on the manifold of positive-definite matrices to which they belong. We study the brain morphology of 26 HIV/AIDS patients and 14 matched healthy control subjects using our method. The images are registered using a high-dimensional 3D fluid registration algorithm, which optimizes the Jensen-Rényi divergence, an information-theoretic measure of image correspondence. The anisotropy of the deformation is then computed. We apply a manifold version of Hotelling's T2 test to the strain matrices. Our results complement those found from the determinants of the Jacobians alone and provide greater power in detecting group differences in brain structure.

Interpolation algorithm for asynchronous ADC-data

NASA Astrophysics Data System (ADS)

Bramburger, Stefan; Zinke, Benny; Killat, Dirk

2017-09-01

This paper presents a modified interpolation algorithm for signals with variable data rate from asynchronous ADCs. The Adaptive weights Conjugate gradient Toeplitz matrix (ACT) algorithm is extended to operate with a continuous data stream. An additional preprocessing of data with constant and linear sections and a weighted overlap of step-by-step into spectral domain transformed signals improve the reconstruction of the asycnhronous ADC signal. The interpolation method can be used if asynchronous ADC data is fed into synchronous digital signal processing.

Topology-preserving quantum deformation with non-numerical parameter

NASA Astrophysics Data System (ADS)

Aukhadiev, Marat; Grigoryan, Suren; Lipacheva, Ekaterina

2013-11-01

We introduce a class of compact quantum semigroups, that we call semigroup deformations of compact Abelian qroups. These objects arise from reduced semigroup -algebras, the generalization of the Toeplitz algebra. We study quantum subgroups, quantum projective spaces and quantum quotient groups for such objects, and show that the group is contained as a compact quantum subgroup in the deformation of itself. The connection with the weak Hopf algebra notion is described. We give a grading on the -algebra of the compact quantum semigroups constructed.

Convexity Conditions and the Legendre-Fenchel Transform for the Product of Finitely Many Positive Definite Quadratic Forms

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhao Yunbin, E-mail: zhaoyy@maths.bham.ac.u

2010-12-15

While the product of finitely many convex functions has been investigated in the field of global optimization, some fundamental issues such as the convexity condition and the Legendre-Fenchel transform for the product function remain unresolved. Focusing on quadratic forms, this paper is aimed at addressing the question: When is the product of finitely many positive definite quadratic forms convex, and what is the Legendre-Fenchel transform for it? First, we show that the convexity of the product is determined intrinsically by the condition number of so-called 'scaled matrices' associated with quadratic forms involved. The main result claims that if the conditionmore » number of these scaled matrices are bounded above by an explicit constant (which depends only on the number of quadratic forms involved), then the product function is convex. Second, we prove that the Legendre-Fenchel transform for the product of positive definite quadratic forms can be expressed, and the computation of the transform amounts to finding the solution to a system of equations (or equally, finding a Brouwer's fixed point of a mapping) with a special structure. Thus, a broader question than the open 'Question 11' in Hiriart-Urruty (SIAM Rev. 49, 225-273, 2007) is addressed in this paper.« less

ASSESSMENT OF A SEQUENTIAL EXTRACTION PROCEDURE FOR PERTURBED LEAD-CONTAMINATED SAMPLES WITH AND WITHOUT PHOSPHOROUS AMENDMENTS

EPA Science Inventory

Sequential extraction procedures are used to determine the solid-phase association in which elements of interest exist in soil and sediment matrices. Foundational work by Tessier et al. (1) has found widespread acceptance and has worked tolerably as an operational definition for...

A Model for Math Modeling

ERIC Educational Resources Information Center

Lin, Tony; Erfan, Sasan

2016-01-01

Mathematical modeling is an open-ended research subject where no definite answers exist for any problem. Math modeling enables thinking outside the box to connect different fields of studies together including statistics, algebra, calculus, matrices, programming and scientific writing. As an integral part of society, it is the foundation for many…

A Geometrical Framework for Covariance Matrices of Continuous and Categorical Variables

ERIC Educational Resources Information Center

Vernizzi, Graziano; Nakai, Miki

2015-01-01

It is well known that a categorical random variable can be represented geometrically by a simplex. Accordingly, several measures of association between categorical variables have been proposed and discussed in the literature. Moreover, the standard definitions of covariance and correlation coefficient for continuous random variables have been…

Degree of coherence for vectorial electromagnetic fields as the distance between correlation matrices.

PubMed

Luis, Alfredo

2007-04-01

We assess the degree of coherence of vectorial electromagnetic fields in the space-frequency domain as the distance between the cross-spectral density matrix and the identity matrix representing completely incoherent light. This definition is compared with previous approaches. It is shown that this distance provides an upper bound for the degree of coherence and visibility for any pair of scalar waves obtained by linear combinations of the original fields. This same approach emerges when applying a previous definition of global coherence to a Young interferometer.

Sparse Covariance Matrix Estimation With Eigenvalue Constraints

PubMed Central

LIU, Han; WANG, Lie; ZHAO, Tuo

2014-01-01

We propose a new approach for estimating high-dimensional, positive-definite covariance matrices. Our method extends the generalized thresholding operator by adding an explicit eigenvalue constraint. The estimated covariance matrix simultaneously achieves sparsity and positive definiteness. The estimator is rate optimal in the minimax sense and we develop an efficient iterative soft-thresholding and projection algorithm based on the alternating direction method of multipliers. Empirically, we conduct thorough numerical experiments on simulated datasets as well as real data examples to illustrate the usefulness of our method. Supplementary materials for the article are available online. PMID:25620866

Toeplitz Inverse Covariance-Based Clustering of Multivariate Time Series Data

PubMed Central

Hallac, David; Vare, Sagar; Boyd, Stephen; Leskovec, Jure

2018-01-01

Subsequence clustering of multivariate time series is a useful tool for discovering repeated patterns in temporal data. Once these patterns have been discovered, seemingly complicated datasets can be interpreted as a temporal sequence of only a small number of states, or clusters. For example, raw sensor data from a fitness-tracking application can be expressed as a timeline of a select few actions (i.e., walking, sitting, running). However, discovering these patterns is challenging because it requires simultaneous segmentation and clustering of the time series. Furthermore, interpreting the resulting clusters is difficult, especially when the data is high-dimensional. Here we propose a new method of model-based clustering, which we call Toeplitz Inverse Covariance-based Clustering (TICC). Each cluster in the TICC method is defined by a correlation network, or Markov random field (MRF), characterizing the interdependencies between different observations in a typical subsequence of that cluster. Based on this graphical representation, TICC simultaneously segments and clusters the time series data. We solve the TICC problem through alternating minimization, using a variation of the expectation maximization (EM) algorithm. We derive closed-form solutions to efficiently solve the two resulting subproblems in a scalable way, through dynamic programming and the alternating direction method of multipliers (ADMM), respectively. We validate our approach by comparing TICC to several state-of-the-art baselines in a series of synthetic experiments, and we then demonstrate on an automobile sensor dataset how TICC can be used to learn interpretable clusters in real-world scenarios. PMID:29770257

A canonical form of the equation of motion of linear dynamical systems

NASA Astrophysics Data System (ADS)

Kawano, Daniel T.; Salsa, Rubens Goncalves; Ma, Fai; Morzfeld, Matthias

2018-03-01

The equation of motion of a discrete linear system has the form of a second-order ordinary differential equation with three real and square coefficient matrices. It is shown that, for almost all linear systems, such an equation can always be converted by an invertible transformation into a canonical form specified by two diagonal coefficient matrices associated with the generalized acceleration and displacement. This canonical form of the equation of motion is unique up to an equivalence class for non-defective systems. As an important by-product, a damped linear system that possesses three symmetric and positive definite coefficients can always be recast as an undamped and decoupled system.

Circulant Matrices and Affine Equivalence of Monomial Rotation Symmetric Boolean Functions

DTIC Science & Technology

2015-01-01

definitions , including monomial rotation symmetric (MRS) Boolean functions and affine equivalence, and a known result for such quadratic functions...degree of the MRS is, we have a similar result as [40, Theorem 1.1] for n = 4p (p prime), or squarefree integers n, which along with our Theorem 5.2

An improved method to quantitate mature plant microRNA in biological matrices using periodate treatment and internal control

USDA-ARS?s Scientific Manuscript database

MicroRNAs (miRNAs) ubiquitously exist in microorganisms, plants and animals, and appear to modulate a wide range of critical biological processes. However, no definitive conclusion has been reached regarding the uptake of exogenous dietary small RNAs into mammalian circulation and organs and cross-k...

Nodal distances for rooted phylogenetic trees.

PubMed

Cardona, Gabriel; Llabrés, Mercè; Rosselló, Francesc; Valiente, Gabriel

2010-08-01

Dissimilarity measures for (possibly weighted) phylogenetic trees based on the comparison of their vectors of path lengths between pairs of taxa, have been present in the systematics literature since the early seventies. For rooted phylogenetic trees, however, these vectors can only separate non-weighted binary trees, and therefore these dissimilarity measures are metrics only on this class of rooted phylogenetic trees. In this paper we overcome this problem, by splitting in a suitable way each path length between two taxa into two lengths. We prove that the resulting splitted path lengths matrices single out arbitrary rooted phylogenetic trees with nested taxa and arcs weighted in the set of positive real numbers. This allows the definition of metrics on this general class of rooted phylogenetic trees by comparing these matrices through metrics in spaces M(n)(R) of real-valued n x n matrices. We conclude this paper by establishing some basic facts about the metrics for non-weighted phylogenetic trees defined in this way using L(p) metrics on M(n)(R), with p [epsilon] R(>0).

A new DOD and DOA estimation method for MIMO radar

NASA Astrophysics Data System (ADS)

Gong, Jian; Lou, Shuntian; Guo, Yiduo

2018-04-01

The battlefield electromagnetic environment is becoming more and more complex, and MIMO radar will inevitably be affected by coherent and non-stationary noise. To solve this problem, an angle estimation method based on oblique projection operator and Teoplitz matrix reconstruction is proposed. Through the reconstruction of Toeplitz, nonstationary noise is transformed into Gauss white noise, and then the oblique projection operator is used to separate independent and correlated sources. Finally, simulations are carried out to verify the performance of the proposed algorithm in terms of angle estimation performance and source overload.

Vibration analyses of an inclined flat plate subjected to moving loads

NASA Astrophysics Data System (ADS)

Wu, Jia-Jang

2007-01-01

The object of this paper is to present a moving mass element so that one may easily perform the dynamic analysis of an inclined plate subjected to moving loads with the effects of inertia force, Coriolis force and centrifugal force considered. To this end, the mass, damping and stiffness matrices of the moving mass element, with respect to the local coordinate system, are derived first by using the principle of superposition and the definition of shape functions. Next, the last property matrices of the moving mass element are transformed into the global coordinate system and combined with the property matrices of the inclined plate itself to determine the effective overall property matrices and the instantaneous equations of motion of the entire vibrating system. Because the property matrices of the moving mass element have something to do with the instantaneous position of the moving load, both the property matrices of the moving mass element and the effective overall ones of the entire vibrating system are time-dependent. At any instant of time, solving the instantaneous equations of motion yields the instantaneous dynamic responses of the inclined plate. For validation, the presented technique is used to determine the dynamic responses of a horizontal pinned-pinned plate subjected to a moving load and a satisfactory agreement with the existing literature is achieved. Furthermore, extensive studies on the inclined plate subjected to moving loads reveal that the influences of moving-load speed, inclined angle of the plate and total number of the moving loads on the dynamic responses of the inclined plate are significant in most cases, and the effects of Coriolis force and centrifugal force are perceptible only in the case of higher moving-load speed.

A Theorem on the Rank of a Product of Matrices with Illustration of Its Use in Goodness of Fit Testing.

PubMed

Satorra, Albert; Neudecker, Heinz

2015-12-01

This paper develops a theorem that facilitates computing the degrees of freedom of Wald-type chi-square tests for moment restrictions when there is rank deficiency of key matrices involved in the definition of the test. An if and only if (iff) condition is developed for a simple rule of difference of ranks to be used when computing the desired degrees of freedom of the test. The theorem is developed exploiting basics tools of matrix algebra. The theorem is shown to play a key role in proving the asymptotic chi-squaredness of a goodness of fit test in moment structure analysis, and in finding the degrees of freedom of this chi-square statistic.

A linear quadratic regulator approach to the stabilization of uncertain linear systems

NASA Technical Reports Server (NTRS)

Shieh, L. S.; Sunkel, J. W.; Wang, Y. J.

1990-01-01

This paper presents a linear quadratic regulator approach to the stabilization of uncertain linear systems. The uncertain systems under consideration are described by state equations with the presence of time-varying unknown-but-bounded uncertainty matrices. The method is based on linear quadratic regulator (LQR) theory and Liapunov stability theory. The robust stabilizing control law for a given uncertain system can be easily constructed from the symmetric positive-definite solution of the associated augmented Riccati equation. The proposed approach can be applied to matched and/or mismatched systems with uncertainty matrices in which only their matrix norms are bounded by some prescribed values and/or their entries are bounded by some prescribed constraint sets. Several numerical examples are presented to illustrate the results.

Design of dissipative low-authority controllers using an eigensystem assignment technique

NASA Technical Reports Server (NTRS)

Maghami, P. G.; Gupta, S.; Joshi, S. M.

1992-01-01

A novel method for the design of dissipative, low-authority controllers has been developed. The method uses a sequential approach along with eigensystem assignment to compute rate and position gain matrices that assign a number of closed-loop poles of the system to desired locations. Because the feedback gain matrices are symmetric and nonnegative definite, the closed-loop stability is always guaranteed regardless of the model order or parameter inaccuracies. The resulting (nominal) closed-loop system can have specified damping ratios for m modes, which makes the plant amenable to high-authority controller design, using methods such as LQG/LTR or H-infinity. A numerical example is worked out for a flexible structure in order to demonstrate the proposed technique.

Maximum Entropy/Optimal Projection Design Synthesis for Decentralized Control of Large Space Structures

DTIC Science & Technology

1988-05-01

M 21 M2 I SI M1l[11 II1211 - - - M= II 2+111 I11-211 NONNEGATIVE CONE ORDERING Figure 25. The Matrix Majorant Is a Bound for the Hatrix Block Norm...the with respect to the cone of nonnegative -definite matrices. inequality (1.5) by the r x r nonnegative matrix equation Indeed, the majorant bound...t) eA-) e ea ’ A rT(" 3 ds, t> O , ju E [0 , 1] 0 J(G, )= tr (0,(6)R,) which is monotonically increasing in the nonnegative -definite G , cone with

Communication requirements of sparse Cholesky factorization with nested dissection ordering

NASA Technical Reports Server (NTRS)

Naik, Vijay K.; Patrick, Merrell L.

1989-01-01

Load distribution schemes for minimizing the communication requirements of the Cholesky factorization of dense and sparse, symmetric, positive definite matrices on multiprocessor systems are presented. The total data traffic in factoring an n x n sparse symmetric positive definite matrix representing an n-vertex regular two-dimensional grid graph using n exp alpha, alpha not greater than 1, processors are shown to be O(n exp 1 + alpha/2). It is O(n), when n exp alpha, alpha not smaller than 1, processors are used. Under the conditions of uniform load distribution, these results are shown to be asymptotically optimal.

On substructuring algorithms and solution techniques for the numerical approximation of partial differential equations

NASA Technical Reports Server (NTRS)

Gunzburger, M. D.; Nicolaides, R. A.

1986-01-01

Substructuring methods are in common use in mechanics problems where typically the associated linear systems of algebraic equations are positive definite. Here these methods are extended to problems which lead to nonpositive definite, nonsymmetric matrices. The extension is based on an algorithm which carries out the block Gauss elimination procedure without the need for interchanges even when a pivot matrix is singular. Examples are provided wherein the method is used in connection with finite element solutions of the stationary Stokes equations and the Helmholtz equation, and dual methods for second-order elliptic equations.

On the cross-stream spectral method for the Orr-Sommerfeld equation

NASA Technical Reports Server (NTRS)

Zorumski, William E.; Hodge, Steven L.

1993-01-01

Cross-stream models are defined as solutions to the Orr-Sommerfeld equation which are propagating normal to the flow direction. These models are utilized as a basis for a Hilbert space to approximate the spectrum of the Orr-Sommerfeld equation with plane Poiseuille flow. The cross-stream basis leads to a standard eigenvalue problem for the frequencies of Poiseuille flow instability waves. The coefficient matrix in the eigenvalue problem is shown to be the sum of a real matrix and a negative-imaginary diagonal matrix which represents the frequencies of the cross-stream modes. The real coefficient matrix is shown to approach a Toeplitz matrix when the row and column indices are large. The Toeplitz matrix is diagonally dominant, and the diagonal elements vary inversely in magnitude with diagonal position. The Poiseuille flow eigenvalues are shown to lie within Gersgorin disks with radii bounded by the product of the average flow speed and the axial wavenumber. It is shown that the eigenvalues approach the Gersgorin disk centers when the mode index is large, so that the method may be used to compute spectra with an essentially unlimited number of elements. When the mode index is large, the real part of the eigenvalue is the product of the axial wavenumber and the average flow speed, and the imaginary part of the eigen value is identical to the corresponding cross-stream mode frequency. The cross-stream method is numerically well-conditioned in comparison to Chebyshev based methods, providing equivalent accuracy for small mode indices and superior accuracy for large indices.

Relating FIA data to habitat classifications via tree-based models of canopy cover

Treesearch

Mark D. Nelson; Brian G. Tavernia; Chris Toney; Brian F. Walters

2012-01-01

Wildlife species-habitat matrices are used to relate lists of species with abundance of their habitats. The Forest Inventory and Analysis Program provides data on forest composition and structure, but these attributes may not correspond directly with definitions of wildlife habitats. We used FIA tree data and tree crown diameter models to estimate canopy cover, from...

The tensor distribution function.

PubMed

Leow, A D; Zhu, S; Zhan, L; McMahon, K; de Zubicaray, G I; Meredith, M; Wright, M J; Toga, A W; Thompson, P M

2009-01-01

Diffusion weighted magnetic resonance imaging is a powerful tool that can be employed to study white matter microstructure by examining the 3D displacement profile of water molecules in brain tissue. By applying diffusion-sensitized gradients along a minimum of six directions, second-order tensors (represented by three-by-three positive definite matrices) can be computed to model dominant diffusion processes. However, conventional DTI is not sufficient to resolve more complicated white matter configurations, e.g., crossing fiber tracts. Recently, a number of high-angular resolution schemes with more than six gradient directions have been employed to address this issue. In this article, we introduce the tensor distribution function (TDF), a probability function defined on the space of symmetric positive definite matrices. Using the calculus of variations, we solve the TDF that optimally describes the observed data. Here, fiber crossing is modeled as an ensemble of Gaussian diffusion processes with weights specified by the TDF. Once this optimal TDF is determined, the orientation distribution function (ODF) can easily be computed by analytic integration of the resulting displacement probability function. Moreover, a tensor orientation distribution function (TOD) may also be derived from the TDF, allowing for the estimation of principal fiber directions and their corresponding eigenvalues.

Dynamics of Quantum Causal Structures

NASA Astrophysics Data System (ADS)

Castro-Ruiz, Esteban; Giacomini, Flaminia; Brukner, Časlav

2018-01-01

It was recently suggested that causal structures are both dynamical, because of general relativity, and indefinite, because of quantum theory. The process matrix formalism furnishes a framework for quantum mechanics on indefinite causal structures, where the order between operations of local laboratories is not definite (e.g., one cannot say whether operation in laboratory A occurs before or after operation in laboratory B ). Here, we develop a framework for "dynamics of causal structures," i.e., for transformations of process matrices into process matrices. We show that, under continuous and reversible transformations, the causal order between operations is always preserved. However, the causal order between a subset of operations can be changed under continuous yet nonreversible transformations. An explicit example is that of the quantum switch, where a party in the past affects the causal order of operations of future parties, leading to a transition from a channel from A to B , via superposition of causal orders, to a channel from B to A . We generalize our framework to construct a hierarchy of quantum maps based on transformations of process matrices and transformations thereof.

On the role of dimensionality and sample size for unstructured and structured covariance matrix estimation

NASA Technical Reports Server (NTRS)

Morgera, S. D.; Cooper, D. B.

1976-01-01

The experimental observation that a surprisingly small sample size vis-a-vis dimension is needed to achieve good signal-to-interference ratio (SIR) performance with an adaptive predetection filter is explained. The adaptive filter requires estimates as obtained by a recursive stochastic algorithm of the inverse of the filter input data covariance matrix. The SIR performance with sample size is compared for the situations where the covariance matrix estimates are of unstructured (generalized) form and of structured (finite Toeplitz) form; the latter case is consistent with weak stationarity of the input data stochastic process.

Applications and accuracy of the parallel diagonal dominant algorithm

NASA Technical Reports Server (NTRS)

Sun, Xian-He

1993-01-01

The Parallel Diagonal Dominant (PDD) algorithm is a highly efficient, ideally scalable tridiagonal solver. In this paper, a detailed study of the PDD algorithm is given. First the PDD algorithm is introduced. Then the algorithm is extended to solve periodic tridiagonal systems. A variant, the reduced PDD algorithm, is also proposed. Accuracy analysis is provided for a class of tridiagonal systems, the symmetric, and anti-symmetric Toeplitz tridiagonal systems. Implementation results show that the analysis gives a good bound on the relative error, and the algorithm is a good candidate for the emerging massively parallel machines.

A Fast parallel tridiagonal algorithm for a class of CFD applications

NASA Technical Reports Server (NTRS)

Moitra, Stuti; Sun, Xian-He

1996-01-01

The parallel diagonal dominant (PDD) algorithm is an efficient tridiagonal solver. This paper presents for study a variation of the PDD algorithm, the reduced PDD algorithm. The new algorithm maintains the minimum communication provided by the PDD algorithm, but has a reduced operation count. The PDD algorithm also has a smaller operation count than the conventional sequential algorithm for many applications. Accuracy analysis is provided for the reduced PDD algorithm for symmetric Toeplitz tridiagonal (STT) systems. Implementation results on Langley's Intel Paragon and IBM SP2 show that both the PDD and reduced PDD algorithms are efficient and scalable.

Eigenvalue distributions for a class of covariance matrices with application to Bienenstock-Cooper-Munro neurons under noisy conditions.

PubMed

Bazzani, Armando; Castellani, Gastone C; Cooper, Leon N

2010-05-01

We analyze the effects of noise correlations in the input to, or among, Bienenstock-Cooper-Munro neurons using the Wigner semicircular law to construct random, positive-definite symmetric correlation matrices and compute their eigenvalue distributions. In the finite dimensional case, we compare our analytic results with numerical simulations and show the effects of correlations on the lifetimes of synaptic strengths in various visual environments. These correlations can be due either to correlations in the noise from the input lateral geniculate nucleus neurons, or correlations in the variability of lateral connections in a network of neurons. In particular, we find that for fixed dimensionality, a large noise variance can give rise to long lifetimes of synaptic strengths. This may be of physiological significance.

Improved efficiency of maximum likelihood analysis of time series with temporally correlated errors

USGS Publications Warehouse

Langbein, John O.

2017-01-01

Most time series of geophysical phenomena have temporally correlated errors. From these measurements, various parameters are estimated. For instance, from geodetic measurements of positions, the rates and changes in rates are often estimated and are used to model tectonic processes. Along with the estimates of the size of the parameters, the error in these parameters needs to be assessed. If temporal correlations are not taken into account, or each observation is assumed to be independent, it is likely that any estimate of the error of these parameters will be too low and the estimated value of the parameter will be biased. Inclusion of better estimates of uncertainties is limited by several factors, including selection of the correct model for the background noise and the computational requirements to estimate the parameters of the selected noise model for cases where there are numerous observations. Here, I address the second problem of computational efficiency using maximum likelihood estimates (MLE). Most geophysical time series have background noise processes that can be represented as a combination of white and power-law noise, 1/fα">1/fα1/fα with frequency, f. With missing data, standard spectral techniques involving FFTs are not appropriate. Instead, time domain techniques involving construction and inversion of large data covariance matrices are employed. Bos et al. (J Geod, 2013. doi:10.1007/s00190-012-0605-0) demonstrate one technique that substantially increases the efficiency of the MLE methods, yet is only an approximate solution for power-law indices >1.0 since they require the data covariance matrix to be Toeplitz. That restriction can be removed by simply forming a data filter that adds noise processes rather than combining them in quadrature. Consequently, the inversion of the data covariance matrix is simplified yet provides robust results for a wider range of power-law indices.

Improved efficiency of maximum likelihood analysis of time series with temporally correlated errors

NASA Astrophysics Data System (ADS)

Langbein, John

2017-08-01

Most time series of geophysical phenomena have temporally correlated errors. From these measurements, various parameters are estimated. For instance, from geodetic measurements of positions, the rates and changes in rates are often estimated and are used to model tectonic processes. Along with the estimates of the size of the parameters, the error in these parameters needs to be assessed. If temporal correlations are not taken into account, or each observation is assumed to be independent, it is likely that any estimate of the error of these parameters will be too low and the estimated value of the parameter will be biased. Inclusion of better estimates of uncertainties is limited by several factors, including selection of the correct model for the background noise and the computational requirements to estimate the parameters of the selected noise model for cases where there are numerous observations. Here, I address the second problem of computational efficiency using maximum likelihood estimates (MLE). Most geophysical time series have background noise processes that can be represented as a combination of white and power-law noise, 1/f^{α } with frequency, f. With missing data, standard spectral techniques involving FFTs are not appropriate. Instead, time domain techniques involving construction and inversion of large data covariance matrices are employed. Bos et al. (J Geod, 2013. doi: 10.1007/s00190-012-0605-0) demonstrate one technique that substantially increases the efficiency of the MLE methods, yet is only an approximate solution for power-law indices >1.0 since they require the data covariance matrix to be Toeplitz. That restriction can be removed by simply forming a data filter that adds noise processes rather than combining them in quadrature. Consequently, the inversion of the data covariance matrix is simplified yet provides robust results for a wider range of power-law indices.

Kinematics of Laying an Automated Weapon System

DTIC Science & Technology

2017-07-19

mathematical transformation is required to move the firing solution from its reference frame to a reference frame that is meaningful to the weapon system. This...Procedures 2 Conventions and Variable Definitions 2 Rotation Matrices 5 Transformation of a Vector 5 Conversion Between Cartestian and Spherical...Coordinate Systems 6 Transformation of Earth Referenced Lay to Platform Reference Frame 6 Results and Discussions 7 Conclusions 8 Bibliography 9

Modeling of the whispering gallery mode in microdisk and microgear resonators using a Toeplitz matrix formalism for single-photon source

NASA Astrophysics Data System (ADS)

Attia, Moez; Gueddana, Amor; Chatta, Rihab; Morand, Alain

2013-09-01

The work presented in this paper develops a new formalism to design microdisks and microgears structures. The main objective is to study the optics and geometrics parameters influence on the microdisks and microgears structures resonance behavior. This study is conducted to choice a resonance structure with height quality factor Q to be associated with Quantum dot to form a single photon source. This new method aims to design resonant structures that are simpler and requires less computing performances than FDTD and Floquet Block methods. This formalism is based on simplifying Fourier transformed and using toeplitz matrix writing. This new writing allows designing all kind of resonance structures with any defect and any modification. In other study we have design a quantum dot emitting a photon at 1550 nm of the fundamental mode, but the quantum dot emits other photons at other wavelengths. The focus of the resonant structure and the quantum dot association is the resonance of the photon at 1550 nm and the elimination of all other photons with others energies. The quantum dot studied in [1] is an InAs/GaAs quantum dot, we design an GaAS microdisk and microgear and we compare the quality factor Q of this two structures and we conclude that the microgear is more appropriated to be associate to the quantum dot and increase the probability P1 to obtain a single photon source at 1550 nm and promotes the obtaining of single photon. The performance improving of the resonant structure is able to increase the success of quantum applications such as quantum gates based on single photon source.

On the rank-distance median of 3 permutations.

PubMed

Chindelevitch, Leonid; Pereira Zanetti, João Paulo; Meidanis, João

2018-05-08

Recently, Pereira Zanetti, Biller and Meidanis have proposed a new definition of a rearrangement distance between genomes. In this formulation, each genome is represented as a matrix, and the distance d is the rank distance between these matrices. Although defined in terms of matrices, the rank distance is equal to the minimum total weight of a series of weighted operations that leads from one genome to the other, including inversions, translocations, transpositions, and others. The computational complexity of the median-of-three problem according to this distance is currently unknown. The genome matrices are a special kind of permutation matrices, which we study in this paper. In their paper, the authors provide an [Formula: see text] algorithm for determining three candidate medians, prove the tight approximation ratio [Formula: see text], and provide a sufficient condition for their candidates to be true medians. They also conduct some experiments that suggest that their method is accurate on simulated and real data. In this paper, we extend their results and provide the following: Three invariants characterizing the problem of finding the median of 3 matrices A sufficient condition for uniqueness of medians that can be checked in O(n) A faster, [Formula: see text] algorithm for determining the median under this condition A new heuristic algorithm for this problem based on compressed sensing A [Formula: see text] algorithm that exactly solves the problem when the inputs are orthogonal matrices, a class that includes both permutations and genomes as special cases. Our work provides the first proof that, with respect to the rank distance, the problem of finding the median of 3 genomes, as well as the median of 3 permutations, is exactly solvable in polynomial time, a result which should be contrasted with its NP-hardness for the DCJ (double cut-and-join) distance and most other families of genome rearrangement operations. This result, backed by our experimental tests, indicates that the rank distance is a viable alternative to the DCJ distance widely used in genome comparisons.

Quantum Crystallography: Density Matrix-Density Functional Theory and the X-Ray Diffraction Experiment

NASA Astrophysics Data System (ADS)

Soirat, Arnaud J. A.

Density Matrix Theory is a Quantum Mechanical formalism in which the wavefunction is eliminated and its role taken over by reduced density matrices. The interest of this is that, it allows one, in principle, to calculate any electronic property of a physical system, without having to solve the Schrodinger equation, using only two entities much simpler than an N-body wavefunction: first and second -order reduced density matrices. In practice, though, this very promising possibility faces the tremendous theoretical problem of N-representability, which has been solved for the former, but, until now, voids any hope of theoretically determining the latter. However, it has been shown that single determinant reduced density matrices of any order may be recovered from coherent X-ray diffraction data, if one provides a proper Quantum Mechanical description of the Crystallography experiment. A deeper investigation of this method is the purpose of this work, where we, first, further study the calculation of X-ray reduced density matrices N-representable by a single Slater determinant. In this context, we independently derive necessary and sufficient conditions for the uniqueness of the method. We then show how to account for electron correlation in this model. For the first time, indeed, we derive highly accurate, yet practical, density matrices approximately N-representable by correlated-determinant wavefunctions. The interest of such a result lies in the Quantum Mechanical validity of these density matrices, their property of being entirely obtainable from X-ray coherent diffraction data, their very high accuracy conferred by this known property of the N-representing wavefunction, as well as their definition as explicit functionals of the density. All of these properties are finally used in both a theoretical and a numerical application: in the former, we show that these density matrices may be used in the context of Density Functional Theory to highly accurately determine the unknown HK functional, associated with the theorem of Hohenberg and Kohn. The latter is provided by the calculation of helium correlation energy, where we test approximating the second-order density function by the leading term of its McLaurin's series expansion.

Orbit Determination Using Vinti’s Solution

DTIC Science & Technology

2016-09-15

Surveillance Network STK Systems Tool Kit TBP Two Body Problem TLE Two-line Element Set xv Acronym Definition UKF Unscented Kalman Filter WPAFB Wright...simplicity, stability, and speed. On the other hand, Kalman filters would be best suited for sequential estimation of stochastic or random components of a...be likened to how an Unscented Kalman Filter samples a system’s nonlinearities directly, avoiding linearizing the dynamics in the partials matrices

Graph run-length matrices for histopathological image segmentation.

PubMed

Tosun, Akif Burak; Gunduz-Demir, Cigdem

2011-03-01

The histopathological examination of tissue specimens is essential for cancer diagnosis and grading. However, this examination is subject to a considerable amount of observer variability as it mainly relies on visual interpretation of pathologists. To alleviate this problem, it is very important to develop computational quantitative tools, for which image segmentation constitutes the core step. In this paper, we introduce an effective and robust algorithm for the segmentation of histopathological tissue images. This algorithm incorporates the background knowledge of the tissue organization into segmentation. For this purpose, it quantifies spatial relations of cytological tissue components by constructing a graph and uses this graph to define new texture features for image segmentation. This new texture definition makes use of the idea of gray-level run-length matrices. However, it considers the runs of cytological components on a graph to form a matrix, instead of considering the runs of pixel intensities. Working with colon tissue images, our experiments demonstrate that the texture features extracted from "graph run-length matrices" lead to high segmentation accuracies, also providing a reasonable number of segmented regions. Compared with four other segmentation algorithms, the results show that the proposed algorithm is more effective in histopathological image segmentation.

Random matrix theory of singular values of rectangular complex matrices I: Exact formula of one-body distribution function in fixed-trace ensemble

DOE Office of Scientific and Technical Information (OSTI.GOV)

Adachi, Satoshi; Toda, Mikito; Kubotani, Hiroto

The fixed-trace ensemble of random complex matrices is the fundamental model that excellently describes the entanglement in the quantum states realized in a coupled system by its strongly chaotic dynamical evolution [see H. Kubotani, S. Adachi, M. Toda, Phys. Rev. Lett. 100 (2008) 240501]. The fixed-trace ensemble fully takes into account the conservation of probability for quantum states. The present paper derives for the first time the exact analytical formula of the one-body distribution function of singular values of random complex matrices in the fixed-trace ensemble. The distribution function of singular values (i.e. Schmidt eigenvalues) of a quantum state ismore » so important since it describes characteristics of the entanglement in the state. The derivation of the exact analytical formula utilizes two recent achievements in mathematics, which appeared in 1990s. The first is the Kaneko theory that extends the famous Selberg integral by inserting a hypergeometric type weight factor into the integrand to obtain an analytical formula for the extended integral. The second is the Petkovsek-Wilf-Zeilberger theory that calculates definite hypergeometric sums in a closed form.« less

Quantum Matching Theory (with new complexity-theoretic, combinatorial and topical insights on the nature of the quantum entanglement)

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gurvits, L.

2002-01-01

Classical matching theory can be defined in terms of matrices with nonnegative entries. The notion of Positive operator, central in Quantum Theory, is a natural generalization of matrices with non-negative entries. Based on this point of view, we introduce a definition of perfect Quantum (operator) matching. We show that the new notion inherits many 'classical' properties, but not all of them. This new notion goes somewhere beyound matroids. For separable bipartite quantum states this new notion coinsides with the full rank property of the intersection of two corresponding geometric matroids. In the classical situation, permanents are naturally associated with perfectsmore » matchings. We introduce an analog of permanents for positive operators, called Quantum Permanent and show how this generalization of the permanent is related to the Quantum Entanglement. Besides many other things, Quantum Permanents provide new rational inequalities necessary for the separability of bipartite quantum states. Using Quantum Permanents, we give deterministic poly-time algorithm to solve Hidden Matroids Intersection Problem and indicate some 'classical' complexity difficulties associated with the Quantum Entanglement. Finally, we prove that the weak membership problem for the convex set of separable bipartite density matrices is NP-HARD.« less

A generalized leaky FxLMS algorithm for tuning the waterbed effect of feedback active noise control systems

NASA Astrophysics Data System (ADS)

Wu, Lifu; Qiu, Xiaojun; Guo, Yecai

2018-06-01

To tune the noise amplification in the feedback system caused by the waterbed effect effectively, an adaptive algorithm is proposed in this paper by replacing the scalar leaky factor of the leaky FxLMS algorithm with a real symmetric Toeplitz matrix. The elements in the matrix are calculated explicitly according to the noise amplification constraints, which are defined based on a simple but efficient method. Simulations in an ANC headphone application demonstrate that the proposed algorithm can adjust the frequency band of noise amplification more effectively than the FxLMS algorithm and the leaky FxLMS algorithm.

Entanglement entropy in the long-range Kitaev chain

NASA Astrophysics Data System (ADS)

Ares, Filiberto; Esteve, José G.; Falceto, Fernando; de Queiroz, Amilcar R.

2018-06-01

In this paper we complete the study on the asymptotic behavior of the entanglement entropy for Kitaev chains with long-range pairing. We discover that when the couplings decay with the distance with a critical exponent new properties for the asymptotic growth of the entropy appear. The coefficient of the leading term is not universal any more and the connection with conformal field theories is lost. We perform a numerical and analytical approach to the problem showing a perfect agreement. In order to carry out the analytical study, a technique for computing the asymptotic behavior of block Toeplitz determinants with discontinuous symbols has been developed.

A progress report on estuary modeling by the finite-element method

USGS Publications Warehouse

Gray, William G.

1978-01-01

Various schemes are investigated for finite-element modeling of two-dimensional surface-water flows. The first schemes investigated combine finite-element spatial discretization with split-step time stepping schemes that have been found useful in finite-difference computations. Because of the large number of numerical integrations performed in space and the large sparse matrices solved, these finite-element schemes were found to be economically uncompetitive with finite-difference schemes. A very promising leapfrog scheme is proposed which, when combined with a novel very fast spatial integration procedure, eliminates the need to solve any matrices at all. Additional problems attacked included proper propagation of waves and proper specification of the normal flow-boundary condition. This report indicates work in progress and does not come to a definitive conclusion as to the best approach for finite-element modeling of surface-water problems. The results presented represent findings obtained between September 1973 and July 1976. (Woodard-USGS)

Realization of allowable qeneralized quantum gates

NASA Astrophysics Data System (ADS)

Zhang, Ye; Cao, Huaixin; Li, Li

2010-10-01

The most general duality gates were introduced by Long, Liu and Wang and named allowable generalized quantum gates (AGQGs, for short). By definition, an allowable generalized quantum gate has the form of mathcal{U} = ∑{/k=0 d-1} c k U k , where U k ’s are unitary operators on a Hilbert space H and the coefficients c k ’s are complex numbers with |∑{/k=0 d-1} c k | ⩽ 1 and | c k | ⩽ 1 for all k = 0, 1, ..., d - 1. In this paper, we prove that an AGQG mathcal{U} = ∑{/k=0 d-1} c k U k is realizable, i.e. there are two d by d unitary matrices W and V such that c k = W 0 k V k0 (0 ⩽ k ⩽ d - 1) if and only if ∑{/k=0 d-1} | c k | ⩽ 1, in that case, the matrices W and V are constructed.

Design of polynomial fuzzy observer-controller for nonlinear systems with state delay: sum of squares approach

NASA Astrophysics Data System (ADS)

Gassara, H.; El Hajjaji, A.; Chaabane, M.

2017-07-01

This paper investigates the problem of observer-based control for two classes of polynomial fuzzy systems with time-varying delay. The first class concerns a special case where the polynomial matrices do not depend on the estimated state variables. The second one is the general case where the polynomial matrices could depend on unmeasurable system states that will be estimated. For the last case, two design procedures are proposed. The first one gives the polynomial fuzzy controller and observer gains in two steps. In the second procedure, the designed gains are obtained using a single-step approach to overcome the drawback of a two-step procedure. The obtained conditions are presented in terms of sum of squares (SOS) which can be solved via the SOSTOOLS and a semi-definite program solver. Illustrative examples show the validity and applicability of the proposed results.

A special form of SPD covariance matrix for interpretation and visualization of data manipulated with Riemannian geometry

NASA Astrophysics Data System (ADS)

Congedo, Marco; Barachant, Alexandre

2015-01-01

Currently the Riemannian geometry of symmetric positive definite (SPD) matrices is gaining momentum as a powerful tool in a wide range of engineering applications such as image, radar and biomedical data signal processing. If the data is not natively represented in the form of SPD matrices, typically we may summarize them in such form by estimating covariance matrices of the data. However once we manipulate such covariance matrices on the Riemannian manifold we lose the representation in the original data space. For instance, we can evaluate the geometric mean of a set of covariance matrices, but not the geometric mean of the data generating the covariance matrices, the space of interest in which the geometric mean can be interpreted. As a consequence, Riemannian information geometry is often perceived by non-experts as a "black-box" tool and this perception prevents a wider adoption in the scientific community. Hereby we show that we can overcome this limitation by constructing a special form of SPD matrix embedding both the covariance structure of the data and the data itself. Incidentally, whenever the original data can be represented in the form of a generic data matrix (not even square), this special SPD matrix enables an exhaustive and unique description of the data up to second-order statistics. This is achieved embedding the covariance structure of both the rows and columns of the data matrix, allowing naturally a wide range of possible applications and bringing us over and above just an interpretability issue. We demonstrate the method by manipulating satellite images (pansharpening) and event-related potentials (ERPs) of an electroencephalography brain-computer interface (BCI) study. The first example illustrates the effect of moving along geodesics in the original data space and the second provides a novel estimation of ERP average (geometric mean), showing that, in contrast to the usual arithmetic mean, this estimation is robust to outliers. In conclusion, we are able to show that the Riemannian concepts of distance, geometric mean, moving along a geodesic, etc. can be readily transposed into a generic data space, whatever this data space represents.

Changing Coordinates in the Context of Orbital Mechanics

DTIC Science & Technology

2017-01-01

1] For an example of this, see P. Duffett-Smith, J. Zwart (2011), Practical Astronomy with your Calculator or Spreadsheet, 4th ed., Cambridge...does not use matrices) is O. Montenbruck, T. Pfleger, (1989), Astronomy on the Personal Computer, Springer. A readable book that also doesn’t use...modern astronomy . I have already mentioned the name “sidereal time” for angle, along with its two definitions of “hour” that are often both used in the

Design, fabrication and test of graphite/polyimide composite joints and attachments for advanced aerospace vehicles

NASA Technical Reports Server (NTRS)

Koumal, D. E.

1979-01-01

The design and evaluation of built-up attachments and bonded joint concepts for use at elevated temperatures is documented. Joint concept screening, verification of GR/PI material, fabrication of design allowables panels, definition of test matrices, and analysis of bonded and bolted joints are among the tasks completed. The results provide data for the design and fabrication of lightly loaded components for advanced space transportation systems and high speed aircraft.

N-point functions in rolling tachyon background

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jokela, Niko; Keski-Vakkuri, Esko; Department of Physics, P.O. Box 64, FIN-00014, University of Helsinki

2009-04-15

We study n-point boundary correlation functions in timelike boundary Liouville theory, relevant for open string multiproduction by a decaying unstable D brane. We give an exact result for the one-point function of the tachyon vertex operator and show that it is consistent with a previously proposed relation to a conserved charge in string theory. We also discuss when the one-point amplitude vanishes. Using a straightforward perturbative expansion, we find an explicit expression for a tachyon n-point amplitude for all n, however the result is still a toy model. The calculation uses a new asymptotic approximation for Toeplitz determinants, derived bymore » relating the system to a Dyson gas at finite temperature.« less

Toxicological importance of human biomonitoring of metallic and metalloid elements in different biological samples.

PubMed

Gil, F; Hernández, A F

2015-06-01

Human biomonitoring has become an important tool for the assessment of internal doses of metallic and metalloid elements. These elements are of great significance because of their toxic properties and wide distribution in environmental compartments. Although blood and urine are the most used and accepted matrices for human biomonitoring, other non-conventional samples (saliva, placenta, meconium, hair, nails, teeth, breast milk) may have practical advantages and would provide additional information on health risk. Nevertheless, the analysis of these compounds in biological matrices other than blood and urine has not yet been accepted as a useful tool for biomonitoring. The validation of analytical procedures is absolutely necessary for a proper implementation of non-conventional samples in biomonitoring programs. However, the lack of reliable and useful analytical methodologies to assess exposure to metallic elements, and the potential interference of external contamination and variation in biological features of non-conventional samples are important limitations for setting health-based reference values. The influence of potential confounding factors on metallic concentration should always be considered. More research is needed to ascertain whether or not non-conventional matrices offer definitive advantages over the traditional samples and to broaden the available database for establishing worldwide accepted reference values in non-exposed populations. Copyright © 2015 Elsevier Ltd. All rights reserved.

Optimum modulation and demodulation matrices for solar polarimetry.

PubMed

del Toro Iniesta, J C; Collados, M

2000-04-01

Both temporal and/or spatial modulation are mandatory in current solar polarimetry [Appl. Opt. 24, 3893 (1985); 26, 3838 (1987)]. The modulating and demodulating processes are mathematically described by matrices O and D, respectively, on whose structure the accuracy of Stokes parameter measurements depend. We demonstrate, based on the definition of polarimetric efficiency [Instituto de Astrofísica de Canarias Internal Report (1994); ASP Conf. Ser. 184, 3 (1999)], that the maximum efficiencies of an ideal polarimeter are unity for Stokes I and for (Q(2) + U(2) + V(2))(1/2) and that this occurs if and only if O(T)O is diagonal; given a general (possibly nonideal) modulation matrix O, the optimum demodulation matrix turns out to be D = (O(T)O)(-1)O(T); and the maximum efficiencies in the nonideal case are given by the rms value of the column elements of matrix O and are reached by modulation matrices such that O(T)O is diagonal. From these analytical results we distill two recipes useful in the practical design of polarimeters. Their usefulness is illustrated by discussing cases of currently available solar polarimeters. Although specifically devoted to solar polarimetry, the results here may be applied in practically all other branches of science for which polarimetric measurements are needed.

Anticipating the higher generations of quarks from rephasing invariance of the mixing matrix

NASA Astrophysics Data System (ADS)

Botella, F. J.; Chau, Ling-Lie

1986-02-01

We show that the number of invariant CP violating parameters XCP jumps from the unique universal one in three generations to nine in the four-generation case, saturating the parameter space for generation numbers higher than three. This can lead to drastically different consequences in CP-violating phenomena. We give the quark mass matrices in the three-generation case and speculate for higher generations. We also give some invariant definitions of “maximal” CP violation.

User's manual for LINEAR, a FORTRAN program to derive linear aircraft models

NASA Technical Reports Server (NTRS)

Duke, Eugene L.; Patterson, Brian P.; Antoniewicz, Robert F.

1987-01-01

This report documents a FORTRAN program that provides a powerful and flexible tool for the linearization of aircraft models. The program LINEAR numerically determines a linear system model using nonlinear equations of motion and a user-supplied nonlinear aerodynamic model. The system model determined by LINEAR consists of matrices for both state and observation equations. The program has been designed to allow easy selection and definition of the state, control, and observation variables to be used in a particular model.

On polynomial preconditioning for indefinite Hermitian matrices

NASA Technical Reports Server (NTRS)

Freund, Roland W.

1989-01-01

The minimal residual method is studied combined with polynomial preconditioning for solving large linear systems (Ax = b) with indefinite Hermitian coefficient matrices (A). The standard approach for choosing the polynomial preconditioners leads to preconditioned systems which are positive definite. Here, a different strategy is studied which leaves the preconditioned coefficient matrix indefinite. More precisely, the polynomial preconditioner is designed to cluster the positive, resp. negative eigenvalues of A around 1, resp. around some negative constant. In particular, it is shown that such indefinite polynomial preconditioners can be obtained as the optimal solutions of a certain two parameter family of Chebyshev approximation problems. Some basic results are established for these approximation problems and a Remez type algorithm is sketched for their numerical solution. The problem of selecting the parameters such that the resulting indefinite polynomial preconditioners speeds up the convergence of minimal residual method optimally is also addressed. An approach is proposed based on the concept of asymptotic convergence factors. Finally, some numerical examples of indefinite polynomial preconditioners are given.

Shape control of structures with semi-definite stiffness matrices for adaptive wings

NASA Astrophysics Data System (ADS)

Austin, Fred; Van Nostrand, William C.; Rossi, Michael J.

1993-09-01

Maintaining an optimum-wing cross section during transonic cruise can dramatically reduce the shock-induced drag and can result in significant fuel savings and increased range. Our adaptive-wing concept employs actuators as truss elements of active ribs to reshape the wing cross section by deforming the structure. In our previous work, to derive the shape control- system gain matrix, we developed a procedure that requires the inverse of the stiffness matrix of the structure without the actuators. However, this method cannot be applied to designs where the actuators are required structural elements since the stiffness matrices are singular when the actuator are removed. Consequently, a new method was developed, where the order of the problem is reduced and only the inverse of a small nonsingular partition of the stiffness matrix is required to obtain the desired gain matrix. The procedure was experimentally validated by achieving desired shapes of a physical model of an aircraft-wing rib. The theory and test results are presented.

Noncommutative reading of the complex plane through Delone sequences

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ali, S. Twareque; Balkova, Lubka; Gazeau, J. P.

2009-04-15

The Berezin-Klauder-Toeplitz ('anti-Wick') quantization or 'noncommutative reading' of the complex plane, viewed as the phase space of a particle moving on the line, is derived from the resolution of the unity provided by the standard (or Gaussian) coherent states. The construction of these states and their attractive properties are essentially based on the energy spectrum of the harmonic oscillator, that is, on the natural numbers. This work is an attempt for following the same path by considering sequences of non-negative numbers which are not 'too far' from the natural numbers. In particular, we examine the consequences of such perturbations onmore » the noncommutative reading of the complex plane in terms of its probabilistic, functional, and localization aspects.« less

Characterizing protein conformations by correlation analysis of coarse-grained contact matrices.

PubMed

Lindsay, Richard J; Siess, Jan; Lohry, David P; McGee, Trevor S; Ritchie, Jordan S; Johnson, Quentin R; Shen, Tongye

2018-01-14

We have developed a method to capture the essential conformational dynamics of folded biopolymers using statistical analysis of coarse-grained segment-segment contacts. Previously, the residue-residue contact analysis of simulation trajectories was successfully applied to the detection of conformational switching motions in biomolecular complexes. However, the application to large protein systems (larger than 1000 amino acid residues) is challenging using the description of residue contacts. Also, the residue-based method cannot be used to compare proteins with different sequences. To expand the scope of the method, we have tested several coarse-graining schemes that group a collection of consecutive residues into a segment. The definition of these segments may be derived from structural and sequence information, while the interaction strength of the coarse-grained segment-segment contacts is a function of the residue-residue contacts. We then perform covariance calculations on these coarse-grained contact matrices. We monitored how well the principal components of the contact matrices is preserved using various rendering functions. The new method was demonstrated to assist the reduction of the degrees of freedom for describing the conformation space, and it potentially allows for the analysis of a system that is approximately tenfold larger compared with the corresponding residue contact-based method. This method can also render a family of similar proteins into the same conformational space, and thus can be used to compare the structures of proteins with different sequences.

Characterizing protein conformations by correlation analysis of coarse-grained contact matrices

NASA Astrophysics Data System (ADS)

Lindsay, Richard J.; Siess, Jan; Lohry, David P.; McGee, Trevor S.; Ritchie, Jordan S.; Johnson, Quentin R.; Shen, Tongye

2018-01-01

We have developed a method to capture the essential conformational dynamics of folded biopolymers using statistical analysis of coarse-grained segment-segment contacts. Previously, the residue-residue contact analysis of simulation trajectories was successfully applied to the detection of conformational switching motions in biomolecular complexes. However, the application to large protein systems (larger than 1000 amino acid residues) is challenging using the description of residue contacts. Also, the residue-based method cannot be used to compare proteins with different sequences. To expand the scope of the method, we have tested several coarse-graining schemes that group a collection of consecutive residues into a segment. The definition of these segments may be derived from structural and sequence information, while the interaction strength of the coarse-grained segment-segment contacts is a function of the residue-residue contacts. We then perform covariance calculations on these coarse-grained contact matrices. We monitored how well the principal components of the contact matrices is preserved using various rendering functions. The new method was demonstrated to assist the reduction of the degrees of freedom for describing the conformation space, and it potentially allows for the analysis of a system that is approximately tenfold larger compared with the corresponding residue contact-based method. This method can also render a family of similar proteins into the same conformational space, and thus can be used to compare the structures of proteins with different sequences.

Multi-color incomplete Cholesky conjugate gradient methods for vector computers. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Poole, E. L.

1986-01-01

In this research, we are concerned with the solution on vector computers of linear systems of equations, Ax = b, where A is a larger, sparse symmetric positive definite matrix. We solve the system using an iterative method, the incomplete Cholesky conjugate gradient method (ICCG). We apply a multi-color strategy to obtain p-color matrices for which a block-oriented ICCG method is implemented on the CYBER 205. (A p-colored matrix is a matrix which can be partitioned into a pXp block matrix where the diagonal blocks are diagonal matrices). This algorithm, which is based on a no-fill strategy, achieves O(N/p) length vector operations in both the decomposition of A and in the forward and back solves necessary at each iteration of the method. We discuss the natural ordering of the unknowns as an ordering that minimizes the number of diagonals in the matrix and define multi-color orderings in terms of disjoint sets of the unknowns. We give necessary and sufficient conditions to determine which multi-color orderings of the unknowns correpond to p-color matrices. A performance model is given which is used both to predict execution time for ICCG methods and also to compare an ICCG method to conjugate gradient without preconditioning or another ICCG method. Results are given from runs on the CYBER 205 at NASA's Langley Research Center for four model problems.

Stabilisation of time-varying linear systems via Lyapunov differential equations

NASA Astrophysics Data System (ADS)

Zhou, Bin; Cai, Guang-Bin; Duan, Guang-Ren

2013-02-01

This article studies stabilisation problem for time-varying linear systems via state feedback. Two types of controllers are designed by utilising solutions to Lyapunov differential equations. The first type of feedback controllers involves the unique positive-definite solution to a parametric Lyapunov differential equation, which can be solved when either the state transition matrix of the open-loop system is exactly known, or the future information of the system matrices are accessible in advance. Different from the first class of controllers which may be difficult to implement in practice, the second type of controllers can be easily implemented by solving a state-dependent Lyapunov differential equation with a given positive-definite initial condition. In both cases, explicit conditions are obtained to guarantee the exponentially asymptotic stability of the associated closed-loop systems. Numerical examples show the effectiveness of the proposed approaches.

On adaptive weighted polynomial preconditioning for Hermitian positive definite matrices

NASA Technical Reports Server (NTRS)

Fischer, Bernd; Freund, Roland W.

1992-01-01

The conjugate gradient algorithm for solving Hermitian positive definite linear systems is usually combined with preconditioning in order to speed up convergence. In recent years, there has been a revival of polynomial preconditioning, motivated by the attractive features of the method on modern architectures. Standard techniques for choosing the preconditioning polynomial are based only on bounds for the extreme eigenvalues. Here a different approach is proposed, which aims at adapting the preconditioner to the eigenvalue distribution of the coefficient matrix. The technique is based on the observation that good estimates for the eigenvalue distribution can be derived after only a few steps of the Lanczos process. This information is then used to construct a weight function for a suitable Chebyshev approximation problem. The solution of this problem yields the polynomial preconditioner. In particular, we investigate the use of Bernstein-Szego weights.

Dietary fibre: The scientific search for an ideal definition and methodology of analysis, and its physiological importance as a carrier of bioactive compounds.

PubMed

Macagnan, Fernanda Teixeira; da Silva, Leila Picolli; Hecktheuer, Luisa Helena

2016-07-01

There is a growing need for a global consensus on the definition of dietary fibre and the use of appropriate methodologies for its determination in different food matrices. Oligosaccharides (prebiotic effect) and bioactive compounds (antioxidant effect) are important constituents of dietary fibre, which enhance its beneficial effects in the body, such as those related to maintaining intestinal health. These dietary components need to be quantified and addressed in conjunction with fibre in nutritional studies due to the close relationship between them and their common destiny in the human body. This review discusses updates to the concept of dietary fibre, with an emphasis on biological and methodological aspects, and highlights the physiological importance of fibre as a carrier of bioactive compounds. Copyright © 2016 Elsevier Ltd. All rights reserved.

Experimental and Calculational Studies of the Interactions of BF3 with Fluoroethers

NASA Technical Reports Server (NTRS)

Zehe, Michael J.; Morales, Wilfredo; Ball, David W.

1998-01-01

BF3 was co-condensed with (C2H5)2O, (CF3CH2)2O and (C2F5)2O in excess argon at 15 K. Infrared spectra of the matrices showed a definite Lewis acid-base interaction between BF3 and diethyl ether; a weak but definite interaction with bis(2,2,2,-trifluorodiethyl)ether, and no observable interaction with perfluorodiethyl ether. Molecular orbital (MO) calculations complemented the experimental observations by revealing that fluorine atoms on the ethers decreased electron localization about the oxygen atom. Thus, the experimental data and MO calculations indicated a clear trend between strength of interaction with BF3 and the degree of ether F substitution. The implications of the results for commercial perfluoro ether lubricant/metal oxide surface interactions are discussed.

Inherent robustness of discrete-time adaptive control systems

NASA Technical Reports Server (NTRS)

Ma, C. C. H.

1986-01-01

Global stability robustness with respect to unmodeled dynamics, arbitrary bounded internal noise, as well as external disturbance is shown to exist for a class of discrete-time adaptive control systems when the regressor vectors of these systems are persistently exciting. Although fast adaptation is definitely undesirable, so far as attaining the greatest amount of global stability robustness is concerned, slow adaptation is shown to be not necessarily beneficial. The entire analysis in this paper holds for systems with slowly varying return difference matrices; the plants in these systems need not be slowly varying.

Spectral function from Reduced Density Matrix Functional Theory

NASA Astrophysics Data System (ADS)

Romaniello, Pina; di Sabatino, Stefano; Berger, Jan A.; Reining, Lucia

2015-03-01

In this work we focus on the calculation of the spectral function, which determines, for example, photoemission spectra, from reduced density matrix functional theory. Starting from its definition in terms of the one-body Green's function we derive an expression for the spectral function that depends on the natural occupation numbers and on an effective energy which accounts for all the charged excitations. This effective energy depends on the two-body as well as higher-order density matrices. Various approximations to this expression are explored by using the exactly solvable Hubbard chains.

Recellularizing of human acellular dermal matrices imaged by high-definition optical coherence tomography.

PubMed

Boone, Marc A L M; Draye, Jean Pierre; Verween, Gunther; Aiti, Annalisa; Pirnay, Jean-Paul; Verbeken, Gilbert; De Vos, Daniel; Rose, Thomas; Jennes, Serge; Jemec, Gregor B E; Del Marmol, Veronique

2015-05-01

High-definition optical coherence tomography (HD-OCT) permits real-time 3D imaging of the impact of selected agents on human skin allografts. The real-time 3D HD-OCT assessment of (i) the impact on morphological and cellular characteristics of the processing of human acellular dermal matrices (HADMs) and (ii) repopulation of HADMs in vitro by human fibroblasts and remodelling of the extracellular matrix by these cells. Four different skin decellularization methods, Dispase II/Triton X-100, Dispase II/SDS (sodium dodecyl sulphate), NaCl/Triton X-100 and NaCl/SDS, were analysed by HD-OCT. HD-OCT features of epidermal removal, dermo-epidermal junction (DEJ) integrity, cellularity and dermal architecture were correlated with reflectance confocal microscopy (RCM), histopathology and immunohistochemistry. Human adult dermal fibroblasts were in vitro seeded on the NaCl/Triton X-100 processed HADMs, cultured up to 19 days and evaluated by HD-OCT in comparison with MTT proliferation test and histology. Epidermis was effectively removed by all treatments. DEJ was best preserved after NaCl/Triton X-100 treatment. Dispase II/SDS treatment seemed to remove all cellular debris in comparison with NaCl/Triton X-100 but disturbed the DEJ severely. The dermal micro-architectural structure and vascular spaces of (sub)papillary dermis were best preserved with the NaCl/Triton X-100. The impact on the 3D structure and vascular holes was detrimental with Dispase II/SDS. Elastic fibre fragmentation was only observed after Dispase II incubation. HD-OCT showed that NaCl/Triton X-100 processed matrices permitted in vitro repopulation by human dermal fibroblasts (confirmed by MTT test and histology) and underwent remodelling upon increasing incubation time. Care must be taken in choosing the appropriate processing steps to maintain selected properties of the extracellular matrix in HADMs. Processing HADMs with NaCl/Triton X-100 permits in vitro the proliferation and remodelling activity of human dermal fibroblasts. HD-OCT provides unique real-time and non-invasive 3D imaging of tissue-engineered skin constructs and complementary morphological and cytological information. © 2015 John Wiley & Sons A/S. Published by John Wiley & Sons Ltd.

A flexible motif search technique based on generalized profiles.

PubMed

Bucher, P; Karplus, K; Moeri, N; Hofmann, K

1996-03-01

A flexible motif search technique is presented which has two major components: (1) a generalized profile syntax serving as a motif definition language; and (2) a motif search method specifically adapted to the problem of finding multiple instances of a motif in the same sequence. The new profile structure, which is the core of the generalized profile syntax, combines the functions of a variety of motif descriptors implemented in other methods, including regular expression-like patterns, weight matrices, previously used profiles, and certain types of hidden Markov models (HMMs). The relationship between generalized profiles and other biomolecular motif descriptors is analyzed in detail, with special attention to HMMs. Generalized profiles are shown to be equivalent to a particular class of HMMs, and conversion procedures in both directions are given. The conversion procedures provide an interpretation for local alignment in the framework of stochastic models, allowing for clear, simple significance tests. A mathematical statement of the motif search problem defines the new method exactly without linking it to a specific algorithmic solution. Part of the definition includes a new definition of disjointness of alignments.

Rigorous proof for the nonlocal correlation function in the transverse Ising model with ring frustration.

PubMed

Dong, Jian-Jun; Zheng, Zhen-Yu; Li, Peng

2018-01-01

An unusual correlation function was conjectured by Campostrini et al. [Phys. Rev. E 91, 042123 (2015)PLEEE81539-375510.1103/PhysRevE.91.042123] for the ground state of a transverse Ising chain with geometrical frustration. Later, we provided a rigorous proof for it and demonstrated its nonlocal nature based on an evaluation of a Toeplitz determinant in the thermodynamic limit [J. Stat. Mech. (2016) 11310210.1088/1742-5468/2016/11/113102]. In this paper, we further prove that all the low excited energy states forming the gapless kink phase share the same asymptotic correlation function with the ground state. As a consequence, the thermal correlation function almost remains constant at low temperatures if one assumes a canonical ensemble.

The range and valence of a real Smirnov function

NASA Astrophysics Data System (ADS)

Ferguson, Timothy; Ross, William T.

2018-02-01

We give a complete description of the possible ranges of real Smirnov functions (quotients of two bounded analytic functions on the open unit disk where the denominator is outer and such that the radial boundary values are real almost everywhere on the unit circle). Our techniques use the theory of unbounded symmetric Toeplitz operators, some general theory of unbounded symmetric operators, classical Hardy spaces, and an application of the uniformization theorem. In addition, we completely characterize the possible valences for these real Smirnov functions when the valence is finite. To do so we construct Riemann surfaces we call disk trees by welding together copies of the unit disk and its complement in the Riemann sphere. We also make use of certain trees we call valence trees that mirror the structure of disk trees.

Fredholm-Volterra Integral Equation with a Generalized Singular Kernel and its Numerical Solutions

NASA Astrophysics Data System (ADS)

El-Kalla, I. L.; Al-Bugami, A. M.

2010-11-01

In this paper, the existence and uniqueness of solution of the Fredholm-Volterra integral equation (F-VIE), with a generalized singular kernel, are discussed and proved in the spaceL2(Ω)×C(0,T). The Fredholm integral term (FIT) is considered in position while the Volterra integral term (VIT) is considered in time. Using a numerical technique we have a system of Fredholm integral equations (SFIEs). This system of integral equations can be reduced to a linear algebraic system (LAS) of equations by using two different methods. These methods are: Toeplitz matrix method and Product Nyström method. A numerical examples are considered when the generalized kernel takes the following forms: Carleman function, logarithmic form, Cauchy kernel, and Hilbert kernel.

Multi-color incomplete Cholesky conjugate gradient methods for vector computers

DOE Office of Scientific and Technical Information (OSTI.GOV)

Poole, E.L.

1986-01-01

This research is concerned with the solution on vector computers of linear systems of equations. Ax = b, where A is a large, sparse symmetric positive definite matrix with non-zero elements lying only along a few diagonals of the matrix. The system is solved using the incomplete Cholesky conjugate gradient method (ICCG). Multi-color orderings are used of the unknowns in the linear system to obtain p-color matrices for which a no-fill block ICCG method is implemented on the CYBER 205 with O(N/p) length vector operations in both the decomposition of A and, more importantly, in the forward and back solvesmore » necessary at each iteration of the method. (N is the number of unknowns and p is a small constant). A p-colored matrix is a matrix that can be partitioned into a p x p block matrix where the diagonal blocks are diagonal matrices. The matrix is stored by diagonals and matrix multiplication by diagonals is used to carry out the decomposition of A and the forward and back solves. Additionally, if the vectors across adjacent blocks line up, then some of the overhead associated with vector startups can be eliminated in the matrix vector multiplication necessary at each conjugate gradient iteration. Necessary and sufficient conditions are given to determine which multi-color orderings of the unknowns correspond to p-color matrices, and a process is indicated for choosing multi-color orderings.« less

Normalized modes at selected points without normalization

NASA Astrophysics Data System (ADS)

Kausel, Eduardo

2018-04-01

As every textbook on linear algebra demonstrates, the eigenvectors for the general eigenvalue problem | K - λM | = 0 involving two real, symmetric, positive definite matrices K , M satisfy some well-defined orthogonality conditions. Equally well-known is the fact that those eigenvectors can be normalized so that their modal mass μ =ϕT Mϕ is unity: it suffices to divide each unscaled mode by the square root of the modal mass. Thus, the normalization is the result of an explicit calculation applied to the modes after they were obtained by some means. However, we show herein that the normalized modes are not merely convenient forms of scaling, but that they are actually intrinsic properties of the pair of matrices K , M, that is, the matrices already "know" about normalization even before the modes have been obtained. This means that we can obtain individual components of the normalized modes directly from the eigenvalue problem, and without needing to obtain either all of the modes or for that matter, any one complete mode. These results are achieved by means of the residue theorem of operational calculus, a finding that is rather remarkable inasmuch as the residues themselves do not make use of any orthogonality conditions or normalization in the first place. It appears that this obscure property connecting the general eigenvalue problem of modal analysis with the residue theorem of operational calculus may have been overlooked up until now, but which has in turn interesting theoretical implications.Á

Assimilation of surface NO2 and O3 observations into the SILAM chemistry transport model

NASA Astrophysics Data System (ADS)

Vira, J.; Sofiev, M.

2014-08-01

This paper describes assimilation of trace gas observations into the chemistry transport model SILAM using the 3D-Var method. Assimilation results for year 2012 are presented for the prominent photochemical pollutants ozone (O3) and nitrogen dioxide (NO2). Both species are covered by the Airbase observation database, which provides the observational dataset used in this study. Attention is paid to the background and observation error covariance matrices, which are obtained primarily by iterative application of a posteriori diagnostics. The diagnostics are computed separately for two months representing summer and winter conditions, and further disaggregated by time of day. This allows deriving background and observation error covariance definitions which include both seasonal and diurnal variation. The consistency of the obtained covariance matrices is verified using χ2 diagnostics. The analysis scores are computed for a control set of observation stations withheld from assimilation. Compared to a free-running model simulation, the correlation coefficient for daily maximum values is improved from 0.8 to 0.9 for O3 and from 0.53 to 0.63 for NO2.

Single and multiple object tracking using log-euclidean Riemannian subspace and block-division appearance model.

PubMed

Hu, Weiming; Li, Xi; Luo, Wenhan; Zhang, Xiaoqin; Maybank, Stephen; Zhang, Zhongfei

2012-12-01

Object appearance modeling is crucial for tracking objects, especially in videos captured by nonstationary cameras and for reasoning about occlusions between multiple moving objects. Based on the log-euclidean Riemannian metric on symmetric positive definite matrices, we propose an incremental log-euclidean Riemannian subspace learning algorithm in which covariance matrices of image features are mapped into a vector space with the log-euclidean Riemannian metric. Based on the subspace learning algorithm, we develop a log-euclidean block-division appearance model which captures both the global and local spatial layout information about object appearances. Single object tracking and multi-object tracking with occlusion reasoning are then achieved by particle filtering-based Bayesian state inference. During tracking, incremental updating of the log-euclidean block-division appearance model captures changes in object appearance. For multi-object tracking, the appearance models of the objects can be updated even in the presence of occlusions. Experimental results demonstrate that the proposed tracking algorithm obtains more accurate results than six state-of-the-art tracking algorithms.

Livers provide a reliable matrix for real-time PCR confirmation of avian botulism.

PubMed

Le Maréchal, Caroline; Ballan, Valentine; Rouxel, Sandra; Bayon-Auboyer, Marie-Hélène; Baudouard, Marie-Agnès; Morvan, Hervé; Houard, Emmanuelle; Poëzevara, Typhaine; Souillard, Rozenn; Woudstra, Cédric; Le Bouquin, Sophie; Fach, Patrick; Chemaly, Marianne

2016-04-01

Diagnosis of avian botulism is based on clinical symptoms, which are indicative but not specific. Laboratory investigations are therefore required to confirm clinical suspicions and establish a definitive diagnosis. Real-time PCR methods have recently been developed for the detection of Clostridium botulinum group III producing type C, D, C/D or D/C toxins. However, no study has been conducted to determine which types of matrices should be analyzed for laboratory confirmation using this approach. This study reports on the comparison of different matrices (pooled intestinal contents, livers, spleens and cloacal swabs) for PCR detection of C. botulinum. Between 2013 and 2015, 63 avian botulism suspicions were tested and 37 were confirmed as botulism. Analysis of livers using real-time PCR after enrichment led to the confirmation of 97% of the botulism outbreaks. Using the same method, spleens led to the confirmation of 90% of botulism outbreaks, cloacal swabs of 93% and pooled intestinal contents of 46%. Liver appears to be the most reliable type of matrix for laboratory confirmation using real-time PCR analysis. Copyright © 2015 Elsevier Ltd. All rights reserved.

ORACLS: A system for linear-quadratic-Gaussian control law design

NASA Technical Reports Server (NTRS)

Armstrong, E. S.

1978-01-01

A modern control theory design package (ORACLS) for constructing controllers and optimal filters for systems modeled by linear time-invariant differential or difference equations is described. Numerical linear-algebra procedures are used to implement the linear-quadratic-Gaussian (LQG) methodology of modern control theory. Algorithms are included for computing eigensystems of real matrices, the relative stability of a matrix, factored forms for nonnegative definite matrices, the solutions and least squares approximations to the solutions of certain linear matrix algebraic equations, the controllability properties of a linear time-invariant system, and the steady state covariance matrix of an open-loop stable system forced by white noise. Subroutines are provided for solving both the continuous and discrete optimal linear regulator problems with noise free measurements and the sampled-data optimal linear regulator problem. For measurement noise, duality theory and the optimal regulator algorithms are used to solve the continuous and discrete Kalman-Bucy filter problems. Subroutines are also included which give control laws causing the output of a system to track the output of a prescribed model.

Krylov-Subspace Recycling via the POD-Augmented Conjugate-Gradient Method

DOE Office of Scientific and Technical Information (OSTI.GOV)

Carlberg, Kevin; Forstall, Virginia; Tuminaro, Ray

This paper presents a new Krylov-subspace-recycling method for efficiently solving sequences of linear systems of equations characterized by varying right-hand sides and symmetric-positive-definite matrices. As opposed to typical truncation strategies used in recycling such as deflation, we propose a truncation method inspired by goal-oriented proper orthogonal decomposition (POD) from model reduction. This idea is based on the observation that model reduction aims to compute a low-dimensional subspace that contains an accurate solution; as such, we expect the proposed method to generate a low-dimensional subspace that is well suited for computing solutions that can satisfy inexact tolerances. In particular, we proposemore » specific goal-oriented POD `ingredients' that align the optimality properties of POD with the objective of Krylov-subspace recycling. To compute solutions in the resulting 'augmented' POD subspace, we propose a hybrid direct/iterative three-stage method that leverages 1) the optimal ordering of POD basis vectors, and 2) well-conditioned reduced matrices. Numerical experiments performed on solid-mechanics problems highlight the benefits of the proposed method over existing approaches for Krylov-subspace recycling.« less

Krylov-Subspace Recycling via the POD-Augmented Conjugate-Gradient Method

DOE PAGES

Carlberg, Kevin; Forstall, Virginia; Tuminaro, Ray

2016-01-01

This paper presents a new Krylov-subspace-recycling method for efficiently solving sequences of linear systems of equations characterized by varying right-hand sides and symmetric-positive-definite matrices. As opposed to typical truncation strategies used in recycling such as deflation, we propose a truncation method inspired by goal-oriented proper orthogonal decomposition (POD) from model reduction. This idea is based on the observation that model reduction aims to compute a low-dimensional subspace that contains an accurate solution; as such, we expect the proposed method to generate a low-dimensional subspace that is well suited for computing solutions that can satisfy inexact tolerances. In particular, we proposemore » specific goal-oriented POD `ingredients' that align the optimality properties of POD with the objective of Krylov-subspace recycling. To compute solutions in the resulting 'augmented' POD subspace, we propose a hybrid direct/iterative three-stage method that leverages 1) the optimal ordering of POD basis vectors, and 2) well-conditioned reduced matrices. Numerical experiments performed on solid-mechanics problems highlight the benefits of the proposed method over existing approaches for Krylov-subspace recycling.« less

Raney Distributions and Random Matrix Theory

NASA Astrophysics Data System (ADS)

Forrester, Peter J.; Liu, Dang-Zheng

2015-03-01

Recent works have shown that the family of probability distributions with moments given by the Fuss-Catalan numbers permit a simple parameterized form for their density. We extend this result to the Raney distribution which by definition has its moments given by a generalization of the Fuss-Catalan numbers. Such computations begin with an algebraic equation satisfied by the Stieltjes transform, which we show can be derived from the linear differential equation satisfied by the characteristic polynomial of random matrix realizations of the Raney distribution. For the Fuss-Catalan distribution, an equilibrium problem characterizing the density is identified. The Stieltjes transform for the limiting spectral density of the singular values squared of the matrix product formed from inverse standard Gaussian matrices, and standard Gaussian matrices, is shown to satisfy a variant of the algebraic equation relating to the Raney distribution. Supported on , we show that it too permits a simple functional form upon the introduction of an appropriate choice of parameterization. As an application, the leading asymptotic form of the density as the endpoints of the support are approached is computed, and is shown to have some universal features.

Investigating the Relationship Between Soil Water Mobility and Stable Isotope Composition with Implications for the Ecohydrologic Separation Hypothesis

NASA Astrophysics Data System (ADS)

Shuler, J.; McNamara, J. P.; Benner, S. G.; Kohn, M. J.; Evans, S.

2017-12-01

The ecohydrologic separation (ES) hypothesis states that streams and plants return different soil water compartments to the atmosphere and that these compartments bear distinct isotopic compositions that can be used to infer soil water mobility. Recent studies have found isotopic evidence for ES in a variety of ecosystems, though interpretations of these data vary. ES investigations frequently suffer from low sampling frequencies as well as incomplete or missing soil moisture and matric potential data to support assumptions of soil water mobility. We sampled bulk soil water every 2-3 weeks in the upper 1 m of a hillslope profile from May 2016 to July 2017 in a semi-arid watershed outside Boise, ID. Twig samples of three plant species were also collected concurrently. Plant and soil water samples extracted via cryogenic vacuum distillation were analyzed for δ2H and δ18O composition. Soil moisture and soil matric potential sensors were installed at five and four depths in the profile, respectively. Shallow bulk soil water was progressively enriched in both isotopes over the growing season and plotted along a soil evaporation line in a plot of δ2H versus δ18O. Plant water during the growing season plotted below both the Local Meteoric Water Line and soil evaporation line. Plant water isotopic composition could not be traced to any source sampled in this study. Additionally, soil moisture and matric potential data revealed that soils were well-drained and that mobile soil water was unavailable throughout most of the growing season at the depths sampled. Soil water isotopic composition alone failed to predict mobility as observed in soil moisture and matric potential data. These results underscore the need for standard hydrologic definitions for the mobile and immobile compartments of soil water in future studies of the ES hypothesis and ecohydrologic processes in general.

The utility of covariance of combining ability in plant breeding.

PubMed

Arunachalam, V

1976-11-01

The definition of covariances of half- and full sibs, and hence that of variances of general and specific combining ability with regard to a quantitative character, is extended to take into account the respective covariances between a pair of characters. The interpretation of the dispersion and correlation matrices of general and specific combining ability is discussed by considering a set of single, three- and four-way crosses, made using diallel and line × tester mating systems in Pennisetum typhoides. The general implications of the concept of covariance of combining ability in plant breeding are discussed.

A locally refined rectangular grid finite element method - Application to computational fluid dynamics and computational physics

NASA Technical Reports Server (NTRS)

Young, David P.; Melvin, Robin G.; Bieterman, Michael B.; Johnson, Forrester T.; Samant, Satish S.

1991-01-01

The present FEM technique addresses both linear and nonlinear boundary value problems encountered in computational physics by handling general three-dimensional regions, boundary conditions, and material properties. The box finite elements used are defined by a Cartesian grid independent of the boundary definition, and local refinements proceed by dividing a given box element into eight subelements. Discretization employs trilinear approximations on the box elements; special element stiffness matrices are included for boxes cut by any boundary surface. Illustrative results are presented for representative aerodynamics problems involving up to 400,000 elements.

Formulation of the proper equations for developing standards in coherent dual polarisation SAR imaging

NASA Astrophysics Data System (ADS)

Boerner, W.-M.; Kostinski, A. B.

1988-08-01

Crucial inconsistencies in the basic equations of radar polarimetry which are common in the literature were detected. The formulations of the polarization state definitions given in the IEEE/ANSI Standards 149-1979 are in error. These and other inconsistencies and conceptual errors are discussed. The correct formulae for the proposed revision of the polarimetric standards together with a well-defined and consistent procedure for measuring target scattering matrices in monostatic and bistatic arrangements are given. The proposed procedure can be applied to an arbitrary measurement process in any general elliptical polarization basis.

Implementation of continuous-variable quantum key distribution with discrete modulation

NASA Astrophysics Data System (ADS)

Hirano, Takuya; Ichikawa, Tsubasa; Matsubara, Takuto; Ono, Motoharu; Oguri, Yusuke; Namiki, Ryo; Kasai, Kenta; Matsumoto, Ryutaroh; Tsurumaru, Toyohiro

2017-06-01

We have developed a continuous-variable quantum key distribution (CV-QKD) system that employs discrete quadrature-amplitude modulation and homodyne detection of coherent states of light. We experimentally demonstrated automated secure key generation with a rate of 50 kbps when a quantum channel is a 10 km optical fibre. The CV-QKD system utilises a four-state and post-selection protocol and generates a secure key against the entangling cloner attack. We used a pulsed light source of 1550 nm wavelength with a repetition rate of 10 MHz. A commercially available balanced receiver is used to realise shot-noise-limited pulsed homodyne detection. We used a non-binary LDPC code for error correction (reverse reconciliation) and the Toeplitz matrix multiplication for privacy amplification. A graphical processing unit card is used to accelerate the software-based post-processing.

High-Speed Device-Independent Quantum Random Number Generation without a Detection Loophole

NASA Astrophysics Data System (ADS)

Liu, Yang; Yuan, Xiao; Li, Ming-Han; Zhang, Weijun; Zhao, Qi; Zhong, Jiaqiang; Cao, Yuan; Li, Yu-Huai; Chen, Luo-Kan; Li, Hao; Peng, Tianyi; Chen, Yu-Ao; Peng, Cheng-Zhi; Shi, Sheng-Cai; Wang, Zhen; You, Lixing; Ma, Xiongfeng; Fan, Jingyun; Zhang, Qiang; Pan, Jian-Wei

2018-01-01

Quantum mechanics provides the means of generating genuine randomness that is impossible with deterministic classical processes. Remarkably, the unpredictability of randomness can be certified in a manner that is independent of implementation devices. Here, we present an experimental study of device-independent quantum random number generation based on a detection-loophole-free Bell test with entangled photons. In the randomness analysis, without the independent identical distribution assumption, we consider the worst case scenario that the adversary launches the most powerful attacks against the quantum adversary. After considering statistical fluctuations and applying an 80 Gb ×45.6 Mb Toeplitz matrix hashing, we achieve a final random bit rate of 114 bits /s , with a failure probability less than 10-5. This marks a critical step towards realistic applications in cryptography and fundamental physics tests.

Generation of physical random numbers by using homodyne detection

NASA Astrophysics Data System (ADS)

Hirakawa, Kodai; Oya, Shota; Oguri, Yusuke; Ichikawa, Tsubasa; Eto, Yujiro; Hirano, Takuya; Tsurumaru, Toyohiro

2016-10-01

Physical random numbers generated by quantum measurements are, in principle, impossible to predict. We have demonstrated the generation of physical random numbers by using a high-speed balanced photodetector to measure the quadrature amplitudes of vacuum states. Using this method, random numbers were generated at 500 Mbps, which is more than one order of magnitude faster than previously [Gabriel et al:, Nature Photonics 4, 711-715 (2010)]. The Crush test battery of the TestU01 suite consists of 31 tests in 144 variations, and we used them to statistically analyze these numbers. The generated random numbers passed 14 of the 31 tests. To improve the randomness, we performed a hash operation, in which each random number was multiplied by a random Toeplitz matrix; the resulting numbers passed all of the tests in the TestU01 Crush battery.

Quasi-Likelihood Techniques in a Logistic Regression Equation for Identifying Simulium damnosum s.l. Larval Habitats Intra-cluster Covariates in Togo.

PubMed

Jacob, Benjamin G; Novak, Robert J; Toe, Laurent; Sanfo, Moussa S; Afriyie, Abena N; Ibrahim, Mohammed A; Griffith, Daniel A; Unnasch, Thomas R

2012-01-01

The standard methods for regression analyses of clustered riverine larval habitat data of Simulium damnosum s.l. a major black-fly vector of Onchoceriasis, postulate models relating observational ecological-sampled parameter estimators to prolific habitats without accounting for residual intra-cluster error correlation effects. Generally, this correlation comes from two sources: (1) the design of the random effects and their assumed covariance from the multiple levels within the regression model; and, (2) the correlation structure of the residuals. Unfortunately, inconspicuous errors in residual intra-cluster correlation estimates can overstate precision in forecasted S.damnosum s.l. riverine larval habitat explanatory attributes regardless how they are treated (e.g., independent, autoregressive, Toeplitz, etc). In this research, the geographical locations for multiple riverine-based S. damnosum s.l. larval ecosystem habitats sampled from 2 pre-established epidemiological sites in Togo were identified and recorded from July 2009 to June 2010. Initially the data was aggregated into proc genmod. An agglomerative hierarchical residual cluster-based analysis was then performed. The sampled clustered study site data was then analyzed for statistical correlations using Monthly Biting Rates (MBR). Euclidean distance measurements and terrain-related geomorphological statistics were then generated in ArcGIS. A digital overlay was then performed also in ArcGIS using the georeferenced ground coordinates of high and low density clusters stratified by Annual Biting Rates (ABR). This data was overlain onto multitemporal sub-meter pixel resolution satellite data (i.e., QuickBird 0.61m wavbands ). Orthogonal spatial filter eigenvectors were then generated in SAS/GIS. Univariate and non-linear regression-based models (i.e., Logistic, Poisson and Negative Binomial) were also employed to determine probability distributions and to identify statistically significant parameter estimators from the sampled data. Thereafter, Durbin-Watson test statistics were used to test the null hypothesis that the regression residuals were not autocorrelated against the alternative that the residuals followed an autoregressive process in AUTOREG. Bayesian uncertainty matrices were also constructed employing normal priors for each of the sampled estimators in PROC MCMC. The residuals revealed both spatially structured and unstructured error effects in the high and low ABR-stratified clusters. The analyses also revealed that the estimators, levels of turbidity and presence of rocks were statistically significant for the high-ABR-stratified clusters, while the estimators distance between habitats and floating vegetation were important for the low-ABR-stratified cluster. Varying and constant coefficient regression models, ABR- stratified GIS-generated clusters, sub-meter resolution satellite imagery, a robust residual intra-cluster diagnostic test, MBR-based histograms, eigendecomposition spatial filter algorithms and Bayesian matrices can enable accurate autoregressive estimation of latent uncertainity affects and other residual error probabilities (i.e., heteroskedasticity) for testing correlations between georeferenced S. damnosum s.l. riverine larval habitat estimators. The asymptotic distribution of the resulting residual adjusted intra-cluster predictor error autocovariate coefficients can thereafter be established while estimates of the asymptotic variance can lead to the construction of approximate confidence intervals for accurately targeting productive S. damnosum s.l habitats based on spatiotemporal field-sampled count data.

Steady induction effects in geomagnetism. Part 1C: Geomagnetic estimation of steady surficial core motions: Application to the definitive geomagnetic reference field models

NASA Technical Reports Server (NTRS)

Voorhies, Coerte V.

1993-01-01

In the source-free mantle/frozen-flux core magnetic earth model, the non-linear inverse steady motional induction problem was solved using the method presented in Part 1B. How that method was applied to estimate steady, broad-scale fluid velocity fields near the top of Earth's core that induce the secular change indicated by the Definitive Geomagnetic Reference Field (DGRF) models from 1945 to 1980 are described. Special attention is given to the derivation of weight matrices for the DGRF models because the weights determine the apparent significance of the residual secular change. The derived weight matrices also enable estimation of the secular change signal-to-noise ratio characterizing the DGRF models. Two types of weights were derived in 1987-88: radial field weights for fitting the evolution of the broad-scale portion of the radial geomagnetic field component at Earth's surface implied by the DGRF's, and general weights for fitting the evolution of the broad-scale portion of the scalar potential specified by these models. The difference is non-trivial because not all the geomagnetic data represented by the DGRF's constrain the radial field component. For radial field weights (or general weights), a quantitatively acceptable explication of broad-scale secular change relative to the 1980 Magsat epoch must account for 99.94271 percent (or 99.98784 percent) of the total weighted variance accumulated therein. Tolerable normalized root-mean-square weighted residuals of 2.394 percent (or 1.103 percent) are less than the 7 percent errors expected in the source-free mantle/frozen-flux core approximation.

Clifford Algebra Implying Three Fermion Generations Revisited

NASA Astrophysics Data System (ADS)

Krolikowski, Wojciech

2002-09-01

The author's idea of algebraic compositeness of fundamental particles, allowing to understand the existence in Nature of three fermion generations, is revisited. It is based on two postulates. Primo, for all fundamental particles of matter the Dirac square-root procedure √ {p2} → {Γ }(N)p works, leading to a sequence N = 1,2,3, ... of Dirac-type equations, where four Dirac-type matrices {Γ }(N)μ are embedded into a Clifford algebra via a Jacobi definition introducing four ``centre-of-mass'' and (N-1)× four ``relative'' Dirac-type matrices. These define one ``centre-of-mass'' and (N-1) ``relative'' Dirac bispinor indices. Secundo, the ``centre-of-mass'' Dirac bispinor index is coupled to the Standard Model gauge fields, while (N-1) ``relative'' Dirac bispinor indices are all free indistinguishable physical objects obeying Fermi statistics along with the Pauli principle which requires the full antisymmetry with respect to ``relative'' Dirac indices. This allows only for three Dirac-type equations with N = 1,3,5 in the case of N odd, and two with N = 2,4 in the case of N even. The first of these results implies unavoidably the existence of three and only three generations of fundamental fermions, namely leptons and quarks, as labelled by the Standard Model signature. At the end, a comment is added on the possible shape of Dirac 3x3 mass matrices for four sorts of spin-1/2 fundamental fermions appearing in three generations. For charged leptons a prediction is mτ = 1776.80 MeV, when the input of experimental me and mμ is used.

An improved method to quantitate mature plant microRNA in biological matrices using modified periodate treatment and inclusion of internal controls.

PubMed

Huang, Haiqiu; Roh, Jamin; Davis, Cindy D; Wang, Thomas T Y

2017-01-01

MicroRNAs (miRNAs) ubiquitously exist in microorganisms, plants, and animals, and appear to modulate a wide range of critical biological processes. However, no definitive conclusion has been reached regarding the uptake of exogenous dietary small RNAs into mammalian circulation and organs and cross-kingdom regulation. One of the critical issues is our ability to assess and distinguish the origin of miRNAs. Although periodate oxidation has been used to differentiate mammalian and plant miRNAs, validation of treatment efficiency and the inclusion of proper controls for this method were lacking in previous studies. This study aimed to address: 1) the efficiency of periodate treatment in a plant or mammalian RNA matrix, and 2) the necessity of inclusion of internal controls. We designed and tested spike-in synthetic miRNAs in various plant and mammalian matrices and showed that they can be used as a control for the completion of periodate oxidation. We found that overloading the reaction system with high concentration of RNA resulted in incomplete oxidation of unmethylated miRNA. The abundant miRNAs from soy and corn were analyzed in the plasma, liver, and fecal samples of C57BL/6 mice fed a corn and soy-based chow diet using our improved methodology. The improvement resulted in the elimination of the false positive detection in the liver, and we did not detect plant miRNAs in the mouse plasma or liver samples. In summary, an improved methodology was developed for plant miRNA detection that appears to work well in different sample matrices.

A Candidate Wake Vortex Strength Definition for Application to the NASA Aircraft Vortex Spacing System (AVOSS)

NASA Technical Reports Server (NTRS)

Hinton, David A.; Tatnall, Chris R.

1997-01-01

A significant effort is underway at NASA Langley to develop a system to provide dynamical aircraft wake vortex spacing criteria to Air Traffic Control (ATC). The system under development, the Aircraft Vortex Spacing System (AVOSS), combines the inputs of multiple subsystems to provide separation matrices with sufficient stability for use by ATC and sufficient monitoring to ensure safety. The subsystems include a meteorological subsystem, a wake behavior prediction subsystem, a wake sensor subsystem, and system integration and ATC interfaces. The proposed AVOSS is capable of using two factors, singly or in combination, for reducing in-trail spacing. These factors are wake vortex motion out of a predefined approach corridor and wake decay below a strength that is acceptable for encounter. Although basic research into the wake phenomena has historically used wake total circulation as a strength parameter, there is a requirement for a more specific strength definition that may be applied across multiple disciplines and teams to produce a real-time, automated system. This paper presents some of the limitations of previous applications of circulation to aircraft wake observations and describes the results of a preliminary effort to bound a spacing system strength definition.

OPERATOR NORM INEQUALITIES BETWEEN TENSOR UNFOLDINGS ON THE PARTITION LATTICE

PubMed Central

Wang, Miaoyan; Duc, Khanh Dao; Fischer, Jonathan; Song, Yun S.

2017-01-01

Interest in higher-order tensors has recently surged in data-intensive fields, with a wide range of applications including image processing, blind source separation, community detection, and feature extraction. A common paradigm in tensor-related algorithms advocates unfolding (or flattening) the tensor into a matrix and applying classical methods developed for matrices. Despite the popularity of such techniques, how the functional properties of a tensor changes upon unfolding is currently not well understood. In contrast to the body of existing work which has focused almost exclusively on matricizations, we here consider all possible unfoldings of an order-k tensor, which are in one-to-one correspondence with the set of partitions of {1, …, k}. We derive general inequalities between the lp-norms of arbitrary unfoldings defined on the partition lattice. In particular, we demonstrate how the spectral norm (p = 2) of a tensor is bounded by that of its unfoldings, and obtain an improved upper bound on the ratio of the Frobenius norm to the spectral norm of an arbitrary tensor. For specially-structured tensors satisfying a generalized definition of orthogonal decomposability, we prove that the spectral norm remains invariant under specific subsets of unfolding operations. PMID:28286347

Assimilation of surface NO2 and O3 observations into the SILAM chemistry transport model

NASA Astrophysics Data System (ADS)

Vira, J.; Sofiev, M.

2015-02-01

This paper describes the assimilation of trace gas observations into the chemistry transport model SILAM (System for Integrated modeLling of Atmospheric coMposition) using the 3D-Var method. Assimilation results for the year 2012 are presented for the prominent photochemical pollutants ozone (O3) and nitrogen dioxide (NO2). Both species are covered by the AirBase observation database, which provides the observational data set used in this study. Attention was paid to the background and observation error covariance matrices, which were obtained primarily by the iterative application of a posteriori diagnostics. The diagnostics were computed separately for 2 months representing summer and winter conditions, and further disaggregated by time of day. This enabled the derivation of background and observation error covariance definitions, which included both seasonal and diurnal variation. The consistency of the obtained covariance matrices was verified using χ2 diagnostics. The analysis scores were computed for a control set of observation stations withheld from assimilation. Compared to a free-running model simulation, the correlation coefficient for daily maximum values was improved from 0.8 to 0.9 for O3 and from 0.53 to 0.63 for NO2.

Density-velocity equations with bulk modulus for computational hydro-acoustics

NASA Astrophysics Data System (ADS)

Lin, Po-Hsien; Chen, Yung-Yu; John Yu, S.-T.

2014-02-01

This paper reports a new set of model equations for Computational Hydro Acoustics (CHA). The governing equations include the continuity and the momentum equations. The definition of bulk modulus is used to relate density with pressure. For 3D flow fields, there are four equations with density and velocity components as the unknowns. The inviscid equations are proved to be hyperbolic because an arbitrary linear combination of the three Jacobian matrices is diagonalizable and has a real spectrum. The left and right eigenvector matrices are explicitly derived. Moreover, an analytical form of the Riemann invariants are derived. The model equations are indeed suitable for modeling wave propagation in low-speed, nearly incompressible air and water flows. To demonstrate the capability of the new formulation, we use the CESE method to solve the 2D equations for aeolian tones generated by air flows passing a circular cylinder at Re = 89,000, 46,000, and 22,000. Numerical results compare well with previously published data. By simply changing the value of the bulk modulus, the same code is then used to calculate three cases of water flows passing a cylinder at Re = 89,000, 67,000, and 44,000.

Dual signal subspace projection (DSSP): a novel algorithm for removing large interference in biomagnetic measurements

NASA Astrophysics Data System (ADS)

Sekihara, Kensuke; Kawabata, Yuya; Ushio, Shuta; Sumiya, Satoshi; Kawabata, Shigenori; Adachi, Yoshiaki; Nagarajan, Srikantan S.

2016-06-01

Objective. In functional electrophysiological imaging, signals are often contaminated by interference that can be of considerable magnitude compared to the signals of interest. This paper proposes a novel algorithm for removing such interferences that does not require separate noise measurements. Approach. The algorithm is based on a dual definition of the signal subspace in the spatial- and time-domains. Since the algorithm makes use of this duality, it is named the dual signal subspace projection (DSSP). The DSSP algorithm first projects the columns of the measured data matrix onto the inside and outside of the spatial-domain signal subspace, creating a set of two preprocessed data matrices. The intersection of the row spans of these two matrices is estimated as the time-domain interference subspace. The original data matrix is projected onto the subspace that is orthogonal to this interference subspace. Main results. The DSSP algorithm is validated by using the computer simulation, and using two sets of real biomagnetic data: spinal cord evoked field data measured from a healthy volunteer and magnetoencephalography data from a patient with a vagus nerve stimulator. Significance. The proposed DSSP algorithm is effective for removing overlapped interference in a wide variety of biomagnetic measurements.

Relativistic Definition of Spin Operators

NASA Astrophysics Data System (ADS)

Ryder, Lewis H.

2002-12-01

Some years ago Mashhoon [1] made the highly interesting suggestion that there existed a coupling of spin with rotations, just as there exists such a coupling with orbital angular momentum, as seen in the Sagnac effect, for example. Spin being essentially a quantum phenomenon, the obvious place to look for this was by studying the Dirac equation, and Hehl and Ni, in such an investigation [2], indeed found a coupling term of just the type Mashhoon had envisaged. Part of their procedure, however, was to take the nonrelativistic limit, and this was done by performing appropriate Foldy-Wouthuysen (FW) transformations. In the nonrelativistic limit, it is well-known that the spin operators for Dirac particles are in essence the Pauli matrices; but it is also well-known, and indeed was part of the motivation for Foldy and Wouthuysen's paper, that for fully-fledged Dirac particles the (4×4 generalisation of the) Pauli matrices do not yield satisfactory spin operators, since spin defined in this way would not be conserved. The question therefore presented itself: is there a relativistic spin operator for Dirac particles, such that in the relativistic, as well as the nonrelativistic, régime a Mashhoon spin-rotation coupling exists?...

OPERATOR NORM INEQUALITIES BETWEEN TENSOR UNFOLDINGS ON THE PARTITION LATTICE.

PubMed

Wang, Miaoyan; Duc, Khanh Dao; Fischer, Jonathan; Song, Yun S

2017-05-01

Interest in higher-order tensors has recently surged in data-intensive fields, with a wide range of applications including image processing, blind source separation, community detection, and feature extraction. A common paradigm in tensor-related algorithms advocates unfolding (or flattening) the tensor into a matrix and applying classical methods developed for matrices. Despite the popularity of such techniques, how the functional properties of a tensor changes upon unfolding is currently not well understood. In contrast to the body of existing work which has focused almost exclusively on matricizations, we here consider all possible unfoldings of an order- k tensor, which are in one-to-one correspondence with the set of partitions of {1, …, k }. We derive general inequalities between the l p -norms of arbitrary unfoldings defined on the partition lattice. In particular, we demonstrate how the spectral norm ( p = 2) of a tensor is bounded by that of its unfoldings, and obtain an improved upper bound on the ratio of the Frobenius norm to the spectral norm of an arbitrary tensor. For specially-structured tensors satisfying a generalized definition of orthogonal decomposability, we prove that the spectral norm remains invariant under specific subsets of unfolding operations.

An Analysis of the Max-Min Texture Measure.

DTIC Science & Technology

1982-01-01

PANC 33 D2 Confusion Matrices for Scene A, IR 34 D3 Confusion Matrices for Scene B, PANC 35 D4 Confusion Matrices for Scene B, IR 36 D5 Confusion...Matrices for Scene C, PANC 37 D6 Confusion Matrices for Scene C, IR 38 D7 Confusion Matrices for Scene E, PANC 39 D8 Confusion Matrices for Scene E, IR 40...D9 Confusion Matrices for Scene H, PANC 41 DIO Confusion Matrices for Scene H, JR 42 3 .D 10CnuinMtie o cn ,IR4 AN ANALYSIS OF THE MAX-MIN TEXTURE

An Object-Oriented Collection of Minimum Degree Algorithms: Design, Implementation, and Experiences

NASA Technical Reports Server (NTRS)

Kumfert, Gary; Pothen, Alex

1999-01-01

The multiple minimum degree (MMD) algorithm and its variants have enjoyed 20+ years of research and progress in generating fill-reducing orderings for sparse, symmetric positive definite matrices. Although conceptually simple, efficient implementations of these algorithms are deceptively complex and highly specialized. In this case study, we present an object-oriented library that implements several recent minimum degree-like algorithms. We discuss how object-oriented design forces us to decompose these algorithms in a different manner than earlier codes and demonstrate how this impacts the flexibility and efficiency of our C++ implementation. We compare the performance of our code against other implementations in C or Fortran.

The use of Lanczos's method to solve the large generalized symmetric definite eigenvalue problem

NASA Technical Reports Server (NTRS)

Jones, Mark T.; Patrick, Merrell L.

1989-01-01

The generalized eigenvalue problem, Kx = Lambda Mx, is of significant practical importance, especially in structural enginering where it arises as the vibration and buckling problem. A new algorithm, LANZ, based on Lanczos's method is developed. LANZ uses a technique called dynamic shifting to improve the efficiency and reliability of the Lanczos algorithm. A new algorithm for solving the tridiagonal matrices that arise when using Lanczos's method is described. A modification of Parlett and Scott's selective orthogonalization algorithm is proposed. Results from an implementation of LANZ on a Convex C-220 show it to be superior to a subspace iteration code.

Development and validation of a general purpose linearization program for rigid aircraft models

NASA Technical Reports Server (NTRS)

Duke, E. L.; Antoniewicz, R. F.

1985-01-01

A FORTRAN program that provides the user with a powerful and flexible tool for the linearization of aircraft models is discussed. The program LINEAR numerically determines a linear systems model using nonlinear equations of motion and a user-supplied, nonlinear aerodynamic model. The system model determined by LINEAR consists of matrices for both the state and observation equations. The program has been designed to allow easy selection and definition of the state, control, and observation variables to be used in a particular model. Also, included in the report is a comparison of linear and nonlinear models for a high performance aircraft.

KPII: Cauchy-Jost function, Darboux transformations and totally nonnegative matrices

NASA Astrophysics Data System (ADS)

Boiti, M.; Pempinelli, F.; Pogrebkov, A. K.

2017-07-01

Direct definition of the Cauchy-Jost (known also as Cauchy-Baker-Akhiezer) function is given in the case of a pure solitonic solution. Properties of this function are discussed in detail using the Kadomtsev-Petviashvili II equation as an example. This enables formulation of the Darboux transformations in terms of the Cauchy-Jost function and classification of these transformations. Action of Darboux transformations on Grassmanians—i.e. on the space of soliton parameters—is derived and the relation of the Darboux transformations with the property of total nonnegativity of elements of corresponding Grassmanians is discussed. To the memory of our friend and colleague Peter P Kulish

LANDSAT-D data format control book. Volume 6, appendix A: Partially processed thematic mapper High Density Tape (HDT-AT)

NASA Technical Reports Server (NTRS)

Jai, A.

1982-01-01

One of the outputs of the data management system being developed to provide a variety of standard image products from the thematic mapper and the multispectral band scanners on LANDSAT 4, is the partially processed TM data (radiometric corrections applied and geometric correction matrices for two projections appended) which is recorded on a 28-track high density tape. Specifications are presented for the format of the recorded data as well as for the time code and the major and minor frames of the tape. Major frame types, formats, and field definitions are included.

A NASTRAN model of a large flexible swing-wing bomber. Volume 5: NASTRAN model development-fairing structure

NASA Technical Reports Server (NTRS)

Mock, W. D.; Latham, R. A.

1982-01-01

The NASTRAN model plan for the fairing structure was expanded in detail to generate the NASTRAN model of this substructure. The grid point coordinates, element definitions, material properties, and sizing data for each element were specified. The fairing model was thoroughly checked out for continuity, connectivity, and constraints. The substructure was processed for structural influence coefficients (SIC) point loadings to determine the deflection characteristics of the fairing model. Finally, a demonstration and validation processing of this substructure was accomplished using the NASTRAN finite element program. The bulk data deck, stiffness matrices, and SIC output data were delivered.

Atomic Spectral Methods for Ab Initio Molecular Electronic Energy Surfaces: Transitioning From Small-Molecule to Biomolecular-Suitable Approaches.

PubMed

Mills, Jeffrey D; Ben-Nun, Michal; Rollin, Kyle; Bromley, Michael W J; Li, Jiabo; Hinde, Robert J; Winstead, Carl L; Sheehy, Jeffrey A; Boatz, Jerry A; Langhoff, Peter W

2016-08-25

Continuing attention has addressed incorportation of the electronically dynamical attributes of biomolecules in the largely static first-generation molecular-mechanical force fields commonly employed in molecular-dynamics simulations. We describe here a universal quantum-mechanical approach to calculations of the electronic energy surfaces of both small molecules and large aggregates on a common basis which can include such electronic attributes, and which also seems well-suited to adaptation in ab initio molecular-dynamics applications. In contrast to the more familiar orbital-product-based methodologies employed in traditional small-molecule computational quantum chemistry, the present approach is based on an "ex-post-facto" method in which Hamiltonian matrices are evaluated prior to wave function antisymmetrization, implemented here in the support of a Hilbert space of orthonormal products of many-electron atomic spectral eigenstates familiar from the van der Waals theory of long-range interactions. The general theory in its various forms incorporates the early semiempirical atoms- and diatomics-in-molecules approaches of Moffitt, Ellison, Tully, Kuntz, and others in a comprehensive mathematical setting, and generalizes the developments of Eisenschitz, London, Claverie, and others addressing electron permutation symmetry adaptation issues, completing these early attempts to treat van der Waals and chemical forces on a common basis. Exact expressions are obtained for molecular Hamiltonian matrices and for associated energy eigenvalues as sums of separate atomic and interaction-energy terms, similar in this respect to the forms of classical force fields. The latter representation is seen to also provide a long-missing general definition of the energies of individual atoms and of their interactions within molecules and matter free from subjective additional constraints. A computer code suite is described for calculations of the many-electron atomic eigenspectra and the pairwise-atomic Hamiltonian matrices required for practical applications. These matrices can be retained as functions of scalar atomic-pair separations and employed in assembling aggregate Hamiltonian matrices, with Wigner rotation matrices providing analytical representations of their angular degrees of freedom. In this way, ab initio potential energy surfaces are obtained in the complete absence of repeated evaluations and transformations of the one- and two-electron integrals at different molecular geometries required in most ab inito molecular calculations, with large Hamiltonian matrix assembly simplified and explicit diagonalizations avoided employing partitioning and Brillouin-Wigner or Rayleigh-Schrödinger perturbation theory. Illustrative applications of the important components of the formalism, selected aspects of the scaling of the approach, and aspects of "on-the-fly" interfaces with Monte Carlo and molecular-dynamics methods are described in anticipation of subsequent applications to biomolecules and other large aggregates.

Data traffic reduction schemes for sparse Cholesky factorizations

NASA Technical Reports Server (NTRS)

Naik, Vijay K.; Patrick, Merrell L.

1988-01-01

Load distribution schemes are presented which minimize the total data traffic in the Cholesky factorization of dense and sparse, symmetric, positive definite matrices on multiprocessor systems with local and shared memory. The total data traffic in factoring an n x n sparse, symmetric, positive definite matrix representing an n-vertex regular 2-D grid graph using n (sup alpha), alpha is equal to or less than 1, processors are shown to be O(n(sup 1 + alpha/2)). It is O(n(sup 3/2)), when n (sup alpha), alpha is equal to or greater than 1, processors are used. Under the conditions of uniform load distribution, these results are shown to be asymptotically optimal. The schemes allow efficient use of up to O(n) processors before the total data traffic reaches the maximum value of O(n(sup 3/2)). The partitioning employed within the scheme, allows a better utilization of the data accessed from shared memory than those of previously published methods.

Expediting the transition from replacement medicine to tissue engineering.

PubMed

Coury, Arthur J

2016-06-01

In this article, an expansive interpretation of "Tissue Engineering" is proposed which is in congruence with classical and recent published definitions. I further simplify the definition of tissue engineering as: "Exerting systematic control of the body's cells, matrices and fluids." As a consequence, many medical therapies not commonly considered tissue engineering are placed in this category because of their effect on the body's responses. While the progress of tissue engineering strategies is inexorable and generally positive, it has been subject to setbacks as have many important medical therapies. Medical practice is currently undergoing a transition on several fronts (academics, start-up companies, going concerns) from the era of "replacement medicine" where body parts and functions are replaced by mechanical, electrical or chemical therapies to the era of tissue engineering where health is restored by regeneration generation or limitation of the body's tissues and functions by exploiting our expanding knowledge of the body's biological processes to produce natural, healthy outcomes.

Periodic GMP Matrices

NASA Astrophysics Data System (ADS)

Eichinger, Benjamin

2016-07-01

We recall criteria on the spectrum of Jacobi matrices such that the corresponding isospectral torus consists of periodic operators. Motivated by those known results for Jacobi matrices, we define a new class of operators called GMP matrices. They form a certain Generalization of matrices related to the strong Moment Problem. This class allows us to give a parametrization of almost periodic finite gap Jacobi matrices by periodic GMP matrices. Moreover, due to their structural similarity we can carry over numerous results from the direct and inverse spectral theory of periodic Jacobi matrices to the class of periodic GMP matrices. In particular, we prove an analogue of the remarkable ''magic formula'' for this new class.

Weighted Bergman Kernels and Quantization}

NASA Astrophysics Data System (ADS)

Engliš, Miroslav

Let Ω be a bounded pseudoconvex domain in CN, φ, ψ two positive functions on Ω such that - log ψ, - log φ are plurisubharmonic, and z∈Ω a point at which - log φ is smooth and strictly plurisubharmonic. We show that as k-->∞, the Bergman kernels with respect to the weights φkψ have an asymptotic expansion for x,y near z, where φ(x,y) is an almost-analytic extension of &\\phi(x)=φ(x,x) and similarly for ψ. Further, . If in addition Ω is of finite type, φ,ψ behave reasonably at the boundary, and - log φ, - log ψ are strictly plurisubharmonic on Ω, we obtain also an analogous asymptotic expansion for the Berezin transform and give applications to the Berezin quantization. Finally, for Ω smoothly bounded and strictly pseudoconvex and φ a smooth strictly plurisubharmonic defining function for Ω, we also obtain results on the Berezin-Toeplitz quantization.

Note: Fully integrated 3.2 Gbps quantum random number generator with real-time extraction

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Xiao-Guang; Nie, You-Qi; Liang, Hao

2016-07-15

We present a real-time and fully integrated quantum random number generator (QRNG) by measuring laser phase fluctuations. The QRNG scheme based on laser phase fluctuations is featured for its capability of generating ultra-high-speed random numbers. However, the speed bottleneck of a practical QRNG lies on the limited speed of randomness extraction. To close the gap between the fast randomness generation and the slow post-processing, we propose a pipeline extraction algorithm based on Toeplitz matrix hashing and implement it in a high-speed field-programmable gate array. Further, all the QRNG components are integrated into a module, including a compact and actively stabilizedmore » interferometer, high-speed data acquisition, and real-time data post-processing and transmission. The final generation rate of the QRNG module with real-time extraction can reach 3.2 Gbps.« less

High-Speed Device-Independent Quantum Random Number Generation without a Detection Loophole.

PubMed

Liu, Yang; Yuan, Xiao; Li, Ming-Han; Zhang, Weijun; Zhao, Qi; Zhong, Jiaqiang; Cao, Yuan; Li, Yu-Huai; Chen, Luo-Kan; Li, Hao; Peng, Tianyi; Chen, Yu-Ao; Peng, Cheng-Zhi; Shi, Sheng-Cai; Wang, Zhen; You, Lixing; Ma, Xiongfeng; Fan, Jingyun; Zhang, Qiang; Pan, Jian-Wei

2018-01-05

Quantum mechanics provides the means of generating genuine randomness that is impossible with deterministic classical processes. Remarkably, the unpredictability of randomness can be certified in a manner that is independent of implementation devices. Here, we present an experimental study of device-independent quantum random number generation based on a detection-loophole-free Bell test with entangled photons. In the randomness analysis, without the independent identical distribution assumption, we consider the worst case scenario that the adversary launches the most powerful attacks against the quantum adversary. After considering statistical fluctuations and applying an 80  Gb×45.6  Mb Toeplitz matrix hashing, we achieve a final random bit rate of 114  bits/s, with a failure probability less than 10^{-5}. This marks a critical step towards realistic applications in cryptography and fundamental physics tests.

Speed-up of the volumetric method of moments for the approximate RCS of large arbitrary-shaped dielectric targets

NASA Astrophysics Data System (ADS)

Moreno, Javier; Somolinos, Álvaro; Romero, Gustavo; González, Iván; Cátedra, Felipe

2017-08-01

A method for the rigorous computation of the electromagnetic scattering of large dielectric volumes is presented. One goal is to simplify the analysis of large dielectric targets with translational symmetries taken advantage of their Toeplitz symmetry. Then, the matrix-fill stage of the Method of Moments is efficiently obtained because the number of coupling terms to compute is reduced. The Multilevel Fast Multipole Method is applied to solve the problem. Structured meshes are obtained efficiently to approximate the dielectric volumes. The regular mesh grid is achieved by using parallelepipeds whose centres have been identified as internal to the target. The ray casting algorithm is used to classify the parallelepiped centres. It may become a bottleneck when too many points are evaluated in volumes defined by parametric surfaces, so a hierarchical algorithm is proposed to minimize the number of evaluations. Measurements and analytical results are included for validation purposes.

More IMPATIENT: A Gridding-Accelerated Toeplitz-based Strategy for Non-Cartesian High-Resolution 3D MRI on GPUs

PubMed Central

Gai, Jiading; Obeid, Nady; Holtrop, Joseph L.; Wu, Xiao-Long; Lam, Fan; Fu, Maojing; Haldar, Justin P.; Hwu, Wen-mei W.; Liang, Zhi-Pei; Sutton, Bradley P.

2013-01-01

Several recent methods have been proposed to obtain significant speed-ups in MRI image reconstruction by leveraging the computational power of GPUs. Previously, we implemented a GPU-based image reconstruction technique called the Illinois Massively Parallel Acquisition Toolkit for Image reconstruction with ENhanced Throughput in MRI (IMPATIENT MRI) for reconstructing data collected along arbitrary 3D trajectories. In this paper, we improve IMPATIENT by removing computational bottlenecks by using a gridding approach to accelerate the computation of various data structures needed by the previous routine. Further, we enhance the routine with capabilities for off-resonance correction and multi-sensor parallel imaging reconstruction. Through implementation of optimized gridding into our iterative reconstruction scheme, speed-ups of more than a factor of 200 are provided in the improved GPU implementation compared to the previous accelerated GPU code. PMID:23682203

Color model and method for video fire flame and smoke detection using Fisher linear discriminant

NASA Astrophysics Data System (ADS)

Wei, Yuan; Jie, Li; Jun, Fang; Yongming, Zhang

2013-02-01

Video fire detection is playing an increasingly important role in our life. But recent research is often based on a traditional RGB color model used to analyze the flame, which may be not the optimal color space for fire recognition. It is worse when we research smoke simply using gray images instead of color ones. We clarify the importance of color information for fire detection. We present a fire discriminant color (FDC) model for flame or smoke recognition based on color images. The FDC models aim to unify fire color image representation and fire recognition task into one framework. With the definition of between-class scatter matrices and within-class scatter matrices of Fisher linear discriminant, the proposed models seek to obtain one color-space-transform matrix and a discriminate projection basis vector by maximizing the ratio of these two scatter matrices. First, an iterative basic algorithm is designed to get one-component color space transformed from RGB. Then, a general algorithm is extended to generate three-component color space for further improvement. Moreover, we propose a method for video fire detection based on the models using the kNN classifier. To evaluate the recognition performance, we create a database including flame, smoke, and nonfire images for training and testing. The test experiments show that the proposed model achieves a flame verification rate receiver operating characteristic (ROC I) of 97.5% at a false alarm rate (FAR) of 1.06% and a smoke verification rate (ROC II) of 91.5% at a FAR of 1.2%, and lots of fire video experiments demonstrate that our method reaches a high accuracy for fire recognition.

lme4qtl: linear mixed models with flexible covariance structure for genetic studies of related individuals.

PubMed

Ziyatdinov, Andrey; Vázquez-Santiago, Miquel; Brunel, Helena; Martinez-Perez, Angel; Aschard, Hugues; Soria, Jose Manuel

2018-02-27

Quantitative trait locus (QTL) mapping in genetic data often involves analysis of correlated observations, which need to be accounted for to avoid false association signals. This is commonly performed by modeling such correlations as random effects in linear mixed models (LMMs). The R package lme4 is a well-established tool that implements major LMM features using sparse matrix methods; however, it is not fully adapted for QTL mapping association and linkage studies. In particular, two LMM features are lacking in the base version of lme4: the definition of random effects by custom covariance matrices; and parameter constraints, which are essential in advanced QTL models. Apart from applications in linkage studies of related individuals, such functionalities are of high interest for association studies in situations where multiple covariance matrices need to be modeled, a scenario not covered by many genome-wide association study (GWAS) software. To address the aforementioned limitations, we developed a new R package lme4qtl as an extension of lme4. First, lme4qtl contributes new models for genetic studies within a single tool integrated with lme4 and its companion packages. Second, lme4qtl offers a flexible framework for scenarios with multiple levels of relatedness and becomes efficient when covariance matrices are sparse. We showed the value of our package using real family-based data in the Genetic Analysis of Idiopathic Thrombophilia 2 (GAIT2) project. Our software lme4qtl enables QTL mapping models with a versatile structure of random effects and efficient computation for sparse covariances. lme4qtl is available at https://github.com/variani/lme4qtl .

The construction of next-generation matrices for compartmental epidemic models.

PubMed

Diekmann, O; Heesterbeek, J A P; Roberts, M G

2010-06-06

The basic reproduction number (0) is arguably the most important quantity in infectious disease epidemiology. The next-generation matrix (NGM) is the natural basis for the definition and calculation of (0) where finitely many different categories of individuals are recognized. We clear up confusion that has been around in the literature concerning the construction of this matrix, specifically for the most frequently used so-called compartmental models. We present a detailed easy recipe for the construction of the NGM from basic ingredients derived directly from the specifications of the model. We show that two related matrices exist which we define to be the NGM with large domain and the NGM with small domain. The three matrices together reflect the range of possibilities encountered in the literature for the characterization of (0). We show how they are connected and how their construction follows from the basic model ingredients, and establish that they have the same non-zero eigenvalues, the largest of which is the basic reproduction number (0). Although we present formal recipes based on linear algebra, we encourage the construction of the NGM by way of direct epidemiological reasoning, using the clear interpretation of the elements of the NGM and of the model ingredients. We present a selection of examples as a practical guide to our methods. In the appendix we present an elementary but complete proof that (0) defined as the dominant eigenvalue of the NGM for compartmental systems and the Malthusian parameter r, the real-time exponential growth rate in the early phase of an outbreak, are connected by the properties that (0) > 1 if and only if r > 0, and (0) = 1 if and only if r = 0.

An improved method to quantitate mature plant microRNA in biological matrices using modified periodate treatment and inclusion of internal controls

PubMed Central

Roh, Jamin; Davis, Cindy D.; Wang, Thomas T. Y.

2017-01-01

MicroRNAs (miRNAs) ubiquitously exist in microorganisms, plants, and animals, and appear to modulate a wide range of critical biological processes. However, no definitive conclusion has been reached regarding the uptake of exogenous dietary small RNAs into mammalian circulation and organs and cross-kingdom regulation. One of the critical issues is our ability to assess and distinguish the origin of miRNAs. Although periodate oxidation has been used to differentiate mammalian and plant miRNAs, validation of treatment efficiency and the inclusion of proper controls for this method were lacking in previous studies. This study aimed to address: 1) the efficiency of periodate treatment in a plant or mammalian RNA matrix, and 2) the necessity of inclusion of internal controls. We designed and tested spike-in synthetic miRNAs in various plant and mammalian matrices and showed that they can be used as a control for the completion of periodate oxidation. We found that overloading the reaction system with high concentration of RNA resulted in incomplete oxidation of unmethylated miRNA. The abundant miRNAs from soy and corn were analyzed in the plasma, liver, and fecal samples of C57BL/6 mice fed a corn and soy-based chow diet using our improved methodology. The improvement resulted in the elimination of the false positive detection in the liver, and we did not detect plant miRNAs in the mouse plasma or liver samples. In summary, an improved methodology was developed for plant miRNA detection that appears to work well in different sample matrices. PMID:28399134

The construction of next-generation matrices for compartmental epidemic models

PubMed Central

Diekmann, O.; Heesterbeek, J. A. P.; Roberts, M. G.

2010-01-01

The basic reproduction number ℛ0 is arguably the most important quantity in infectious disease epidemiology. The next-generation matrix (NGM) is the natural basis for the definition and calculation of ℛ0 where finitely many different categories of individuals are recognized. We clear up confusion that has been around in the literature concerning the construction of this matrix, specifically for the most frequently used so-called compartmental models. We present a detailed easy recipe for the construction of the NGM from basic ingredients derived directly from the specifications of the model. We show that two related matrices exist which we define to be the NGM with large domain and the NGM with small domain. The three matrices together reflect the range of possibilities encountered in the literature for the characterization of ℛ0. We show how they are connected and how their construction follows from the basic model ingredients, and establish that they have the same non-zero eigenvalues, the largest of which is the basic reproduction number ℛ0. Although we present formal recipes based on linear algebra, we encourage the construction of the NGM by way of direct epidemiological reasoning, using the clear interpretation of the elements of the NGM and of the model ingredients. We present a selection of examples as a practical guide to our methods. In the appendix we present an elementary but complete proof that ℛ0 defined as the dominant eigenvalue of the NGM for compartmental systems and the Malthusian parameter r, the real-time exponential growth rate in the early phase of an outbreak, are connected by the properties that ℛ0 > 1 if and only if r > 0, and ℛ0 = 1 if and only if r = 0. PMID:19892718

Lecture Notes on Multigrid Methods

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vassilevski, P S

The Lecture Notes are primarily based on a sequence of lectures given by the author while been a Fulbright scholar at 'St. Kliment Ohridski' University of Sofia, Sofia, Bulgaria during the winter semester of 2009-2010 academic year. The notes are somewhat expanded version of the actual one semester class he taught there. The material covered is slightly modified and adapted version of similar topics covered in the author's monograph 'Multilevel Block-Factorization Preconditioners' published in 2008 by Springer. The author tried to keep the notes as self-contained as possible. That is why the lecture notes begin with some basic introductory matrix-vectormore » linear algebra, numerical PDEs (finite element) facts emphasizing the relations between functions in finite dimensional spaces and their coefficient vectors and respective norms. Then, some additional facts on the implementation of finite elements based on relation tables using the popular compressed sparse row (CSR) format are given. Also, typical condition number estimates of stiffness and mass matrices, the global matrix assembly from local element matrices are given as well. Finally, some basic introductory facts about stationary iterative methods, such as Gauss-Seidel and its symmetrized version are presented. The introductory material ends up with the smoothing property of the classical iterative methods and the main definition of two-grid iterative methods. From here on, the second part of the notes begins which deals with the various aspects of the principal TG and the numerous versions of the MG cycles. At the end, in part III, we briefly introduce algebraic versions of MG referred to as AMG, focusing on classes of AMG specialized for finite element matrices.« less

Method development and validation for total haloxyfop analysis in infant formulas and related ingredient matrices using liquid chromatography-tandem mass spectrometry.

PubMed

Koesukwiwat, Urairat; Vaclavik, Lukas; Mastovska, Katerina

2018-05-08

According to the European Commission directive 2006/141/EC, haloxyfop residue levels should not exceed 0.003 mg/kg in ready-to-feed infant formula, and the residue definition includes sum of haloxyfop, its esters, salts, and conjugates expressed as haloxyfop. A simple method for total haloxyfop analysis in infant formula and related ingredient matrices was developed and validated using liquid chromatography-tandem mass spectrometry (LC-MS/MS). The sample preparation consisted of an alkaline hydrolysis with methanolic sodium hydroxide to release haloxyfop (parent acid) from its bound forms prior to the extraction with acetonitrile. A mixture of magnesium sulfate (MgSO 4 ) and sodium chloride (NaCl) (4:1, w/w) was added to the extract to induce phase separation and force the analyte into the upper acetonitrile-methanol layer and then a 1-mL aliquot was subsequently cleaned up by dispersive solid phase extraction with 150 mg of MgSO 4 and 50 mg of octadecyl (C 18 ) sorbent. The analytical procedure was developed and carefully optimized to enable low-level, total haloxyfop analysis in a variety of challenging matrices, including infant formulas and their important high-carbohydrate, high-protein, high-fat, and emulsifier ingredients. The final method was validated in two different laboratories by fortifying samples with haloxyfop and haloxyfop-methyl, which was used as a model compound simulating bound forms of the analyte. Mean recoveries of haloxyfop across all fortification levels and evaluated matrices ranged between 92.2 and 114% with repeatability, within-lab reproducibility, and reproducibility RSDs ≤ 14%. Based on the validation results, this method was capable to convert the haloxyfop ester into the parent acid in a wide range of sample types and to reliably identify and quantify total haloxyfop at the target 0.003 mg/kg level in infant formulas (both powdered and ready-to-feed liquid forms). Graphical abstract LC-MS/MS-based workflow for the determination of the total haloxyfop in infant formula and related ingredients.

Pointwise influence matrices for functional-response regression.

PubMed

Reiss, Philip T; Huang, Lei; Wu, Pei-Shien; Chen, Huaihou; Colcombe, Stan

2017-12-01

We extend the notion of an influence or hat matrix to regression with functional responses and scalar predictors. For responses depending linearly on a set of predictors, our definition is shown to reduce to the conventional influence matrix for linear models. The pointwise degrees of freedom, the trace of the pointwise influence matrix, are shown to have an adaptivity property that motivates a two-step bivariate smoother for modeling nonlinear dependence on a single predictor. This procedure adapts to varying complexity of the nonlinear model at different locations along the function, and thereby achieves better performance than competing tensor product smoothers in an analysis of the development of white matter microstructure in the brain. © 2017, The International Biometric Society.

Least-squares solution of incompressible Navier-Stokes equations with the p-version of finite elements

NASA Technical Reports Server (NTRS)

Jiang, Bo-Nan; Sonnad, Vijay

1991-01-01

A p-version of the least squares finite element method, based on the velocity-pressure-vorticity formulation, is developed for solving steady state incompressible viscous flow problems. The resulting system of symmetric and positive definite linear equations can be solved satisfactorily with the conjugate gradient method. In conjunction with the use of rapid operator application which avoids the formation of either element of global matrices, it is possible to achieve a highly compact and efficient solution scheme for the incompressible Navier-Stokes equations. Numerical results are presented for two-dimensional flow over a backward facing step. The effectiveness of simple outflow boundary conditions is also demonstrated.

The game of go as a complex network

NASA Astrophysics Data System (ADS)

Georgeot, B.; Giraud, O.

2012-03-01

We study the game of go from a complex network perspective. We construct a directed network using a suitable definition of tactical moves including local patterns, and study this network for different datasets of professional and amateur games. The move distribution follows Zipf's law and the network is scale free, with statistical peculiarities different from other real directed networks, such as, e.g., the World Wide Web. These specificities reflect in the outcome of ranking algorithms applied to it. The fine study of the eigenvalues and eigenvectors of matrices used by the ranking algorithms singles out certain strategic situations. Our results should pave the way to a better modelization of board games and other types of human strategic scheming.

User's manual for interactive LINEAR: A FORTRAN program to derive linear aircraft models

NASA Technical Reports Server (NTRS)

Antoniewicz, Robert F.; Duke, Eugene L.; Patterson, Brian P.

1988-01-01

An interactive FORTRAN program that provides the user with a powerful and flexible tool for the linearization of aircraft aerodynamic models is documented in this report. The program LINEAR numerically determines a linear system model using nonlinear equations of motion and a user-supplied linear or nonlinear aerodynamic model. The nonlinear equations of motion used are six-degree-of-freedom equations with stationary atmosphere and flat, nonrotating earth assumptions. The system model determined by LINEAR consists of matrices for both the state and observation equations. The program has been designed to allow easy selection and definition of the state, control, and observation variables to be used in a particular model.

QMR: A Quasi-Minimal Residual method for non-Hermitian linear systems

NASA Technical Reports Server (NTRS)

Freund, Roland W.; Nachtigal, Noel M.

1990-01-01

The biconjugate gradient (BCG) method is the natural generalization of the classical conjugate gradient algorithm for Hermitian positive definite matrices to general non-Hermitian linear systems. Unfortunately, the original BCG algorithm is susceptible to possible breakdowns and numerical instabilities. A novel BCG like approach is presented called the quasi-minimal residual (QMR) method, which overcomes the problems of BCG. An implementation of QMR based on a look-ahead version of the nonsymmetric Lanczos algorithm is proposed. It is shown how BCG iterates can be recovered stably from the QMR process. Some further properties of the QMR approach are given and an error bound is presented. Finally, numerical experiments are reported.

NASTRAN/FLEXSTAB procedure for static aeroelastic analysis

NASA Technical Reports Server (NTRS)

Schuster, L. S.

1984-01-01

Presented is a procedure for using the FLEXSTAB External Structural Influence Coefficients (ESIC) computer program to produce the structural data necessary for the FLEXSTAB Stability Derivatives and Static Stability (SD&SS) program. The SD&SS program computes trim state, stability derivatives, and pressure and deflection data for a flexible airplane having a plane of symmetry. The procedure used a NASTRAN finite-element structural model as the source of structural data in the form of flexibility matrices. Selection of a set of degrees of freedom, definition of structural nodes and panels, reordering and reformatting of the flexibility matrix, and redistribution of existing point mass data are among the topics discussed. Also discussed are boundary conditions and the NASTRAN substructuring technique.

CMV matrices in random matrix theory and integrable systems: a survey

NASA Astrophysics Data System (ADS)

Nenciu, Irina

2006-07-01

We present a survey of recent results concerning a remarkable class of unitary matrices, the CMV matrices. We are particularly interested in the role they play in the theory of random matrices and integrable systems. Throughout the paper we also emphasize the analogies and connections to Jacobi matrices.

Basal Cell Carcinoma With Matrical Differentiation: Clinicopathologic, Immunohistochemical, and Molecular Biological Study of 22 Cases.

PubMed

Kyrpychova, Liubov; Carr, Richard A; Martinek, Petr; Vanecek, Tomas; Perret, Raul; Chottová-Dvořáková, Magdalena; Zamecnik, Michal; Hadravsky, Ladislav; Michal, Michal; Kazakov, Dmitry V

2017-06-01

Basal cell carcinoma (BCC) with matrical differentiation is a fairly rare neoplasm, with about 30 cases documented mainly as isolated case reports. We studied a series of this neoplasm, including cases with an atypical matrical component, a hitherto unreported feature. Lesions coded as BCC with matrical differentiation were reviewed; 22 cases were included. Immunohistochemical studies were performed using antibodies against BerEp4, β-catenin, and epithelial membrane antigen (EMA). Molecular genetic studies using Ion AmpliSeq Cancer Hotspot Panel v2 by massively parallel sequencing on Ion Torrent PGM were performed in 2 cases with an atypical matrical component (1 was previously subjected to microdissection to sample the matrical and BCC areas separately). There were 13 male and 9 female patients, ranging in age from 41 to 89 years. Microscopically, all lesions manifested at least 2 components, a BCC area (follicular germinative differentiation) and areas with matrical differentiation. A BCC component dominated in 14 cases, whereas a matrical component dominated in 4 cases. Matrical differentiation was recognized as matrical/supramatrical cells (n=21), shadow cells (n=21), bright red trichohyaline granules (n=18), and blue-gray corneocytes (n=18). In 2 cases, matrical areas manifested cytologic atypia, and a third case exhibited an infiltrative growth pattern, with the tumor metastasizing to a lymph node. BerEP4 labeled the follicular germinative cells, whereas it was markedly reduced or negative in matrical areas. The reverse pattern was seen with β-catenin. EMA was negative in BCC areas but stained a proportion of matrical/supramatrical cells. Genetic studies revealed mutations of the following genes: CTNNB1, KIT, CDKN2A, TP53, SMAD4, ERBB4, and PTCH1, with some differences between the matrical and BCC components. It is concluded that matrical differentiation in BCC in most cases occurs as multiple foci. Rare neoplasms manifest atypia in the matrical areas. Immunohistochemical analysis for BerEP4, EMA, and β-catenin can be helpful in limited biopsy specimens. From a molecular biological prospective, BCC and matrical components appear to share some of the gene mutations but have differences in others, but this observation must be validated in a large series.

Magnetic to magnetic and kinetic to magnetic energy transfers at the top of the Earth's core

NASA Astrophysics Data System (ADS)

Huguet, Ludovic; Amit, Hagay; Alboussière, Thierry

2016-11-01

We develop the theory for the magnetic to magnetic and kinetic to magnetic energy transfer between different spherical harmonic degrees due to the interaction of fluid flow and radial magnetic field at the top of the Earth's core. We show that non-zero secular variation of the total magnetic energy could be significant and may provide evidence for the existence of stretching secular variation, which suggests the existence of radial motions at the top of the Earth's core-whole core convection or MAC waves. However, the uncertainties of the small scales of the geomagnetic field prevent a definite conclusion. Combining core field and flow models we calculate the detailed magnetic to magnetic and kinetic to magnetic energy transfer matrices. The magnetic to magnetic energy transfer shows a complex behaviour with local and non-local transfers. The spectra of magnetic to magnetic energy transfers show clear maxima and minima, suggesting an energy cascade. The kinetic to magnetic energy transfers, which are much weaker due to the weak poloidal flow, are either local or non-local between degree one and higher degrees. The patterns observed in the matrices resemble energy transfer patterns that are typically found in 3-D MHD numerical simulations.

Epileptic Seizure Detection with Log-Euclidean Gaussian Kernel-Based Sparse Representation.

PubMed

Yuan, Shasha; Zhou, Weidong; Wu, Qi; Zhang, Yanli

2016-05-01

Epileptic seizure detection plays an important role in the diagnosis of epilepsy and reducing the massive workload of reviewing electroencephalography (EEG) recordings. In this work, a novel algorithm is developed to detect seizures employing log-Euclidean Gaussian kernel-based sparse representation (SR) in long-term EEG recordings. Unlike the traditional SR for vector data in Euclidean space, the log-Euclidean Gaussian kernel-based SR framework is proposed for seizure detection in the space of the symmetric positive definite (SPD) matrices, which form a Riemannian manifold. Since the Riemannian manifold is nonlinear, the log-Euclidean Gaussian kernel function is applied to embed it into a reproducing kernel Hilbert space (RKHS) for performing SR. The EEG signals of all channels are divided into epochs and the SPD matrices representing EEG epochs are generated by covariance descriptors. Then, the testing samples are sparsely coded over the dictionary composed by training samples utilizing log-Euclidean Gaussian kernel-based SR. The classification of testing samples is achieved by computing the minimal reconstructed residuals. The proposed method is evaluated on the Freiburg EEG dataset of 21 patients and shows its notable performance on both epoch-based and event-based assessments. Moreover, this method handles multiple channels of EEG recordings synchronously which is more speedy and efficient than traditional seizure detection methods.

The next steps in Seti-Italia science and technology

NASA Astrophysics Data System (ADS)

Montebugnoli, Stelio; Cosmovici, Cristiano; Monari, Jader; Pluchino, Salvatore; Zoni, Luca; Bartolini, Marco; Orlati, Andrea; Salerno, Emma; Schillirò, Francesco; Pupillo, Giuseppe; Perini, Federico; Bianchi, Germano; Tani, Mattia; Amico, Leonardo

2010-02-01

The Italian Medicina Radioastronomy Station (nearby Bologna) is equipped with two antennas: the 32 mt (VLBI) dish and the Northern Cross, a large T-shaped parabolic/cylindrical antenna (30.000 sqm). So far Seti observations have been performed using a SERENDIP IV high resolution spectrometer connected to the VLBI dish in "piggy back" mode configuration. In order to facilitate data interpretation and to introduce innovative methods to search for possible extraterrestrial signals, we are planning to make use of the large UHF Northern Cross transit telescope. Sky observations performed at least within two months, could provide for each day a number of matrices labeled according to the observing sidereal time. The entire set of matrices will be characterized by an averaged spectrum on each row per day. Keeping constant the transit antenna declination, a coherent signal coming from a definite position of the sky, would produce a "flag on" in the same submatrix at the same sidereal time. Detections collected in this way could be considered "confirmed" since they always come from the same region of the sky and are observed regularly. An extremely powerful processing board based on a multi-FPGAs (Field Programmable Gate Array) core was developed and is now under programming. This is conceived to be the processing core for this new kind of investigations.

A Brief Historical Introduction to Matrices and Their Applications

ERIC Educational Resources Information Center

Debnath, L.

2014-01-01

This paper deals with the ancient origin of matrices, and the system of linear equations. Included are algebraic properties of matrices, determinants, linear transformations, and Cramer's Rule for solving the system of algebraic equations. Special attention is given to some special matrices, including matrices in graph theory and electrical…

Laminin active peptide/agarose matrices as multifunctional biomaterials for tissue engineering.

PubMed

Yamada, Yuji; Hozumi, Kentaro; Aso, Akihiro; Hotta, Atsushi; Toma, Kazunori; Katagiri, Fumihiko; Kikkawa, Yamato; Nomizu, Motoyoshi

2012-06-01

Cell adhesive peptides derived from extracellular matrix components are potential candidates to afford bio-adhesiveness to cell culture scaffolds for tissue engineering. Previously, we covalently conjugated bioactive laminin peptides to polysaccharides, such as chitosan and alginate, and demonstrated their advantages as biomaterials. Here, we prepared functional polysaccharide matrices by mixing laminin active peptides and agarose gel. Several laminin peptide/agarose matrices showed cell attachment activity. In particular, peptide AG73 (RKRLQVQLSIRT)/agarose matrices promoted strong cell attachment and the cell behavior depended on the stiffness of agarose matrices. Fibroblasts formed spheroid structures on the soft AG73/agarose matrices while the cells formed a monolayer with elongated morphologies on the stiff matrices. On the stiff AG73/agarose matrices, neuronal cells extended neuritic processes and endothelial cells formed capillary-like networks. In addition, salivary gland cells formed acini-like structures on the soft matrices. These results suggest that the peptide/agarose matrices are useful for both two- and three-dimensional cell culture systems as a multifunctional biomaterial for tissue engineering. Copyright © 2012 Elsevier Ltd. All rights reserved.

Miscellaneous methods for measuring matric or water potential

USGS Publications Warehouse

Scanlon, Bridget R.; Andraski, Brian J.; Bilskie, Jim; Dane, Jacob H.; Topp, G. Clarke

2002-01-01

A variety of techniques to measure matric potential or water potential in the laboratory and in the field are described in this section. The techniques described herein require equilibration of some medium whose matric or water potential can be determined from previous calibration or can be measured directly. Under equilibrium conditions the matric or water potential of the medium is equal to that of the soil. The techniques can be divided into: (i) those that measure matric potential and (ii) those that measure water potential (sum of matric and osmotic potentials). Matric potential is determined when the sensor matrix is in direct contact with the soil, so salts are free to diffuse in or out of the sensor matrix, and the equilibrium measurement therefore reflects matric forces acting on the water. Water potential is determined when the sensor is separated from the soil by a vapor gap, so salts are not free to move in or out of the sensor, and the equilibrium measurement reflects the sum of the matric and osmotic forces acting on the water.Seven different techniques are described in this section. Those that measure matric potential include (i) heat dissipation sensors, (ii) electrical resistance sensors, (iii) frequency domain and time domain sensors, and (iv) electro-optical switches. A method that can be used to measure matric potential or water potential is the (v) filter paper method. Techniques that measure water potential include (vi) the Dew Point Potentiameter (Decagon Devices, Inc., Pullman, WA1) (water activity meter) and (vii) vapor equilibration.The first four techniques are electronically based methods for measuring matric potential. Heat dissipation sensors and electrical resistance sensors infer matric potential from previously determined calibration relations between sensor heat dissipation or electrical resistance and matric potential. Frequency-domain and timedomain matric potential sensors measure water content, which is related to matric potential of the sensor through calibration. Electro-optical switches measure changes in light transmission through thin, nylon filters as they absorb or desorb water in response to changes in matric potential. Heat dissipation sensors and electrical resistance sensors are used primarily in the field to provide information on matric potential. Frequency domain matric potential sensors are new and have not been widely used. Time domain matric potential sensors and electro-optical switches are new and have not been commercialized. For the fifth technique, filter paper is used as the standard matrix. The filter paper technique measures matric potential when the filter paper is in direct contact with soil or water potential when separated from soil by a vapor gap. The Dew Point Potentiameter calculates water potential from the measured dew point and sample temperature. The vapor equilibration technique involves equilibration of soil samples with salt solutions of known osmotic potential. The filter paper, Dew Point Potentiameter, and vapor equilibration techniques are generally used in the laboratory to measure water potential of disturbed field samples or to measure water potential for water retention functions.

Genetic code, hamming distance and stochastic matrices.

PubMed

He, Matthew X; Petoukhov, Sergei V; Ricci, Paolo E

2004-09-01

In this paper we use the Gray code representation of the genetic code C=00, U=10, G=11 and A=01 (C pairs with G, A pairs with U) to generate a sequence of genetic code-based matrices. In connection with these code-based matrices, we use the Hamming distance to generate a sequence of numerical matrices. We then further investigate the properties of the numerical matrices and show that they are doubly stochastic and symmetric. We determine the frequency distributions of the Hamming distances, building blocks of the matrices, decomposition and iterations of matrices. We present an explicit decomposition formula for the genetic code-based matrix in terms of permutation matrices, which provides a hypercube representation of the genetic code. It is also observed that there is a Hamiltonian cycle in a genetic code-based hypercube.

A network function-based definition of communities in complex networks.

PubMed

Chauhan, Sanjeev; Girvan, Michelle; Ott, Edward

2012-09-01

We consider an alternate definition of community structure that is functionally motivated. We define network community structure based on the function the network system is intended to perform. In particular, as a specific example of this approach, we consider communities whose function is enhanced by the ability to synchronize and/or by resilience to node failures. Previous work has shown that, in many cases, the largest eigenvalue of the network's adjacency matrix controls the onset of both synchronization and percolation processes. Thus, for networks whose functional performance is dependent on these processes, we propose a method that divides a given network into communities based on maximizing a function of the largest eigenvalues of the adjacency matrices of the resulting communities. We also explore the differences between the partitions obtained by our method and the modularity approach (which is based solely on consideration of network structure). We do this for several different classes of networks. We find that, in many cases, modularity-based partitions do almost as well as our function-based method in finding functional communities, even though modularity does not specifically incorporate consideration of function.

Stochastic process approximation for recursive estimation with guaranteed bound on the error covariance

NASA Technical Reports Server (NTRS)

Menga, G.

1975-01-01

An approach, is proposed for the design of approximate, fixed order, discrete time realizations of stochastic processes from the output covariance over a finite time interval, was proposed. No restrictive assumptions are imposed on the process; it can be nonstationary and lead to a high dimension realization. Classes of fixed order models are defined, having the joint covariance matrix of the combined vector of the outputs in the interval of definition greater or equal than the process covariance; (the difference matrix is nonnegative definite). The design is achieved by minimizing, in one of those classes, a measure of the approximation between the model and the process evaluated by the trace of the difference of the respective covariance matrices. Models belonging to these classes have the notable property that, under the same measurement system and estimator structure, the output estimation error covariance matrix computed on the model is an upper bound of the corresponding covariance on the real process. An application of the approach is illustrated by the modeling of random meteorological wind profiles from the statistical analysis of historical data.

Cell-adhesive RGD peptide-displaying M13 bacteriophage/PLGA nanofiber matrices for growth of fibroblasts.

PubMed

Shin, Yong Cheol; Lee, Jong Ho; Jin, Linhua; Kim, Min Jeong; Oh, Jin-Woo; Kim, Tai Wan; Han, Dong-Wook

2014-01-01

M13 bacteriophages can be readily fabricated as nanofibers due to non-toxic bacterial virus with a nanofiber-like shape. In the present study, we prepared hybrid nanofiber matrices composed of poly(lactic-co-glycolic acid, PLGA) and M13 bacteriophages which were genetically modified to display the RGD peptide on their surface (RGD-M13 phage). The surface morphology and chemical composition of hybrid nanofiber matrices were characterized by scanning electron microscopy (SEM) and Raman spectroscopy, respectively. Immunofluorescence staining was conducted to investigate the existence of M13 bacteriophages in RGD-M13 phage/PLGA hybrid nanofibers. In addition, the attachment and proliferation of three different types of fibroblasts on RGD-M13 phage/PLGA nanofiber matrices were evaluated to explore how fibroblasts interact with these matrices. SEM images showed that RGD-M13 phage/PLGA hybrid matrices had the non-woven porous structure, quite similar to that of natural extracellular matrices, having an average fiber diameter of about 190 nm. Immunofluorescence images and Raman spectra revealed that RGD-M13 phages were homogeneously distributed in entire matrices. Moreover, the attachment and proliferation of fibroblasts cultured on RGD-M13 phage/PLGA matrices were significantly enhanced due to enriched RGD moieties on hybrid matrices. These results suggest that RGD-M13 phage/PLGA matrices can be efficiently used as biomimetic scaffolds for tissue engineering applications.

Bayes linear covariance matrix adjustment

NASA Astrophysics Data System (ADS)

Wilkinson, Darren J.

1995-12-01

In this thesis, a Bayes linear methodology for the adjustment of covariance matrices is presented and discussed. A geometric framework for quantifying uncertainties about covariance matrices is set up, and an inner-product for spaces of random matrices is motivated and constructed. The inner-product on this space captures aspects of our beliefs about the relationship between covariance matrices of interest to us, providing a structure rich enough for us to adjust beliefs about unknown matrices in the light of data such as sample covariance matrices, exploiting second-order exchangeability and related specifications to obtain representations allowing analysis. Adjustment is associated with orthogonal projection, and illustrated with examples of adjustments for some common problems. The problem of adjusting the covariance matrices underlying exchangeable random vectors is tackled and discussed. Learning about the covariance matrices associated with multivariate time series dynamic linear models is shown to be amenable to a similar approach. Diagnostics for matrix adjustments are also discussed.

Studies of social group dynamics under isolated conditions. Objective summary of the literature as it relates to potential problems of long duration space flight

NASA Technical Reports Server (NTRS)

Vinograd, S. P.

1974-01-01

Scientific literature which deals with the study of human behavior and crew interaction in situations simulating long term space flight is summarized and organized. A bibliography of all the pertinent U.S. literature available is included, along with definitions of the behavioral characteristics terms employed. The summarized studies are analyzed according to behavioral factors and environmental conditions. The analysis consist of two matrices. (1) The matrix of factors studied correlates each research study area and individual study with the behavioral factors that were investigated in the study. (2) The matrix of conclusions identifies those studies whose investigators appeared to draw specific conclusions concerning questions of importance to NASA.

Neutrino Masses, Cosmological Bound and Four Zero Yukawa Textures

NASA Astrophysics Data System (ADS)

Adhikary, Biswajit; Ghosal, Ambar; Roy, Probir

Four zero neutrino Yukawa textures in a specified weak basis, combined with μτ symmetry and type-I seesaw, yield a highly constrained and predictive scheme. Two alternately viable 3×3 light neutrino Majorana mass matrices mνA/mνB result with inverted/normal mass ordering. Neutrino masses, Majorana in character and predicted within definite ranges with laboratory and cosmological inputs, will have their sum probed cosmologically. The rate for 0νββ decay, though generally below the reach of planned experiments, could approach it in some parameter region. Departure from μτ symmetry due to RG evolution from a high scale and consequent CP violation, with a Jarlskog invariant whose magnitude could almost reach 6×10-3, are explored.

An automated approach to the design of decision tree classifiers

NASA Technical Reports Server (NTRS)

Argentiero, P.; Chin, R.; Beaudet, P.

1982-01-01

An automated technique is presented for designing effective decision tree classifiers predicated only on a priori class statistics. The procedure relies on linear feature extractions and Bayes table look-up decision rules. Associated error matrices are computed and utilized to provide an optimal design of the decision tree at each so-called 'node'. A by-product of this procedure is a simple algorithm for computing the global probability of correct classification assuming the statistical independence of the decision rules. Attention is given to a more precise definition of decision tree classification, the mathematical details on the technique for automated decision tree design, and an example of a simple application of the procedure using class statistics acquired from an actual Landsat scene.

TEQUEL: The query language of SADDLE

NASA Technical Reports Server (NTRS)

Rajan, S. D.

1984-01-01

A relational database management system is presented that is tailored for engineering applications. A wide variety of engineering data types are supported and the data definition language (DDL) and data manipulation language (DML) are extended to handle matrices. The system can be used either in the standalone mode or through a FORTRAN or PASCAL application program. The query language is of the relational calculus type and allows the user to store, retrieve, update and delete tuples from relations. The relational operations including union, intersect and differ facilitate creation of temporary relations that can be used for manipulating information in a powerful manner. Sample applications are shown to illustrate the creation of data through a FORTRAN program and data manipulation using the TEQUEL DML.

Amorphic complexity

NASA Astrophysics Data System (ADS)

Fuhrmann, G.; Gröger, M.; Jäger, T.

2016-02-01

We introduce amorphic complexity as a new topological invariant that measures the complexity of dynamical systems in the regime of zero entropy. Its main purpose is to detect the very onset of disorder in the asymptotic behaviour. For instance, it gives positive value to Denjoy examples on the circle and Sturmian subshifts, while being zero for all isometries and Morse-Smale systems. After discussing basic properties and examples, we show that amorphic complexity and the underlying asymptotic separation numbers can be used to distinguish almost automorphic minimal systems from equicontinuous ones. For symbolic systems, amorphic complexity equals the box dimension of the associated Besicovitch space. In this context, we concentrate on regular Toeplitz flows and give a detailed description of the relation to the scaling behaviour of the densities of the p-skeletons. Finally, we take a look at strange non-chaotic attractors appearing in so-called pinched skew product systems. Continuous-time systems, more general group actions and the application to cut and project quasicrystals will be treated in subsequent work.

Implementation of polyatomic MCTDHF capability

NASA Astrophysics Data System (ADS)

Haxton, Daniel; Jones, Jeremiah; Rescigno, Thomas; McCurdy, C. William; Ibrahim, Khaled; Williams, Sam; Vecharynski, Eugene; Rouet, Francois-Henry; Li, Xiaoye; Yang, Chao

2015-05-01

The implementation of the Multiconfiguration Time-Dependent Hartree-Fock method for poly- atomic molecules using a cartesian product grid of sinc basis functions will be discussed. The focus will be on two key components of the method: first, the use of a resolution-of-the-identity approximation; sec- ond, the use of established techniques for triple Toeplitz matrix algebra using fast Fourier transform over distributed memory architectures (MPI 3D FFT). The scaling of two-electron matrix element transformations is converted from O(N4) to O(N log N) by including these components. Here N = n3, with n the number of points on a side. We test the prelim- inary implementation by calculating absorption spectra of small hydro- carbons, using approximately 16-512 points on a side. This work is supported by the U.S. Department of Energy, Office of Science, Office of Basic Energy Sciences, under the Early Career program, and by the offices of BES and Advanced Scientific Computing Research, under the SciDAC program.

Embedding Dimension Selection for Adaptive Singular Spectrum Analysis of EEG Signal.

PubMed

Xu, Shanzhi; Hu, Hai; Ji, Linhong; Wang, Peng

2018-02-26

The recorded electroencephalography (EEG) signal is often contaminated with different kinds of artifacts and noise. Singular spectrum analysis (SSA) is a powerful tool for extracting the brain rhythm from a noisy EEG signal. By analyzing the frequency characteristics of the reconstructed component (RC) and the change rate in the trace of the Toeplitz matrix, it is demonstrated that the embedding dimension is related to the frequency bandwidth of each reconstructed component, in consistence with the component mixing in the singular value decomposition step. A method for selecting the embedding dimension is thereby proposed and verified by simulated EEG signal based on the Markov Process Amplitude (MPA) EEG Model. Real EEG signal is also collected from the experimental subjects under both eyes-open and eyes-closed conditions. The experimental results show that based on the embedding dimension selection method, the alpha rhythm can be extracted from the real EEG signal by the adaptive SSA, which can be effectively utilized to distinguish between the eyes-open and eyes-closed states.

A Simple Deep Learning Method for Neuronal Spike Sorting

NASA Astrophysics Data System (ADS)

Yang, Kai; Wu, Haifeng; Zeng, Yu

2017-10-01

Spike sorting is one of key technique to understand brain activity. With the development of modern electrophysiology technology, some recent multi-electrode technologies have been able to record the activity of thousands of neuronal spikes simultaneously. The spike sorting in this case will increase the computational complexity of conventional sorting algorithms. In this paper, we will focus spike sorting on how to reduce the complexity, and introduce a deep learning algorithm, principal component analysis network (PCANet) to spike sorting. The introduced method starts from a conventional model and establish a Toeplitz matrix. Through the column vectors in the matrix, we trains a PCANet, where some eigenvalue vectors of spikes could be extracted. Finally, support vector machine (SVM) is used to sort spikes. In experiments, we choose two groups of simulated data from public databases availably and compare this introduced method with conventional methods. The results indicate that the introduced method indeed has lower complexity with the same sorting errors as the conventional methods.

Use of job-exposure matrices to estimate occupational exposure to pesticides: A review.

PubMed

Carles, Camille; Bouvier, Ghislaine; Lebailly, Pierre; Baldi, Isabelle

2017-03-01

The health effects of pesticides have been extensively studied in epidemiology, mainly in agricultural populations. However, pesticide exposure assessment remains a key methodological issue for epidemiological studies. Besides self-reported information, expert assessment or metrology, job-exposure matrices still appear to be an interesting tool. We reviewed all existing matrices assessing occupational exposure to pesticides in epidemiological studies and described the exposure parameters they included. We identified two types of matrices, (i) generic ones that are generally used in case-control studies and document broad categories of pesticides in a large range of jobs, and (ii) specific matrices, developed for use in agricultural cohorts, that generally provide exposure metrics at the active ingredient level. The various applications of these matrices in epidemiological studies have proven that they are valuable tools to assess pesticide exposure. Specific matrices are particularly promising for use in agricultural cohorts. However, results obtained with matrices have rarely been compared with those obtained with other tools. In addition, the external validity of the given estimates has not been adequately discussed. Yet, matrices would help in reducing misclassification and in quantifying cumulated exposures, to improve knowledge about the chronic health effects of pesticides.

Stochastic local operations and classical communication (SLOCC) and local unitary operations (LU) classifications of n qubits via ranks and singular values of the spin-flipping matrices

NASA Astrophysics Data System (ADS)

Li, Dafa

2018-06-01

We construct ℓ -spin-flipping matrices from the coefficient matrices of pure states of n qubits and show that the ℓ -spin-flipping matrices are congruent and unitary congruent whenever two pure states of n qubits are SLOCC and LU equivalent, respectively. The congruence implies the invariance of ranks of the ℓ -spin-flipping matrices under SLOCC and then permits a reduction of SLOCC classification of n qubits to calculation of ranks of the ℓ -spin-flipping matrices. The unitary congruence implies the invariance of singular values of the ℓ -spin-flipping matrices under LU and then permits a reduction of LU classification of n qubits to calculation of singular values of the ℓ -spin-flipping matrices. Furthermore, we show that the invariance of singular values of the ℓ -spin-flipping matrices Ω 1^{(n)} implies the invariance of the concurrence for even n qubits and the invariance of the n-tangle for odd n qubits. Thus, the concurrence and the n-tangle can be used for LU classification and computing the concurrence and the n-tangle only performs additions and multiplications of coefficients of states.

Matrix computations in MACSYMA

NASA Technical Reports Server (NTRS)

Wang, P. S.

1977-01-01

Facilities built into MACSYMA for manipulating matrices with numeric or symbolic entries are described. Computations will be done exactly, keeping symbols as symbols. Topics discussed include how to form a matrix and create other matrices by transforming existing matrices within MACSYMA; arithmetic and other computation with matrices; and user control of computational processes through the use of optional variables. Two algorithms designed for sparse matrices are given. The computing times of several different ways to compute the determinant of a matrix are compared.

Complex symmetric matrices with strongly stable iterates

NASA Technical Reports Server (NTRS)

Tadmor, E.

1985-01-01

Complex-valued symmetric matrices are studied. A simple expression for the spectral norm of such matrices is obtained, by utilizing a unitarily congruent invariant form. A sharp criterion is provided for identifying those symmetric matrices whose spectral norm is not exceeding one: such strongly stable matrices are usually sought in connection with convergent difference approximations to partial differential equations. As an example, the derived criterion is applied to conclude the strong stability of a Lax-Wendroff scheme.

Calculation of controllability and observability matrices for special case of continuous-time multi-order fractional systems.

PubMed

Hassanzadeh, Iman; Tabatabaei, Mohammad

2017-03-28

In this paper, controllability and observability matrices for pseudo upper or lower triangular multi-order fractional systems are derived. It is demonstrated that these systems are controllable and observable if and only if their controllability and observability matrices are full rank. In other words, the rank of these matrices should be equal to the inner dimension of their corresponding state space realizations. To reduce the computational complexities, these matrices are converted to simplified matrices with smaller dimensions. Numerical examples are provided to show the usefulness of the mentioned matrices for controllability and observability analysis of this case of multi-order fractional systems. These examples clarify that the duality concept is not necessarily true for these special systems. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Variations on a theme of Heisenberg, Pauli and Weyl

NASA Astrophysics Data System (ADS)

Kibler, Maurice R.

2008-09-01

The parentage between Weyl pairs, the generalized Pauli group and the unitary group is investigated in detail. We start from an abstract definition of the Heisenberg-Weyl group on the field {\\bb R} and then switch to the discrete Heisenberg-Weyl group or generalized Pauli group on a finite ring {\\bb Z}_d . The main characteristics of the latter group, an abstract group of order d3 noted Pd, are given (conjugacy classes and irreducible representation classes or equivalently Lie algebra of dimension d3 associated with Pd). Leaving the abstract sector, a set of Weyl pairs in dimension d is derived from a polar decomposition of SU(2) closely connected to angular momentum theory. Then, a realization of the generalized Pauli group Pd and the construction of generalized Pauli matrices in dimension d are revisited in terms of Weyl pairs. Finally, the Lie algebra of the unitary group U(d) is obtained as a subalgebra of the Lie algebra associated with Pd. This leads to a development of the Lie algebra of U(d) in a basis consisting of d2 generalized Pauli matrices. In the case where d is a power of a prime integer, the Lie algebra of SU(d) can be decomposed into d - 1 Cartan subalgebras. Dedicated to the memory of my teacher and friend Moshé Flato on the occasion of the tenth anniversary of his death.

Guaranteed cost control with poles assignment for a flexible air-breathing hypersonic vehicle

NASA Astrophysics Data System (ADS)

Li, Hongyi; Si, Yulin; Wu, Ligang; Hu, Xiaoxiang; Gao, Huijun

2011-05-01

This article investigates the problem of guaranteed cost control for a flexible air-breathing hypersonic vehicle (FAHV). The FAHV includes intricate coupling between the engine and flight dynamics as well as complex interplay between flexible and rigid modes, which results in an intractable system for the control design. A longitudinal model is adopted for control design due to the complexity of the vehicle. First, for a highly nonlinear and coupled FAHV, a linearised model is established around the trim condition, which includes the state of altitude, velocity, angle of attack, pitch angle and pitch rate, etc. Secondly, by using the Lyapunov approach, performance analysis is carried out for the resulting closed-loop FAHV system, whose criterion with respect to guaranteed performance cost and poles assignment is expressed in the framework of linear matrix inequalities (LMIs). The established criterion exhibits a kind of decoupling between the Lyapunov positive-definite matrices to be determined and the FAHV system matrices, which is enabled by the introduction of additional slack matrix variables. Thirdly, a convex optimisation problem with LMI constraints is formulated for designing an admissible controller, which guarantees a prescribed performance cost with the simultaneous consideration of poles assignment for the resulting closed-loop system. Finally, some simulation results are provided to show that the guaranteed cost controller could assign the poles into the desired regional and achieve excellent reference altitude and velocity tracking performance.

Decision Matrices: Tools to Enhance Middle School Engineering Instruction

ERIC Educational Resources Information Center

Gonczi, Amanda L.; Bergman, Brenda G.; Huntoon, Jackie; Allen, Robin; McIntyre, Barb; Turner, Sheri; Davis, Jen; Handler, Rob

2017-01-01

Decision matrices are valuable engineering tools. They allow engineers to objectively examine solution options. Decision matrices can be incorporated in K-12 classrooms to support authentic engineering instruction. In this article we provide examples of how decision matrices have been incorporated into 6th and 7th grade classrooms as part of an…

19 CFR 10.90 - Master records and metal matrices.

Code of Federal Regulations, 2011 CFR

2011-04-01

... 19 Customs Duties 1 2011-04-01 2011-04-01 false Master records and metal matrices. 10.90 Section... Master Records, and Metal Matrices § 10.90 Master records and metal matrices. (a) Consumption entries... made, of each master record or metal matrix covered thereby. (c) A bond on Customs Form 301, containing...

19 CFR 10.90 - Master records and metal matrices.

Code of Federal Regulations, 2013 CFR

2013-04-01

... 19 Customs Duties 1 2013-04-01 2013-04-01 false Master records and metal matrices. 10.90 Section... Master Records, and Metal Matrices § 10.90 Master records and metal matrices. (a) Consumption entries... made, of each master record or metal matrix covered thereby. (c) A bond on Customs Form 301, containing...

19 CFR 10.90 - Master records and metal matrices.

Code of Federal Regulations, 2014 CFR

2014-04-01

... 19 Customs Duties 1 2014-04-01 2014-04-01 false Master records and metal matrices. 10.90 Section... Master Records, and Metal Matrices § 10.90 Master records and metal matrices. (a) Consumption entries... made, of each master record or metal matrix covered thereby. (c) A bond on Customs Form 301, containing...

19 CFR 10.90 - Master records and metal matrices.

Code of Federal Regulations, 2012 CFR

2012-04-01

... 19 Customs Duties 1 2012-04-01 2012-04-01 false Master records and metal matrices. 10.90 Section... Master Records, and Metal Matrices § 10.90 Master records and metal matrices. (a) Consumption entries... made, of each master record or metal matrix covered thereby. (c) A bond on Customs Form 301, containing...

19 CFR 10.90 - Master records and metal matrices.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 19 Customs Duties 1 2010-04-01 2010-04-01 false Master records and metal matrices. 10.90 Section... Master Records, and Metal Matrices § 10.90 Master records and metal matrices. (a) Consumption entries... made, of each master record or metal matrix covered thereby. (c) A bond on Customs Form 301, containing...

Crosslinked type II collagen matrices: preparation, characterization, and potential for cartilage engineering.

PubMed

Pieper, J S; van der Kraan, P M; Hafmans, T; Kamp, J; Buma, P; van Susante, J L C; van den Berg, W B; Veerkamp, J H; van Kuppevelt, T H

2002-08-01

The limited intrinsic repair capacity of articular cartilage has stimulated continuing efforts to develop tissue engineered analogues. Matrices composed of type II collagen and chondroitin sulfate (CS), the major constituents of hyaline cartilage, may create an appropriate environment for the generation of cartilage-like tissue. In this study, we prepared, characterized, and evaluated type 11 collagen matrices with and without CS. Type II collagen matrices were prepared using purified, pepsin-treated, type II collagen. Techniques applied to prepare type I collagen matrices were found unsuitable for type II collagen. Crosslinking of collagen and covalent attachment of CS was performed using 1-ethyl-3-(3-dimethyl aminopropyl)carbodiimide. Porous matrices were prepared by freezing and lyophilization, and their physico-chemical characteristics (degree of crosslinking, denaturing temperature, collagenase-resistance, amount of CS incorporated) established. Matrices were evaluated for their capacity to sustain chondrocyte proliferation and differentiation in vitro. After 7 d of culture, chondrocytes were mainly located at the periphery of the matrices. In contrast to type I collagen, type II collagen supported the distribution of cells throughout the matrix. After 14 d of culture, matrices were surfaced with a cartilagenous-like layer, and occasionally clusters of chondrocytes were present inside the matrix. Chondrocytes proliferated and differentiated as indicated by biochemical analyses, ultrastructural observations, and reverse transcriptase PCR for collagen types I, II and X. No major differences were observed with respect to the presence or absence of CS in the matrices.

Matrices. New Topics for Secondary School Mathematics: Materials and Software.

ERIC Educational Resources Information Center

North Carolina School of Science and Mathematics. Dept. of Mathematics and Computer Science.

This material on matrices is part of "Introduction to College Mathematics" (ICM), designed to prepare high school students who have students who have completed algebra II for the variety of mathematics they will encounter in college and beyond. The concept goals of this unit are to use matrices to model real-world phenomena, to use matrices as…

Rhotrix Vector Spaces

ERIC Educational Resources Information Center

Aminu, Abdulhadi

2010-01-01

By rhotrix we understand an object that lies in some way between (n x n)-dimensional matrices and (2n - 1) x (2n - 1)-dimensional matrices. Representation of vectors in rhotrices is different from the representation of vectors in matrices. A number of vector spaces in matrices and their properties are known. On the other hand, little seems to be…

Commutative semigroups of real and complex matrices. [with use of the jordan form

NASA Technical Reports Server (NTRS)

Brown, D. R.

1974-01-01

The computation of divergence is studied. Covariance matrices to be analyzed admit a common diagonalization, or even triangulation. Sufficient conditions are given for such phenomena to take place, the arguments cover both real and complex matrices, and are not restricted to Hermotian or other special forms. Specifically, it is shown to be sufficient that the matrices in question commute in order to admit a common triangulation. Several results hold in the case that the matrices in question form a closed and bounded set, rather than only in the finite case.

Field matric potential sensor

DOEpatents

Hubbell, Joel M.; Sisson, James B.

2001-01-01

A method of determining matric potential of a sample, the method comprising placing the sample in a container, the container having an opening; and contacting the sample with a tensiometer via the opening. An apparatus for determining matric potential of a sample, the apparatus comprising a housing configured to receive a sample; a portable matric potential sensing device extending into the housing and having a porous member; and a wall closing the housing to insulate the sample and at least a portion of the matric potential sensing device including the porous member.

Maple procedures for the coupling of angular momenta. IX. Wigner D-functions and rotation matrices

NASA Astrophysics Data System (ADS)

Pagaran, J.; Fritzsche, S.; Gaigalas, G.

2006-04-01

The Wigner D-functions, Dpqj(α,β,γ), are known for their frequent use in quantum mechanics. Defined as the matrix elements of the rotation operator Rˆ(α,β,γ) in R and parametrized in terms of the three Euler angles α, β, and γ, these functions arise not only in the transformation of tensor components under the rotation of the coordinates, but also as the eigenfunctions of the spherical top. In practice, however, the use of the Wigner D-functions is not always that simple, in particular, if expressions in terms of these and other functions from the theory of angular momentum need to be simplified before some computations can be carried out in detail. To facilitate the manipulation of such Racah expressions, here we present an extension to the RACAH program [S. Fritzsche, Comput. Phys. Comm. 103 (1997) 51] in which the properties and the algebraic rules of the Wigner D-functions and reduced rotation matrices are implemented. Care has been taken to combine the standard knowledge about the rotation matrices with the previously implemented rules for the Clebsch-Gordan coefficients, Wigner n-j symbols, and the spherical harmonics. Moreover, the application of the program has been illustrated below by means of three examples. Program summaryTitle of program:RACAH Catalogue identifier:ADFv_9_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADFv_9_0 Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Catalogue identifier of previous version: ADFW, ADHW, title RACAH Journal reference of previous version(s): S. Fritzsche, Comput. Phys. Comm. 103 (1997) 51; S. Fritzsche, S. Varga, D. Geschke, B. Fricke, Comput. Phys. Comm. 111 (1998) 167; S. Fritzsche, T. Inghoff, M. Tomaselli, Comput. Phys. Comm. 153 (2003) 424. Does the new version supersede the previous one: Yes, in addition to the spherical harmonics and recoupling coefficients, the program now supports also the occurrence of the Wigner rotation matrices in the algebraic expressions to be evaluated. Licensing provisions:None Computer for which the program is designed and others on which it is operable: All computers with a license for the computer algebra package Maple [Maple is a registered trademark of Waterloo Maple Inc.] Installations:University of Kassel (Germany) Operating systems under which the program has been tested: Linux 8.2+ Program language used:MAPLE, Release 8 and 9 Memory required to execute with typical data:10-50 MB No. of lines in distributed program, including test data, etc.:52 653 No. of bytes in distributed program, including test data, etc.:1 195 346 Distribution format:tar.gzip Nature of the physical problem: The Wigner D-functions and (reduced) rotation matrices occur very frequently in physical applications. They are known not only as the (infinite) representation of the rotation group but also to obey a number of integral and summation rules, including those for their orthogonality and completeness. Instead of the direct computation of these matrices, therefore, one first often wishes to find algebraic simplifications before the computations can be carried out in practice. Reasons for new version: The RACAH program has been found an efficient tool during recent years, in order to evaluate and simplify expressions from Racah's algebra. Apart from the Wigner n-j symbols ( j=3,6,9) and spherical harmonics, we now extended the code to allow for Wigner rotation matrices. This extension will support the study of those quantum processes especially where different axis of quantization occurs in course of the theoretical deviations. Summary of revisions: In a revised version of the RACAH program [S. Fritzsche, Comput. Phys. Comm. 103 (1997) 51; S. Fritzsche, T. Inghoff, M. Tomaselli, Comput. Phys. Comm. 153 (2003) 424], we now also support the occurrence of the Wigner D-functions and reduced rotation matrices. By following our previous design, the (algebraic) properties of these rotation matrices as well as a number of summation and integration rules are implemented to facilitate the algebraic simplification of expressions from the theories of angular momentum and the spherical tensor operators. Restrictions onto the complexity of the problem: The definition as well as the properties of the rotation matrices, as used in our implementation, are based mainly on the book of Varshalovich et al. [D.A. Varshalovich, A.N. Moskalev, V.K. Khersonskii, Quantum Theory of Angular Momentum, World Scientific, Singapore, 1988], Chapter 4. From this monograph, most of the relations involving the Wigner D-functions and rotation matrices are taken into account although, in practice, only a rather selected set was needed to be implemented explicitly owing to the symmetries of these functions. In the integration over the rotation matrices, products of up to three Wigner D-functions or reduced matrices (with the same angular arguments) are recognized and simplified properly; for the integration over a solid angle, however, the domain of integration must be specified for the Euler angles α and γ. This restriction arose because MAPLE does not generate a constant of integration when the limits in the integral are omitted. For any integration over the angle β the range of the integration, if omitted, is always taken from 0 to π. Unusual features of the program: The RACAH program is designed for interactive use that allows a quick and algebraic evaluation of (complex) expression from Racah's algebra. It is based on a number of well-defined data structures that are now extended to incorporate the Wigner rotation matrices. For these matrices, the transformation properties, sum rules, recursion relations, as well as a variety of special function expansions have been added to the previous functionality of the RACAH program. Moreover, the knowledge about the orthogonality as well as the completeness of the Wigner D-functions is also implemented. Typical running time:All the examples presented in Section 4 take only a few seconds on a 1.5 GHz Pentium Pro computer.

The underexposed role of food matrices in probiotic products: Reviewing the relationship between carrier matrices and product parameters.

PubMed

Flach, Joost; van der Waal, Mark B; van den Nieuwboer, Maurits; Claassen, Eric; Larsen, Olaf F A

2017-06-13

Probiotic microorganisms are increasingly incorporated into food matrices in order to confer proposed health benefits on the consumer. It is important that the health benefits, sensory properties, shelf-life and probiotic gastrointestinal tract (GIT) survival of these products are carefully balanced as they determine functionality and drive consumer acceptance. The strain-specific effects of probiotic species are imperative in this process but carrier matrices may play a pivotal role as well. This study therefore recapitulates the wealth of knowledge on carrier matrices and their interaction with probiotic strains. The most substantiated carrier matrices, factors that influence probiotic functionality and matrix effects on shelf-life, GIT survival and clinical efficacy are reviewed. Results indicate that carrier matrices have a significant impact on the quality of probiotic products. Matrix components, such as proteins, carbohydrates and flavoring agents are shown to alter probiotic efficacy and viability. In vivo studies furthermore revealed strain-dependent matrix effects on the GIT survival of probiotic bacteria. However, only a limited number of studies have specifically addressed the effects of carrier matrices on the aforementioned product-parameters; most studies seem to focus solely on the strain-specific effects of probiotic microorganisms. This hampers the innovation of probiotic products. More human studies, comparing not only different probiotic strains but different carrier matrices as well, are needed to drive the innovation cycle.

Electrospun Zein/PCL Fibrous Matrices Release Tetracycline in a Controlled Manner, Killing Staphylococcus aureus Both in Biofilms and Ex Vivo on Pig Skin, and are Compatible with Human Skin Cells.

PubMed

Alhusein, Nour; Blagbrough, Ian S; Beeton, Michael L; Bolhuis, Albert; De Bank, Paul A

2016-01-01

To investigate the destruction of clinically-relevant bacteria within biofilms via the sustained release of the antibiotic tetracycline from zein-based electrospun polymeric fibrous matrices and to demonstrate the compatibility of such wound dressing matrices with human skin cells. Zein/PCL triple layered fibrous dressings with entrapped tetracycline were electrospun. The successful entrapment of tetracycline in these dressings was validated. The successful release of bioactive tetracycline, the destruction of preformed biofilms, and the viability of fibroblast (FEK4) cells were investigated. The sustained release of tetracycline from these matrices led to the efficient destruction of preformed biofilms from Staphylococcus aureus MRSA252 in vitro, and of MRSA252 and ATCC 25923 bacteria in an ex vivo pig skin model using 1 × 1 cm square matrices containing tetracycline (30 μg). Human FEK4 cells grew normally in the presence of these matrices. The ability of the zein-based matrices to destroy bacteria within increasingly complex in vitro biofilm models was clearly established. An ex vivo pig skin assay showed that these matrices, with entrapped tetracycline, efficiently kill bacteria and this, combined with their compatibility with a human skin cell line suggest these matrices are well suited for applications in wound healing and infection control.

Core-shell alginate-ghatti gum modified montmorillonite composite matrices for stomach-specific flurbiprofen delivery.

PubMed

Bera, Hriday; Ippagunta, Sohitha Reddy; Kumar, Sanoj; Vangala, Pavani

2017-07-01

Novel alginate-arabic gum (AG) gel membrane coated alginate-ghatti gum (GG) modified montmorillonite (MMT) composite matrices were developed for intragastric flurbiprofen (FLU) delivery by combining floating and mucoadhesion mechanisms. The clay-biopolymer composite matrices containing FLU as core were accomplished by ionic-gelation technique. Effects of polymer-blend (alginate:GG) ratios and crosslinker (CaCl 2 ) concentrations on drug entrapment efficiency (DEE, %) and cumulative drug release after 8h (Q 8h , %) were studied to optimize the core matrices by a 3 2 factorial design. The optimized matrices (F-O) demonstrated DEE of 91.69±1.43% and Q 8h of 74.96±1.56% with minimum errors in prediction. The alginate-AG gel membrane enveloped optimized matrices (F-O, coated) exhibited superior buoyancy, better ex vivo mucoadhesion and slower drug release rate. The drug release profile of FLU-loaded uncoated and coated optimized matrices was best fitted in Korsmeyer-Peppas model with anomalous diffusion and case-II transport driven mechanism, respectively. The uncoated and coated matrices containing FLU were also characterized for drug-excipients compatibility, drug crystallinity, thermal behaviour and surface morphology. Thus, the newly developed alginate-AG gel membrane coated alginate-GG modified MMT composite matrices are appropriate for intragastric delivery of FLU over an extended period of time with improved therapeutic benefits. Copyright © 2017 Elsevier B.V. All rights reserved.

Novel value-added uses for sweet potato juice and flour in polyphenol- and protein-enriched functional food ingredients.

PubMed

Grace, Mary H; Truong, An N; Truong, Van-Den; Raskin, Ilya; Lila, Mary Ann

2015-09-01

Blackcurrant, blueberry, and muscadine grape juices were efficiently sorbed, concentrated, and stabilized into dry granular ingredient matrices which combined anti-inflammatory and antioxidant fruit polyphenols with sweet potato functional constituents (carotenoids, vitamins, polyphenols, fibers). Total phenolics were highest in blackcurrant-orange sweet potato ingredient matrices (34.03 mg/g), and lowest in muscadine grape-yellow sweet potato matrices (10.56 mg/g). Similarly, anthocyanins were most concentrated in blackcurrant-fortified orange and yellow sweet potato matrices (5.40 and 6.54 mg/g, respectively). Alternatively, other protein-rich edible matrices (defatted soy flour, light roasted peanut flour, and rice protein concentrate) efficiently captured polyphenols (6.09-9.46 mg/g) and anthocyanins (0.77-1.27 mg/g) from purple-fleshed sweet potato juice, with comparable efficiency. Antioxidant activity correlated well with total phenolic content. All formulated ingredient matrices stabilized and preserved polyphenols for up to 24 weeks, even when stored at 37°C. Complexation with juice-derived polyphenols did not significantly alter protein or carbohydrate profiles of the matrices. Sensory evaluation of the ingredient matrices suggested potential uses for a wide range of functional food products.

Computation of eigenpairs of Ax = lambda Bx for vibrations of spinning deformable bodies

NASA Technical Reports Server (NTRS)

Utku, S.; Clemente, J. L. M.

1984-01-01

It is shown that, when linear theory is used, the general eigenvalue problem related with the free vibrations of spinning deformable bodies is of the type AX = lambda Bx, where A is Hermitian, and B is real positive definite. Since the order n of the matrices may be large, and A and B are banded or block banded, due to the economics of the numerical solution, one is interested in obtaining only those eigenvalues which fall within the frequency band of interest of the problem. The paper extends the well known method of bisections and iteration of R to the n power to n dimensional complex spaces, i.e., to C to the n power, so that it can be applied to the present problem.

Adinkra (in)equivalence from Coxeter group representations: A case study

NASA Astrophysics Data System (ADS)

Chappell, Isaac; Gates, S. James; Hübsch, T.

2014-02-01

Using a MathematicaTM code, we present a straightforward numerical analysis of the 384-dimensional solution space of signed permutation 4×4 matrices, which in sets of four, provide representations of the 𝒢ℛ(4, 4) algebra, closely related to the 𝒩 = 1 (simple) supersymmetry algebra in four-dimensional space-time. Following after ideas discussed in previous papers about automorphisms and classification of adinkras and corresponding supermultiplets, we make a new and alternative proposal to use equivalence classes of the (unsigned) permutation group S4 to define distinct representations of higher-dimensional spin bundles within the context of adinkras. For this purpose, the definition of a dual operator akin to the well-known Hodge star is found to partition the space of these 𝒢ℛ(4, 4) representations into three suggestive classes.

Distillability sudden death in qutrit-qutrit systems under global and multilocal dephasing

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ali, Mazhar

2010-04-15

Recently Song et al. [Phys. Rev. A 80, 012331 (2009)] discovered that certain two-qutrit entangled states interacting with multilocal dephasing undergo distillability sudden death (DSD). We generalized their studies for quantum states under global, collective, and multilocal dephasing. We found that for a specific family of quantum states DSD and entanglement sudden death may happen under global dephasing as well as under multilocal dephasing. Moreover, for these states simple local unitary transformations may not avoid DSD under the current dynamics. As there is no definitive criterion for separability or entanglement of density matrices with dimensions greater than six, therefore wemore » believe that the results obtained in this article are restricted to the specific family of states considered here.« less

Some Properties and Stability Results for Sector-Bounded LTI Systems

NASA Technical Reports Server (NTRS)

Gupta, Sandeep; Joshi, Suresh M.

1994-01-01

This paper presents necessary and sufficient conditions for a linear, time-invariant (LTI) system to be inside sector (n, b) in terms of linear matrix inequalities in its state-space realization matrices, which represents a generalization of similar conditions for bounded H(sub infinity)-norm systems. Further, a weaker definition of LTI systems strictly inside closed sector (a, b) is proposed, and state-space characterization of such systems is presented. Sector conditions for stability of the negative feedback interconnection of two LTI systems and for stability of LTI systems with feedback nonlinearities are investigated using the Lyapunov function approach. It is shown that the proposed weaker conditions for an LTI system to be strictly inside a sector are sufficient to establish closed-loop stability of these systems.

Eigenvectors phase correction in inverse modal problem

NASA Astrophysics Data System (ADS)

Qiao, Guandong; Rahmatalla, Salam

2017-12-01

The solution of the inverse modal problem for the spatial parameters of mechanical and structural systems is heavily dependent on the quality of the modal parameters obtained from the experiments. While experimental and environmental noises will always exist during modal testing, the resulting modal parameters are expected to be corrupted with different levels of noise. A novel methodology is presented in this work to mitigate the errors in the eigenvectors when solving the inverse modal problem for the spatial parameters. The phases of the eigenvector component were utilized as design variables within an optimization problem that minimizes the difference between the calculated and experimental transfer functions. The equation of motion in terms of the modal and spatial parameters was used as a constraint in the optimization problem. Constraints that reserve the positive and semi-positive definiteness and the inter-connectivity of the spatial matrices were implemented using semi-definite programming. Numerical examples utilizing noisy eigenvectors with augmented Gaussian white noise of 1%, 5%, and 10% were used to demonstrate the efficacy of the proposed method. The results showed that the proposed method is superior when compared with a known method in the literature.

Matrix isolation studies of the interactions of BF3 with water and substituted diethyl ethers. Chemical ionization mass spectrometric determination of the proton affinity of (CF3CH2)2O

NASA Technical Reports Server (NTRS)

Ball, David W.; Zehe, Michael J.

1993-01-01

BF3 was co-condensed with H2O, D2O, (C2H5)2O, (CF3CH2)2O, and (C2F5)2O in excess argon at 15 K. Infrared spectra of BF3/water isolated in solid argon provided a more complete analysis of the BF3--H2O complex than previously published. Infrared spectra of the matrices showed a definite Lewis acid-base interaction between BF3 and diethyl ether; a weak but definite interaction with bis (2,2,2-trifluorodiethyl) ether, and no observable interaction with perfluorodiethyl ether. Thus, the ether data indicate a clear trend between strength of interaction with BF3 and the degree of F substitution. To support and explain the emerging relationship between interaction strength and the basicity of the oxygen-containing molecule, the proton affinity of (CF3CH2)2O was measured using chemical ionization mass spectrometry. The implications of the results for lubricant/metal oxide surface interactions are discussed.

Inference for High-dimensional Differential Correlation Matrices.

PubMed

Cai, T Tony; Zhang, Anru

2016-01-01

Motivated by differential co-expression analysis in genomics, we consider in this paper estimation and testing of high-dimensional differential correlation matrices. An adaptive thresholding procedure is introduced and theoretical guarantees are given. Minimax rate of convergence is established and the proposed estimator is shown to be adaptively rate-optimal over collections of paired correlation matrices with approximately sparse differences. Simulation results show that the procedure significantly outperforms two other natural methods that are based on separate estimation of the individual correlation matrices. The procedure is also illustrated through an analysis of a breast cancer dataset, which provides evidence at the gene co-expression level that several genes, of which a subset has been previously verified, are associated with the breast cancer. Hypothesis testing on the differential correlation matrices is also considered. A test, which is particularly well suited for testing against sparse alternatives, is introduced. In addition, other related problems, including estimation of a single sparse correlation matrix, estimation of the differential covariance matrices, and estimation of the differential cross-correlation matrices, are also discussed.

On Fluctuations of Eigenvalues of Random Band Matrices

NASA Astrophysics Data System (ADS)

Shcherbina, M.

2015-10-01

We consider the fluctuations of linear eigenvalue statistics of random band matrices whose entries have the form with i.i.d. possessing the th moment, where the function u has a finite support , so that M has only nonzero diagonals. The parameter b (called the bandwidth) is assumed to grow with n in a way such that . Without any additional assumptions on the growth of b we prove CLT for linear eigenvalue statistics for a rather wide class of test functions. Thus we improve and generalize the results of the previous papers (Jana et al., arXiv:1412.2445; Li et al. Random Matrices 2:04, 2013), where CLT was proven under the assumption . Moreover, we develop a method which allows to prove automatically the CLT for linear eigenvalue statistics of the smooth test functions for almost all classical models of random matrix theory: deformed Wigner and sample covariance matrices, sparse matrices, diluted random matrices, matrices with heavy tales etc.

An Approximate Approach to Automatic Kernel Selection.

PubMed

Ding, Lizhong; Liao, Shizhong

2016-02-02

Kernel selection is a fundamental problem of kernel-based learning algorithms. In this paper, we propose an approximate approach to automatic kernel selection for regression from the perspective of kernel matrix approximation. We first introduce multilevel circulant matrices into automatic kernel selection, and develop two approximate kernel selection algorithms by exploiting the computational virtues of multilevel circulant matrices. The complexity of the proposed algorithms is quasi-linear in the number of data points. Then, we prove an approximation error bound to measure the effect of the approximation in kernel matrices by multilevel circulant matrices on the hypothesis and further show that the approximate hypothesis produced with multilevel circulant matrices converges to the accurate hypothesis produced with kernel matrices. Experimental evaluations on benchmark datasets demonstrate the effectiveness of approximate kernel selection.

Homology search with binary and trinary scoring matrices.

PubMed

Smith, Scott F

2006-01-01

Protein homology search can be accelerated with the use of bit-parallel algorithms in conjunction with constraints on the values contained in the scoring matrices. Trinary scoring matrices (containing only the values -1, 0, and 1) allow for significant acceleration without significant reduction in the receiver operating characteristic (ROC) score of a Smith-Waterman search. Binary scoring matrices (containing the values 0 and 1) result in some reduction in ROC score, but result in even more acceleration. Binary scoring matrices and five-bit saturating scores can be used for fast prefilters to the Smith-Waterman algorithm.

Methods for Quantum Circuit Design and Simulation

DTIC Science & Technology

2010-03-01

cannot be deter- mined given the one output. Reversible gates, expressed mathematically, are unitary matrices. 16 3.3.1 PAULI Gates/Matrices Three...common single-qubit gates are expressed mathematically as Pauli matrices, which are 2x2 matrices. A 2x2 quantum gate can be applied to a single quantum...bit (a 2x1 column vector). The Pauli matrices are expressed as follows: X =   0 1 1 0   Y =   0 −i i 0   Z =   1 0 0 −1   (3.10) where i

An automated procedure for calculating system matrices from perturbation data generated by an EAI Pacer and 100 hybrid computer system

NASA Technical Reports Server (NTRS)

Milner, E. J.; Krosel, S. M.

1977-01-01

Techniques are presented for determining the elements of the A, B, C, and D state variable matrices for systems simulated on an EAI Pacer 100 hybrid computer. An automated procedure systematically generates disturbance data necessary to linearize the simulation model and stores these data on a floppy disk. A separate digital program verifies this data, calculates the elements of the system matrices, and prints these matrices appropriately labeled. The partial derivatives forming the elements of the state variable matrices are approximated by finite difference calculations.

A general framework for regularized, similarity-based image restoration.

PubMed

Kheradmand, Amin; Milanfar, Peyman

2014-12-01

Any image can be represented as a function defined on a weighted graph, in which the underlying structure of the image is encoded in kernel similarity and associated Laplacian matrices. In this paper, we develop an iterative graph-based framework for image restoration based on a new definition of the normalized graph Laplacian. We propose a cost function, which consists of a new data fidelity term and regularization term derived from the specific definition of the normalized graph Laplacian. The normalizing coefficients used in the definition of the Laplacian and associated regularization term are obtained using fast symmetry preserving matrix balancing. This results in some desired spectral properties for the normalized Laplacian such as being symmetric, positive semidefinite, and returning zero vector when applied to a constant image. Our algorithm comprises of outer and inner iterations, where in each outer iteration, the similarity weights are recomputed using the previous estimate and the updated objective function is minimized using inner conjugate gradient iterations. This procedure improves the performance of the algorithm for image deblurring, where we do not have access to a good initial estimate of the underlying image. In addition, the specific form of the cost function allows us to render the spectral analysis for the solutions of the corresponding linear equations. In addition, the proposed approach is general in the sense that we have shown its effectiveness for different restoration problems, including deblurring, denoising, and sharpening. Experimental results verify the effectiveness of the proposed algorithm on both synthetic and real examples.

A comparison of mandibular denture base deformation with different impression techniques for implant overdentures.

PubMed

Elsyad, Moustafa Abdou; El-Waseef, Fatma Ahmad; Al-Mahdy, Yasmeen Fathy; Fouad, Mohammed Mohammed

2013-08-01

This study aimed to evaluate mandibular denture base deformation along with three impression techniques used for implant-retained overdenture. Ten edentulous patients (five men and five women) received two implants in the canine region of the mandible and three duplicate mandibular overdentures which were constructed with mucostatic, selective pressure, and definitive pressure impression techniques. Ball abutments and respective gold matrices were used to connect the overdentures to the implants. Six linear strain gauges were bonded to the lingual polished surface of each duplicate overdenture at midline and implant areas to measure strain during maximal clenching and gum chewing. The strains recorded at midline were compressive while strains at implant areas were tensile. Clenching recorded significant higher strain when compared with gum chewing for all techniques. The mucostatic technique recorded the highest strain and the definite pressure technique recorded the lowest. There was no significant difference between the strain recorded with mucostatic technique and that registered with selective pressure technique. The highest strain was recorded at the level of ball abutment's top with the mucostatic technique during clenching. Definite pressure impression technique for implant-retained mandibular overdenture is associated with minimal denture deformation during function when compared with mucostatic and selective pressure techniques. Reinforcement of the denture base over the implants may be recommended to increase resistance of fracture when mucostatic or selective pressure impression technique is used. © 2012 John Wiley & Sons A/S.

Invertible flexible matrices

NASA Astrophysics Data System (ADS)

Justino, Júlia

2017-06-01

Matrices with coefficients having uncertainties of type o (.) or O (.), called flexible matrices, are studied from the point of view of nonstandard analysis. The uncertainties of the afore-mentioned kind will be given in the form of the so-called neutrices, for instance the set of all infinitesimals. Since flexible matrices have uncertainties in their coefficients, it is not possible to define the identity matrix in an unique way and so the notion of spectral identity matrix arises. Not all nonsingular flexible matrices can be turned into a spectral identity matrix using Gauss-Jordan elimination method, implying that that not all nonsingular flexible matrices have the inverse matrix. Under certain conditions upon the size of the uncertainties appearing in a nonsingular flexible matrix, a general theorem concerning the boundaries of its minors is presented which guarantees the existence of the inverse matrix of a nonsingular flexible matrix.

Statistical potential-based amino acid similarity matrices for aligning distantly related protein sequences.

PubMed

Tan, Yen Hock; Huang, He; Kihara, Daisuke

2006-08-15

Aligning distantly related protein sequences is a long-standing problem in bioinformatics, and a key for successful protein structure prediction. Its importance is increasing recently in the context of structural genomics projects because more and more experimentally solved structures are available as templates for protein structure modeling. Toward this end, recent structure prediction methods employ profile-profile alignments, and various ways of aligning two profiles have been developed. More fundamentally, a better amino acid similarity matrix can improve a profile itself; thereby resulting in more accurate profile-profile alignments. Here we have developed novel amino acid similarity matrices from knowledge-based amino acid contact potentials. Contact potentials are used because the contact propensity to the other amino acids would be one of the most conserved features of each position of a protein structure. The derived amino acid similarity matrices are tested on benchmark alignments at three different levels, namely, the family, the superfamily, and the fold level. Compared to BLOSUM45 and the other existing matrices, the contact potential-based matrices perform comparably in the family level alignments, but clearly outperform in the fold level alignments. The contact potential-based matrices perform even better when suboptimal alignments are considered. Comparing the matrices themselves with each other revealed that the contact potential-based matrices are very different from BLOSUM45 and the other matrices, indicating that they are located in a different basin in the amino acid similarity matrix space.

The Development of Novel Nanodiamond Based MALDI Matrices for the Analysis of Small Organic Pharmaceuticals

NASA Astrophysics Data System (ADS)

Chitanda, Jackson M.; Zhang, Haixia; Pahl, Erica; Purves, Randy W.; El-Aneed, Anas

2016-10-01

The utility of novel functionalized nanodiamonds (NDs) as matrices for matrix-assisted laser desorption ionization-mass spectrometry (MALDI-MS) is described herein. MALDI-MS analysis of small organic compounds (<1000 Da) is typically complex because of interferences from numerous cluster ions formed when using conventional matrices. To expand the use of MALDI for the analysis of small molecules, novel matrices were designed by covalently linking conventional matrices (or a lysine moiety) to detonated NDs. Four new functionalized NDs were evaluated for their ionization capabilities using five pharmaceuticals with varying molecular structures. Two ND matrices were able to ionize all tested pharmaceuticals in the negative ion mode, producing the deprotonated ions [M - H]-. Ion intensity for target analytes was generally strong with enhanced signal-to-noise ratios compared with conventional matrices. The negative ion mode is of great importance for biological samples as interference from endogenous compounds is inherently minimized in the negative ion mode. Since the molecular structures of the tested pharmaceuticals did not suggest that negative ion mode would be preferable, this result magnifies the importance of these findings. On the other hand, conventional matrices primarily facilitated the ionization as expected in the positive ion mode, producing either the protonated molecules [M + H]+ or cationic adducts (typically producing complex spectra with numerous adduct peaks). The data presented in this study suggests that these matrices may offer advantages for the analysis of low molecular weight pharmaceuticals/metabolites.

The Development of Novel Nanodiamond Based MALDI Matrices for the Analysis of Small Organic Pharmaceuticals.

PubMed

Chitanda, Jackson M; Zhang, Haixia; Pahl, Erica; Purves, Randy W; El-Aneed, Anas

2016-10-01

The utility of novel functionalized nanodiamonds (NDs) as matrices for matrix-assisted laser desorption ionization-mass spectrometry (MALDI-MS) is described herein. MALDI-MS analysis of small organic compounds (<1000 Da) is typically complex because of interferences from numerous cluster ions formed when using conventional matrices. To expand the use of MALDI for the analysis of small molecules, novel matrices were designed by covalently linking conventional matrices (or a lysine moiety) to detonated NDs. Four new functionalized NDs were evaluated for their ionization capabilities using five pharmaceuticals with varying molecular structures. Two ND matrices were able to ionize all tested pharmaceuticals in the negative ion mode, producing the deprotonated ions [M - H](-). Ion intensity for target analytes was generally strong with enhanced signal-to-noise ratios compared with conventional matrices. The negative ion mode is of great importance for biological samples as interference from endogenous compounds is inherently minimized in the negative ion mode. Since the molecular structures of the tested pharmaceuticals did not suggest that negative ion mode would be preferable, this result magnifies the importance of these findings. On the other hand, conventional matrices primarily facilitated the ionization as expected in the positive ion mode, producing either the protonated molecules [M + H](+) or cationic adducts (typically producing complex spectra with numerous adduct peaks). The data presented in this study suggests that these matrices may offer advantages for the analysis of low molecular weight pharmaceuticals/metabolites. Graphical Abstract ᅟ.

Extraction and Analysis of Sulfur Mustard (HD) from Various Food Matrices by Gas ChromatographyMass Spectrometry

DTIC Science & Technology

2016-01-01

EXTRACTION AND ANALYSIS OF SULFUR MUSTARD (HD) FROM VARIOUS FOOD MATRICES BY GAS CHROMATOGRAPHY–MASS...Sulfur Mustard (HD) from Various Food Matrices by Gas Chromatography–Mass Spectrometry 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT...spectrometry was used to analyze sulfur mustard (HD) in various food matrices. The development of a solid-phase extraction method using a normal

Novel value-added uses for sweet potato juice and flour in polyphenol- and protein-enriched functional food ingredients

PubMed Central

Grace, Mary H; Truong, An N; Truong, Van-Den; Raskin, Ilya; Lila, Mary Ann

2015-01-01

Blackcurrant, blueberry, and muscadine grape juices were efficiently sorbed, concentrated, and stabilized into dry granular ingredient matrices which combined anti-inflammatory and antioxidant fruit polyphenols with sweet potato functional constituents (carotenoids, vitamins, polyphenols, fibers). Total phenolics were highest in blackcurrant-orange sweet potato ingredient matrices (34.03 mg/g), and lowest in muscadine grape-yellow sweet potato matrices (10.56 mg/g). Similarly, anthocyanins were most concentrated in blackcurrant-fortified orange and yellow sweet potato matrices (5.40 and 6.54 mg/g, respectively). Alternatively, other protein-rich edible matrices (defatted soy flour, light roasted peanut flour, and rice protein concentrate) efficiently captured polyphenols (6.09–9.46 mg/g) and anthocyanins (0.77–1.27 mg/g) from purple-fleshed sweet potato juice, with comparable efficiency. Antioxidant activity correlated well with total phenolic content. All formulated ingredient matrices stabilized and preserved polyphenols for up to 24 weeks, even when stored at 37°C. Complexation with juice-derived polyphenols did not significantly alter protein or carbohydrate profiles of the matrices. Sensory evaluation of the ingredient matrices suggested potential uses for a wide range of functional food products. PMID:26405527

The performance of the Congruence Among Distance Matrices (CADM) test in phylogenetic analysis

PubMed Central

2011-01-01

Background CADM is a statistical test used to estimate the level of Congruence Among Distance Matrices. It has been shown in previous studies to have a correct rate of type I error and good power when applied to dissimilarity matrices and to ultrametric distance matrices. Contrary to most other tests of incongruence used in phylogenetic analysis, the null hypothesis of the CADM test assumes complete incongruence of the phylogenetic trees instead of congruence. In this study, we performed computer simulations to assess the type I error rate and power of the test. It was applied to additive distance matrices representing phylogenies and to genetic distance matrices obtained from nucleotide sequences of different lengths that were simulated on randomly generated trees of varying sizes, and under different evolutionary conditions. Results Our results showed that the test has an accurate type I error rate and good power. As expected, power increased with the number of objects (i.e., taxa), the number of partially or completely congruent matrices and the level of congruence among distance matrices. Conclusions Based on our results, we suggest that CADM is an excellent candidate to test for congruence and, when present, to estimate its level in phylogenomic studies where numerous genes are analysed simultaneously. PMID:21388552

Virial expansion for almost diagonal random matrices

NASA Astrophysics Data System (ADS)

Yevtushenko, Oleg; Kravtsov, Vladimir E.

2003-08-01

Energy level statistics of Hermitian random matrices hat H with Gaussian independent random entries Higeqj is studied for a generic ensemble of almost diagonal random matrices with langle|Hii|2rangle ~ 1 and langle|Hi\

Inference for High-dimensional Differential Correlation Matrices *

PubMed Central

Cai, T. Tony; Zhang, Anru

2015-01-01

Motivated by differential co-expression analysis in genomics, we consider in this paper estimation and testing of high-dimensional differential correlation matrices. An adaptive thresholding procedure is introduced and theoretical guarantees are given. Minimax rate of convergence is established and the proposed estimator is shown to be adaptively rate-optimal over collections of paired correlation matrices with approximately sparse differences. Simulation results show that the procedure significantly outperforms two other natural methods that are based on separate estimation of the individual correlation matrices. The procedure is also illustrated through an analysis of a breast cancer dataset, which provides evidence at the gene co-expression level that several genes, of which a subset has been previously verified, are associated with the breast cancer. Hypothesis testing on the differential correlation matrices is also considered. A test, which is particularly well suited for testing against sparse alternatives, is introduced. In addition, other related problems, including estimation of a single sparse correlation matrix, estimation of the differential covariance matrices, and estimation of the differential cross-correlation matrices, are also discussed. PMID:26500380

Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices

PubMed Central

Monajemi, Hatef; Jafarpour, Sina; Gavish, Matan; Donoho, David L.; Ambikasaran, Sivaram; Bacallado, Sergio; Bharadia, Dinesh; Chen, Yuxin; Choi, Young; Chowdhury, Mainak; Chowdhury, Soham; Damle, Anil; Fithian, Will; Goetz, Georges; Grosenick, Logan; Gross, Sam; Hills, Gage; Hornstein, Michael; Lakkam, Milinda; Lee, Jason; Li, Jian; Liu, Linxi; Sing-Long, Carlos; Marx, Mike; Mittal, Akshay; Monajemi, Hatef; No, Albert; Omrani, Reza; Pekelis, Leonid; Qin, Junjie; Raines, Kevin; Ryu, Ernest; Saxe, Andrew; Shi, Dai; Siilats, Keith; Strauss, David; Tang, Gary; Wang, Chaojun; Zhou, Zoey; Zhu, Zhen

2013-01-01

In compressed sensing, one takes samples of an N-dimensional vector using an matrix A, obtaining undersampled measurements . For random matrices with independent standard Gaussian entries, it is known that, when is k-sparse, there is a precisely determined phase transition: for a certain region in the (,)-phase diagram, convex optimization typically finds the sparsest solution, whereas outside that region, it typically fails. It has been shown empirically that the same property—with the same phase transition location—holds for a wide range of non-Gaussian random matrix ensembles. We report extensive experiments showing that the Gaussian phase transition also describes numerous deterministic matrices, including Spikes and Sines, Spikes and Noiselets, Paley Frames, Delsarte-Goethals Frames, Chirp Sensing Matrices, and Grassmannian Frames. Namely, for each of these deterministic matrices in turn, for a typical k-sparse object, we observe that convex optimization is successful over a region of the phase diagram that coincides with the region known for Gaussian random matrices. Our experiments considered coefficients constrained to for four different sets , and the results establish our finding for each of the four associated phase transitions. PMID:23277588

Amino acid "little Big Bang": representing amino acid substitution matrices as dot products of Euclidian vectors.

PubMed

Zimmermann, Karel; Gibrat, Jean-François

2010-01-04

Sequence comparisons make use of a one-letter representation for amino acids, the necessary quantitative information being supplied by the substitution matrices. This paper deals with the problem of finding a representation that provides a comprehensive description of amino acid intrinsic properties consistent with the substitution matrices. We present a Euclidian vector representation of the amino acids, obtained by the singular value decomposition of the substitution matrices. The substitution matrix entries correspond to the dot product of amino acid vectors. We apply this vector encoding to the study of the relative importance of various amino acid physicochemical properties upon the substitution matrices. We also characterize and compare the PAM and BLOSUM series substitution matrices. This vector encoding introduces a Euclidian metric in the amino acid space, consistent with substitution matrices. Such a numerical description of the amino acid is useful when intrinsic properties of amino acids are necessary, for instance, building sequence profiles or finding consensus sequences, using machine learning algorithms such as Support Vector Machine and Neural Networks algorithms.

Quantification of VX Nerve Agent in Various Food Matrices by Solid-Phase Extraction Ultra-Performance Liquid ChromatographyTime-of-Flight Mass Spectrometry

DTIC Science & Technology

2016-04-01

QUANTIFICATION OF VX NERVE AGENT IN VARIOUS FOOD MATRICES BY SOLID-PHASE EXTRACTION ULTRA-PERFORMANCE...TITLE AND SUBTITLE Quantification of VX Nerve Agent in Various Food Matrices by Solid-Phase Extraction Ultra-Performance Liquid Chromatography... food matrices. The mixed-mode cation exchange (MCX) sorbent and Quick, Easy, Cheap, Effective, Rugged, and Safe (QuEChERS) methods were used for

Novel image compression-encryption hybrid algorithm based on key-controlled measurement matrix in compressive sensing

NASA Astrophysics Data System (ADS)

Zhou, Nanrun; Zhang, Aidi; Zheng, Fen; Gong, Lihua

2014-10-01

The existing ways to encrypt images based on compressive sensing usually treat the whole measurement matrix as the key, which renders the key too large to distribute and memorize or store. To solve this problem, a new image compression-encryption hybrid algorithm is proposed to realize compression and encryption simultaneously, where the key is easily distributed, stored or memorized. The input image is divided into 4 blocks to compress and encrypt, then the pixels of the two adjacent blocks are exchanged randomly by random matrices. The measurement matrices in compressive sensing are constructed by utilizing the circulant matrices and controlling the original row vectors of the circulant matrices with logistic map. And the random matrices used in random pixel exchanging are bound with the measurement matrices. Simulation results verify the effectiveness, security of the proposed algorithm and the acceptable compression performance.

Intrinsic character of Stokes matrices

NASA Astrophysics Data System (ADS)

Gagnon, Jean-François; Rousseau, Christiane

2017-02-01

Two germs of linear analytic differential systems x k + 1Y‧ = A (x) Y with a non-resonant irregular singularity are analytically equivalent if and only if they have the same eigenvalues and equivalent collections of Stokes matrices. The Stokes matrices are the transition matrices between sectors on which the system is analytically equivalent to its formal normal form. Each sector contains exactly one separating ray for each pair of eigenvalues. A rotation in S allows supposing that R+ lies in the intersection of two sectors. Reordering of the coordinates of Y allows ordering the real parts of the eigenvalues, thus yielding triangular Stokes matrices. However, the choice of the rotation in x is not canonical. In this paper we establish how the collection of Stokes matrices depends on this rotation, and hence on a chosen order of the projection of the eigenvalues on a line through the origin.

Surveying the quantum group symmetries of integrable open spin chains

NASA Astrophysics Data System (ADS)

Nepomechie, Rafael I.; Retore, Ana L.

2018-05-01

Using anisotropic R-matrices associated with affine Lie algebras g ˆ (specifically, A2n(2), A2n-1 (2) , Bn(1), Cn(1), Dn(1)) and suitable corresponding K-matrices, we construct families of integrable open quantum spin chains of finite length, whose transfer matrices are invariant under the quantum group corresponding to removing one node from the Dynkin diagram of g ˆ . We show that these transfer matrices also have a duality symmetry (for the cases Cn(1) and Dn(1)) and additional Z2 symmetries that map complex representations to their conjugates (for the cases A2n-1 (2) , Bn(1) and Dn(1)). A key simplification is achieved by working in a certain "unitary" gauge, in which only the unbroken symmetry generators appear. The proofs of these symmetries rely on some new properties of the R-matrices. We use these symmetries to explain the degeneracies of the transfer matrices.

Efficient linear algebra routines for symmetric matrices stored in packed form.

PubMed

Ahlrichs, Reinhart; Tsereteli, Kakha

2002-01-30

Quantum chemistry methods require various linear algebra routines for symmetric matrices, for example, diagonalization or Cholesky decomposition for positive matrices. We present a small set of these basic routines that are efficient and minimize memory requirements.

ESTIMATION OF FUNCTIONALS OF SPARSE COVARIANCE MATRICES.

PubMed

Fan, Jianqing; Rigollet, Philippe; Wang, Weichen

High-dimensional statistical tests often ignore correlations to gain simplicity and stability leading to null distributions that depend on functionals of correlation matrices such as their Frobenius norm and other ℓ r norms. Motivated by the computation of critical values of such tests, we investigate the difficulty of estimation the functionals of sparse correlation matrices. Specifically, we show that simple plug-in procedures based on thresholded estimators of correlation matrices are sparsity-adaptive and minimax optimal over a large class of correlation matrices. Akin to previous results on functional estimation, the minimax rates exhibit an elbow phenomenon. Our results are further illustrated in simulated data as well as an empirical study of data arising in financial econometrics.

ESTIMATION OF FUNCTIONALS OF SPARSE COVARIANCE MATRICES

PubMed Central

Fan, Jianqing; Rigollet, Philippe; Wang, Weichen

2016-01-01

High-dimensional statistical tests often ignore correlations to gain simplicity and stability leading to null distributions that depend on functionals of correlation matrices such as their Frobenius norm and other ℓr norms. Motivated by the computation of critical values of such tests, we investigate the difficulty of estimation the functionals of sparse correlation matrices. Specifically, we show that simple plug-in procedures based on thresholded estimators of correlation matrices are sparsity-adaptive and minimax optimal over a large class of correlation matrices. Akin to previous results on functional estimation, the minimax rates exhibit an elbow phenomenon. Our results are further illustrated in simulated data as well as an empirical study of data arising in financial econometrics. PMID:26806986

Random sampling and validation of covariance matrices of resonance parameters

NASA Astrophysics Data System (ADS)

Plevnik, Lucijan; Zerovnik, Gašper

2017-09-01

Analytically exact methods for random sampling of arbitrary correlated parameters are presented. Emphasis is given on one hand on the possible inconsistencies in the covariance data, concentrating on the positive semi-definiteness and consistent sampling of correlated inherently positive parameters, and on the other hand on optimization of the implementation of the methods itself. The methods have been applied in the program ENDSAM, written in the Fortran language, which from a file from a nuclear data library of a chosen isotope in ENDF-6 format produces an arbitrary number of new files in ENDF-6 format which contain values of random samples of resonance parameters (in accordance with corresponding covariance matrices) in places of original values. The source code for the program ENDSAM is available from the OECD/NEA Data Bank. The program works in the following steps: reads resonance parameters and their covariance data from nuclear data library, checks whether the covariance data is consistent, and produces random samples of resonance parameters. The code has been validated with both realistic and artificial data to show that the produced samples are statistically consistent. Additionally, the code was used to validate covariance data in existing nuclear data libraries. A list of inconsistencies, observed in covariance data of resonance parameters in ENDF-VII.1, JEFF-3.2 and JENDL-4.0 is presented. For now, the work has been limited to resonance parameters, however the methods presented are general and can in principle be extended to sampling and validation of any nuclear data.

Data traffic reduction schemes for Cholesky factorization on asynchronous multiprocessor systems

NASA Technical Reports Server (NTRS)

Naik, Vijay K.; Patrick, Merrell L.

1989-01-01

Communication requirements of Cholesky factorization of dense and sparse symmetric, positive definite matrices are analyzed. The communication requirement is characterized by the data traffic generated on multiprocessor systems with local and shared memory. Lower bound proofs are given to show that when the load is uniformly distributed the data traffic associated with factoring an n x n dense matrix using n to the alpha power (alpha less than or equal 2) processors is omega(n to the 2 + alpha/2 power). For n x n sparse matrices representing a square root of n x square root of n regular grid graph the data traffic is shown to be omega(n to the 1 + alpha/2 power), alpha less than or equal 1. Partitioning schemes that are variations of block assignment scheme are described and it is shown that the data traffic generated by these schemes are asymptotically optimal. The schemes allow efficient use of up to O(n to the 2nd power) processors in the dense case and up to O(n) processors in the sparse case before the total data traffic reaches the maximum value of O(n to the 3rd power) and O(n to the 3/2 power), respectively. It is shown that the block based partitioning schemes allow a better utilization of the data accessed from shared memory and thus reduce the data traffic than those based on column-wise wrap around assignment schemes.

Projective loop quantum gravity. I. State space

NASA Astrophysics Data System (ADS)

Lanéry, Suzanne; Thiemann, Thomas

2016-12-01

Instead of formulating the state space of a quantum field theory over one big Hilbert space, it has been proposed by Kijowski to describe quantum states as projective families of density matrices over a collection of smaller, simpler Hilbert spaces. Beside the physical motivations for this approach, it could help designing a quantum state space holding the states we need. In a latter work by Okolów, the description of a theory of Abelian connections within this framework was developed, an important insight being to use building blocks labeled by combinations of edges and surfaces. The present work generalizes this construction to an arbitrary gauge group G (in particular, G is neither assumed to be Abelian nor compact). This involves refining the definition of the label set, as well as deriving explicit formulas to relate the Hilbert spaces attached to different labels. If the gauge group happens to be compact, we also have at our disposal the well-established Ashtekar-Lewandowski Hilbert space, which is defined as an inductive limit using building blocks labeled by edges only. We then show that the quantum state space presented here can be thought as a natural extension of the space of density matrices over this Hilbert space. In addition, it is manifest from the classical counterparts of both formalisms that the projective approach allows for a more balanced treatment of the holonomy and flux variables, so it might pave the way for the development of more satisfactory coherent states.

Tensor distribution function

NASA Astrophysics Data System (ADS)

Leow, Alex D.; Zhu, Siwei

2008-03-01

Diffusion weighted MR imaging is a powerful tool that can be employed to study white matter microstructure by examining the 3D displacement profile of water molecules in brain tissue. By applying diffusion-sensitizing gradients along a minimum of 6 directions, second-order tensors (represetnted by 3-by-3 positive definiite matrices) can be computed to model dominant diffusion processes. However, it has been shown that conventional DTI is not sufficient to resolve more complicated white matter configurations, e.g. crossing fiber tracts. More recently, High Angular Resolution Diffusion Imaging (HARDI) seeks to address this issue by employing more than 6 gradient directions. To account for fiber crossing when analyzing HARDI data, several methodologies have been introduced. For example, q-ball imaging was proposed to approximate Orientation Diffusion Function (ODF). Similarly, the PAS method seeks to reslove the angular structure of displacement probability functions using the maximum entropy principle. Alternatively, deconvolution methods extract multiple fiber tracts by computing fiber orientations using a pre-specified single fiber response function. In this study, we introduce Tensor Distribution Function (TDF), a probability function defined on the space of symmetric and positive definite matrices. Using calculus of variations, we solve for the TDF that optimally describes the observed data. Here, fiber crossing is modeled as an ensemble of Gaussian diffusion processes with weights specified by the TDF. Once this optimal TDF is determined, ODF can easily be computed by analytical integration of the resulting displacement probability function. Moreover, principle fiber directions can also be directly derived from the TDF.

High-resolution droplet-based fractionation of nano-LC separations onto microarrays for MALDI-MS analysis.

PubMed

Küster, Simon K; Pabst, Martin; Jefimovs, Konstantins; Zenobi, Renato; Dittrich, Petra S

2014-05-20

We present a robust droplet-based device, which enables the fractionation of ultralow flow rate nanoflow liquid chromatography (nano-LC) eluate streams at high frequencies and high peak resolution. This is achieved by directly interfacing the separation column to a micro T-junction, where the eluate stream is compartmentalized into picoliter droplets. This immediate compartmentalization prevents peak dispersion during eluate transport and conserves the chromatographic performance. Subsequently, nanoliter eluate fractions are collected at a rate of one fraction per second on a high-density microarray to retain the separation with high temporal resolution. Chromatographic separations of up to 45 min runtime can thus be archived on a single microarray possessing 2700 sample spots. The performance of this device is demonstrated by fractionating the separation of a tryptic digest of a known protein mixture onto the microarray chip and subsequently analyzing the sample archive using matrix-assisted laser desorption/ionization mass spectrometry (MALDI-MS). Resulting peak widths are found to be significantly reduced compared to standard continuous flow spotting technologies as well as in comparison to a conventional nano-LC-electrospray ionization-mass spectrometry interface. Moreover, we demonstrate the advantage of our high-definition nanofractionation device by applying two different MALDI matrices to all collected fractions in an alternating fashion. Since the information that is obtained from a MALDI-MS measurement depends on the choice of MALDI matrix, we can extract complementary information from neighboring spots containing almost identical composition but different matrices.

A Study on the Application of the Extended Matrices Based on TRIZ in Constructing a Collaborative Model of Enterprise Network

NASA Astrophysics Data System (ADS)

Yang, Yan; Shao, Yunfei; Tang, Xiaowo

Based on mass related literature on enterprise network, the key influence factors are reduced to Trust, Control, Relationship and Interaction. Meanwhile, the specific contradiction matrices, judgment matrices and strategy collections based on TRIZ are constructed which make the connotation of contradiction matrices in TRIZ extended. Finally they are applied to the construction of the collaborative model on enterprise network based on Multi Agent System (MAS).

Stimulating effect of graphene oxide on myogenesis of C2C12 myoblasts on RGD peptide-decorated PLGA nanofiber matrices.

PubMed

Shin, Yong Cheol; Lee, Jong Ho; Kim, Min Jeong; Hong, Suck Won; Kim, Bongju; Hyun, Jung Keun; Choi, Yu Suk; Park, Jong-Chul; Han, Dong-Wook

2015-01-01

In the field of biomedical engineering, many studies have focused on the possible applications of graphene and related nanomaterials due to their potential for use as scaffolds, coating materials and delivery carriers. On the other hand, electrospun nanofiber matrices composed of diverse biocompatible polymers have attracted tremendous attention for tissue engineering and regenerative medicine. However, their combination is intriguing and still challenging. In the present study, we fabricated nanofiber matrices composed of M13 bacteriophage with RGD peptide displayed on its surface (RGD-M13 phage) and poly(lactic-co-glycolic acid, PLGA) and characterized their physicochemical properties. In addition, the effect of graphene oxide (GO) on the cellular behaviors of C2C12 myoblasts, which were cultured on PLGA decorated with RGD-M13 phage (RGD/PLGA) nanofiber matrices, was investigated. Our results revealed that the RGD/PLGA nanofiber matrices have suitable physicochemical properties as a tissue engineering scaffold and the growth of C2C12 myoblasts were significantly enhanced on the matrices. Moreover, the myogenic differentiation of C2C12 myoblasts was substantially stimulated when they were cultured on the RGD/PLGA matrices in the presence of GO. In conclusion, these findings propose that the combination of RGD/PLGA nanofiber matrices and GO can be used as a promising strategy for skeletal tissue engineering and regeneration.

Electrospun Poly(lactic acid-co-glycolic acid) Scaffolds for Skin Tissue Engineering

PubMed Central

Kumbar, Sangamesh G.; Nukavarapu, Syam Prasad; James, Roshan; Nair, Lakshmi S.; Laurencin, Cato T.

2008-01-01

Electrospun fiber matrices composed of scaffolds of varying fiber diameters were investigated for potential application of severe skin loss. Few systematic studies have been performed to examine the effect of varying fiber diameter electrospun fiber matrices for skin regeneration. The present study reports the fabrication of poly[lactic acid-co-glycolic acid] (PLAGA) matrices with fiber diameters of 150–225, 200–300, 250–467, 500–900, 600–1200, 2500–3000 and 3250–6000 nm via electrospinning. All fiber matrices found to have a tensile modulus from 39.23 ± 8.15 to 79.21 ± 13.71 MPa which falls in the range for normal human skin. Further, the porous fiber matrices have porosity between 38–60 % and average pore diameters between 10–14µm. We evaluated the efficacy of these biodegradable fiber matrices as skin substitutes by seeding them with human skin fibroblasts (hSF). Human skin fibroblasts acquired a well spread morphology and showed significant progressive growth on fiber matrices in the 350–1100 nm diameter range. Collagen type III gene expression was significantly up-regulated in hSF seeded on matrices with fiber diameters in the range of 350–1100 nm. Based on the need, the proposed fiber skin substitutes can be successfully fabricated and optimized for skin fibroblast attachment and growth. PMID:18639927

Redistribution of Sr and rare earth elements in the matrices of CV3 carbonaceous chondrites during aqueous alteration in their parent body

NASA Astrophysics Data System (ADS)

Jogo, Kaori; Ito, Motoo; Nakamura, Tomoki; Kobayashi, Sachio; Lee, Jong Ik

2018-03-01

We measured the abundances of Sr and rare earth elements (REEs) in the matrices of five CV3 carbonaceous chondrites: Meteorite Hills (MET) 00430, MET 01070, La Paz ice field (LAP) 02206, Asuka (A) 881317 and Roberts Massif (RBT) 04143. In the MET 00430 and MET 01074 matrices, the Sr/CI and light REE (LREE, La-Nd)/CI ratios positively correlate with the amounts of Ca-rich secondary minerals, which formed during aqueous alteration in the CV3 chondrite parent body. In contrast, in the LAP 02206 and RBT 04143 matrices, although the Sr/CI ratios correlate with the amounts of Ca-rich secondary minerals, the LREE/CI ratios vary independently from the amounts of any secondary minerals. This suggests that the LREE/CI ratios in these matrices were produced prior to the parent body alteration, probably in the solar nebula. The LREE/CI ratios of the LAP 02206 and RBT 04143 matrices reveal the mixing process of matrix minerals prior to the accretion of the CV3 chondrite parent body. The mixing degrees of matrix minerals might be different between these two matrices. Because solid materials would be mixed over time according to the radial diffusion model of a turbulent disk, the matrix minerals consisting of LAP 02206 and RBT 04143 matrices might be incorporated into their parent body with different timing.

Matrix models and stochastic growth in Donaldson-Thomas theory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Szabo, Richard J.; Tierz, Miguel; Departamento de Analisis Matematico, Facultad de Ciencias Matematicas, Universidad Complutense de Madrid, Plaza de Ciencias 3, 28040 Madrid

We show that the partition functions which enumerate Donaldson-Thomas invariants of local toric Calabi-Yau threefolds without compact divisors can be expressed in terms of specializations of the Schur measure. We also discuss the relevance of the Hall-Littlewood and Jack measures in the context of BPS state counting and study the partition functions at arbitrary points of the Kaehler moduli space. This rewriting in terms of symmetric functions leads to a unitary one-matrix model representation for Donaldson-Thomas theory. We describe explicitly how this result is related to the unitary matrix model description of Chern-Simons gauge theory. This representation is used tomore » show that the generating functions for Donaldson-Thomas invariants are related to tau-functions of the integrable Toda and Toeplitz lattice hierarchies. The matrix model also leads to an interpretation of Donaldson-Thomas theory in terms of non-intersecting paths in the lock-step model of vicious walkers. We further show that these generating functions can be interpreted as normalization constants of a corner growth/last-passage stochastic model.« less

Continuous operation of four-state continuous-variable quantum key distribution system

NASA Astrophysics Data System (ADS)

Matsubara, Takuto; Ono, Motoharu; Oguri, Yusuke; Ichikawa, Tsubasa; Hirano, Takuya; Kasai, Kenta; Matsumoto, Ryutaroh; Tsurumaru, Toyohiro

2016-10-01

We report on the development of continuous-variable quantum key distribution (CV-QKD) system that are based on discrete quadrature amplitude modulation (QAM) and homodyne detection of coherent states of light. We use a pulsed light source whose wavelength is 1550 nm and repetition rate is 10 MHz. The CV-QKD system can continuously generate secret key which is secure against entangling cloner attack. Key generation rate is 50 kbps when the quantum channel is a 10 km optical fiber. The CV-QKD system we have developed utilizes the four-state and post-selection protocol [T. Hirano, et al., Phys. Rev. A 68, 042331 (2003).]; Alice randomly sends one of four states {|+/-α⟩,|+/-𝑖α⟩}, and Bob randomly performs x- or p- measurement by homodyne detection. A commercially available balanced receiver is used to realize shot-noise-limited pulsed homodyne detection. GPU cards are used to accelerate the software-based post-processing. We use a non-binary LDPC code for error correction (reverse reconciliation) and the Toeplitz matrix multiplication for privacy amplification.

Analysing generator matrices G of similar state but varying minimum determinants

NASA Astrophysics Data System (ADS)

Harun, H.; Razali, M. F.; Rahman, N. A. Abdul

2016-10-01

Since Tarokh discovered Space-Time Trellis Code (STTC) in 1998, a considerable effort has been done to improve the performance of the original STTC. One way of achieving enhancement is by focusing on the generator matrix G, which represents the encoder structure for STTC. Until now, researchers have only concentrated on STTCs of different states in analyzing the performance of generator matrix G. No effort has been made on different generator matrices G of similar state. The reason being, it is difficult to produce a wide variety of generator matrices G with diverse minimum determinants. In this paper a number of generator matrices G with minimum determinant of four (4), eight (8) and sixteen (16) of the same state (i.e., 4-PSK) have been successfully produced. The performance of different generator matrices G in term of their bit error rate and signal-to-noise ratio for a Rayleigh fading environment are compared and evaluated. It is found from the MATLAB simulation that at low SNR (<8), the BER of generator matrices G with smaller minimum determinant is comparatively lower than those of higher minimum determinant. However, at high SNR (>14) there is no significant difference between the BER of these generator matrices G.

Arrowheaded enhanced multivariance products representation for matrices (AEMPRM): Specifically focusing on infinite matrices and converting arrowheadedness to tridiagonality

NASA Astrophysics Data System (ADS)

Özdemir, Gizem; Demiralp, Metin

2015-12-01

In this work, Enhanced Multivariance Products Representation (EMPR) approach which is a Demiralp-and-his- group extension to the Sobol's High Dimensional Model Representation (HDMR) has been used as the basic tool. Their discrete form have also been developed and used in practice by Demiralp and his group in addition to some other authors for the decomposition of the arrays like vectors, matrices, or multiway arrays. This work specifically focuses on the decomposition of infinite matrices involving denumerable infinitely many rows and columns. To this end the target matrix is first decomposed to the sum of certain outer products and then each outer product is treated by Tridiagonal Matrix Enhanced Multivariance Products Representation (TMEMPR) which has been developed by Demiralp and his group. The result is a three-matrix- factor-product whose kernel (the middle factor) is an arrowheaded matrix while the pre and post factors are invertable matrices decomposed of the support vectors of TMEMPR. This new method is called as Arrowheaded Enhanced Multivariance Products Representation for Matrices. The general purpose is approximation of denumerably infinite matrices with the new method.

Transport on Riemannian manifold for functional connectivity-based classification.

PubMed

Ng, Bernard; Dressler, Martin; Varoquaux, Gaël; Poline, Jean Baptiste; Greicius, Michael; Thirion, Bertrand

2014-01-01

We present a Riemannian approach for classifying fMRI connectivity patterns before and after intervention in longitudinal studies. A fundamental difficulty with using connectivity as features is that covariance matrices live on the positive semi-definite cone, which renders their elements inter-related. The implicit independent feature assumption in most classifier learning algorithms is thus violated. In this paper, we propose a matrix whitening transport for projecting the covariance estimates onto a common tangent space to reduce the statistical dependencies between their elements. We show on real data that our approach provides significantly higher classification accuracy than directly using Pearson's correlation. We further propose a non-parametric scheme for identifying significantly discriminative connections from classifier weights. Using this scheme, a number of neuroanatomically meaningful connections are found, whereas no significant connections are detected with pure permutation testing.

A Divergence Median-based Geometric Detector with A Weighted Averaging Filter

NASA Astrophysics Data System (ADS)

Hua, Xiaoqiang; Cheng, Yongqiang; Li, Yubo; Wang, Hongqiang; Qin, Yuliang

2018-01-01

To overcome the performance degradation of the classical fast Fourier transform (FFT)-based constant false alarm rate detector with the limited sample data, a divergence median-based geometric detector on the Riemannian manifold of Heimitian positive definite matrices is proposed in this paper. In particular, an autocorrelation matrix is used to model the correlation of sample data. This method of the modeling can avoid the poor Doppler resolution as well as the energy spread of the Doppler filter banks result from the FFT. Moreover, a weighted averaging filter, conceived from the philosophy of the bilateral filtering in image denoising, is proposed and combined within the geometric detection framework. As the weighted averaging filter acts as the clutter suppression, the performance of the geometric detector is improved. Numerical experiments are given to validate the effectiveness of our proposed method.

Weighted LCS

NASA Astrophysics Data System (ADS)

Amir, Amihood; Gotthilf, Zvi; Shalom, B. Riva

The Longest Common Subsequence (LCS) of two strings A and B is a well studied problem having a wide range of applications. When each symbol of the input strings is assigned a positive weight the problem becomes the Heaviest Common Subsequence (HCS) problem. In this paper we consider a different version of weighted LCS on Position Weight Matrices (PWM). The Position Weight Matrix was introduced as a tool to handle a set of sequences that are not identical, yet, have many local similarities. Such a weighted sequence is a 'statistical image' of this set where we are given the probability of every symbol's occurrence at every text location. We consider two possible definitions of LCS on PWM. For the first, we solve the weighted LCS problem of z sequences in time O(zn z + 1). For the second, we prove \\cal{NP}-hardness and provide an approximation algorithm.

The method of similar operators in the study of the spectra of the adjacency matrices of graphs

NASA Astrophysics Data System (ADS)

Kozlukov, Serge

2018-03-01

The method of similar operators [1, 2, 3] is used to investigate spectral properties of a certain class of matrices in the context of graphs [4, 5]. Specifically, we consider the adjacency matrix of an “almost-complete graph”. Then we generalize the result to allow the matrices obtained as combinations of the Kronecker products [6, 7] and the small-norm perturbations. We derive the estimates of the spectra and the eigenvectors of such matrices.

Extraction Methodological Contributions Toward Ultra-Performance Liquid ChromatographyTime-of-Flight Mass Spectrometry: Quantification of Free GB from Various Food Matrices

DTIC Science & Technology

2016-02-01

SPECTROMETRY: QUANTIFICATION OF FREE GB FROM VARIOUS FOOD MATRICES ECBC-TR-1351 Sue Y. Bae Mark D. Winemiller RESEARCH AND TECHNOLOGY DIRECTORATE...Flight Mass Spectrometry: Quantification of Free GB from Various Food Matrices 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER...methylphosphonofluoridate (sarin, GB) in various food matrices. The development of a solid-phase extraction method using a normal-phase silica gel column for

Bunch-Kaufman factorization for real symmetric indefinite banded matrices

NASA Technical Reports Server (NTRS)

Jones, Mark T.; Patrick, Merrell L.

1989-01-01

The Bunch-Kaufman algorithm for factoring symmetric indefinite matrices was rejected for banded matrices because it destroys the banded structure of the matrix. Herein, it is shown that for a subclass of real symmetric matrices which arise in solving the generalized eigenvalue problem using Lanczos's method, the Bunch-Kaufman algorithm does not result in major destruction of the bandwidth. Space time complexities of the algorithm are given and used to show that the Bunch-Kaufman algorithm is a significant improvement over LU factorization.

EMQIT: a machine learning approach for energy based PWM matrix quality improvement.

PubMed

Smolinska, Karolina; Pacholczyk, Marcin

2017-08-01

Transcription factor binding affinities to DNA play a key role for the gene regulation. Learning the specificity of the mechanisms of binding TFs to DNA is important both to experimentalists and theoreticians. With the development of high-throughput methods such as, e.g., ChiP-seq the need to provide unbiased models of binding events has been made apparent. We present EMQIT a modification to the approach introduced by Alamanova et al. and later implemented as 3DTF server. We observed that tuning of Boltzmann factor weights, used for conversion of calculated energies to nucleotide probabilities, has a significant impact on the quality of the associated PWM matrix. Consequently, we proposed to use receiver operator characteristics curves and the 10-fold cross-validation to learn best weights using experimentally verified data from TRANSFAC database. We applied our method to data available for various TFs. We verified the efficiency of detecting TF binding sites by the 3DTF matrices improved with our technique using experimental data from the TRANSFAC database. The comparison showed a significant similarity and comparable performance between the improved and the experimental matrices (TRANSFAC). Improved 3DTF matrices achieved significantly higher AUC values than the original 3DTF matrices (at least by 0.1) and, at the same time, detected notably more experimentally verified TFBSs. The resulting new improved PWM matrices for analyzed factors show similarity to TRANSFAC matrices. Matrices had comparable predictive capabilities. Moreover, improved PWMs achieve better results than matrices downloaded from 3DTF server. Presented approach is general and applicable to any energy-based matrices. EMQIT is available online at http://biosolvers.polsl.pl:3838/emqit . This article was reviewed by Oliviero Carugo, Marek Kimmel and István Simon.

Biodegradable organic acid-crosslinked alkali-treated gelatins with anti-thrombogenic and endothelialization properties

PubMed Central

Inoue, Motoki; Sasaki, Makoto; Taguchi, Tetsushi

2012-01-01

Gelatins were crosslinked with organic acids and treated with alkali to impart to them endothelialization and anti-thrombogenic properties. These matrices were characterized by biochemical and physicochemical techniques. The amounts of residual amino groups in the matrices decreased with increasing crosslinker concentration. The matrices with the highest crosslinking densities showed excellent endothelial cell adhesion and proliferation. In addition, the adhesion of platelets and formation of fibrin networks on the matrices were suppressed with increasing crosslinker concentration. The matrices also exhibited excellent biodegradability, and the degradation rate decreased with increasing crosslinking density. All the organic acid-crosslinked alkali-treated gelatins showed excellent anti-thrombogenic and endothelialization properties, superior to those of glutaraldehyde-crosslinked alkali-treated gelatins. PMID:27877542

The food matrix affects the anthocyanin profile of fortified egg and dairy matrices during processing and in vitro digestion.

PubMed

Pineda-Vadillo, Carlos; Nau, Françoise; Guerin-Dubiard, Catherin; Jardin, Julien; Lechevalier, Valérie; Sanz-Buenhombre, Marisa; Guadarrama, Alberto; Tóth, Tamás; Csavajda, Éva; Hingyi, Hajnalka; Karakaya, Sibel; Sibakov, Juhani; Capozzi, Francesco; Bordoni, Alessandra; Dupont, Didier

2017-01-01

The aim of the present study was to understand to what extent the inclusion of anthocyanins into dairy and egg matrices could affect their stability after processing and their release and solubility during digestion. For this purpose, individual and total anthocyanin content of four different enriched matrices, namely custard dessert, milkshake, pancake and omelettete, was determined after their manufacturing and during in vitro digestion. Results showed that anthocyanin recovery after processing largely varied among matrices, mainly due to the treatments applied and the interactions developed with other food components. In terms of digestion, the present study showed that the inclusion of anthocyanins into food matrices could be an effective way to protect them against intestinal degradation, and also the incorporation of anthocyanins into matrices with different compositions and structures could represent an interesting and effective method to control the delivery of anthocyanins within the different compartments of the digestive tract. Copyright © 2016 Elsevier Ltd. All rights reserved.

Time series, correlation matrices and random matrix models

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vinayak; Seligman, Thomas H.

2014-01-08

In this set of five lectures the authors have presented techniques to analyze open classical and quantum systems using correlation matrices. For diverse reasons we shall see that random matrices play an important role to describe a null hypothesis or a minimum information hypothesis for the description of a quantum system or subsystem. In the former case various forms of correlation matrices of time series associated with the classical observables of some system. The fact that such series are necessarily finite, inevitably introduces noise and this finite time influence lead to a random or stochastic component in these time series.more » By consequence random correlation matrices have a random component, and corresponding ensembles are used. In the latter we use random matrices to describe high temperature environment or uncontrolled perturbations, ensembles of differing chaotic systems etc. The common theme of the lectures is thus the importance of random matrix theory in a wide range of fields in and around physics.« less

RGD peptide-displaying M13 bacteriophage/PLGA nanofibers as cell-adhesive matrices for smooth muscle cells

NASA Astrophysics Data System (ADS)

Shin, Yong Cheol; Lee, Jong Ho; Jin, Oh Seong; Lee, Eun Ji; Jin, Lin Hua; Kim, Chang-Seok; Hong, Suck Won; Han, Dong-Wook; Kim, Chuntae; Oh, Jin-Woo

2015-01-01

Extracellular matrices (ECMs) are network structures that play an essential role in regulating cellular growth and differentiation. In this study, novel nanofibrous matrices were fabricated by electrospinning M13 bacteriophage and poly(lactic- co-glycolic acid) (PLGA) and were shown to be structurally and functionally similar to natural ECMs. A genetically-engineered M13 bacteriophage was constructed to display Arg-Gly-Asp (RGD) peptides on its surface. The physicochemical properties of RGD peptide-displaying M13 bacteriophage (RGD-M13 phage)/PLGA nanofibers were characterized by using scanning electron microscopy and Fourier-transform infrared spectroscopy. We used immunofluorescence staining to confirm that M13 bacteriophages were homogenously distributed in RGD-M13 phage/PLGA matrices. Furthermore, RGD-M13 phage/PLGA nanofibrous matrices, having excellent biocompatibility, can enhance the behaviors of vascular smooth muscle cells. This result suggests that RGD-M13 phage/PLGA nanofibrous matrices have potentials to serve as tissue engineering scaffolds.

Reductions in finite-dimensional integrable systems and special points of classical r-matrices

NASA Astrophysics Data System (ADS)

Skrypnyk, T.

2016-12-01

For a given 𝔤 ⊗ 𝔤-valued non-skew-symmetric non-dynamical classical r-matrices r(u, v) with spectral parameters, we construct the general form of 𝔤-valued Lax matrices of finite-dimensional integrable systems satisfying linear r-matrix algebra. We show that the reduction in the corresponding finite-dimensional integrable systems is connected with "the special points" of the classical r-matrices in which they become degenerated. We also propose a systematic way of the construction of additional integrals of the Lax-integrable systems associated with the symmetries of the corresponding r-matrices. We consider examples of the Lax matrices and integrable systems that are obtained in the framework of the general scheme. Among them there are such physically important systems as generalized Gaudin systems in an external magnetic field, ultimate integrable generalization of Toda-type chains (including "modified" or "deformed" Toda chains), generalized integrable Jaynes-Cummings-Dicke models, integrable boson models generalizing Bose-Hubbard dimer models, etc.

Condition number estimation of preconditioned matrices.

PubMed

Kushida, Noriyuki

2015-01-01

The present paper introduces a condition number estimation method for preconditioned matrices. The newly developed method provides reasonable results, while the conventional method which is based on the Lanczos connection gives meaningless results. The Lanczos connection based method provides the condition numbers of coefficient matrices of systems of linear equations with information obtained through the preconditioned conjugate gradient method. Estimating the condition number of preconditioned matrices is sometimes important when describing the effectiveness of new preconditionerers or selecting adequate preconditioners. Operating a preconditioner on a coefficient matrix is the simplest method of estimation. However, this is not possible for large-scale computing, especially if computation is performed on distributed memory parallel computers. This is because, the preconditioned matrices become dense, even if the original matrices are sparse. Although the Lanczos connection method can be used to calculate the condition number of preconditioned matrices, it is not considered to be applicable to large-scale problems because of its weakness with respect to numerical errors. Therefore, we have developed a robust and parallelizable method based on Hager's method. The feasibility studies are curried out for the diagonal scaling preconditioner and the SSOR preconditioner with a diagonal matrix, a tri-daigonal matrix and Pei's matrix. As a result, the Lanczos connection method contains around 10% error in the results even with a simple problem. On the other hand, the new method contains negligible errors. In addition, the newly developed method returns reasonable solutions when the Lanczos connection method fails with Pei's matrix, and matrices generated with the finite element method.

Fibronectin alters the rate of formation and structure of the fibrin matrix.

PubMed

Ramanathan, Anand; Karuri, Nancy

2014-01-10

Plasma fibronectin is a vital component of the fibrin clot; however its role on clot structure is not clearly understood. The goal of this study was to examine the influence of fibronectin on the kinetics of formation, structural characteristics and composition of reconstituted fibrin clots or fibrin matrices. Fibrin matrices were formed by adding thrombin to 1, 2 or 4 mg/ml fibrinogen supplemented with 0-0.4 mg/ml fibronectin. The rate of fibrin matrix formation was then monitored by measuring light absorbance properties at different time points. Confocal microscopy of fluorescein conjugated fibrinogen was used to visualize the structural characteristics of fibrin matrices. The amount of fibronectin in fibrin matrices was determined through electrophoresis and immunoblotting of solubilized matrices. Fibronectin concentration positively correlated with the initial rate of fibrin matrix formation and with steady state light absorbance values of fibrin matrices. An increase in fibronectin concentration resulted in thinner and denser fibers in the fibrin matrices. Electrophoresis and immunoblotting showed that fibronectin was covalently and non-covalently bound to fibrin matrices and in the form of high molecular weight multimers. The formation of fibronectin multimers was attributed to cross-linking of fibronectin by trace amounts Factor XIIIa. These findings are novel because they link results from light absorbance studies to microcopy analyses and demonstrate an influence of fibronectin on fibrin matrix structural characteristics. This data is important in developing therapies that destabilize fibrin clots. Copyright © 2014. Published by Elsevier Inc.

The Modern Origin of Matrices and Their Applications

ERIC Educational Resources Information Center

Debnath, L.

2014-01-01

This paper deals with the modern development of matrices, linear transformations, quadratic forms and their applications to geometry and mechanics, eigenvalues, eigenvectors and characteristic equations with applications. Included are the representations of real and complex numbers, and quaternions by matrices, and isomorphism in order to show…

Enhancing Understanding of Transformation Matrices

ERIC Educational Resources Information Center

Dick, Jonathan; Childrey, Maria

2012-01-01

With the Common Core State Standards' emphasis on transformations, teachers need a variety of approaches to increase student understanding. Teaching matrix transformations by focusing on row vectors gives students tools to create matrices to perform transformations. This empowerment opens many doors: Students are able to create the matrices for…

TU-F-CAMPUS-J-04: Impact of Voxel Anisotropy On Statistic Texture Features of Oncologic PET: A Simulation Study

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yang, F; Byrd, D; Bowen, S

2015-06-15

Purpose: Texture metrics extracted from oncologic PET have been investigated with respect to their usefulness as definitive indicants for prognosis in a variety of cancer. Metric calculation is often based on cubic voxels. Most commonly used PET scanners, however, produce rectangular voxels, which may change texture metrics. The objective of this study was to examine the variability of PET texture feature metrics resulting from voxel anisotropy. Methods: Sinograms of NEMA NU-2 phantom for 18F-FDG were simulated using the ASIM simulation tool. The obtained projection data was reconstructed (3D-OSEM) on grids of cubic and rectangular voxels, producing PET images of resolutionmore » of 2.73x2.73x3.27mm3 and 3.27x3.27x3.27mm3, respectively. An interpolated dataset obtained from resampling the rectangular voxel data for isotropic voxel dimension (3.27mm) was also considered. For each image dataset, 28 texture parameters based on grey-level co-occurrence matrices (GLCOM), intensity histograms (GLIH), neighborhood difference matrices (GLNDM), and zone size matrices (GLZSM) were evaluated within lesions of diameter of 33, 28, 22, and 17mm. Results: In reference to the isotopic image data, texture features appearing on the rectangular voxel data varied with a range of -34-10% for GLCOM based, -31-39% for GLIH based, -80 -161% for GLNDM based, and −6–45% for GLZSM based while varied with a range of -35-23% for GLCOM based, -27-35% for GLIH based, -65-86% for GLNDM based, and -22 -18% for GLZSM based for the interpolated image data. For the anisotropic data, GLNDM-cplx exhibited the largest extent of variation (161%) while GLZSM-zp showed the least (<1%). As to the interpolated data, GLNDM-busy varied the most (86%) while GLIH-engy varied the least (<1%). Conclusion: Variability of texture appearance on oncologic PET with respect to voxel representation is substantial and feature-dependent. It necessitates consideration of standardized voxel representation for inter-institution studies attempting to validate prognostic values of PET texture features in cancer treatment.« less

Theory of quark mixing matrix and invariant functions of mass matrices

NASA Astrophysics Data System (ADS)

Jarloskog, C.

1987-10-01

The origin of the quark mixing matrix; super elementary theory of flavor projection operators; equivalences and invariances; the commutator formalism and CP violation; CP conditions for any number of families; the angle between the quark mass matrices; and application to Fritzsch and Stech mass matrices are discussed.

Analyzing Matrices of Meta-Analytic Correlations: Current Practices and Recommendations

ERIC Educational Resources Information Center

Sheng, Zitong; Kong, Wenmo; Cortina, Jose M.; Hou, Shuofei

2016-01-01

Researchers have become increasingly interested in conducting analyses on meta-analytic correlation matrices. Methodologists have provided guidance and recommended practices for the application of this technique. The purpose of this article is to review current practices regarding analyzing meta-analytic correlation matrices, to identify the gaps…

Simplicity and Typical Rank Results for Three-Way Arrays

ERIC Educational Resources Information Center

ten Berge, Jos M. F.

2011-01-01

Matrices can be diagonalized by singular vectors or, when they are symmetric, by eigenvectors. Pairs of square matrices often admit simultaneous diagonalization, and always admit block wise simultaneous diagonalization. Generalizing these possibilities to more than two (non-square) matrices leads to methods of simplifying three-way arrays by…

76 FR 31356 - Notice of Proposed Information Collection for Public Comment; Technical Assistance Experience...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-05-31

... Matrices AGENCY: Office of the Community Planning and Development. ACTION: Notice of proposed information..., Expertise, and Awards Received Matrices. Description of the need for the information proposed: The Technical Assistance Experience, Expertise, and Awards Received Matrices will allow the Office of Special Needs...

76 FR 35231 - Notice of Proposed Information Collection for Public Comment; McKinney-Vento Technical Assistance...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-06-16

... Information Collection for Public Comment; McKinney-Vento Technical Assistance Narrative, Matrices, and... Narrative, Matrices, and Reporting Requirements. Description of the need for the information proposed: McKinney- Vento Technical Assistance (MV-TA) Narrative, Matrices, and Reporting Requirements will allow the...

Random matrices with external source and the asymptotic behaviour of multiple orthogonal polynomials

DOE Office of Scientific and Technical Information (OSTI.GOV)

Aptekarev, Alexander I; Lysov, Vladimir G; Tulyakov, Dmitrii N

2011-02-28

Ensembles of random Hermitian matrices with a distribution measure defined by an anharmonic potential perturbed by an external source are considered. The limiting characteristics of the eigenvalue distribution of the matrices in these ensembles are related to the asymptotic behaviour of a certain system of multiple orthogonal polynomials. Strong asymptotic formulae are derived for this system. As a consequence, for matrices in this ensemble the limit mean eigenvalue density is found, and a variational principle is proposed to characterize this density. Bibliography: 35 titles.

Use of Mueller and non-Mueller matrices to describe polarization properties of telescope-based polarimeters

NASA Astrophysics Data System (ADS)

Seagraves, P. H.; Elmore, David F.

1994-09-01

Systems using optical elements such as linear polarizers, retarders, and mirrors can be represented by Mueller matrices. Some polarimeters include elements with time-varying polarization properties, multiple light beams, light detectors, and signal processing equipment. Standard Mueller matrix forms describing time-varying retarders, and beam splitters are presented, as well as non-Mueller matrices which describe detection and signal processing. These matrices provide a compact and intuitive mathematical description of polarimeter response which can aid in the refining of instrument designs.

Estimation for the Linear Model With Uncertain Covariance Matrices

NASA Astrophysics Data System (ADS)

Zachariah, Dave; Shariati, Nafiseh; Bengtsson, Mats; Jansson, Magnus; Chatterjee, Saikat

2014-03-01

We derive a maximum a posteriori estimator for the linear observation model, where the signal and noise covariance matrices are both uncertain. The uncertainties are treated probabilistically by modeling the covariance matrices with prior inverse-Wishart distributions. The nonconvex problem of jointly estimating the signal of interest and the covariance matrices is tackled by a computationally efficient fixed-point iteration as well as an approximate variational Bayes solution. The statistical performance of estimators is compared numerically to state-of-the-art estimators from the literature and shown to perform favorably.

Schur Complement Inequalities for Covariance Matrices and Monogamy of Quantum Correlations

NASA Astrophysics Data System (ADS)

Lami, Ludovico; Hirche, Christoph; Adesso, Gerardo; Winter, Andreas

2016-11-01

We derive fundamental constraints for the Schur complement of positive matrices, which provide an operator strengthening to recently established information inequalities for quantum covariance matrices, including strong subadditivity. This allows us to prove general results on the monogamy of entanglement and steering quantifiers in continuous variable systems with an arbitrary number of modes per party. A powerful hierarchical relation for correlation measures based on the log-determinant of covariance matrices is further established for all Gaussian states, which has no counterpart among quantities based on the conventional von Neumann entropy.

Schur Complement Inequalities for Covariance Matrices and Monogamy of Quantum Correlations.

PubMed

Lami, Ludovico; Hirche, Christoph; Adesso, Gerardo; Winter, Andreas

2016-11-25

We derive fundamental constraints for the Schur complement of positive matrices, which provide an operator strengthening to recently established information inequalities for quantum covariance matrices, including strong subadditivity. This allows us to prove general results on the monogamy of entanglement and steering quantifiers in continuous variable systems with an arbitrary number of modes per party. A powerful hierarchical relation for correlation measures based on the log-determinant of covariance matrices is further established for all Gaussian states, which has no counterpart among quantities based on the conventional von Neumann entropy.

Fidelity under isospectral perturbations: a random matrix study

NASA Astrophysics Data System (ADS)

Leyvraz, F.; García, A.; Kohler, H.; Seligman, T. H.

2013-07-01

The set of Hamiltonians generated by all unitary transformations from a single Hamiltonian is the largest set of isospectral Hamiltonians we can form. Taking advantage of the fact that the unitary group can be generated from Hermitian matrices we can take the ones generated by the Gaussian unitary ensemble with a small parameter as small perturbations. Similarly, the transformations generated by Hermitian antisymmetric matrices from orthogonal matrices form isospectral transformations among symmetric matrices. Based on this concept we can obtain the fidelity decay of a system that decays under a random isospectral perturbation with well-defined properties regarding time-reversal invariance. If we choose the Hamiltonian itself also from a classical random matrix ensemble, then we obtain solutions in terms of form factors in the limit of large matrices.

Retrieval of the non-depolarizing components of depolarizing Mueller matrices by using symmetry conditions and least squares minimization

NASA Astrophysics Data System (ADS)

Kuntman, Ertan; Canillas, Adolf; Arteaga, Oriol

2017-11-01

Experimental Mueller matrices contain certain amount of uncertainty in their elements and these uncertainties can create difficulties for decomposition methods based on analytic solutions. In an earlier paper [1], we proposed a decomposition method for depolarizing Mueller matrices by using certain symmetry conditions. However, because of the experimental error, that method creates over-determined systems with non-unique solutions. Here we propose to use least squares minimization approach in order to improve the accuracy of our results. In this method, we are taking into account the number of independent parameters of the corresponding symmetry and the rank constraints on the component matrices to decide on our fitting model. This approach is illustrated with experimental Mueller matrices that include material media with different Mueller symmetries.

Angiogenic response induced by acellular femoral matrix in vivo

PubMed Central

Conconi, Maria Teresa; Nico, Beatrice; Rebuffat, Piera; Crivellato, Enrico; Parnigotto, Pier Paolo; Nussdorfer, Gastone G; Ribatti, Domenico

2005-01-01

We investigated the angiogenic response induced by acellular femoral matrices implanted in vivo on to the chick embryo chorioallantoic membrane (CAM), a useful model for such investigation. The results showed that acellular matrices were able to induce a strong angiogenic response, comparable with that of fibroblast growth factor-2 (FGF-2), a well-known angiogenic cytokine. The angiogenic response was further increased when exogenous FGF-2 or transforming growth factor beta-1 (TGF-β1) was added to the matrices and inhibited by the addition of anti-FGF-2 or anti-TGF-β1 antibodies. The response may be considered to be dependent on a direct angiogenic effect exerted by the matrices, and also in part by the presence of FGF-2 and TGF-β1 in the acellular matrices. PMID:16011546

Introduction of organic/hydro-organic matrices in inductively coupled plasma optical emission spectrometry and mass spectrometry: a tutorial review. Part I. Theoretical considerations.

PubMed

Leclercq, Amélie; Nonell, Anthony; Todolí Torró, José Luis; Bresson, Carole; Vio, Laurent; Vercouter, Thomas; Chartier, Frédéric

2015-07-23

Due to their outstanding analytical performances, inductively coupled plasma optical emission spectrometry (ICP-OES) and mass spectrometry (ICP-MS) are widely used for multi-elemental measurements and also for isotopic characterization in the case of ICP-MS. While most studies are carried out in aqueous matrices, applications involving organic/hydro-organic matrices become increasingly widespread. This kind of matrices is introduced in ICP based instruments when classical "matrix removal" approaches such as acid digestion or extraction procedures cannot be implemented. Due to the physico-chemical properties of organic/hydro-organic matrices and their associated effects on instrumentation and analytical performances, their introduction into ICP sources is particularly challenging and has become a full topic. In this framework, numerous theoretical and phenomenological studies of these effects have been performed in the past, mainly by ICP-OES, while recent literature is more focused on applications and associated instrumental developments. This tutorial review, divided in two parts, explores the rich literature related to the introduction of organic/hydro-organic matrices in ICP-OES and ICP-MS. The present Part I, provides theoretical considerations in connection with the physico-chemical properties of organic/hydro-organic matrices, in order to better understand the induced phenomena. This focal point is divided in four chapters highlighting: (i) the impact of organic/hydro-organic matrices from aerosol generation to atomization/excitation/ionization processes; (ii) the production of carbon molecular constituents and their spatial distribution in the plasma with respect to analytes repartition; (iii) the subsequent modifications of plasma fundamental properties; and (iv) the resulting spectroscopic and non spectroscopic interferences. This first part of this tutorial review is addressed either to beginners or to more experienced scientists who are interested in the analysis of organic/hydro-organic matrices by ICP sources and would like to consider the theoretical background of effects induced by such matrices. The second part of this tutorial review will be dedicated to more practical consideration on instrumentation, such as adapted introductions devices, as well as instrumental and operating parameters optimization. The analytical strategies for elemental quantification in such matrices will also be addressed. Copyright © 2015 Elsevier B.V. All rights reserved.

Event-based criteria in GT-STAF information indices: theory, exploratory diversity analysis and QSPR applications.

PubMed

Barigye, S J; Marrero-Ponce, Y; Martínez López, Y; Martínez Santiago, O; Torrens, F; García Domenech, R; Galvez, J

2013-01-01

Versatile event-based approaches for the definition of novel information theory-based indices (IFIs) are presented. An event in this context is the criterion followed in the "discovery" of molecular substructures, which in turn serve as basis for the construction of the generalized incidence and relations frequency matrices, Q and F, respectively. From the resultant F, Shannon's, mutual, conditional and joint entropy-based IFIs are computed. In previous reports, an event named connected subgraphs was presented. The present study is an extension of this notion, in which we introduce other events, namely: terminal paths, vertex path incidence, quantum subgraphs, walks of length k, Sach's subgraphs, MACCs, E-state and substructure fingerprints and, finally, Ghose and Crippen atom-types for hydrophobicity and refractivity. Moreover, we define magnitude-based IFIs, introducing the use of the magnitude criterion in the definition of mutual, conditional and joint entropy-based IFIs. We also discuss the use of information-theoretic parameters as a measure of the dissimilarity of codified structural information of molecules. Finally, a comparison of the statistics for QSPR models obtained with the proposed IFIs and DRAGON's molecular descriptors for two physicochemical properties log P and log K of 34 derivatives of 2-furylethylenes demonstrates similar to better predictive ability than the latter.

Detection of nanomaterials in food and consumer products: bridging the gap from legislation to enforcement.

PubMed

Stamm, H; Gibson, N; Anklam, E

2012-08-01

This paper describes the requirements and resulting challenges for the implementation of current and upcoming European Union legislation referring to the use of nanomaterials in food, cosmetics and other consumer products. The European Commission has recently adopted a recommendation for the definition of nanomaterials. There is now an urgent need for appropriate and fit-for-purpose analytical methods in order to identify nanomaterials properly according to this definition and to assess whether or not a product contains nanomaterials. Considering the lack of such methods to date, this paper elaborates on the challenges of the legislative framework and the type of methods needed, not only to facilitate implementation of labelling requirements, but also to ensure the safety of products coming to the market. Considering the many challenges in the analytical process itself, such as interaction of nanoparticles with matrix constituents, potential agglomeration and aggregation due to matrix environment, broad variety of matrices, etc., there is a need for integrated analytical approaches, not only for sample preparation (e.g. separation from matrix), but also for the actual characterisation. Furthermore, there is an urgent need for quality assurance tools such as validated methods and (certified) reference materials, including materials containing nanoparticles in a realistic matrix (food products, cosmetics, etc.).

Distance descending ordering method: An O(n) algorithm for inverting the mass matrix in simulation of macromolecules with long branches

NASA Astrophysics Data System (ADS)

Xu, Xiankun; Li, Peiwen

2017-11-01

Fixman's work in 1974 and the follow-up studies have developed a method that can factorize the inverse of mass matrix into an arithmetic combination of three sparse matrices-one of them is positive definite and needs to be further factorized by using the Cholesky decomposition or similar methods. When the molecule subjected to study is of serial chain structure, this method can achieve O (n) time complexity. However, for molecules with long branches, Cholesky decomposition about the corresponding positive definite matrix will introduce massive fill-in due to its nonzero structure. Although there are several methods can be used to reduce the number of fill-in, none of them could strictly guarantee for zero fill-in for all molecules according to our test, and thus cannot obtain O (n) time complexity by using these traditional methods. In this paper we present a new method that can guarantee for no fill-in in doing the Cholesky decomposition, which was developed based on the correlations between the mass matrix and the geometrical structure of molecules. As a result, the inverting of mass matrix will remain the O (n) time complexity, no matter the molecule structure has long branches or not.

Definition of sizes for the design of school furniture for Bogotá schools based on anthropometric criteria.

PubMed

García-Acosta, G; Lange-Morales, K

2007-10-01

The current paper deals with the definition of sizes for the design of school furniture for schools in Bogotá, Colombia, based on an analysis of available anthropometric data on Latin American children. State-of-the-art anthropometric, national and international standards were considered, in order to define the anthropometric variables that were to be used for defining the furniture. Matrices relating age and specific anthropometric dimensions were constructed, as a visualization method for establishing the dimensional differences between children of the same age and the ranges that should be covered by the items of furniture. Dimensional data were grouped by establishing the minimum sizes and general dimensions of furniture needed to cover the 5-95th percentile of school children between the ages of 5 and 18 years. The distribution of the furniture in the different school grades was also indicated. Apart from the need for an adequate match between child anthropometry and school furniture dimensions, this study shows the importance of a proper distribution of furniture sizes in the different school grades, as a complementary and decisive aspect to be considered in order to meet the heterogenic, anthropometrical requirements of children of the same age and school grade.

Notes on quantitative structure-properties relationships (QSPR) (1): A discussion on a QSPR dimensionality paradox (QSPR DP) and its quantum resolution.

PubMed

Carbó-Dorca, Ramon; Gallegos, Ana; Sánchez, Angel J

2009-05-01

Classical quantitative structure-properties relationship (QSPR) statistical techniques unavoidably present an inherent paradoxical computational context. They rely on the definition of a Gram matrix in descriptor spaces, which is used afterwards to reduce the original dimension via several possible kinds of algebraic manipulations. From there, effective models for the computation of unknown properties of known molecular structures are obtained. However, the reduced descriptor dimension causes linear dependence within the set of discrete vector molecular representations, leading to positive semi-definite Gram matrices in molecular spaces. To resolve this QSPR dimensionality paradox (QSPR DP) here is proposed to adopt as starting point the quantum QSPR (QQSPR) computational framework perspective, where density functions act as infinite dimensional descriptors. The fundamental QQSPR equation, deduced from employing quantum expectation value numerical evaluation, can be approximately solved in order to obtain models exempt of the QSPR DP. The substitution of the quantum similarity matrix by an empirical Gram matrix in molecular spaces, build up with the original non manipulated discrete molecular descriptor vectors, permits to obtain classical QSPR models with the same characteristics as in QQSPR, that is: possessing a certain degree of causality and explicitly independent of the descriptor dimension. 2008 Wiley Periodicals, Inc.

Natural learning in NLDA networks.

PubMed

González, Ana; Dorronsoro, José R

2007-07-01

Non Linear Discriminant Analysis (NLDA) networks combine a standard Multilayer Perceptron (MLP) transfer function with the minimization of a Fisher analysis criterion. In this work we will define natural-like gradients for NLDA network training. Instead of a more principled approach, that would require the definition of an appropriate Riemannian structure on the NLDA weight space, we will follow a simpler procedure, based on the observation that the gradient of the NLDA criterion function J can be written as the expectation nablaJ(W)=E[Z(X,W)] of a certain random vector Z and defining then I=E[Z(X,W)Z(X,W)(t)] as the Fisher information matrix in this case. This definition of I formally coincides with that of the information matrix for the MLP or other square error functions; the NLDA J criterion, however, does not have this structure. Although very simple, the proposed approach shows much faster convergence than that of standard gradient descent, even when its costlier complexity is taken into account. While the faster convergence of natural MLP batch training can be also explained in terms of its relationship with the Gauss-Newton minimization method, this is not the case for NLDA training, as we will see analytically and numerically that the hessian and information matrices are different.

Estimating soil matric potential in Owens Valley, California

USGS Publications Warehouse

Sorenson, Stephen K.; Miller, Reuben F.; Welch, Michael R.; Groeneveld, David P.; Branson, Farrel A.

1989-01-01

Much of the floor of Owens Valley, California, is covered with alkaline scrub and alkaline meadow plant communities, whose existence is dependent partly on precipitation and partly on water infiltrated into the rooting zone from the shallow water table. The extent to which these plant communities are capable of adapting to and surviving fluctuations in the water table depends on physiological adaptations of the plants and on the water content, matric potential characteristics of the soils. Two methods were used to estimate soil matric potential in test sites in Owens Valley. The first, the filter-paper method, uses water content of filter papers equilibrated to water content of soil samples taken with a hand auger. The previously published calibration relations used to estimate soil matric potential from the water content of the filter papers were modified on the basis of current laboratory data. The other method of estimating soil matric potential was a modeling approach based on data from this and previous investigations. These data indicate that the base-10 logarithm of soil matric potential is a linear function of gravimetric soil water content for a particular soil. The slope and intercepts of this function vary with the texture and saturation capacity of the soil. Estimates of soil water characteristic curves were made at two sites by averaging the gravimetric soil water content and soil matric potential values from multiple samples at 0.1-m depth intervals derived by using the hand auger and filter-paper method and entering these values in the soil water model. The characteristic curves then were used to estimate soil matric potential from estimates of volumetric soil water content derived from neutron-probe readings. Evaluation of the modeling technique at two study sites indicated that estimates of soil matric potential within 0.5 pF units of the soil matric potential value derived by using the filter-paper method could be obtained 90 to 95 percent of the time in soils where water content was less than field capacity. The greatest errors occurred at depths where there was a distinct transition between soils of different textures.

Linking the Congenital Heart Surgery Databases of the Society of Thoracic Surgeons and the Congenital Heart Surgeons’ Society: Part 1—Rationale and Methodology

PubMed Central

Jacobs, Jeffrey P.; Pasquali, Sara K.; Austin, Erle; Gaynor, J. William; Backer, Carl; Hirsch-Romano, Jennifer C.; Williams, William G.; Caldarone, Christopher A.; McCrindle, Brian W.; Graham, Karen E.; Dokholyan, Rachel S.; Shook, Gregory J.; Poteat, Jennifer; Baxi, Maulik V.; Karamlou, Tara; Blackstone, Eugene H.; Mavroudis, Constantine; Mayer, John E.; Jonas, Richard A.; Jacobs, Marshall L.

2014-01-01

Purpose The Society of Thoracic Surgeons Congenital Heart Surgery Database (STS-CHSD) is the largest Registry in the world of patients who have undergone congenital and pediatric cardiac surgical operations. The Congenital Heart Surgeons’ Society Database (CHSS-D) is an Academic Database designed for specialized detailed analyses of specific congenital cardiac malformations and related treatment strategies. The goal of this project was to create a link between the STS-CHSD and the CHSS-D in order to facilitate studies not possible using either individual database alone and to help identify patients who are potentially eligible for enrollment in CHSS studies. Methods Centers were classified on the basis of participation in the STS-CHSD, the CHSS-D, or both. Five matrices, based on CHSS inclusionary criteria and STS-CHSD codes, were created to facilitate the automated identification of patients in the STS-CHSD who meet eligibility criteria for the five active CHSS studies. The matrices were evaluated with a manual adjudication process and were iteratively refined. The sensitivity and specificity of the original matrices and the refined matrices were assessed. Results In January 2012, a total of 100 centers participated in the STS-CHSD and 74 centers participated in the CHSS. A total of 70 centers participate in both and 40 of these 70 agreed to participate in this linkage project. The manual adjudication process and the refinement of the matrices resulted in an increase in the sensitivity of the matrices from 93% to 100% and an increase in the specificity of the matrices from 94% to 98%. Conclusion Matrices were created to facilitate the automated identification of patients potentially eligible for the five active CHSS studies using the STS-CHSD. These matrices have a sensitivity of 100% and a specificity of 98%. In addition to facilitating identification of patients potentially eligible for enrollment in CHSS studies, these matrices will allow (1) estimation of the denominator of patients potentially eligible for CHSS studies and (2) comparison of eligible and enrolled patients to potentially eligible and not enrolled patients to assess the generalizability of CHSS studies. PMID:24668974

Condition Number Estimation of Preconditioned Matrices

PubMed Central

Kushida, Noriyuki

2015-01-01

The present paper introduces a condition number estimation method for preconditioned matrices. The newly developed method provides reasonable results, while the conventional method which is based on the Lanczos connection gives meaningless results. The Lanczos connection based method provides the condition numbers of coefficient matrices of systems of linear equations with information obtained through the preconditioned conjugate gradient method. Estimating the condition number of preconditioned matrices is sometimes important when describing the effectiveness of new preconditionerers or selecting adequate preconditioners. Operating a preconditioner on a coefficient matrix is the simplest method of estimation. However, this is not possible for large-scale computing, especially if computation is performed on distributed memory parallel computers. This is because, the preconditioned matrices become dense, even if the original matrices are sparse. Although the Lanczos connection method can be used to calculate the condition number of preconditioned matrices, it is not considered to be applicable to large-scale problems because of its weakness with respect to numerical errors. Therefore, we have developed a robust and parallelizable method based on Hager’s method. The feasibility studies are curried out for the diagonal scaling preconditioner and the SSOR preconditioner with a diagonal matrix, a tri-daigonal matrix and Pei’s matrix. As a result, the Lanczos connection method contains around 10% error in the results even with a simple problem. On the other hand, the new method contains negligible errors. In addition, the newly developed method returns reasonable solutions when the Lanczos connection method fails with Pei’s matrix, and matrices generated with the finite element method. PMID:25816331

Graphene oxide-stimulated myogenic differentiation of C2C12 cells on PLGA/RGD peptide nanofiber matrices

NASA Astrophysics Data System (ADS)

Shin, Y. C.; Lee, J. H.; Kim, M. J.; Hong, S. W.; Oh, J.-W.; Kim, C.-S.; Kim, B.; Hyun, J. K.; Kim, Y.-J.; Han, D.-W.

2015-07-01

During the last decade, much attention has been paid to graphene-based nanomaterials because they are considered as potential candidates for biomedical applications such as scaffolds for tissue engineering and substrates for the differentiation of stem cells. Until now, electrospun matrices composed of various biodegradable copolymers have been extensively developed for tissue engineering and regeneration; however, their use in combination with graphene oxide (GO) is novel and challenging. In this study, nanofiber matrices composed of poly(lactic-co-glycolic acid, PLGA) and M13 phage with RGD peptide displayed on its surface (RGD peptide-M13 phage) were prepared as extracellular matrix (ECM)-mimicking substrates. RGD peptide is a tripeptide (Arg-Gly-Asp) found on ECM proteins that promotes various cellular behaviors. The physicochemical properties of PLGA and RGD peptide-M13 phage (PLGA/RGD peptide) nanofiber matrices were characterized by atomic force microscopy, Fourier-transform infrared spectroscopy and thermogravimetric analysis. In addition, the growth of C2C12 mouse myoblasts on the PLGA/RGD peptide matrices was examined by measuring the metabolic activity. Moreover, the differentiation of C2C12 mouse myoblasts on the matrices when treated with GO was evaluated. The cellular behaviors, including growth and differentiation of C2C12 mouse myoblasts, were substantially enhanced on the PLGA/RGD peptide nanofiber matrices when treated with GO. Overall, these findings suggest that the PLGA/RGD peptide nanofiber matrices can be used in combination with GO as a novel strategy for skeletal tissue regeneration.

Introduction to the QIAT Self-Evaluation Matrices

ERIC Educational Resources Information Center

Zabala, Joy Smiley; Carl, Diana F.

2004-01-01

The QIAT Self-Evaluation Matrices (QILT, 2001) were developed in response to formative evaluation data indicating a need for a model that could assist in the application of the Quality Indicators for Assistive Technology Services in Schools (Zabala, et al, 2000). The QIAT Matrices are based on the idea that change does not happen immediately, but…

Evaluation of an Approximate Method for Synthesizing Covariance Matrices for Use in Meta-Analytic SEM

ERIC Educational Resources Information Center

Beretvas, S. Natasha; Furlow, Carolyn F.

2006-01-01

Meta-analytic structural equation modeling (MA-SEM) is increasingly being used to assess model-fit for variables' interrelations synthesized across studies. MA-SEM researchers have analyzed synthesized correlation matrices using structural equation modeling (SEM) estimation that is designed for covariance matrices. This can produce incorrect…

An Alternative Method to Gauss-Jordan Elimination: Minimizing Fraction Arithmetic

ERIC Educational Resources Information Center

Smith, Luke; Powell, Joan

2011-01-01

When solving systems of equations by using matrices, many teachers present a Gauss-Jordan elimination approach to row reducing matrices that can involve painfully tedious operations with fractions (which I will call the traditional method). In this essay, I present an alternative method to row reduce matrices that does not introduce additional…

The Approximation of Two-Mode Proximity Matrices by Sums of Order-Constrained Matrices.

ERIC Educational Resources Information Center

Hubert, Lawrence; Arabie, Phipps

1995-01-01

A least-squares strategy is proposed for representing a two-mode proximity matrix as an approximate sum of a small number of matrices that satisfy certain simple order constraints on their entries. The primary class of constraints considered defines Q-forms for particular conditions in a two-mode matrix. (SLD)

Introduction to Matrix Algebra, Student's Text, Unit 23.

ERIC Educational Resources Information Center

Allen, Frank B.; And Others

Unit 23 in the SMSG secondary school mathematics series is a student text covering the following topics in matrix algebra: matrix operations, the algebra of 2 X 2 matrices, matrices and linear systems, representation of column matrices as geometric vectors, and transformations of the plane. Listed in the appendix are four research exercises in…

A Comparison between Element Salience versus Context as Item Difficulty Factors in Raven's Matrices

ERIC Educational Resources Information Center

Perez-Salas, Claudia P.; Streiner, David L.; Roberts, Maxwell J.

2012-01-01

The nature of contextual facilitation effects for items derived from Raven's Progressive Matrices was investigated in two experiments. For these, the original matrices were modified, creating either abstract versions with high element salience, or versions which comprised realistic entities set in familiar contexts. In order to replicate and…

Tracking Time Evolution of Collective Attention Clusters in Twitter: Time Evolving Nonnegative Matrix Factorisation.

PubMed

Saito, Shota; Hirata, Yoshito; Sasahara, Kazutoshi; Suzuki, Hideyuki

2015-01-01

Micro-blogging services, such as Twitter, offer opportunities to analyse user behaviour. Discovering and distinguishing behavioural patterns in micro-blogging services is valuable. However, it is difficult and challenging to distinguish users, and to track the temporal development of collective attention within distinct user groups in Twitter. In this paper, we formulate this problem as tracking matrices decomposed by Nonnegative Matrix Factorisation for time-sequential matrix data, and propose a novel extension of Nonnegative Matrix Factorisation, which we refer to as Time Evolving Nonnegative Matrix Factorisation (TENMF). In our method, we describe users and words posted in some time interval by a matrix, and use several matrices as time-sequential data. Subsequently, we apply Time Evolving Nonnegative Matrix Factorisation to these time-sequential matrices. TENMF can decompose time-sequential matrices, and can track the connection among decomposed matrices, whereas previous NMF decomposes a matrix into two lower dimension matrices arbitrarily, which might lose the time-sequential connection. Our proposed method has an adequately good performance on artificial data. Moreover, we present several results and insights from experiments using real data from Twitter.

Calibration and temperature correction of heat dissipation matric potential sensors

USGS Publications Warehouse

Flint, A.L.; Campbell, G.S.; Ellett, K.M.; Calissendorff, C.

2002-01-01

This paper describes how heat dissipation sensors, used to measure soil water matric potential, were analyzed to develop a normalized calibration equation and a temperature correction method. Inference of soil matric potential depends on a correlation between the variable thermal conductance of the sensor's porous ceramic and matric poten-tial. Although this correlation varies among sensors, we demonstrate a normalizing procedure that produces a single calibration relationship. Using sensors from three sources and different calibration methods, the normalized calibration resulted in a mean absolute error of 23% over a matric potential range of -0.01 to -35 MPa. Because the thermal conductivity of variably saturated porous media is temperature dependent, a temperature correction is required for application of heat dissipation sensors in field soils. A temperature correction procedure is outlined that reduces temperature dependent errors by 10 times, which reduces the matric potential measurement errors by more than 30%. The temperature dependence is well described by a thermal conductivity model that allows for the correction of measurements at any temperature to measurements at the calibration temperature.

Chitosan-Based Matrices Prepared by Gamma Irradiation for Tissue Regeneration: Structural Properties vs. Preparation Method.

PubMed

Casimiro, Maria Helena; Lancastre, Joana J H; Rodrigues, Alexandra P; Gomes, Susana R; Rodrigues, Gabriela; Ferreira, Luís M

2017-02-01

In the last decade, new generations of biopolymer-based materials have attracted attention, aiming its application as scaffolds for tissue engineering. These engineered three-dimensional scaffolds are designed to improve or replace damaged, missing, or otherwise compromised tissues or organs. Despite the number of promising methods that can be used to generate 3D cell-instructive matrices, the innovative nature of the present work relies on the application of ionizing radiation technology to form and modify surfaces and matrices with advantage over more conventional technologies (room temperature reaction, absence of harmful initiators or solvents, high penetration through the bulk materials, etc.), and the possibility of preparation and sterilization in one single step. The current chapter summarizes the work done by the authors in the gamma radiation processing of biocompatible and biodegradable chitosan-based matrices for skin regeneration. Particular attention is given to the correlation between the different preparation conditions and the final polymeric matrices' properties. We therefore expect to demonstrate that instructive matrices produced and improved by radiation technology bring to the field of skin regenerative medicine a supplemental advantage over more conservative techniques.

Introducing capillary electrophoresis with laser-induced fluorescence (CE-LIF) as a potential analysis and quantification tool for galactooligosaccharides extracted from complex food matrices.

PubMed

Albrecht, Simone; Schols, Henk A; Klarenbeek, Bert; Voragen, Alphons G J; Gruppen, Harry

2010-03-10

The analysis and quantification of (galacto)oligosaccharides from food matrices demands both a reproducible extraction method as well as a sensitive and accurate analytical method. Three typical matrices, namely, infant formula, fruit juice, and a maltodextrin-rich preparation, to which a commercial galactooligosaccharide mixture was added in a product concentration range from 1.25 to 30%, served as model substrates. Solid-phase extraction on graphitized carbon material upon enzymatic amyloglucosidase pretreatment enabled a good recovery and a selective purification of the different galactooligosaccharide structures from the exceeding amounts of particularly lactose and maltodextrins. With the implementation of capillary electrophoresis in combination with laser-induced fluorescence (CE-LIF) detection, a new possibility facilitating a sensitive qualitative and quantitative determination of the galactooligosaccharide contents in the different food matrices is outlined. Simultaneous monitoring and quantifying prebiotic oligosaccharides embedded in food matrices presents a promising and important step toward an efficient monitoring of individual oligosaccharides and is of interest for research areas dealing with small quantities of oligosaccharides embedded in complex matrices, e.g., body liquids.

The price of privately releasing contingency tables, and the spectra of random matrices with correlated rows

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kasiviswanathan, Shiva; Rudelson, Mark; Smith, Adam

2009-01-01

Contingency tables are the method of choice of government agencies for releasing statistical summaries of categorical data. In this paper, we consider lower bounds on how much distortion (noise) is necessary in these tables to provide privacy guarantees when the data being summarized is sensitive. We extend a line of recent work on lower bounds on noise for private data analysis [10, 13. 14, 15] to a natural and important class of functionalities. Our investigation also leads to new results on the spectra of random matrices with correlated rows. Consider a database D consisting of n rows (one per individual),more » each row comprising d binary attributes. For any subset of T attributes of size |T| = k, the marginal table for T has 2{sup k} entries; each entry counts how many times in the database a particular setting of these attributes occurs. Imagine an agency that wishes to release all (d/k) contingency tables for a given database. For constant k, previous work showed that distortion {tilde {Omicron}}(min{l_brace}n, (n{sup 2}d){sup 1/3}, {radical}d{sup k}{r_brace}) is sufficient for satisfying differential privacy, a rigorous definition of privacy that has received extensive recent study. Our main contributions are: (1) For {epsilon}- and ({epsilon}, {delta})-differential privacy (with {epsilon} constant and {delta} = 1/poly(n)), we give a lower bound of {tilde {Omega}}(min{l_brace}{radical}n, {radical}d{sup k}{r_brace}), which is tight for n = {tilde {Omega}}(d{sup k}). Moreover, for a natural and popular class of mechanisms based on additive noise, our bound can be strengthened to {Omega}({radical}d{sup k}), which is tight for all n. Our bounds extend even to non-constant k, losing roughly a factor of {radical}2{sup k} compared to the best known upper bounds for large n. (2) We give efficient polynomial time attacks which allow an adversary to reconstruct sensitive infonnation given insufficiently perturbed contingency table releases. For constant k, we obtain a lower bound of {tilde {Omega}}(min{l_brace}{radical}n, {radical}d{sup k}{r_brace}) that applies to a large class of privacy notions, including K-anonymity (along with its variants) and differential privacy. In contrast to our bounds for differential privacy, this bound (a) is shown only for constant k, but (b) is tight for all values of n when k is constant. (3) Our reconstruction-based attacks require a new lower bound on the least singular values of random matrices with correlated rows. For a constant k, consider a matrix M with (d/k) rows which are formed by taking all possible k-way entry-wise products of an underlying set of d random vectors. We show that even for nearly square matrices with d{sup k}/log d columns, the least singular value is {Omega}({radical}d{sup k}) with high probability - asymptotically, the same bound as one gets for a matrix with independent rows. The proof requires several new ideas for analyzing random matrices and could be of independent interest.« less

Synchronous correlation matrices and Connes’ embedding conjecture

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dykema, Kenneth J., E-mail: kdykema@math.tamu.edu; Paulsen, Vern, E-mail: vern@math.uh.edu

In the work of Paulsen et al. [J. Funct. Anal. (in press); preprint arXiv:1407.6918], the concept of synchronous quantum correlation matrices was introduced and these were shown to correspond to traces on certain C*-algebras. In particular, synchronous correlation matrices arose in their study of various versions of quantum chromatic numbers of graphs and other quantum versions of graph theoretic parameters. In this paper, we develop these ideas further, focusing on the relations between synchronous correlation matrices and microstates. We prove that Connes’ embedding conjecture is equivalent to the equality of two families of synchronous quantum correlation matrices. We prove thatmore » if Connes’ embedding conjecture has a positive answer, then the tracial rank and projective rank are equal for every graph. We then apply these results to more general non-local games.« less

Stabilization of chromium-bearing electroplating sludge with MSWI fly ash-based Friedel matrices.

PubMed

Qian, Guangren; Yang, Xiaoyan; Dong, Shixiang; Zhou, Jizhi; Sun, Ying; Xu, Yunfeng; Liu, Qiang

2009-06-15

This work investigated the feasibility and effectiveness of MSWI fly ash-based Friedel matrices on stabilizing/solidifying industrial chromium-bearing electroplating sludge using MSWI fly ash as the main raw material with a small addition of active aluminum. The compressive strength, leaching behavior and chemical speciation of heavy metals and hydration phases of matrices were characterized by TCLP, XRD, FTIR and other experimental methods. The results revealed that MSWI fly ash-based Friedel matrices could effectively stabilize chromium-bearing electroplating sludge, the formed ettringite and Friedel phases played a significant role in the fixation of heavy metals in electroplating sludge. The co-disposal of chromium-bearing electroplating sludge and MSWI fly ash-based Friedel matrices with a small addition of active aluminum is promising to be an effective way of stabilizing chromium-bearing electroplating sludge.

Performance Properties of Graphite Reinforced Composites with Advanced Resin Matrices

NASA Technical Reports Server (NTRS)

Kourtides, Demetrius A.

1980-01-01

This article looks at the effect of different resin matrices on thermal and mechanical properties of graphite composites, and relates the thermal and flammability properties to the anaerobic char yield of the resins. The processing parameters of graphite composites utilizing graphite fabric and epoxy or other advanced resins as matrices are presented. Thermoset resin matrices studied were: aminecured polyfunctional glycidyl aminetype epoxy (baseline), phenolicnovolac resin based on condensation of dihydroxymethyl-xylene and phenol cured with hexamine, two types of polydismaleimide resins, phenolic resin, and benzyl resin. The thermoplastic matrices studied were polyethersulfone and polyphenylenesulfone. Properties evaluated in the study included anaerobic char yield, limiting oxygen index, smoke evolution, moisture absorption, and mechanical properties at elevated temperatures including tensile, compressive, and short-beam shear strengths. Generally, it was determined that graphite composites with the highest char yield exhibited optimum fire-resistant properties.

Estimating soil matric potential in Owens Valley, California

USGS Publications Warehouse

Sorenson, Stephen K.; Miller, R.F.; Welch, M.R.; Groeneveld, D.P.; Branson, F.A.

1988-01-01

Much of the floor of the Owens Valley, California, is covered with alkaline scrub and alkaline meadow plant communities, whose existence is dependent partly on precipitation and partly on water infiltrated into the rooting zone from the shallow water table. The extent to which these plant communities are capable of adapting to and surviving fluctuations in the water table depends on physiological adaptations of the plants and on the water content, matric potential characteristics of the soils. Two methods were used to estimate soil matric potential in test sites in Owens Valley. The first was the filter-paper method, which uses water content of filter papers equilibrated to water content of soil samples taken with a hand auger. The other method of estimating soil matric potential was a modeling approach based on data from this and previous investigations. These data indicate that the base 10 logarithm of soil matric potential is a linear function of gravimetric soil water content for a particular soil. Estimates of soil water characteristic curves were made at two sites by averaging the gravimetric soil water content and soil matric potential values from multiple samples at 0.1 m depths derived by using the hand auger and filter paper method and entering these values in the soil water model. The characteristic curves then were used to estimate soil matric potential from estimates of volumetric soil water content derived from neutron-probe readings. Evaluation of the modeling technique at two study sites indicated that estimates of soil matric potential within 0.5 pF units of the soil matric potential value derived by using the filter paper method could be obtained 90 to 95% of the time in soils where water content was less than field capacity. The greatest errors occurred at depths where there was a distinct transition between soils of different textures. (Lantz-PTT)

Simple techniques for improving deep neural network outcomes on commodity hardware

NASA Astrophysics Data System (ADS)

Colina, Nicholas Christopher A.; Perez, Carlos E.; Paraan, Francis N. C.

2017-08-01

We benchmark improvements in the performance of deep neural networks (DNN) on the MNIST data test upon imple-menting two simple modifications to the algorithm that have little overhead computational cost. First is GPU parallelization on a commodity graphics card, and second is initializing the DNN with random orthogonal weight matrices prior to optimization. Eigenspectra analysis of the weight matrices reveal that the initially orthogonal matrices remain nearly orthogonal after training. The probability distributions from which these orthogonal matrices are drawn are also shown to significantly affect the performance of these deep neural networks.

Classical r-matrices for the generalised Chern–Simons formulation of 3d gravity

NASA Astrophysics Data System (ADS)

Osei, Prince K.; Schroers, Bernd J.

2018-04-01

We study the conditions for classical r-matrices to be compatible with the generalised Chern–Simons action for 3d gravity. Compatibility means solving the classical Yang–Baxter equations with a prescribed symmetric part for each of the real Lie algebras and bilinear pairings arising in the generalised Chern–Simons action. We give a new construction of r-matrices via a generalised complexification and derive a non-linear set of matrix equations determining the most general compatible r-matrix. We exhibit new families of solutions and show that they contain some known r-matrices for special parameter values.

Boundary reflection matrices for nonsimply laced affine Toda field theories

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kim, J.D.

The boundary reflection matrices for nonsimply laced affine Toda field theories defined on a half line with the Neumann boundary condition are investigated. The boundary reflection matrices for some pairs of the models are evaluated up to one loop order by perturbation theory. Then the exact boundary reflection matrices which are consistent with the one loop result are found under the assumption of {open_quote}{open_quote}duality{close_quote}{close_quote} and tested against algebraic consistency such as the boundary bootstrap equation and boundary crossing-unitarity relation. {copyright} {ital 1996 The American Physical Society.}

Central Limit Theorems for Linear Statistics of Heavy Tailed Random Matrices

NASA Astrophysics Data System (ADS)

Benaych-Georges, Florent; Guionnet, Alice; Male, Camille

2014-07-01

We show central limit theorems (CLT) for the linear statistics of symmetric matrices with independent heavy tailed entries, including entries in the domain of attraction of α-stable laws and entries with moments exploding with the dimension, as in the adjacency matrices of Erdös-Rényi graphs. For the second model, we also prove a central limit theorem of the moments of its empirical eigenvalues distribution. The limit laws are Gaussian, but unlike the case of standard Wigner matrices, the normalization is the one of the classical CLT for independent random variables.

Detection of Botulinum Neurotoxin Serotype A, B, and F Proteolytic Activity in Complex Matrices with Picomolar to Femtomolar Sensitivity

PubMed Central

Dunning, F. Mark; Ruge, Daniel R.; Piazza, Timothy M.; Stanker, Larry H.; Zeytin, Füsûn N.

2012-01-01

Rapid, high-throughput assays that detect and quantify botulinum neurotoxin (BoNT) activity in diverse matrices are required for environmental, clinical, pharmaceutical, and food testing. The current standard, the mouse bioassay, is sensitive but is low in throughput and precision. In this study, we present three biochemical assays for the detection and quantification of BoNT serotype A, B, and F proteolytic activities in complex matrices that offer picomolar to femtomolar sensitivity with small assay volumes and total assay times of less than 24 h. These assays consist of magnetic beads conjugated with BoNT serotype-specific antibodies that are used to purify BoNT from complex matrices before the quantification of bound BoNT proteolytic activity using the previously described BoTest reporter substrates. The matrices tested include human serum, whole milk, carrot juice, and baby food, as well as buffers containing common pharmaceutical excipients. The limits of detection were below 1 pM for BoNT/A and BoNT/F and below 10 pM for BoNT/B in most tested matrices using 200-μl samples and as low as 10 fM for BoNT/A with an increased sample volume. Together, these data describe rapid, robust, and high-throughput assays for BoNT detection that are compatible with a wide range of matrices. PMID:22923410

Influence of thermal annealing and radiation enhanced diffusion processes on surface plasmon resonance of gold implanted dielectric matrices

NASA Astrophysics Data System (ADS)

Devi, Ksh. Devarani; Ojha, Sunil; Singh, Fouran

2018-03-01

Gold nanoparticles (AuNPs) embedded in fused silica and sapphire dielectric matrices were synthesized by Au ion implantation. Systematic investigations were carried out to study the influence of implantation dose, post annealing temperature, swift heavy ion (SHI) irradiation and radiation enhanced diffusion (RED). Rutherford Backscattering Spectrometry (RBS) measurements were carried out to quantify concentration and depth profile of Au present in the host matrices. X-ray diffraction (XRD) was employed to characterize AuNPs formation. As-implanted and post-annealed films were irradiated using 100 MeV Ag ions to investigate the effect of electronic energy deposition on size and shape of NPs, which is estimated indirectly by the peak shape analysis of surface plasmon resonance (SPR). The effect of volume fraction of Au and their redistribution is also reported. A strong absorption in near infra red region is also noticed and understood by the formation of percolated NPs in dielectric matrices. It is quite clear from these results that the effect of RED assisted Oswald ripening is much more pronounced than the conventional Oswald ripening for the growth of NPs in the case of silica host matrices. However for sapphire matrices, it seems that growth of NPs already completed during implantation and it may be attributed to the high diffusivity of Au in sapphire matrices during implantation process.

The algebra of complex 2 × 2 matrices and a general closed Baker-Campbell-Hausdorff formula

NASA Astrophysics Data System (ADS)

Foulis, D. L.

2017-07-01

We derive a closed formula for the Baker-Campbell-Hausdorff series expansion in the case of complex 2×2 matrices. For arbitrary matrices A and B, and a matrix Z such that \\exp Z = \\exp A \\exp B , our result expresses Z as a linear combination of A and B, their commutator [A, B] , and the identity matrix I. The coefficients in this linear combination are functions of the traces and determinants of A and B, and the trace of their product. The derivation proceeds purely via algebraic manipulations of the given matrices and their products, making use of relations developed here, based on the Cayley-Hamilton theorem, as well as a characterization of the consequences of [A, B] and/or its determinant being zero or otherwise. As a corollary of our main result we also derive a closed formula for the Zassenhaus expansion. We apply our results to several special cases, most notably the parametrization of the product of two SU(2) matrices and a verification of the recent result of Van-Brunt and Visser (2015 J. Phys. A: Math. Theor. 48 225207) for complex 2×2 matrices, in this latter case deriving also the related Zassenhaus formula which turns out to be quite simple. We then show that this simple formula should be valid for all matrices and operators.

Image Restoration for Fluorescence Planar Imaging with Diffusion Model

PubMed Central

Gong, Yuzhu; Li, Yang

2017-01-01

Fluorescence planar imaging (FPI) is failure to capture high resolution images of deep fluorochromes due to photon diffusion. This paper presents an image restoration method to deal with this kind of blurring. The scheme of this method is conceived based on a reconstruction method in fluorescence molecular tomography (FMT) with diffusion model. A new unknown parameter is defined through introducing the first mean value theorem for definite integrals. System matrix converting this unknown parameter to the blurry image is constructed with the elements of depth conversion matrices related to a chosen plane named focal plane. Results of phantom and mouse experiments show that the proposed method is capable of reducing the blurring of FPI image caused by photon diffusion when the depth of focal plane is chosen within a proper interval around the true depth of fluorochrome. This method will be helpful to the estimation of the size of deep fluorochrome. PMID:29279843

Eigenproblem solution by a combined Sturm sequence and inverse iteration technique.

NASA Technical Reports Server (NTRS)

Gupta, K. K.

1973-01-01

Description of an efficient and numerically stable algorithm, along with a complete listing of the associated computer program, developed for the accurate computation of specified roots and associated vectors of the eigenvalue problem Aq = lambda Bq with band symmetric A and B, B being also positive-definite. The desired roots are first isolated by the Sturm sequence procedure; then a special variant of the inverse iteration technique is applied for the individual determination of each root along with its vector. The algorithm fully exploits the banded form of relevant matrices, and the associated program written in FORTRAN V for the JPL UNIVAC 1108 computer proves to be most significantly economical in comparison to similar existing procedures. The program may be conveniently utilized for the efficient solution of practical engineering problems, involving free vibration and buckling analysis of structures. Results of such analyses are presented for representative structures.

Quantitative conditions for time evolution in terms of the von Neumann equation

NASA Astrophysics Data System (ADS)

Wang, WenHua; Cao, HuaiXin; Chen, ZhengLi; Wang, Lie

2018-07-01

The adiabatic theorem describes the time evolution of the pure state and gives an adiabatic approximate solution to the Schödinger equation by choosing a single eigenstate of the Hamiltonian as the initial state. In quantum systems, states are divided into pure states (unite vectors) and mixed states (density matrices, i.e., positive operators with trace one). Accordingly, mixed states have their own corresponding time evolution, which is described by the von Neumann equation. In this paper, we discuss the quantitative conditions for the time evolution of mixed states in terms of the von Neumann equation. First, we introduce the definitions for uniformly slowly evolving and δ-uniformly slowly evolving with respect to mixed states, then we present a necessary and sufficient condition for the Hamiltonian of the system to be uniformly slowly evolving and we obtain some upper bounds for the adiabatic approximate error. Lastly, we illustrate our results in an example.

The formation of cobalt-bearing ferromanganese crusts under fluid destruction of silicate matter

NASA Astrophysics Data System (ADS)

Maksimov, S. O.; Safronov, P. P.

2016-02-01

The processes of fluid destruction of various silicate rocks under diffusion of flows of compressed gases (mainly carbonaceous) were studied. The gas condensate nature was ascertained for the forming alumoslilicate and ore (cobalt-iron-manganese hydroxide) substances produced under this fluid destruction in the forms of microcrusts and microconcretions. The ore condensates contained in high concentrations the typomorphic elements of oceanic ferromanganese formations (Mn, Co, Ni, Cu, Pb, Ce, and Pt). The elemental composition of the ore oxide substance formed under the destruction of various silicate matrices exhibits a definite degree of endemism with prevalence of the Co-Mn association. The pronounced concentration of barium is related to the substantially carbonaceous composition of the fluid systems. A cerium paradox is revealed: Ce3+ is oxidized into Ce4+ and absorbed by ferromanganese hydrogel and the minimum of cerium appears in rare-earth phosphates.

A probabilistic framework to infer brain functional connectivity from anatomical connections.

PubMed

Deligianni, Fani; Varoquaux, Gael; Thirion, Bertrand; Robinson, Emma; Sharp, David J; Edwards, A David; Rueckert, Daniel

2011-01-01

We present a novel probabilistic framework to learn across several subjects a mapping from brain anatomical connectivity to functional connectivity, i.e. the covariance structure of brain activity. This prediction problem must be formulated as a structured-output learning task, as the predicted parameters are strongly correlated. We introduce a model selection framework based on cross-validation with a parametrization-independent loss function suitable to the manifold of covariance matrices. Our model is based on constraining the conditional independence structure of functional activity by the anatomical connectivity. Subsequently, we learn a linear predictor of a stationary multivariate autoregressive model. This natural parameterization of functional connectivity also enforces the positive-definiteness of the predicted covariance and thus matches the structure of the output space. Our results show that functional connectivity can be explained by anatomical connectivity on a rigorous statistical basis, and that a proper model of functional connectivity is essential to assess this link.

A biconjugate gradient type algorithm on massively parallel architectures

NASA Technical Reports Server (NTRS)

Freund, Roland W.; Hochbruck, Marlis

1991-01-01

The biconjugate gradient (BCG) method is the natural generalization of the classical conjugate gradient algorithm for Hermitian positive definite matrices to general non-Hermitian linear systems. Unfortunately, the original BCG algorithm is susceptible to possible breakdowns and numerical instabilities. Recently, Freund and Nachtigal have proposed a novel BCG type approach, the quasi-minimal residual method (QMR), which overcomes the problems of BCG. Here, an implementation is presented of QMR based on an s-step version of the nonsymmetric look-ahead Lanczos algorithm. The main feature of the s-step Lanczos algorithm is that, in general, all inner products, except for one, can be computed in parallel at the end of each block; this is unlike the other standard Lanczos process where inner products are generated sequentially. The resulting implementation of QMR is particularly attractive on massively parallel SIMD architectures, such as the Connection Machine.

High-Density Signal Interface Electromagnetic Radiation Prediction for Electromagnetic Compatibility Evaluation.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Halligan, Matthew

Radiated power calculation approaches for practical scenarios of incomplete high- density interface characterization information and incomplete incident power information are presented. The suggested approaches build upon a method that characterizes power losses through the definition of power loss constant matrices. Potential radiated power estimates include using total power loss information, partial radiated power loss information, worst case analysis, and statistical bounding analysis. A method is also proposed to calculate radiated power when incident power information is not fully known for non-periodic signals at the interface. Incident data signals are modeled from a two-state Markov chain where bit state probabilities aremore » derived. The total spectrum for windowed signals is postulated as the superposition of spectra from individual pulses in a data sequence. Statistical bounding methods are proposed as a basis for the radiated power calculation due to the statistical calculation complexity to find a radiated power probability density function.« less

On the nonlocal predictions of quantum optics

NASA Technical Reports Server (NTRS)

Marshall, Trevor W.; Santos, Emilio; Vidiella-Barranco, Antonio

1994-01-01

We give a definition of locality in quantum optics based upon Bell's work, and show that locality has been violated in no experiment performed up to now. We argue that the interpretation of the Wigner function as a probability density gives a very attractive local realistic picture of quantum optics provided that this function is nonnegative. We conjecture that this is the case for all states which can be realized in the laboratory. In particular, we believe that the usual representation of 'single photon states' by a Fock state of the Hilbert space is not correct and that a more physical, although less simple mathematically, representation involves density matrices. We study in some detail the experiment showing anticorrelation after a beam splitter and prove that it naturally involves a positive Wigner function. Our (quantum) predictions for this experiment disagree with the ones reported in the literature.

Global Interactions Analysis of Epileptic ECoG Data

NASA Astrophysics Data System (ADS)

Ortega, Guillermo J.; Sola, Rafael G.; Pastor, Jesús

2007-05-01

Localization of the epileptogenic zone is an important issue in epileptology, even though there is not a unique definition of the epileptic focus. The objective of the present study is to test ultrametric analysis to uncover cortical interactions in human epileptic data. Correlation analysis has been carried out over intraoperative Electro-Corticography (ECoG) data in 2 patients suffering from temporal lobe epilepsy (TLE). Recordings were obtained using a grid of 20 electrodes (5×4) covering the lateral temporal lobe and a strip of either 4 or 8 electrodes at the mesial temporal lobe. Ultrametric analysis was performed in the averaged final correlation matrices. By using the matrix of linear correlation coefficients and the appropriate metric distance between pairs of electrodes time series, we were able to construct Minimum Spanning Trees (MST). The topological connectivity displayed by these trees gives useful and valuable information regarding physiological and pathological information in the temporal lobe of epileptic patients.

Polycyclic Aromatic Hydrocarbons and the Diffuse Interstellar Bands: a Survey

NASA Technical Reports Server (NTRS)

Salama, F.; Galazutdinov, G. A.; Krelowski, J.; Allamandola, L. J.; Musaev, F. A.; DeVincenzi, Donald L. (Technical Monitor)

1999-01-01

We discuss the proposal relating the origin of some of the diffuse interstellar bands (DIBs) to neutral and ionized polycyclic aromatic hydrocarbons (PAHs) present in interstellar clouds. Laboratory spectra of several PAHs, isolated at low temperature in inert gas matrices, are compared with an extensive set of astronomical spectra of reddened, early type stars. From this comparison, it is concluded that PAN ions are good candidates to explain some of the DIBs. Unambiguous assignments are difficult, however, due to the shift in wavelengths and the band broadening induced in the laboratory spectra by the solid matrix. Definitive band assignments and, ultimately, the test of the of the proposal that PAH ions carry some of the DIB must await the availability of gas-phase measurements in the laboratory. The present assessment offers a guideline for future laboratory experiments by allowing the preselection of promising PAH molecules to be studied in jet expansions.

A least-squares finite element method for 3D incompressible Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Jiang, Bo-Nan; Lin, T. L.; Hou, Lin-Jun; Povinelli, Louis A.

1993-01-01

The least-squares finite element method (LSFEM) based on the velocity-pressure-vorticity formulation is applied to three-dimensional steady incompressible Navier-Stokes problems. This method can accommodate equal-order interpolations, and results in symmetric, positive definite algebraic system. An additional compatibility equation, i.e., the divergence of vorticity vector should be zero, is included to make the first-order system elliptic. The Newton's method is employed to linearize the partial differential equations, the LSFEM is used to obtain discretized equations, and the system of algebraic equations is solved using the Jacobi preconditioned conjugate gradient method which avoids formation of either element or global matrices (matrix-free) to achieve high efficiency. The flow in a half of 3D cubic cavity is calculated at Re = 100, 400, and 1,000 with 50 x 52 x 25 trilinear elements. The Taylor-Gortler-like vortices are observed at Re = 1,000.

SDMS: A scientific data management system

NASA Technical Reports Server (NTRS)

Massena, W. A.

1978-01-01

SDMS is a data base management system developed specifically to support scientific programming applications. It consists of a data definition program to define the forms of data bases, and FORTRAN-compatible subroutine calls to create and access data within them. Each SDMS data base contains one or more data sets. A data set has the form of a relation. Each column of a data set is defined to be either a key or data element. Key elements must be scalar. Data elements may also be vectors or matrices. The data elements in each row of the relation form an element set. SDMS permits direct storage and retrieval of an element set by specifying the corresponding key element values. To support the scientific environment, SDMS allows the dynamic creation of data bases via subroutine calls. It also allows intermediate or scratch data to be stored in temporary data bases which vanish at job end.

Component Identification and Item Difficulty of Raven's Matrices Items.

ERIC Educational Resources Information Center

Green, Kathy E.; Kluever, Raymond C.

Item components that might contribute to the difficulty of items on the Raven Colored Progressive Matrices (CPM) and the Standard Progressive Matrices (SPM) were studied. Subjects providing responses to CPM items were 269 children aged 2 years 9 months to 11 years 8 months, most of whom were referred for testing as potentially gifted. A second…

Graph-Theoretic Representations for Proximity Matrices through Strongly-Anti-Robinson or Circular Strongly-Anti-Robinson Matrices.

ERIC Educational Resources Information Center

Hubert, Lawrence; Arabie, Phipps; Meulman, Jacqueline

1998-01-01

Introduces a method for fitting order-constrained matrices that satisfy the strongly anti-Robinson restrictions (SAR). The method permits a representation of the fitted values in a (least-squares) SAR approximating matrix as lengths of paths in a graph. The approach is illustrated with a published proximity matrix. (SLD)

On r-circulant matrices with Fibonacci and Lucas numbers having arithmetic indices

NASA Astrophysics Data System (ADS)

Bueno, Aldous Cesar F.

2017-11-01

We investigate r-circulant matrices whose entries are Fibonacci and Lucas numbers having arithmetic indices. We then solve for the eigenvalues, determinant, Euclidean norm and the bounds for the spectral norm of the matrices. We also present some special cases and some results on identities and divisibility. Lastly, we present an open problem.

Induction of human embryonic and induced pluripotent stem cells into urothelium.

PubMed

Osborn, Stephanie L; Thangappan, Ravikumar; Luria, Ayala; Lee, Justin H; Nolta, Jan; Kurzrock, Eric A

2014-05-01

In vitro generation of human urothelium from stem cells would be a major advancement in the regenerative medicine field, providing alternate nonurologic and/or nonautologous tissue sources for bladder grafts. Such a model would also help decipher the mechanisms of urothelial differentiation and would facilitate investigation of deviated differentiation of normal progenitors into urothelial cancer stem cells, perhaps elucidating areas of intervention for improved treatments. Thus far, in vitro derivation of urothelium from human embryonic stem cells (hESCs) or human induced pluripotent stem (hiPS) cells has not been reported. The goal of this work was to develop an efficient in vitro protocol for the induction of hESCs into urothelium through an intermediary definitive endoderm step and free of matrices and cell contact. During directed differentiation in a urothelial-specific medium ("Uromedium"), hESCs produced up to 60% urothelium, as determined by uroplakin expression; subsequent propagation selected for 90% urothelium. Alteration of the epithelial and mesenchymal cell signaling contribution through noncell contact coculture or conditioned media did not enhance the production of urothelium. Temporospatial evaluation of transcription factors known to be involved in urothelial specification showed association of IRF1, GET1, and GATA4 with uroplakin expression. Additional hESC and hiPS cell lines could also be induced into urothelium using this in vitro system. These results demonstrate that derivation and propagation of urothelium from hESCs and hiPS cells can be efficiently accomplished in vitro in the absence of matrices, cell contact, or adult cell signaling and that the induction process appears to mimic normal differentiation.

Induction of Human Embryonic and Induced Pluripotent Stem Cells Into Urothelium

PubMed Central

Osborn, Stephanie L.; Thangappan, Ravikumar; Luria, Ayala; Lee, Justin H.; Nolta, Jan

2014-01-01

In vitro generation of human urothelium from stem cells would be a major advancement in the regenerative medicine field, providing alternate nonurologic and/or nonautologous tissue sources for bladder grafts. Such a model would also help decipher the mechanisms of urothelial differentiation and would facilitate investigation of deviated differentiation of normal progenitors into urothelial cancer stem cells, perhaps elucidating areas of intervention for improved treatments. Thus far, in vitro derivation of urothelium from human embryonic stem cells (hESCs) or human induced pluripotent stem (hiPS) cells has not been reported. The goal of this work was to develop an efficient in vitro protocol for the induction of hESCs into urothelium through an intermediary definitive endoderm step and free of matrices and cell contact. During directed differentiation in a urothelial-specific medium (“Uromedium”), hESCs produced up to 60% urothelium, as determined by uroplakin expression; subsequent propagation selected for 90% urothelium. Alteration of the epithelial and mesenchymal cell signaling contribution through noncell contact coculture or conditioned media did not enhance the production of urothelium. Temporospatial evaluation of transcription factors known to be involved in urothelial specification showed association of IRF1, GET1, and GATA4 with uroplakin expression. Additional hESC and hiPS cell lines could also be induced into urothelium using this in vitro system. These results demonstrate that derivation and propagation of urothelium from hESCs and hiPS cells can be efficiently accomplished in vitro in the absence of matrices, cell contact, or adult cell signaling and that the induction process appears to mimic normal differentiation. PMID:24657961

Occupational Exposure to Electric Shocks and Magnetic Fields and Amyotrophic Lateral Sclerosis in Sweden.

PubMed

Fischer, Heidi; Kheifets, Leeka; Huss, Anke; Peters, Tracy L; Vermeulen, Roel; Ye, Weimin; Fang, Fang; Wiebert, Pernilla; Vergara, Ximena P; Feychting, Maria

2015-11-01

Amyotrophic lateral sclerosis (ALS) has been consistently related to "electric occupations," but associations with magnetic field levels were generally weaker than those with electrical occupations. Exposure to electric shock has been suggested as a possible explanation. Furthermore, studies were generally based on mortality or prevalence of ALS, and studies often had limited statistical power. Using two electric shock and three magnetic field job-exposure matrices, we evaluated the relationship of occupational magnetic fields, electric shocks, electric occupations, and incident ALS in a large population-based nested case-control study in Sweden. Subanalyses, specified a priori, were performed for subjects by gender and by age (less than and more than 65 years). Overall, we did not observe any associations between occupational magnetic field or electric shock exposure and ALS. For individuals less than 65 years old, high electric shock exposure was associated with an odds ratio (OR) of 1.22 (95% confidence interval [CI] = 1.03, 1.43). The corresponding result for the age group 65 years or older was OR = 0.92 (95% CI = 0.81, 1.05). Results were similar regardless which job exposure matrices, exposure definitions, or cutpoints were used. For electric occupations, ORs were close to unity, regardless of age. For welders, no association was observed overall, although for welders <65 years the OR was 1.52 (95% CI = 1.05, 2.21). In this very large population-based study based on incident ALS case subjects, we did not confirm previous observations of higher risk of ALS in electrical occupations, and provided only weak support for associations between electric shocks and ALS.

Development of Finite Elements for Two-Dimensional Structural Analysis Using the Integrated Force Method

NASA Technical Reports Server (NTRS)

Kaljevic, Igor; Patnaik, Surya N.; Hopkins, Dale A.

1996-01-01

The Integrated Force Method has been developed in recent years for the analysis of structural mechanics problems. This method treats all independent internal forces as unknown variables that can be calculated by simultaneously imposing equations of equilibrium and compatibility conditions. In this paper a finite element library for analyzing two-dimensional problems by the Integrated Force Method is presented. Triangular- and quadrilateral-shaped elements capable of modeling arbitrary domain configurations are presented. The element equilibrium and flexibility matrices are derived by discretizing the expressions for potential and complementary energies, respectively. The displacement and stress fields within the finite elements are independently approximated. The displacement field is interpolated as it is in the standard displacement method, and the stress field is approximated by using complete polynomials of the correct order. A procedure that uses the definitions of stress components in terms of an Airy stress function is developed to derive the stress interpolation polynomials. Such derived stress fields identically satisfy the equations of equilibrium. Moreover, the resulting element matrices are insensitive to the orientation of local coordinate systems. A method is devised to calculate the number of rigid body modes, and the present elements are shown to be free of spurious zero-energy modes. A number of example problems are solved by using the present library, and the results are compared with corresponding analytical solutions and with results from the standard displacement finite element method. The Integrated Force Method not only gives results that agree well with analytical and displacement method results but also outperforms the displacement method in stress calculations.

Self-organization in a simple model of adaptive agents playing 2×2 games with arbitrary payoff matrices

NASA Astrophysics Data System (ADS)

Fort, H.; Viola, S.

2004-03-01

We analyze, both analytically and numerically, the self-organization of a system of “selfish” adaptive agents playing an arbitrary iterated pairwise game (defined by a 2×2 payoff matrix). Examples of possible games to play are the prisoner’s dilemma (PD) game, the chicken game, the hero game, etc. The agents have no memory, use strategies not based on direct reciprocity nor “tags” and are chosen at random, i.e., geographical vicinity is neglected. They can play two possible strategies: cooperate (C) or defect (D). The players measure their success by comparing their utilities with an estimate for the expected benefits and update their strategy following a simple rule. Two versions of the model are studied: (1) the deterministic version (the agents are either in definite states C or D) and (2) the stochastic version (the agents have a probability c of playing C). Using a general master equation we compute the equilibrium states into which the system self-organizes, characterized by their average probability of cooperation ceq. Depending on the payoff matrix, we show that ceq can take five different values. We also consider the mixing of agents using two different payoff matrices and show that any value of ceq can be reached by tuning the proportions of agents using each payoff matrix. In particular, this can be used as a way to simulate the effect of a fraction d of “antisocial” individuals—incapable of realizing any value to cooperation—on the cooperative regime hold by a population of neutral or “normal” agents.

Self-organization in a simple model of adaptive agents playing 2 x 2 games with arbitrary payoff matrices.

PubMed

Fort, H; Viola, S

2004-03-01

We analyze, both analytically and numerically, the self-organization of a system of "selfish" adaptive agents playing an arbitrary iterated pairwise game (defined by a 2 x 2 payoff matrix). Examples of possible games to play are the prisoner's dilemma (PD) game, the chicken game, the hero game, etc. The agents have no memory, use strategies not based on direct reciprocity nor "tags" and are chosen at random, i.e., geographical vicinity is neglected. They can play two possible strategies: cooperate (C) or defect (D). The players measure their success by comparing their utilities with an estimate for the expected benefits and update their strategy following a simple rule. Two versions of the model are studied: (1) the deterministic version (the agents are either in definite states C or D) and (2) the stochastic version (the agents have a probability c of playing C). Using a general master equation we compute the equilibrium states into which the system self-organizes, characterized by their average probability of cooperation c(eq). Depending on the payoff matrix, we show that c(eq) can take five different values. We also consider the mixing of agents using two different payoff matrices and show that any value of c(eq) can be reached by tuning the proportions of agents using each payoff matrix. In particular, this can be used as a way to simulate the effect of a fraction d of "antisocial" individuals--incapable of realizing any value to cooperation--on the cooperative regime hold by a population of neutral or "normal" agents.

Mean Green operators of deformable fiber networks embedded in a compliant matrix and property estimates

NASA Astrophysics Data System (ADS)

Franciosi, Patrick; Spagnuolo, Mario; Salman, Oguz Umut

2018-04-01

Composites comprising included phases in a continuous matrix constitute a huge class of meta-materials, whose effective properties, whether they be mechanical, physical or coupled, can be selectively optimized by using appropriate phase arrangements and architectures. An important subclass is represented by "network-reinforced matrices," say those materials in which one or more of the embedded phases are co-continuous with the matrix in one or more directions. In this article, we present a method to study effective properties of simple such structures from which more complex ones can be accessible. Effective properties are shown, in the framework of linear elasticity, estimable by using the global mean Green operator for the entire embedded fiber network which is by definition through sample spanning. This network operator is obtained from one of infinite planar alignments of infinite fibers, which the network can be seen as an interpenetrated set of, with the fiber interactions being fully accounted for in the alignments. The mean operator of such alignments is given in exact closed form for isotropic elastic-like or dielectric-like matrices. We first exemplify how these operators relevantly provide, from classic homogenization frameworks, effective properties in the case of 1D fiber bundles embedded in an isotropic elastic-like medium. It is also shown that using infinite patterns with fully interacting elements over their whole influence range at any element concentration suppresses the dilute approximation limit of these frameworks. We finally present a construction method for a global operator of fiber networks described as interpenetrated such bundles.

Skin Equivalent Tissue-Engineered Construct: Co-Cultured Fibroblasts/ Keratinocytes on 3D Matrices of Sericin Hope Cocoons

PubMed Central

Nayak, Sunita; Dey, Sancharika; Kundu, Subhas C.

2013-01-01

The development of effective and alternative tissue-engineered skin replacements to autografts, allografts and xenografts has became a clinical requirement due to the problems related to source of donor tissue and the perceived risk of disease transmission. In the present study 3D tissue engineered construct of sericin is developed using co-culture of keratinocytes on the upper surface of the fabricated matrices and with fibroblasts on lower surface. Sericin is obtained from “Sericin Hope” silkworm of Bombyx mori mutant and is extracted from cocoons by autoclave. Porous sericin matrices are prepared by freeze dried method using genipin as crosslinker. The matrices are characterized biochemically and biophysically. The cell proliferation and viability of co-cultured fibroblasts and keratinocytes on matrices for at least 28 days are observed by live/dead assay, Alamar blue assay, and by dual fluorescent staining. The growth of the fibroblasts and keratinocytes in co-culture is correlated with the expression level of TGF-β, b-FGF and IL-8 in the cultured supernatants by enzyme-linked immunosorbent assay. The histological analysis further demonstrates a multi-layered stratified epidermal layer of uninhibited keratinocytes in co-cultured constructs. Presence of involucrin, collagen IV and the fibroblast surface protein in immuno-histochemical stained sections of co-cultured matrices indicates the significance of paracrine signaling between keratinocytes and fibroblasts in the expression of extracellular matrix protein for dermal repair. No significant amount of pro inflammatory cytokines (TNF-α, IL-1β and nitric oxide) production are evidenced when macrophages grown on the sericin matrices. The results all together depict the potentiality of sericin 3D matrices as skin equivalent tissue engineered construct in wound repair. PMID:24058626

Skin equivalent tissue-engineered construct: co-cultured fibroblasts/ keratinocytes on 3D matrices of sericin hope cocoons.

PubMed

Nayak, Sunita; Dey, Sancharika; Kundu, Subhas C

2013-01-01

The development of effective and alternative tissue-engineered skin replacements to autografts, allografts and xenografts has became a clinical requirement due to the problems related to source of donor tissue and the perceived risk of disease transmission. In the present study 3D tissue engineered construct of sericin is developed using co-culture of keratinocytes on the upper surface of the fabricated matrices and with fibroblasts on lower surface. Sericin is obtained from "Sericin Hope" silkworm of Bombyx mori mutant and is extracted from cocoons by autoclave. Porous sericin matrices are prepared by freeze dried method using genipin as crosslinker. The matrices are characterized biochemically and biophysically. The cell proliferation and viability of co-cultured fibroblasts and keratinocytes on matrices for at least 28 days are observed by live/dead assay, Alamar blue assay, and by dual fluorescent staining. The growth of the fibroblasts and keratinocytes in co-culture is correlated with the expression level of TGF-β, b-FGF and IL-8 in the cultured supernatants by enzyme-linked immunosorbent assay. The histological analysis further demonstrates a multi-layered stratified epidermal layer of uninhibited keratinocytes in co-cultured constructs. Presence of involucrin, collagen IV and the fibroblast surface protein in immuno-histochemical stained sections of co-cultured matrices indicates the significance of paracrine signaling between keratinocytes and fibroblasts in the expression of extracellular matrix protein for dermal repair. No significant amount of pro inflammatory cytokines (TNF-α, IL-1β and nitric oxide) production are evidenced when macrophages grown on the sericin matrices. The results all together depict the potentiality of sericin 3D matrices as skin equivalent tissue engineered construct in wound repair.

Agricultural matrices affect ground ant assemblage composition inside forest fragments

PubMed Central

Dos Santos, Iracenir Andrade; Ramos, Flavio Nunes; Majer, Jonathan David; Vilela, Evaldo Ferreira

2018-01-01

The establishment of agricultural matrices generally involves deforestation, which leads to fragmentation of the remaining forest. This fragmentation can affect forest dynamics both positively and negatively. Since most animal species are affected, certain groups can be used to measure the impact of such fragmentation. This study aimed to measure the impacts of agricultural crops (matrices) on ant communities of adjacent lower montane Atlantic rainforest fragments. We sampled nine forest fragments at locations surrounded by different agricultural matrices, namely: coffee (3 replicates); sugarcane (3); and pasture (3). At each site we installed pitfall traps along a 500 m transect from the interior of the matrix to the interior of the fragment (20 pitfall traps ~25 m apart). Each transect was partitioned into four categories: interior of the matrix; edge of the matrix; edge of the fragment; and interior of the fragment. For each sample site, we measured ant species richness and ant community composition within each transect category. Ant richness and composition differed between fragments and matrices. Each sample location had a specific composition of ants, probably because of the influence of the nature and management of the agricultural matrices. Species composition in the coffee matrix had the highest similarity to its corresponding fragment. The variability in species composition within forest fragments surrounded by pasture was greatest when compared with forest fragments surrounded by sugarcane or, to a lesser extent, coffee. Functional guild composition differed between locations, but the most representative guild was ‘generalist’ both in the agricultural matrices and forest fragments. Our results are important for understanding how agricultural matrices act on ant communities, and also, how these isolated forest fragments could act as an island of biodiversity in an ‘ocean of crops’. PMID:29791493

Cell-Adhesive Matrices Composed of RGD Peptide-Displaying M13 Bacteriophage/Poly(lactic-co-glycolic acid) Nanofibers Beneficial to Myoblast Differentiation.

PubMed

Shin, Yong Cheol; Lee, Jong Ho; Jin, Linhua; Kim, Min Jeong; Kim, Chuntae; Hong, Suck Won; Oh, Jin Woo; Han, Dong-Wook

2015-10-01

Recently, there has been considerable effort to develop suitable scaffolds for tissue engineering applications. Cell adhesion is a prerequisite for cells to survive. In nature, the extracellular matrix (ECM) plays this role. Therefore, an ideal scaffold should be structurally similar to the natural ECM and have biocompatibility and biodegradability. In addition, the scaffold should have biofunctionality, which provides the potent ability to enhance the cellular behaviors, such as adhesion, proliferation and differentiation. This study concentrates on fabricating cell-adhesive matrices composed of RGD peptide-displaying M13 bacteriophage (RGD-M13 phage) and poly(lactic-co-glycolic acid, PLGA) nanofibers. Long rod-shaped M13 bacteriophages are non-toxic and can express many desired proteins on their surface. A genetically engineered M13 phage was constructed to display RGD peptides on its surface. PLGA is a biodegradable polymer with excellent biocompatibility and suitable physicochemical property for adhesive matrices. In this study, RGD-M13 phage/PLGA hybrid nanofiber matrices were fabricated by electrospinning. The physicochemical properties of these matrices were characterized by scanning electron microscopy, atomic force microscopy, Raman spectroscopy, and contact angle measurement. In addition, the cellular behaviors, such as the initial attachment, proliferation and differentiation, were analyzed by a CCK-8 assay and immunofluorescence staining to evaluate the potential application of these matrices to tissue engineering scaffolds. The RGD-M13 phage/PLGA nanofiber matrices could enhance the cellular behaviors and promote the differentiation of C2C12 myoblasts. These results suggest that the RGD-M13 phage/PLGA nanofiber matrices are beneficial to myoblast differentiation and can serve as effective tissue engineering scaffolds.

Agricultural matrices affect ground ant assemblage composition inside forest fragments.

PubMed

Assis, Diego Santana; Dos Santos, Iracenir Andrade; Ramos, Flavio Nunes; Barrios-Rojas, Katty Elena; Majer, Jonathan David; Vilela, Evaldo Ferreira

2018-01-01

The establishment of agricultural matrices generally involves deforestation, which leads to fragmentation of the remaining forest. This fragmentation can affect forest dynamics both positively and negatively. Since most animal species are affected, certain groups can be used to measure the impact of such fragmentation. This study aimed to measure the impacts of agricultural crops (matrices) on ant communities of adjacent lower montane Atlantic rainforest fragments. We sampled nine forest fragments at locations surrounded by different agricultural matrices, namely: coffee (3 replicates); sugarcane (3); and pasture (3). At each site we installed pitfall traps along a 500 m transect from the interior of the matrix to the interior of the fragment (20 pitfall traps ~25 m apart). Each transect was partitioned into four categories: interior of the matrix; edge of the matrix; edge of the fragment; and interior of the fragment. For each sample site, we measured ant species richness and ant community composition within each transect category. Ant richness and composition differed between fragments and matrices. Each sample location had a specific composition of ants, probably because of the influence of the nature and management of the agricultural matrices. Species composition in the coffee matrix had the highest similarity to its corresponding fragment. The variability in species composition within forest fragments surrounded by pasture was greatest when compared with forest fragments surrounded by sugarcane or, to a lesser extent, coffee. Functional guild composition differed between locations, but the most representative guild was 'generalist' both in the agricultural matrices and forest fragments. Our results are important for understanding how agricultural matrices act on ant communities, and also, how these isolated forest fragments could act as an island of biodiversity in an 'ocean of crops'.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Braunstein, Samuel L.; Ghosh, Sibasish; Severini, Simone

We reconsider density matrices of graphs as defined in quant-ph/0406165. The density matrix of a graph is the combinatorial Laplacian of the graph normalized to have unit trace. We describe a simple combinatorial condition (the 'degree condition') to test the separability of density matrices of graphs. The condition is directly related to the Peres-Horodecki partial transposition condition. We prove that the degree condition is necessary for separability, and we conjecture that it is also sufficient. We prove special cases of the conjecture involving nearest-point graphs and perfect matchings. We observe that the degree condition appears to have a value beyondmore » the density matrices of graphs. In fact, we point out that circulant density matrices and other matrices constructed from groups always satisfy the condition and indeed are separable with respect to any split. We isolate a number of problems and delineate further generalizations.« less

Eigenvalue statistics for the sum of two complex Wishart matrices

NASA Astrophysics Data System (ADS)

Kumar, Santosh

2014-09-01

The sum of independent Wishart matrices, taken from distributions with unequal covariance matrices, plays a crucial role in multivariate statistics, and has applications in the fields of quantitative finance and telecommunication. However, analytical results concerning the corresponding eigenvalue statistics have remained unavailable, even for the sum of two Wishart matrices. This can be attributed to the complicated and rotationally noninvariant nature of the matrix distribution that makes extracting the information about eigenvalues a nontrivial task. Using a generalization of the Harish-Chandra-Itzykson-Zuber integral, we find exact solution to this problem for the complex Wishart case when one of the covariance matrices is proportional to the identity matrix, while the other is arbitrary. We derive exact and compact expressions for the joint probability density and marginal density of eigenvalues. The analytical results are compared with numerical simulations and we find perfect agreement.

Compound matrices

NASA Astrophysics Data System (ADS)

Kravvaritis, Christos; Mitrouli, Marilena

2009-02-01

This paper studies the possibility to calculate efficiently compounds of real matrices which have a special form or structure. The usefulness of such an effort lies in the fact that the computation of compound matrices, which is generally noneffective due to its high complexity, is encountered in several applications. A new approach for computing the Singular Value Decompositions (SVD's) of the compounds of a matrix is proposed by establishing the equality (up to a permutation) between the compounds of the SVD of a matrix and the SVD's of the compounds of the matrix. The superiority of the new idea over the standard method is demonstrated. Similar approaches with some limitations can be adopted for other matrix factorizations, too. Furthermore, formulas for the n - 1 compounds of Hadamard matrices are derived, which dodge the strenuous computations of the respective numerous large determinants. Finally, a combinatorial counting technique for finding the compounds of diagonal matrices is illustrated.

Three-dimensional polarization algebra.

PubMed

R Sheppard, Colin J; Castello, Marco; Diaspro, Alberto

2016-10-01

If light is focused or collected with a high numerical aperture lens, as may occur in imaging and optical encryption applications, polarization should be considered in three dimensions (3D). The matrix algebra of polarization behavior in 3D is discussed. It is useful to convert between the Mueller matrix and two different Hermitian matrices, representing an optical material or system, which are in the literature. Explicit transformation matrices for converting the column vector form of these different matrices are extended to the 3D case, where they are large (81×81) but can be generated using simple rules. It is found that there is some advantage in using a generalization of the Chandrasekhar phase matrix treatment, rather than that based on Gell-Mann matrices, as the resultant matrices are of simpler form and reduce to the two-dimensional case more easily. Explicit expressions are given for 3D complex field components in terms of Chandrasekhar-Stokes parameters.

Toward a better determination of dairy powders surface composition through XPS matrices development.

PubMed

Nikolova, Y; Petit, J; Sanders, C; Gianfrancesco, A; Scher, J; Gaiani, C

2015-01-01

The surface composition of dairy powders prepared by mixing various amounts of micellar casein (MC), whey proteins isolate (WPI), lactose, and anhydrous milk fat (AMF) was investigated by XPS measurements. The use of matrices are generally accepted to transform surface atomic composition (i.e., C, O, N contents) into surface component composition (i.e., lactose, proteins, lipids). These atomic-based matrices were revisited and two new matrices based on the surface bond composition were developed. Surface compositions obtained from atomic and bond-based matrices were compared. A successful matrix allowing good correlations between XPS predicted and theoretical surface composition for powders free from fat was identified. Nevertheless, samples containing milk fat were found to present a possible segregation of components owing to the AMF overrepresentation on the surface. Supplementary analyses (FTIR, SEM) were carried out in order to investigate the homogeneity of the mixtures. Copyright © 2014 Elsevier B.V. All rights reserved.

Research on numerical algorithms for large space structures

NASA Technical Reports Server (NTRS)

Denman, E. D.

1982-01-01

Numerical algorithms for large space structures were investigated with particular emphasis on decoupling method for analysis and design. Numerous aspects of the analysis of large systems ranging from the algebraic theory to lambda matrices to identification algorithms were considered. A general treatment of the algebraic theory of lambda matrices is presented and the theory is applied to second order lambda matrices.

SAR matrices: automated extraction of information-rich SAR tables from large compound data sets.

PubMed

Wassermann, Anne Mai; Haebel, Peter; Weskamp, Nils; Bajorath, Jürgen

2012-07-23

We introduce the SAR matrix data structure that is designed to elucidate SAR patterns produced by groups of structurally related active compounds, which are extracted from large data sets. SAR matrices are systematically generated and sorted on the basis of SAR information content. Matrix generation is computationally efficient and enables processing of large compound sets. The matrix format is reminiscent of SAR tables, and SAR patterns revealed by different categories of matrices are easily interpretable. The structural organization underlying matrix formation is more flexible than standard R-group decomposition schemes. Hence, the resulting matrices capture SAR information in a comprehensive manner.

Spectral density of mixtures of random density matrices for qubits

NASA Astrophysics Data System (ADS)

Zhang, Lin; Wang, Jiamei; Chen, Zhihua

2018-06-01

We derive the spectral density of the equiprobable mixture of two random density matrices of a two-level quantum system. We also work out the spectral density of mixture under the so-called quantum addition rule. We use the spectral densities to calculate the average entropy of mixtures of random density matrices, and show that the average entropy of the arithmetic-mean-state of n qubit density matrices randomly chosen from the Hilbert-Schmidt ensemble is never decreasing with the number n. We also get the exact value of the average squared fidelity. Some conjectures and open problems related to von Neumann entropy are also proposed.

Efficiency of fly ash belite cement and zeolite matrices for immobilizing cesium.

PubMed

Goñi, S; Guerrero, A; Lorenzo, M P

2006-10-11

The efficiency of innovative matrices for immobilizing cesium is presented in this work. The matrix formulation included the use of fly ash belite cement (FABC-2-W) and gismondine-type Na-P1 zeolite, both of which are synthesized from fly ash of coal combustion. The efficiency for immobilizing cesium is evaluated from the leaching test ANSI/ANS 16.1-1986 at the temperature of 40 degrees C, from which the apparent diffusion coefficient of cesium is obtained. Matrices with 100% of FABC-2-W are used as a reference. The integrity of matrices is evaluated by porosity and pore-size distribution from mercury intrusion porosimetry, X-ray diffraction and nitrogen adsorption analyses. Both matrices can be classified as good solidify systems for cesium, specially the FABC-2-W/zeolite matrix in which the replacement of 50% of belite cement by the gismondine-type Na-P1 zeolite caused a decrease of two orders of magnitude of cesium mean Effective Diffusion Coefficient (D(e)) (2.8e-09 cm(2)/s versus 2.2e-07 cm(2)/s, for FABC-2-W/zeolite and FABC-2-W matrices, respectively).

Synergistic activity of tenofovir and nevirapine combinations released from polycaprolactone matrices for potential enhanced prevention of HIV infection through the vaginal route.

PubMed

Dang, Nhung T T; Sivakumaran, Haran; Harrich, David; Shaw, Paul N; Davis-Poynter, Nicholas; Coombes, Allan G A

2014-10-01

Polycaprolactone (PCL) matrices were simultaneously loaded with the antiviral agents, tenofovir (TFV) and nevirapine (NVP), in combination to provide synergistic activity in the prevention of HIV transmission through the vaginal route. TFV and NVP were incorporated in PCL matrices at theoretical loadings of 10%TFV-10% NVP, 5%TFV-5%NVP and 5%TFV-10%NVP, measured with respect to the PCL content of the matrices. Actual TFV loadings ranged from 2.1% to 4.2% equating to loading efficiencies of about 41-42%. The actual loadings of NVP were around half those of TFV (1.2-1.9%), resulting in loading efficiencies ranging from 17.2% to 23.5%. Approximately 80% of the initial content of TFV was released from the PCL matrices into simulated vaginal fluid (SVF) over a period of 30 days, which was almost double the cumulative release of NVP (40-45%). The release kinetics of both antivirals over 30 days were found to be described most satisfactorily by the Higuchi model. In vitro assay of release media containing combinations of TFV and NVP released from PCL matrices confirmed a potential synergistic/additive effect of the released antivirals on HIV-1 infection of HeLa cells. These findings indicate that PCL matrices loaded with combinations of TFV and NVP provide an effective strategy for the sustained vaginal delivery of antivirals with synergistic/additive activity. Copyright © 2014 Elsevier B.V. All rights reserved.

Amino Acid Properties Conserved in Molecular Evolution

PubMed Central

Rudnicki, Witold R.; Mroczek, Teresa; Cudek, Paweł

2014-01-01

That amino acid properties are responsible for the way protein molecules evolve is natural and is also reasonably well supported both by the structure of the genetic code and, to a large extent, by the experimental measures of the amino acid similarity. Nevertheless, there remains a significant gap between observed similarity matrices and their reconstructions from amino acid properties. Therefore, we introduce a simple theoretical model of amino acid similarity matrices, which allows splitting the matrix into two parts – one that depends only on mutabilities of amino acids and another that depends on pairwise similarities between them. Then the new synthetic amino acid properties are derived from the pairwise similarities and used to reconstruct similarity matrices covering a wide range of information entropies. Our model allows us to explain up to 94% of the variability in the BLOSUM family of the amino acids similarity matrices in terms of amino acid properties. The new properties derived from amino acid similarity matrices correlate highly with properties known to be important for molecular evolution such as hydrophobicity, size, shape and charge of amino acids. This result closes the gap in our understanding of the influence of amino acids on evolution at the molecular level. The methods were applied to the single family of similarity matrices used often in general sequence homology searches, but it is general and can be used also for more specific matrices. The new synthetic properties can be used in analyzes of protein sequences in various biological applications. PMID:24967708

Simultaneous Quantitation of Atenolol, Metoprolol, and Propranolol in Biological Matrices Via LC/MS

DTIC Science & Technology

2005-05-01

Simultaneous Quantitation of Atenolol, Metoprolol , and Propranolol in Biological Matrices Via LC/MS Robert D. Johnson Russell J. Lewis Civil...authorized 1 SIMULTANEOUS QUANTITATION OF ATENOLOL, METOPROLOL , AND PROPRANOLOL IN BIOLOGICAL MATRICES VIA LC/MS INTRODUCTION The Federal Aviation...detect beta-blocker compounds such as atenolol, metoprolol , or propranolol in the submitted biological samples. In forensic toxicol- ogy laboratories

Persistent Infrared Spectral Hole-Burning for Impurity Vibrational Modes in Solids.

DTIC Science & Technology

1986-09-30

infrared vibrational transitions of impurity molecules in solids. Examples include 1,2- difluoroethane in rare gas matrices, perrhenate ions in alkali...observed consists of infrared vibrational transitions of impurity molecules in solids. Examples include 1,2- difluoroethane in rare gas matrices...solids. Examples include 1,2- difluoroethane in rare gas matrices, perrhenate ions in alkali halide crystals, and most recently, cyanide and nitrite

Drinfeld-Sokolov reduction in quantum algebras: canonical form of generating matrices

NASA Astrophysics Data System (ADS)

Gurevich, Dimitri; Saponov, Pavel; Talalaev, Dmitry

2018-04-01

We define the second canonical forms for the generating matrices of the Reflection Equation algebras and the braided Yangians, associated with all even skew-invertible involutive and Hecke symmetries. By using the Cayley-Hamilton identities for these matrices, we show that they are similar to their canonical forms in the sense of Chervov and Talalaev (J Math Sci (NY) 158:904-911, 2008).

Flux Jacobian Matrices For Equilibrium Real Gases

NASA Technical Reports Server (NTRS)

Vinokur, Marcel

1990-01-01

Improved formulation includes generalized Roe average and extension to three dimensions. Flux Jacobian matrices derived for use in numerical solutions of conservation-law differential equations of inviscid flows of ideal gases extended to real gases. Real-gas formulation of these matrices retains simplifying assumptions of thermodynamic and chemical equilibrium, but adds effects of vibrational excitation, dissociation, and ionization of gas molecules via general equation of state.

Evaluating Exposure-Response Associations for Non-Hodgkin Lymphoma with Varying Methods of Assigning Cumulative Benzene Exposure in the Shanghai Women's Health Study.

PubMed

Friesen, Melissa C; Bassig, Bryan A; Vermeulen, Roel; Shu, Xiao-Ou; Purdue, Mark P; Stewart, Patricia A; Xiang, Yong-Bing; Chow, Wong-Ho; Ji, Bu-Tian; Yang, Gong; Linet, Martha S; Hu, Wei; Gao, Yu-Tang; Zheng, Wei; Rothman, Nathaniel; Lan, Qing

2017-01-01

To provide insight into the contributions of exposure measurements to job exposure matrices (JEMs), we examined the robustness of an association between occupational benzene exposure and non-Hodgkin lymphoma (NHL) to varying exposure assessment methods. NHL risk was examined in a prospective population-based cohort of 73087 women in Shanghai. A mixed-effects model that combined a benzene JEM with >60000 short-term, area benzene inspection measurements was used to derive two sets of measurement-based benzene estimates: 'job/industry-specific' estimates (our presumed best approach) were derived from the model's fixed effects (year, JEM intensity rating) and random effects (occupation, industry); 'calibrated JEM' estimates were derived using only the fixed effects. 'Uncalibrated JEM' (using the ordinal JEM ratings) and exposure duration estimates were also calculated. Cumulative exposure for each subject was calculated for each approach based on varying exposure definitions defined using the JEM's probability ratings. We examined the agreement between the cumulative metrics and evaluated changes in the benzene-NHL associations. For our primary exposure definition, the job/industry-specific estimates were moderately to highly correlated with all other approaches (Pearson correlation 0.61-0.89; Spearman correlation > 0.99). All these metrics resulted in statistically significant exposure-response associations for NHL, with negligible gain in model fit from using measurement-based estimates. Using more sensitive or specific exposure definitions resulted in elevated but non-significant associations. The robust associations observed here with varying benzene assessment methods provide support for a benzene-NHL association. While incorporating exposure measurements did not improve model fit, the measurements allowed us to derive quantitative exposure-response curves. Published by Oxford University Press on behalf of the British Occupational Hygiene Society 2017.

Segmentation-based wavelet transform for still-image compression

NASA Astrophysics Data System (ADS)

Mozelle, Gerard; Seghier, Abdellatif; Preteux, Francoise J.

1996-10-01

In order to address simultaneously the two functionalities, content-based scalability required by MPEG-4, we introduce a segmentation-based wavelet transform (SBWT). SBWT takes into account both the mathematical properties of multiresolution analysis and the flexibility of region-based approaches for image compression. The associated methodology has two stages: 1) image segmentation into convex and polygonal regions; 2) 2D-wavelet transform of the signal corresponding to each region. In this paper, we have mathematically studied a method for constructing a multiresolution analysis (VjOmega)j (epsilon) N adapted to a polygonal region which provides an adaptive region-based filtering. The explicit construction of scaling functions, pre-wavelets and orthonormal wavelets bases defined on a polygon is carried out by using scaling functions is established by using the theory of Toeplitz operators. The corresponding expression can be interpreted as a location property which allow defining interior and boundary scaling functions. Concerning orthonormal wavelets and pre-wavelets, a similar expansion is obtained by taking advantage of the properties of the orthogonal projector P(V(j(Omega )) perpendicular from the space Vj(Omega ) + 1 onto the space (Vj(Omega )) perpendicular. Finally the mathematical results provide a simple and fast algorithm adapted to polygonal regions.

Infrared super-resolution imaging based on compressed sensing

NASA Astrophysics Data System (ADS)

Sui, Xiubao; Chen, Qian; Gu, Guohua; Shen, Xuewei

2014-03-01

The theoretical basis of traditional infrared super-resolution imaging method is Nyquist sampling theorem. The reconstruction premise is that the relative positions of the infrared objects in the low-resolution image sequences should keep fixed and the image restoration means is the inverse operation of ill-posed issues without fixed rules. The super-resolution reconstruction ability of the infrared image, algorithm's application area and stability of reconstruction algorithm are limited. To this end, we proposed super-resolution reconstruction method based on compressed sensing in this paper. In the method, we selected Toeplitz matrix as the measurement matrix and realized it by phase mask method. We researched complementary matching pursuit algorithm and selected it as the recovery algorithm. In order to adapt to the moving target and decrease imaging time, we take use of area infrared focal plane array to acquire multiple measurements at one time. Theoretically, the method breaks though Nyquist sampling theorem and can greatly improve the spatial resolution of the infrared image. The last image contrast and experiment data indicate that our method is effective in improving resolution of infrared images and is superior than some traditional super-resolution imaging method. The compressed sensing super-resolution method is expected to have a wide application prospect.

Transfer-matrices for series-type microwave antenna circuits. [L-band radiometer

NASA Technical Reports Server (NTRS)

Schmidt, R. F.

1981-01-01

Transfer matrices are developed which permit analysis and computer evaluation of certain series type microwave antenna circuits associated with an L-Band microwave radiometer (LBMR) under investigation at Goddard Space Flight Center. This radiometer is one of several diverse instrument designs to be used for the determination of soil moisture, sea state, salinity, and temperature data. Four port matrix notation is used throughout for the evaluation of LBMR circuits with mismatched couplers and lossy transmission lines. Matrix parameters in examples are predicted on an impedance analysis and an assumption of an array aperture distribution. The notation presented is easily adapted to longer and more varied chains of matrices, and to matrices of larger dimension.

An improved approach to the analysis of drug-protein binding by distance geometry

NASA Technical Reports Server (NTRS)

Goldblum, A.; Kieber-Emmons, T.; Rein, R.

1986-01-01

The calculation of side chain centers of coordinates and the subsequent generation of side chain-side chain and side chain-backbone distance matrices is suggested as an improved method for viewing interactions inside proteins and for the comparison of protein structures. The use of side chain distance matrices is demonstrated with free PTI, and the use of difference distance matrices for side chains is shown for free and trypsin-bound PTI as well as for the X-ray structures of trypsin complexes with PTI and with benzamidine. It is found that conformational variations are reflected in the side chain distance matrices much more than in the standard C-C distance representations.

Quantum Entanglement and Reduced Density Matrices

NASA Astrophysics Data System (ADS)

Purwanto, Agus; Sukamto, Heru; Yuwana, Lila

2018-05-01

We investigate entanglement and separability criteria of multipartite (n-partite) state by examining ranks of its reduced density matrices. Firstly, we construct the general formula to determine the criterion. A rank of origin density matrix always equals one, meanwhile ranks of reduced matrices have various ranks. Next, separability and entanglement criterion of multipartite is determined by calculating ranks of reduced density matrices. In this article we diversify multipartite state criteria into completely entangled state, completely separable state, and compound state, i.e. sub-entangled state and sub-entangledseparable state. Furthermore, we also shorten the calculation proposed by the previous research to determine separability of multipartite state and expand the methods to be able to differ multipartite state based on criteria above.

The autowave modes of solid phase polymerization of metal-containing monomers in two- and three-dimensional fiberglass-filled matrices

NASA Astrophysics Data System (ADS)

Barelko, V. V.; Pomogailo, A. D.; Dzhardimalieva, G. I.; Evstratova, S. I.; Rozenberg, A. S.; Uflyand, I. E.

1999-06-01

The phenomenon of autowave (frontal) solid phase polymerization of metal-containing monomers based on metal-acrylamide complexes is considered. The comparison of the features of autowave processes realized in both the single-component matrices of the monomer and the matrices filled by the fiberglass materials is performed. The unstable regimes of the polymerization wave as well as the conditions for the stabilization of the flat front in the filled matrices are described. The peculiarities of the frontal regimes in the three- and two-dimensional media are studied. Some possibilities for using of autowave polymerization in the fabrication of the polymer-fiberglass composites and composition prepregs are discussed.

On the representation matrices of the spin permutation group. [for atomic and molecular electronic structures

NASA Technical Reports Server (NTRS)

Wilson, S.

1977-01-01

A method is presented for the determination of the representation matrices of the spin permutation group (symmetric group), a detailed knowledge of these matrices being required in the study of the electronic structure of atoms and molecules. The method is characterized by the use of two different coupling schemes. Unlike the Yamanouchi spin algebraic scheme, the method is not recursive. The matrices for the fundamental transpositions can be written down directly in one of the two bases. The method results in a computationally significant reduction in the number of matrix elements that have to be stored when compared with, say, the standard Young tableaux group theoretical approach.

Two-dimensional integrating matrices on rectangular grids. [solving differential equations associated with rotating structures

NASA Technical Reports Server (NTRS)

Lakin, W. D.

1981-01-01

The use of integrating matrices in solving differential equations associated with rotating beam configurations is examined. In vibration problems, by expressing the equations of motion of the beam in matrix notation, utilizing the integrating matrix as an operator, and applying the boundary conditions, the spatial dependence is removed from the governing partial differential equations and the resulting ordinary differential equations can be cast into standard eigenvalue form. Integrating matrices are derived based on two dimensional rectangular grids with arbitrary grid spacings allowed in one direction. The derivation of higher dimensional integrating matrices is the initial step in the generalization of the integrating matrix methodology to vibration and stability problems involving plates and shells.

Nano-Fiber Reinforced Enhancements in Composite Polymer Matrices

NASA Technical Reports Server (NTRS)

Chamis, Christos C.

2009-01-01

Nano-fibers are used to reinforce polymer matrices to enhance the matrix dependent properties that are subsequently used in conventional structural composites. A quasi isotropic configuration is used in arranging like nano-fibers through the thickness to ascertain equiaxial enhanced matrix behavior. The nano-fiber volume ratios are used to obtain the enhanced matrix strength properties for 0.01,0.03, and 0.05 nano-fiber volume rates. These enhanced nano-fiber matrices are used with conventional fiber volume ratios of 0.3 and 0.5 to obtain the composite properties. Results show that nano-fiber enhanced matrices of higher than 0.3 nano-fiber volume ratio are degrading the composite properties.

Controlled growth factor release from synthetic extracellular matrices

NASA Astrophysics Data System (ADS)

Lee, Kuen Yong; Peters, Martin C.; Anderson, Kenneth W.; Mooney, David J.

2000-12-01

Polymeric matrices can be used to grow new tissues and organs, and the delivery of growth factors from these matrices is one method to regenerate tissues. A problem with engineering tissues that exist in a mechanically dynamic environment, such as bone, muscle and blood vessels, is that most drug delivery systems have been designed to operate under static conditions. We thought that polymeric matrices, which release growth factors in response to mechanical signals, might provide a new approach to guide tissue formation in mechanically stressed environments. Critical design features for this type of system include the ability to undergo repeated deformation, and a reversible binding of the protein growth factors to polymeric matrices to allow for responses to repeated stimuli. Here we report a model delivery system that can respond to mechanical signalling and upregulate the release of a growth factor to promote blood vessel formation. This approach may find a number of applications, including regeneration and engineering of new tissues and more general drug-delivery applications.

Hierarchical matrices implemented into the boundary integral approaches for gravity field modelling

NASA Astrophysics Data System (ADS)

Čunderlík, Róbert; Vipiana, Francesca

2017-04-01

Boundary integral approaches applied for gravity field modelling have been recently developed to solve the geodetic boundary value problems numerically, or to process satellite observations, e.g. from the GOCE satellite mission. In order to obtain numerical solutions of "cm-level" accuracy, such approaches require very refined level of the disretization or resolution. This leads to enormous memory requirements that need to be reduced. An implementation of the Hierarchical Matrices (H-matrices) can significantly reduce a numerical complexity of these approaches. A main idea of the H-matrices is based on an approximation of the entire system matrix that is split into a family of submatrices. Large submatrices are stored in factorized representation, while small submatrices are stored in standard representation. This allows reducing memory requirements significantly while improving the efficiency. The poster presents our preliminary results of implementations of the H-matrices into the existing boundary integral approaches based on the boundary element method or the method of fundamental solution.

A comparison of SuperLU solvers on the intel MIC architecture

NASA Astrophysics Data System (ADS)

Tuncel, Mehmet; Duran, Ahmet; Celebi, M. Serdar; Akaydin, Bora; Topkaya, Figen O.

2016-10-01

In many science and engineering applications, problems may result in solving a sparse linear system AX=B. For example, SuperLU_MCDT, a linear solver, was used for the large penta-diagonal matrices for 2D problems and hepta-diagonal matrices for 3D problems, coming from the incompressible blood flow simulation (see [1]). It is important to test the status and potential improvements of state-of-the-art solvers on new technologies. In this work, sequential, multithreaded and distributed versions of SuperLU solvers (see [2]) are examined on the Intel Xeon Phi coprocessors using offload programming model at the EURORA cluster of CINECA in Italy. We consider a portfolio of test matrices containing patterned matrices from UFMM ([3]) and randomly located matrices. This architecture can benefit from high parallelism and large vectors. We find that the sequential SuperLU benefited up to 45 % performance improvement from the offload programming depending on the sparse matrix type and the size of transferred and processed data.

The biofilm matrix polysaccharides cellulose and alginate both protect Pseudomonas putida mt-2 against reactive oxygen species generated under matric stress and copper exposure.

PubMed

Svenningsen, Nanna B; Martínez-García, Esteban; Nicolaisen, Mette H; de Lorenzo, Victor; Nybroe, Ole

2018-06-01

In natural environments most bacteria live in biofilms embedded in complex matrices of extracellular polymeric substances (EPS). This lifestyle is known to increase protection against environmental stress. Pseudomonas putida mt-2 harbours genes for the production of at least four different EPS polysaccharides, including alginate and cellulose. Little is known about the functional properties of cellulose, while alginate attenuates the accumulation of reactive oxygen species (ROS) caused by matric stress. By using mutants that are deficient in either alginate or cellulose production we show that even cellulose attenuates the accumulation of matric stress-induced ROS for cells in biofilms. Further, both cellulose and alginate attenuate ROS generated through exposure to copper. Interestingly, the two EPS polysaccharides protect cells in both liquid culture and in biofilms against ROS caused by matric stress, indicating that cellulose and alginate do not need to be produced as an integral part of the biofilm lifestyle to provide tolerance towards environmental stressors.

Removal of chloropyrifos ethyl, tetradifon and chlorothalonil pesticide residues from citrus by using ozone.

PubMed

Kusvuran, Erdal; Yildirim, Deniz; Mavruk, Funda; Ceyhan, Mehmet

2012-11-30

The removal of chloropyrifos ethyl, tetradifon and chlorothalonil pesticide residues from the lemon, orange and grapefruit matrices were achieved by ozonation. All of chlorothalonil residues adsorbed onto the orange matrix were completely removed after 5 min ozonation. The highest removal percentages of tetradifon and chloropyrifos ethyl were achieved as 98.6 and 94.2%, respectively for the lemon and grapefruit matrices. All of diffused chlorothalonil and chloropyrifos ethyl residues were completely removed from both orange and grapefruit matrices after 5 min ozonation. Increasing of applied ozone dosage was not significantly effect on the removal percentages of pesticides whereas increasing of ozonation temperature caused a negative effect on the removal percentages of pesticides. The washing of the matrices with tap water was not as effective as ozonation in the removal of residual pesticides. Our results show that ozone treatment has a great potential for removing of residual pesticides from lemon, orange and grapefruit matrices. Copyright © 2012 Elsevier B.V. All rights reserved.

Scattering matrices of Lamb waves at irregular surface and void defects.

PubMed

Feng, Feilong; Shen, Jianzhong; Lin, Shuyu

2012-08-01

Time-harmonic solution of Lamb wave scattering in a plane-strain waveguide with irregular thickness is investigated based on stair-step discretization and stepwise mode matching. The transfer relations of the transmission matrices and reflection matrices are derived in both directions of the waveguide. With these, an explicit expression of the scattering matrix is derived. When the scattering region of an inner irregular defect is geometrically divided into several parts composed of sub-waveguides with variable thicknesses and void regions with vertical free edges corresponding to the plate surfaces, the scattering matrix of the whole region could then be derived by modal matching along the artificial boundaries, as explicit functions of all the scattering matrices of the sub-waveguides and reflection matrices of the free edges. The effectiveness of the formulation is examined by numerical examples; the calculated scattering coefficients are in good accordance with those obtained from numerical simulation models. Copyright © 2012 Elsevier B.V. All rights reserved.

Immobilization of plutonium from solutions on porous matrices by the method of high temperature sorption

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nardova, A.K.; Filippov, E.A.; Glagolenko, Y.B.

1996-05-01

This report presents the results of investigations of plutonium immobilization from solutions on inorganic matrices with the purpose of producing a solid waste form. High-temperature sorption is described which entails the adsorption of radionuclides from solutions on porous, inorganic matrices, as for example silica gel. The solution is brought to a boil with additional thermal process (calcination) of the saturated granules.

Reduction theorems for optimal unambiguous state discrimination of density matrices

DOE Office of Scientific and Technical Information (OSTI.GOV)

Raynal, Philippe; Luetkenhaus, Norbert; Enk, Steven J. van

2003-08-01

We present reduction theorems for the problem of optimal unambiguous state discrimination of two general density matrices. We show that this problem can be reduced to that of two density matrices that have the same rank n and are described in a Hilbert space of dimensions 2n. We also show how to use the reduction theorems to discriminate unambiguously between N mixed states (N{>=}2)

TiO₂-Based Photocatalytic Geopolymers for Nitric Oxide Degradation.

PubMed

Strini, Alberto; Roviello, Giuseppina; Ricciotti, Laura; Ferone, Claudio; Messina, Francesco; Schiavi, Luca; Corsaro, Davide; Cioffi, Raffaele

2016-06-24

This study presents an experimental overview for the development of photocatalytic materials based on geopolymer binders as catalyst support matrices. Particularly, geopolymer matrices obtained from different solid precursors (fly ash and metakaolin), composite systems (siloxane-hybrid, foamed hybrid), and curing temperatures (room temperature and 60 °C) were investigated for the same photocatalyst content (i.e., 3% TiO₂ by weight of paste). The geopolymer matrices were previously designed for different applications, ranging from insulating (foam) to structural materials. The photocatalytic activity was evaluated as NO degradation in air, and the results were compared with an ordinary Portland cement reference. The studied matrices demonstrated highly variable photocatalytic performance depending on both matrix constituents and the curing temperature, with promising activity revealed by the geopolymers based on fly ash and metakaolin. Furthermore, microstructural features and titania dispersion in the matrices were assessed by scanning electron microscopy (SEM) and energy dispersive X-ray (EDS) analyses. Particularly, EDS analyses of sample sections indicated segregation effects of titania in the surface layer, with consequent enhancement or depletion of the catalyst concentration in the active sample region, suggesting non-negligible transport phenomena during the curing process. The described results demonstrated that geopolymer binders can be interesting catalyst support matrices for the development of photocatalytic materials and indicated a large potential for the exploitation of their peculiar features.

Multimodal approach to characterization of hydrophilic matrices manufactured by wet and dry granulation or direct compression methods.

PubMed

Kulinowski, Piotr; Woyna-Orlewicz, Krzysztof; Obrał, Jadwiga; Rappen, Gerd-Martin; Haznar-Garbacz, Dorota; Węglarz, Władysław P; Jachowicz, Renata; Wyszogrodzka, Gabriela; Klaja, Jolanta; Dorożyński, Przemysław P

2016-02-29

The purpose of the research was to investigate the effect of the manufacturing process of the controlled release hydrophilic matrix tablets on their hydration behavior, internal structure and drug release. Direct compression (DC) quetiapine hemifumarate matrices and matrices made of powders obtained by dry granulation (DG) and high shear wet granulation (HS) were prepared. They had the same quantitative composition and they were evaluated using X-ray microtomography, magnetic resonance imaging and biorelevant stress test dissolution. Principal results concerned matrices after 2 h of hydration: (i) layered structure of the DC and DG hydrated tablets with magnetic resonance image intensity decreasing towards the center of the matrix was observed, while in HS matrices layer of lower intensity appeared in the middle of hydrated part; (ii) the DC and DG tablets retained their core and consequently exhibited higher resistance to the physiological stresses during simulation of small intestinal passage than HS formulation. Comparing to DC, HS granulation changed properties of the matrix in terms of hydration pattern and resistance to stress in biorelevant dissolution apparatus. Dry granulation did not change these properties-similar hydration pattern and dissolution in biorelevant conditions were observed for DC and DG matrices. Copyright © 2015 Elsevier B.V. All rights reserved.

Conserved G-matrices of morphological and life-history traits among continental and island blue tit populations.

PubMed

Delahaie, B; Charmantier, A; Chantepie, S; Garant, D; Porlier, M; Teplitsky, C

2017-08-01

The genetic variance-covariance matrix (G-matrix) summarizes the genetic architecture of multiple traits. It has a central role in the understanding of phenotypic divergence and the quantification of the evolutionary potential of populations. Laboratory experiments have shown that G-matrices can vary rapidly under divergent selective pressures. However, because of the demanding nature of G-matrix estimation and comparison in wild populations, the extent of its spatial variability remains largely unknown. In this study, we investigate spatial variation in G-matrices for morphological and life-history traits using long-term data sets from one continental and three island populations of blue tit (Cyanistes caeruleus) that have experienced contrasting population history and selective environment. We found no evidence for differences in G-matrices among populations. Interestingly, the phenotypic variance-covariance matrices (P) were divergent across populations, suggesting that using P as a substitute for G may be inadequate. These analyses also provide the first evidence in wild populations for additive genetic variation in the incubation period (that is, the period between last egg laid and hatching) in all four populations. Altogether, our results suggest that G-matrices may be stable across populations inhabiting contrasted environments, therefore challenging the results of previous simulation studies and laboratory experiments.

Construction of type-II QC-LDPC codes with fast encoding based on perfect cyclic difference sets

NASA Astrophysics Data System (ADS)

Li, Ling-xiang; Li, Hai-bing; Li, Ji-bi; Jiang, Hua

2017-09-01

In view of the problems that the encoding complexity of quasi-cyclic low-density parity-check (QC-LDPC) codes is high and the minimum distance is not large enough which leads to the degradation of the error-correction performance, the new irregular type-II QC-LDPC codes based on perfect cyclic difference sets (CDSs) are constructed. The parity check matrices of these type-II QC-LDPC codes consist of the zero matrices with weight of 0, the circulant permutation matrices (CPMs) with weight of 1 and the circulant matrices with weight of 2 (W2CMs). The introduction of W2CMs in parity check matrices makes it possible to achieve the larger minimum distance which can improve the error- correction performance of the codes. The Tanner graphs of these codes have no girth-4, thus they have the excellent decoding convergence characteristics. In addition, because the parity check matrices have the quasi-dual diagonal structure, the fast encoding algorithm can reduce the encoding complexity effectively. Simulation results show that the new type-II QC-LDPC codes can achieve a more excellent error-correction performance and have no error floor phenomenon over the additive white Gaussian noise (AWGN) channel with sum-product algorithm (SPA) iterative decoding.

ReplacementMatrix: a web server for maximum-likelihood estimation of amino acid replacement rate matrices.

PubMed

Dang, Cuong Cao; Lefort, Vincent; Le, Vinh Sy; Le, Quang Si; Gascuel, Olivier

2011-10-01

Amino acid replacement rate matrices are an essential basis of protein studies (e.g. in phylogenetics and alignment). A number of general purpose matrices have been proposed (e.g. JTT, WAG, LG) since the seminal work of Margaret Dayhoff and co-workers. However, it has been shown that matrices specific to certain protein groups (e.g. mitochondrial) or life domains (e.g. viruses) differ significantly from general average matrices, and thus perform better when applied to the data to which they are dedicated. This Web server implements the maximum-likelihood estimation procedure that was used to estimate LG, and provides a number of tools and facilities. Users upload a set of multiple protein alignments from their domain of interest and receive the resulting matrix by email, along with statistics and comparisons with other matrices. A non-parametric bootstrap is performed optionally to assess the variability of replacement rate estimates. Maximum-likelihood trees, inferred using the estimated rate matrix, are also computed optionally for each input alignment. Finely tuned procedures and up-to-date ML software (PhyML 3.0, XRATE) are combined to perform all these heavy calculations on our clusters. http://www.atgc-montpellier.fr/ReplacementMatrix/ olivier.gascuel@lirmm.fr Supplementary data are available at http://www.atgc-montpellier.fr/ReplacementMatrix/

Introduction of organic/hydro-organic matrices in inductively coupled plasma optical emission spectrometry and mass spectrometry: a tutorial review. Part II. Practical considerations.

PubMed

Leclercq, Amélie; Nonell, Anthony; Todolí Torró, José Luis; Bresson, Carole; Vio, Laurent; Vercouter, Thomas; Chartier, Frédéric

2015-07-23

Inductively coupled plasma optical emission spectrometry (ICP-OES) and mass spectrometry (ICP-MS) are increasingly used to carry out analyses in organic/hydro-organic matrices. The introduction of such matrices into ICP sources is particularly challenging and can be the cause of numerous drawbacks. This tutorial review, divided in two parts, explores the rich literature related to the introduction of organic/hydro-organic matrices in ICP sources. Part I provided theoretical considerations associated with the physico-chemical properties of such matrices, in an attempt to understand the induced phenomena. Part II of this tutorial review is dedicated to more practical considerations on instrumentation, instrumental and operating parameters, as well as analytical strategies for elemental quantification in such matrices. Two important issues are addressed in this part: the first concerns the instrumentation and optimization of instrumental and operating parameters, pointing out (i) the description, benefits and drawbacks of different kinds of nebulization and desolvation devices and the impact of more specific instrumental parameters such as the injector characteristics and the material used for the cone; and, (ii) the optimization of operating parameters, for both ICP-OES and ICP-MS. Even if it is at the margin of this tutorial review, Electrothermal Vaporization and Laser Ablation will also be shortly described. The second issue is devoted to the analytical strategies for elemental quantification in such matrices, with particular insight into the isotope dilution technique, particularly used in speciation analysis by ICP-coupled separation techniques. Copyright © 2015 Elsevier B.V. All rights reserved.

"G.P.S Matrices" programme: A method to improve the mastery level of social science students in matrices operations

NASA Astrophysics Data System (ADS)

Lee, Ken Voon

2013-04-01

The purpose of this action research was to increase the mastery level of Form Five Social Science students in Tawau II National Secondary School in the operations of addition, subtraction and multiplication of matrices in Mathematics. A total of 30 students were involved. Preliminary findings through the analysis of pre-test results and questionnaire had identified the main problem faced in which the students felt confused with the application of principles of the operations of matrices when performing these operations. Therefore, an action research was conducted using an intervention programme called "G.P.S Matrices" to overcome the problem. This programme was divided into three phases. 'Gift of Matrices' phase aimed at forming matrix teaching aids. The second and third phases were 'Positioning the Elements of Matrices' and 'Strenghtening the Concept of Matrices'. These two phases were aimed at increasing the level of understanding and memory of the students towards the principles of matrix operations. Besides, this third phase was also aimed at creating an interesting learning environment. A comparison between the results of pre-test and post-test had shown a remarkable improvement in students' performances after implementing the programme. In addition, the analysis of interview findings also indicated a positive feedback on the changes in students' attitude, particularly in the aspect of students' understanding level. Moreover, the level of students' memory also increased following the use of the concrete matrix teaching aids created in phase one. Besides, teachers felt encouraging when conducive learning environment was created through students' presentation activity held in third phase. Furthermore, students were voluntarily involved in these student-centred activities. In conclusion, this research findings showed an increase in the mastery level of students in these three matrix operations and thus the objective of the research had been achieved.

Strategic planning and radiology practice management in the new health care environment.

PubMed

Sharpe, Richard E; Mehta, Tejas S; Eisenberg, Ronald L; Kruskal, Jonathan B

2015-01-01

Current comprehensive health care reform in the United States demands that policy makers, insurers, providers, and patients work in reshaping the health care system to deliver care that is both more affordable and of higher quality. A tectonic shift is under way that runs contrary to the traditional goal of radiology groups to perform and interpret large numbers of imaging examinations. In fact, radiology service requisitions now must be evaluated for their appropriateness, possibly resulting in a reduction in the number of imaging studies performed. To be successful, radiology groups will have to restructure their business practices and strategies to align with the emerging health care paradigm. This article outlines a four-stage strategic framework that has aided corporations in achieving their goals and that can be readily adapted and applied by radiologists. The four stages are (a) definition and articulation of a purpose, (b) clear definition of strategic goals, (c) prioritization of specific strategic enablers, and (d) implementation of processes for tracking progress and enabling continuous adaptation. The authors provide practical guidance for applying specific tools such as analyses of strengths, weaknesses, opportunities, and threats (so-called SWOT analyses), prioritization matrices, and balanced scorecards to accomplish each stage. By adopting and applying these tools within the strategic framework outlined, radiology groups can position themselves to succeed in the evolving health care environment. RSNA, 2015

Algorithm-Eigenvalue Estimation of Hyperspectral Wishart Covariance Matrices from a Limited Number of Samples

DTIC Science & Technology

2015-03-01

ALGORITHM—EIGENVALUE ESTIMATION OF HYPERSPECTRAL WISHART COVARIANCE MATRICES FROM A LIMITED NUMBER OF SAMPLES ECBC-TN-067 Avishai Ben- David ...NUMBER 6. AUTHOR(S) Ben- David , Avishai (ECBC) and Davidson, Charles E. (STC) 5d. PROJECT NUMBER 5e. TASK NUMBER 5f. WORK UNIT NUMBER 7...and published by Avishai Ben- David and Charles E. Davidson (Eigenvalue Estimation of Hyperspectral WishartCovariance Matrices from Limited Number of

Remarks on a one-parameter family of singular matrices

NASA Astrophysics Data System (ADS)

Sharma, Ramesh; Pariso, Chris; Duda, Michelle

2015-01-01

This short article will present to the reader a family of matrices that form an algebra over the reals. This presentation provides both current and former students of modern abstract algebra a better illustration of the concepts of rings, fields, and algebra itself. In addition, this article relates eigenspaces of 3×3 matrices with the arithmetic-geometric mean equality, an attribute that teachers might enjoy utilizing as a teaching tool in their classes.

Evaluation of Commercially Available Cyanide Test Kits against Various Matrices

DTIC Science & Technology

2016-08-01

further evaluation in a second phase of testing. Cyantesmo paper was tested against 15 matrices, including baking soda, boric acid, brewer’s yeast...matrices were baking soda, boric acid, brewer’s yeast, chalk dust, chitin, coffee powder (instant coffee), cornstarch, drywall dust, flour, kaolin...TN);  DG powdered sugar;  DG talcum powder (Lot 14312THW);  DG Clover Valley baking soda (Lot PMHB51);  Boric acid (Lot 766965; Fisher

Boundary transfer matrices and boundary quantum KZ equations

NASA Astrophysics Data System (ADS)

Vlaar, Bart

2015-07-01

A simple relation between inhomogeneous transfer matrices and boundary quantum Knizhnik-Zamolodchikov (KZ) equations is exhibited for quantum integrable systems with reflecting boundary conditions, analogous to an observation by Gaudin for periodic systems. Thus, the boundary quantum KZ equations receive a new motivation. We also derive the commutativity of Sklyanin's boundary transfer matrices by merely imposing appropriate reflection equations, in particular without using the conditions of crossing symmetry and unitarity of the R-matrix.

Jones's matrix representation of optical instruments. II - Fourier interferometers /spectrometers and spectropolarimeters/.

NASA Technical Reports Server (NTRS)

Fymat, A. L.

1971-01-01

Our method of matrix synthesis of optical components and instruments is applied to the derivation of Jones's matrices appropriate for Fourier interferometers (spectrometers and spectropolarimeters). These matrices are obtained for both the source beam and the detector beam. In the course of synthesis, Jones's matrices of the various reflectors (plane mirrors; retroreflectors: roofed mirror, trihedral and prism cube corner, cat's eye) used by these interferometers are also obtained.

Computer-Access-Code Matrices

NASA Technical Reports Server (NTRS)

Collins, Earl R., Jr.

1990-01-01

Authorized users respond to changing challenges with changing passwords. Scheme for controlling access to computers defeats eavesdroppers and "hackers". Based on password system of challenge and password or sign, challenge, and countersign correlated with random alphanumeric codes in matrices of two or more dimensions. Codes stored on floppy disk or plug-in card and changed frequently. For even higher security, matrices of four or more dimensions used, just as cubes compounded into hypercubes in concurrent processing.

Selective deposition and self-assembly of triblock copolymers into matrix arrays for membrane protein production.

PubMed

Andreasson-Ochsner, Mirjam; Fu, Zhikang; May, Sylvia; Xiu, Low Ying; Nallani, Madhavan; Sinner, Eva-Kathrin

2012-01-31

To improve the stability of cell membrane mimics, there has been growing interest in the use of block copolymers. Here, we present an easy approach to create an array of planar polymeric matrices capable of hosting membrane proteins. The array of polymeric matrices was formed by the selective deposition of triblock copolymers onto an array of hydrophilic islands situated within a hydrophobic background. The thickness of these matrices corresponds to the length of a single polymer chain. These polymeric matrices were used to host cell-free expressed membrane proteins, and offers a prototype from which a membrane protein array can be created for diagnostics or drug discovery purposes. © 2011 American Chemical Society

The autowave modes of solid phase polymerization of metal-containing monomers in two- and three-dimensional fiberglass-filled matrices.

PubMed

Barelko, V. V.; Pomogailo, A. D.; Dzhardimalieva, G. I.; Evstratova, S. I.; Rozenberg, A. S.; Uflyand, I. E.

1999-06-01

The phenomenon of autowave (frontal) solid phase polymerization of metal-containing monomers based on metal-acrylamide complexes is considered. The comparison of the features of autowave processes realized in both the single-component matrices of the monomer and the matrices filled by the fiberglass materials is performed. The unstable regimes of the polymerization wave as well as the conditions for the stabilization of the flat front in the filled matrices are described. The peculiarities of the frontal regimes in the three- and two-dimensional media are studied. Some possibilities for using of autowave polymerization in the fabrication of the polymer-fiberglass composites and composition prepregs are discussed. (c) 1999 American Institute of Physics.

Psychometric characteristics of the MATRICS Consensus Cognitive Battery in a large pooled cohort of stable schizophrenia patients.

PubMed

Georgiades, Anastasia; Davis, Vicki G; Atkins, Alexandra S; Khan, Anzalee; Walker, Trina W; Loebel, Antony; Haig, George; Hilt, Dana C; Dunayevich, Eduardo; Umbricht, Daniel; Sand, Michael; Keefe, Richard S E

2017-12-01

The MATRICS Consensus Cognitive Battery (MCCB) was developed to assess cognitive treatment effects in schizophrenia clinical trials, and is considered the FDA gold standard outcome measure for that purpose. The aim of the present study was to establish pre-treatment psychometric characteristics of the MCCB in a large pooled sample. The dataset included 2616 stable schizophrenia patients enrolled in 15 different clinical trials between 2007 and 2016 within the United States (94%) and Canada (6%). The MCCB was administered twice prior to the initiation of treatment in 1908 patients. Test-retest reliability and practice effects of the cognitive composite score, the neurocognitive composite score, which excludes the domain Social Cognition, and the subtests/domains were examined using Intra-Class Correlations (ICC) and Cohen's d. Simulated regression models explored which domains explained the greatest portion of variance in composite scores. Test-retest reliability was high (ICC=0.88) for both composite scores. Practice effects were small for the cognitive (d=0.15) and neurocognitive (d=0.17) composites. Simulated bootstrap regression analyses revealed that 3 of the 7 domains explained 86% of the variance for both composite scores. The domains that entered most frequently in the top 3 positions of the regression models were Speed of Processing, Working Memory, and Visual Learning. Findings provide definitive psychometric characteristics and a benchmark comparison for clinical trials using the MCCB. The test-retest reliability of the MCCB composite scores is considered excellent and the learning effects are small, fulfilling two of the key criteria for outcome measures in cognition clinical trials. Copyright © 2017 Elsevier B.V. All rights reserved.

Novel sustained-release dosage forms of proteins using polyglycerol esters of fatty acids.

PubMed

Yamagata, Y; Iga, K; Ogawa, Y

2000-02-03

In order to develop a novel delivery system for proteins based on polyglycerol esters of fatty acids (PGEFs), we studied a model system using interferon-alpha (IFN-alpha) as the test protein. A cylindrical matrix was prepared by a heat extrusion technique using a lyophilized powder of the protein and 11 different types of synthetic PGEFs, which varied in degree of glycerol polymerization (di- and tetra-), chain length of fatty acids (myristate, palmitate and stearate) and degree of fatty acid esterification (mono-, di- and tri-). In an in-vitro release study using an enzyme-linked immunosorbent assay (ELISA) as a detection method, the matrices prepared from a monoglyceride (used for comparison) and from diglycerol esters exhibited a biphasic release pattern with a large initial burst followed by slow release. In contrast, the matrices prepared from tetraglycerol esters showed a steady rate of release without a large initial burst. In an in vivo release study, initial bursts of IFN-alpha release were, also, dramatically reduced when the matrices were prepared from the tetraglycerol esters of palmitate and stearate, and the mean residence time (MRT) of IFN-alpha was prolonged, whereas the matrices prepared from monoglyceride and from diglycerol esters showed large initial bursts of IFN-alpha release. Since the release rates from the matrices prepared from the tetraglycerol esters of palmitate and stearate were governed by Jander's equation modified for a cylindrical matrix, the release from those matrices was concluded to be a diffusion-controlled process. The bioavailability of IFN-alpha after implantation of the matrix formulation prepared using all types of PGEFs, except for tetraglycerol triesters, was almost equivalent to that after injection of IFN-alpha solution; consequently, IFN-alpha in these matrices appears to remain stable during the release period.

Alternative CHCA-based matrices for the analysis of low molecular weight compounds by UV-MALDI-tandem mass spectrometry.

PubMed

Porta, Tiffany; Grivet, Chantal; Knochenmuss, Richard; Varesio, Emmanuel; Hopfgartner, Gérard

2011-02-01

Analysis of low molecular weight compounds (LMWC) in complex matrices by vacuum matrix-assisted laser desorption/ionization (MALDI) often suffers from matrix interferences, which can severely degrade limits of quantitation. It is, therefore, useful to have available a range of suitable matrices, which exhibit complementary regions of interference. Two newly synthesized α-cyanocinnamic acid derivatives are reported here; (E)-2-cyano-3-(naphthalen-2-yl)acrylic acid (NpCCA) and (2E)-3-(anthracen-9-yl)-2-cyanoprop-2enoic acid (AnCCA). Along with the commonly used α-cyano-4-hydroxycinnamic acid (CHCA), and the recently developed 4-chloro-α-cyanocinnamic acid (Cl-CCA) matrices, these constitute a chemically similar series of matrices covering a range of molecular weights, and with correspondingly differing ranges of spectral interference. Their performance was compared by measuring the signal-to-noise ratios (S/N) of 47 analytes, mostly pharmaceuticals, with the different matrices using the selected reaction monitoring (SRM) mode on a triple quadrupole instrument equipped with a vacuum MALDI source. AnCCA, NpCCA and Cl-CCA were found to offer better signal-to-noise ratios in SRM mode than CHCA, but Cl-CCA yielded the best results for 60% of the compounds tested. To better understand the relative performance of this matrix series, the proton affinities (PAs) were measured using the kinetic method. Their relative values were: AnCCA > CHCA > NpCCA > Cl-CCA. This ordering is consistent with the performance data. The synthesis of the new matrices is straightforward and they provide (1) tunability of matrix background interfering ions and (2) enhanced analyte response for certain classes of compounds. Copyright © 2011 John Wiley & Sons, Ltd.

Synergistic administration of photothermal therapy and chemotherapy to cancer cells using polypeptide-based degradable plasmonic matrices

PubMed Central

Huang, Huang-Chiao; Yang, Yoonsun; Nanda, Alisha; Koria, Piyush; Rege, Kaushal

2012-01-01

Aim Resistance of cancer cells to hyperthermic temperatures and spatial limitations of nanoparticle-induced hyperthermia necessitates the identification of effective combination treatments that can enhance the efficacy of this treatment. Here we show that novel polypeptide-based degradable plasmonic matrices can be employed for simultaneous administration of hyperthermia and chemotherapeutic drugs as an effective combination treatment that can overcome cancer cell resistance to hyperthermia. Method Novel gold nanorod elastin-like polypeptide matrices were generated and characterized. The matrices were also loaded with the heat-shock protein (HSP)90 inhibitor 17-(allylamino)-17-demethoxygeldanamycin (17-AAG), currently in clinical trials for different malignancies, in order to deliver a combination of hyperthermia and chemotherapy. Results Laser irradiation of cells cultured over the plasmonic matrices (without 17-AAG) resulted in the death of cells directly in the path of the laser, while cells outside the laser path did not show any loss of viability. Such spatial limitations, in concert with expression of prosurvival HSPs, reduce the efficacy of hyperthermia treatment. 17-AAG–gold nanorod–polypeptide matrices demonstrated minimal leaching of the drug to surrounding media. The combination of hyperthermic temperatures and the release of 17-AAG from the matrix, both induced by laser irradiation, resulted in significant (>90%) death of cancer cells, while ‘single treatments’ (i.e., hyperthermia alone and 17-AAG alone) demonstrated minimal loss of cancer cell viability (<10%). Conclusion Simultaneous administration of hyperthermia and HSP inhibitor release from plasmonic matrices is a powerful approach for the ablation of malignant cells and can be extended to different combinations of nanoparticles and chemotherapeutic drugs for a variety of malignancies. PMID:21542685

Structure and stability of genetic variance-covariance matrices: A Bayesian sparse factor analysis of transcriptional variation in the three-spined stickleback.

PubMed

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.

Compressive elasticity of three-dimensional nanofiber matrix directs mesenchymal stem cell differentiation to vascular cells with endothelial or smooth muscle cell markers.

PubMed

Wingate, K; Bonani, W; Tan, Y; Bryant, S J; Tan, W

2012-04-01

The importance of mesenchymal stem cells (MSC) in vascular regeneration is becoming increasingly recognized. However, few in vitro studies have been performed to identify the effects of environmental elasticity on the differentiation of MSC into vascular cell types. Electrospinning and photopolymerization techniques were used to fabricate a three-dimensional (3-D) polyethylene glycol dimethacrylate nanofiber hydrogel matrix with tunable elasticity for use as a cellular substrate. Compression testing demonstrated that the elastic modulus of the hydrated 3-D matrices ranged from 2 to 15 kPa, similar to the in vivo elasticity of the intima basement membrane and media layer. MSC seeded on rigid matrices (8-15 kPa) showed an increase in cell area compared with those seeded on soft matrices (2-5 kPa). Furthermore, the matrix elasticity guided the cells to express different vascular-specific phenotypes with high differentiation efficiency. Around 95% of MSC seeded on the 3-D matrices with an elasticity of 3 kPa showed Flk-1 endothelial markers within 24h, while only 20% of MSC seeded on the matrices with elasticity >8 kPa demonstrated Flk-1 marker. In contrast, ∼80% of MSC seeded on 3-D matrices with elasticity >8 kPa demonstrated smooth muscle α-actin marker within 24h, while fewer than 10% of MSC seeded on 3-D matrices with elasticity <5 kPa showed α-actin markers. The ability to control MSC differentiation into either endothelial or smooth muscle-like cells based purely on the local elasticity of the substrate could be a powerful tool for vascular tissue regeneration. Copyright © 2012 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Application’s Method of Quadratic Programming for Optimization of Portfolio Selection

NASA Astrophysics Data System (ADS)

Kawamoto, Shigeru; Takamoto, Masanori; Kobayashi, Yasuhiro

Investors or fund-managers face with optimization of portfolio selection, which means that determine the kind and the quantity of investment among several brands. We have developed a method to obtain optimal stock’s portfolio more rapidly from twice to three times than conventional method with efficient universal optimization. The method is characterized by quadratic matrix of utility function and constrained matrices divided into several sub-matrices by focusing on structure of these matrices.

User-Friendly Tools for Random Matrices: An Introduction

DTIC Science & Technology

2012-12-03

T 2011 , Oliveira 2010, Mackey et al . 2012, ... Joel A. Tropp, User-Friendly Tools for Random Matrices, NIPS, 3 December 2012 47 To learn more... E...the matrix product Y = AΩ 3. Construct an orthonormal basis Q for the range of Y [Ref] Halko –Martinsson–T, SIAM Rev. 2011 . Joel A. Tropp, User-Friendly...concentration inequalities...” with L. Mackey et al .. Submitted 2012. § “User-Friendly Tools for Random Matrices: An Introduction.” 2012. See also

The bilinear complexity and practical algorithms for matrix multiplication

NASA Astrophysics Data System (ADS)

Smirnov, A. V.

2013-12-01

A method for deriving bilinear algorithms for matrix multiplication is proposed. New estimates for the bilinear complexity of a number of problems of the exact and approximate multiplication of rectangular matrices are obtained. In particular, the estimate for the boundary rank of multiplying 3 × 3 matrices is improved and a practical algorithm for the exact multiplication of square n × n matrices is proposed. The asymptotic arithmetic complexity of this algorithm is O( n 2.7743).

Entanglement Measures in Ion-Trap Quantum Simulators without Full Tomography

DTIC Science & Technology

2014-07-21

t). This will allow us to efficiently compute correlations between ψ and ψ∗ in terms of standard expectation values in the enlarged space as follows...measure correlations of the form appearing in Eq. (2), with Θ a linear combination of tensorial products of Pauli matrices and identity operators...matrices will produce the desired correlation . Note that this protocol always results in a correlation of an odd number of Pauli matrices. In order to

A Higher Order Iterative Method for Computing the Drazin Inverse

PubMed Central

Soleymani, F.; Stanimirović, Predrag S.

2013-01-01

A method with high convergence rate for finding approximate inverses of nonsingular matrices is suggested and established analytically. An extension of the introduced computational scheme to general square matrices is defined. The extended method could be used for finding the Drazin inverse. The application of the scheme on large sparse test matrices alongside the use in preconditioning of linear system of equations will be presented to clarify the contribution of the paper. PMID:24222747

Human elastin polypeptides improve the biomechanical properties of three-dimensional matrices through the regulation of elastogenesis.

PubMed

Boccafoschi, Francesca; Ramella, Martina; Sibillano, Teresa; De Caro, Liberato; Giannini, Cinzia; Comparelli, Roberto; Bandiera, Antonella; Cannas, Mario

2015-03-01

The replacement of diseased tissues with biological substitutes with suitable biomechanical properties is one of the most important goal in tissue engineering. Collagen represents a satisfactory choice for scaffolds. Unfortunately, the lack of elasticity represents a restriction to a wide use of collagen for several applications. In this work, we studied the effect of human elastin-like polypeptide (HELP) as hybrid collagen-elastin matrices. In particular, we studied the biomechanical properties of collagen/HELP scaffolds considering several components involved in ECM remodeling (elastin, collagen, fibrillin, lectin-like receptor, metalloproteinases) and cell phenotype (myogenin, myosin heavy chain) with particular awareness for vascular tissue engineering applications. Elastin and collagen content resulted upregulated in collagen-HELP matrices, even showing an improved structural remodeling through the involvement of proteins to a ECM remodeling activity. Moreover, the hybrid matrices enhanced the contractile activity of C2C12 cells concurring to improve the mechanical properties of the scaffold. Finally, small-angle X-ray scattering analyses were performed to enable a very detailed analysis of the matrices at the nanoscale, comparing the scaffolds with native blood vessels. In conclusion, our work shows the use of recombinant HELP, as a very promising complement able to significantly improve the biomechanical properties of three-dimensional collagen matrices in terms of tensile stress and elastic modulus. © 2014 Wiley Periodicals, Inc.

Comparing large covariance matrices under weak conditions on the dependence structure and its application to gene clustering.

PubMed

Chang, Jinyuan; Zhou, Wen; Zhou, Wen-Xin; Wang, Lan

2017-03-01

Comparing large covariance matrices has important applications in modern genomics, where scientists are often interested in understanding whether relationships (e.g., dependencies or co-regulations) among a large number of genes vary between different biological states. We propose a computationally fast procedure for testing the equality of two large covariance matrices when the dimensions of the covariance matrices are much larger than the sample sizes. A distinguishing feature of the new procedure is that it imposes no structural assumptions on the unknown covariance matrices. Hence, the test is robust with respect to various complex dependence structures that frequently arise in genomics. We prove that the proposed procedure is asymptotically valid under weak moment conditions. As an interesting application, we derive a new gene clustering algorithm which shares the same nice property of avoiding restrictive structural assumptions for high-dimensional genomics data. Using an asthma gene expression dataset, we illustrate how the new test helps compare the covariance matrices of the genes across different gene sets/pathways between the disease group and the control group, and how the gene clustering algorithm provides new insights on the way gene clustering patterns differ between the two groups. The proposed methods have been implemented in an R-package HDtest and are available on CRAN. © 2016, The International Biometric Society.

Evaluation of polycaprolactone matrices for the intravaginal delivery of metronidazole in the treatment of bacterial vaginosis.

PubMed

Pathak, Meenakshi; Turner, Mark; Palmer, Cheryn; Coombes, Allan G A

2014-09-01

Microporous, poly (ɛ-caprolactone) (PCL) matrices loaded with the antibacterial, metronidazole were produced by rapidly cooling suspensions of drug powder in PCL solutions in acetone. Drug incorporation in the matrices increased from 2.0% to 10.6% w/w on raising the drug loading of the PCL solution from 5% to 20% w/w measured with respect to the PCL content. Drug loading efficiencies of 40-53% were obtained. Rapid 'burst release' of 35-55% of the metronidazole content was recorded over 24 h when matrices were immersed in simulated vaginal fluid (SVF), due to the presence of large amounts of drug on matrix surface as revealed by Raman microscopy. Gradual release of around 80% of the drug content occurred over the following 12 days. Metronidazole released from PCL matrices in SVF retained antimicrobial activity against Gardnerella vaginalis in vitro at levels up to 97% compared to the free drug. Basic modelling predicted that the concentrations of metronidazole released into vaginal fluid in vivo from a PCL matrix in the form of an intravaginal ring would exceed the minimum inhibitory concentration of metronidazole against G. vaginalis. These findings recommend further investigation of PCL matrices as intravaginal devices for controlled delivery of metronidazole in the treatment and prevention of bacterial vaginosis. © The Author(s) 2014 Reprints and permissions: sagepub.co.uk/journalsPermissions.nav.

TiO2-Based Photocatalytic Geopolymers for Nitric Oxide Degradation

PubMed Central

Strini, Alberto; Roviello, Giuseppina; Ricciotti, Laura; Ferone, Claudio; Messina, Francesco; Schiavi, Luca; Corsaro, Davide; Cioffi, Raffaele

2016-01-01

This study presents an experimental overview for the development of photocatalytic materials based on geopolymer binders as catalyst support matrices. Particularly, geopolymer matrices obtained from different solid precursors (fly ash and metakaolin), composite systems (siloxane-hybrid, foamed hybrid), and curing temperatures (room temperature and 60 °C) were investigated for the same photocatalyst content (i.e., 3% TiO2 by weight of paste). The geopolymer matrices were previously designed for different applications, ranging from insulating (foam) to structural materials. The photocatalytic activity was evaluated as NO degradation in air, and the results were compared with an ordinary Portland cement reference. The studied matrices demonstrated highly variable photocatalytic performance depending on both matrix constituents and the curing temperature, with promising activity revealed by the geopolymers based on fly ash and metakaolin. Furthermore, microstructural features and titania dispersion in the matrices were assessed by scanning electron microscopy (SEM) and energy dispersive X-ray (EDS) analyses. Particularly, EDS analyses of sample sections indicated segregation effects of titania in the surface layer, with consequent enhancement or depletion of the catalyst concentration in the active sample region, suggesting non-negligible transport phenomena during the curing process. The described results demonstrated that geopolymer binders can be interesting catalyst support matrices for the development of photocatalytic materials and indicated a large potential for the exploitation of their peculiar features. PMID:28773634

Clay-based matrices incorporating radioactive silts: A case study of sediments from spent fuel pool

NASA Astrophysics Data System (ADS)

Antonenko, Mikhail; Myshkin, Vyacheslav; Grigoriev, Alexander; Chubreev, Dmitry

2018-03-01

Radioactive silt sediments from uranium reactors may be effectively and safely included by ceramic compounds. The purpose of the paper is to determine the influence of composition and preparation conditions on physicochemical and mechanical properties of clay-based matrices containing radioactive silt. Clay matrices were prepared from four minerals, took from Siberian regions, as kaolin, loan, bentonite and red clay, and they included radioactive silt sediments collected from Spent Fuel Pool of a Uranium-graphite Reactor. The rate of 137Cs leaching from the matrices of different compositions was studied. The results of the studies allowed determining the optimal compositions and the preparation conditions of the matrices. It has been shown that red clay from "Zykovskaya" career (Krasnoyarsk region, Russia) is preferable for use as a matrix for incorporating the silt sediments compared to kaolin, loam and bentonite due to the maximum values tensile strength and minimal change in ultimate strength for compression after irradiation, freezing and water exposure. Nevertheless, 137Cs leaching rate of all studied composites did not exceed 10-3 g/cm2.day.

Malware analysis using visualized image matrices.

PubMed

Han, KyoungSoo; Kang, BooJoong; Im, Eul Gyu

2014-01-01

This paper proposes a novel malware visual analysis method that contains not only a visualization method to convert binary files into images, but also a similarity calculation method between these images. The proposed method generates RGB-colored pixels on image matrices using the opcode sequences extracted from malware samples and calculates the similarities for the image matrices. Particularly, our proposed methods are available for packed malware samples by applying them to the execution traces extracted through dynamic analysis. When the images are generated, we can reduce the overheads by extracting the opcode sequences only from the blocks that include the instructions related to staple behaviors such as functions and application programming interface (API) calls. In addition, we propose a technique that generates a representative image for each malware family in order to reduce the number of comparisons for the classification of unknown samples and the colored pixel information in the image matrices is used to calculate the similarities between the images. Our experimental results show that the image matrices of malware can effectively be used to classify malware families both statically and dynamically with accuracy of 0.9896 and 0.9732, respectively.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ghysels, Pieter; Li, Xiaoye S.; Rouet, Francois -Henry

Here, we present a sparse linear system solver that is based on a multifrontal variant of Gaussian elimination and exploits low-rank approximation of the resulting dense frontal matrices. We use hierarchically semiseparable (HSS) matrices, which have low-rank off-diagonal blocks, to approximate the frontal matrices. For HSS matrix construction, a randomized sampling algorithm is used together with interpolative decompositions. The combination of the randomized compression with a fast ULV HSS factoriz ation leads to a solver with lower computational complexity than the standard multifrontal method for many applications, resulting in speedups up to 7 fold for problems in our test suite.more » The implementation targets many-core systems by using task parallelism with dynamic runtime scheduling. Numerical experiments show performance improvements over state-of-the-art sparse direct solvers. The implementation achieves high performance and good scalability on a range of modern shared memory parallel systems, including the Intel Xeon Phi (MIC). The code is part of a software package called STRUMPACK - STRUctured Matrices PACKage, which also has a distributed memory component for dense rank-structured matrices.« less

An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling

DOE PAGES

Ghysels, Pieter; Li, Xiaoye S.; Rouet, Francois -Henry; ...

2016-10-27

Here, we present a sparse linear system solver that is based on a multifrontal variant of Gaussian elimination and exploits low-rank approximation of the resulting dense frontal matrices. We use hierarchically semiseparable (HSS) matrices, which have low-rank off-diagonal blocks, to approximate the frontal matrices. For HSS matrix construction, a randomized sampling algorithm is used together with interpolative decompositions. The combination of the randomized compression with a fast ULV HSS factoriz ation leads to a solver with lower computational complexity than the standard multifrontal method for many applications, resulting in speedups up to 7 fold for problems in our test suite.more » The implementation targets many-core systems by using task parallelism with dynamic runtime scheduling. Numerical experiments show performance improvements over state-of-the-art sparse direct solvers. The implementation achieves high performance and good scalability on a range of modern shared memory parallel systems, including the Intel Xeon Phi (MIC). The code is part of a software package called STRUMPACK - STRUctured Matrices PACKage, which also has a distributed memory component for dense rank-structured matrices.« less

Mathematical foundations of the GraphBLAS

DOE PAGES

Kepner, Jeremy; Aaltonen, Peter; Bader, David; ...

2016-12-01

The GraphBLAS standard (GraphBlas.org) is being developed to bring the potential of matrix-based graph algorithms to the broadest possible audience. Mathematically, the GraphBLAS defines a core set of matrix-based graph operations that can be used to implement a wide class of graph algorithms in a wide range of programming environments. This study provides an introduction to the mathematics of the GraphBLAS. Graphs represent connections between vertices with edges. Matrices can represent a wide range of graphs using adjacency matrices or incidence matrices. Adjacency matrices are often easier to analyze while incidence matrices are often better for representing data. Fortunately, themore » two are easily connected by matrix multiplication. A key feature of matrix mathematics is that a very small number of matrix operations can be used to manipulate a very wide range of graphs. This composability of a small number of operations is the foundation of the GraphBLAS. A standard such as the GraphBLAS can only be effective if it has low performance overhead. Finally, performance measurements of prototype GraphBLAS implementations indicate that the overhead is low.« less

Making almost commuting matrices commute

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hastings, Matthew B

Suppose two Hermitian matrices A, B almost commute ({parallel}[A,B]{parallel} {<=} {delta}). Are they close to a commuting pair of Hermitian matrices, A', B', with {parallel}A-A'{parallel},{parallel}B-B'{parallel} {<=} {epsilon}? A theorem of H. Lin shows that this is uniformly true, in that for every {epsilon} > 0 there exists a {delta} > 0, independent of the size N of the matrices, for which almost commuting implies being close to a commuting pair. However, this theorem does not specifiy how {delta} depends on {epsilon}. We give uniform bounds relating {delta} and {epsilon}. The proof is constructive, giving an explicit algorithm to construct A'more » and B'. We provide tighter bounds in the case of block tridiagonal and tridiagnonal matrices. Within the context of quantum measurement, this implies an algorithm to construct a basis in which we can make a projective measurement that approximately measures two approximately commuting operators simultaneously. Finally, we comment briefly on the case of approximately measuring three or more approximately commuting operators using POVMs (positive operator-valued measures) instead of projective measurements.« less

Behavior of sulfur mustard in sand, concrete, and asphalt matrices: Evaporation, degradation, and decontamination.

PubMed

Jung, Hyunsook; Choi, Seungki

2017-10-15

The evaporation, degradation, and decontamination of sulfur mustard on environmental matrices including sand, concrete, and asphalt are described. A specially designed wind tunnel and thermal desorber in combination with gas chromatograph (GC) produced profiles of vapor concentration obtained from samples of the chemical agent deposited as a drop on the surfaces of the matrices. The matrices were exposed to the chemical agent at room temperature, and the degradation reactions were monitored and characterized. A vapor emission test was also performed after a decontamination process. The results showed that on sand, the drop of agent spread laterally while evaporating. On concrete, the drop of the agent was absorbed immediately into the matrix while spreading and evaporating. However, the asphalt surface conserved the agent and slowly released parts of the agent over an extended period of time. The degradation reactions of the agent followed pseudo first order behavior on the matrices. Trace amounts of the residual agent present at the surface were also released as vapor after decontamination, posing a threat to the exposed individual and environment.

Chemiluminescence in cryogenic matrices

NASA Astrophysics Data System (ADS)

Lotnik, S. V.; Kazakov, Valeri P.

1989-04-01

The literature data on chemiluminescence (CL) in cryogenic matrices have been classified and correlated for the first time. The role of studies on phosphorescence and CL at low temperatures in the development of cryochemistry is shown. The features of low-temperature CL in matrices of nitrogen and inert gases (fine structure of spectra, matrix effects) and the data on the mobility and reactivity of atoms and radicals at very low temperatures are examined. The trends in the development of studies on CL in cryogenic matrices, such as the search for systems involving polyatomic molecules and extending the forms of CL reactions, are followed. The reactions of active nitrogen with hydrocarbons that are accompanied by light emission and CL in the oxidation of carbenes at T >= 77 K are examined. The bibliography includes 112 references.

A hypothetical learning trajectory for conceptualizing matrices as linear transformations

NASA Astrophysics Data System (ADS)

Andrews-Larson, Christine; Wawro, Megan; Zandieh, Michelle

2017-08-01

In this paper, we present a hypothetical learning trajectory (HLT) aimed at supporting students in developing flexible ways of reasoning about matrices as linear transformations in the context of introductory linear algebra. In our HLT, we highlight the integral role of the instructor in this development. Our HLT is based on the 'Italicizing N' task sequence, in which students work to generate, compose, and invert matrices that correspond to geometric transformations specified within the problem context. In particular, we describe the ways in which the students develop local transformation views of matrix multiplication (focused on individual mappings of input vectors to output vectors) and extend these local views to more global views in which matrices are conceptualized in terms of how they transform a space in a coordinated way.

Soluble organic matrices of aragonitic skeletons of Merulinidae (Cnidaria, Anthozoa).

PubMed

Dauphin, Yannicke; Cuif, Jean-Pierre; Williams, C Terry

2008-05-01

Our interpretation of the overall taxonomy and evolution of the Scleractinia, the most important reef builders in tropical areas, has long depended exclusively on morphology of the calcareous skeletons. The reported series of physical and biochemical characterizations of skeletons and the mineralizing matrices extracted from the skeletons allow, for the first time, the level of biochemical diversity among corallites of the same family to be estimated. Similarities and differences observed in the micro- and nanostructures of the skeletons reflect those of the soluble organic matrices. Sulphur is mainly associated with sulphated acidic sugars. The role of sulphated sugars on the biomineralization processes is still underestimated. The resulting data suggest that environmental conditions may act on the mineralization process through the detailed compositions of the mineralizing matrices.

The evaluation of hollow-fiber ultrafiltration and celite concentration of enteroviruses, adenoviruses and bacteriophage from different water matrices

EPA Pesticide Factsheets

The data to support the evaluation of hollow-fiber ultrafiltration and celite concentration of enteroviruses, adenoviruses and bacteriophage from different water matricesThis dataset is associated with the following publication:Rhodes , E., E. Huff, D. Hamilton, and J. Jones. The evaluation of hollow-fiber ultrafiltration and celite concentration of enteroviruses, adenoviruses and bacteriophage from different water matrices. JOURNAL OF VIROLOGICAL METHODS. Elsevier Science Ltd, New York, NY, USA, 228(2): 31-38, (2016).

The algebraic theory of latent projectors in lambda matrices

NASA Technical Reports Server (NTRS)

Denman, E. D.; Leyva-Ramos, J.; Jeon, G. J.

1981-01-01

Multivariable systems such as a finite-element model of vibrating structures, control systems, and large-scale systems are often formulated in terms of differential equations which give rise to lambda matrices. The present investigation is concerned with the formulation of the algebraic theory of lambda matrices and the relationship of latent roots, latent vectors, and latent projectors to the eigenvalues, eigenvectors, and eigenprojectors of the companion form. The chain rule for latent projectors and eigenprojectors for the repeated latent root or eigenvalues is given.

Algorithms for computing solvents of unilateral second-order matrix polynomials over prime finite fields using lambda-matrices

NASA Astrophysics Data System (ADS)

Burtyka, Filipp

2018-01-01

The paper considers algorithms for finding diagonalizable and non-diagonalizable roots (so called solvents) of monic arbitrary unilateral second-order matrix polynomial over prime finite field. These algorithms are based on polynomial matrices (lambda-matrices). This is an extension of existing general methods for computing solvents of matrix polynomials over field of complex numbers. We analyze how techniques for complex numbers can be adapted for finite field and estimate asymptotic complexity of the obtained algorithms.

Methodological studies on the VVER-440 control assembly calculations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hordosy, G.; Kereszturi, A.; Maraczy, C.

1995-12-31

The control assembly regions of VVER-440 reactors are represented by 2-group albedo matrices in the global calculations of the KARATE code system. Some methodological aspects of calculating albedo matrices with the COLA transport code are presented. Illustrations are given how these matrices depend on the relevant parameters describing the boron steel and steel regions of the control assemblies. The calculation of the response matrix for a node consisting of two parts filled with different materials is discussed.

Perceptual Optimization of DCT Color Quantization Matrices

NASA Technical Reports Server (NTRS)

Watson, Andrew B.; Statler, Irving C. (Technical Monitor)

1994-01-01

Many image compression schemes employ a block Discrete Cosine Transform (DCT) and uniform quantization. Acceptable rate/distortion performance depends upon proper design of the quantization matrix. In previous work, we showed how to use a model of the visibility of DCT basis functions to design quantization matrices for arbitrary display resolutions and color spaces. Subsequently, we showed how to optimize greyscale quantization matrices for individual images, for optimal rate/perceptual distortion performance. Here we describe extensions of this optimization algorithm to color images.

Algorithm 782 : codes for rank-revealing QR factorizations of dense matrices.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bischof, C. H.; Quintana-Orti, G.; Mathematics and Computer Science

1998-06-01

This article describes a suite of codes as well as associated testing and timing drivers for computing rank-revealing QR (RRQR) factorizations of dense matrices. The main contribution is an efficient block algorithm for approximating an RRQR factorization, employing a windowed version of the commonly used Golub pivoting strategy and improved versions of the RRQR algorithms for triangular matrices originally suggested by Chandrasekaran and Ipsen and by Pan and Tang, respectively, We highlight usage and features of these codes.

Nanocomposites from Stable Dispersions of Carbon Nanotubes in Polymeric Matrices Using Dispersion Interaction

NASA Technical Reports Server (NTRS)

Wise, Kristopher Eric (Inventor); Park, Cheol (Inventor); Kang, Jin Ho (Inventor); Siochi, Emilie J. (Inventor); Harrison, Joycelyn S. (Inventor)

2016-01-01

Stable dispersions of carbon nanotubes (CNTs) in polymeric matrices include CNTs dispersed in a host polymer or copolymer whose monomers have delocalized electron orbitals, so that a dispersion interaction results between the host polymer or copolymer and the CNTs dispersed therein. Nanocomposite products, which are presented in bulk, or when fabricated as a film, fiber, foam, coating, adhesive, paste, or molding, are prepared by standard means from the present stable dispersions of CNTs in polymeric matrices, employing dispersion interactions, as presented hereinabove.

Preliminary in vivo report on the osteocompatibility of poly(anhydride-co-imides) evaluated in a tibial model.

PubMed

Ibim, S E; Uhrich, K E; Attawia, M; Shastri, V R; El-Amin, S F; Bronson, R; Langer, R; Laurencin, C T

1998-01-01

A novel class of polymers with mechanical properties similar to cancellous bone are being investigated for their ability to be used in weight-bearing areas for orthopedic applications. The poly(anhydride-co-imide) polymers based on poly[trimellitylimidoglycine-co-1,6-bis(carboxyphenoxy)hexan e] (TMA-Gly:CPH) and poly[pyromellitylimidoalanine-co-1,6-bis(carboxyphenoxy)hexa ne] (PMA-Ala:CPH) in molar ratios of 30:70 were investigated for osteocompatibility, with effects on the healing of unicortical 3-mm defects in rat tibias examined over a 30-day period. Defects were made with surgical drill bits (3-mm diameter) and sites were filled with poly(anhydride-co-imide) matrices and compared to the control poly(lactic acid-glycolic acid) (PLAGA) (50:50), a well-characterized matrix frequently used in bone regeneration studies, and defects without polymeric implants. At predetermined time intervals (3, 6, 9, 12, 20, and 30 days), animals were sacrificed and tissue histology was examined for bone formation, polymer-tissue interaction, and local tissue response by light microscopy. The studies revealed that matrices of TMA-Gly:CPH and PMA-Ala:CPH produced responses similar to the control PLAGA with tissue compatibility characterized by a mild response involving neutrophils, macrophages, and giant cells throughout the experiment for all matrices studied. Matrices of PLAGA were nearly completely degraded by 21 days in contrast to matrices of TMA-Gly:CPH and PMA-Ala:CPH that displayed slow erosion characteristics and maintenance of shape. Defects in control rats without polymer healed by day 12, defects containing PLAGA healed after 20 days, and defects containing poly(anhydride-co-imide) matrices produced endosteal bone growth as early as day 3 and formed bridges of cortical bone around matrices by 30 days. In addition, there was marrow reconstitution at the defect site for all matrices studied along with matured bone-forming cells. This study suggests that novel poly(anhydride-co-imides) are promising polymers that may be suitable for use as implants in bone surgery, especially in weight-bearing areas.

Improved Convergence Rate of Multi-Group Scattering Moment Tallies for Monte Carlo Neutron Transport Codes

NASA Astrophysics Data System (ADS)

Nelson, Adam

Multi-group scattering moment matrices are critical to the solution of the multi-group form of the neutron transport equation, as they are responsible for describing the change in direction and energy of neutrons. These matrices, however, are difficult to correctly calculate from the measured nuclear data with both deterministic and stochastic methods. Calculating these parameters when using deterministic methods requires a set of assumptions which do not hold true in all conditions. These quantities can be calculated accurately with stochastic methods, however doing so is computationally expensive due to the poor efficiency of tallying scattering moment matrices. This work presents an improved method of obtaining multi-group scattering moment matrices from a Monte Carlo neutron transport code. This improved method of tallying the scattering moment matrices is based on recognizing that all of the outgoing particle information is known a priori and can be taken advantage of to increase the tallying efficiency (therefore reducing the uncertainty) of the stochastically integrated tallies. In this scheme, the complete outgoing probability distribution is tallied, supplying every one of the scattering moment matrices elements with its share of data. In addition to reducing the uncertainty, this method allows for the use of a track-length estimation process potentially offering even further improvement to the tallying efficiency. Unfortunately, to produce the needed distributions, the probability functions themselves must undergo an integration over the outgoing energy and scattering angle dimensions. This integration is too costly to perform during the Monte Carlo simulation itself and therefore must be performed in advance by way of a pre-processing code. The new method increases the information obtained from tally events and therefore has a significantly higher efficiency than the currently used techniques. The improved method has been implemented in a code system containing a new pre-processor code, NDPP, and a Monte Carlo neutron transport code, OpenMC. This method is then tested in a pin cell problem and a larger problem designed to accentuate the importance of scattering moment matrices. These tests show that accuracy was retained while the figure-of-merit for generating scattering moment matrices and fission energy spectra was significantly improved.

How to gain eleven IQ points in ten minutes: thinking aloud improves Raven's Matrices performance in older adults.

PubMed

Fox, Mark C; Charness, Neil

2010-03-01

Few studies have examined the impact of age on reactivity to concurrent think-aloud (TA) verbal reports. An initial study with 30 younger and 31 older adults revealed that thinking aloud improves older adult performance on a short form of the Raven's Matrices (Bors & Stokes, 1998, Educational and Psychological Measurement, 58, p. 382) but did not affect other tasks. In the replication experiment, 30 older adults (mean age = 73.0) performed the Raven's Matrices and three other tasks to replicate and extend the findings of the initial study. Once again older adults performed significantly better only on the Raven's Matrices while thinking aloud. Performance gains on this task were substantial (d = 0.73 and 0.92 in Experiments 1 and 2, respectively), corresponding to a fluid intelligence increase of nearly one standard deviation.

Evaluating the efficacy of a structure-derived amino acid substitution matrix in detecting protein homologs by BLAST and PSI-BLAST.

PubMed

Goonesekere, Nalin Cw

2009-01-01

The large numbers of protein sequences generated by whole genome sequencing projects require rapid and accurate methods of annotation. The detection of homology through computational sequence analysis is a powerful tool in determining the complex evolutionary and functional relationships that exist between proteins. Homology search algorithms employ amino acid substitution matrices to detect similarity between proteins sequences. The substitution matrices in common use today are constructed using sequences aligned without reference to protein structure. Here we present amino acid substitution matrices constructed from the alignment of a large number of protein domain structures from the structural classification of proteins (SCOP) database. We show that when incorporated into the homology search algorithms BLAST and PSI-blast, the structure-based substitution matrices enhance the efficacy of detecting remote homologs.

A solver for General Unilateral Polynomial Matrix Equation with Second-Order Matrices Over Prime Finite Fields

NASA Astrophysics Data System (ADS)

Burtyka, Filipp

2018-03-01

The paper firstly considers the problem of finding solvents for arbitrary unilateral polynomial matrix equations with second-order matrices over prime finite fields from the practical point of view: we implement the solver for this problem. The solver’s algorithm has two step: the first is finding solvents, having Jordan Normal Form (JNF), the second is finding solvents among the rest matrices. The first step reduces to the finding roots of usual polynomials over finite fields, the second is essentially exhaustive search. The first step’s algorithms essentially use the polynomial matrices theory. We estimate the practical duration of computations using our software implementation (for example that one can’t construct unilateral matrix polynomial over finite field, having any predefined number of solvents) and answer some theoretically-valued questions.

Wall-crossing invariants: from quantum mechanics to knots

DOE Office of Scientific and Technical Information (OSTI.GOV)

Galakhov, D., E-mail: galakhov@itep.ru, E-mail: galakhov@physics.rutgers.edu; Mironov, A., E-mail: mironov@lpi.ru; Morozov, A., E-mail: morozov@itep.ru

2015-03-15

We offer a pedestrian-level review of the wall-crossing invariants. The story begins from the scattering theory in quantum mechanics where the spectrum reshuffling can be related to permutations of S-matrices. In nontrivial situations, starting from spin chains and matrix models, the S-matrices are operatorvalued and their algebra is described in terms of R- and mixing (Racah) U-matrices. Then the Kontsevich-Soibelman (KS) invariants are nothing but the standard knot invariants made out of these data within the Reshetikhin-Turaev-Witten approach. The R and Racah matrices acquire a relatively universal form in the semiclassical limit, where the basic reshufflings with the change ofmore » moduli are those of the Stokes line. Natural from this standpoint are matrices provided by the modular transformations of conformal blocks (with the usual identification R = T and U = S), and in the simplest case of the first degenerate field (2, 1), when the conformal blocks satisfy a second-order Shrödinger-like equation, the invariants coincide with the Jones (N = 2) invariants of the associated knots. Another possibility to construct knot invariants is to realize the cluster coordinates associated with reshufflings of the Stokes lines immediately in terms of check-operators acting on solutions of the Knizhnik-Zamolodchikov equations. Then the R-matrices are realized as products of successive mutations in the cluster algebra and are manifestly described in terms of quantum dilogarithms, ultimately leading to the Hikami construction of knot invariants.« less

Do complex matrices modify the sorptive properties of polydimethylsiloxane (PDMS) for non-polar organic chemicals?

PubMed

Jahnke, Annika; Mayer, Philipp

2010-07-16

The partitioning of non-polar analytes into the silicone polydimethylsiloxane (PDMS) is the basis for many analytical approaches such as solid phase microextraction (SPME), stir bar sorptive extraction (SBSE) and environmental passive sampling. Recently, the methods have been applied to increasingly complex sample matrices. The present work investigated the possible effect of complex matrices on the sorptive properties of PDMS. First, SPME fibers with a 30 microm PDMS coating were immersed in 15 different matrices, including sediment, suspensions of soil and humic substances, mayonnaise, meat, fish, olive oil and fish oil. Second, the surface of the fibers was wiped clean, and together with matrix-free control fibers, they were exposed via headspace to 7 non-polar halogenated organic chemicals in spiked olive oil. The fibers were then solvent-extracted, analyzed, and the ratios of the mean concentrations in the matrix-immersed fibers to the control fibers were determined for all matrices. These ratios ranged from 92% to 112% for the four analytes with the highest analytical precision (i.e. polychlorinated biphenyls (PCBs) 3, 28, 52 and brominated diphenyl ether (BDE) 3), and they ranged from 74% to 133% for the other three compounds (i.e. PCBs 101, 105 and gamma-hexachlorocyclohexane (HCH)). We conclude that, for non-polar, hydrophobic chemicals, the sorptive properties of the PDMS were not modified by the diverse investigated media and consequently that PDMS is suited for sampling of these analytes even in highly complex matrices. 2010 Elsevier B.V. All rights reserved.

Evaluation of the accuracy of an offline seasonally-varying matrix transport model for simulating ideal age

DOE PAGES

Bardin, Ann; Primeau, Francois; Lindsay, Keith; ...

2016-07-21

Newton-Krylov solvers for ocean tracers have the potential to greatly decrease the computational costs of spinning up deep-ocean tracers, which can take several thousand model years to reach equilibrium with surface processes. One version of the algorithm uses offline tracer transport matrices to simulate an annual cycle of tracer concentrations and applies Newton’s method to find concentrations that are periodic in time. Here we present the impact of time-averaging the transport matrices on the equilibrium values of an ideal-age tracer. We compared annually-averaged, monthly-averaged, and 5-day-averaged transport matrices to an online simulation using the ocean component of the Community Earthmore » System Model (CESM) with a nominal horizontal resolution of 1° × 1° and 60 vertical levels. We found that increasing the time resolution of the offline transport model reduced a low age bias from 12% for the annually-averaged transport matrices, to 4% for the monthly-averaged transport matrices, and to less than 2% for the transport matrices constructed from 5-day averages. The largest differences were in areas with strong seasonal changes in the circulation, such as the Northern Indian Ocean. As a result, for many applications the relatively small bias obtained using the offline model makes the offline approach attractive because it uses significantly less computer resources and is simpler to set up and run.« less

Penile Reconstruction with Skin Grafts and Dermal Matrices: Indications and Management

PubMed Central

Triana Junco, Paloma; Dore, Mariela; Nuñez Cerezo, Vanesa; Jimenez Gomez, Javier; Miguel Ferrero, Miriam; Díaz González, Mercedes; Lopez-Pereira, Pedro; Lopez-Gutierrez, Juan Carlos

2017-01-01

Introduction  The penis eventually needs specific cutaneous coverage in the context of reconstructive procedures following trauma or congenital anomalies. Local flaps are the first choice but are not always available after multiple previous procedures. In these cases, skin graft and dermal matrices should be considered. Materials and Methods  This study was a retrospective review of the past 4 years of four patients with severe loss of penile shaft skin who underwent skin reconstruction. Dermal matrices and skin grafts were utilized. Dermal matrices were placed for a median of 4.5 weeks (3.0–6.0 weeks). The skin graft was harvested from the inner thigh region for split-thickness skin graft (STSG) and the inguinal region for full-thickness skin graft (FTSG). Results  The four patients presented with complete loss of skin in the penile shaft. One patient had a vesical exstrophy, one had a buried penis with only one corpus cavernosum, one had a wide congenital lymphedema of the genitalia, and one had a lack of skin following circumcision at home. They underwent reconstruction with three patients undergoing split-thickness skin graft; two dermal matrices; and one full-thickness graft, respectively, thereby achieving a good cosmetic and functional result. There were no complications, and all the patients successfully accepted the graft. Conclusion  Dermal matrices and skin grafts may serve as effective tools in the management of severe penile skin defects unable to be covered with local flaps. PMID:28868232

Beyond the functional matrix hypothesis: a network null model of human skull growth for the formation of bone articulations

PubMed Central

Esteve-Altava, Borja; Rasskin-Gutman, Diego

2014-01-01

Craniofacial sutures and synchondroses form the boundaries among bones in the human skull, providing functional, developmental and evolutionary information. Bone articulations in the skull arise due to interactions between genetic regulatory mechanisms and epigenetic factors such as functional matrices (soft tissues and cranial cavities), which mediate bone growth. These matrices are largely acknowledged for their influence on shaping the bones of the skull; however, it is not fully understood to what extent functional matrices mediate the formation of bone articulations. Aiming to identify whether or not functional matrices are key developmental factors guiding the formation of bone articulations, we have built a network null model of the skull that simulates unconstrained bone growth. This null model predicts bone articulations that arise due to a process of bone growth that is uniform in rate, direction and timing. By comparing predicted articulations with the actual bone articulations of the human skull, we have identified which boundaries specifically need the presence of functional matrices for their formation. We show that functional matrices are necessary to connect facial bones, whereas an unconstrained bone growth is sufficient to connect non-facial bones. This finding challenges the role of the brain in the formation of boundaries between bones in the braincase without neglecting its effect on skull shape. Ultimately, our null model suggests where to look for modified developmental mechanisms promoting changes in bone growth patterns that could affect the development and evolution of the head skeleton. PMID:24975579

Some physiological responses of wheat and bean to soil salinity at low matric suctions

NASA Astrophysics Data System (ADS)

Khatar, Mahnaz; Mohammadi, Mohammad Hossein; Shekari, Farid

2017-01-01

The effect of soil matric suction (2-33 kPa) and salinity (soil solution electrical conductivity 0.7-8 dS m-1 for bean and 2-20 dS m-1 for wheat) on some physiological characteristics of bean and wheat in a clay loam soil under greenhouse condition was investigated. The results showed that the leaf chlorophyll content index and potassium concentration decrease under salinity stress and increase with matric suction from 2 to 33 kPa suction for both plants. The wheat chlorophyll content index declines during the stress spell but bean chlorophyll content index remains nearly constant. The lowest values of the content of soluble sugars and the highest values of leaf proline content are observed at2 kPa matric suction (highest aeration stress) for bean and wheat. As matric suction increases from 2 to 6 kPa, the soluble sugars increases and proline content decreases significantly and then soluble sugars decreases and proline content increases until 10 kPa suction, and the soluble sugars remains nearly constant at the higher matric suctions for both plants. While the electrical conductivity effect on the soluble sugars is not significant, the values of proline content for both crop increase significantly with electrical conductivity. It was shown that the aeration stress can result in more considerable and rapid physiological responses, in comparison with salinity stress. There is a strong correlation between wheat and bean chlorophyll content index and potassium concentration under salinity and aeration stresses.

Predicting the combinatorial effects of water activity, pH and organic acids on Listeria growth in media and complex food matrices.

PubMed

Nyhan, L; Begley, M; Mutel, A; Qu, Y; Johnson, N; Callanan, M

2018-09-01

The aim of this study was to develop a model to predict growth of Listeria in complex food matrices as a function of pH, water activity and undissociated acetic and propionic acid concentration i.e. common food hurdles. Experimental growth curves of Listeria in food products and broth media were collected from ComBase, the literature and industry sources from which a bespoke secondary gamma model was constructed. Model performance was evaluated by comparing predictions to measured growth rates in growth media (BHI broth) and two adjusted food matrices (zucchini purée and béarnaise sauce). In general, observed growth rates were higher in broth than in the food matrices which resulted in the model over-estimating growth in the adjusted food matrices. In addition, model outputs were more accurate for conditions without acids, indicating that the organic acid component of the model was a source of inaccuracy. In summary, a new predictive growth model for innovating or renovating food products that rely on multi-hurdle technology was created. This study is the first to report on modelling of propionic acid as an inhibitor of Listeria in combination with other hurdles. Our findings provide valuable insights into predictive model design and performance and highlight the importance of experimental validation of models in real food matrices rather than laboratory media alone. Copyright © 2018 Elsevier Ltd. All rights reserved.

Location Prediction Based on Transition Probability Matrices Constructing from Sequential Rules for Spatial-Temporal K-Anonymity Dataset

PubMed Central

Liu, Zhao; Zhu, Yunhong; Wu, Chenxue

2016-01-01

Spatial-temporal k-anonymity has become a mainstream approach among techniques for protection of users’ privacy in location-based services (LBS) applications, and has been applied to several variants such as LBS snapshot queries and continuous queries. Analyzing large-scale spatial-temporal anonymity sets may benefit several LBS applications. In this paper, we propose two location prediction methods based on transition probability matrices constructing from sequential rules for spatial-temporal k-anonymity dataset. First, we define single-step sequential rules mined from sequential spatial-temporal k-anonymity datasets generated from continuous LBS queries for multiple users. We then construct transition probability matrices from mined single-step sequential rules, and normalize the transition probabilities in the transition matrices. Next, we regard a mobility model for an LBS requester as a stationary stochastic process and compute the n-step transition probability matrices by raising the normalized transition probability matrices to the power n. Furthermore, we propose two location prediction methods: rough prediction and accurate prediction. The former achieves the probabilities of arriving at target locations along simple paths those include only current locations, target locations and transition steps. By iteratively combining the probabilities for simple paths with n steps and the probabilities for detailed paths with n-1 steps, the latter method calculates transition probabilities for detailed paths with n steps from current locations to target locations. Finally, we conduct extensive experiments, and correctness and flexibility of our proposed algorithm have been verified. PMID:27508502

Efficient computer algebra algorithms for polynomial matrices in control design

NASA Technical Reports Server (NTRS)

Baras, J. S.; Macenany, D. C.; Munach, R.

1989-01-01

The theory of polynomial matrices plays a key role in the design and analysis of multi-input multi-output control and communications systems using frequency domain methods. Examples include coprime factorizations of transfer functions, cannonical realizations from matrix fraction descriptions, and the transfer function design of feedback compensators. Typically, such problems abstract in a natural way to the need to solve systems of Diophantine equations or systems of linear equations over polynomials. These and other problems involving polynomial matrices can in turn be reduced to polynomial matrix triangularization procedures, a result which is not surprising given the importance of matrix triangularization techniques in numerical linear algebra. Matrices with entries from a field and Gaussian elimination play a fundamental role in understanding the triangularization process. In the case of polynomial matrices, matrices with entries from a ring for which Gaussian elimination is not defined and triangularization is accomplished by what is quite properly called Euclidean elimination. Unfortunately, the numerical stability and sensitivity issues which accompany floating point approaches to Euclidean elimination are not very well understood. New algorithms are presented which circumvent entirely such numerical issues through the use of exact, symbolic methods in computer algebra. The use of such error-free algorithms guarantees that the results are accurate to within the precision of the model data--the best that can be hoped for. Care must be taken in the design of such algorithms due to the phenomenon of intermediate expressions swell.

Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train.

PubMed

Bengua, Johann A; Phien, Ho N; Tuan, Hoang Duong; Do, Minh N

2017-05-01

This paper proposes a novel approach to tensor completion, which recovers missing entries of data represented by tensors. The approach is based on the tensor train (TT) rank, which is able to capture hidden information from tensors thanks to its definition from a well-balanced matricization scheme. Accordingly, new optimization formulations for tensor completion are proposed as well as two new algorithms for their solution. The first one called simple low-rank tensor completion via TT (SiLRTC-TT) is intimately related to minimizing a nuclear norm based on TT rank. The second one is from a multilinear matrix factorization model to approximate the TT rank of a tensor, and is called tensor completion by parallel matrix factorization via TT (TMac-TT). A tensor augmentation scheme of transforming a low-order tensor to higher orders is also proposed to enhance the effectiveness of SiLRTC-TT and TMac-TT. Simulation results for color image and video recovery show the clear advantage of our method over all other methods.