Binary Positive Semidefinite Matrices and Associated Integer Polytopes
DEFF Research Database (Denmark)
Letchford, Adam N.; Sørensen, Michael Malmros
2012-01-01
We consider the positive semidefinite (psd) matrices with binary entries, along with the corresponding integer polytopes. We begin by establishing some basic properties of these matrices and polytopes. Then, we show that several families of integer polytopes in the literature-the cut, boolean qua...
Chordal Graphs and Semidefinite Optimization
DEFF Research Database (Denmark)
Vandenberghe, Lieven; Andersen, Martin Skovgaard
2015-01-01
of a sparse positive definite matrix, positive semidefinite and Euclidean distance matrix completion problems, and the evaluation of gradients and Hessians of logarithmic barriers for cones of sparse positive semidefinite matrices and their dual cones. The purpose of the survey is to show how these techniques...
A class of singular Ro-matrices and extensions to semidefinite linear complementarity problems
Directory of Open Access Journals (Sweden)
Sivakumar K.C.
2013-01-01
Full Text Available For ARnxn and qRn, the linear complementarity problem LCP(A, q is to determine if there is xRn such that x ≥ 0; y = Ax + q ≥ 0 and xT y = 0. Such an x is called a solution of LCP(A,q. A is called an Ro-matrix if LCP(A,0 has zero as the only solution. In this article, the class of R0-matrices is extended to include typically singular matrices, by requiring in addition that the solution x above belongs to a subspace of Rn. This idea is then extended to semidefinite linear complementarity problems, where a characterization is presented for the multplicative transformation.
Positive semidefinite matrix completion, universal rigidity and the Strong Arnold Property
M. Laurent (Monique); A. Varvitsiotis (Antonios)
2014-01-01
htmlabstractThis paper addresses the following three topics: positive semidefinite (psd) matrix completions, universal rigidity of frameworks, and the Strong Arnold Property (SAP). We show some strong connections among these topics, using semidefinite programming as unifying theme. Our main
Positive semidefinite matrix completion, universal rigidity and the Strong Arnold Property
Laurent, Monique; Varvitsiotis, A.
This paper addresses the following three topics: positive semidefinite (psd) matrix completions, universal rigidity of frameworks, and the Strong Arnold Property (SAP). We show some strong connections among these topics, using semidefinite programming as unifying theme. Our main contribution is a
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.
Hoy, Erik P; Mazziotti, David A
2015-08-14
Tensor factorization of the 2-electron integral matrix is a well-known technique for reducing the computational scaling of ab initio electronic structure methods toward that of Hartree-Fock and density functional theories. The simplest factorization that maintains the positive semidefinite character of the 2-electron integral matrix is the Cholesky factorization. In this paper, we introduce a family of positive semidefinite factorizations that generalize the Cholesky factorization. Using an implementation of the factorization within the parametric 2-RDM method [D. A. Mazziotti, Phys. Rev. Lett. 101, 253002 (2008)], we study several inorganic molecules, alkane chains, and potential energy curves and find that this generalized factorization retains the accuracy and size extensivity of the Cholesky factorization, even in the presence of multi-reference correlation. The generalized family of positive semidefinite factorizations has potential applications to low-scaling ab initio electronic structure methods that treat electron correlation with a computational cost approaching that of the Hartree-Fock method or density functional theory.
Energy Technology Data Exchange (ETDEWEB)
Hoy, Erik P.; Mazziotti, David A., E-mail: damazz@uchicago.edu [Department of Chemistry and The James Franck Institute, The University of Chicago, Chicago, Illinois 60637 (United States)
2015-08-14
Tensor factorization of the 2-electron integral matrix is a well-known technique for reducing the computational scaling of ab initio electronic structure methods toward that of Hartree-Fock and density functional theories. The simplest factorization that maintains the positive semidefinite character of the 2-electron integral matrix is the Cholesky factorization. In this paper, we introduce a family of positive semidefinite factorizations that generalize the Cholesky factorization. Using an implementation of the factorization within the parametric 2-RDM method [D. A. Mazziotti, Phys. Rev. Lett. 101, 253002 (2008)], we study several inorganic molecules, alkane chains, and potential energy curves and find that this generalized factorization retains the accuracy and size extensivity of the Cholesky factorization, even in the presence of multi-reference correlation. The generalized family of positive semidefinite factorizations has potential applications to low-scaling ab initio electronic structure methods that treat electron correlation with a computational cost approaching that of the Hartree-Fock method or density functional theory.
Complexity of the positive semidefinite matrix completion problem with a rank constraint.
M. Eisenberg-Nagy (Marianna); M. Laurent (Monique); A. Varvitsiotis (Antonios); K. Bezdek; A. Deza; Y. Ye
2013-01-01
htmlabstractWe consider the decision problem asking whether a partial rational symmetric matrix with an all-ones diagonal can be completed to a full positive semidefinite matrix of rank at most k. We show that this problem is NP-hard for any fixed integer k ≥ 2. Equivalently, for k ≥ 2, it is
Complexity of the positive semidefinite matrix completion problem with a rank constraint.
M. Eisenberg-Nagy (Marianna); M. Laurent (Monique); A. Varvitsiotis (Antonios)
2012-01-01
htmlabstractWe consider the decision problem asking whether a partial rational symmetric matrix with an all-ones diagonal can be completed to a full positive semidefinite matrix of rank at most k. We show that this problem is NP-hard for any fixed integer k ≥ 2. Equivalently, for k ≥ 2, it is
Complexity of the positive semidefinite matrix completion problem with a rank constraint
Nagy, M.; Laurent, M.; Varvitsiotis, A.; Bezdek, K.; Deza, A.; Ye, Y.
2013-01-01
We consider the decision problem asking whether a partial rational symmetric matrix with an all-ones diagonal can be completed to a full positive semidefinite matrix of rank at most k. We show that this problem is NP-hard for any fixed integer k ≥ 2. In other words, for k ≥ 2, it is NP-hard to test
Polyhedral and semidefinite programming methods in combinatorial optimization
Tunçel, Levent
2010-01-01
Since the early 1960s, polyhedral methods have played a central role in both the theory and practice of combinatorial optimization. Since the early 1990s, a new technique, semidefinite programming, has been increasingly applied to some combinatorial optimization problems. The semidefinite programming problem is the problem of optimizing a linear function of matrix variables, subject to finitely many linear inequalities and the positive semidefiniteness condition on some of the matrix variables. On certain problems, such as maximum cut, maximum satisfiability, maximum stable set and geometric r
A Class of Weighted Low Rank Approximation of the Positive Semidefinite Hankel Matrix
Directory of Open Access Journals (Sweden)
Jianchao Bai
2015-01-01
Full Text Available We consider the weighted low rank approximation of the positive semidefinite Hankel matrix problem arising in signal processing. By using the Vandermonde representation, we firstly transform the problem into an unconstrained optimization problem and then use the nonlinear conjugate gradient algorithm with the Armijo line search to solve the equivalent unconstrained optimization problem. Numerical examples illustrate that the new method is feasible and effective.
International Nuclear Information System (INIS)
Wei Yi; Fyodorov, Yan V
2008-01-01
Given any fixed N x N positive semi-definite diagonal matrix G ≥ 0 we derive the explicit formula for the density of complex eigenvalues for random matrices A of the form A=U√G where the random unitary matrices U are distributed on the group U(N) according to the Haar measure. (fast track communication)
Spatial and Spin Symmetry Breaking in Semidefinite-Programming-Based Hartree-Fock Theory.
Nascimento, Daniel R; DePrince, A Eugene
2018-05-08
The Hartree-Fock problem was recently recast as a semidefinite optimization over the space of rank-constrained two-body reduced-density matrices (RDMs) [ Phys. Rev. A 2014 , 89 , 010502(R) ]. This formulation of the problem transfers the nonconvexity of the Hartree-Fock energy functional to the rank constraint on the two-body RDM. We consider an equivalent optimization over the space of positive semidefinite one-electron RDMs (1-RDMs) that retains the nonconvexity of the Hartree-Fock energy expression. The optimized 1-RDM satisfies ensemble N-representability conditions, and ensemble spin-state conditions may be imposed as well. The spin-state conditions place additional linear and nonlinear constraints on the 1-RDM. We apply this RDM-based approach to several molecular systems and explore its spatial (point group) and spin ( Ŝ 2 and Ŝ 3 ) symmetry breaking properties. When imposing Ŝ 2 and Ŝ 3 symmetry but relaxing point group symmetry, the procedure often locates spatial-symmetry-broken solutions that are difficult to identify using standard algorithms. For example, the RDM-based approach yields a smooth, spatial-symmetry-broken potential energy curve for the well-known Be-H 2 insertion pathway. We also demonstrate numerically that, upon relaxation of Ŝ 2 and Ŝ 3 symmetry constraints, the RDM-based approach is equivalent to real-valued generalized Hartree-Fock theory.
Positive-definite matrix processes of finite variation
DEFF Research Database (Denmark)
Barndorff-Nielsen, Ole Eiler; Stelzer, Robert
2007-01-01
Processes of finite variation, which take values in the positive semidefinite matrices and are representable as the sum of an integral with respect to time and one with respect to an extended Poisson random measure, are considered. For such processes we derive conditions for the square root (and ...
Positive-Definite Matrix Processes of Finite Variation
DEFF Research Database (Denmark)
Barndorff-Nielsen, Ole Eiler; Stelzer, Robert
Processes of finite variation, which take values in the positive semidefinite matrices and are representable as the sum of an integral with respect to time and one with respect to an extended Poisson random measure, are considered. For such processes we derive conditions for the square root (and ...
Moment matrices, border bases and radical computation
Lasserre, J.B.; Laurent, M.; Mourrain, B.; Rostalski, P.; Trébuchet, P.
2013-01-01
In this paper, we describe new methods to compute the radical (resp. real radical) of an ideal, assuming its complex (resp. real) variety is finite. The aim is to combine approaches for solving a system of polynomial equations with dual methods which involve moment matrices and semi-definite
On Positive Semidefinite Modification Schemes for Incomplete Cholesky Factorization
Czech Academy of Sciences Publication Activity Database
Scott, J.; Tůma, Miroslav
2014-01-01
Roč. 36, č. 2 (2014), A609-A633 ISSN 1064-8275 R&D Projects: GA ČR GA13-06684S Institutional support: RVO:67985807 Keywords : sparse matrices * sparse linear systems * positive-definite symmetric systems * iterative solvers * preconditioning * incomplete Cholesky factorization Subject RIV: BA - General Mathematics Impact factor: 1.854, year: 2014
Multi-pitch Estimation using Semidefinite Programming
DEFF Research Database (Denmark)
Jensen, Tobias Lindstrøm; Vandenberghe, Lieven
2017-01-01
assuming a Nyquist sampled signal by adding an additional semidefinite constraint. We show that the proposed estimator has superior performance compared to state- of-the-art methods for separating two closely spaced fundamentals and approximately achieves the asymptotic Cramér-Rao lower bound.......Multi-pitch estimation concerns the problem of estimating the fundamental frequencies (pitches) and amplitudes/phases of multiple superimposed harmonic signals with application in music, speech, vibration analysis etc. In this paper we formulate a complex-valued multi-pitch estimator via...... a semidefinite programming representation of an atomic decomposition over a continuous dictionary of complex exponentials and extend this to real-valued data via a real semidefinite pro-ram with the same dimensions (i.e. half the size). We further impose a continuous frequency constraint naturally occurring from...
Semidefinite linear complementarity problems
International Nuclear Information System (INIS)
Eckhardt, U.
1978-04-01
Semidefinite linear complementarity problems arise by discretization of variational inequalities describing e.g. elastic contact problems, free boundary value problems etc. In the present paper linear complementarity problems are introduced and the theory as well as the numerical treatment of them are described. In the special case of semidefinite linear complementarity problems a numerical method is presented which combines the advantages of elimination and iteration methods without suffering from their drawbacks. This new method has very attractive properties since it has a high degree of invariance with respect to the representation of the set of all feasible solutions of a linear complementarity problem by linear inequalities. By means of some practical applications the properties of the new method are demonstrated. (orig.) [de
Positive Eigenvalues of Generalized Words in Two Hermitian Positive Definite Matrices
Hillar, Christopher; Johnson, Charles R.
2005-01-01
We define a word in two positive definite (complex Hermitian) matrices $A$ and $B$ as a finite product of real powers of $A$ and $B$. The question of which words have only positive eigenvalues is addressed. This question was raised some time ago in connection with a long-standing problem in theoretical physics, and it was previously approached by the authors for words in two real positive definite matrices with positive integral exponents. A large class of words that do guarantee positive eig...
Polynomial Primal-Dual Cone Affine Scaling for Semidefinite Programming
A.B. Berkelaar (Arjan); J.F. Sturm; S. Zhang (Shuzhong)
1996-01-01
textabstractIn this paper we generalize the primal--dual cone affine scaling algorithm of Sturm and Zhang to semidefinite programming. We show in this paper that the underlying ideas of the cone affine scaling algorithm can be naturely applied to semidefinite programming, resulting in a new
BILGO: Bilateral greedy optimization for large scale semidefinite programming
Hao, Zhifeng; Yuan, Ganzhao; Ghanem, Bernard
2013-01-01
Many machine learning tasks (e.g. metric and manifold learning problems) can be formulated as convex semidefinite programs. To enable the application of these tasks on a large-scale, scalability and computational efficiency are considered as desirable properties for a practical semidefinite programming algorithm. In this paper, we theoretically analyze a new bilateral greedy optimization (denoted BILGO) strategy in solving general semidefinite programs on large-scale datasets. As compared to existing methods, BILGO employs a bilateral search strategy during each optimization iteration. In such an iteration, the current semidefinite matrix solution is updated as a bilateral linear combination of the previous solution and a suitable rank-1 matrix, which can be efficiently computed from the leading eigenvector of the descent direction at this iteration. By optimizing for the coefficients of the bilateral combination, BILGO reduces the cost function in every iteration until the KKT conditions are fully satisfied, thus, it tends to converge to a global optimum. In fact, we prove that BILGO converges to the global optimal solution at a rate of O(1/k), where k is the iteration counter. The algorithm thus successfully combines the efficiency of conventional rank-1 update algorithms and the effectiveness of gradient descent. Moreover, BILGO can be easily extended to handle low rank constraints. To validate the effectiveness and efficiency of BILGO, we apply it to two important machine learning tasks, namely Mahalanobis metric learning and maximum variance unfolding. Extensive experimental results clearly demonstrate that BILGO can solve large-scale semidefinite programs efficiently.
BILGO: Bilateral greedy optimization for large scale semidefinite programming
Hao, Zhifeng
2013-10-03
Many machine learning tasks (e.g. metric and manifold learning problems) can be formulated as convex semidefinite programs. To enable the application of these tasks on a large-scale, scalability and computational efficiency are considered as desirable properties for a practical semidefinite programming algorithm. In this paper, we theoretically analyze a new bilateral greedy optimization (denoted BILGO) strategy in solving general semidefinite programs on large-scale datasets. As compared to existing methods, BILGO employs a bilateral search strategy during each optimization iteration. In such an iteration, the current semidefinite matrix solution is updated as a bilateral linear combination of the previous solution and a suitable rank-1 matrix, which can be efficiently computed from the leading eigenvector of the descent direction at this iteration. By optimizing for the coefficients of the bilateral combination, BILGO reduces the cost function in every iteration until the KKT conditions are fully satisfied, thus, it tends to converge to a global optimum. In fact, we prove that BILGO converges to the global optimal solution at a rate of O(1/k), where k is the iteration counter. The algorithm thus successfully combines the efficiency of conventional rank-1 update algorithms and the effectiveness of gradient descent. Moreover, BILGO can be easily extended to handle low rank constraints. To validate the effectiveness and efficiency of BILGO, we apply it to two important machine learning tasks, namely Mahalanobis metric learning and maximum variance unfolding. Extensive experimental results clearly demonstrate that BILGO can solve large-scale semidefinite programs efficiently.
On bounded rank positive semidefinite matrix completions of extreme partial correlation matrices.
M. Eisenberg-Nagy (Marianna); M. Laurent (Monique); A. Varvitsiotis (Antonios)
2012-01-01
textabstractWe study a new geometric graph parameter $egd(G)$, defined as the smallest integer $r\\ge 1$ for which any partial symmetric matrix which is completable to a correlation matrix and whose entries are specified at the positions of the edges of $G$, can be completed to a matrix in the convex
On bounded rank positive semidefinite matrix completions of extreme partial correlation matrices.
M. Eisenberg-Nagy (Marianna); M. Laurent (Monique); A. Varvitsiotis (Antonios)
2012-01-01
htmlabstractWe study a new geometric graph parameter egd(G), defined as the smallest integer r ≥ 1 for which any partial symmetric matrix which is completable to a correlation matrix and whose entries are specified at the positions of the edges of G, can be completed to a matrix in the convex hull
International Nuclear Information System (INIS)
Pollock, M.D.
1986-01-01
We consider the (4+N)-dimensional theory whose Lagrangian function is Lsub(4+N)=√-g-circumflex α R-circumflex 2 , where R-circumflex is the Ricci scalar and α is a positive constant. The metric is g-circumflexsub(AB)= diag(gsub(ab), phi -1 g-barsub(mn)). Dimensional reduction leads to an effective four-dimensional Lagrangian of induced-gravity type. The positive semi-definiteness of L avoids the difficulties, pointed out recently by Horowitz and by Rubakov, which can arise in quantum cosmology when the (Euclidean) action becomes negative. The compactification is onto a time-like internal space g-barsub(mn), as suggested by Aref'eva and Volovich, giving a four-dimensional de Sitter space-time with phi=constant, which however is classically unstable on a time scale approx. H -1 . Decrease of the radius phisup(-1/2) of the internal space is ultimately halted by quantum effects, via some V(phi), and L 4 then includes the usual Hilbert term and a cosmological constant. (author)
Positive projections of symmetric matrices and Jordan algebras
DEFF Research Database (Denmark)
Fuglede, Bent; Jensen, Søren Tolver
2013-01-01
An elementary proof is given that the projection from the space of all symmetric p×p matrices onto a linear subspace is positive if and only if the subspace is a Jordan algebra. This solves a problem in a statistical model.......An elementary proof is given that the projection from the space of all symmetric p×p matrices onto a linear subspace is positive if and only if the subspace is a Jordan algebra. This solves a problem in a statistical model....
Some thoughts on positive definiteness in the consideration of nuclear data covariance matrices
Energy Technology Data Exchange (ETDEWEB)
Geraldo, L.P.; Smith, D.L.
1988-01-01
Some basic mathematical features of covariance matrices are reviewed, particularly as they relate to the property of positive difiniteness. Physical implications of positive definiteness are also discussed. Consideration is given to an examination of the origins of non-positive definite matrices, to procedures which encourage the generation of positive definite matrices and to the testing of covariance matrices for positive definiteness. Attention is also given to certain problems associated with the construction of covariance matrices using information which is obtained from evaluated data files recorded in the ENDF format. Examples are provided to illustrate key points pertaining to each of the topic areas covered.
Some thoughts on positive definiteness in the consideration of nuclear data covariance matrices
International Nuclear Information System (INIS)
Geraldo, L.P.; Smith, D.L.
1988-01-01
Some basic mathematical features of covariance matrices are reviewed, particularly as they relate to the property of positive difiniteness. Physical implications of positive definiteness are also discussed. Consideration is given to an examination of the origins of non-positive definite matrices, to procedures which encourage the generation of positive definite matrices and to the testing of covariance matrices for positive definiteness. Attention is also given to certain problems associated with the construction of covariance matrices using information which is obtained from evaluated data files recorded in the ENDF format. Examples are provided to illustrate key points pertaining to each of the topic areas covered
Z-Q. Luo; J.F. Sturm; S. Zhang (Shuzhong)
1996-01-01
textabstractThis paper establishes the superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming under the assumptions that the semidefinite program has a strictly complementary primal-dual optimal solution and that the size of the central path
Handbook on semidefinite, conic and polynomial optimization
Anjos, Miguel F
2012-01-01
This book offers the reader a snapshot of the state-of-the-art in the growing and mutually enriching areas of semidefinite optimization, conic optimization and polynomial optimization. It covers theory, algorithms, software and applications.
Low-rank quadratic semidefinite programming
Yuan, Ganzhao
2013-04-01
Low rank matrix approximation is an attractive model in large scale machine learning problems, because it can not only reduce the memory and runtime complexity, but also provide a natural way to regularize parameters while preserving learning accuracy. In this paper, we address a special class of nonconvex quadratic matrix optimization problems, which require a low rank positive semidefinite solution. Despite their non-convexity, we exploit the structure of these problems to derive an efficient solver that converges to their local optima. Furthermore, we show that the proposed solution is capable of dramatically enhancing the efficiency and scalability of a variety of concrete problems, which are of significant interest to the machine learning community. These problems include the Top-k Eigenvalue problem, Distance learning and Kernel learning. Extensive experiments on UCI benchmarks have shown the effectiveness and efficiency of our proposed method. © 2012.
Low-rank quadratic semidefinite programming
Yuan, Ganzhao; Zhang, Zhenjie; Ghanem, Bernard; Hao, Zhifeng
2013-01-01
Low rank matrix approximation is an attractive model in large scale machine learning problems, because it can not only reduce the memory and runtime complexity, but also provide a natural way to regularize parameters while preserving learning accuracy. In this paper, we address a special class of nonconvex quadratic matrix optimization problems, which require a low rank positive semidefinite solution. Despite their non-convexity, we exploit the structure of these problems to derive an efficient solver that converges to their local optima. Furthermore, we show that the proposed solution is capable of dramatically enhancing the efficiency and scalability of a variety of concrete problems, which are of significant interest to the machine learning community. These problems include the Top-k Eigenvalue problem, Distance learning and Kernel learning. Extensive experiments on UCI benchmarks have shown the effectiveness and efficiency of our proposed method. © 2012.
Bayesian Nonparametric Clustering for Positive Definite Matrices.
Cherian, Anoop; Morellas, Vassilios; Papanikolopoulos, Nikolaos
2016-05-01
Symmetric Positive Definite (SPD) matrices emerge as data descriptors in several applications of computer vision such as object tracking, texture recognition, and diffusion tensor imaging. Clustering these data matrices forms an integral part of these applications, for which soft-clustering algorithms (K-Means, expectation maximization, etc.) are generally used. As is well-known, these algorithms need the number of clusters to be specified, which is difficult when the dataset scales. To address this issue, we resort to the classical nonparametric Bayesian framework by modeling the data as a mixture model using the Dirichlet process (DP) prior. Since these matrices do not conform to the Euclidean geometry, rather belongs to a curved Riemannian manifold,existing DP models cannot be directly applied. Thus, in this paper, we propose a novel DP mixture model framework for SPD matrices. Using the log-determinant divergence as the underlying dissimilarity measure to compare these matrices, and further using the connection between this measure and the Wishart distribution, we derive a novel DPM model based on the Wishart-Inverse-Wishart conjugate pair. We apply this model to several applications in computer vision. Our experiments demonstrate that our model is scalable to the dataset size and at the same time achieves superior accuracy compared to several state-of-the-art parametric and nonparametric clustering algorithms.
On semidefinite programming bounds for graph bandwidth
de Klerk, E.; Nagy, M.; Sotirov, R.
2013-01-01
In this paper, we propose two new lower bounds on graph bandwidth and cyclic bandwidth based on semidefinite programming (SDP) relaxations of the quadratic assignment problem. We compare the new bounds with two other SDP bounds reported in [A. Blum, G. Konjevod, R. Ravi, and S. Vempala,
Directory of Open Access Journals (Sweden)
Shun-ichi Amari
2014-04-01
Full Text Available Information geometry studies the dually flat structure of a manifold, highlighted by the generalized Pythagorean theorem. The present paper studies a class of Bregman divergences called the (ρ,τ-divergence. A (ρ,τ -divergence generates a dually flat structure in the manifold of positive measures, as well as in the manifold of positive-definite matrices. The class is composed of decomposable divergences, which are written as a sum of componentwise divergences. Conversely, a decomposable dually flat divergence is shown to be a (ρ,τ -divergence. A (ρ,τ -divergence is determined from two monotone scalar functions, ρ and τ. The class includes the KL-divergence, α-, β- and (α, β-divergences as special cases. The transformation between an affine parameter and its dual is easily calculated in the case of a decomposable divergence. Therefore, such a divergence is useful for obtaining the center for a cluster of points, which will be applied to classification and information retrieval in vision. For the manifold of positive-definite matrices, in addition to the dually flatness and decomposability, we require the invariance under linear transformations, in particular under orthogonal transformations. This opens a way to define a new class of divergences, called the (ρ,τ -structure in the manifold of positive-definite matrices.
Tensor Dictionary Learning for Positive Definite Matrices.
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.
Semi-definite Programming: methods and algorithms for energy management
International Nuclear Information System (INIS)
Gorge, Agnes
2013-01-01
The present thesis aims at exploring the potentialities of a powerful optimization technique, namely Semi-definite Programming, for addressing some difficult problems of energy management. We pursue two main objectives. The first one consists of using SDP to provide tight relaxations of combinatorial and quadratic problems. A first relaxation, called 'standard' can be derived in a generic way but it is generally desirable to reinforce them, by means of tailor-made tools or in a systematic fashion. These two approaches are implemented on different models of the Nuclear Outages Scheduling Problem, a famous combinatorial problem. We conclude this topic by experimenting the Lasserre's hierarchy on this problem, leading to a sequence of semi-definite relaxations whose optimal values tends to the optimal value of the initial problem. The second objective deals with the use of SDP for the treatment of uncertainty. We investigate an original approach called 'distributionally robust optimization', that can be seen as a compromise between stochastic and robust optimization and admits approximations under the form of a SDP. We compare the benefits of this method w.r.t classical approaches on a demand/supply equilibrium problem. Finally, we propose a scheme for deriving SDP relaxations of MISOCP and we report promising computational results indicating that the semi-definite relaxation improves significantly the continuous relaxation, while requiring a reasonable computational effort. SDP therefore proves to be a promising optimization method that offers great opportunities for innovation in energy management. (author)
Stochastic Control of Energy Efficient Buildings: A Semidefinite Programming Approach
Energy Technology Data Exchange (ETDEWEB)
Ma, Xiao [ORNL; Dong, Jin [ORNL; Djouadi, Seddik M [ORNL; Nutaro, James J [ORNL; Kuruganti, Teja [ORNL
2015-01-01
The key goal in energy efficient buildings is to reduce energy consumption of Heating, Ventilation, and Air- Conditioning (HVAC) systems while maintaining a comfortable temperature and humidity in the building. This paper proposes a novel stochastic control approach for achieving joint performance and power control of HVAC. We employ a constrained Stochastic Linear Quadratic Control (cSLQC) by minimizing a quadratic cost function with a disturbance assumed to be Gaussian. The problem is formulated to minimize the expected cost subject to a linear constraint and a probabilistic constraint. By using cSLQC, the problem is reduced to a semidefinite optimization problem, where the optimal control can be computed efficiently by Semidefinite programming (SDP). Simulation results are provided to demonstrate the effectiveness and power efficiency by utilizing the proposed control approach.
MIMO-radar Waveform Covariance Matrices for High SINR and Low Side-lobe Levels
Ahmed, Sajid
2012-12-29
MIMO-radar has better parametric identifiability but compared to phased-array radar it shows loss in signal-to-noise ratio due to non-coherent processing. To exploit the benefits of both MIMO-radar and phased-array two transmit covariance matrices are found. Both of the covariance matrices yield gain in signal-to-interference-plus-noise ratio (SINR) compared to MIMO-radar and have lower side-lobe levels (SLL)\\'s compared to phased-array and MIMO-radar. Moreover, in contrast to recently introduced phased-MIMO scheme, where each antenna transmit different power, our proposed schemes allows same power transmission from each antenna. The SLL\\'s of the proposed first covariance matrix are higher than the phased-MIMO scheme while the SLL\\'s of the second proposed covariance matrix are lower than the phased-MIMO scheme. The first covariance matrix is generated using an auto-regressive process, which allow us to change the SINR and side lobe levels by changing the auto-regressive parameter, while to generate the second covariance matrix the values of sine function between 0 and $\\\\pi$ with the step size of $\\\\pi/n_T$ are used to form a positive-semidefinite Toeplitiz matrix, where $n_T$ is the number of transmit antennas. Simulation results validate our analytical results.
On semidefinite programming relaxations of maximum k-section
de Klerk, E.; Pasechnik, D.V.; Sotirov, R.; Dobre, C.
2012-01-01
We derive a new semidefinite programming bound for the maximum k -section problem. For k=2 (i.e. for maximum bisection), the new bound is at least as strong as a well-known bound by Poljak and Rendl (SIAM J Optim 5(3):467–487, 1995). For k ≥ 3the new bound dominates a bound of Karisch and Rendl
Distributed Semidefinite Programming with Application to Large-scale System Analysis
DEFF Research Database (Denmark)
Khoshfetrat Pakazad, Sina; Hansson, Anders; Andersen, Martin S.
2017-01-01
Distributed algorithms for solving coupled semidefinite programs (SDPs) commonly require many iterations to converge. They also put high computational demand on the computational agents. In this paper we show that in case the coupled problem has an inherent tree structure, it is possible to devis...
Perils of parsimony: properties of reduced-rank estimates of genetic covariance matrices.
Meyer, Karin; Kirkpatrick, Mark
2008-10-01
Eigenvalues and eigenvectors of covariance matrices are important statistics for multivariate problems in many applications, including quantitative genetics. Estimates of these quantities are subject to different types of bias. This article reviews and extends the existing theory on these biases, considering a balanced one-way classification and restricted maximum-likelihood estimation. Biases are due to the spread of sample roots and arise from ignoring selected principal components when imposing constraints on the parameter space, to ensure positive semidefinite estimates or to estimate covariance matrices of chosen, reduced rank. In addition, it is shown that reduced-rank estimators that consider only the leading eigenvalues and -vectors of the "between-group" covariance matrix may be biased due to selecting the wrong subset of principal components. In a genetic context, with groups representing families, this bias is inverse proportional to the degree of genetic relationship among family members, but is independent of sample size. Theoretical results are supplemented by a simulation study, demonstrating close agreement between predicted and observed bias for large samples. It is emphasized that the rank of the genetic covariance matrix should be chosen sufficiently large to accommodate all important genetic principal components, even though, paradoxically, this may require including a number of components with negligible eigenvalues. A strategy for rank selection in practical analyses is outlined.
PENNON: A code for convex nonlinear and semidefinite programming
Czech Academy of Sciences Publication Activity Database
Kočvara, Michal; Stingl, M.
2003-01-01
Roč. 18, č. 3 (2003), s. 317-333 ISSN 1055-6788 R&D Projects: GA ČR GA201/00/0080 Grant - others:BMBF(DE) 03ZOM3ER Institutional research plan: CEZ:AV0Z1075907 Keywords : convex programming * semidefinite programming * large-scale problems Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 0.306, year: 2003
Numerical studies of entangled positive-partial-transpose states in composite quantum systems
International Nuclear Information System (INIS)
Leinaas, Jon Magne; Sollid, Per Oyvind; Myrheim, Jan
2010-01-01
We report here on the results of numerical searches for PPT states in a series of bipartite quantum systems of low dimensions. PPT states are represented by density matrices that remain positive semidefinite under partial transposition with respect to one of the subsystems, and our searches are for such states with specified ranks for the density matrix and its partial transpose. For a series of different ranks extremal PPT states and nonextremal entangled PPT states have been found. The results are listed in tables and charted in diagrams. Comparison of the results for systems of different dimensions reveals several regularities. We discuss lower and upper bounds on the ranks of extremal PPT states.
A Robust Incomplete Factorization Preconditioner for Positive Definite Matrices
Czech Academy of Sciences Publication Activity Database
Benzi, M.; Tůma, Miroslav
2003-01-01
Roč. 10, - (2003), s. 385-400 ISSN 1070-5325 R&D Projects: GA AV ČR IAA2030801; GA AV ČR IAA1030103 Institutional research plan: AV0Z1030915 Keywords : sparse linear systems * positive definite matrices * preconditioned conjugate gradient s * incomplete factorization * A-orthogonalization * SAINV Subject RIV: BA - General Mathematics Impact factor: 1.042, year: 2003
A Novel Approach for Solving Semidefinite Programs
Directory of Open Access Journals (Sweden)
Hong-Wei Jiao
2014-01-01
Full Text Available A novel linearizing alternating direction augmented Lagrangian approach is proposed for effectively solving semidefinite programs (SDP. For every iteration, by fixing the other variables, the proposed approach alternatively optimizes the dual variables and the dual slack variables; then the primal variables, that is, Lagrange multipliers, are updated. In addition, the proposed approach renews all the variables in closed forms without solving any system of linear equations. Global convergence of the proposed approach is proved under mild conditions, and two numerical problems are given to demonstrate the effectiveness of the presented approach.
Directory of Open Access Journals (Sweden)
Bui The Anh
2007-01-01
Full Text Available We extend the classical Perron-Frobenius theorem for positive quasipolynomial matrices associated with homogeneous difference equations. Finally, the result obtained is applied to derive necessary and sufficient conditions for the stability of positive system.
Extendable linearised adjustment model for deformation analysis
Hiddo Velsink
2015-01-01
Author supplied: "This paper gives a linearised adjustment model for the affine, similarity and congruence transformations in 3D that is easily extendable with other parameters to describe deformations. The model considers all coordinates stochastic. Full positive semi-definite covariance matrices
Extendable linearised adjustment model for deformation analysis
Velsink, H.
2015-01-01
This paper gives a linearised adjustment model for the affine, similarity and congruence transformations in 3D that is easily extendable with other parameters to describe deformations. The model considers all coordinates stochastic. Full positive semi-definite covariance matrices and correlation
Mutually unbiased bases and semi-definite programming
Energy Technology Data Exchange (ETDEWEB)
Brierley, Stephen; Weigert, Stefan, E-mail: steve.brierley@ulb.ac.be, E-mail: stefan.weigert@york.ac.uk
2010-11-01
A complex Hilbert space of dimension six supports at least three but not more than seven mutually unbiased bases. Two computer-aided analytical methods to tighten these bounds are reviewed, based on a discretization of parameter space and on Groebner bases. A third algorithmic approach is presented: the non-existence of more than three mutually unbiased bases in composite dimensions can be decided by a global optimization method known as semidefinite programming. The method is used to confirm that the spectral matrix cannot be part of a complete set of seven mutually unbiased bases in dimension six.
Mutually unbiased bases and semi-definite programming
International Nuclear Information System (INIS)
Brierley, Stephen; Weigert, Stefan
2010-01-01
A complex Hilbert space of dimension six supports at least three but not more than seven mutually unbiased bases. Two computer-aided analytical methods to tighten these bounds are reviewed, based on a discretization of parameter space and on Groebner bases. A third algorithmic approach is presented: the non-existence of more than three mutually unbiased bases in composite dimensions can be decided by a global optimization method known as semidefinite programming. The method is used to confirm that the spectral matrix cannot be part of a complete set of seven mutually unbiased bases in dimension six.
Wang, Shijun; Yao, Jianhua; Petrick, Nicholas A.; Summers, Ronald M.
2009-02-01
Colon cancer is the second leading cause of cancer-related deaths in the United States. Computed tomographic colonography (CTC) combined with a computer aided detection system provides a feasible combination for improving colonic polyps detection and increasing the use of CTC for colon cancer screening. To distinguish true polyps from false positives, various features extracted from polyp candidates have been proposed. Most of these features try to capture the shape information of polyp candidates or neighborhood knowledge about the surrounding structures (fold, colon wall, etc.). In this paper, we propose a new set of shape descriptors for polyp candidates based on statistical curvature information. These features, called histogram of curvature features, are rotation, translation and scale invariant and can be treated as complementing our existing feature set. Then in order to make full use of the traditional features (defined as group A) and the new features (group B) which are highly heterogeneous, we employed a multiple kernel learning method based on semi-definite programming to identify an optimized classification kernel based on the combined set of features. We did leave-one-patient-out test on a CTC dataset which contained scans from 50 patients (with 90 6-9mm polyp detections). Experimental results show that a support vector machine (SVM) based on the combined feature set and the semi-definite optimization kernel achieved higher FROC performance compared to SVMs using the two groups of features separately. At a false positive per patient rate of 7, the sensitivity on 6-9mm polyps using the combined features improved from 0.78 (Group A) and 0.73 (Group B) to 0.82 (p<=0.01).
Efficient classification of complete parameter regions based on semidefinite programming
Directory of Open Access Journals (Sweden)
Parrilo Pablo A
2007-01-01
Full Text Available Abstract Background Current approaches to parameter estimation are often inappropriate or inconvenient for the modelling of complex biological systems. For systems described by nonlinear equations, the conventional approach is to first numerically integrate the model, and then, in a second a posteriori step, check for consistency with experimental constraints. Hence, only single parameter sets can be considered at a time. Consequently, it is impossible to conclude that the "best" solution was identified or that no good solution exists, because parameter spaces typically cannot be explored in a reasonable amount of time. Results We introduce a novel approach based on semidefinite programming to directly identify consistent steady state concentrations for systems consisting of mass action kinetics, i.e., polynomial equations and inequality constraints. The duality properties of semidefinite programming allow to rigorously certify infeasibility for whole regions of parameter space, thus enabling the simultaneous multi-dimensional analysis of entire parameter sets. Conclusion Our algorithm reduces the computational effort of parameter estimation by several orders of magnitude, as illustrated through conceptual sample problems. Of particular relevance for systems biology, the approach can discriminate between structurally different candidate models by proving inconsistency with the available data.
The structure of completely positive matrices according to their CP-rank and CP-plus-rank
Dickinson, Peter James Clair; Bomze, Immanuel M.; Still, Georg J.
2015-01-01
We study the topological properties of the cp-rank operator $\\mathrm{cp}(A)$ and the related cp-plus-rank operator $\\mathrm{cp}^+(A)$ (which is introduced in this paper) in the set $\\mathcal{S}^n$ of symmetric $n\\times n$-matrices. For the set of completely positive matrices, $\\mathcal{CP}^n$, we
Semidefinite Relaxation-Based Optimization of Multiple-Input Wireless Power Transfer Systems
Lang, Hans-Dieter; Sarris, Costas D.
2017-11-01
An optimization procedure for multi-transmitter (MISO) wireless power transfer (WPT) systems based on tight semidefinite relaxation (SDR) is presented. This method ensures physical realizability of MISO WPT systems designed via convex optimization -- a robust, semi-analytical and intuitive route to optimizing such systems. To that end, the nonconvex constraints requiring that power is fed into rather than drawn from the system via all transmitter ports are incorporated in a convex semidefinite relaxation, which is efficiently and reliably solvable by dedicated algorithms. A test of the solution then confirms that this modified problem is equivalent (tight relaxation) to the original (nonconvex) one and that the true global optimum has been found. This is a clear advantage over global optimization methods (e.g. genetic algorithms), where convergence to the true global optimum cannot be ensured or tested. Discussions of numerical results yielded by both the closed-form expressions and the refined technique illustrate the importance and practicability of the new method. It, is shown that this technique offers a rigorous optimization framework for a broad range of current and emerging WPT applications.
de Klerk, E.; Sotirov, R.
2007-01-01
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment problems from the problem library: [R.E. Burkard,
Semi-definite relaxations for optimal control problems with oscillation and concentration effects
Czech Academy of Sciences Publication Activity Database
Claeys, M.; Henrion, D.; Kružík, Martin
2017-01-01
Roč. 23, č. 1 (2017), s. 95-117 ISSN 1292-8119 Institutional support: RVO:67985556 Keywords : optimal control * impulsive control * semidefinite programming Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics Impact factor: 1.540, year: 2016 http://library.utia.cas.cz/separaty/2017/MTR/kruzik-0470207.pdf
Averaging operations on matrices
Indian Academy of Sciences (India)
2014-07-03
Jul 3, 2014 ... Role of Positive Definite Matrices. • Diffusion Tensor Imaging: 3 × 3 pd matrices model water flow at each voxel of brain scan. • Elasticity: 6 × 6 pd matrices model stress tensors. • Machine Learning: n × n pd matrices occur as kernel matrices. Tanvi Jain. Averaging operations on matrices ...
de Klerk, E.; Laurent, M.
2011-01-01
The Lasserre hierarchy of semidefinite programming approximations to convex polynomial optimization problems is known to converge finitely under some assumptions. [J. B. Lasserre, Convexity in semialgebraic geometry and polynomial optimization, SIAM J. Optim., 19 (2009), pp. 1995–2014]. We give a
Approximate joint diagonalization and geometric mean of symmetric positive definite matrices.
Congedo, Marco; Afsari, Bijan; Barachant, Alexandre; Moakher, Maher
2014-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.
Approximate joint diagonalization and geometric mean of symmetric positive definite matrices.
Directory of Open Access Journals (Sweden)
Marco Congedo
Full Text Available 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.
A Sequential Convex Semidefinite Programming Algorithm for Multiple-Load Free Material Optimization
Czech Academy of Sciences Publication Activity Database
Stingl, M.; Kočvara, Michal; Leugering, G.
2009-01-01
Roč. 20, č. 1 (2009), s. 130-155 ISSN 1052-6234 R&D Projects: GA AV ČR IAA1075402 Grant - others:commision EU(XE) EU-FP6-30717 Institutional research plan: CEZ:AV0Z10750506 Keywords : structural optimization * material optimization * semidefinite programming * sequential convex programming Subject RIV: BA - General Mathematics Impact factor: 1.429, year: 2009
Jargalsaikhan, Bolor
Checking copositivity of a matrix is a co-NP-complete problem. This paper studies copositive matrices with certain spectral properties. It shows that an indefinite matrix with exactly one positive eigenvalue is copositive if and only if the matrix is nonnegative. Moreover, it shows that finding out
A new semidefinite programming relaxation for cycles in binary matroids and cuts in graphs
Gouveia, J.; Laurent, M.; Parrilo, P.; Thomas, R.
2012-01-01
The theta bodies of a polynomial ideal are a series of semidefinite programming relaxations of the convex hull of the real variety of the ideal. In this paper we construct the theta bodies of the vanishing ideal of cycles in a binary matroid. Applied to cuts in graphs, this yields a new hierarchy of
Evaluating functions of positive-definite matrices using colored-noise thermostats
Nava, Marco; Ceriotti, Michele; Dryzun, Chaim; Parrinello, Michele
2014-02-01
Many applications in computational science require computing the elements of a function of a large matrix. A commonly used approach is based on the the evaluation of the eigenvalue decomposition, a task that, in general, involves a computing time that scales with the cube of the size of the matrix. We present here a method that can be used to evaluate the elements of a function of a positive-definite matrix with a scaling that is linear for sparse matrices and quadratic in the general case. This methodology is based on the properties of the dynamics of a multidimensional harmonic potential coupled with colored-noise, generalized Langevin equation thermostats. This "f-thermostat" approach allows us to calculate directly elements of functions of a positive-definite matrix by carefully tailoring the properties of the stochastic dynamics. We demonstrate the scaling and the accuracy of this approach for both dense and sparse problems and compare the results with other established methodologies.
DEFF Research Database (Denmark)
Andersen, Bjarne Stig; Gunnels, John A.; Gustavson, Fred
2002-01-01
A new Recursive Packed Inverse Calculation Algorithm for symmetric positive definite matrices has been developed. The new Recursive Inverse Calculation algorithm uses minimal storage, \\$n(n+1)/2\\$, and has nearly the same performance as the LAPACK full storage algorithm using \\$n\\^2\\$ memory words...
Pop, P.C.; Still, Georg J.
1999-01-01
In linear programming it is known that an appropriate non-homogeneous Farkas Lemma leads to a short proof of the strong duality results for a pair of primal and dual programs. By using a corresponding generalized Farkas lemma we give a similar proof of the strong duality results for semidefinite
The invariant theory of matrices
Concini, Corrado De
2017-01-01
This book gives a unified, complete, and self-contained exposition of the main algebraic theorems of invariant theory for matrices in a characteristic free approach. More precisely, it contains the description of polynomial functions in several variables on the set of m\\times m matrices with coefficients in an infinite field or even the ring of integers, invariant under simultaneous conjugation. Following Hermann Weyl's classical approach, the ring of invariants is described by formulating and proving the first fundamental theorem that describes a set of generators in the ring of invariants, and the second fundamental theorem that describes relations between these generators. The authors study both the case of matrices over a field of characteristic 0 and the case of matrices over a field of positive characteristic. While the case of characteristic 0 can be treated following a classical approach, the case of positive characteristic (developed by Donkin and Zubkov) is much harder. A presentation of this case...
Spectral Regularization Algorithms for Learning Large Incomplete Matrices.
Mazumder, Rahul; Hastie, Trevor; Tibshirani, Robert
2010-03-01
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we provide a simple and very efficient convex algorithm for minimizing the reconstruction error subject to a bound on the nuclear norm. Our algorithm Soft-Impute iteratively replaces the missing elements with those obtained from a soft-thresholded SVD. With warm starts this allows us to efficiently compute an entire regularization path of solutions on a grid of values of the regularization parameter. The computationally intensive part of our algorithm is in computing a low-rank SVD of a dense matrix. Exploiting the problem structure, we show that the task can be performed with a complexity linear in the matrix dimensions. Our semidefinite-programming algorithm is readily scalable to large matrices: for example it can obtain a rank-80 approximation of a 10(6) × 10(6) incomplete matrix with 10(5) observed entries in 2.5 hours, and can fit a rank 40 approximation to the full Netflix training set in 6.6 hours. Our methods show very good performance both in training and test error when compared to other competitive state-of-the art techniques.
Ensemble Clustering using Semidefinite Programming with Applications.
Singh, Vikas; Mukherjee, Lopamudra; Peng, Jiming; Xu, Jinhui
2010-05-01
In this paper, we study the ensemble clustering problem, where the input is in the form of multiple clustering solutions. The goal of ensemble clustering algorithms is to aggregate the solutions into one solution that maximizes the agreement in the input ensemble. We obtain several new results for this problem. Specifically, we show that the notion of agreement under such circumstances can be better captured using a 2D string encoding rather than a voting strategy, which is common among existing approaches. Our optimization proceeds by first constructing a non-linear objective function which is then transformed into a 0-1 Semidefinite program (SDP) using novel convexification techniques. This model can be subsequently relaxed to a polynomial time solvable SDP. In addition to the theoretical contributions, our experimental results on standard machine learning and synthetic datasets show that this approach leads to improvements not only in terms of the proposed agreement measure but also the existing agreement measures based on voting strategies. In addition, we identify several new application scenarios for this problem. These include combining multiple image segmentations and generating tissue maps from multiple-channel Diffusion Tensor brain images to identify the underlying structure of the brain.
Quantum algorithms for the ordered search problem via semidefinite programming
International Nuclear Information System (INIS)
Childs, Andrew M.; Landahl, Andrew J.; Parrilo, Pablo A.
2007-01-01
One of the most basic computational problems is the task of finding a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log 2 N queries to the list, a quantum computer can solve the problem using a constant factor fewer queries. However, the precise value of this constant is unknown. By characterizing a class of quantum query algorithms for the ordered search problem in terms of a semidefinite program, we find quantum algorithms for small instances of the ordered search problem. Extending these algorithms to arbitrarily large instances using recursion, we show that there is an exact quantum ordered search algorithm using 4 log 605 N≅0.433 log 2 N queries, which improves upon the previously best known exact algorithm
Inverse m-matrices and ultrametric matrices
Dellacherie, Claude; San Martin, Jaime
2014-01-01
The study of M-matrices, their inverses and discrete potential theory is now a well-established part of linear algebra and the theory of Markov chains. The main focus of this monograph is the so-called inverse M-matrix problem, which asks for a characterization of nonnegative matrices whose inverses are M-matrices. We present an answer in terms of discrete potential theory based on the Choquet-Deny Theorem. A distinguished subclass of inverse M-matrices is ultrametric matrices, which are important in applications such as taxonomy. Ultrametricity is revealed to be a relevant concept in linear algebra and discrete potential theory because of its relation with trees in graph theory and mean expected value matrices in probability theory. Remarkable properties of Hadamard functions and products for the class of inverse M-matrices are developed and probabilistic insights are provided throughout the monograph.
Energy Technology Data Exchange (ETDEWEB)
Wathen, A. [Oxford Univ. (United Kingdom); Golub, G. [Stanford Univ., CA (United States)
1996-12-31
A simple fixed point linearisation of the Navier-Stokes equations leads to the Oseen problem which after appropriate discretisation yields large sparse linear systems with coefficient matrices of the form (A B{sup T} B -C). Here A is non-symmetric but its symmetric part is positive definite, and C is symmetric and positive semi-definite. Such systems arise in other situations. In this talk we will describe and present some analysis for an iteration based on an indefinite and symmetric preconditioner of the form (D B{sup T} B -C).
Non-Interior Continuation Method for Solving the Monotone Semidefinite Complementarity Problem
International Nuclear Information System (INIS)
Huang, Z.H.; Han, J.
2003-01-01
Recently, Chen and Tseng extended non-interior continuation smoothing methods for solving linear/ nonlinear complementarity problems to semidefinite complementarity problems (SDCP). In this paper we propose a non-interior continuation method for solving the monotone SDCP based on the smoothed Fischer-Burmeister function, which is shown to be globally linearly and locally quadratically convergent under suitable assumptions. Our algorithm needs at most to solve a linear system of equations at each iteration. In addition, in our analysis on global linear convergence of the algorithm, we need not use the assumption that the Frechet derivative of the function involved in the SDCP is Lipschitz continuous. For non-interior continuation/ smoothing methods for solving the nonlinear complementarity problem, such an assumption has been used widely in the literature in order to achieve global linear convergence results of the algorithms
Data depth and rank-based tests for covariance and spectral density matrices
Chau, Joris
2017-06-26
In multivariate time series analysis, objects of primary interest to study cross-dependences in the time series are the autocovariance or spectral density matrices. Non-degenerate covariance and spectral density matrices are necessarily Hermitian and positive definite, and our primary goal is to develop new methods to analyze samples of such matrices. The main contribution of this paper is the generalization of the concept of statistical data depth for collections of covariance or spectral density matrices by exploiting the geometric properties of the space of Hermitian positive definite matrices as a Riemannian manifold. This allows one to naturally characterize most central or outlying matrices, but also provides a practical framework for rank-based hypothesis testing in the context of samples of covariance or spectral density matrices. First, the desired properties of a data depth function acting on the space of Hermitian positive definite matrices are presented. Second, we propose two computationally efficient pointwise and integrated data depth functions that satisfy each of these requirements. Several applications of the developed methodology are illustrated by the analysis of collections of spectral matrices in multivariate brain signal time series datasets.
Data depth and rank-based tests for covariance and spectral density matrices
Chau, Joris; Ombao, Hernando; Sachs, Rainer von
2017-01-01
In multivariate time series analysis, objects of primary interest to study cross-dependences in the time series are the autocovariance or spectral density matrices. Non-degenerate covariance and spectral density matrices are necessarily Hermitian and positive definite, and our primary goal is to develop new methods to analyze samples of such matrices. The main contribution of this paper is the generalization of the concept of statistical data depth for collections of covariance or spectral density matrices by exploiting the geometric properties of the space of Hermitian positive definite matrices as a Riemannian manifold. This allows one to naturally characterize most central or outlying matrices, but also provides a practical framework for rank-based hypothesis testing in the context of samples of covariance or spectral density matrices. First, the desired properties of a data depth function acting on the space of Hermitian positive definite matrices are presented. Second, we propose two computationally efficient pointwise and integrated data depth functions that satisfy each of these requirements. Several applications of the developed methodology are illustrated by the analysis of collections of spectral matrices in multivariate brain signal time series datasets.
Veeraraghavan, Srikant; Mazziotti, David A
2014-03-28
We present a density matrix approach for computing global solutions of restricted open-shell Hartree-Fock theory, based on semidefinite programming (SDP), that gives upper and lower bounds on the Hartree-Fock energy of quantum systems. While wave function approaches to Hartree-Fock theory yield an upper bound to the Hartree-Fock energy, we derive a semidefinite relaxation of Hartree-Fock theory that yields a rigorous lower bound on the Hartree-Fock energy. We also develop an upper-bound algorithm in which Hartree-Fock theory is cast as a SDP with a nonconvex constraint on the rank of the matrix variable. Equality of the upper- and lower-bound energies guarantees that the computed solution is the globally optimal solution of Hartree-Fock theory. The work extends a previously presented method for closed-shell systems [S. Veeraraghavan and D. A. Mazziotti, Phys. Rev. A 89, 010502-R (2014)]. For strongly correlated systems the SDP approach provides an alternative to the locally optimized Hartree-Fock energies and densities with a certificate of global optimality. Applications are made to the potential energy curves of C2, CN, Cr2, and NO2.
Energy Technology Data Exchange (ETDEWEB)
Wagner, C.
1996-12-31
In 1992, Wittum introduced the frequency filtering decompositions (FFD), which yield a fast method for the iterative solution of large systems of linear equations. Based on this method, the tangential frequency filtering decompositions (TFFD) have been developed. The TFFD allow the robust and efficient treatment of matrices with strongly varying coefficients. The existence and the convergence of the TFFD can be shown for symmetric and positive definite matrices. For a large class of matrices, it is possible to prove that the convergence rate of the TFFD and of the FFD is independent of the number of unknowns. For both methods, schemes for the construction of frequency filtering decompositions for unsymmetric matrices have been developed. Since, in contrast to Wittums`s FFD, the TFFD needs only one test vector, an adaptive test vector can be used. The TFFD with respect to the adaptive test vector can be combined with other iterative methods, e.g. multi-grid methods, in order to improve the robustness of these methods. The frequency filtering decompositions have been successfully applied to the problem of the decontamination of a heterogeneous porous medium by flushing.
Bin Raies, Arwa; Mansour, Hicham; Incitti, Roberto; Bajic, Vladimir B.
2013-01-01
implicated in particular diseases. The large volume of the electronic text makes it difficult and impractical to search for this information manually.Methodology:We developed a novel text mining methodology based on a new concept of position weight matrices
Institute of Scientific and Technical Information of China (English)
黄静静; 商朋见; 王爱文
2011-01-01
将半定规划(Semidefinite Programming,SDP)的内点算法推广到二次半定规划(QuadraticSemidefinite Programming,QSDP),重点讨论了AHO搜索方向的产生方法.首先利用Wolfe对偶理论推导得到了求解二次半定规划的非线性方程组,利用牛顿法求解该方程组,得到了求解QSDP的内点算法的AHO搜索方向,证明了该搜索方向的存在唯一性,最后给出了求解二次半定规划的预估校正内点算法的具体步骤,并对基于不同搜索方向的内点算法进行了数值实验,结果表明基于NT方向的内点算法最为稳健.%This paper extends the interior point algorithm for solving Semidefinite Programming (SDP) to Quadratic Semidefinite Programming(QSDP) and especially discusses the generation of AHO search direction. Firstly, we derive the nonlinear equations for solving QSDP using Wolfe's dual theorem.The AHO search direction is got by applying Newton' s method to the equations. Then we prove the existence and uniqueness of the search direction, and give the detaied steps of predictor-corrector interior-point algorithm. At last, this paper provides a numerical comparison of the algoritms using three different search directions and suggests the algorithm using NT direction is the most robust.
Comparison of Semidefinite Relaxation Detectors for High-Order Modulation MIMO Systems
Directory of Open Access Journals (Sweden)
Z. Y. Shao
2014-01-01
Full Text Available Multiple-input multiple-output (MIMO system is considered to be one of the key technologies of LTE since it achieves requirements of high throughput and spectral efficiency. The semidefinite relaxation (SDR detection for MIMO systems is an attractive alternative to the optimum maximum likelihood (ML decoding because it is very computationally efficient. We propose a new SDR detector for 256-QAM MIMO system and compare its performance with two other SDR detectors, namely, BC-SDR detector and VA-SDR detector. The tightness and complexity of these three SDR detectors are analyzed. Both theoretical analysis and simulation results demonstrate that the proposed SDR can provide the best BLER performance among the three detectors, while the BC-SDR detector and the VA-SDR detector provide identical BLER performance. Moreover, the BC-SDR has the lowest computational complexity and the VA-SDR has the highest computational complexity, while the proposed SDR is in between.
Intrinsic Density Matrices of the Nuclear Shell Model
International Nuclear Information System (INIS)
Deveikis, A.; Kamuntavichius, G.
1996-01-01
A new method for calculation of shell model intrinsic density matrices, defined as two-particle density matrices integrated over the centre-of-mass position vector of two last particles and complemented with isospin variables, has been developed. The intrinsic density matrices obtained are completely antisymmetric, translation-invariant, and do not employ a group-theoretical classification of antisymmetric states. They are used for exact realistic density matrix expansion within the framework of the reduced Hamiltonian method. The procedures based on precise arithmetic for calculation of the intrinsic density matrices that involve no numerical diagonalization or orthogonalization have been developed and implemented in the computer code. (author). 11 refs., 2 tabs
Synchronous correlation matrices and Connes’ embedding conjecture
Energy Technology Data Exchange (ETDEWEB)
Dykema, Kenneth J., E-mail: kdykema@math.tamu.edu [Department of Mathematics, Texas A& M University, College Station, Texas 77843-3368 (United States); Paulsen, Vern, E-mail: vern@math.uh.edu [Department of Mathematics, University of Houston, Houston, Texas 77204 (United States)
2016-01-15
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 that 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.
Moments, positive polynomials and their applications
Lasserre, Jean Bernard
2009-01-01
Many important applications in global optimization, algebra, probability and statistics, applied mathematics, control theory, financial mathematics, inverse problems, etc. can be modeled as a particular instance of the Generalized Moment Problem (GMP) . This book introduces a new general methodology to solve the GMP when its data are polynomials and basic semi-algebraic sets. This methodology combines semidefinite programming with recent results from real algebraic geometry to provide a hierarchy of semidefinite relaxations converging to the desired optimal value. Applied on appropriate cones,
Unambiguous discrimination of mixed states: A description based on system-ancilla coupling
International Nuclear Information System (INIS)
Zhou, Xiang-Fa; Zhang, Yong-Sheng; Guo, Guang-Can
2007-01-01
We propose a general description for the unambiguous discrimination of mixed states according to the system-environment coupling, and present a procedure to reduce this to a standard semidefinite programming problem. In the two-state case, we introduce the canonical vectors and partly simplify the problem to the case of discrimination between pairs of canonical vectors. By considering the positivity of the 2x2 matrices, we obtain a series of new upper bounds for the total success probability, which depends on both the prior probabilities and specific state structures
Pathological rate matrices: from primates to pathogens
Directory of Open Access Journals (Sweden)
Knight Rob
2008-12-01
Full Text Available Abstract Background Continuous-time Markov models allow flexible, parametrically succinct descriptions of sequence divergence. Non-reversible forms of these models are more biologically realistic but are challenging to develop. The instantaneous rate matrices defined for these models are typically transformed into substitution probability matrices using a matrix exponentiation algorithm that employs eigendecomposition, but this algorithm has characteristic vulnerabilities that lead to significant errors when a rate matrix possesses certain 'pathological' properties. Here we tested whether pathological rate matrices exist in nature, and consider the suitability of different algorithms to their computation. Results We used concatenated protein coding gene alignments from microbial genomes, primate genomes and independent intron alignments from primate genomes. The Taylor series expansion and eigendecomposition matrix exponentiation algorithms were compared to the less widely employed, but more robust, Padé with scaling and squaring algorithm for nucleotide, dinucleotide, codon and trinucleotide rate matrices. Pathological dinucleotide and trinucleotide matrices were evident in the microbial data set, affecting the eigendecomposition and Taylor algorithms respectively. Even using a conservative estimate of matrix error (occurrence of an invalid probability, both Taylor and eigendecomposition algorithms exhibited substantial error rates: ~100% of all exonic trinucleotide matrices were pathological to the Taylor algorithm while ~10% of codon positions 1 and 2 dinucleotide matrices and intronic trinucleotide matrices, and ~30% of codon matrices were pathological to eigendecomposition. The majority of Taylor algorithm errors derived from occurrence of multiple unobserved states. A small number of negative probabilities were detected from the Pad�� algorithm on trinucleotide matrices that were attributable to machine precision. Although the Pad
Chequered surfaces and complex matrices
International Nuclear Information System (INIS)
Morris, T.R.; Southampton Univ.
1991-01-01
We investigate a large-N matrix model involving general complex matrices. It can be reinterpreted as a model of two hermitian matrices with specific couplings, and as a model of positive definite hermitian matrices. Large-N perturbation theory generates dynamical triangulations in which the triangles can be chequered (i.e. coloured so that neighbours are opposite colours). On a sphere there is a simple relation between such triangulations and those generated by the single hermitian matrix model. For the torus (and a quartic potential) we solve the counting problem for the number of triangulations that cannot be quechered. The critical physics of chequered triangulations is the same as that of the hermitian matrix model. We show this explicitly by solving non-perturbatively pure two-dimensional ''chequered'' gravity. The interpretative framework given here applies to a number of other generalisations of the hermitian matrix model. (orig.)
A Sum-of-Squares and Semidefinite Programming Approach for Maximum Likelihood DOA Estimation
Directory of Open Access Journals (Sweden)
Shu Cai
2016-12-01
Full Text Available Direction of arrival (DOA estimation using a uniform linear array (ULA is a classical problem in array signal processing. In this paper, we focus on DOA estimation based on the maximum likelihood (ML criterion, transform the estimation problem into a novel formulation, named as sum-of-squares (SOS, and then solve it using semidefinite programming (SDP. We first derive the SOS and SDP method for DOA estimation in the scenario of a single source and then extend it under the framework of alternating projection for multiple DOA estimation. The simulations demonstrate that the SOS- and SDP-based algorithms can provide stable and accurate DOA estimation when the number of snapshots is small and the signal-to-noise ratio (SNR is low. Moveover, it has a higher spatial resolution compared to existing methods based on the ML criterion.
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.
Efficient linear algebra routines for symmetric matrices stored in packed form.
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.
An Augmented Lagrangian Method for a Class of Inverse Quadratic Programming Problems
International Nuclear Information System (INIS)
Zhang Jianzhong; Zhang Liwei
2010-01-01
We consider an inverse quadratic programming (QP) problem in which the parameters in the objective function of a given QP problem are adjusted as little as possible so that a known feasible solution becomes the optimal one. We formulate this problem as a minimization problem with a positive semidefinite cone constraint and its dual is a linearly constrained semismoothly differentiable (SC 1 ) convex programming problem with fewer variables than the original one. We demonstrate the global convergence of the augmented Lagrangian method for the dual problem and prove that the convergence rate of primal iterates, generated by the augmented Lagrange method, is proportional to 1/r, and the rate of multiplier iterates is proportional to 1/√r, where r is the penalty parameter in the augmented Lagrangian. As the objective function of the dual problem is a SC 1 function involving the projection operator onto the cone of symmetrically semi-definite matrices, the analysis requires extensive tools such as the singular value decomposition of matrices, an implicit function theorem for semismooth functions, and properties of the projection operator in the symmetric-matrix space. Furthermore, the semismooth Newton method with Armijo line search is applied to solve the subproblems in the augmented Lagrange approach, which is proven to have global convergence and local quadratic rate. Finally numerical results, implemented by the augmented Lagrangian method, are reported.
Bapat, Ravindra B
2014-01-01
This new edition illustrates the power of linear algebra in the study of graphs. The emphasis on matrix techniques is greater than in other texts on algebraic graph theory. Important matrices associated with graphs (for example, incidence, adjacency and Laplacian matrices) are treated in detail. Presenting a useful overview of selected topics in algebraic graph theory, early chapters of the text focus on regular graphs, algebraic connectivity, the distance matrix of a tree, and its generalized version for arbitrary graphs, known as the resistance matrix. Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive definite completion problem and matrix games based on a graph. Such an extensive coverage of the subject area provides a welcome prompt for further exploration. The inclusion of exercises enables practical learning throughout the book. In the new edition, a new chapter is added on the line graph of a tree, while some results in Chapter 6 on Perron-Frobenius theory are reo...
VanderLaan Circulant Type Matrices
Directory of Open Access Journals (Sweden)
Hongyan Pan
2015-01-01
Full Text Available Circulant matrices have become a satisfactory tools in control methods for modern complex systems. In the paper, VanderLaan circulant type matrices are presented, which include VanderLaan circulant, left circulant, and g-circulant matrices. The nonsingularity of these special matrices is discussed by the surprising properties of VanderLaan numbers. The exact determinants of VanderLaan circulant type matrices are given by structuring transformation matrices, determinants of well-known tridiagonal matrices, and tridiagonal-like matrices. The explicit inverse matrices of these special matrices are obtained by structuring transformation matrices, inverses of known tridiagonal matrices, and quasi-tridiagonal matrices. Three kinds of norms and lower bound for the spread of VanderLaan circulant and left circulant matrix are given separately. And we gain the spectral norm of VanderLaan g-circulant matrix.
International Nuclear Information System (INIS)
Men, H.; Nguyen, N.C.; Freund, R.M.; Parrilo, P.A.; Peraire, J.
2010-01-01
In this paper, we consider the optimal design of photonic crystal structures for two-dimensional square lattices. The mathematical formulation of the bandgap optimization problem leads to an infinite-dimensional Hermitian eigenvalue optimization problem parametrized by the dielectric material and the wave vector. To make the problem tractable, the original eigenvalue problem is discretized using the finite element method into a series of finite-dimensional eigenvalue problems for multiple values of the wave vector parameter. The resulting optimization problem is large-scale and non-convex, with low regularity and non-differentiable objective. By restricting to appropriate eigenspaces, we reduce the large-scale non-convex optimization problem via reparametrization to a sequence of small-scale convex semidefinite programs (SDPs) for which modern SDP solvers can be efficiently applied. Numerical results are presented for both transverse magnetic (TM) and transverse electric (TE) polarizations at several frequency bands. The optimized structures exhibit patterns which go far beyond typical physical intuition on periodic media design.
Schur Complement Inequalities for Covariance Matrices and Monogamy of Quantum Correlations.
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.
Infinite matrices and sequence spaces
Cooke, Richard G
2014-01-01
This clear and correct summation of basic results from a specialized field focuses on the behavior of infinite matrices in general, rather than on properties of special matrices. Three introductory chapters guide students to the manipulation of infinite matrices, covering definitions and preliminary ideas, reciprocals of infinite matrices, and linear equations involving infinite matrices.From the fourth chapter onward, the author treats the application of infinite matrices to the summability of divergent sequences and series from various points of view. Topics include consistency, mutual consi
Complex Wedge-Shaped Matrices: A Generalization of Jacobi Matrices
Czech Academy of Sciences Publication Activity Database
Hnětynková, Iveta; Plešinger, M.
2015-01-01
Roč. 487, 15 December (2015), s. 203-219 ISSN 0024-3795 R&D Projects: GA ČR GA13-06684S Keywords : eigenvalues * eigenvector * wedge-shaped matrices * generalized Jacobi matrices * band (or block) Krylov subspace methods Subject RIV: BA - General Mathematics Impact factor: 0.965, year: 2015
Numerically Stable Evaluation of Moments of Random Gram Matrices With Applications
Elkhalil, Khalil; Kammoun, Abla; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim
2017-01-01
This paper focuses on the computation of the positive moments of one-side correlated random Gram matrices. Closed-form expressions for the moments can be obtained easily, but numerical evaluation thereof is prone to numerical stability, especially in high-dimensional settings. This letter provides a numerically stable method that efficiently computes the positive moments in closed-form. The developed expressions are more accurate and can lead to higher accuracy levels when fed to moment based-approaches. As an application, we show how the obtained moments can be used to approximate the marginal distribution of the eigenvalues of random Gram matrices.
Numerically Stable Evaluation of Moments of Random Gram Matrices With Applications
Elkhalil, Khalil
2017-07-31
This paper focuses on the computation of the positive moments of one-side correlated random Gram matrices. Closed-form expressions for the moments can be obtained easily, but numerical evaluation thereof is prone to numerical stability, especially in high-dimensional settings. This letter provides a numerically stable method that efficiently computes the positive moments in closed-form. The developed expressions are more accurate and can lead to higher accuracy levels when fed to moment based-approaches. As an application, we show how the obtained moments can be used to approximate the marginal distribution of the eigenvalues of random Gram matrices.
On reflectionless equi-transmitting matrices
Directory of Open Access Journals (Sweden)
Pavel Kurasov
2014-01-01
Full Text Available Reflectionless equi-transmitting unitary matrices are studied in connection to matching conditions in quantum graphs. All possible such matrices of size 6 are described explicitly. It is shown that such matrices form 30 six-parameter families intersected along 12 five-parameter families closely connected to conference matrices.
Flexible Bayesian Dynamic Modeling of Covariance and Correlation Matrices
Lan, Shiwei; Holbrook, Andrew; Fortin, Norbert J.; Ombao, Hernando; Shahbaba, Babak
2017-01-01
Modeling covariance (and correlation) matrices is a challenging problem due to the large dimensionality and positive-definiteness constraint. In this paper, we propose a novel Bayesian framework based on decomposing the covariance matrix
Flexible Bayesian Dynamic Modeling of Covariance and Correlation Matrices
Lan, Shiwei
2017-11-08
Modeling covariance (and correlation) matrices is a challenging problem due to the large dimensionality and positive-definiteness constraint. In this paper, we propose a novel Bayesian framework based on decomposing the covariance matrix into variance and correlation matrices. The highlight is that the correlations are represented as products of vectors on unit spheres. We propose a variety of distributions on spheres (e.g. the squared-Dirichlet distribution) to induce flexible prior distributions for covariance matrices that go beyond the commonly used inverse-Wishart prior. To handle the intractability of the resulting posterior, we introduce the adaptive $\\\\Delta$-Spherical Hamiltonian Monte Carlo. We also extend our structured framework to dynamic cases and introduce unit-vector Gaussian process priors for modeling the evolution of correlation among multiple time series. Using an example of Normal-Inverse-Wishart problem, a simulated periodic process, and an analysis of local field potential data (collected from the hippocampus of rats performing a complex sequence memory task), we demonstrated the validity and effectiveness of our proposed framework for (dynamic) modeling covariance and correlation matrices.
International Nuclear Information System (INIS)
Fantuzzi, G.; Wynn, A.
2015-01-01
A method to construct systematically an optimal background profile for the Kuramoto–Sivashinsky equation is developed by formulating the classical problem as an optimisation problem. In particular, we show that the infinite-dimensional problem can be rewritten as a finite-dimensional convex semidefinite problem, which is solved to construct a background profile and to obtain an upper bound on the energy of the solution ‖u‖ that applies to the infinite-dimensional PDE. The results are compared to existing analytical results, and support the fact that limsup t→∞ ‖u‖≤O(L 3/2 ) is the optimal estimate achievable with the background profile method and a quadratic Lyapunov function. - Highlights: • Optimal background profiles are constructed for the Kuramoto–Sivashinsky equation. • Analytical L 2 bounds for the solution are found using convex optimisation. • The optimal background profile is a double shock profile. • Results attest that L 1.5 scaling is optimal within the classic Lyapunov argument. • We improve the proportionality constant of the scaling law for the attracting set
Energy Technology Data Exchange (ETDEWEB)
Singh, Harpreet; Arvind; Dorai, Kavita, E-mail: kavita@iisermohali.ac.in
2016-09-07
Estimation of quantum states is an important step in any quantum information processing experiment. A naive reconstruction of the density matrix from experimental measurements can often give density matrices which are not positive, and hence not physically acceptable. How do we ensure that at all stages of reconstruction, we keep the density matrix positive? Recently a method has been suggested based on maximum likelihood estimation, wherein the density matrix is guaranteed to be positive definite. We experimentally implement this protocol on an NMR quantum information processor. We discuss several examples and compare with the standard method of state estimation. - Highlights: • State estimation using maximum likelihood method was performed on an NMR quantum information processor. • Physically valid density matrices were obtained every time in contrast to standard quantum state tomography. • Density matrices of several different entangled and separable states were reconstructed for two and three qubits.
Position Error Covariance Matrix Validation and Correction
Frisbee, Joe, Jr.
2016-01-01
In order to calculate operationally accurate collision probabilities, the position error covariance matrices predicted at times of closest approach must be sufficiently accurate representations of the position uncertainties. This presentation will discuss why the Gaussian distribution is a reasonable expectation for the position uncertainty and how this assumed distribution type is used in the validation and correction of position error covariance matrices.
Double stochastic matrices in quantum mechanics
International Nuclear Information System (INIS)
Louck, J.D.
1997-01-01
The general set of doubly stochastic matrices of order n corresponding to ordinary nonrelativistic quantum mechanical transition probability matrices is given. Lande's discussion of the nonquantal origin of such matrices is noted. Several concrete examples are presented for elementary and composite angular momentum systems with the focus on the unitary symmetry associated with such systems in the spirit of the recent work of Bohr and Ulfbeck. Birkhoff's theorem on doubly stochastic matrices of order n is reformulated in a geometrical language suitable for application to the subset of quantum mechanical doubly stochastic matrices. Specifically, it is shown that the set of points on the unit sphere in cartesian n'-space is subjective with the set of doubly stochastic matrices of order n. The question is raised, but not answered, as to what is the subset of points of this unit sphere that correspond to the quantum mechanical transition probability matrices, and what is the symmetry group of this subset of matrices
Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
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
International Nuclear Information System (INIS)
Maziero, Jonas
2015-01-01
The numerical generation of random quantum states (RQS) is an important procedure for investigations in quantum information science. Here, we review some methods that may be used for performing that task. We start by presenting a simple procedure for generating random state vectors, for which the main tool is the random sampling of unbiased discrete probability distributions (DPD). Afterwards, the creation of random density matrices is addressed. In this context, we first present the standard method, which consists in using the spectral decomposition of a quantum state for getting RQS from random DPDs and random unitary matrices. In the sequence, the Bloch vector parametrization method is described. This approach, despite being useful in several instances, is not in general convenient for RQS generation. In the last part of the article, we regard the overparametrized method (OPM) and the related Ginibre and Bures techniques. The OPM can be used to create random positive semidefinite matrices with unit trace from randomly produced general complex matrices in a simple way that is friendly for numerical implementations. We consider a physically relevant issue related to the possible domains that may be used for the real and imaginary parts of the elements of such general complex matrices. Subsequently, a too fast concentration of measure in the quantum state space that appears in this parametrization is noticed. (author)
Matrices and linear transformations
Cullen, Charles G
1990-01-01
""Comprehensive . . . an excellent introduction to the subject."" - Electronic Engineer's Design Magazine.This introductory textbook, aimed at sophomore- and junior-level undergraduates in mathematics, engineering, and the physical sciences, offers a smooth, in-depth treatment of linear algebra and matrix theory. The major objects of study are matrices over an arbitrary field. Contents include Matrices and Linear Systems; Vector Spaces; Determinants; Linear Transformations; Similarity: Part I and Part II; Polynomials and Polynomial Matrices; Matrix Analysis; and Numerical Methods. The first
Lambda-matrices and vibrating systems
Lancaster, Peter; Stark, M; Kahane, J P
1966-01-01
Lambda-Matrices and Vibrating Systems presents aspects and solutions to problems concerned with linear vibrating systems with a finite degrees of freedom and the theory of matrices. The book discusses some parts of the theory of matrices that will account for the solutions of the problems. The text starts with an outline of matrix theory, and some theorems are proved. The Jordan canonical form is also applied to understand the structure of square matrices. Classical theorems are discussed further by applying the Jordan canonical form, the Rayleigh quotient, and simple matrix pencils with late
Manin matrices and Talalaev's formula
International Nuclear Information System (INIS)
Chervov, A; Falqui, G
2008-01-01
In this paper we study properties of Lax and transfer matrices associated with quantum integrable systems. Our point of view stems from the fact that their elements satisfy special commutation properties, considered by Yu I Manin some 20 years ago at the beginning of quantum group theory. These are the commutation properties of matrix elements of linear homomorphisms between polynomial rings; more explicitly these read: (1) elements of the same column commute; (2) commutators of the cross terms are equal: [M ij , M kl ] [M kj , M il ] (e.g. [M 11 , M 22 ] = [M 21 , M 12 ]). The main aim of this paper is twofold: on the one hand we observe and prove that such matrices (which we call Manin matrices in short) behave almost as well as matrices with commutative elements. Namely, the theorems of linear algebra (e.g., a natural definition of the determinant, the Cayley-Hamilton theorem, the Newton identities and so on and so forth) have a straightforward counterpart in the case of Manin matrices. On the other hand, we remark that such matrices are somewhat ubiquitous in the theory of quantum integrability. For instance, Manin matrices (and their q-analogs) include matrices satisfying the Yang-Baxter relation 'RTT=TTR' and the so-called Cartier-Foata matrices. Also, they enter Talalaev's remarkable formulae: det(∂ z -L gaudin (z)), det(1-e -∂z T Yangian (z)) for the 'quantum spectral curve', and appear in the separation of variables problem and Capelli identities. We show that theorems of linear algebra, after being established for such matrices, have various applications to quantum integrable systems and Lie algebras, e.g. in the construction of new generators in Z(U crit (gl-hat n )) (and, in general, in the construction of quantum conservation laws), in the Knizhnik-Zamolodchikov equation, and in the problem of Wick ordering. We propose, in the appendix, a construction of quantum separated variables for the XXX-Heisenberg system
Introduction into Hierarchical Matrices
Litvinenko, Alexander
2013-01-01
Hierarchical matrices allow us to reduce computational storage and cost from cubic to almost linear. This technique can be applied for solving PDEs, integral equations, matrix equations and approximation of large covariance and precision matrices.
Introduction into Hierarchical Matrices
Litvinenko, Alexander
2013-12-05
Hierarchical matrices allow us to reduce computational storage and cost from cubic to almost linear. This technique can be applied for solving PDEs, integral equations, matrix equations and approximation of large covariance and precision matrices.
MERSENNE AND HADAMARD MATRICES CALCULATION BY SCARPIS METHOD
Directory of Open Access Journals (Sweden)
N. A. Balonin
2014-05-01
Full Text Available Purpose. The paper deals with the problem of basic generalizations of Hadamard matrices associated with maximum determinant matrices or not optimal by determinant matrices with orthogonal columns (weighing matrices, Mersenne and Euler matrices, ets.; calculation methods for the quasi-orthogonal local maximum determinant Mersenne matrices are not studied enough sufficiently. The goal of this paper is to develop the theory of Mersenne and Hadamard matrices on the base of generalized Scarpis method research. Methods. Extreme solutions are found in general by minimization of maximum for absolute values of the elements of studied matrices followed by their subsequent classification according to the quantity of levels and their values depending on orders. Less universal but more effective methods are based on structural invariants of quasi-orthogonal matrices (Silvester, Paley, Scarpis methods, ets.. Results. Generalizations of Hadamard and Belevitch matrices as a family of quasi-orthogonal matrices of odd orders are observed; they include, in particular, two-level Mersenne matrices. Definitions of section and layer on the set of generalized matrices are proposed. Calculation algorithms for matrices of adjacent layers and sections by matrices of lower orders are described. Approximation examples of the Belevitch matrix structures up to 22-nd critical order by Mersenne matrix of the third order are given. New formulation of the modified Scarpis method to approximate Hadamard matrices of high orders by lower order Mersenne matrices is proposed. Williamson method is described by example of one modular level matrices approximation by matrices with a small number of levels. Practical relevance. The efficiency of developing direction for the band-pass filters creation is justified. Algorithms for Mersenne matrices design by Scarpis method are used in developing software of the research program complex. Mersenne filters are based on the suboptimal by
Agricultural matrices affect ground ant assemblage composition inside forest fragments.
Directory of Open Access Journals (Sweden)
Diego Santana Assis
Full Text Available 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'.
Agricultural matrices affect ground ant assemblage composition inside forest fragments.
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'.
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.
Intrinsic character of Stokes matrices
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.
Hierarchical matrices algorithms and analysis
Hackbusch, Wolfgang
2015-01-01
This self-contained monograph presents matrix algorithms and their analysis. The new technique enables not only the solution of linear systems but also the approximation of matrix functions, e.g., the matrix exponential. Other applications include the solution of matrix equations, e.g., the Lyapunov or Riccati equation. The required mathematical background can be found in the appendix. The numerical treatment of fully populated large-scale matrices is usually rather costly. However, the technique of hierarchical matrices makes it possible to store matrices and to perform matrix operations approximately with almost linear cost and a controllable degree of approximation error. For important classes of matrices, the computational cost increases only logarithmically with the approximation error. The operations provided include the matrix inversion and LU decomposition. Since large-scale linear algebra problems are standard in scientific computing, the subject of hierarchical matrices is of interest to scientists ...
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.
Directory of Open Access Journals (Sweden)
Akira R Kinjo
Full Text Available Position-specific scoring matrices (PSSMs are useful for detecting weak homology in protein sequence analysis, and they are thought to contain some essential signatures of the protein families. In order to elucidate what kind of ingredients constitute such family-specific signatures, we apply singular value decomposition to a set of PSSMs and examine the properties of dominant right and left singular vectors. The first right singular vectors were correlated with various amino acid indices including relative mutability, amino acid composition in protein interior, hydropathy, or turn propensity, depending on proteins. A significant correlation between the first left singular vector and a measure of site conservation was observed. It is shown that the contribution of the first singular component to the PSSMs act to disfavor potentially but falsely functionally important residues at conserved sites. The second right singular vectors were highly correlated with hydrophobicity scales, and the corresponding left singular vectors with contact numbers of protein structures. It is suggested that sequence alignment with a PSSM is essentially equivalent to threading supplemented with functional information. In addition, singular vectors may be useful for analyzing and annotating the characteristics of conserved sites in protein families.
Special matrices of mathematical physics stochastic, circulant and Bell matrices
Aldrovandi, R
2001-01-01
This book expounds three special kinds of matrices that are of physical interest, centering on physical examples. Stochastic matrices describe dynamical systems of many different types, involving (or not) phenomena like transience, dissipation, ergodicity, nonequilibrium, and hypersensitivity to initial conditions. The main characteristic is growth by agglomeration, as in glass formation. Circulants are the building blocks of elementary Fourier analysis and provide a natural gateway to quantum mechanics and noncommutative geometry. Bell polynomials offer closed expressions for many formulas co
Le, Nguyen-Quoc-Khanh; Ho, Quang-Thai; Ou, Yu-Yen
2017-09-05
In several years, deep learning is a modern machine learning technique using in a variety of fields with state-of-the-art performance. Therefore, utilization of deep learning to enhance performance is also an important solution for current bioinformatics field. In this study, we try to use deep learning via convolutional neural networks and position specific scoring matrices to identify electron transport proteins, which is an important molecular function in transmembrane proteins. Our deep learning method can approach a precise model for identifying of electron transport proteins with achieved sensitivity of 80.3%, specificity of 94.4%, and accuracy of 92.3%, with MCC of 0.71 for independent dataset. The proposed technique can serve as a powerful tool for identifying electron transport proteins and can help biologists understand the function of the electron transport proteins. Moreover, this study provides a basis for further research that can enrich a field of applying deep learning in bioinformatics. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.
Energy Technology Data Exchange (ETDEWEB)
Dall' Anese, Emiliano; Dhople, Sairaj V.; Giannakis, Georgios B.
2015-07-01
This paper considers a collection of networked nonlinear dynamical systems, and addresses the synthesis of feedback controllers that seek optimal operating points corresponding to the solution of pertinent network-wide optimization problems. Particular emphasis is placed on the solution of semidefinite programs (SDPs). The design of the feedback controller is grounded on a dual e-subgradient approach, with the dual iterates utilized to dynamically update the dynamical-system reference signals. Global convergence is guaranteed for diminishing stepsize rules, even when the reference inputs are updated at a faster rate than the dynamical-system settling time. The application of the proposed framework to the control of power-electronic inverters in AC distribution systems is discussed. The objective is to bridge the time-scale separation between real-time inverter control and network-wide optimization. Optimization objectives assume the form of SDP relaxations of prototypical AC optimal power flow problems.
Old and New about Positive Definite Matrices
Czech Academy of Sciences Publication Activity Database
Fiedler, Miroslav
2015-01-01
Roč. 484, 1 November (2015), s. 496-503 ISSN 0024-3795 R&D Projects: GA ČR(CZ) GAP108/11/0853 Institutional support: RVO:67985807 Keywords : positive definite matrix * normalized positive definite matrix * sign pattern Subject RIV: BA - General Mathematics Impact factor: 0.965, year: 2015
a Continuous-Time Positive Linear System
Directory of Open Access Journals (Sweden)
Kyungsup Kim
2013-01-01
Full Text Available This paper discusses a computational method to construct positive realizations with sparse matrices for continuous-time positive linear systems with multiple complex poles. To construct a positive realization of a continuous-time system, we use a Markov sequence similar to the impulse response sequence that is used in the discrete-time case. The existence of the proposed positive realization can be analyzed with the concept of a polyhedral convex cone. We provide a constructive algorithm to compute positive realizations with sparse matrices of some positive systems under certain conditions. A sufficient condition for the existence of a positive realization, under which the proposed constructive algorithm works well, is analyzed.
Sufficient conditions for positivity of non-Markovian master equations with Hermitian generators
International Nuclear Information System (INIS)
Wilkie, Joshua; Wong Yinmei
2009-01-01
We use basic physical motivations to develop sufficient conditions for positive semidefiniteness of the reduced density matrix for generalized non-Markovian integrodifferential Lindblad-Kossakowski master equations with Hermitian generators. We show that it is sufficient for the memory function to be the Fourier transform of a real positive symmetric frequency density function with certain properties. These requirements are physically motivated, and are more general and more easily checked than previously stated sufficient conditions. We also explore the decoherence dynamics numerically for some simple models using the Hadamard representation of the propagator. We show that the sufficient conditions are not necessary conditions. We also show that models exist in which the long time limit is in part determined by non-Markovian effects
Generalized Eigenvalues for pairs on heritian matrices
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.
Introduction to matrices and vectors
Schwartz, Jacob T
2001-01-01
In this concise undergraduate text, the first three chapters present the basics of matrices - in later chapters the author shows how to use vectors and matrices to solve systems of linear equations. 1961 edition.
Spectra of sparse random matrices
International Nuclear Information System (INIS)
Kuehn, Reimer
2008-01-01
We compute the spectral density for ensembles of sparse symmetric random matrices using replica. Our formulation of the replica-symmetric ansatz shares the symmetries of that suggested in a seminal paper by Rodgers and Bray (symmetry with respect to permutation of replica and rotation symmetry in the space of replica), but uses a different representation in terms of superpositions of Gaussians. It gives rise to a pair of integral equations which can be solved by a stochastic population-dynamics algorithm. Remarkably our representation allows us to identify pure-point contributions to the spectral density related to the existence of normalizable eigenstates. Our approach is not restricted to matrices defined on graphs with Poissonian degree distribution. Matrices defined on regular random graphs or on scale-free graphs, are easily handled. We also look at matrices with row constraints such as discrete graph Laplacians. Our approach naturally allows us to unfold the total density of states into contributions coming from vertices of different local coordinations and an example of such an unfolding is presented. Our results are well corroborated by numerical diagonalization studies of large finite random matrices
A Role for M-Matrices in Modelling Population Growth
James, Glyn; Rumchev, Ventsi
2006-01-01
Adopting a discrete-time cohort-type model to represent the dynamics of a population, the problem of achieving a desired total size of the population under a balanced growth (contraction) and the problem of maintaining the desired size, once achieved, are studied. Properties of positive-time systems and M-matrices are used to develop the results,…
Large deviations of the maximum eigenvalue in Wishart random matrices
International Nuclear Information System (INIS)
Vivo, Pierpaolo; Majumdar, Satya N; Bohigas, Oriol
2007-01-01
We analytically compute the probability of large fluctuations to the left of the mean of the largest eigenvalue in the Wishart (Laguerre) ensemble of positive definite random matrices. We show that the probability that all the eigenvalues of a (N x N) Wishart matrix W = X T X (where X is a rectangular M x N matrix with independent Gaussian entries) are smaller than the mean value (λ) = N/c decreases for large N as ∼exp[-β/2 N 2 Φ - (2√c + 1: c)], where β = 1, 2 corresponds respectively to real and complex Wishart matrices, c = N/M ≤ 1 and Φ - (x; c) is a rate (sometimes also called large deviation) function that we compute explicitly. The result for the anti-Wishart case (M < N) simply follows by exchanging M and N. We also analytically determine the average spectral density of an ensemble of Wishart matrices whose eigenvalues are constrained to be smaller than a fixed barrier. Numerical simulations are in excellent agreement with the analytical predictions
Large deviations of the maximum eigenvalue in Wishart random matrices
Energy Technology Data Exchange (ETDEWEB)
Vivo, Pierpaolo [School of Information Systems, Computing and Mathematics, Brunel University, Uxbridge, Middlesex, UB8 3PH (United Kingdom) ; Majumdar, Satya N [Laboratoire de Physique Theorique et Modeles Statistiques (UMR 8626 du CNRS), Universite Paris-Sud, Batiment 100, 91405 Orsay Cedex (France); Bohigas, Oriol [Laboratoire de Physique Theorique et Modeles Statistiques (UMR 8626 du CNRS), Universite Paris-Sud, Batiment 100, 91405 Orsay Cedex (France)
2007-04-20
We analytically compute the probability of large fluctuations to the left of the mean of the largest eigenvalue in the Wishart (Laguerre) ensemble of positive definite random matrices. We show that the probability that all the eigenvalues of a (N x N) Wishart matrix W = X{sup T}X (where X is a rectangular M x N matrix with independent Gaussian entries) are smaller than the mean value ({lambda}) = N/c decreases for large N as {approx}exp[-{beta}/2 N{sup 2}{phi}{sub -} (2{radical}c + 1: c)], where {beta} = 1, 2 corresponds respectively to real and complex Wishart matrices, c = N/M {<=} 1 and {phi}{sub -}(x; c) is a rate (sometimes also called large deviation) function that we compute explicitly. The result for the anti-Wishart case (M < N) simply follows by exchanging M and N. We also analytically determine the average spectral density of an ensemble of Wishart matrices whose eigenvalues are constrained to be smaller than a fixed barrier. Numerical simulations are in excellent agreement with the analytical predictions.
Chemiluminescence in cryogenic matrices
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.
Naghibi, Tofigh; Hoffmann, Sarah; Pfister, Beat
2015-08-01
Feature subset selection, as a special case of the general subset selection problem, has been the topic of a considerable number of studies due to the growing importance of data-mining applications. In the feature subset selection problem there are two main issues that need to be addressed: (i) Finding an appropriate measure function than can be fairly fast and robustly computed for high-dimensional data. (ii) A search strategy to optimize the measure over the subset space in a reasonable amount of time. In this article mutual information between features and class labels is considered to be the measure function. Two series expansions for mutual information are proposed, and it is shown that most heuristic criteria suggested in the literature are truncated approximations of these expansions. It is well-known that searching the whole subset space is an NP-hard problem. Here, instead of the conventional sequential search algorithms, we suggest a parallel search strategy based on semidefinite programming (SDP) that can search through the subset space in polynomial time. By exploiting the similarities between the proposed algorithm and an instance of the maximum-cut problem in graph theory, the approximation ratio of this algorithm is derived and is compared with the approximation ratio of the backward elimination method. The experiments show that it can be misleading to judge the quality of a measure solely based on the classification accuracy, without taking the effect of the non-optimum search strategy into account.
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.
Skew-adjacency matrices of graphs
Cavers, M.; Cioaba, S.M.; Fallat, S.; Gregory, D.A.; Haemers, W.H.; Kirkland, S.J.; McDonald, J.J.; Tsatsomeros, M.
2012-01-01
The spectra of the skew-adjacency matrices of a graph are considered as a possible way to distinguish adjacency cospectral graphs. This leads to the following topics: graphs whose skew-adjacency matrices are all cospectral; relations between the matchings polynomial of a graph and the characteristic
Exact Inverse Matrices of Fermat and Mersenne Circulant Matrix
Directory of Open Access Journals (Sweden)
Yanpeng Zheng
2015-01-01
Full Text Available The well known circulant matrices are applied to solve networked systems. In this paper, circulant and left circulant matrices with the Fermat and Mersenne numbers are considered. The nonsingularity of these special matrices is discussed. Meanwhile, the exact determinants and inverse matrices of these special matrices are presented.
Enhancing Understanding of Transformation Matrices
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…
Positive semidefinite integrated covariance estimation, factorizations and asynchronicity
DEFF Research Database (Denmark)
Boudt, Kris; Laurent, Sébastien; Lunde, Asger
2017-01-01
An estimator of the ex-post covariation of log-prices under asynchronicity and microstructure noise is proposed. It uses the Cholesky factorization of the covariance matrix in order to exploit the heterogeneity in trading intensities to estimate the different parameters sequentially with as many...
Positive Semidefinite Integrated Covariance Estimation, Factorizations and Asynchronicity
DEFF Research Database (Denmark)
Boudt, Kris; Laurent, Sébastien; Lunde, Asger
An estimator of the ex-post covariation of log-prices under asynchronicity and microstructure noise is proposed. It uses the Cholesky factorization on the correlation matrix in order to exploit the heterogeneity in trading intensity to estimate the different parameters sequentially with as many...
Group inverses of M-matrices and their applications
Kirkland, Stephen J
2013-01-01
Group inverses for singular M-matrices are useful tools not only in matrix analysis, but also in the analysis of stochastic processes, graph theory, electrical networks, and demographic models. Group Inverses of M-Matrices and Their Applications highlights the importance and utility of the group inverses of M-matrices in several application areas. After introducing sample problems associated with Leslie matrices and stochastic matrices, the authors develop the basic algebraic and spectral properties of the group inverse of a general matrix. They then derive formulas for derivatives of matrix f
Inference for High-dimensional Differential Correlation Matrices.
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.
Contributions to Large Covariance and Inverse Covariance Matrices Estimation
Kang, Xiaoning
2016-01-01
Estimation of covariance matrix and its inverse is of great importance in multivariate statistics with broad applications such as dimension reduction, portfolio optimization, linear discriminant analysis and gene expression analysis. However, accurate estimation of covariance or inverse covariance matrices is challenging due to the positive definiteness constraint and large number of parameters, especially in the high-dimensional cases. In this thesis, I develop several approaches for estimat...
Phenomenological mass matrices with a democratic warp
International Nuclear Information System (INIS)
Kleppe, A.
2018-01-01
Taking into account all available data on the mass sector, we obtain unitary rotation matrices that diagonalize the quark matrices by using a specific parametrization of the Cabibbo-Kobayashi-Maskawa mixing matrix. In this way, we find mass matrices for the up- and down-quark sectors of a specific, symmetric form, with traces of a democratic texture.
Diagonalization of the mass matrices
International Nuclear Information System (INIS)
Rhee, S.S.
1984-01-01
It is possible to make 20 types of 3x3 mass matrices which are hermitian. We have obtained unitary matrices which could diagonalize each mass matrix. Since the three elements of mass matrix can be expressed in terms of the three eigenvalues, msub(i), we can also express the unitary matrix in terms of msub(i). (Author)
The construction of factorized S-matrices
International Nuclear Information System (INIS)
Chudnovsky, D.V.
1981-01-01
We study the relationships between factorized S-matrices given as representations of the Zamolodchikov algebra and exactly solvable models constructed using the Baxter method. Several new examples of symmetric and non-symmetric factorized S-matrices are proposed. (orig.)
Matrices in Engineering Problems
Tobias, Marvin
2011-01-01
This book is intended as an undergraduate text introducing matrix methods as they relate to engineering problems. It begins with the fundamentals of mathematics of matrices and determinants. Matrix inversion is discussed, with an introduction of the well known reduction methods. Equation sets are viewed as vector transformations, and the conditions of their solvability are explored. Orthogonal matrices are introduced with examples showing application to many problems requiring three dimensional thinking. The angular velocity matrix is shown to emerge from the differentiation of the 3-D orthogo
A Brief Historical Introduction to Matrices and Their Applications
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…
Hypercyclic Abelian Semigroups of Matrices on Cn
International Nuclear Information System (INIS)
Ayadi, Adlene; Marzougui, Habib
2010-07-01
We give a complete characterization of existence of dense orbit for any abelian semigroup of matrices on C n . For finitely generated semigroups, this characterization is explicit and is used to determine the minimal number of matrices in normal form over C which forms a hypercyclic abelian semigroup on C n . In particular, we show that no abelian semigroup generated by n matrices on C n can be hypercyclic. (author)
Generalized Perron--Frobenius Theorem for Nonsquare Matrices
Avin, Chen; Borokhovich, Michael; Haddad, Yoram; Kantor, Erez; Lotker, Zvi; Parter, Merav; Peleg, David
2013-01-01
The celebrated Perron--Frobenius (PF) theorem is stated for irreducible nonnegative square matrices, and provides a simple characterization of their eigenvectors and eigenvalues. The importance of this theorem stems from the fact that eigenvalue problems on such matrices arise in many fields of science and engineering, including dynamical systems theory, economics, statistics and optimization. However, many real-life scenarios give rise to nonsquare matrices. A natural question is whether the...
Krylov, Piotr
2017-01-01
This monograph is a comprehensive account of formal matrices, examining homological properties of modules over formal matrix rings and summarising the interplay between Morita contexts and K theory. While various special types of formal matrix rings have been studied for a long time from several points of view and appear in various textbooks, for instance to examine equivalences of module categories and to illustrate rings with one-sided non-symmetric properties, this particular class of rings has, so far, not been treated systematically. Exploring formal matrix rings of order 2 and introducing the notion of the determinant of a formal matrix over a commutative ring, this monograph further covers the Grothendieck and Whitehead groups of rings. Graduate students and researchers interested in ring theory, module theory and operator algebras will find this book particularly valuable. Containing numerous examples, Formal Matrices is a largely self-contained and accessible introduction to the topic, assuming a sol...
ESTIMATION OF FUNCTIONALS OF SPARSE COVARIANCE MATRICES.
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.
Parallel decompositions of Mueller matrices and polarimetric subtraction
Directory of Open Access Journals (Sweden)
Gil J.J.
2010-06-01
Full Text Available From a general formulation of the physically realizable parallel decompositions of the Mueller matrix M of a given depolarizing system, a procedure for determining the set of pure Mueller matrices susceptible to be subtracted from M is presented. This procedure provides a way to check if a given pure Mueller matrix N can be subtracted from M or not. If this check is positive, the value of the relative cross section of the subtracted component is also determined.
Bounding Averages Rigorously Using Semidefinite Programming: Mean Moments of the Lorenz System
Goluskin, David
2018-04-01
We describe methods for proving bounds on infinite-time averages in differential dynamical systems. The methods rely on the construction of nonnegative polynomials with certain properties, similarly to the way nonlinear stability can be proved using Lyapunov functions. Nonnegativity is enforced by requiring the polynomials to be sums of squares, a condition which is then formulated as a semidefinite program (SDP) that can be solved computationally. Although such computations are subject to numerical error, we demonstrate two ways to obtain rigorous results: using interval arithmetic to control the error of an approximate SDP solution, and finding exact analytical solutions to relatively small SDPs. Previous formulations are extended to allow for bounds depending analytically on parametric variables. These methods are illustrated using the Lorenz equations, a system with three state variables ( x, y, z) and three parameters (β ,σ ,r). Bounds are reported for infinite-time averages of all eighteen moments x^ly^mz^n up to quartic degree that are symmetric under (x,y)\\mapsto (-x,-y). These bounds apply to all solutions regardless of stability, including chaotic trajectories, periodic orbits, and equilibrium points. The analytical approach yields two novel bounds that are sharp: the mean of z^3 can be no larger than its value of (r-1)^3 at the nonzero equilibria, and the mean of xy^3 must be nonnegative. The interval arithmetic approach is applied at the standard chaotic parameters to bound eleven average moments that all appear to be maximized on the shortest periodic orbit. Our best upper bound on each such average exceeds its value on the maximizing orbit by less than 1%. Many bounds reported here are much tighter than would be possible without computer assistance.
THE ALGORITHM AND PROGRAM OF M-MATRICES SEARCH AND STUDY
Directory of Open Access Journals (Sweden)
Y. N. Balonin
2013-05-01
Full Text Available The algorithm and software for search and study of orthogonal bases matrices – minimax matrices (M-matrix are considered. The algorithm scheme is shown, comments on calculation blocks are given, and interface of the MMatrix software system developed with participation of the authors is explained. The results of the universal algorithm work are presented as Hadamard matrices, Belevitch matrices (C-matrices, conference matrices and matrices of even and odd orders complementary and closely related to those ones by their properties, in particular, the matrix of the 22-th order for which there is no C-matrix. Examples of portraits for alternative matrices of the 255-th and the 257-th orders are given corresponding to the sequences of Mersenne and Fermat numbers. A new way to get Hadamard matrices is explained, different from the previously known procedures based on iterative processes and calculations of Lagrange symbols, with theoretical and practical meaning.
The modified Gauss diagonalization of polynomial matrices
International Nuclear Information System (INIS)
Saeed, K.
1982-10-01
The Gauss algorithm for diagonalization of constant matrices is modified for application to polynomial matrices. Due to this modification the diagonal elements become pure polynomials rather than rational functions. (author)
Quantum Hilbert matrices and orthogonal polynomials
DEFF Research Database (Denmark)
Andersen, Jørgen Ellegaard; Berg, Christian
2009-01-01
Using the notion of quantum integers associated with a complex number q≠0 , we define the quantum Hilbert matrix and various extensions. They are Hankel matrices corresponding to certain little q -Jacobi polynomials when |q|<1 , and for the special value they are closely related to Hankel matrice...
Discrete canonical transforms that are Hadamard matrices
International Nuclear Information System (INIS)
Healy, John J; Wolf, Kurt Bernardo
2011-01-01
The group Sp(2,R) of symplectic linear canonical transformations has an integral kernel which has quadratic and linear phases, and which is realized by the geometric paraxial optical model. The discrete counterpart of this model is a finite Hamiltonian system that acts on N-point signals through N x N matrices whose elements also have a constant absolute value, although they do not form a representation of that group. Those matrices that are also unitary are Hadamard matrices. We investigate the manifolds of these N x N matrices under the Sp(2,R) equivalence imposed by the model, and find them to be on two-sided cosets. By means of an algorithm we determine representatives that lead to collections of mutually unbiased bases.
Abel-grassmann's groupoids of modulo matrices
International Nuclear Information System (INIS)
Javaid, Q.; Awan, M.D.; Naqvi, S.H.A.
2016-01-01
The binary operation of usual addition is associative in all matrices over R. However, a binary operation of addition in matrices over Z/sub n/ of a nonassociative structures of AG-groupoids and AG-groups are defined and investigated here. It is shown that both these structures exist for every integer n >≥ 3. Various properties of these structures are explored like: (i) Every AG-groupoid of matrices over Z/sub n/ is transitively commutative AG-groupoid and is a cancellative AG-groupoid if n is prime. (ii) Every AG-groupoid of matrices over Z/sub n/ of Type-II is a T/sup 3/-AG-groupoid. (iii) An AG-groupoid of matrices over Z/sub n/ ; G /sub nAG/(t,u), is an AG-band, if t+u=1(mod n). (author)
Free probability and random matrices
Mingo, James A
2017-01-01
This volume opens the world of free probability to a wide variety of readers. From its roots in the theory of operator algebras, free probability has intertwined with non-crossing partitions, random matrices, applications in wireless communications, representation theory of large groups, quantum groups, the invariant subspace problem, large deviations, subfactors, and beyond. This book puts a special emphasis on the relation of free probability to random matrices, but also touches upon the operator algebraic, combinatorial, and analytic aspects of the theory. The book serves as a combination textbook/research monograph, with self-contained chapters, exercises scattered throughout the text, and coverage of important ongoing progress of the theory. It will appeal to graduate students and all mathematicians interested in random matrices and free probability from the point of view of operator algebras, combinatorics, analytic functions, or applications in engineering and statistical physics.
Czech Academy of Sciences Publication Activity Database
Liesen, J.; Tichý, Petr
2005-01-01
Roč. 20, - (2005), s. 180-197 ISSN 1068-9613 R&D Projects: GA AV ČR(CZ) KJB1030306 Institutional research plan: CEZ:AV0Z10300504 Keywords : Krylov subspace methods * conjugate gradient method * minimal residual method * convergence analysis * tridiagonal Toeplitz matrices * Poisson equation Subject RIV: BA - General Mathematics Impact factor: 0.608, year: 2005 http://etna.mcs.kent.edu/volumes/2001-2010/vol20/abstract.php?vol=20&pages=180-197
Quantum matrices in two dimensions
International Nuclear Information System (INIS)
Ewen, H.; Ogievetsky, O.; Wess, J.
1991-01-01
Quantum matrices in two-dimensions, admitting left and right quantum spaces, are classified: they fall into two families, the 2-parametric family GL p,q (2) and a 1-parametric family GL α J (2). Phenomena previously found for GL p,q (2) hold in this general situation: (a) powers of quantum matrices are again quantum and (b) entries of the logarithm of a two-dimensional quantum matrix form a Lie algebra. (orig.)
Indian Academy of Sciences (India)
IAS Admin
harmonic analysis and complex analysis, in ... gebra describes not only the study of linear transforma- tions and .... special case of the Jordan canonical form of matrices. ..... Richard Bronson, Schaum's Outline Series Theory And Problems Of.
Virial expansion for almost diagonal random matrices
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\
Random matrices and random difference equations
International Nuclear Information System (INIS)
Uppuluri, V.R.R.
1975-01-01
Mathematical models leading to products of random matrices and random difference equations are discussed. A one-compartment model with random behavior is introduced, and it is shown how the average concentration in the discrete time model converges to the exponential function. This is of relevance to understanding how radioactivity gets trapped in bone structure in blood--bone systems. The ideas are then generalized to two-compartment models and mammillary systems, where products of random matrices appear in a natural way. The appearance of products of random matrices in applications in demography and control theory is considered. Then random sequences motivated from the following problems are studied: constant pulsing and random decay models, random pulsing and constant decay models, and random pulsing and random decay models
Quantum Entanglement and Reduced Density Matrices
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.
Malware analysis using visualized image matrices.
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.
Malware Analysis Using Visualized Image Matrices
Directory of Open Access Journals (Sweden)
KyoungSoo Han
2014-01-01
Full Text Available 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.
Energy Technology Data Exchange (ETDEWEB)
Zepon, Karine Modolon [CIMJECT, Departamento de Engenharia Mecânica, Universidade Federal de Santa Catarina, 88040-900 Florianópolis, SC (Brazil); TECFARMA, Universidade do Sul de Santa Catarina, 88704-900 Tubarão, SC (Brazil); Petronilho, Fabricia [FICEXP, Universidade do Sul de Santa Catarina, 88704-900 Tubarão, SC (Brazil); Soldi, Valdir [POLIMAT, Universidade Federal de Santa Catarina, 88040-900 Florianópolis, SC (Brazil); Salmoria, Gean Vitor [CIMJECT, Departamento de Engenharia Mecânica, Universidade Federal de Santa Catarina, 88040-900 Florianópolis, SC (Brazil); Kanis, Luiz Alberto, E-mail: luiz.kanis@unisul.br [TECFARMA, Universidade do Sul de Santa Catarina, 88704-900 Tubarão, SC (Brazil)
2014-11-01
The production and evaluation of cornstarch/cellulose acetate/silver sulfadiazine extrudate matrices are reported herein. The matrices were melt extruded under nine different conditions, altering the temperature and the screw speed values. The surface morphology of the matrices was examined by scanning electron microscopy. The micrographs revealed the presence of non-melted silver sulfadiazine microparticles in the matrices extruded at lower temperature and screw speed values. The thermal properties were evaluated and the results for both the biopolymer and the drug indicated no thermal degradation during the melt extrusion process. The differential scanning analysis of the extrudate matrices showed a shift to lower temperatures for the silver sulfadiazine melting point compared with the non-extruded drug. The starch/cellulose acetate matrices containing silver sulfadiazine demonstrated significant inhibition of the growth of Pseudomonas aeruginosa and Staphylococcus aureus. In vivo inflammatory response tests showed that the extrudate matrices, with or without silver sulfadiazine, did not trigger chronic inflammatory processes. - Highlights: • Melt extruded bio-based matrices containing silver sulfadiazine was produced. • The silver sulfadiazine is stable during melt-extrusion. • The extrudate matrices shown bacterial growth inhibition. • The matrices obtained have potential to development wound healing membranes.
Polynomial sequences generated by infinite Hessenberg matrices
Directory of Open Access Journals (Sweden)
Verde-Star Luis
2017-01-01
Full Text Available We show that an infinite lower Hessenberg matrix generates polynomial sequences that correspond to the rows of infinite lower triangular invertible matrices. Orthogonal polynomial sequences are obtained when the Hessenberg matrix is tridiagonal. We study properties of the polynomial sequences and their corresponding matrices which are related to recurrence relations, companion matrices, matrix similarity, construction algorithms, and generating functions. When the Hessenberg matrix is also Toeplitz the polynomial sequences turn out to be of interpolatory type and we obtain additional results. For example, we show that every nonderogative finite square matrix is similar to a unique Toeplitz-Hessenberg matrix.
Radiation-induced transformations of isolated organic molecules in solid rare gas matrices
International Nuclear Information System (INIS)
Feldman, V.I.
1998-01-01
Complete text of publication follows. The studies of radiation-chemical behaviour of isolated organic molecules in rigid inert media are of considerable interest for radiation chemistry and general structural chemistry. Previous efforts were limited to the ESR studies of radicals resulting from some small hydrocarbon molecules in frozen rare gas solutions. Recently, we developed an approach to the radiation chemistry of isolated organic molecules using classic matrix isolation procedure for sample preparation and a combination of ESR and IR spectroscopy for characterization of paramagnetic and diamagnetic species resulting form electron irradiation or organic molecules in solid rare gas matrices at 10-15 K. The results obtained reveal high efficiency of energy transfer from rare gas matrix to organic molecules. The total radiation-chemical yields of degradation of organic molecules in argon and xenon matrices were measured directly by IR spectroscopy. The studies of the effect of electron scavengers on the radiolysis of organic molecules in solid rare gases show that the main primary process is positive hole transfer from matrix to additive molecule. ESR spectra of a number of radical cations (alkanes, ethers, arenes) were first characterized in a low-disturbing environment. It was found that the electronic characteristics (IP, polarizability) of the matrix used had crucial effect on trapping and degradation of primary organic radical cations. Using matrices with various IP provides an unique possibility to examine the chemical meaning of excess energy resulting from exothermic positive hole transfer, that is, to follow the fate of excited cations in condensed phase
International Nuclear Information System (INIS)
Bombardelli, Diego
2016-01-01
In these notes we review the S-matrix theory in (1+1)-dimensional integrable models, focusing mainly on the relativistic case. Once the main definitions and physical properties are introduced, we discuss the factorization of scattering processes due to integrability. We then focus on the analytic properties of the two-particle scattering amplitude and illustrate the derivation of the S-matrices for all the possible bound states using the so-called bootstrap principle. General algebraic structures underlying the S-matrix theory and its relation with the form factors axioms are briefly mentioned. Finally, we discuss the S-matrices of sine-Gordon and SU (2), SU (3) chiral Gross–Neveu models. (topical review)
Arikan and Alamouti matrices based on fast block-wise inverse Jacket transform
Lee, Moon Ho; Khan, Md Hashem Ali; Kim, Kyeong Jin
2013-12-01
Recently, Lee and Hou (IEEE Signal Process Lett 13: 461-464, 2006) proposed one-dimensional and two-dimensional fast algorithms for block-wise inverse Jacket transforms (BIJTs). Their BIJTs are not real inverse Jacket transforms from mathematical point of view because their inverses do not satisfy the usual condition, i.e., the multiplication of a matrix with its inverse matrix is not equal to the identity matrix. Therefore, we mathematically propose a fast block-wise inverse Jacket transform of orders N = 2 k , 3 k , 5 k , and 6 k , where k is a positive integer. Based on the Kronecker product of the successive lower order Jacket matrices and the basis matrix, the fast algorithms for realizing these transforms are obtained. Due to the simple inverse and fast algorithms of Arikan polar binary and Alamouti multiple-input multiple-output (MIMO) non-binary matrices, which are obtained from BIJTs, they can be applied in areas such as 3GPP physical layer for ultra mobile broadband permutation matrices design, first-order q-ary Reed-Muller code design, diagonal channel design, diagonal subchannel decompose for interference alignment, and 4G MIMO long-term evolution Alamouti precoding design.
Matrices Aléatoires Tri-diagonales et Par Blocs.
MEKKI, Slimane
2014-01-01
Dans ce mémoire l'étude porte sur la densité de matrice aléatoire, les densités des valeurs propres d'une matrice pour les trois ensembles G.O.E, G.U.E, G.S.E. Après nous avons explicité les formules des densités de valeurs propres des matrices tri-diagonales dans les cas HERMITE et LAGUERRE Des simulations sur les constantes de normalisations pour les densités des matrices aléatoires ou des valeurs propres sont présentées.
Hierarchical quark mass matrices
International Nuclear Information System (INIS)
Rasin, A.
1998-02-01
I define a set of conditions that the most general hierarchical Yukawa mass matrices have to satisfy so that the leading rotations in the diagonalization matrix are a pair of (2,3) and (1,2) rotations. In addition to Fritzsch structures, examples of such hierarchical structures include also matrices with (1,3) elements of the same order or even much larger than the (1,2) elements. Such matrices can be obtained in the framework of a flavor theory. To leading order, the values of the angle in the (2,3) plane (s 23 ) and the angle in the (1,2) plane (s 12 ) do not depend on the order in which they are taken when diagonalizing. We find that any of the Cabbibo-Kobayashi-Maskawa matrix parametrizations that consist of at least one (1,2) and one (2,3) rotation may be suitable. In the particular case when the s 13 diagonalization angles are sufficiently small compared to the product s 12 s 23 , two special CKM parametrizations emerge: the R 12 R 23 R 12 parametrization follows with s 23 taken before the s 12 rotation, and vice versa for the R 23 R 12 R 23 parametrization. (author)
Laminin active peptide/agarose matrices as multifunctional biomaterials for tissue engineering.
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.
Accelerating Matrix-Vector Multiplication on Hierarchical Matrices Using Graphical Processing Units
Boukaram, W.
2015-03-25
Large dense matrices arise from the discretization of many physical phenomena in computational sciences. In statistics very large dense covariance matrices are used for describing random fields and processes. One can, for instance, describe distribution of dust particles in the atmosphere, concentration of mineral resources in the earth\\'s crust or uncertain permeability coefficient in reservoir modeling. When the problem size grows, storing and computing with the full dense matrix becomes prohibitively expensive both in terms of computational complexity and physical memory requirements. Fortunately, these matrices can often be approximated by a class of data sparse matrices called hierarchical matrices (H-matrices) where various sub-blocks of the matrix are approximated by low rank matrices. These matrices can be stored in memory that grows linearly with the problem size. In addition, arithmetic operations on these H-matrices, such as matrix-vector multiplication, can be completed in almost linear time. Originally the H-matrix technique was developed for the approximation of stiffness matrices coming from partial differential and integral equations. Parallelizing these arithmetic operations on the GPU has been the focus of this work and we will present work done on the matrix vector operation on the GPU using the KSPARSE library.
The Antitriangular Factorization of Saddle Point Matrices
Pestana, J.
2014-01-01
Mastronardi and Van Dooren [SIAM J. Matrix Anal. Appl., 34 (2013), pp. 173-196] recently introduced the block antitriangular ("Batman") decomposition for symmetric indefinite matrices. Here we show the simplification of this factorization for saddle point matrices and demonstrate how it represents the common nullspace method. We show that rank-1 updates to the saddle point matrix can be easily incorporated into the factorization and give bounds on the eigenvalues of matrices important in saddle point theory. We show the relation of this factorization to constraint preconditioning and how it transforms but preserves the structure of block diagonal and block triangular preconditioners. © 2014 Society for Industrial and Applied Mathematics.
Attitude and position tracking
CSIR Research Space (South Africa)
Candy, LP
2011-01-01
Full Text Available Several applications require the tracking of attitude and position of a body based on velocity data. It is tempting to use direction cosine matrices (DCM), for example, to track attitude based on angular velocity data, and to integrate the linear...
International Nuclear Information System (INIS)
Gene Golub; Kwok Ko
2009-01-01
The solutions of sparse eigenvalue problems and linear systems constitute one of the key computational kernels in the discretization of partial differential equations for the modeling of linear accelerators. The computational challenges faced by existing techniques for solving those sparse eigenvalue problems and linear systems call for continuing research to improve on the algorithms so that ever increasing problem size as required by the physics application can be tackled. Under the support of this award, the filter algorithm for solving large sparse eigenvalue problems was developed at Stanford to address the computational difficulties in the previous methods with the goal to enable accelerator simulations on then the world largest unclassified supercomputer at NERSC for this class of problems. Specifically, a new method, the Hemitian skew-Hemitian splitting method, was proposed and researched as an improved method for solving linear systems with non-Hermitian positive definite and semidefinite matrices.
Operational Choices for Risk Aggregation in Insurance: PSDization and SCR Sensitivity
Directory of Open Access Journals (Sweden)
Xavier Milhaud
2018-04-01
Full Text Available This work addresses crucial questions about the robustness of the PSDization process for applications in insurance. PSDization refers to the process that forces a matrix to become positive semidefinite. For companies using copulas to aggregate risks in their internal model, PSDization occurs when working with correlation matrices to compute the Solvency Capital Requirement (SCR. We examine how classical operational choices concerning the modelling of risk dependence impacts the SCR during PSDization. These operations refer to the permutations of risks (or business lines in the correlation matrix, the addition of a new risk, and the introduction of confidence weights given to the correlation coefficients. The use of genetic algorithms shows that theoretically neutral transformations of the correlation matrix can surprisingly lead to significant sensitivities of the SCR (up to 6%. This highlights the need for a very strong internal control around the PSDization step.
On Skew Circulant Type Matrices Involving Any Continuous Fibonacci Numbers
Directory of Open Access Journals (Sweden)
Zhaolin Jiang
2014-01-01
inverse matrices of them by constructing the transformation matrices. Furthermore, the maximum column sum matrix norm, the spectral norm, the Euclidean (or Frobenius norm, and the maximum row sum matrix norm and bounds for the spread of these matrices are given, respectively.
Immanant Conversion on Symmetric Matrices
Directory of Open Access Journals (Sweden)
Purificação Coelho M.
2014-01-01
Full Text Available Letr Σn(C denote the space of all n χ n symmetric matrices over the complex field C. The main objective of this paper is to prove that the maps Φ : Σn(C -> Σn (C satisfying for any fixed irre- ducible characters X, X' -SC the condition dx(A +aB = dχ·(Φ(Α + αΦ(Β for all matrices A,В ε Σ„(С and all scalars a ε C are automatically linear and bijective. As a corollary of the above result we characterize all such maps Φ acting on ΣИ(С.
The 'golden' matrices and a new kind of cryptography
International Nuclear Information System (INIS)
Stakhov, A.P.
2007-01-01
We consider a new class of square matrices called the 'golden' matrices. They are a generalization of the classical Fibonacci Q-matrix for continuous domain. The 'golden' matrices can be used for creation of a new kind of cryptography called the 'golden' cryptography. The method is very fast and simple for technical realization and can be used for cryptographic protection of digital signals (telecommunication and measurement systems)
Advanced incomplete factorization algorithms for Stiltijes matrices
Energy Technology Data Exchange (ETDEWEB)
Il`in, V.P. [Siberian Division RAS, Novosibirsk (Russian Federation)
1996-12-31
The modern numerical methods for solving the linear algebraic systems Au = f with high order sparse matrices A, which arise in grid approximations of multidimensional boundary value problems, are based mainly on accelerated iterative processes with easily invertible preconditioning matrices presented in the form of approximate (incomplete) factorization of the original matrix A. We consider some recent algorithmic approaches, theoretical foundations, experimental data and open questions for incomplete factorization of Stiltijes matrices which are {open_quotes}the best{close_quotes} ones in the sense that they have the most advanced results. Special attention is given to solving the elliptic differential equations with strongly variable coefficients, singular perturbated diffusion-convection and parabolic equations.
Liu, Ning; Ouyang, Anli; Li, Yan; Yang, Shang-Tian
2013-01-01
The clinical use of pluripotent stem cell (PSC)-derived neural cells requires an efficient differentiation process for mass production in a bioreactor. Toward this goal, neural differentiation of murine embryonic stem cells (ESCs) in three-dimensional (3D) polyethylene terephthalate microfibrous matrices was investigated in this study. To streamline the process and provide a platform for process integration, the neural differentiation of ESCs was induced with astrocyte-conditioned medium without the formation of embryoid bodies, starting from undifferentiated ESC aggregates expanded in a suspension bioreactor. The 3D neural differentiation was able to generate a complex neural network in the matrices. When compared to 2D differentiation, 3D differentiation in microfibrous matrices resulted in a higher percentage of nestin-positive cells (68% vs. 54%) and upregulated gene expressions of nestin, Nurr1, and tyrosine hydroxylase. High purity of neural differentiation in 3D microfibrous matrix was also demonstrated in a spinner bioreactor with 74% nestin + cells. This study demonstrated the feasibility of a scalable process based on 3D differentiation in microfibrous matrices for the production of ESC-derived neural cells. © 2013 American Institute of Chemical Engineers.
On the Eigenvalues and Eigenvectors of Block Triangular Preconditioned Block Matrices
Pestana, Jennifer
2014-01-01
Block lower triangular matrices and block upper triangular matrices are popular preconditioners for 2×2 block matrices. In this note we show that a block lower triangular preconditioner gives the same spectrum as a block upper triangular preconditioner and that the eigenvectors of the two preconditioned matrices are related. © 2014 Society for Industrial and Applied Mathematics.
On Investigating GMRES Convergence using Unitary Matrices
Czech Academy of Sciences Publication Activity Database
Duintjer Tebbens, Jurjen; Meurant, G.; Sadok, H.; Strakoš, Z.
2014-01-01
Roč. 450, 1 June (2014), s. 83-107 ISSN 0024-3795 Grant - others:GA AV ČR(CZ) M100301201; GA MŠk(CZ) LL1202 Institutional support: RVO:67985807 Keywords : GMRES convergence * unitary matrices * unitary spectra * normal matrices * Krylov residual subspace * Schur parameters Subject RIV: BA - General Mathematics Impact factor: 0.939, year: 2014
Factorization of cp-rank-3 completely positive matrices
Czech Academy of Sciences Publication Activity Database
Brandts, J.; Křížek, Michal
2016-01-01
Roč. 66, č. 3 (2016), s. 955-970 ISSN 0011-4642 R&D Projects: GA ČR GA14-02067S Institutional support: RVO:67985840 Keywords : completely positive matrix * cp-rank * factorization Subject RIV: BA - General Mathematics Impact factor: 0.364, year: 2016 http://hdl.handle.net/10338.dmlcz/145882
CONVERGENCE OF POWERS OF CONTROLLABLE INTUITIONISTIC FUZZY MATRICES
Riyaz Ahmad Padder; P. Murugadas
2016-01-01
Convergences of powers of controllable intuitionistic fuzzy matrices have been stud¬ied. It is shown that they oscillate with period equal to 2, in general. Some equalities and sequences of inequalities about powers of controllable intuitionistic fuzzy matrices have been obtained.
Dielectric lattice gauge theory
International Nuclear Information System (INIS)
Mack, G.
1983-06-01
Dielectric lattice gauge theory models are introduced. They involve variables PHI(b)epsilong that are attached to the links b = (x+esub(μ),x) of the lattice and take their values in the linear space g which consists of real linear combinations of matrices in the gauge group G. The polar decomposition PHI(b)=U(b)osub(μ)(x) specifies an ordinary lattice gauge field U(b) and a kind of dielectric field epsilonsub(ij)proportionalosub(i)osub(j)sup(*)deltasub(ij). A gauge invariant positive semidefinite kinetic term for the PHI-field is found, and it is shown how to incorporate Wilson fermions in a way which preserves Osterwalder Schrader positivity. Theories with G = SU(2) and without matter fields are studied in some detail. It is proved that confinement holds, in the sense that Wilson loop expectation values show an area law decay, if the Euclidean action has certain qualitative features which imply that PHI = 0 (i.e. dielectric field identical 0) is the unique maximum of the action. (orig.)
Dielectric lattice gauge theory
International Nuclear Information System (INIS)
Mack, G.
1984-01-01
Dielectric lattice gauge theory models are introduced. They involve variables PHI(b)element ofG that are attached to the links b = (x+esub(μ), x) of the lattice and take their values in the linear space G which consists of real linear combinations of matrices in the gauge group G. The polar decomposition PHI(b)=U(b)sigmasub(μ)(x) specifies an ordinary lattice gauge field U(b) and a kind of dielectric field epsilonsub(ij)proportional sigmasub(i)sigmasub(j)sup(*)deltasub(ij). A gauge invariant positive semidefinite kinetic term for the PHI-field is found, and it is shown how to incorporate Wilson fermions in a way which preserves Osterwalder-Schrader positivity. Theories with G = SU(2) and without matter fields are studied in some detail. It is proved that confinement holds, in the sense that Wilson-loop expectation values show an area law decay, if the euclidean action has certain qualitative features which imply that PHI=0 (i.e. dielectric field identical 0) is the unique maximum of the action. (orig.)
Loop diagrams without γ matrices
International Nuclear Information System (INIS)
McKeon, D.G.C.; Rebhan, A.
1993-01-01
By using a quantum-mechanical path integral to compute matrix elements of the form left-angle x|exp(-iHt)|y right-angle, radiative corrections in quantum-field theory can be evaluated without encountering loop-momentum integrals. In this paper we demonstrate how Dirac γ matrices that occur in the proper-time ''Hamiltonian'' H lead to the introduction of a quantum-mechanical path integral corresponding to a superparticle analogous to one proposed recently by Fradkin and Gitman. Direct evaluation of this path integral circumvents many of the usual algebraic manipulations of γ matrices in the computation of quantum-field-theoretical Green's functions involving fermions
Power law deformation of Wishart–Laguerre ensembles of random matrices
International Nuclear Information System (INIS)
Akemann, Gernot; Vivo, Pierpaolo
2008-01-01
We introduce a one-parameter deformation of the Wishart–Laguerre or chiral ensembles of positive definite random matrices with Dyson index β = 1,2 and 4. Our generalized model has a fat-tailed distribution while preserving the invariance under orthogonal, unitary or symplectic transformations. The spectral properties are derived analytically for finite matrix size N × M for all three values of β, in terms of the orthogonal polynomials of the standard Wishart–Laguerre ensembles. For large N in a certain double-scaling limit we obtain a generalized Marčenko–Pastur distribution on the macroscopic scale, and a generalized Bessel law at the hard edge which is shown to be universal. Both macroscopic and microscopic correlations exhibit power law tails, where the microscopic limit depends on β and the difference M−N. In the limit where our parameter governing the power law goes to infinity we recover the correlations of the Wishart–Laguerre ensembles. To illustrate these findings, the generalized Marčenko–Pastur distribution is shown to be in very good agreement with empirical data from financial covariance matrices
Classification en référence à une matrice stochastique
Verdun , Stéphane; Cariou , Véronique; Qannari , El Mostafa
2009-01-01
International audience; Etant donné un tableau de données X portant sur un ensemble de n objets, et une matrice stochastique S qui peut être assimilée à une matrice de transition d'une chaîne de Markov, nous proposons une méthode de partitionnement consistant à appliquer la matrice S sur X de manière itérative jusqu'à convergence. Les classes formant la partition sont déterminées à partir des états stationnaires de la matrice stochastique. Cette matrice stochastique peut être issue d'une matr...
2014-04-01
materials, the affinity ligand would need identification , as well as chemistries that graft the affinity ligand onto the surface of magnetic...ACTIVE CAPTURE MATRICES FOR THE DETECTION/ IDENTIFICATION OF PHARMACEUTICALS...6 As shown in Figure 2.3-1a, the spectra exhibit similar baselines and the spectral peaks lineup . Under these circumstances, the spectral
Chain of matrices, loop equations and topological recursion
Orantin, Nicolas
2009-01-01
Random matrices are used in fields as different as the study of multi-orthogonal polynomials or the enumeration of discrete surfaces. Both of them are based on the study of a matrix integral. However, this term can be confusing since the definition of a matrix integral in these two applications is not the same. These two definitions, perturbative and non-perturbative, are discussed in this chapter as well as their relation. The so-called loop equations satisfied by integrals over random matrices coupled in chain is discussed as well as their recursive solution in the perturbative case when the matrices are Hermitean.
Theoretical Properties for Neural Networks with Weight Matrices of Low Displacement Rank
Zhao, Liang; Liao, Siyu; Wang, Yanzhi; Li, Zhe; Tang, Jian; Pan, Victor; Yuan, Bo
2017-01-01
Recently low displacement rank (LDR) matrices, or so-called structured matrices, have been proposed to compress large-scale neural networks. Empirical results have shown that neural networks with weight matrices of LDR matrices, referred as LDR neural networks, can achieve significant reduction in space and computational complexity while retaining high accuracy. We formally study LDR matrices in deep learning. First, we prove the universal approximation property of LDR neural networks with a ...
The Modern Origin of Matrices and Their Applications
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…
Flux Jacobian Matrices For Equilibrium Real Gases
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.
Almost commuting self-adjoint matrices: The real and self-dual cases
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.
Forecasting Covariance Matrices: A Mixed Frequency Approach
DEFF Research Database (Denmark)
Halbleib, Roxana; Voev, Valeri
This paper proposes a new method for forecasting covariance matrices of financial returns. The model mixes volatility forecasts from a dynamic model of daily realized volatilities estimated with high-frequency data with correlation forecasts based on daily data. This new approach allows for flexi......This paper proposes a new method for forecasting covariance matrices of financial returns. The model mixes volatility forecasts from a dynamic model of daily realized volatilities estimated with high-frequency data with correlation forecasts based on daily data. This new approach allows...... for flexible dependence patterns for volatilities and correlations, and can be applied to covariance matrices of large dimensions. The separate modeling of volatility and correlation forecasts considerably reduces the estimation and measurement error implied by the joint estimation and modeling of covariance...
Propositional matrices as alternative representation of truth values ...
African Journals Online (AJOL)
The paper considered the subject of representation of truth values in symbolic logic. An alternative representation was given based on the rows and columns properties of matrices, with the operations involving the logical connectives subjected to the laws of algebra of propositions. Matrices of various propositions detailing ...
Wishart and anti-Wishart random matrices
International Nuclear Information System (INIS)
Janik, Romuald A; Nowak, Maciej A
2003-01-01
We provide a compact exact representation for the distribution of the matrix elements of the Wishart-type random matrices A † A, for any finite number of rows and columns of A, without any large N approximations. In particular, we treat the case when the Wishart-type random matrix contains redundant, non-random information, which is a new result. This representation is of interest for a procedure for reconstructing the redundant information hidden in Wishart matrices, with potential applications to numerous models based on biological, social and artificial intelligence networks
Information geometry of density matrices and state estimation
International Nuclear Information System (INIS)
Brody, Dorje C
2011-01-01
Given a pure state vector |x) and a density matrix ρ-hat, the function p(x|ρ-hat)= defines a probability density on the space of pure states parameterised by density matrices. The associated Fisher-Rao information measure is used to define a unitary invariant Riemannian metric on the space of density matrices. An alternative derivation of the metric, based on square-root density matrices and trace norms, is provided. This is applied to the problem of quantum-state estimation. In the simplest case of unitary parameter estimation, new higher-order corrections to the uncertainty relations, applicable to general mixed states, are derived. (fast track communication)
Supercritical fluid extraction behaviour of polymer matrices
International Nuclear Information System (INIS)
Sujatha, K.; Kumar, R.; Sivaraman, N.; Srinivasan, T.G.; Vasudeva Rao, P.R.
2007-01-01
Organic compounds present in polymeric matrices such as neoprene, surgical gloves and PVC were co-extracted during the removal of uranium using supercritical fluid extraction (SFE) technique. Hence SFE studies of these matrices were carried out to establish the extracted species using HPLC, IR and mass spectrometry techniques. The initial study indicated that uranium present in the extract could be purified from the co-extracted organic species. (author)
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.
Directory of Open Access Journals (Sweden)
Shiao-Wen Tsai
2014-01-01
Full Text Available In this study, we utilized a mandrel rotating collector consisting of two parallel, electrically conductive pieces of tape to fabricate aligned electrospun polycaprolactone/gelatin (PG and carbon nanotube/polycaprolactone/gelatin (PGC nanofibrous matrices. Furthermore, we examined the biological performance of the PGC nanofibrous and film matrices using an in vitro culture of RT4-D6P2T rat Schwann cells. Using cell adhesion tests, we found that carbon nanotube inhibited Schwann cell attachment on PGC nanofibrous and film matrices. However, the proliferation rates of Schwann cells were higher when they were immobilized on PGC nanofibrous matrices compared to PGC film matrices. Using western blot analysis, we found that NRG1 and P0 protein expression levels were higher for cells immobilized on PGC nanofibrous matrices compared to PG nanofibrous matrices. However, the carbon nanotube inhibited NRG1 and P0 protein expression in cells immobilized on PGC film matrices. Moreover, the NRG1 and P0 protein expression levels were higher for cells immobilized on PGC nanofibrous matrices compared to PGC film matrices. We found that the matrix topography and composition influenced Schwann cell behavior.
Positive role of peptidoglycan breaks in lactococcal biofilm formation
Mercier, C; Durrieu, C; Briandet, R; Domakova, E; Tremblay, J; Buist, G; Kulakauskas, S
2002-01-01
Bacterial attachment to solid matrices depends on adhesive molecules present on the cell surface. Here we establish a positive correlation between peptidoglycan (PG) breaks, rather than particular molecules, and biofilm-forming capacity in the Gram-positive bacterium Lactococcus lactis. The L.
Nano-Fiber Reinforced Enhancements in Composite Polymer Matrices
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.
Meet and Join Matrices in the Poset of Exponential Divisors
Indian Academy of Sciences (India)
... exponential divisor ( G C E D ) and the least common exponential multiple ( L C E M ) do not always exist. In this paper we embed this poset in a lattice. As an application we study the G C E D and L C E M matrices, analogues of G C D and L C M matrices, which are both special cases of meet and join matrices on lattices.
Delta-sleep inducing peptide entrapment in the charged macroporous matrices
International Nuclear Information System (INIS)
Sukhanova, Tatiana V.; Artyukhov, Alexander A.; Gurevich, Yakov M.; Semenikhina, Marina A.; Prudchenko, Igor A.; Shtilman, Mikhail I.; Markvicheva, Elena A.
2014-01-01
Various biomolecules, for example proteins, peptides etc., entrapped in polymer matrices, impact interactions between matrix and cells, including stimulation of cell adhesion and proliferation. Delta-sleep inducing peptide (DSIP) possesses numerous beneficial properties, including its abilities in burn treatment and neuronal protection. DSIP entrapment in two macroporous polymer matrices based on copolymer of dimethylaminoethyl methacrylate and methylen-bis-acrylamide (Co-DMAEMA-MBAA) and copolymer of acrylic acid and methylen-bis-acrylamide (Co-AA-MBAA) has been studied. Quite 100% of DSIP has been entrapped into positively charged Co-DMAEMA-MBAA matrix, while the quantity of DSIP adsorbed on negatively charged Co-AA-MBAA was only 2–6%. DSIP release from Co-DMAEMA-MBAA was observed in saline solutions (0.9% NaCl and PBS) while there was no DSIP release in water or 25% ethanol, thus ionic strength was a reason of this process. - Graphical abstract: Delta-sleep inducing peptide possessing neuroprotective and wound healing properties was adsorbed on positively charged polymer matrix Co-DMAEMA-MBAA for tissue engineering. The peptide released from Co-DMAEMA-MBAA matrix in function of ionic strength of solution, pH decreasing stimulated peptide release from Co-DMAEMA-MBAA matrix for 3 h. This construction could be a base of new bioactive implants. - Highlights: • Macroporous positively charged Co-DMAEMA-MBAA matrix pore size was 20–35 μm. • DSIP was adsorbed on Co-DMAEMA-MBAA totally in 16 h. • Its release depends on ionic strength of solution (no release in 25% ethanol or water). • Co-DMAEMA-MBAA matrix swelling depends on pH and ionic strength of solution. • DSIP is destroyed in PBS and 0.9% NaCl in 5 days, but in water it was more stable
Delta-sleep inducing peptide entrapment in the charged macroporous matrices
Energy Technology Data Exchange (ETDEWEB)
Sukhanova, Tatiana V., E-mail: sukhanovat@mail.ru [Shemyakin and Ovchinnikov Institute of Bioorganic Chemistry, Laboratory of Cell Interactions, Miklukho-Maklaya st., 16/10 Moscow (Russian Federation); Artyukhov, Alexander A.; Gurevich, Yakov M.; Semenikhina, Marina A. [Mendeleyev University of Chemical Technology of Russia, Research and Teaching Center “Biomaterials”, Miusskaya sq., 9 Moscow (Russian Federation); Prudchenko, Igor A. [Shemyakin and Ovchinnikov Institute of Bioorganic Chemistry, Laboratory of Peptide Chemistry, Miklukho-Maklaya st., 16/10 Moscow (Russian Federation); Shtilman, Mikhail I. [Mendeleyev University of Chemical Technology of Russia, Research and Teaching Center “Biomaterials”, Miusskaya sq., 9 Moscow (Russian Federation); Markvicheva, Elena A. [Shemyakin and Ovchinnikov Institute of Bioorganic Chemistry, Laboratory Polymers for Biology, Miklukho-Maklaya st., 16/10 Moscow (Russian Federation)
2014-09-01
Various biomolecules, for example proteins, peptides etc., entrapped in polymer matrices, impact interactions between matrix and cells, including stimulation of cell adhesion and proliferation. Delta-sleep inducing peptide (DSIP) possesses numerous beneficial properties, including its abilities in burn treatment and neuronal protection. DSIP entrapment in two macroporous polymer matrices based on copolymer of dimethylaminoethyl methacrylate and methylen-bis-acrylamide (Co-DMAEMA-MBAA) and copolymer of acrylic acid and methylen-bis-acrylamide (Co-AA-MBAA) has been studied. Quite 100% of DSIP has been entrapped into positively charged Co-DMAEMA-MBAA matrix, while the quantity of DSIP adsorbed on negatively charged Co-AA-MBAA was only 2–6%. DSIP release from Co-DMAEMA-MBAA was observed in saline solutions (0.9% NaCl and PBS) while there was no DSIP release in water or 25% ethanol, thus ionic strength was a reason of this process. - Graphical abstract: Delta-sleep inducing peptide possessing neuroprotective and wound healing properties was adsorbed on positively charged polymer matrix Co-DMAEMA-MBAA for tissue engineering. The peptide released from Co-DMAEMA-MBAA matrix in function of ionic strength of solution, pH decreasing stimulated peptide release from Co-DMAEMA-MBAA matrix for 3 h. This construction could be a base of new bioactive implants. - Highlights: • Macroporous positively charged Co-DMAEMA-MBAA matrix pore size was 20–35 μm. • DSIP was adsorbed on Co-DMAEMA-MBAA totally in 16 h. • Its release depends on ionic strength of solution (no release in 25% ethanol or water). • Co-DMAEMA-MBAA matrix swelling depends on pH and ionic strength of solution. • DSIP is destroyed in PBS and 0.9% NaCl in 5 days, but in water it was more stable.
Universality Conjecture and Results for a Model of Several Coupled Positive-Definite Matrices
Bertola, Marco; Bothner, Thomas
2015-08-01
The paper contains two main parts: in the first part, we analyze the general case of matrices coupled in a chain subject to Cauchy interaction. Similarly to the Itzykson-Zuber interaction model, the eigenvalues of the Cauchy chain form a multi level determinantal point process. We first compute all correlations functions in terms of Cauchy biorthogonal polynomials and locate them as specific entries of a matrix valued solution of a Riemann-Hilbert problem. In the second part, we fix the external potentials as classical Laguerre weights. We then derive strong asymptotics for the Cauchy biorthogonal polynomials when the support of the equilibrium measures contains the origin. As a result, we obtain a new family of universality classes for multi-level random determinantal point fields, which include the Bessel universality for 1-level and the Meijer-G universality for 2-level. Our analysis uses the Deift-Zhou nonlinear steepest descent method and the explicit construction of a origin parametrix in terms of Meijer G-functions. The solution of the full Riemann-Hilbert problem is derived rigorously only for p = 3 but the general framework of the proof can be extended to the Cauchy chain of arbitrary length p.
MATXTST, Basic Operations for Covariance Matrices
International Nuclear Information System (INIS)
Geraldo, Luiz P.; Smith, Donald
1989-01-01
1 - Description of program or function: MATXTST and MATXTST1 perform the following operations for a covariance matrix: - test for singularity; - test for positive definiteness; - compute the inverse if the matrix is non-singular; - compute the determinant; - determine the number of positive, negative, and zero eigenvalues; - examine all possible 3 X 3 cross correlations within a sub-matrix corresponding to a leading principal minor which is non-positive definite. While the two programs utilize the same input, the calculational procedures employed are somewhat different and their functions are complementary. The available input options include: i) the full covariance matrix, ii) the basic variables plus the relative covariance matrix, or iii) uncertainties in the basic variables plus the correlation matrix. 2 - Method of solution: MATXTST employs LINPACK subroutines SPOFA and SPODI to test for positive definiteness and to perform further optional calculations. Subroutine SPOFA factors a symmetric matrix M using the Cholesky algorithm to determine the elements of a matrix R which satisfies the relation M=R'R, where R' is the transposed matrix of R. Each leading principal minor of M is tested until the first one is found which is not positive definite. MATXTST1 uses LINPACK subroutines SSICO, SSIFA, and SSIDI to estimate whether the matrix is near to singularity or not (SSICO), and to perform the matrix diagonalization process (SSIFA). The algorithm used in SSIFA is generalization of the Method of Lagrange Reduction. SSIDI is used to compute the determinant and inertia of the matrix. 3 - Restrictions on the complexity of the problem: Matrices of sizes up to 50 X 50 elements can be treated by present versions of the programs
Guo, Wei-Li; Huang, De-Shuang
2017-08-22
Transcription factors (TFs) are DNA-binding proteins that have a central role in regulating gene expression. Identification of DNA-binding sites of TFs is a key task in understanding transcriptional regulation, cellular processes and disease. Chromatin immunoprecipitation followed by high-throughput sequencing (ChIP-seq) enables genome-wide identification of in vivo TF binding sites. However, it is still difficult to map every TF in every cell line owing to cost and biological material availability, which poses an enormous obstacle for integrated analysis of gene regulation. To address this problem, we propose a novel computational approach, TFBSImpute, for predicting additional TF binding profiles by leveraging information from available ChIP-seq TF binding data. TFBSImpute fuses the dataset to a 3-mode tensor and imputes missing TF binding signals via simultaneous completion of multiple TF binding matrices with positional consistency. We show that signals predicted by our method achieve overall similarity with experimental data and that TFBSImpute significantly outperforms baseline approaches, by assessing the performance of imputation methods against observed ChIP-seq TF binding profiles. Besides, motif analysis shows that TFBSImpute preforms better in capturing binding motifs enriched in observed data compared with baselines, indicating that the higher performance of TFBSImpute is not simply due to averaging related samples. We anticipate that our approach will constitute a useful complement to experimental mapping of TF binding, which is beneficial for further study of regulation mechanisms and disease.
Joint Estimation of Multiple Precision Matrices with Common Structures.
Lee, Wonyul; Liu, Yufeng
Estimation of inverse covariance matrices, known as precision matrices, is important in various areas of statistical analysis. In this article, we consider estimation of multiple precision matrices sharing some common structures. In this setting, estimating each precision matrix separately can be suboptimal as it ignores potential common structures. This article proposes a new approach to parameterize each precision matrix as a sum of common and unique components and estimate multiple precision matrices in a constrained l 1 minimization framework. We establish both estimation and selection consistency of the proposed estimator in the high dimensional setting. The proposed estimator achieves a faster convergence rate for the common structure in certain cases. Our numerical examples demonstrate that our new estimator can perform better than several existing methods in terms of the entropy loss and Frobenius loss. An application to a glioblastoma cancer data set reveals some interesting gene networks across multiple cancer subtypes.
Stable Blind Deconvolution over the Reals from Additional Autocorrelations
Walk, Philipp
2017-10-22
Recently the one-dimensional time-discrete blind deconvolution problem was shown to be solvable uniquely, up to a global phase, by a semi-definite program for almost any signal, provided its autocorrelation is known. We will show in this work that under a sufficient zero separation of the corresponding signal in the $z-$domain, a stable reconstruction against additive noise is possible. Moreover, the stability constant depends on the signal dimension and on the signals magnitude of the first and last coefficients. We give an analytical expression for this constant by using spectral bounds of Vandermonde matrices.
Asymptotics of eigenvalues and eigenvectors of Toeplitz matrices
Böttcher, A.; Bogoya, J. M.; Grudsky, S. M.; Maximenko, E. A.
2017-11-01
Analysis of the asymptotic behaviour of the spectral characteristics of Toeplitz matrices as the dimension of the matrix tends to infinity has a history of over 100 years. For instance, quite a number of versions of Szegő's theorem on the asymptotic behaviour of eigenvalues and of the so-called strong Szegő theorem on the asymptotic behaviour of the determinants of Toeplitz matrices are known. Starting in the 1950s, the asymptotics of the maximum and minimum eigenvalues were actively investigated. However, investigation of the individual asymptotics of all the eigenvalues and eigenvectors of Toeplitz matrices started only quite recently: the first papers on this subject were published in 2009-2010. A survey of this new field is presented here. Bibliography: 55 titles.
On the norms of r-circulant matrices with generalized Fibonacci numbers
Directory of Open Access Journals (Sweden)
Amara Chandoul
2017-01-01
Full Text Available In this paper, we obtain a generalization of [6, 8]. Firstly, we consider the so-called r-circulant matrices with generalized Fibonacci numbers and then found lower and upper bounds for the Euclidean and spectral norms of these matrices. Afterwards, we present some bounds for the spectral norms of Hadamard and Kronecker product of these matrices.
Hypersymmetric functions and Pochhammers of 2×2 nonautonomous matrices
Directory of Open Access Journals (Sweden)
A. F. Antippa
2004-01-01
Full Text Available We introduce the hypersymmetric functions of 2×2 nonautonomous matrices and show that they are related, by simple expressions, to the Pochhammers (factorial polynomials of these matrices. The hypersymmetric functions are generalizations of the associated elementary symmetric functions, and for a specific class of 2×2 matrices, having a high degree of symmetry, they reduce to these latter functions. This class of matrices includes rotations, Lorentz boosts, and discrete time generators for the harmonic oscillators. The hypersymmetric functions are defined over four sets of independent indeterminates using a triplet of interrelated binary partitions. We work out the algebra of this triplet of partitions and then make use of the results in order to simplify the expressions for the hypersymmetric functions for a special class of matrices. In addition to their obvious applications in matrix theory, in coupled difference equations, and in the theory of symmetric functions, the results obtained here also have useful applications in problems involving successive rotations, successive Lorentz transformations, discrete harmonic oscillators, and linear two-state systems.
An algorithmic characterization of P-matricity
Ben Gharbia , Ibtihel; Gilbert , Jean Charles
2013-01-01
International audience; It is shown that a matrix M is a P-matrix if and only if, whatever is the vector q, the Newton-min algorithm does not cycle between two points when it is used to solve the linear complementarity problem 0 ≤ x ⊥ (Mx+q) ≥ 0.; Nous montrons dans cet article qu'une matrice M est une P-matrice si, et seulement si, quel que soit le vecteur q, l'algorithme de Newton-min ne fait pas de cycle de deux points lorsqu'il est utilisé pour résoudre le problème de compl\\émentarité lin...
Partitioning sparse rectangular matrices for parallel processing
Energy Technology Data Exchange (ETDEWEB)
Kolda, T.G.
1998-05-01
The authors are interested in partitioning sparse rectangular matrices for parallel processing. The partitioning problem has been well-studied in the square symmetric case, but the rectangular problem has received very little attention. They will formalize the rectangular matrix partitioning problem and discuss several methods for solving it. They will extend the spectral partitioning method for symmetric matrices to the rectangular case and compare this method to three new methods -- the alternating partitioning method and two hybrid methods. The hybrid methods will be shown to be best.
Topological expansion of the chain of matrices
International Nuclear Information System (INIS)
Eynard, B.; Ferrer, A. Prats
2009-01-01
We solve the loop equations to all orders in 1/N 2 , for the Chain of Matrices matrix model (with possibly an external field coupled to the last matrix of the chain). We show that the topological expansion of the free energy, is, like for the 1 and 2-matrix model, given by the symplectic invariants of [19]. As a consequence, we find the double scaling limit explicitly, and we discuss modular properties, large N asymptotics. We also briefly discuss the limit of an infinite chain of matrices (matrix quantum mechanics).
Newton`s iteration for inversion of Cauchy-like and other structured matrices
Energy Technology Data Exchange (ETDEWEB)
Pan, V.Y. [Lehman College, Bronx, NY (United States); Zheng, Ailong; Huang, Xiaohan; Dias, O. [CUNY, New York, NY (United States)
1996-12-31
We specify some initial assumptions that guarantee rapid refinement of a rough initial approximation to the inverse of a Cauchy-like matrix, by mean of our new modification of Newton`s iteration, where the input, output, and all the auxiliary matrices are represented with their short generators defined by the associated scaling operators. The computations are performed fast since they are confined to operations with short generators of the given and computed matrices. Because of the known correlations among various structured matrices, the algorithm is immediately extended to rapid refinement of rough initial approximations to the inverses of Vandermonde-like, Chebyshev-Vandermonde-like and Toeplitz-like matrices, where again, the computations are confined to operations with short generators of the involved matrices.
MALDI matrices for low molecular weight compounds: an endless story?
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.
Hierarchical Matrices Method and Its Application in Electromagnetic Integral Equations
Directory of Open Access Journals (Sweden)
Han Guo
2012-01-01
Full Text Available Hierarchical (H- matrices method is a general mathematical framework providing a highly compact representation and efficient numerical arithmetic. When applied in integral-equation- (IE- based computational electromagnetics, H-matrices can be regarded as a fast algorithm; therefore, both the CPU time and memory requirement are reduced significantly. Its kernel independent feature also makes it suitable for any kind of integral equation. To solve H-matrices system, Krylov iteration methods can be employed with appropriate preconditioners, and direct solvers based on the hierarchical structure of H-matrices are also available along with high efficiency and accuracy, which is a unique advantage compared to other fast algorithms. In this paper, a novel sparse approximate inverse (SAI preconditioner in multilevel fashion is proposed to accelerate the convergence rate of Krylov iterations for solving H-matrices system in electromagnetic applications, and a group of parallel fast direct solvers are developed for dealing with multiple right-hand-side cases. Finally, numerical experiments are given to demonstrate the advantages of the proposed multilevel preconditioner compared to conventional “single level” preconditioners and the practicability of the fast direct solvers for arbitrary complex structures.
The recurrence sequences via Sylvester matrices
Karaduman, Erdal; Deveci, Ömür
2017-07-01
In this work, we define the Pell-Jacobsthal-Slyvester sequence and the Jacobsthal-Pell-Slyvester sequence by using the Slyvester matrices which are obtained from the characteristic polynomials of the Pell and Jacobsthal sequences and then, we study the sequences defined modulo m. Also, we obtain the cyclic groups and the semigroups from the generating matrices of these sequences when read modulo m and then, we derive the relationships among the orders of the cyclic groups and the periods of the sequences. Furthermore, we redefine Pell-Jacobsthal-Slyvester sequence and the Jacobsthal-Pell-Slyvester sequence by means of the elements of the groups and then, we examine them in the finite groups.
Quantitative mass spectrometry of unconventional human biological matrices
Dutkiewicz, Ewelina P.; Urban, Pawel L.
2016-10-01
The development of sensitive and versatile mass spectrometric methodology has fuelled interest in the analysis of metabolites and drugs in unconventional biological specimens. Here, we discuss the analysis of eight human matrices-hair, nail, breath, saliva, tears, meibum, nasal mucus and skin excretions (including sweat)-by mass spectrometry (MS). The use of such specimens brings a number of advantages, the most important being non-invasive sampling, the limited risk of adulteration and the ability to obtain information that complements blood and urine tests. The most often studied matrices are hair, breath and saliva. This review primarily focuses on endogenous (e.g. potential biomarkers, hormones) and exogenous (e.g. drugs, environmental contaminants) small molecules. The majority of analytical methods used chromatographic separation prior to MS; however, such a hyphenated methodology greatly limits analytical throughput. On the other hand, the mass spectrometric methods that exclude chromatographic separation are fast but suffer from matrix interferences. To enable development of quantitative assays for unconventional matrices, it is desirable to standardize the protocols for the analysis of each specimen and create appropriate certified reference materials. Overcoming these challenges will make analysis of unconventional human biological matrices more common in a clinical setting. This article is part of the themed issue 'Quantitative mass spectrometry'.
A Conceptual Cost Benefit Analysis of Tailings Matrices Use in Construction Applications
Directory of Open Access Journals (Sweden)
Mahmood Ali A.
2016-01-01
Full Text Available As part of a comprehensive research program, new tailings matrices are formulated of combinations of tailings and binder materials. The research program encompasses experimental and numerical analysis of the tailings matrices to investigate the feasibility of using them as construction materials in cold climates. This paper discusses a conceptual cost benefit analysis for the use of these new materials. It is shown here that the financial benefits of using the proposed new tailings matrices in terms of environmental sustainability are much higher when compared to normal sand matrices.
An introduction to the theory of canonical matrices
Turnbull, H W
2004-01-01
Thorough and self-contained, this penetrating study of the theory of canonical matrices presents a detailed consideration of all the theory's principal features. Topics include elementary transformations and bilinear and quadratic forms; canonical reduction of equivalent matrices; subgroups of the group of equivalent transformations; and rational and classical canonical forms. The final chapters explore several methods of canonical reduction, including those of unitary and orthogonal transformations. 1952 edition. Index. Appendix. Historical notes. Bibliographies. 275 problems.
Complementary Set Matrices Satisfying a Column Correlation Constraint
Wu, Di; Spasojevic, Predrag
2006-01-01
Motivated by the problem of reducing the peak to average power ratio (PAPR) of transmitted signals, we consider a design of complementary set matrices whose column sequences satisfy a correlation constraint. The design algorithm recursively builds a collection of $2^{t+1}$ mutually orthogonal (MO) complementary set matrices starting from a companion pair of sequences. We relate correlation properties of column sequences to that of the companion pair and illustrate how to select an appropriate...
International Nuclear Information System (INIS)
Chudnovsky, D.V.; Chudnovsky, G.V.
1980-01-01
We consider semi-classical approximation to factorized S-matrices. We show that this new class of matrices, called s-matrices, defines Hamiltonian structures for isospectral deformation equations. Concrete examples of factorized s-matrices are constructed and they are used to define Hamiltonian structure for general two-dimensional isospectral deformation systems. (orig.)
Self-orthogonal codes from some bush-type Hadamard matrices ...
African Journals Online (AJOL)
By means of a construction method outlined by Harada and Tonchev, we determine some non-binary self-orthogonal codes obtained from the row span of orbit matrices of Bush-type Hadamard matrices that admit a xed-point-free and xed-block-free automorphism of prime order. We show that the code [20; 15; 4]5 obtained ...
Optical Properties of Metal-Dielectric Structures Based on Photon-Crystal Opal Matrices
Vanin, A. I.; Lukin, A. E.; Romanov, S. G.; Solovyev, V. G.; Khanin, S. D.; Yanikov, M. V.
2018-04-01
Optical properties of novel metal-dielectric nanocomposite materials based on opal matrices have been investigated. The position of optical resonances of nanocomposites, obtained by embedding of silver into the opal matrix by the electrothermodiffusion method, is explained by the Bragg diffraction, and an asymmetric form of resonance curves is attributed to the Fano resonance. An anomalous transmission and absorption of light by hybrid plasmon-photonic layered heterostructures, which is apparently associated with excitation of surface plasmon-polaritons, propagating along "metal-dielectric" interfaces, was revealed.
Associative Yang-Baxter equation for quantum (semi-)dynamical R-matrices
International Nuclear Information System (INIS)
Sechin, Ivan; Zotov, Andrei
2016-01-01
In this paper we propose versions of the associative Yang-Baxter equation and higher order R-matrix identities which can be applied to quantum dynamical R-matrices. As is known quantum non-dynamical R-matrices of Baxter-Belavin type satisfy this equation. Together with unitarity condition and skew-symmetry it provides the quantum Yang-Baxter equation and a set of identities useful for different applications in integrable systems. The dynamical R-matrices satisfy the Gervais-Neveu-Felder (or dynamical Yang-Baxter) equation. Relation between the dynamical and non-dynamical cases is described by the IRF (interaction-round-a-face)-Vertex transformation. An alternative approach to quantum (semi-)dynamical R-matrices and related quantum algebras was suggested by Arutyunov, Chekhov, and Frolov (ACF) in their study of the quantum Ruijsenaars-Schneider model. The purpose of this paper is twofold. First, we prove that the ACF elliptic R-matrix satisfies the associative Yang-Baxter equation with shifted spectral parameters. Second, we directly prove a simple relation of the IRF-Vertex type between the Baxter-Belavin and the ACF elliptic R-matrices predicted previously by Avan and Rollet. It provides the higher order R-matrix identities and an explanation of the obtained equations through those for non-dynamical R-matrices. As a by-product we also get an interpretation of the intertwining transformation as matrix extension of scalar theta function likewise R-matrix is interpreted as matrix extension of the Kronecker function. Relations to the Gervais-Neveu-Felder equation and identities for the Felder’s elliptic R-matrix are also discussed.
Asymmetric correlation matrices: an analysis of financial data
Livan, G.; Rebecchi, L.
2012-06-01
We analyse the spectral properties of correlation matrices between distinct statistical systems. Such matrices are intrinsically non-symmetric, and lend themselves to extend the spectral analyses usually performed on standard Pearson correlation matrices to the realm of complex eigenvalues. We employ some recent random matrix theory results on the average eigenvalue density of this type of matrix to distinguish between noise and non-trivial correlation structures, and we focus on financial data as a case study. Namely, we employ daily prices of stocks belonging to the American and British stock exchanges, and look for the emergence of correlations between two such markets in the eigenvalue spectrum of their non-symmetric correlation matrix. We find several non trivial results when considering time-lagged correlations over short lags, and we corroborate our findings by additionally studying the asymmetric correlation matrix of the principal components of our datasets.
No Eigenvalues Outside the Limiting Support of Generally Correlated Gaussian Matrices
Kammoun, Abla; Alouini, Mohamed-Slim
2016-01-01
This paper investigates the behaviour of the spectrum of generally correlated Gaussian random matrices whose columns are zero-mean independent vectors but have different correlations, under the specific regime where the number of their columns and that of their rows grow at infinity with the same pace. Following the approach proposed in [1], we prove that under some mild conditions, there is no eigenvalue outside the limiting support of generally correlated Gaussian matrices. As an outcome of this result, we establish that the smallest singular value of these matrices is almost surely greater than zero. From a practical perspective, this control of the smallest singular value is paramount to applications from statistical signal processing and wireless communication, in which this kind of matrices naturally arise.
No Eigenvalues Outside the Limiting Support of Generally Correlated Gaussian Matrices
Kammoun, Abla
2016-05-04
This paper investigates the behaviour of the spectrum of generally correlated Gaussian random matrices whose columns are zero-mean independent vectors but have different correlations, under the specific regime where the number of their columns and that of their rows grow at infinity with the same pace. Following the approach proposed in [1], we prove that under some mild conditions, there is no eigenvalue outside the limiting support of generally correlated Gaussian matrices. As an outcome of this result, we establish that the smallest singular value of these matrices is almost surely greater than zero. From a practical perspective, this control of the smallest singular value is paramount to applications from statistical signal processing and wireless communication, in which this kind of matrices naturally arise.
Eigenvectors phase correction in inverse modal problem
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.
Adhesion and metabolic activity of human corneal cells on PCL based nanofiber matrices
Energy Technology Data Exchange (ETDEWEB)
Stafiej, Piotr; Küng, Florian [Department of Ophthalmology, Universität Erlangen-Nürnberg, Schwabachanlage 6, 91054 Erlangen (Germany); Institute of Polymer Materials, Universität Erlangen-Nürnberg, Martensstraße 7, 91054 Erlangen (Germany); Thieme, Daniel; Czugala, Marta; Kruse, Friedrich E. [Department of Ophthalmology, Universität Erlangen-Nürnberg, Schwabachanlage 6, 91054 Erlangen (Germany); Schubert, Dirk W. [Institute of Polymer Materials, Universität Erlangen-Nürnberg, Martensstraße 7, 91054 Erlangen (Germany); Fuchsluger, Thomas A., E-mail: thomas.fuchsluger@uk-erlangen.de [Department of Ophthalmology, Universität Erlangen-Nürnberg, Schwabachanlage 6, 91054 Erlangen (Germany)
2017-02-01
In this work, polycaprolactone (PCL) was used as a basic polymer for electrospinning of random and aligned nanofiber matrices. Our aim was to develop a biocompatible substrate for ophthalmological application to improve wound closure in defects of the cornea as replacement for human amniotic membrane. We investigated whether blending the hydrophobic PCL with poly (glycerol sebacate) (PGS) or chitosan (CHI) improves the biocompatibility of the matrices for cell expansion. Human corneal epithelial cells (HCEp) and human corneal keratocytes (HCK) were used for in vitro biocompatibility studies. After optimization of the electrospinning parameters for all blends, scanning electron microscopy (SEM), attenuated total reflectance Fourier transform infrared spectroscopy (ATR-FTIR), and water contact angle were used to characterize the different matrices. Fluorescence staining of the F-actin cytoskeleton of the cells was performed to analyze the adherence of the cells to the different matrices. Metabolic activity of the cells was measured by cell counting kit-8 (CCK-8) for 20 days to compare the biocompatibility of the materials. Our results show the feasibility of producing uniform nanofiber matrices with and without orientation for the used blends. All materials support adherence and proliferation of human corneal cell lines with oriented growth on aligned matrices. Although hydrophobicity of the materials was lowered by blending PCL, no increase in biocompatibility or proliferation, as was expected, could be measured. All tested matrices supported the expansion of human corneal cells, confirming their potential as substrates for biomedical applications. - Highlights: • PCL was blended with chitosan and poly(glycerol sebacate) for electrospinning. • Biocompatibility was proven with two human corneal cell lines. • Both cell lines adhered and proliferated on random and aligned nanofiber matrices. • Cytoskeletal orientation is shown on aligned nanofiber matrices.
First results in the application of silicon photomultiplier matrices to small animal PET
Energy Technology Data Exchange (ETDEWEB)
Llosa, G. [University of Pisa, Department of Physics, Pisa (Italy)], E-mail: gabriela.llosa@pi.infn.it; Belcari, N.; Bisogni, M.G. [University of Pisa, Department of Physics, Pisa (Italy); INFN Pisa (Italy); Collazuol, G. [University of Pisa, Department of Physics, Pisa (Italy); Scuola Normale Superiore, Pisa (Italy); Marcatili, S. [University of Pisa, Department of Physics, Pisa (Italy); INFN Pisa (Italy); Boscardin, M.; Melchiorri, M.; Tarolli, A.; Piemonte, C.; Zorzi, N. [FBK irst, Trento (Italy); Barrillon, P.; Bondil-Blin, S.; Chaumat, V.; La Taille, C. de; Dinu, N.; Puill, V.; Vagnucci, J-F. [Laboratoire de l' Accelerateur Lineaire, IN2P3-CNRS, Orsay (France); Del Guerra, A. [University of Pisa, Department of Physics, Pisa (Italy); INFN Pisa (Italy)
2009-10-21
A very high resolution small animal PET scanner that employs matrices of silicon photomultipliers as photodetectors is under development at the University of Pisa and INFN Pisa. The first SiPM matrices composed of 16 (4x4)1mmx1mm pixel elements on a common substrate have been produced at FBK-irst, and are being evaluated for this application. The MAROC2 ASIC developed at LAL-Orsay has been employed for the readout of the SiPM matrices. The devices have been tested with pixelated and continuous LYSO crystals. The results show the good performance of the matrices and lead to the fabrication of matrices with 64 SiPM elements.
First results in the application of silicon photomultiplier matrices to small animal PET
International Nuclear Information System (INIS)
Llosa, G.; Belcari, N.; Bisogni, M.G.; Collazuol, G.; Marcatili, S.; Boscardin, M.; Melchiorri, M.; Tarolli, A.; Piemonte, C.; Zorzi, N.; Barrillon, P.; Bondil-Blin, S.; Chaumat, V.; La Taille, C. de; Dinu, N.; Puill, V.; Vagnucci, J-F.; Del Guerra, A.
2009-01-01
A very high resolution small animal PET scanner that employs matrices of silicon photomultipliers as photodetectors is under development at the University of Pisa and INFN Pisa. The first SiPM matrices composed of 16 (4x4)1mmx1mm pixel elements on a common substrate have been produced at FBK-irst, and are being evaluated for this application. The MAROC2 ASIC developed at LAL-Orsay has been employed for the readout of the SiPM matrices. The devices have been tested with pixelated and continuous LYSO crystals. The results show the good performance of the matrices and lead to the fabrication of matrices with 64 SiPM elements.
More about unphysical zeroes in quark mass matrices
Energy Technology Data Exchange (ETDEWEB)
Emmanuel-Costa, David, E-mail: david.costa@tecnico.ulisboa.pt [Departamento de Física and Centro de Física Teórica de Partículas - CFTP, Instituto Superior Técnico, Universidade de Lisboa, Avenida Rovisco Pais, 1049-001 Lisboa (Portugal); González Felipe, Ricardo, E-mail: ricardo.felipe@tecnico.ulisboa.pt [Departamento de Física and Centro de Física Teórica de Partículas - CFTP, Instituto Superior Técnico, Universidade de Lisboa, Avenida Rovisco Pais, 1049-001 Lisboa (Portugal); ISEL - Instituto Superior de Engenharia de Lisboa, Instituto Politécnico de Lisboa, Rua Conselheiro Emídio Navarro, 1959-007 Lisboa (Portugal)
2017-01-10
We look for all weak bases that lead to texture zeroes in the quark mass matrices and contain a minimal number of parameters in the framework of the standard model. Since there are ten physical observables, namely, six nonvanishing quark masses, three mixing angles and one CP phase, the maximum number of texture zeroes in both quark sectors is altogether nine. The nine zero entries can only be distributed between the up- and down-quark sectors in matrix pairs with six and three texture zeroes or five and four texture zeroes. In the weak basis where a quark mass matrix is nonsingular and has six zeroes in one sector, we find that there are 54 matrices with three zeroes in the other sector, obtainable through right-handed weak basis transformations. It is also found that all pairs composed of a nonsingular matrix with five zeroes and a nonsingular and nondecoupled matrix with four zeroes simply correspond to a weak basis choice. Without any further assumptions, none of these pairs of up- and down-quark mass matrices has physical content. It is shown that all non-weak-basis pairs of quark mass matrices that contain nine zeroes are not compatible with current experimental data. The particular case of the so-called nearest-neighbour-interaction pattern is also discussed.
Directory of Open Access Journals (Sweden)
P. Manfredi
2015-05-01
Full Text Available Cable bundles often exhibit random parameter variations due to uncertain or uncontrollable physical properties and wire positioning. Efficient tools, based on the so-called polynomial chaos, exist to rapidly assess the impact of such variations on the per-unit-length capacitance and inductance matrices, and on the pertinent cable response. Nevertheless, the state-of-the-art method for the statistical extraction of the per-unit-length capacitance and inductance matrices of cables suffers from several inefficiencies that hinder its applicability to large problems, in terms of number of random parameters and/or conductors. This paper presents an improved methodology that overcomes the aforementioned limitations by exploiting a recently-published, alternative approach to generate the pertinent polynomial chaos system of equations. A sparse and decoupled system is obtained that provides remarkable benefits in terms of speed, memory consumption and problem size that can be dealt with. The technique is thoroughly validated through the statistical analysis of two canonical structures, i.e. a ribbon cable and a shielded cable with random geometry and position.
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
Dececchi, T Alex; Mabee, Paula M; Blackburn, David C
2016-01-01
Databases of organismal traits that aggregate information from one or multiple sources can be leveraged for large-scale analyses in biology. Yet the differences among these data streams and how well they capture trait diversity have never been explored. We present the first analysis of the differences between phenotypes captured in free text of descriptive publications ('monographs') and those used in phylogenetic analyses ('matrices'). We focus our analysis on osteological phenotypes of the limbs of four extinct vertebrate taxa critical to our understanding of the fin-to-limb transition. We find that there is low overlap between the anatomical entities used in these two sources of phenotype data, indicating that phenotypes represented in matrices are not simply a subset of those found in monographic descriptions. Perhaps as expected, compared to characters found in matrices, phenotypes in monographs tend to emphasize descriptive and positional morphology, be somewhat more complex, and relate to fewer additional taxa. While based on a small set of focal taxa, these qualitative and quantitative data suggest that either source of phenotypes alone will result in incomplete knowledge of variation for a given taxon. As a broader community develops to use and expand databases characterizing organismal trait diversity, it is important to recognize the limitations of the data sources and develop strategies to more fully characterize variation both within species and across the tree of life.
Online monitoring of dispersion functions and transfer matrices at the SLC
International Nuclear Information System (INIS)
Emma, P.; Fieguth, T.H.; Lohse, T.; Burchat, P.R.; Panvini, R.S.
1989-03-01
The symmetries of the chromatic correction sections in the SLC Final Focus System allow a high-resolution determination of the pulse-to-pulse energy fluctuations by exploiting the information from beam position monitors (BPMs) in regions of large dispersion. By correlating this signal with other BPMs, one can infer the dispersion function as well as spatial components of transfer matrices anywhere in the arcs and the Final Focus System without interrupting normal machine operation. We present results from data recorded during either periods of stable operation or periods when the linac energy was intentionally varied. 6 refs., 7 figs
Dirac Matrices and Feynman’s Rest of the Universe
Directory of Open Access Journals (Sweden)
Young S. Kim
2012-10-01
Full Text Available There are two sets of four-by-four matrices introduced by Dirac. The first set consists of fifteen Majorana matrices derivable from his four γ matrices. These fifteen matrices can also serve as the generators of the group SL(4, r. The second set consists of ten generators of the Sp(4 group which Dirac derived from two coupled harmonic oscillators. It is shown possible to extend the symmetry of Sp(4 to that of SL(4, r if the area of the phase space of one of the oscillators is allowed to become smaller without a lower limit. While there are no restrictions on the size of phase space in classical mechanics, Feynman’s rest of the universe makes this Sp(4-to-SL(4, r transition possible. The ten generators are for the world where quantum mechanics is valid. The remaining five generators belong to the rest of the universe. It is noted that the groups SL(4, r and Sp(4 are locally isomorphic to the Lorentz groups O(3, 3 and O(3, 2 respectively. This allows us to interpret Feynman’s rest of the universe in terms of space-time symmetry.
Dynamical correlations for circular ensembles of random matrices
International Nuclear Information System (INIS)
Nagao, Taro; Forrester, Peter
2003-01-01
Circular Brownian motion models of random matrices were introduced by Dyson and describe the parametric eigenparameter correlations of unitary random matrices. For symmetric unitary, self-dual quaternion unitary and an analogue of antisymmetric Hermitian matrix initial conditions, Brownian dynamics toward the unitary symmetry is analyzed. The dynamical correlation functions of arbitrary number of Brownian particles at arbitrary number of times are shown to be written in the forms of quaternion determinants, similarly as in the case of Hermitian random matrix models
Quantum Algorithms for Weighing Matrices and Quadratic Residues
van Dam, Wim
2000-01-01
In this article we investigate how we can employ the structure of combinatorial objects like Hadamard matrices and weighing matrices to device new quantum algorithms. We show how the properties of a weighing matrix can be used to construct a problem for which the quantum query complexity is ignificantly lower than the classical one. It is pointed out that this scheme captures both Bernstein & Vazirani's inner-product protocol, as well as Grover's search algorithm. In the second part of the ar...
Empowering first year (post-matric) students in basic research skills ...
African Journals Online (AJOL)
Post-matric students from under-resourced (historically disadvantaged) black high schools generally encounter difficulties in their academic work at university. The study reported here was intended to empower first year (post-matric) students from these schools with basic research skills in a bid to counteract the effects of ...
Applicability of non-invasively collected matrices for human biomonitoring
Directory of Open Access Journals (Sweden)
Nickmilder Marc
2009-03-01
Full Text Available Abstract With its inclusion under Action 3 in the Environment and Health Action Plan 2004–2010 of the European Commission, human biomonitoring is currently receiving an increasing amount of attention from the scientific community as a tool to better quantify human exposure to, and health effects of, environmental stressors. Despite the policy support, however, there are still several issues that restrict the routine application of human biomonitoring data in environmental health impact assessment. One of the main issues is the obvious need to routinely collect human samples for large-scale surveys. Particularly the collection of invasive samples from susceptible populations may suffer from ethical and practical limitations. Children, pregnant women, elderly, or chronically-ill people are among those that would benefit the most from non-invasive, repeated or routine sampling. Therefore, the use of non-invasively collected matrices for human biomonitoring should be promoted as an ethically appropriate, cost-efficient and toxicologically relevant alternative for many biomarkers that are currently determined in invasively collected matrices. This review illustrates that several non-invasively collected matrices are widely used that can be an valuable addition to, or alternative for, invasively collected matrices such as peripheral blood sampling. Moreover, a well-informed choice of matrix can provide an added value for human biomonitoring, as different non-invasively collected matrices can offer opportunities to study additional aspects of exposure to and effects from environmental contaminants, such as repeated sampling, historical overview of exposure, mother-child transfer of substances, or monitoring of substances with short biological half-lives.
Polymer Percolation Threshold in Multi-Component HPMC Matrices Tablets
Directory of Open Access Journals (Sweden)
Maryam Maghsoodi
2011-06-01
Full Text Available Introduction: The percolation theory studies the critical points or percolation thresholds of the system, where onecomponent of the system undergoes a geometrical phase transition, starting to connect the whole system. The application of this theory to study the release rate of hydrophilic matrices allows toexplain the changes in release kinetics of swellable matrix type system and results in a clear improvement of the design of controlled release dosage forms. Methods: In this study, the percolation theory has been applied to multi-component hydroxypropylmethylcellulose (HPMC hydrophilic matrices. Matrix tablets have been prepared using phenobarbital as drug,magnesium stearate as a lubricant employing different amount of lactose and HPMC K4M as a fillerandmatrix forming material, respectively. Ethylcelullose (EC as a polymeric excipient was also examined. Dissolution studies were carried out using the paddle method. In order to estimate the percolation threshold, the behaviour of the kinetic parameters with respect to the volumetric fraction of HPMC at time zero, was studied. Results: In both HPMC/lactose and HPMC/EC/lactose matrices, from the point of view of the percolation theory, the optimum concentration for HPMC, to obtain a hydrophilic matrix system for the controlled release of phenobarbital is higher than 18.1% (v/v HPMC. Above 18.1% (v/v HPMC, an infinite cluster of HPMC would be formed maintaining integrity of the system and controlling the drug release from the matrices. According to results, EC had no significant influence on the HPMC percolation threshold. Conclusion: This may be related to broad functionality of the swelling hydrophilic matrices.
Newton's method for solving a quadratic matrix equation with special coefficient matrices
International Nuclear Information System (INIS)
Seo, Sang-Hyup; Seo, Jong Hyun; Kim, Hyun-Min
2014-01-01
We consider the iterative method for solving a quadratic matrix equation with special coefficient matrices which arises in the quasi-birth-death problem. In this paper, we show that the elementwise minimal positive solvents to quadratic matrix equations can be obtained using Newton's method. We also prove that the convergence rate of the Newton iteration is quadratic if the Fréchet derivative at the elementwise minimal positive solvent is nonsingular. However, if the Fréchet derivative is singular, the convergence rate is at least linear. Numerical experiments of the convergence rate are given.(This is summarized a paper which is to appear in Honam Mathematical Journal.)
Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
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
2012-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 ...
Two-mode Gaussian density matrices and squeezing of photons
International Nuclear Information System (INIS)
Tucci, R.R.
1992-01-01
In this paper, the authors generalize to 2-mode states the 1-mode state results obtained in a previous paper. The authors study 2-mode Gaussian density matrices. The authors find a linear transformation which maps the two annihilation operators, one for each mode, into two new annihilation operators that are uncorrelated and unsqueezed. This allows the authors to express the density matrix as a product of two 1-mode density matrices. The authors find general conditions under which 2-mode Gaussian density matrices become pure states. Possible pure states include the 2-mode squeezed pure states commonly mentioned in the literature, plus other pure states never mentioned before. The authors discuss the entropy and thermodynamic laws (Second Law, Fundamental Equation, and Gibbs-Duhem Equation) for the 2-mode states being considered
The optimal version of Hua's fundamental theorem of geometry of rectangular matrices
Semrl, Peter
2014-01-01
Hua's fundamental theorem of geometry of matrices describes the general form of bijective maps on the space of all m\\times n matrices over a division ring \\mathbb{D} which preserve adjacency in both directions. Motivated by several applications the author studies a long standing open problem of possible improvements. There are three natural questions. Can we replace the assumption of preserving adjacency in both directions by the weaker assumption of preserving adjacency in one direction only and still get the same conclusion? Can we relax the bijectivity assumption? Can we obtain an analogous result for maps acting between the spaces of rectangular matrices of different sizes? A division ring is said to be EAS if it is not isomorphic to any proper subring. For matrices over EAS division rings the author solves all three problems simultaneously, thus obtaining the optimal version of Hua's theorem. In the case of general division rings he gets such an optimal result only for square matrices and gives examples ...
Numerical solutions of stochastic Lotka-Volterra equations via operational matrices
Directory of Open Access Journals (Sweden)
F. Hosseini Shekarabi
2016-03-01
Full Text Available In this paper, an efficient and convenient method for numerical solutions of stochastic Lotka-Volterra dynamical system is proposed. Here, we consider block pulse functions and their operational matrices of integration. Illustrative example is included to demonstrate the procedure and accuracy of the operational matrices based on block pulse functions.
The performance of the Congruence Among Distance Matrices (CADM) test in phylogenetic analysis
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
The performance of the Congruence Among Distance Matrices (CADM test in phylogenetic analysis
Directory of Open Access Journals (Sweden)
Lapointe François-Joseph
2011-03-01
Full Text Available Abstract 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.
Antimutagenic and antigenotoxic effects of vegetable matrices on the activity of pesticides.
Isidori, M; Caterino, E; Criscuolo, E; Fatigati, V; Liguori, G; Parrella, A
2009-07-01
Two in vitro tests, one to detect bacterial mutagenicity (Ames test) on Salmonella typhimurium TA98, TA100, and TA1535 and the other the primary DNA damage (SOS Chromotest) on Escherichia coli PQ37, were applied to determine the overall genotoxic activity of 12 pesticides (azinphos methyl, chlorothalonil, chlorphyriphos ethyl, chlorphyriphos methyl, lambda-cyhalothrin, cypermethrin, cyprodinil, fenazaquin, fludioxonil, indoxacarb, iprodione and penconazol). These were detected by gas chromatography (GC) analysis with electron capture (ECD) and nitrogen phosphorus detection (NPD) in 18 samples of vegetables. Some extracts of vegetables, found positive for pesticides with GC, were subjected to the Ames test and SOS Chromotest to evaluate the possible antimutagenic and/or antigenotoxic effects of vegetable matrices. The same bioassays were also performed on the mixtures of pesticides found in these samples to evaluate whether interactions could occur between pesticides and be responsible for the possible antimutagenic and/or antigenotoxic effects of the contaminated matrices. Experiments were also carried out to compare the results found for contaminated vegetables with their content of antioxidant components. Significant differences in mutagenicity and genotoxicity were found among the pesticides selected for this study. Of the 12 pesticides tested, only azinphos methyl, cyprodinil, fludioxonil and iprodione were found to be positive for both S. typhimurium and E. coli. No mutagenic/genotoxic activity was found in the extracts of vegetables contaminated by pesticides. S. typhimurium TA1535 showed a strong positive mutagenic effect for the mixtures of pesticides while they were not able to induce the SOS system. The data concerning the content of polyphenols and the total reducing activity of the contaminated vegetables indicated high amounts of antioxidants that could explain the inhibitory effect on the activity of pesticides shown by vegetables.
On families of anticommuting matrices
Czech Academy of Sciences Publication Activity Database
Hrubeš, Pavel
2016-01-01
Roč. 493, March 15 (2016), s. 494-507 ISSN 0024-3795 EU Projects: European Commission(XE) 339691 - FEALORA Institutional support: RVO:67985840 Keywords : anticommuting matrices * sum-of-squares formulas Subject RIV: BA - General Mathematics Impact factor: 0.973, year: 2016 http://www.sciencedirect.com/science/article/pii/S0024379515007296
On families of anticommuting matrices
Czech Academy of Sciences Publication Activity Database
Hrubeš, Pavel
2016-01-01
Roč. 493, March 15 (2016), s. 494-507 ISSN 0024-3795 EU Projects: European Commission(XE) 339691 - FEALORA Institutional support: RVO:67985840 Keywords : anticommuting matrices * sum -of-squares formulas Subject RIV: BA - General Mathematics Impact factor: 0.973, year: 2016 http://www.sciencedirect.com/science/article/pii/S0024379515007296
Application of Parallel Hierarchical Matrices in Spatial Statistics and Parameter Identification
Litvinenko, Alexander
2018-04-20
Parallel H-matrices in spatial statistics 1. Motivation: improve statistical model 2. Tools: Hierarchical matrices [Hackbusch 1999] 3. Matern covariance function and joint Gaussian likelihood 4. Identification of unknown parameters via maximizing Gaussian log-likelihood 5. Implementation with HLIBPro
On robust signal reconstruction in noisy filter banks
Vikalo, H; Hassibi, B; Kailath, T; 10.1016/j.sigpro.2004.08.011
2005-01-01
We study the design of synthesis filters in noisy filter bank systems using an H/sup infinity / estimation point of view. The H/sup infinity / approach is most promising in situations where the statistical properties of the disturbances (arising from quantization, compression, etc.) in each subband of the filter bank is unknown, or is too difficult to model and analyze. For the important special case of unitary analysis polyphase matrices we obtain an explicit expression for the minimum achievable disturbance attenuation. For arbitrary analysis polyphase matrices, standard state-space H/sup infinity / techniques can be employed to obtain numerical solutions. When the synthesis filters are restricted to being FIR, as is often the case in practice, the design can be cast as a finite-dimensional semi-definite program. In this case, we can effectively exploit the inherent non-uniqueness of the H/sup infinity / solution to optimize for an additional criteria. By optimizing for average performance in addition to th...
Higher dimensional unitary braid matrices: Construction, associated structures and entanglements
International Nuclear Information System (INIS)
Abdesselam, B.; Chakrabarti, A.; Dobrev, V.K.; Mihov, S.G.
2007-03-01
We construct (2n) 2 x (2n) 2 unitary braid matrices R-circumflex for n ≥ 2 generalizing the class known for n = 1. A set of (2n) x (2n) matrices (I, J,K,L) are defined. R-circumflex is expressed in terms of their tensor products (such as K x J), leading to a canonical formulation for all n. Complex projectors P ± provide a basis for our real, unitary R-circumflex. Baxterization is obtained. Diagonalizations and block- diagonalizations are presented. The loss of braid property when R-circumflex (n > 1) is block-diagonalized in terms of R-circumflex (n = 1) is pointed out and explained. For odd dimension (2n + 1) 2 x (2n + 1) 2 , a previously constructed braid matrix is complexified to obtain unitarity. R-circumflexLL- and R-circumflexTT- algebras, chain Hamiltonians, potentials for factorizable S-matrices, complex non-commutative spaces are all studied briefly in the context of our unitary braid matrices. Turaev construction of link invariants is formulated for our case. We conclude with comments concerning entanglements. (author)
A Conceptual Cost Benefit Analysis of Tailings Matrices Use in Construction Applications
Mahmood Ali A.; Elektorowicz Maria
2016-01-01
As part of a comprehensive research program, new tailings matrices are formulated of combinations of tailings and binder materials. The research program encompasses experimental and numerical analysis of the tailings matrices to investigate the feasibility of using them as construction materials in cold climates. This paper discusses a conceptual cost benefit analysis for the use of these new materials. It is shown here that the financial benefits of using the proposed new tailings matrices i...
Invertibility and Explicit Inverses of Circulant-Type Matrices with k-Fibonacci and k-Lucas Numbers
Directory of Open Access Journals (Sweden)
Zhaolin Jiang
2014-01-01
Full Text Available Circulant matrices have important applications in solving ordinary differential equations. In this paper, we consider circulant-type matrices with the k-Fibonacci and k-Lucas numbers. We discuss the invertibility of these circulant matrices and present the explicit determinant and inverse matrix by constructing the transformation matrices, which generalizes the results in Shen et al. (2011.
Asymptotic Distribution of Eigenvalues of Weakly Dilute Wishart Matrices
Energy Technology Data Exchange (ETDEWEB)
Khorunzhy, A. [Institute for Low Temperature Physics (Ukraine)], E-mail: khorunjy@ilt.kharkov.ua; Rodgers, G. J. [Brunel University, Uxbridge, Department of Mathematics and Statistics (United Kingdom)], E-mail: g.j.rodgers@brunel.ac.uk
2000-03-15
We study the eigenvalue distribution of large random matrices that are randomly diluted. We consider two random matrix ensembles that in the pure (nondilute) case have a limiting eigenvalue distribution with a singular component at the origin. These include the Wishart random matrix ensemble and Gaussian random matrices with correlated entries. Our results show that the singularity in the eigenvalue distribution is rather unstable under dilution and that even weak dilution destroys it.
Amino acid size, charge, hydropathy indices and matrices for protein structure analysis
Directory of Open Access Journals (Sweden)
Biro JC
2006-03-01
Full Text Available Abstract Background Prediction of protein folding and specific interactions from only the sequence (ab initio is a major challenge in bioinformatics. It is believed that such prediction will prove possible if Anfinsen's thermodynamic principle is correct for all kinds of proteins, and all the information necessary to form a concrete 3D structure is indeed present in the sequence. Results We indexed the 200 possible amino acid pairs for their compatibility regarding the three major physicochemical properties – size, charge and hydrophobicity – and constructed Size, Charge and Hydropathy Compatibility Indices and Matrices (SCI & SCM, CCI & CCM, and HCI & HCM. Each index characterized the expected strength of interaction (compatibility of two amino acids by numbers from 1 (not compatible to 20 (highly compatible. We found statistically significant positive correlations between these indices and the propensity for amino acid co-locations in real protein structures (a sample containing total 34630 co-locations in 80 different protein structures: for HCI: p We tried to predict or reconstruct simple 2D representations of 3D structures from the sequence using these matrices by applying a dot plot-like method. The location and pattern of the most compatible subsequences was very similar or identical when the three fundamentally different matrices were used, which indicates the consistency of physicochemical compatibility. However, it was not sufficient to choose one preferred configuration between the many possible predicted options. Conclusion Indexing of amino acids for major physico-chemical properties is a powerful approach to understanding and assisting protein design. However, it is probably insufficient itself for complete ab initio structure prediction.
Teaching Fourier optics through ray matrices
International Nuclear Information System (INIS)
Moreno, I; Sanchez-Lopez, M M; Ferreira, C; Davis, J A; Mateos, F
2005-01-01
In this work we examine the use of ray-transfer matrices for teaching and for deriving some topics in a Fourier optics course, exploiting the mathematical simplicity of ray matrices compared to diffraction integrals. A simple analysis of the physical meaning of the elements of the ray matrix provides a fast derivation of the conditions to obtain the optical Fourier transform. We extend this derivation to fractional Fourier transform optical systems, and derive the order of the transform from the ray matrix. Some examples are provided to stress this point of view, both with classical and with graded index lenses. This formulation cannot replace the complete explanation of Fourier optics provided by the wave theory, but it is a complementary tool useful to simplify many aspects of Fourier optics and to relate them to geometrical optics
Frobenius theory for positive maps of von Neumann algebras
International Nuclear Information System (INIS)
Albeverio, S.; Hoegh-Krohn, R.
1978-01-01
Frobenius theory about the cyclic structure of eigenvalues of irreducible non negative matrices is extended to the case of positive linear maps of von Neumann algebras. Semigroups of such maps and ergodic properties are also considered. (orig.) [de
International Nuclear Information System (INIS)
Naftchi-Ardebili, Kasra; Hau, Nathania W.; Mazziotti, David A.
2011-01-01
Variational minimization of the ground-state energy as a function of the two-electron reduced density matrix (2-RDM), constrained by necessary N-representability conditions, provides a polynomial-scaling approach to studying strongly correlated molecules without computing the many-electron wave function. Here we introduce a route to enhancing necessary conditions for N representability through rank restriction of the 2-RDM. Rather than adding computationally more expensive N-representability conditions, we directly enhance the accuracy of two-particle (2-positivity) conditions through rank restriction, which removes degrees of freedom in the 2-RDM that are not sufficiently constrained. We select the rank of the particle-hole 2-RDM by deriving the ranks associated with model wave functions, including both mean-field and antisymmetrized geminal power (AGP) wave functions. Because the 2-positivity conditions are exact for quantum systems with AGP ground states, the rank of the particle-hole 2-RDM from the AGP ansatz provides a minimum for its value in variational 2-RDM calculations of general quantum systems. To implement the rank-restricted conditions, we extend a first-order algorithm for large-scale semidefinite programming. The rank-restricted conditions significantly improve the accuracy of the energies; for example, the percentages of correlation energies recovered for HF, CO, and N 2 improve from 115.2%, 121.7%, and 121.5% without rank restriction to 97.8%, 101.1%, and 100.0% with rank restriction. Similar results are found at both equilibrium and nonequilibrium geometries. While more accurate, the rank-restricted N-representability conditions are less expensive computationally than the full-rank conditions.
Fabrication of chemically cross-linked porous gelatin matrices.
Bozzini, Sabrina; Petrini, Paola; Altomare, Lina; Tanzi, Maria Cristina
2009-01-01
The aim of this study was to chemically cross-link gelatin, by reacting its free amino groups with an aliphatic diisocyanate. To produce hydrogels with controllable properties, the number of reacting amino groups was carefully determined. Porosity was introduced into the gelatin-based hydrogels through the lyophilization process. Porous and non-porous matrices were characterized with respect to their chemical structure, morphology, water uptake and mechanical properties. The physical, chemical and mechanical properties of the porous matrices are related to the extent of their cross-linking, showing that they can be controlled by varying the reaction parameters. Water uptake values (24 hours) vary between 160% and 200% as the degree of cross-linking increases. The flexibility of the samples also decreases by changing the extent of cross-linking. Young's modulus shows values between 0.188 KPa, for the highest degree, and 0.142 KPa for the lowest degree. The matrices are potential candidates for use as tissue-engineering scaffolds by modulating their physical chemical properties according to the specific application.
Large-deviation theory for diluted Wishart random matrices
Castillo, Isaac Pérez; Metz, Fernando L.
2018-03-01
Wishart random matrices with a sparse or diluted structure are ubiquitous in the processing of large datasets, with applications in physics, biology, and economy. In this work, we develop a theory for the eigenvalue fluctuations of diluted Wishart random matrices based on the replica approach of disordered systems. We derive an analytical expression for the cumulant generating function of the number of eigenvalues IN(x ) smaller than x ∈R+ , from which all cumulants of IN(x ) and the rate function Ψx(k ) controlling its large-deviation probability Prob[IN(x ) =k N ] ≍e-N Ψx(k ) follow. Explicit results for the mean value and the variance of IN(x ) , its rate function, and its third cumulant are discussed and thoroughly compared to numerical diagonalization, showing very good agreement. The present work establishes the theoretical framework put forward in a recent letter [Phys. Rev. Lett. 117, 104101 (2016), 10.1103/PhysRevLett.117.104101] as an exact and compelling approach to deal with eigenvalue fluctuations of sparse random matrices.
Theoretical and experimental researches of methanol clusters in low - temperature matrices
International Nuclear Information System (INIS)
Chernolevs'ka, Je.A.; Doroshenko, Yi.Yu.; Pogorelov, V.Je.; Vas'kyivs'kij, Je.V.; Shablyinskas, V.; Balyavyichus, V.; Yasajev, O.
2015-01-01
Molecular vibrational spectra of methanol in argon and nitrogen matrices have been studied. Since methanol belongs to a class of substances with hydrogen bonds, there is a possibility of forming molecular associations and clusters with various numbers of molecules. IR spectra of methanol in Ar and N 2 matrices experimentally obtained in the temperature range from 10 to 50 K are compared with the results of computer simulation using the ab initio Car-Parrinello molecular dynamics (CPMD) method. The results obtained for small clusters in model calculations demonstrate a good correlation with experimental data for various matrices at the corresponding temperatures
Multiple Regression Analysis of Unconfined Compression Strength of Mine Tailings Matrices
Directory of Open Access Journals (Sweden)
Mahmood Ali A.
2017-01-01
Full Text Available As part of a novel approach of sustainable development of mine tailings, experimental and numerical analysis is carried out on newly formulated tailings matrices. Several physical characteristic tests are carried out including the unconfined compression strength test to ascertain the integrity of these matrices when subjected to loading. The current paper attempts a multiple regression analysis of the unconfined compressive strength test results of these matrices to investigate the most pertinent factors affecting their strength. Results of this analysis showed that the suggested equation is reasonably applicable to the range of binder combinations used.
Procrustes Problems for General, Triangular, and Symmetric Toeplitz Matrices
Directory of Open Access Journals (Sweden)
Juan Yang
2013-01-01
Full Text Available The Toeplitz Procrustes problems are the least squares problems for the matrix equation AX=B over some Toeplitz matrix sets. In this paper the necessary and sufficient conditions are obtained about the existence and uniqueness for the solutions of the Toeplitz Procrustes problems when the unknown matrices are constrained to the general, the triangular, and the symmetric Toeplitz matrices, respectively. The algorithms are designed and the numerical examples show that these algorithms are feasible.
A Workshop on Algebraic Design Theory and Hadamard Matrices
2015-01-01
This volume develops the depth and breadth of the mathematics underlying the construction and analysis of Hadamard matrices and their use in the construction of combinatorial designs. At the same time, it pursues current research in their numerous applications in security and cryptography, quantum information, and communications. Bridges among diverse mathematical threads and extensive applications make this an invaluable source for understanding both the current state of the art and future directions. The existence of Hadamard matrices remains one of the most challenging open questions in combinatorics. Substantial progress on their existence has resulted from advances in algebraic design theory using deep connections with linear algebra, abstract algebra, finite geometry, number theory, and combinatorics. Hadamard matrices arise in a very diverse set of applications. Starting with applications in experimental design theory and the theory of error-correcting codes, they have found unexpected and important ap...
Directory of Open Access Journals (Sweden)
J. Baussand
2008-01-01
Full Text Available The adequacy of substitution matrices to model evolutionary relationships between amino acid sequences can be numerically evaluated by checking the mathematical property of triangle inequality for all triplets of residues. By converting substitution scores into distances, one can verify that a direct path between two amino acids is shorter than a path passing through a third amino acid in the amino acid space modeled by the matrix. If the triangle inequality is not verified, the intuition is that the evolutionary signal is not well modeled by the matrix, that the space is locally inconsistent and that the matrix construction was probably based on insufficient biological data. Previous analysis on several substitution matrices revealed that the number of triplets violating the triangle inequality increases with sequence divergence. Here, we compare matrices which are dedicated to the alignment of highly divergent proteins. The triangle inequality is tested on several classical substitution matrices as well as in a pair of “complementary” substitution matrices recording the evolutionary pressures inside and outside hydrophobic blocks in protein sequences. The analysis proves the crucial role of hydrophobic residues in substitution matrices dedicated to the alignment of distantly related proteins.
A Technique for Controlling Matric Suction on Filter Papers . GroWth ...
African Journals Online (AJOL)
'Abstract. Moist filter papers are widely usedfor seed gennination tests but their water confent and matric suction are not usually controlled. A technique for controlling filter paper matric suction is described and usedfor germination studies involving fresh and aged sorghum seed (Sorghummcolor (L) Moench). Filter papers ...
ON MATRICES ARISING IN RETARDED DELAY DIFFERENTIAL SYSTEMS
Directory of Open Access Journals (Sweden)
S DJEZZAR
2002-12-01
Full Text Available Dans cet article, on considère une classe de système différentiels retardés et à laquelle on associe une matrice système sur R[s,z], l'anneau des polynômes à deux indéterminés s et z. Ensuite, en utilisant la notion de la matrice forme de Smith sur R[s,z], on étend un résultat de caractérisation obtenu précédemment [5] sur les formes canoniques, à un cas plus général.
On the Wigner law in dilute random matrices
Khorunzhy, A.; Rodgers, G. J.
1998-12-01
We consider ensembles of N × N symmetric matrices whose entries are weakly dependent random variables. We show that random dilution can change the limiting eigenvalue distribution of such matrices. We prove that under general and natural conditions the normalised eigenvalue counting function coincides with the semicircle (Wigner) distribution in the limit N → ∞. This can be explained by the observation that dilution (or more generally, random modulation) eliminates the weak dependence (or correlations) between random matrix entries. It also supports our earlier conjecture that the Wigner distribution is stable to random dilution and modulation.
M Wedderburn, J H
1934-01-01
It is the organization and presentation of the material, however, which make the peculiar appeal of the book. This is no mere compendium of results-the subject has been completely reworked and the proofs recast with the skill and elegance which come only from years of devotion. -Bulletin of the American Mathematical Society The very clear and simple presentation gives the reader easy access to the more difficult parts of the theory. -Jahrbuch über die Fortschritte der Mathematik In 1937, the theory of matrices was seventy-five years old. However, many results had only recently evolved from sp
Theoretical origin of quark mass matrices
International Nuclear Information System (INIS)
Mohapatra, R.N.
1987-01-01
This paper presents the theoretical origin of specific quark mass matrices in the grand unified theories. The author discusses the first natural derivation of the Stech-type mass matrix in unified gauge theories. A solution to the strong CP-problem is provided
Regenerated cellulose micro-nano fiber matrices for transdermal drug release
International Nuclear Information System (INIS)
Liu, Yue; Nguyen, Andrew; Allen, Alicia; Zoldan, Janet; Huang, Yuxiang; Chen, Jonathan Y.
2017-01-01
In this work, biobased fibrous membranes with micro- and nano-fibers are fabricated for use as drug delivery carries because of their biocompatibility, eco-friendly approach, and potential for scale-up. The cellulose micro-/nano-fiber (CMF) matrices were prepared by electrospinning of pulp in an ionic liquid, 1-butyl-3-methylimidazolium chloride. A model drug, ibuprofen (IBU), was loaded on the CMF matrices by a simple immersing method. The amount of IBU loading was about 6% based on the weight of cellulose membrane. The IBU-loaded CMF matrices were characterized by Fourier-transform infrared spectroscopy, thermal gravimetric analysis, and scanning electron microscopy. The test of ibuprofen release was carried out in an acetate buffer solution of pH 5.5 and examined by UV–Vis spectroscopy. Release profiles from the CMF matrices indicated that the drug release rate could be determined by a Fickian diffusion mechanism. - Highlights: • Cellulose micro-nano fiber matrix was prepared by dry-wet electrospinning. • Ibuprofen was loaded on the matrix by a simple immersing method. • The drug loaded matrix showed a biphasic release profile. • The drug release was determined by a Fickian diffusion mechanism.
Regenerated cellulose micro-nano fiber matrices for transdermal drug release
Energy Technology Data Exchange (ETDEWEB)
Liu, Yue [School of Human Ecology, The University of Texas at Austin, Austin, TX (United States); Department of Chemistry, School of Science, Tianjin University, Tianjin (China); Nguyen, Andrew; Allen, Alicia; Zoldan, Janet [Department of Biomedical Engineering, The University of Texas at Austin, Austin, TX (United States); Huang, Yuxiang [School of Human Ecology, The University of Texas at Austin, Austin, TX (United States); Chen, Jonathan Y., E-mail: jychen2@austin.utexas.edu [School of Human Ecology, The University of Texas at Austin, Austin, TX (United States)
2017-05-01
In this work, biobased fibrous membranes with micro- and nano-fibers are fabricated for use as drug delivery carries because of their biocompatibility, eco-friendly approach, and potential for scale-up. The cellulose micro-/nano-fiber (CMF) matrices were prepared by electrospinning of pulp in an ionic liquid, 1-butyl-3-methylimidazolium chloride. A model drug, ibuprofen (IBU), was loaded on the CMF matrices by a simple immersing method. The amount of IBU loading was about 6% based on the weight of cellulose membrane. The IBU-loaded CMF matrices were characterized by Fourier-transform infrared spectroscopy, thermal gravimetric analysis, and scanning electron microscopy. The test of ibuprofen release was carried out in an acetate buffer solution of pH 5.5 and examined by UV–Vis spectroscopy. Release profiles from the CMF matrices indicated that the drug release rate could be determined by a Fickian diffusion mechanism. - Highlights: • Cellulose micro-nano fiber matrix was prepared by dry-wet electrospinning. • Ibuprofen was loaded on the matrix by a simple immersing method. • The drug loaded matrix showed a biphasic release profile. • The drug release was determined by a Fickian diffusion mechanism.
A Technique for Controlling Matric Suction on Filter Papers Used in ...
African Journals Online (AJOL)
Moist filter papers are widely usedfor seed gennination tests but their water confent and matric suction are not usually controlled. A technique for controlling filter paper matric suction is described and usedfor germination studies involving fresh and aged sorghum seed (Sorghummcolor (L) Moench). Filter papers wetted to ...
Evolutionary Games with Randomly Changing Payoff Matrices
Yakushkina, Tatiana; Saakian, David B.; Bratus, Alexander; Hu, Chin-Kun
2015-06-01
Evolutionary games are used in various fields stretching from economics to biology. In most of these games a constant payoff matrix is assumed, although some works also consider dynamic payoff matrices. In this article we assume a possibility of switching the system between two regimes with different sets of payoff matrices. Potentially such a model can qualitatively describe the development of bacterial or cancer cells with a mutator gene present. A finite population evolutionary game is studied. The model describes the simplest version of annealed disorder in the payoff matrix and is exactly solvable at the large population limit. We analyze the dynamics of the model, and derive the equations for both the maximum and the variance of the distribution using the Hamilton-Jacobi equation formalism.
Open vessel microwave digestion of food matrices (T6)
International Nuclear Information System (INIS)
Rhodes, L.; LeBlanc, G.
2002-01-01
Full text: Advancements in the field of open vessel microwave digestion continue to provide solutions for industries requiring acid digestion of large sample sizes. Those interesting in digesting food matrices are particularly interested in working with large amounts of sample and then diluting small final volumes. This paper will show the advantages of instantaneous regent addition and post-digestion evaporation when performing an open vessel digestion and evaporation methods for various food matrices will be presented along with analyte recovery data. (author)
The realization problem for positive and fractional systems
Kaczorek, Tadeusz
2014-01-01
This book addresses the realization problem of positive and fractional continuous-time and discrete-time linear systems. Roughly speaking the essence of the realization problem can be stated as follows: Find the matrices of the state space equations of linear systems for given their transfer matrices. This first book on this topic shows how many well-known classical approaches have been extended to the new classes of positive and fractional linear systems. The modified Gilbert method for multi-input multi-output linear systems, the method for determination of realizations in the controller canonical forms and in observer canonical forms are presented. The realization problem for linear systems described by differential operators, the realization problem in the Weierstrass canonical forms and of the descriptor linear systems for given Markov parameters are addressed. The book also presents a method for the determination of minimal realizations of descriptor linear systems and an extension for cone linear syste...
Square matrices of order 2 theory, applications, and problems
Pop, Vasile
2017-01-01
This unique and innovative book presents an exciting and complete detail of all the important topics related to the theory of square matrices of order 2. The readers exploring every detailed aspect of matrix theory are gently led toward understanding advanced topics. They will follow every notion of matrix theory with ease, accumulating a thorough understanding of algebraic and geometric aspects of matrices of order 2. The prime jewel of this book is its offering of an unusual collection of problems, theoretically motivated, most of which are new, original, and seeing the light of publication for the first time in the literature. Nearly all of the exercises are presented with detailed solutions and vary in difficulty from easy to more advanced. Many problems are particularly challenging. These, and not only these, invite the reader to unleash their creativity and research capabilities and to discover their own methods of attacking a problem. Matrices have a vast practical importance to mathematics, science, a...
Linear algebra and matrices topics for a second course
Shapiro, Helene
2015-01-01
Linear algebra and matrix theory are fundamental tools for almost every area of mathematics, both pure and applied. This book combines coverage of core topics with an introduction to some areas in which linear algebra plays a key role, for example, block designs, directed graphs, error correcting codes, and linear dynamical systems. Notable features include a discussion of the Weyr characteristic and Weyr canonical forms, and their relationship to the better-known Jordan canonical form; the use of block cyclic matrices and directed graphs to prove Frobenius's theorem on the structure of the eigenvalues of a nonnegative, irreducible matrix; and the inclusion of such combinatorial topics as BIBDs, Hadamard matrices, and strongly regular graphs. Also included are McCoy's theorem about matrices with property P, the Bruck-Ryser-Chowla theorem on the existence of block designs, and an introduction to Markov chains. This book is intended for those who are familiar with the linear algebra covered in a typical first c...
Selection of appropriate conditioning matrices for the safe disposal of radioactive waste
International Nuclear Information System (INIS)
Vance, E.R.
2002-01-01
The selection of appropriate solid conditioning matrices or wasteforms for the safe disposal of radioactive waste is dictated by many factors. The overriding issue is that the matrix incorporating the radionuclides, together with a set of engineered barriers in a near-surface or deep geological repository, should prevent significant groundwater transport of radionuclides to the biosphere. For high-level waste (HLW) from nuclear fuel reprocessing, the favored matrices are glasses, ceramics and glass-ceramics. Borosilicate glasses are presently being used in some countries, but there are strong scientific arguments why ceramics based on assemblages of natural minerals are advantageous for HLW. Much research has been carried out in the last 40 years around the world, and different matrices are more suitable than others for a given waste composition. However a major stumbling block for HLW immobilisation is the mall number of approved geological repositories for such matrices. The most appropriate matrices for Intermediate and low-level wastes are contentious and the selection criteria are not very well defined. The candidate matrices for these latter wastes are cements, bitumen, geopolymers, glasses, glass-ceramics and ceramics. After discussing the pros and cons of various candidate matrices for given kinds of radioactive wastes, the SYNROC research program at ANSTO will be briefly surveyed. Some of the potential applications of this work using a variety of SYNROC derivatives will be given. Finally the basic research program at ANSTO on radioactive waste immobilisation will be summarised. This comprises mainly work on solid state chemistry to understand ionic valences and co-ordinations for the chemical design of wasteforms, aqueous durability to study the pH and temperature dependence of solid-water reactions, radiation damage effects on structure and solid-water reactions. (Author)
Pieper, J.S.; Oosterhof, A.; Dijkstra, Pieter J.; Veerkamp, J.H.; van Kuppevelt, T.H.
1999-01-01
Porous collagen matrices with defined physical, chemical and biological characteristics are interesting materials for tissue engineering. Attachment of glycosaminoglycans (GAGs) may add to these characteristics and valorize collagen. In this study, porous type I collagen matrices were crosslinked
Efficiency of fly ash belite cement and zeolite matrices for immobilizing cesium
International Nuclear Information System (INIS)
Goni, S.; Guerrero, A.; Lorenzo, M.P.
2006-01-01
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 deg. 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)
Evaluation of the technical feasibility of new conditioning matrices for long-lived radionuclides
International Nuclear Information System (INIS)
Deschanels, X.
2004-01-01
Several matrices have been selected for the conditioning of long-lived radioactive wastes: a compound made of a iodo-apatite core coated with a densified matrice of vanadium-phosphorus-lead apatite for iodine; the hollandite ceramic for cesium; the britholite, zirconolite, thorium phosphate diphosphate, and the monazite-brabantite solid solution for minor actinides; and a Nb-based metal alloy and phosphate or titanate-type ceramics for technetium. This report presents the results of the researches carried out between 2002-2004 during the technical feasibility step. The main points described are: - the behaviour of matrices under irradiation. These studies were performed thanks to an approach combining the characterization of natural analogues, the doping of matrices with short-lived radionuclides and the use of external irradiations; - the behaviour of these matrices with respect to water alteration; - the sensibility of these structures with respect to the incorporation of chemical impurities; - a package-process approach including the optimization of the process and preliminary studies about the package concept retained. These studies show that important work remains to be done to develop conditioning matrices suitable for iodine and technetium, while for cesium and minor actinides, the first steps of the technical feasibility are made. However, it remains impossible today to determine the structure having the best global behaviour. (J.S.)
Matrices and society matrix algebra and its applications in the social sciences
Bradley, Ian
2014-01-01
Matrices offer some of the most powerful techniques in modem mathematics. In the social sciences they provide fresh insights into an astonishing variety of topics. Dominance matrices can show how power struggles in offices or committees develop; Markov chains predict how fast news or gossip will spread in a village; permutation matrices illuminate kinship structures in tribal societies. All these invaluable techniques and many more are explained clearly and simply in this wide-ranging book. Originally published in 1986. The Princeton Legacy Library uses the latest print-on-demand technology to
Theory of quark mixing matrix and invariant functions of mass matrices
International Nuclear Information System (INIS)
Jarlskog, C.
1987-10-01
The outline of this talk is as follows: The origin of the quark mixing matrix. Super elementary theory of flavour 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. Application to Fritzsch and Stech matrices. References. (author)
Geometry and arithmetic of factorized S-matrices
International Nuclear Information System (INIS)
Freund, P.G.O.
1995-01-01
In realistic four-dimensional quantum field theories integrability is elusive. Relativity, when combined with quantum theory does not permit an infinity of local conservation laws except for free fields, for which the S-matrix is trivial S = 1. In two space-time dimensions, where forward and backward scattering are the only possibilities, nontrivial S-matrices are possible even in integrable theories. Such S-matrices are known to factorize [1]. This means that there is no particle production, so that the 4-point amplitudes determine all higher n-point amplitudes. In our recent work [2, 3, 4, 5, 6] we found that in such integrable two-dimensional theories, even the input 4-point amplitudes are determined by a simple principle. Roughly speaking these amplitudes describe the S-wave scattering which one associates with free motion on certain quantum-symmetric spaces. The trivial S-matrix of free field theory describes the absence of scattering which one associates with free motion on a euclidean space, itself a symmetric space. As is well known [7, 8, 9], for curved symmetric spaces the S-matrices for S-wave scattering are no longer trivial, but rather they are determined by the Harish-Chandra c-functions of these spaces [10]. The quantum deformation of this situation is what appears when one considers excitation scattering in two-dimensional integrable models. (orig.)
Random Matrices for Information Processing – A Democratic Vision
DEFF Research Database (Denmark)
Cakmak, Burak
The thesis studies three important applications of random matrices to information processing. Our main contribution is that we consider probabilistic systems involving more general random matrix ensembles than the classical ensembles with iid entries, i.e. models that account for statistical...... dependence between the entries. Specifically, the involved matrices are invariant or fulfill a certain asymptotic freeness condition as their dimensions grow to infinity. Informally speaking, all latent variables contribute to the system model in a democratic fashion – there are no preferred latent variables...
Studies of Catalytic Properties of Inorganic Rock Matrices in Redox Reactions
Directory of Open Access Journals (Sweden)
Nikolay M. Dobrynkin
2017-09-01
Full Text Available Intrinsic catalytic properties of mineral matrices of various kinds (basalts, clays, sandstones were studied, which are of interest for in-situ heavy oil upgrading (i.e., underground to create advanced technologies for enhanced oil recovery. The elemental, surface and phase composition and matrix particle morphology, surface and acidic properties were studied using elemental analysis, X-ray diffraction, adsorption and desorption of nitrogen and ammonia. The data on the catalytic activity of inorganic matrices in ammonium nitrate decomposition (reaction with a large gassing, oxidation of hydrocarbons and carbon monoxide, and hydrocracking of asphaltenes into maltenes (the conversion of heavy hydrocarbons into more valuable light hydrocarbons were discussed. In order to check their applicability for the asphaltenes hydrocracking catalytic systems development, basalt and clay matrices were used as supports for iron/basalt, nickel/basalt and iron/clay catalysts. The catalytic activity of the matrices in the reactions of the decomposition of ammonium nitrate, oxidation of hydrocarbons and carbon monoxide, and hydrocracking of asphaltens was observed for the first time.
Directory of Open Access Journals (Sweden)
Wilhelmina A.M. Vingerhoets
2013-12-01
Full Text Available Schizophrenia is a disabling, chronic psychiatric disorder with a prevalence rate of 0.5-1% in the general population. Symptoms include positive (e.g. delusions, hallucinations, negative (e.g. blunted affect, social withdrawal, as well as cognitive symptoms (e.g. memory and attention problems. Although 75-85% of patients with schizophrenia report cognitive impairments, the underlying neuropharmacological mechanisms are not well understood and currently no effective treatment is available for these impairments. This has led to the MATRICS initiative (Measurement and Treatment Research to Improve Cognition in Schizophrenia, which established seven cognitive domains that are fundamentally impaired in schizophrenia. These domains include verbal learning and memory, visual learning and memory, working memory, attention and vigilance, processing speed, reasoning and problem solving, and social cognition. Recently, a growing number of studies have been conducted trying to identify the underlying neuropharmacological mechanisms of cognitive impairments in schizophrenia patients. Specific cognitive impairments seem to arise from different underlying neuropharmacological mechanisms. However, most review articles describe cognition in general and an overview of the mechanisms involved in these seven separate cognitive domains is currently lacking. Therefore, we reviewed the underlying neuropharmacological mechanisms focussing on the domains as established by the MATRICS initiative which are considered most crucial in schizophrenia.
Directory of Open Access Journals (Sweden)
P. S. Timashev
2016-01-01
Full Text Available Aim. Controlled treatment of the physico-chemical and mechanical properties of a three-dimensional crosslinked matrix based on reactive chitosan. Materials and methods. The three-dimensional matrices were obtained using photosensitive composition based on allyl chitosan (5 wt%, poly(ethylene glycol diacrylate (8 wt% and the photoinitiator Irgacure 2959 (1 wt% by laser stereolithography setting. The kinetic swelling curves were constructed for structures in the base and salt forms of chitosan using gravimetric method and the contact angles were measured using droplet spreading. The supercritical fl uid setting (40 °C, 12 MPa was used to process matrices during 1.5 hours. Using nanohardness Piuma Nanoindenter we calculated values of Young’s modulus. The study of cytotoxicity was performed by direct contact with the culture of the NIH 3T3 mouse fi broblast cell line. Results. Architectonics of matrices fully repeats the program model. Matrices are uniform throughout and retain their shape after being transferred to the base form. Matrices compressed by 5% after treatment in supercritical carbon dioxide (scCO2 . The elastic modulus of matrices after scCO2 treatment is 4 times higher than the original matrix. The kinetic swelling curves have similar form. In this case the maximum degree of swelling for matrices in base form is 2–2.5 times greater than that of matrices in salt form. There was a surface hydrophobization after the material was transferred to the base form: the contact angle is 94°, and for the salt form it is 66°. The basic form absorbs liquid approximately 1.6 times faster. The fi lm thickness was increased in the area of contact with the liquid droplets after absorption by 133 and 87% for the base and the salt forms, respectively. Treatment of samples in scCO2 reduces their cytotoxicity from 2 degree of reaction (initial samples down to 1 degree of reaction. Conclusion. The use of supercritical carbon dioxide for scaffolds
The reflection of hierarchical cluster analysis of co-occurrence matrices in SPSS
Zhou, Q.; Leng, F.; Leydesdorff, L.
2015-01-01
Purpose: To discuss the problems arising from hierarchical cluster analysis of co-occurrence matrices in SPSS, and the corresponding solutions. Design/methodology/approach: We design different methods of using the SPSS hierarchical clustering module for co-occurrence matrices in order to compare
Large margin classification with indefinite similarities
Alabdulmohsin, Ibrahim; Cisse, Moustapha; Gao, Xin; Zhang, Xiangliang
2016-01-01
Classification with indefinite similarities has attracted attention in the machine learning community. This is partly due to the fact that many similarity functions that arise in practice are not symmetric positive semidefinite, i.e. the Mercer
Non-commutative Hardy inequalities
DEFF Research Database (Denmark)
Hansen, Frank
2009-01-01
We extend Hardy's inequality from sequences of non-negative numbers to sequences of positive semi-definite operators if the parameter p satisfies 1 1. Applications to trace functions are given. We introduce the tracial geometric mean...
Bin Raies, Arwa
2013-10-16
Background:In a number of diseases, certain genes are reported to be strongly methylated and thus can serve as diagnostic markers in many cases. Scientific literature in digital form is an important source of information about methylated genes implicated in particular diseases. The large volume of the electronic text makes it difficult and impractical to search for this information manually.Methodology:We developed a novel text mining methodology based on a new concept of position weight matrices (PWMs) for text representation and feature generation. We applied PWMs in conjunction with the document-term matrix to extract with high accuracy associations between methylated genes and diseases from free text. The performance results are based on large manually-classified data. Additionally, we developed a web-tool, DEMGD, which automates extraction of these associations from free text. DEMGD presents the extracted associations in summary tables and full reports in addition to evidence tagging of text with respect to genes, diseases and methylation words. The methodology we developed in this study can be applied to similar association extraction problems from free text.Conclusion:The new methodology developed in this study allows for efficient identification of associations between concepts. Our method applied to methylated genes in different diseases is implemented as a Web-tool, DEMGD, which is freely available at http://www.cbrc.kaust.edu.sa/demgd/. The data is available for online browsing and download. © 2013 Bin Raies et al.
Directory of Open Access Journals (Sweden)
Arwa Bin Raies
Full Text Available BACKGROUND: In a number of diseases, certain genes are reported to be strongly methylated and thus can serve as diagnostic markers in many cases. Scientific literature in digital form is an important source of information about methylated genes implicated in particular diseases. The large volume of the electronic text makes it difficult and impractical to search for this information manually. METHODOLOGY: We developed a novel text mining methodology based on a new concept of position weight matrices (PWMs for text representation and feature generation. We applied PWMs in conjunction with the document-term matrix to extract with high accuracy associations between methylated genes and diseases from free text. The performance results are based on large manually-classified data. Additionally, we developed a web-tool, DEMGD, which automates extraction of these associations from free text. DEMGD presents the extracted associations in summary tables and full reports in addition to evidence tagging of text with respect to genes, diseases and methylation words. The methodology we developed in this study can be applied to similar association extraction problems from free text. CONCLUSION: The new methodology developed in this study allows for efficient identification of associations between concepts. Our method applied to methylated genes in different diseases is implemented as a Web-tool, DEMGD, which is freely available at http://www.cbrc.kaust.edu.sa/demgd/. The data is available for online browsing and download.
Study on vulnerability matrices of masonry buildings of mainland China
Sun, Baitao; Zhang, Guixin
2018-04-01
The degree and distribution of damage to buildings subjected to earthquakes is a concern of the Chinese Government and the public. Seismic damage data indicates that seismic capacities of different types of building structures in various regions throughout mainland China are different. Furthermore, the seismic capacities of the same type of structure in different regions may vary. The contributions of this research are summarized as follows: 1) Vulnerability matrices and earthquake damage matrices of masonry structures in mainland China were chosen as research samples. The aim was to analyze the differences in seismic capacities of sample matrices and to present general rules for categorizing seismic resistance. 2) Curves relating the percentage of damaged masonry structures with different seismic resistances subjected to seismic demand in different regions of seismic intensity (VI to X) have been developed. 3) A method has been proposed to build vulnerability matrices of masonry structures. The damage ratio for masonry structures under high-intensity events such as the Ms 6.1 Panzhihua earthquake in Sichuan province on 30 August 2008, was calculated to verify the applicability of this method. This research offers a significant theoretical basis for predicting seismic damage and direct loss assessment of groups of buildings, as well as for earthquake disaster insurance.
The Antitriangular Factorization of Saddle Point Matrices
Pestana, J.; Wathen, A. J.
2014-01-01
Mastronardi and Van Dooren [SIAM J. Matrix Anal. Appl., 34 (2013), pp. 173-196] recently introduced the block antitriangular ("Batman") decomposition for symmetric indefinite matrices. Here we show the simplification of this factorization for saddle
Diagonalization of quark mass matrices and the Cabibbo-Kobayashi-Maskawa matrix
International Nuclear Information System (INIS)
Rasin, A.
1997-08-01
I discuss some general aspect of diagonalizing the quark mass matrices and list all possible parametrizations of the Cabibbo-Kobayashi-Maskawa matrix (CKM) in terms of three rotation angles and a phase. I systematically study the relation between the rotations needed to diagonalize the Yukawa matrices and various parametrizations of the CKM. (author). 17 refs, 1 tab
Concrete minimal 3 × 3 Hermitian matrices and some general cases
Directory of Open Access Journals (Sweden)
Klobouk Abel H.
2017-12-01
Full Text Available Given a Hermitian matrix M ∈ M3(ℂ we describe explicitly the real diagonal matrices DM such that ║M + DM║ ≤ ║M + D║ for all real diagonal matrices D ∈ M3(ℂ, where ║ · ║ denotes the operator norm. Moreover, we generalize our techniques to some n × n cases.
Product of Ginibre matrices: Fuss-Catalan and Raney distributions
Penson, Karol A.; Życzkowski, Karol
2011-06-01
Squared singular values of a product of s square random Ginibre matrices are asymptotically characterized by probability distributions Ps(x), such that their moments are equal to the Fuss-Catalan numbers of order s. We find a representation of the Fuss-Catalan distributions Ps(x) in terms of a combination of s hypergeometric functions of the type sFs-1. The explicit formula derived here is exact for an arbitrary positive integer s, and for s=1 it reduces to the Marchenko-Pastur distribution. Using similar techniques, involving the Mellin transform and the Meijer G function, we find exact expressions for the Raney probability distributions, the moments of which are given by a two-parameter generalization of the Fuss-Catalan numbers. These distributions can also be considered as a two-parameter generalization of the Wigner semicircle law.
Nia, Yacine; Mutel, Isabelle; Assere, Adrien; Lombard, Bertrand; Auvray, Frederic; Hennekinne, Jacques-Antoine
2016-04-13
Staphylococcal food poisoning outbreaks are a major cause of foodborne illnesses in Europe and their notifications have been mandatory since 2005. Even though the European regulation on microbiological criteria for food defines a criterion on staphylococcal enterotoxin (SE) only in cheese and dairy products, European Food Safety Authority (EFSA) data reported that various types of food matrices are involved in staphylococcal food poisoning outbreaks. The European Screening Method (ESM) of European Union Reference Laboratory for Coagulase Positive Staphylococci (EURL CPS) was validated in 2011 for SE detection in food matrices and is currently the official method used for screening purposes in Europe. In this context, EURLCPS is annually organizing Inter-Laboratory Proficiency Testing Trials (ILPT) to evaluate the competency of the European countries' National Reference Laboratories (NRLs) to analyse SE content in food matrices. A total of 31 NRLs representing 93% of European countries participated in these ILPTs. Eight food matrices were used for ILPT over the period 2013-2015, including cheese, freeze-dried cheese, tuna, mackerel, roasted chicken, ready-to-eat food, milk, and pastry. Food samples were spiked with four SE types (i.e., SEA, SEC, SED, and SEE) at various concentrations. Homogeneity and stability studies showed that ILPT samples were both homogeneous and stable. The analysis of results obtained by participants for a total of 155 blank and 620 contaminated samples allowed for evaluation of trueness (>98%) and specificity (100%) of ESM. Further to the validation study of ESM carried out in 2011, these three ILPTs allowed for the assessment of the proficiency of the NRL network and the performance of ESM on a large variety of food matrices and samples. The ILPT design presented here will be helpful for the organization of ILPT on SE detection by NRLs or other expert laboratories.
Directory of Open Access Journals (Sweden)
Yacine Nia
2016-04-01
Full Text Available Staphylococcal food poisoning outbreaks are a major cause of foodborne illnesses in Europe and their notifications have been mandatory since 2005. Even though the European regulation on microbiological criteria for food defines a criterion on staphylococcal enterotoxin (SE only in cheese and dairy products, European Food Safety Authority (EFSA data reported that various types of food matrices are involved in staphylococcal food poisoning outbreaks. The European Screening Method (ESM of European Union Reference Laboratory for Coagulase Positive Staphylococci (EURL CPS was validated in 2011 for SE detection in food matrices and is currently the official method used for screening purposes in Europe. In this context, EURLCPS is annually organizing Inter-Laboratory Proficiency Testing Trials (ILPT to evaluate the competency of the European countries’ National Reference Laboratories (NRLs to analyse SE content in food matrices. A total of 31 NRLs representing 93% of European countries participated in these ILPTs. Eight food matrices were used for ILPT over the period 2013–2015, including cheese, freeze-dried cheese, tuna, mackerel, roasted chicken, ready-to-eat food, milk, and pastry. Food samples were spiked with four SE types (i.e., SEA, SEC, SED, and SEE at various concentrations. Homogeneity and stability studies showed that ILPT samples were both homogeneous and stable. The analysis of results obtained by participants for a total of 155 blank and 620 contaminated samples allowed for evaluation of trueness (>98% and specificity (100% of ESM. Further to the validation study of ESM carried out in 2011, these three ILPTs allowed for the assessment of the proficiency of the NRL network and the performance of ESM on a large variety of food matrices and samples. The ILPT design presented here will be helpful for the organization of ILPT on SE detection by NRLs or other expert laboratories.
International Nuclear Information System (INIS)
He Qing; Gong Kai; Gong Yandao; Zhang Xiufang; Ao Qiang; Zhang Lihai; Hu Min
2010-01-01
Chitosan has been widely used for biomaterial scaffolds in tissue engineering because of its good mechanical properties and cytocompatibility. However, the poor blood compatibility of chitosan has greatly limited its biomedical utilization, especially for blood contacting tissue engineering. In this study, we exploited a polymer blending procedure to heparinize the chitosan material under simple and mild conditions to improve its antithrombogenic property. By an optimized procedure, a macroscopically homogeneous chitosan-heparin (Chi-Hep) blended suspension was obtained, with which Chi-Hep composite films and porous scaffolds were fabricated. X-ray photoelectron spectroscopy and sulfur elemental analysis confirmed the successful immobilization of heparin in the composite matrices (i.e. films and porous scaffolds). Toluidine blue staining indicated that heparin was distributed homogeneously in the composite matrices. Only a small amount of heparin was released from the matrices during incubation in normal saline for 10 days. The composite matrices showed improved blood compatibility, as well as good mechanical properties and endothelial cell compatibility. These results suggest that the Chi-Hep composite matrices are promising candidates for blood contacting tissue engineering.
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.
The two-body-problem in quantized, inertia-free mechanics
International Nuclear Information System (INIS)
Kreisel, E.
1984-01-01
There do not exist bound states of the two-particle-system in Riemann-Machian quantum mechanics. The spectrum of the energy is necessarily positively semidefinite and continuous, in analogy to the free particle of quantum mechanics. (author)
Stabilization of chromium-bearing electroplating sludge with MSWI fly ash-based Friedel matrices.
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.
On the dynamics of superstring compactification
Pollock, M. D.
2018-05-01
Compactification of the ten-dimensional heterotic superstring theory to four dimensions gives rise to two moduli potentials VA, VB, the positive semi-definiteness of which places constraints on the Euler characteristic \\bar{χ} of the internal space \\bar{g}_{μν}(y^{ξ}) and the adiabatic index γ of the effective matter source of energy-density ρ and pressure p = (γ -1)ρ that generates the physical four-space g_{ij}(xk), namely \\bar{χ} 0, 1 ≤ γ ≤ 4/3. Here, we show how fermion-bilinear condensation in the internal space, first put forward by Helayël-Neto and Smith, determines the field \\tilde{β} ≡ A_r B_r3, thus reducing the moduli space to a single canonical field \\tilde{σ}=2σB with a potential ˜ , which is positive semi-definite under the same conditions that ensure positive semi-definiteness of VA, VB, and has a minimum at a value of \\tilde{β} that is approximately constant far from the Planck era at t ≫ t_P. The fields σA, σB, which are canonically normalized in the zero-slope limit, are modified by contributions originating from the higher-derivative gravitational terms α^' \\hatR_E2 and α^' 3} \\hatR4, but the associated kinetic energy remains positive for times t ≳ t_P/2, guaranteeing classical stability of the solution, since the generalized indeterminacy principle implies a minimum physically measurable time t0 ≈ 50 t_P for the superstring theory.
International Nuclear Information System (INIS)
Gebert, R.W.; Nicolai, H.
1995-01-01
In this contribution, we summarize a recent attempt to understand hyperbolic Kac Moody algebras in terms of the string vertex operator construction. As is well known, Kac Moody algebras fall into one of three classes corresponding to whether the associated Cartan matrices are positive definite, positive semi-definite and indefinite. Of these, the first two are well understood, leading to finite and affine Lie algebras (the latter being equivalent to current algebras in two space-time dimensions). Virtually nothing is known, however, about the last class of Kac Moody algebras, based on indefinite Cartan matrices. Nonetheless these have been repeatedly suggested as natural candidates for the still elusive fundamental symmetry of string theory (see e.g. [24], [28] for recent proposals in this direction). Being vastly larger than affine Kac Moody algebras, they are certainly ''sufficiently big'' for this purpose, but an even more compelling argument supporting such speculations is the intimate link that exists between Kac Moody algebras and the vertex operator construction of string theory which has been known for a long time. More specifically, it has been established that the elements making up a Kac Moody algebra of finite or affine type can be explicitly realized in terms of tachyon and photon emission vertex operators of a compactified open bosonic string [9], [14]. On the basis of these results, it has been conjectured that Kac Moody algebras of indefinite type might not only furnish new symmetries of string theory, but might themselves be understood in terms of string vertex operators associated with the higher excited (massive) states of a compactified bosonic string [14], [8]. (orig.)
Properties of Zero-Free Transfer Function Matrices
D. O. Anderson, Brian; Deistler, Manfred
Transfer functions of linear, time-invariant finite-dimensional systems with more outputs than inputs, as arise in factor analysis (for example in econometrics), have, for state-variable descriptions with generic entries in the relevant matrices, no finite zeros. This paper gives a number of characterizations of such systems (and indeed square discrete-time systems with no zeros), using state-variable, impulse response, and matrix-fraction descriptions. Key properties include the ability to recover the input values at any time from a bounded interval of output values, without any knowledge of an initial state, and an ability to verify the no-zero property in terms of a property of the impulse response coefficient matrices. Results are particularized to cases where the transfer function matrix in question may or may not have a zero at infinity or a zero at zero.
Sports drug testing using complementary matrices: Advantages and limitations.
Thevis, Mario; Geyer, Hans; Tretzel, Laura; Schänzer, Wilhelm
2016-10-25
Today, routine doping controls largely rely on testing whole blood, serum, and urine samples. These matrices allow comprehensively covering inorganic as well as low and high molecular mass organic analytes relevant to doping controls and are collecting and transferring from sampling sites to accredited anti-doping laboratories under standardized conditions. Various aspects including time and cost-effectiveness as well as intrusiveness and invasiveness of the sampling procedure but also analyte stability and breadth of the contained information have been motivation to consider and assess values potentially provided and added to modern sports drug testing programs by alternative matrices. Such alternatives could be dried blood spots (DBS), dried plasma spots (DPS), oral fluid (OF), exhaled breath (EB), and hair. In this review, recent developments and test methods concerning these alternative matrices and expected or proven contributions as well as limitations of these specimens in the context of the international anti-doping fight are presented and discussed, guided by current regulations for prohibited substances and methods of doping as established by the World Anti-Doping Agency (WADA). Focusing on literature published between 2011 and 2015, examples for doping control analytical assays concerning non-approved substances, anabolic agents, peptide hormones/growth factors/related substances and mimetics, β 2 -agonists, hormone and metabolic modulators, diuretics and masking agents, stimulants, narcotics, cannabinoids, glucocorticoids, and beta-blockers were selected to outline the advantages and limitations of the aforementioned alternative matrices as compared to conventional doping control samples (i.e. urine and blood/serum). Copyright © 2016 Elsevier B.V. All rights reserved.
Flach, J.; van der Waal, M.B.; van den Nieuwboer, M.; Claassen, H.J.H.M.; Larsen, O.F.A.
2017-01-01
Full Article Figures & data References Supplemental Citations Metrics Reprints & Permissions PDF ABSTRACT 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,
International Nuclear Information System (INIS)
Wang, RuLin; Zheng, Xiao; Kwok, YanHo; Xie, Hang; Chen, GuanHua; Yam, ChiYung
2015-01-01
Understanding electronic dynamics on material surfaces is fundamentally important for applications including nanoelectronics, inhomogeneous catalysis, and photovoltaics. Practical approaches based on time-dependent density functional theory for open systems have been developed to characterize the dissipative dynamics of electrons in bulk materials. The accuracy and reliability of such approaches depend critically on how the electronic structure and memory effects of surrounding material environment are accounted for. In this work, we develop a novel squared-Lorentzian decomposition scheme, which preserves the positive semi-definiteness of the environment spectral matrix. The resulting electronic dynamics is guaranteed to be both accurate and convergent even in the long-time limit. The long-time stability of electronic dynamics simulation is thus greatly improved within the current decomposition scheme. The validity and usefulness of our new approach are exemplified via two prototypical model systems: quasi-one-dimensional atomic chains and two-dimensional bilayer graphene
Wang, RuLin; Zheng, Xiao; Kwok, YanHo; Xie, Hang; Chen, GuanHua; Yam, ChiYung
2015-04-14
Understanding electronic dynamics on material surfaces is fundamentally important for applications including nanoelectronics, inhomogeneous catalysis, and photovoltaics. Practical approaches based on time-dependent density functional theory for open systems have been developed to characterize the dissipative dynamics of electrons in bulk materials. The accuracy and reliability of such approaches depend critically on how the electronic structure and memory effects of surrounding material environment are accounted for. In this work, we develop a novel squared-Lorentzian decomposition scheme, which preserves the positive semi-definiteness of the environment spectral matrix. The resulting electronic dynamics is guaranteed to be both accurate and convergent even in the long-time limit. The long-time stability of electronic dynamics simulation is thus greatly improved within the current decomposition scheme. The validity and usefulness of our new approach are exemplified via two prototypical model systems: quasi-one-dimensional atomic chains and two-dimensional bilayer graphene.
Schneider, Hans
1989-01-01
Linear algebra is one of the central disciplines in mathematics. A student of pure mathematics must know linear algebra if he is to continue with modern algebra or functional analysis. Much of the mathematics now taught to engineers and physicists requires it.This well-known and highly regarded text makes the subject accessible to undergraduates with little mathematical experience. Written mainly for students in physics, engineering, economics, and other fields outside mathematics, the book gives the theory of matrices and applications to systems of linear equations, as well as many related t
Fast index based algorithms and software for matching position specific scoring matrices
Directory of Open Access Journals (Sweden)
Homann Robert
2006-08-01
Full Text Available Abstract Background In biological sequence analysis, position specific scoring matrices (PSSMs are widely used to represent sequence motifs in nucleotide as well as amino acid sequences. Searching with PSSMs in complete genomes or large sequence databases is a common, but computationally expensive task. Results We present a new non-heuristic algorithm, called ESAsearch, to efficiently find matches of PSSMs in large databases. Our approach preprocesses the search space, e.g., a complete genome or a set of protein sequences, and builds an enhanced suffix array that is stored on file. This allows the searching of a database with a PSSM in sublinear expected time. Since ESAsearch benefits from small alphabets, we present a variant operating on sequences recoded according to a reduced alphabet. We also address the problem of non-comparable PSSM-scores by developing a method which allows the efficient computation of a matrix similarity threshold for a PSSM, given an E-value or a p-value. Our method is based on dynamic programming and, in contrast to other methods, it employs lazy evaluation of the dynamic programming matrix. We evaluated algorithm ESAsearch with nucleotide PSSMs and with amino acid PSSMs. Compared to the best previous methods, ESAsearch shows speedups of a factor between 17 and 275 for nucleotide PSSMs, and speedups up to factor 1.8 for amino acid PSSMs. Comparisons with the most widely used programs even show speedups by a factor of at least 3.8. Alphabet reduction yields an additional speedup factor of 2 on amino acid sequences compared to results achieved with the 20 symbol standard alphabet. The lazy evaluation method is also much faster than previous methods, with speedups of a factor between 3 and 330. Conclusion Our analysis of ESAsearch reveals sublinear runtime in the expected case, and linear runtime in the worst case for sequences not shorter than |A MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92Aae
Inversion of General Cyclic Heptadiagonal Matrices
Directory of Open Access Journals (Sweden)
A. A. Karawia
2013-01-01
Full Text Available We describe a reliable symbolic computational algorithm for inverting general cyclic heptadiagonal matrices by using parallel computing along with recursion. The computational cost of it is operations. The algorithm is implementable to the Computer Algebra System (CAS such as MAPLE, MATLAB, and MATHEMATICA. Two examples are presented for the sake of illustration.
Critical statistics for non-Hermitian matrices
International Nuclear Information System (INIS)
Garcia-Garcia, A.M.; Verbaarschot, J.J.M.; Nishigaki, S.M.
2002-01-01
We introduce a generalized ensemble of non-Hermitian matrices interpolating between the Gaussian Unitary Ensemble, the Ginibre ensemble, and the Poisson ensemble. The joint eigenvalue distribution of this model is obtained by means of an extension of the Itzykson-Zuber formula to general complex matrices. Its correlation functions are studied both in the case of weak non-Hermiticity and in the case of strong non-Hermiticity. In the weak non-Hermiticity limit we show that the spectral correlations in the bulk of the spectrum display critical statistics: the asymptotic linear behavior of the number variance is already approached for energy differences of the order of the eigenvalue spacing. To lowest order, its slope does not depend on the degree of non-Hermiticity. Close the edge, the spectral correlations are similar to the Hermitian case. In the strong non-Hermiticity limit the crossover behavior from the Ginibre ensemble to the Poisson ensemble first appears close to the surface of the spectrum. Our model may be relevant for the description of the spectral correlations of an open disordered system close to an Anderson transition
Lacerda, Kássio André; Lameiras, Fernando Soares; Silva, Viviane Viana
2007-01-01
In this study, non-radioactive iodine was incorporated in two types of biodegradable hydroxyapatite-based porous matrices (HA and HACL) through impregnation process from sodium iodine aqueous solutions with varying concentrations (0.5 and 1.0 mol/L) . The results revealed that both systems presented a high capacity of incorporating iodine into their matrices. The quantity of incorporated iodine was measured through Neutron Activation Analysis (NAA). The porous ceramic matrices based on hydrox...
Classification of mass matrices and the calculability of the Cabibbo angle
International Nuclear Information System (INIS)
Rizzo, T.G.
1981-01-01
We have analyzed all possible 2 x 2 mass matrices with two nonzero elements in an attempt to find which matrices yield a reasonable value of the Cabibbo angle upon diagonalization. We do not concern ourselves with the origin of these mass matrices (spontaneous symmetry breaking, bare-mass term, etc.). We find that, in the limit m/sub u//m/sub c/→0, only four possible relationships exist between sin 2 theta/sub C/ and the quark mass ratio m/sub d//m/sub s/, only one of which is reasonable for the usual value of m/sub d//m/sub s/ (approx.1/20). This limits the possible forms of the quark mass matrix to be two in number, both of which have been discussed previously in the literature
Physical properties of the Schur complement of local covariance matrices
International Nuclear Information System (INIS)
Haruna, L F; Oliveira, M C de
2007-01-01
General properties of global covariance matrices representing bipartite Gaussian states can be decomposed into properties of local covariance matrices and their Schur complements. We demonstrate that given a bipartite Gaussian state ρ 12 described by a 4 x 4 covariance matrix V, the Schur complement of a local covariance submatrix V 1 of it can be interpreted as a new covariance matrix representing a Gaussian operator of party 1 conditioned to local parity measurements on party 2. The connection with a partial parity measurement over a bipartite quantum state and the determination of the reduced Wigner function is given and an operational process of parity measurement is developed. Generalization of this procedure to an n-partite Gaussian state is given, and it is demonstrated that the n - 1 system state conditioned to a partial parity projection is given by a covariance matrix such that its 2 x 2 block elements are Schur complements of special local matrices
Stabilization and solidification of Pb in cement matrices
International Nuclear Information System (INIS)
Gollmann, Maria A.C.; Silva, Marcia M. da; Santos, Joao H. Z. dos; Masuero, Angela B.
2010-01-01
Pb was incorporated to a series of cement matrices, which were submitted to different cure time and pH. Pb content leached to aqueous solution was monitored by atomic absorption spectroscopy. The block resistance was evaluated by unconfined compressive strength at 7 and 28 ages. Data are discussed in terms of metal mobility along the cement block monitored by X-ray fluorescence (XRF) spectrometry. The Pb incorporated matrices have shown that a long cure time is more suitable for avoiding metal leaching. For a longer cure period the action of the metal is higher and there is a decreasing in the compressive strength. The XRF analyses show that there is a lower Ca concentration in the matrix in which Pb was added. (author)
Preconditioners for regularized saddle point matrices
Czech Academy of Sciences Publication Activity Database
Axelsson, Owe
2011-01-01
Roč. 19, č. 2 (2011), s. 91-112 ISSN 1570-2820 Institutional research plan: CEZ:AV0Z30860518 Keywords : saddle point matrices * preconditioning * regularization * eigenvalue clustering Subject RIV: BA - General Mathematics Impact factor: 0.533, year: 2011 http://www.degruyter.com/view/j/jnma.2011.19.issue-2/jnum.2011.005/jnum.2011.005. xml
Vingerhoets, Wilhelmina A. M.; Bloemen, Oswald J. N.; Bakker, Geor; van Amelsvoort, Therese A. M. J.
2013-01-01
Schizophrenia is a disabling, chronic psychiatric disorder with a prevalence rate of 0.5–1% in the general population. Symptoms include positive (e.g., delusions, hallucinations), negative (e.g., blunted affect, social withdrawal), as well as cognitive symptoms (e.g., memory and attention problems). Although 75–85% of patients with schizophrenia report cognitive impairments, the underlying neuropharmacological mechanisms are not well understood and currently no effective treatment is available for these impairments. This has led to the Measurement and Treatment Research to Improve Cognition in Schizophrenia (MATRICS) initiative, which established seven cognitive domains that are fundamentally impaired in schizophrenia. These domains include verbal learning and memory, visual learning and memory, working memory, attention and vigilance, processing speed, reasoning and problem solving, and social cognition. Recently, a growing number of studies have been conducted trying to identify the underlying neuropharmacological mechanisms of cognitive impairments in schizophrenia patients. Specific cognitive impairments seem to arise from different underlying neuropharmacological mechanisms. However, most review articles describe cognition in general and an overview of the mechanisms involved in these seven separate cognitive domains is currently lacking. Therefore, we reviewed the underlying neuropharmacological mechanisms focusing on the domains as established by the MATRICS initiative which are considered most crucial in schizophrenia. PMID:24363646
Characteristic Polynomials of Sample Covariance Matrices: The Non-Square Case
Kösters, Holger
2009-01-01
We consider the sample covariance matrices of large data matrices which have i.i.d. complex matrix entries and which are non-square in the sense that the difference between the number of rows and the number of columns tends to infinity. We show that the second-order correlation function of the characteristic polynomial of the sample covariance matrix is asymptotically given by the sine kernel in the bulk of the spectrum and by the Airy kernel at the edge of the spectrum. Similar results are g...
Reliability and Validity of Colored Progressive Matrices for 4-6 Age Children
Directory of Open Access Journals (Sweden)
Ahmet Bildiren
2017-06-01
Full Text Available In this research, it was aimed to test the reliability and validity of Colored Progressive Matrices for children between the ages of 4 to 6 from 15 schools. The sample of the study consisted of 640 kindergarten children. Test-retest and parallel form were used for reliability analyses. For the validity analysis, the relations between the Colored Progressive Matrices Test and Bender Gestalt Visual Motor Sensitivity Test, WISC-R and TONI-3 tests were examined. The results showed that there was a significant relation between the test-retest results and the parallel forms in all the age groups. Validity analyses showed strong correlations between the Colored Progressive Matrices and all the other measures.
Unified triminimal parametrizations of quark and lepton mixing matrices
International Nuclear Information System (INIS)
He Xiaogang; Li Shiwen; Ma Boqiang
2009-01-01
We present a detailed study on triminimal parametrizations of quark and lepton mixing matrices with different basis matrices. We start with a general discussion on the triminimal expansion of the mixing matrix and on possible unified quark and lepton parametrization using quark-lepton complementarity. We then consider several interesting basis matrices and compare the triminimal parametrizations with the Wolfenstein-like parametrizations. The usual Wolfenstein parametrization for quark mixing is a triminimal expansion around the unit matrix as the basis. The corresponding quark-lepton complementarity lepton mixing matrix is a triminimal expansion around the bimaximal basis. Current neutrino oscillation data show that the lepton mixing matrix is very well represented by the tribimaximal mixing. It is natural to take it as an expanding basis. The corresponding zeroth order basis for quark mixing in this case makes the triminimal expansion converge much faster than the usual Wolfenstein parametrization. The triminimal expansion based on tribimaximal mixing can be converted to the Wolfenstein-like parametrizations discussed in the literature. We thus have a unified description between different kinds of parametrizations for quark and lepton sectors: the standard parametrizations, the Wolfenstein-like parametrizations, and the triminimal parametrizations.
Raven's matrices and working memory: a dual-task approach.
Rao, K Venkata; Baddeley, Alan
2013-01-01
Raven's Matrices Test was developed as a "pure" measure of Spearman's concept of general intelligence, g. Subsequent research has attempted to specify the processes underpinning performance, some relating it to the concept of working memory and proposing a crucial role for the central executive, with the nature of other components currently unclear. Up to this point, virtually all work has been based on correlational analysis of number of correct solutions, sometimes related to possible strategies. We explore the application to this problem of the concurrent task methodology used widely in developing the concept of multicomponent working memory. Participants attempted to solve problems from the matrices under baseline conditions, or accompanied by backward counting or verbal repetition tasks, assumed to disrupt the central executive and phonological loop components of working memory, respectively. As in other uses of this method, number of items correct showed little effect, while solution time measures gave very clear evidence of an important role for the central executive, but no evidence for phonological loop involvement. We conclude that this and related concurrent task techniques hold considerable promise for the analysis of Raven's matrices and potentially for other established psychometric tests.
Products of random matrices from fixed trace and induced Ginibre ensembles
Akemann, Gernot; Cikovic, Milan
2018-05-01
We investigate the microcanonical version of the complex induced Ginibre ensemble, by introducing a fixed trace constraint for its second moment. Like for the canonical Ginibre ensemble, its complex eigenvalues can be interpreted as a two-dimensional Coulomb gas, which are now subject to a constraint and a modified, collective confining potential. Despite the lack of determinantal structure in this fixed trace ensemble, we compute all its density correlation functions at finite matrix size and compare to a fixed trace ensemble of normal matrices, representing a different Coulomb gas. Our main tool of investigation is the Laplace transform, that maps back the fixed trace to the induced Ginibre ensemble. Products of random matrices have been used to study the Lyapunov and stability exponents for chaotic dynamical systems, where the latter are based on the complex eigenvalues of the product matrix. Because little is known about the universality of the eigenvalue distribution of such product matrices, we then study the product of m induced Ginibre matrices with a fixed trace constraint—which are clearly non-Gaussian—and M ‑ m such Ginibre matrices without constraint. Using an m-fold inverse Laplace transform, we obtain a concise result for the spectral density of such a mixed product matrix at finite matrix size, for arbitrary fixed m and M. Very recently local and global universality was proven by the authors and their coworker for a more general, single elliptic fixed trace ensemble in the bulk of the spectrum. Here, we argue that the spectral density of mixed products is in the same universality class as the product of M independent induced Ginibre ensembles.
International Nuclear Information System (INIS)
Jarlskog, C.; Stockholm Univ.; Bergen Univ.
1985-01-01
In the standard electroweak model, with three families, a one-to-one correspondence between certain determinants involving quark mass matrices (m and m' for charge 2/3 and -1/3 quarks respectively) and the presence/absence of CP violation is given. In an arbitrary basis for mass matrices, the quantity Im det[mm + , m'm' + ] appropriately normalized is introduced as a measure of CP violation. By this measure, CP is not maximally violated in any transition in Nature. Finally, constraints on quark mass matrices are derived from experiment. Any model of mass matrices, with the ambition to explain Nature, must satisfy these conditions. (orig.)
Dense tissue-like collagen matrices formed in cell-free conditions.
Mosser, Gervaise; Anglo, Anny; Helary, Christophe; Bouligand, Yves; Giraud-Guille, Marie-Madeleine
2006-01-01
A new protocol was developed to produce dense organized collagen matrices hierarchically ordered on a large scale. It consists of a two stage process: (1) the organization of a collagen solution and (2) the stabilization of the organizations by a sol-gel transition that leads to the formation of collagen fibrils. This new protocol relies on the continuous injection of an acid-soluble collagen solution into glass microchambers. It leads to extended concentration gradients of collagen, ranging from 5 to 1000 mg/ml. The self-organization of collagen solutions into a wide array of spatial organizations was investigated. The final matrices obtained by this procedure varied in concentration, structure and density. Changes in the liquid state of the samples were followed by polarized light microscopy, and the final stabilized gel states obtained after fibrillogenesis were analyzed by both light and electron microscopy. Typical organizations extended homogeneously by up to three centimetres in one direction and several hundreds of micrometers in other directions. Fibrillogenesis of collagen solutions of high and low concentrations led to fibrils spatially arranged as has been described in bone and derm, respectively. Moreover, a relationship was revealed between the collagen concentration and the aggregation of and rotational angles between lateral fibrils. These results constitute a strong base from which to further develop highly enriched collagen matrices that could lead to substitutes that mimic connective tissues. The matrices thus obtained may also be good candidates for the study of the three-dimensional migration of cells.
Classical r-matrices for the generalised Chern–Simons formulation of 3d gravity
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.
Directory of Open Access Journals (Sweden)
TANG Ying
2017-01-01
Full Text Available One of the research hotspots in the field of high-temperature alloys was to search the substitutional elements for Re in order to prepare the single-crystal Ni-based superalloys with less or even no Re addition. To find the elements with similar or even lower diffusion coefficients in comparison with that of Re was one of the effective strategies. In multicomponent alloys, the interdiffusivity matrix were used to comprehensively characterize the diffusion ability of any alloying elements. Therefore, accurate determination of the composition-dependant and temperature-dependent interdiffusivities matrices of different elements in γ and γ' phases of Ni-based superalloys was high priority. The paper briefly introduces of the status of the interdiffusivity matrices determination in Ni-based superalloys, and the methods for determining the interdiffusivities in multicomponent alloys, including the traditional Matano-Kirkaldy method and recently proposed numerical inverse method. Because the traditional Matano-Kirkaldy method is of low efficiency, the experimental reports on interdiffusivity matrices in ternary and higher order sub-systems of the Ni-based superalloys were very scarce in the literature. While the numerical inverse method newly proposed in our research group based on Fick's second law can be utilized for high-throughput measurement of accurate interdiffusivity matrices in alloys with any number of components. After that, the successful application of the numerical inverse method in the high-throughput measurement of interdiffusivity matrices in alloys is demonstrated in fcc (γ phase of the ternary Ni-Al-Ta system. Moreover, the validation of the resulting composition-dependant and temperature-dependent interdiffusivity matrices is also comprehensively made. Then, this paper summarizes the recent progress in the measurement of interdiffusivity matrices in γ and γ' phases of a series of core ternary Ni-based superalloys achieved in
Characteristics of phosphorus adsorption by sediment mineral matrices with different particle sizes
Directory of Open Access Journals (Sweden)
Yang Xiao
2013-07-01
Full Text Available The particle size of sediment is one of the main factors that influence the phosphorus physical adsorption on sediment. In order to eliminate the effect of other components of sediment on the phosphorus physical adsorption the sediment mineral matrices were obtained by removing inorganic matter metal oxides, and organic matter from natural sediments, which were collected from the Nantong reach of the Yangtze River. The results show that an exponential relationship exists between the median particle size (D50 and specific surface area (Sg of the sediment mineral matrices, and the fine sediment mineral matrix sample has a larger specific surface area and pore volume than the coarse sediment particles. The kinetic equations were used to describe the phosphorus adsorption process of the sediment mineral matrices, including the Elovich equation, quasi-first-order adsorption kinetic equation, and quasi-second-order adsorption kinetic equation. The results show that the quasi-second-order adsorption kinetic equation has the best fitting effect. Using the mass conservation and Langmuir adsorption kinetic equations, a formula was deduced to calculate the equilibrium adsorption capacity of the sediment mineral matrices. The results of this study show that the phosphorus adsorption capacity decreases with the increase of D50, indicating that the specific surface area and pore volume are the main factors in determining the phosphorus adsorption capacity of the sediment mineral matrices. This study will help understand the important role of sediment in the transformation of phosphorus in aquatic environments.
Dimension from covariance matrices.
Carroll, T L; Byers, J M
2017-02-01
We describe a method to estimate embedding dimension from a time series. This method includes an estimate of the probability that the dimension estimate is valid. Such validity estimates are not common in algorithms for calculating the properties of dynamical systems. The algorithm described here compares the eigenvalues of covariance matrices created from an embedded signal to the eigenvalues for a covariance matrix of a Gaussian random process with the same dimension and number of points. A statistical test gives the probability that the eigenvalues for the embedded signal did not come from the Gaussian random process.
Moment matrices, border bases and radical computation
B. Mourrain; J.B. Lasserre; M. Laurent (Monique); P. Rostalski; P. Trebuchet (Philippe)
2013-01-01
htmlabstractIn this paper, we describe new methods to compute the radical (resp. real radical) of an ideal, assuming it complex (resp. real) variety is nte. The aim is to combine approaches for solving a system of polynomial equations with dual methods which involve moment matrices and
Moment matrices, border bases and radical computation
B. Mourrain; J.B. Lasserre; M. Laurent (Monique); P. Rostalski; P. Trebuchet (Philippe)
2011-01-01
htmlabstractIn this paper, we describe new methods to compute the radical (resp. real radical) of an ideal, assuming it complex (resp. real) variety is nte. The aim is to combine approaches for solving a system of polynomial equations with dual methods which involve moment matrices and
Directory of Open Access Journals (Sweden)
Fabiana T. Rodrigues
2010-06-01
Full Text Available In this work, the modifications promoted by alkaline hydrolysis and glutaraldehyde (GA crosslinking on type I collagen found in porcine skin have been studied. Collagen matrices were obtained from the alkaline hydrolysis of porcine skin, with subsequent GA crosslinking in different concentrations and reaction times. The elastin content determination showed that independent of the treatment, elastin was present in the matrices. Results obtained from in vitro trypsin degradation indicated that with the increase of GA concentration and reaction time, the degradation rate decreased. From thermogravimetry and differential scanning calorimetry analysis it can be observed that the collagen in the matrices becomes more resistant to thermal degradation as a consequence of the increasing crosslink degree. Scanning electron microscopy analysis indicated that after the GA crosslinking, collagen fibers become more organized and well-defined. Therefore, the preparations of porcine skin matrices with different degradation rates, which can be used in soft tissue reconstruction, are viable.
Introduction to random matrices theory and practice
Livan, Giacomo; Vivo, Pierpaolo
2018-01-01
Modern developments of Random Matrix Theory as well as pedagogical approaches to the standard core of the discipline are surprisingly hard to find in a well-organized, readable and user-friendly fashion. This slim and agile book, written in a pedagogical and hands-on style, without sacrificing formal rigor fills this gap. It brings Ph.D. students in Physics, as well as more senior practitioners, through the standard tools and results on random matrices, with an eye on most recent developments that are not usually covered in introductory texts. The focus is mainly on random matrices with real spectrum. The main guiding threads throughout the book are the Gaussian Ensembles. In particular, Wigner’s semicircle law is derived multiple times to illustrate several techniques (e.g., Coulomb gas approach, replica theory). Most chapters are accompanied by Matlab codes (stored in an online repository) to guide readers through the numerical check of most analytical results.
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.
Directory of Open Access Journals (Sweden)
Zimmermann Karel
2010-01-01
Full Text Available Abstract Background 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. Results 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. Conclusions 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.
Energy Technology Data Exchange (ETDEWEB)
Lacerda, Kassio Andre; Lameiras, Fernando Soares [Centro de Desenvolvimento da Tecnologia Nuclear, (CDTN/CNEN-MG), Belo Horizonte, MG (Brazil); Silva, Viviane Viana [Centro de Desenvolvimento da Tecnologia Nuclear, (CDTN/CNEN-MG), Belo Horizonte, MG (Brazil); Universidade Vale do Rio Verde de Tres Coracoes, MG (Brazil)
2007-07-15
In this study, non-radioactive iodine was incorporated in two types of biodegradable hydroxyapatite-based porous matrices (HA and HACL) through impregnation process from sodium iodine aqueous solutions with varying concentrations (0.5 and 1.0 mol/L) . The results revealed that both systems presented a high capacity of incorporating iodine into their matrices. The quantity of incorporated iodine was measured through Neutron Activation Analysis (NAA). The porous ceramic matrices based on hydroxyapatite demonstrated a great potential for uses in low dose rate (LDR) brachytherapy. (author)
Two-level preconditioned conjugate gradient methods with applications to bubbly flow problems
Tang, J.M.
2008-01-01
The Preconditioned Conjugate Gradient (PCG) method is one of the most popular iterative methods for solving large linear systems with a symmetric and positive semi-definite coefficient matrix. However, if the preconditioned coefficient matrix is ill-conditioned, the convergence of the PCG method
Generation speed in Raven's Progressive Matrices Test
Verguts, T.; Boeck, P. De; Maris, E.G.G.
1999-01-01
In this paper, we investigate the role of response fluency on a well-known intelligence test, Raven's (1962) Advanced Progressive Matrices (APM) test. Critical in solving this test is finding rules that govern the items. Response fluency is conceptualized as generation speed or the speed at which a
Interactions between Food Additive Silica Nanoparticles and Food Matrices
Directory of Open Access Journals (Sweden)
Mi-Ran Go
2017-06-01
Full Text Available Nanoparticles (NPs have been widely utilized in the food industry as additives with their beneficial characteristics, such as improving sensory property and processing suitability, enhancing functional and nutritional values, and extending shelf-life of foods. Silica is used as an anti-caking agent to improve flow property of powered ingredients and as a carrier for flavors or active compounds in food. Along with the rapid development of nanotechnology, the sizes of silica fall into nanoscale, thereby raising concerns about the potential toxicity of nano-sized silica materials. There have been a number of studies carried out to investigate possible adverse effects of NPs on the gastrointestinal tract. The interactions between NPs and surrounding food matrices should be also taken into account since the interactions can affect their bioavailability, efficacy, and toxicity. In the present study, we investigated the interactions between food additive silica NPs and food matrices, such as saccharides, proteins, lipids, and minerals. Quantitative analysis was performed to determine food component-NP corona using HPLC, fluorescence quenching, GC-MS, and ICP-AES. The results demonstrate that zeta potential and hydrodynamic radius of silica NPs changed in the presence of all food matrices, but their solubility was not affected. However, quantitative analysis on the interactions revealed that a small portion of food matrices interacted with silica NPs and the interactions were highly dependent on the type of food component. Moreover, minor nutrients could also affect the interactions, as evidenced by higher NP interaction with honey rather than with a simple sugar mixture containing an equivalent amount of fructose, glucose, sucrose, and maltose. These findings provide fundamental information to extend our understanding about the interactions between silica NPs and food components and to predict the interaction effect on the safety aspects of food
International Nuclear Information System (INIS)
Samanta, Archana; Takkar, Sonam; Kulshreshtha, Ritu; Nandan, Bhanu; Srivastava, Rajiv K.
2016-01-01
The production of composite electrospun matrices of poly(ε-caprolactone) (PCL) using an emulsifier-free emulsion, made with minimal organic solvent, as precursor is reported. Pickering emulsions of PCL were prepared using modified montmorillonite (MMT) clay as the stabilizer. Hydrophobic tallow group of the modified MMT clay resulted in analogous interaction of clay with oil and aqueous phase and its adsorption at the interface to provide stability to the resultant emulsion. Composite fibrous matrices of PCL and MMT were produced using electrospinning under controlled conditions. The fiber fineness was found to alter with PCL concentration and volume fraction of the aqueous and oil phases. A higher tensile strength and modulus was obtained with inclusion of MMT in PCL electrospun matrix in comparison to a matrix made using neat PCL. The presence of clay in the fibrous matrix did not change the cell proliferation efficiency in comparison to neat PCL matrix. Composite fibrous matrices of PCL/MMT bearing enhanced tensile properties may find applications in areas other than tissue engineering for example food packaging and filtration. - Highlights: • Tenside free, clay stabilized Pickering emulsion of PCL is made with minimal organic solvent. • Organic–inorganic composite fibrous matrices were produced via emulsion electrospinning. • Fiber fineness was efficiently controlled by variation in emulsion formulation. • Fibrous matrices of high tensile strength and modulus were obtained in comparison to neat PCL matrix. • PCL/clay matrices showed effective cell proliferation as a neat PCL matrix.
Energy Technology Data Exchange (ETDEWEB)
Samanta, Archana [Department of Textile Technology, Indian Institute of Technology Delhi, Hauz Khas, New Delhi 110016 (India); Takkar, Sonam; Kulshreshtha, Ritu [Department of Biochemical Engineering and Biotechnology, Indian Institute of Technology Delhi, Hauz Khas, New Delhi 110016 (India); Nandan, Bhanu [Department of Textile Technology, Indian Institute of Technology Delhi, Hauz Khas, New Delhi 110016 (India); Srivastava, Rajiv K., E-mail: rajiv@textile.iitd.ac.in [Department of Textile Technology, Indian Institute of Technology Delhi, Hauz Khas, New Delhi 110016 (India)
2016-12-01
The production of composite electrospun matrices of poly(ε-caprolactone) (PCL) using an emulsifier-free emulsion, made with minimal organic solvent, as precursor is reported. Pickering emulsions of PCL were prepared using modified montmorillonite (MMT) clay as the stabilizer. Hydrophobic tallow group of the modified MMT clay resulted in analogous interaction of clay with oil and aqueous phase and its adsorption at the interface to provide stability to the resultant emulsion. Composite fibrous matrices of PCL and MMT were produced using electrospinning under controlled conditions. The fiber fineness was found to alter with PCL concentration and volume fraction of the aqueous and oil phases. A higher tensile strength and modulus was obtained with inclusion of MMT in PCL electrospun matrix in comparison to a matrix made using neat PCL. The presence of clay in the fibrous matrix did not change the cell proliferation efficiency in comparison to neat PCL matrix. Composite fibrous matrices of PCL/MMT bearing enhanced tensile properties may find applications in areas other than tissue engineering for example food packaging and filtration. - Highlights: • Tenside free, clay stabilized Pickering emulsion of PCL is made with minimal organic solvent. • Organic–inorganic composite fibrous matrices were produced via emulsion electrospinning. • Fiber fineness was efficiently controlled by variation in emulsion formulation. • Fibrous matrices of high tensile strength and modulus were obtained in comparison to neat PCL matrix. • PCL/clay matrices showed effective cell proliferation as a neat PCL matrix.
The Inverse of Banded Matrices
2013-01-01
indexed entries all zeros. In this paper, generalizing a method of Mallik (1999) [5], we give the LU factorization and the inverse of the matrix Br,n (if it...r ≤ i ≤ r, 1 ≤ j ≤ r, with the remaining un-indexed entries all zeros. In this paper generalizing a method of Mallik (1999) [5...matrices and applications to piecewise cubic approximation, J. Comput. Appl. Math. 8 (4) (1982) 285–288. [5] R.K. Mallik , The inverse of a lower
Transfer matrices for multilayer structures
International Nuclear Information System (INIS)
Baquero, R.
1988-08-01
We consider four of the transfer matrices defined to deal with multilayer structures. We deduce algorithms to calculate them numerically, in a simple and neat way. We illustrate their application to semi-infinite systems using SGFM formulae. These algorithms are of fast convergence and allow a calculation of bulk-, surface- and inner-layers band structure in good agreement with much more sophisticated calculations. Supermatrices, interfaces and multilayer structures can be calculated in this way with a small computational effort. (author). 10 refs
Synthesised standards in natural matrices
International Nuclear Information System (INIS)
Olsen, D.G.
1980-01-01
The problem of securing the most reliable standards for the accurate analysis of radionuclides is discussed in the paper and in the comment on the paper. It is contended in the paper that the best standards can be created by quantitative addition of accurately known spiking solutions into carefully selected natural matrices. On the other hand it is argued that many natural materials can be successfully standardized for numerous trace constituents. Both points of view are supported with examples. (U.K.)
NEW SPECTRAL STATISTICS FOR ENSEMBLES OF 2 × 2 REAL SYMMETRIC RANDOM MATRICES
Directory of Open Access Journals (Sweden)
Sachin Kumar
2017-12-01
Full Text Available We investigate spacing statistics for ensembles of various real random matrices where the matrix-elements have various Probability Distribution Function (PDF: f(x including Gaussian. For two modifications of 2 × 2 matrices with various PDFs, we derive the spacing distributions p(s of adjacent energy eigenvalues. Nevertheless, they show the linear level repulsion near s = 0 as αs where α depends on the choice of the PDF. More interestingly when f(x = xe−x2 (f(0 = 0, we get cubic level repulsion near s = 0: p(s ~ s3e−s2.We also derive the distribution of eigenvalues D(ε for these matrices.
Directory of Open Access Journals (Sweden)
Zhaolin Jiang
2014-01-01
Full Text Available Circulant matrices play an important role in solving delay differential equations. In this paper, circulant type matrices including the circulant and left circulant and g-circulant matrices with any continuous Fibonacci and Lucas numbers are considered. Firstly, the invertibility of the circulant matrix is discussed and the explicit determinant and the inverse matrices by constructing the transformation matrices are presented. Furthermore, the invertibility of the left circulant and g-circulant matrices is also studied. We obtain the explicit determinants and the inverse matrices of the left circulant and g-circulant matrices by utilizing the relationship between left circulant, g-circulant matrices and circulant matrix, respectively.
International Nuclear Information System (INIS)
Michalik, J.; Kevan, L.
1978-01-01
The electron spin-lattice relaxation of trapped silver atoms in polycrystalline ice matrices and in methanol, ethanol, propylene carbonate, and 2-methyltetrahydrofuran organic glasses has been directly studied as a function of temperature by the saturation-recovery method. Below 40 K the dominant electron spin-lattice relaxation mechanism involves modulation of the electron nuclear dipolar interaction with nuclei in the radical's environment by tunneling of those nuclei between two nearly equal energy configurations. This relaxation mechanism occurs with high efficiency, has a characteristic linear temperature dependence, and is typically found in highly disordered matrices. The efficiency of this relaxation mechanism seems to decrease with decreasing polarity of the matrix. Deuteration experiments show that the tunneling nuclei are protons and in methanol it is shown that the methyl protons have more tunneling modes available than the hydroxyl protons. In polycrystalline ice matrices silver atoms can be stabilized with two different orientations of surrounding water molecules; the efficiency of the tunneling relaxation reflects this difference. From these and previous results on tunneling relaxation of trapped electrons in glassy matrices it appears that tunneling relaxation may be used to distinguish models with different geometrical configurations and to determine the relative rigidity of such configurations around trapped radicals in disordered solids. (author)
Intermittency and random matrices
Sokoloff, Dmitry; Illarionov, E. A.
2015-08-01
A spectacular phenomenon of intermittency, i.e. a progressive growth of higher statistical moments of a physical field excited by an instability in a random medium, attracted the attention of Zeldovich in the last years of his life. At that time, the mathematical aspects underlying the physical description of this phenomenon were still under development and relations between various findings in the field remained obscure. Contemporary results from the theory of the product of independent random matrices (the Furstenberg theory) allowed the elaboration of the phenomenon of intermittency in a systematic way. We consider applications of the Furstenberg theory to some problems in cosmology and dynamo theory.
Finiteness properties of congruence classes of infinite matrices
Eggermont, R.H.
2014-01-01
We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.
Directory of Open Access Journals (Sweden)
Hajime Matsui
2017-12-01
Full Text Available In this study, we consider codes over Euclidean domains modulo their ideals. In the first half of the study, we deal with arbitrary Euclidean domains. We show that the product of generator matrices of codes over the rings mod a and mod b produces generator matrices of all codes over the ring mod a b , i.e., this correspondence is onto. Moreover, we show that if a and b are coprime, then this correspondence is one-to-one, i.e., there exist unique codes over the rings mod a and mod b that produce any given code over the ring mod a b through the product of their generator matrices. In the second half of the study, we focus on the typical Euclidean domains such as the rational integer ring, one-variable polynomial rings, rings of Gaussian and Eisenstein integers, p-adic integer rings and rings of one-variable formal power series. We define the reduced generator matrices of codes over Euclidean domains modulo their ideals and show their uniqueness. Finally, we apply our theory of reduced generator matrices to the Hecke rings of matrices over these Euclidean domains.
Orthogonal polynomials and random matrices
Deift, Percy
2000-01-01
This volume expands on a set of lectures held at the Courant Institute on Riemann-Hilbert problems, orthogonal polynomials, and random matrix theory. The goal of the course was to prove universality for a variety of statistical quantities arising in the theory of random matrix models. The central question was the following: Why do very general ensembles of random n {\\times} n matrices exhibit universal behavior as n {\\rightarrow} {\\infty}? The main ingredient in the proof is the steepest descent method for oscillatory Riemann-Hilbert problems.
Gossip and Distributed Kalman Filtering: Weak Consensus Under Weak Detectability
Kar, Soummya; Moura, José M. F.
2011-04-01
The paper presents the gossip interactive Kalman filter (GIKF) for distributed Kalman filtering for networked systems and sensor networks, where inter-sensor communication and observations occur at the same time-scale. The communication among sensors is random; each sensor occasionally exchanges its filtering state information with a neighbor depending on the availability of the appropriate network link. We show that under a weak distributed detectability condition: 1. the GIKF error process remains stochastically bounded, irrespective of the instability properties of the random process dynamics; and 2. the network achieves \\emph{weak consensus}, i.e., the conditional estimation error covariance at a (uniformly) randomly selected sensor converges in distribution to a unique invariant measure on the space of positive semi-definite matrices (independent of the initial state.) To prove these results, we interpret the filtered states (estimates and error covariances) at each node in the GIKF as stochastic particles with local interactions. We analyze the asymptotic properties of the error process by studying as a random dynamical system the associated switched (random) Riccati equation, the switching being dictated by a non-stationary Markov chain on the network graph.
Generalized noncommutative Hardy and Hardy-Hilbert type inequalities
DEFF Research Database (Denmark)
Hansen, Frank; Krulic, Kristina; Pecaric, Josip
2010-01-01
We extend and unify several Hardy type inequalities to functions whose values are positive semi-definite operators. In particular, our methods lead to the operator versions of Hardy-Hilbert's and Godunova's inequalities. While classical Hardy type inequalities hold for parameter values p > 1, it ...
Equiangular tight frames and unistochastic matrices
Czech Academy of Sciences Publication Activity Database
Goyeneche, D.; Turek, Ondřej
2017-01-01
Roč. 50, č. 24 (2017), č. článku 245304. ISSN 1751-8113 R&D Projects: GA ČR GA17-01706S Institutional support: RVO:61389005 Keywords : equiangular tight frames * unistochastic matrices * SIC POVM Subject RIV: BE - Theoretical Physics OBOR OECD: Atomic, molecular and chemical physics (physics of atoms and molecules including collision, interaction with radiation, magnetic resonances, Mössbauer effect) Impact factor: 1.857, year: 2016
PHAGOCYTOSIS AND REMODELING OF COLLAGEN MATRICES
Abraham, Leah C.; Dice, J Fred.; Lee, Kyongbum; Kaplan, David L.
2007-01-01
The biodegradation of collagen and the deposition of new collagen-based extracellular matrices are of central importance in tissue remodeling and function. Similarly, for collagen-based biomaterials used in tissue engineering, the degradation of collagen scaffolds with accompanying cellular infiltration and generation of new extracellular matrix is critical for integration of in vitro grown tissues in vivo. In earlier studies we observed significant impact of collagen structure on primary lun...
Identification of necessary and sufficient conditions for real non-negativeness of rational matrices
International Nuclear Information System (INIS)
Saeed, K.
1982-12-01
The necessary and sufficient conditions for real non-negativeness of rational matrices have been identified. A programmable algorithm is developed and is given with its computer flow chart. This algorithm can be used as a general solution to test the real non-negativeness of rational matrices. The computer program assures the feasibility of the suggested algorithm. (author)
Elements of Calculus Quaternionic Matrices And Some Applications In Vector Algebra And Kinematics
Directory of Open Access Journals (Sweden)
Pivnyak G.G.
2016-04-01
Full Text Available Quaternionic matrices are proposed to develop mathematical models and perform computational experiments. New formulae for complex vector and scalar products matrix notation, formulae of first curvature, second curvature and orientation of true trihedron tracing are demonstrated in this paper. Application of quaternionic matrices for a problem of airspace transport system trajectory selection is shown.
SAR matrices: automated extraction of information-rich SAR tables from large compound data sets.
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.
Construction of symmetric Hadamard matrices of order 4v for v = 47, 73, 113
Directory of Open Access Journals (Sweden)
Balonin N. A.
2018-01-01
Full Text Available We continue our systematic search for symmetric Hadamard matrices based on the so called propus construction. In a previous paper this search covered the orders 4v with odd v ≤ 41. In this paper we cover the cases v = 43, 45, 47, 49, 51. The odd integers v < 120 for which no symmetric Hadamard matrices of order 4v are known are the following: 47, 59, 65, 67, 73, 81, 89, 93, 101, 103, 107, 109, 113, 119. By using the propus construction, we found several symmetric Hadamard matrices of order 4v for v = 47, 73, 113.
Generalised Wigner surmise for (2 X 2) random matrices
International Nuclear Information System (INIS)
Chau Huu-Tai, P.; Van Isacker, P.; Smirnova, N.A.
2001-01-01
We present new analytical results concerning the spectral distributions for (2 x 2) random real symmetric matrices which generalize the Wigner surmise. The study of the statistical properties of spectra of realistic many-body Hamiltonians requires consideration of a random matrix ensemble whose elements are not independent or whose distribution is not invariant under orthogonal transformation of a chosen basis. In this letter we have concentrated on the properties of (2 x 2) real symmetric matrices whose elements are independent Gaussian variables with zero means but do not belong to the GOE. We have derived the distribution of eigenvalues for such a matrix, the nearest-neighbour spacing distribution which generalizes the Wigner surmise and we have calculated some important moments. (authors)
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander; Genton, Marc G.; Sun, Ying
2015-01-01
We approximate large non-structured Matérn covariance matrices of size n×n in the H-matrix format with a log-linear computational cost and storage O(kn log n), where rank k ≪ n is a small integer. Applications are: spatial statistics, machine learning and image analysis, kriging and optimal design.
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander
2015-11-30
We approximate large non-structured Matérn covariance matrices of size n×n in the H-matrix format with a log-linear computational cost and storage O(kn log n), where rank k ≪ n is a small integer. Applications are: spatial statistics, machine learning and image analysis, kriging and optimal design.
Energy Technology Data Exchange (ETDEWEB)
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, Chun Tae; Oh, Jin Woo [Pusan National University, Busan (Korea, Republic of)
2015-01-15
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.
On equations for the total suction and its matric and osmotic components
International Nuclear Information System (INIS)
Dao, Vinh N.T.; Morris, Peter H.; Dux, Peter F.
2008-01-01
A clear fundamental understanding of suctions is crucial for the study of the behaviour of plastic cement mortar and concrete, including plastic shrinkage cracking. In this paper, the expression relating the change in free energy of the pore water with an isothermal change in pressure is first derived. Based upon definitions of suctions, it is then shown that total, matric, and osmotic suctions can all be expressed in the same thermodynamic form. The widely accepted, but not yet satisfactorily validated, assumption that the total suction comprises matric and osmotic components is then confirmed theoretically. The well-known Kelvin equation for matric suction, and Morse and van't Hoff equations for osmotic suction are subsequently derived from the corresponding thermodynamic equations. The applicability of latter two equations in evaluating the osmotic suctions of cement mortar and concrete is highlighted
The chiral Gaussian two-matrix ensemble of real asymmetric matrices
International Nuclear Information System (INIS)
Akemann, G; Phillips, M J; Sommers, H-J
2010-01-01
We solve a family of Gaussian two-matrix models with rectangular N x (N + ν) matrices, having real asymmetric matrix elements and depending on a non-Hermiticity parameter μ. Our model can be thought of as the chiral extension of the real Ginibre ensemble, relevant for Dirac operators in the same symmetry class. It has the property that its eigenvalues are either real, purely imaginary or come in complex conjugate eigenvalue pairs. The eigenvalue joint probability distribution for our model is explicitly computed, leading to a non-Gaussian distribution including K-Bessel functions. All n-point density correlation functions are expressed for finite N in terms of a Pfaffian form. This contains a kernel involving Laguerre polynomials in the complex plane as a building block which was previously computed by the authors. This kernel can be expressed in terms of the kernel for complex non-Hermitian matrices, generalizing the known relation among ensembles of Hermitian random matrices. Compact expressions are given for the density at finite N as an example, as well as its microscopic large-N limits at the origin for fixed ν at strong and weak non-Hermiticity.
Estimation of Fuzzy Measures Using Covariance Matrices in Gaussian Mixtures
Directory of Open Access Journals (Sweden)
Nishchal K. Verma
2012-01-01
Full Text Available This paper presents a novel computational approach for estimating fuzzy measures directly from Gaussian mixtures model (GMM. The mixture components of GMM provide the membership functions for the input-output fuzzy sets. By treating consequent part as a function of fuzzy measures, we derived its coefficients from the covariance matrices found directly from GMM and the defuzzified output constructed from both the premise and consequent parts of the nonadditive fuzzy rules that takes the form of Choquet integral. The computational burden involved with the solution of λ-measure is minimized using Q-measure. The fuzzy model whose fuzzy measures were computed using covariance matrices found in GMM has been successfully applied on two benchmark problems and one real-time electric load data of Indian utility. The performance of the resulting model for many experimental studies including the above-mentioned application is found to be better and comparable to recent available fuzzy models. The main contribution of this paper is the estimation of fuzzy measures efficiently and directly from covariance matrices found in GMM, avoiding the computational burden greatly while learning them iteratively and solving polynomial equations of order of the number of input-output variables.
Sparse Matrices in Frame Theory
DEFF Research Database (Denmark)
Lemvig, Jakob; Krahmer, Felix; Kutyniok, Gitta
2014-01-01
Frame theory is closely intertwined with signal processing through a canon of methodologies for the analysis of signals using (redundant) linear measurements. The canonical dual frame associated with a frame provides a means for reconstruction by a least squares approach, but other dual frames...... yield alternative reconstruction procedures. The novel paradigm of sparsity has recently entered the area of frame theory in various ways. Of those different sparsity perspectives, we will focus on the situations where frames and (not necessarily canonical) dual frames can be written as sparse matrices...
Fusion algebra and fusing matrices
International Nuclear Information System (INIS)
Gao Yihong; Li Miao; Yu Ming.
1989-09-01
We show that the Wilson line operators in topological field theories form a fusion algebra. In general, the fusion algebra is a relation among the fusing (F) matrices. In the case of the SU(2) WZW model, some special F matrix elements are found in this way, and the remaining F matrix elements are then determined up to a sign. In addition, the S(j) modular transformation of the one point blocks on the torus is worked out. Our results are found to agree with those obtained from the quantum group method. (author). 24 refs
Disaggregation of sectors in Social Accounting Matrices using a customized Wolsky method
BARRERA-LOZANO Margarita; MAINAR CAUSAPÉ ALFREDO; VALLÉS FERRER José
2014-01-01
The aim of this work is to enable the implementation of disaggregation processes for specific and homogeneous sectors in Social Accounting Matrices (SAMs), while taking into account the difficulties in data collection from these types of sectors. The method proposed is based on the Wolsky technique, customized for the disaggregation of Social Accounting Matrices, within the current-facilities framework. The Spanish Social Accounting Matrix for 2008 is used as a benchmark for the analysis, and...
An algebraic model for quark mass matrices with heavy top
International Nuclear Information System (INIS)
Krolikowski, W.; Warsaw Univ.
1991-01-01
In terms of an intergeneration U(3) algebra, a numerical model is constructed for quark mass matrices, predicting the top-quark mass around 170 GeV and the CP-violating phase around 75 deg. The CKM matrix is nonsymmetric in moduli with |V ub | being very small. All moduli are consistent with their experimental limits. The model is motivated by the author's previous work on three replicas of the Dirac particle, presumably resulting into three generations of leptons and quarks. The paper may be also viewed as an introduction to a new method of intrinsic dynamical description of lepton and quark mass matrices. (author)
Soft landing of size selected clusters in rare gas matrices
International Nuclear Information System (INIS)
Lau, J.T; Wurth, W.; Ehrke, H-U.; Achleitner, A.
2003-01-01
Soft landing of mass selected clusters in rare gas matrices is a technique used to preserve mass selection in cluster deposition. To prevent fragmentation upon deposition, the substrate is covered with rare gas matrices to dissipate the cluster kinetic energy upon impact. Theoretical and experimental studies demonstrate the power of this technique. Besides STM, optical absorption, excitation, and fluorescence experiments, x-ray absorption at core levels can be used as a tool to study soft landing conditions, as will be shown here. X-ray absorption spectroscopy is also well suited to follow diffusion and agglomeration of clusters on surfaces via energy shifts in core level absorption
Environmental assessment of waste matrices contaminated with arsenic.
Sanchez, F; Garrabrants, A C; Vandecasteele, C; Moszkowicz, P; Kosson, D S
2003-01-31
The use of equilibrium-based and mass transfer-based leaching tests has been proposed to provide an integrated assessment of leaching processes from solid wastes. The objectives of the research presented here are to (i) validate this assessment approach for contaminated soils and cement-based matrices, (ii) evaluate the use of diffusion and coupled dissolution-diffusion models for estimating constituent release, and (iii) evaluate model parameterization using results from batch equilibrium leaching tests and physical characterization. The test matrices consisted of (i) a soil contaminated with arsenic from a pesticide production facility, (ii) the same soil subsequently treated by a Portland cement stabilization/solidification (S/S) process, and (iii) a synthetic cement-based matrix spiked with arsenic(III) oxide. Results indicated that a good assessment of contaminant release from contaminated soils and cement-based S/S treated wastes can be obtained by the integrated use of equilibrium-based and mass transfer-based leaching tests in conjunction with the appropriate release model. During the time scale of laboratory testing, the release of arsenic from the contaminated soil matrix was governed by diffusion and the solubility of arsenic in the pore solution while the release of arsenic from the cement-based matrices was mainly controlled by solubilization at the interface between the matrix and the bulk leaching solution. In addition, results indicated that (i) estimation of the activity coefficient within the matrix pore water is necessary for accurate prediction of constituent release rates and (ii) inaccurate representation of the factors controlling release during laboratory testing can result in significant errors in release estimates.
Joint Matrices Decompositions and Blind Source Separation
Czech Academy of Sciences Publication Activity Database
Chabriel, G.; Kleinsteuber, M.; Moreau, E.; Shen, H.; Tichavský, Petr; Yeredor, A.
2014-01-01
Roč. 31, č. 3 (2014), s. 34-43 ISSN 1053-5888 R&D Projects: GA ČR GA102/09/1278 Institutional support: RVO:67985556 Keywords : joint matrices decomposition * tensor decomposition * blind source separation Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 5.852, year: 2014 http://library.utia.cas.cz/separaty/2014/SI/tichavsky-0427607.pdf
Model-independent analysis with BPM correlation matrices
International Nuclear Information System (INIS)
Irwin, J.; Wang, C.X.; Yan, Y.T.; Bane, K.; Cai, Y.; Decker, F.; Minty, M.; Stupakov, G.; Zimmermann, F.
1998-06-01
The authors discuss techniques for Model-Independent Analysis (MIA) of a beamline using correlation matrices of physical variables and Singular Value Decomposition (SVD) of a beamline BPM matrix. The beamline matrix is formed from BPM readings for a large number of pulses. The method has been applied to the Linear Accelerator of the SLAC Linear Collider (SLC)
Spin theory of the density functional: reduced matrices and density functions
International Nuclear Information System (INIS)
Pavlov, R.; Delchev, Y.; Pavlova, K.; Maruani, J.
1993-01-01
Expressions for the reduced matrices and density functions of N-fermion systems of arbitrary order s (1<=s<=N) are derived within the frame of rigorous spin approach to the density functional theory (DFT). Using the local-scale transformation method and taking into account the particle spin it is shown that the reduced matrices and density functions are functionals of the total one-fermion density. Similar dependence is found for the distribution density of s-particle aggregates. Generalization and applicability of DFT to the case of s-particle ensembles and aggregates is discussed. 14 refs
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.
ZZ RRDF-98, Cross-sections and covariance matrices for 22 neutron induced dosimetry reactions
International Nuclear Information System (INIS)
Zolotarev, K.I.; Ignatyuk, A.V.; Mahokhin, V.N.; Pashchenko, A.B.
2005-01-01
sections measured in different experiments do not correlate with each other. It should be noted that such procedure of the statistical analyses guarantees positive definiteness of the covariance matrices of evaluated cross sections
The Kerr/fluid duality and the singularity of solutions to the fluid equation
International Nuclear Information System (INIS)
Fujisawa, Ippei; Nakayama, Ryuichi
2016-01-01
An equation for a viscous incompressible fluid on a spheroidal surface that is dual to the perturbation around the near-near-horizon extreme Kerr (near-NHEK) black hole is derived. It is also shown that an expansion scalar θ of a congruence of null geodesics on the perturbed horizon of the perturbed near-NHEK spacetime, which is dual to a viscous incompressible fluid, is not in general positive semidefinite, even if initial conditions on the velocity are smooth. Unless the initial conditions are appropriately adjusted, caustics of null congruence will occur on the perturbed horizon in the future. A similar result is obtained for a perturbed Schwarzschild black hole spacetime, which is dual to a viscous incompressible fluid on S 2 . An initial condition that θ be positive semidefinite at any point on S 2 is a necessary condition for the existence of smooth solutions to the incompressible Navier-Stokes equation on S 2
Directory of Open Access Journals (Sweden)
Annamaria eDi Fabio
2016-03-01
Full Text Available This article discusses green positive guidance and green positive life counseling for decent work and decent lives. From a green guidance perspective, the connectedness to nature construct is important both in terms of the meaning of work and life construction. The study discussed in this article analyzed the relationship between empathy and connectedness to nature, controlling for the effects of fluid intelligence and personality traits. In this connection, the Advanced Progressive Matrices (APM, the Big Five Questionnaire (BFQ, and the Interpersonal Reactivity Index (IRI were administered to 144 Italian high school students. The study revealed that connecteness to nature was not associated with fluid intelligence and was only moderately associated with personality traits. It was empathy that showed the highest association with connectedness to nature. The results open new opportunities for future research and interventions in green positive guidance/life counseling and green positive decent work.
Symmetry of anomalous dimension matrices for colour evolution of hard scattering processes
International Nuclear Information System (INIS)
Seymour, Michael H.
2005-01-01
In a recent paper, Dokshitzer and Marchesini rederived the anomalous dimension matrix for colour evolution of gg→gg scattering, first derived by Kidonakis, Oderda and Sterman. They noted a weird symmetry that it possesses under interchange of internal (colour group) and external (scattering angle) degrees of freedom and speculated that this may be related to an embedding into a context that correlates internal and external variables such as string theory. In this short note, I point out another symmetry possessed by all the colour evolution anomalous dimension matrices calculated to date. It is more prosaic, but equally unexpected, and may also point to the fact that colour evolution might be understood in some deeper theoretical framework. To my knowledge it has not been pointed out elsewhere, or anticipated by any of the authors calculating these matrices. It is simply that, in a suitably chosen colour basis, they are complex symmetric matrices
Quark mass matrices in left-right symmetric gauge theories
International Nuclear Information System (INIS)
Ecker, G.; Grimus, W.; Konetschny, W.
1981-01-01
The most general left-right symmetry for SU(2)sub(L) x SU(2)sub(R) x U(1) gauge theories with any number of flavours and with at most two scalar multiplets transforming as anti qq bilinears is analyzed. In order to get additional constraints on the structure of quark mass matrices all possible horizontal groups (continuous or discrete) are investigated. A complete classification of physically inequivalent quark mass matrices is given for four and six flavours. It is argued that the methods and results are also applicable in the case of dynamical symmetry breaking. Parity invariance and horizontal symmetry are shown to imply CP conservation on the Lagrangian level. For all non-trivial three-generation models there is spontaneous CP violation which in most cases turns out to be naturally small. (Auth.)
Schur complements of matrices with acyclic bipartite graphs
DEFF Research Database (Denmark)
Britz, Thomas Johann; Olesky, D.D.; van den Driessche, P.
2005-01-01
Bipartite graphs are used to describe the generalized Schur complements of real matrices having nos quare submatrix with two or more nonzero diagonals. For any matrix A with this property, including any nearly reducible matrix, the sign pattern of each generalized Schur complement is shown to be ...
Which matrices are immune against the transportation paradox
Deineko, Vladimir G.; Klinz, Bettina; Woeginger, Gerhard
2003-01-01
We characterize the m×n cost matrices of the transportation problem for which there exist supplies and demands such that the transportation paradox arises. Our characterization is fairly simple and can be verified within O(mn) computational steps. Moreover, we discuss the corresponding question for
International Nuclear Information System (INIS)
Boshoven, J.G.; Hein, H.; Konings, R.J.M.
1996-07-01
This report describes the fabrication of targets containing inert matrices for the heterogeneous transmutation of plutonium and minor actinides. These targets will be irradiated in the EFTTRA-T2 (RAS-2) irradiation programme. The selection, preparation and characterization of the inert matrices and fabrication and loading of the irradiation capsules are discussed. (orig.)
Bi-dimensional null model analysis of presence-absence binary matrices.
Strona, Giovanni; Ulrich, Werner; Gotelli, Nicholas J
2018-01-01
Comparing the structure of presence/absence (i.e., binary) matrices with those of randomized counterparts is a common practice in ecology. However, differences in the randomization procedures (null models) can affect the results of the comparisons, leading matrix structural patterns to appear either "random" or not. Subjectivity in the choice of one particular null model over another makes it often advisable to compare the results obtained using several different approaches. Yet, available algorithms to randomize binary matrices differ substantially in respect to the constraints they impose on the discrepancy between observed and randomized row and column marginal totals, which complicates the interpretation of contrasting patterns. This calls for new strategies both to explore intermediate scenarios of restrictiveness in-between extreme constraint assumptions, and to properly synthesize the resulting information. Here we introduce a new modeling framework based on a flexible matrix randomization algorithm (named the "Tuning Peg" algorithm) that addresses both issues. The algorithm consists of a modified swap procedure in which the discrepancy between the row and column marginal totals of the target matrix and those of its randomized counterpart can be "tuned" in a continuous way by two parameters (controlling, respectively, row and column discrepancy). We show how combining the Tuning Peg with a wise random walk procedure makes it possible to explore the complete null space embraced by existing algorithms. This exploration allows researchers to visualize matrix structural patterns in an innovative bi-dimensional landscape of significance/effect size. We demonstrate the rational and potential of our approach with a set of simulated and real matrices, showing how the simultaneous investigation of a comprehensive and continuous portion of the null space can be extremely informative, and possibly key to resolving longstanding debates in the analysis of ecological
Wound care matrices for chronic leg ulcers: role in therapy
Directory of Open Access Journals (Sweden)
Sano H
2015-07-01
Full Text Available Hitomi Sano,1 Sachio Kouraba,2 Rei Ogawa11Department of Plastic, Reconstructive, and Aesthetic Surgery, Nippon Medical School, Tokyo, Japan; 2Sapporo Wound Care and Anti-Aging Laboratory, Sapporo, JapanAbstract: Chronic leg ulcers are a significant health care concern. Although deep wounds are usually treated by flap transfers, the operation is invasive and associates with serious complications. Skin grafts may be a less invasive means of covering wounds. However, skin grafts cannot survive on deep defects unless high-quality granulation tissue can first be generated in the defects. Technologies that generate high-quality granulation tissue are needed. One possibility is to use wound care matrices, which are bioengineered skin and soft tissue substitutes. Because they all support the healing process by providing a premade extracellular matrix material, these matrices can be termed “extracellular matrix replacement therapies”. The matrix promotes wound healing by acting as a scaffold for regeneration, attracting host cytokines to the wound, stimulating wound epithelialization and angiogenesis, and providing the wound bed with bioactive components. This therapy has lasting benefits as it not only helps large skin defects to be closed with thin skin grafts or patch grafts but also restores cosmetic appearance and proper function. In particular, since it acts as a layer that slides over the subcutaneous fascia, it provides skin elasticity, tear resistance, and texture. Several therapies and products employing wound care matrices for wound management have been developed recently. Some of these can be applied in combination with negative pressure wound therapy or beneficial materials that promote wound healing and can be incorporated into the matrix. To date, the clinical studies on these approaches suggest that wound care matrices promote spontaneous wound healing or can be used to facilitate skin grafting, thereby avoiding the need to use
Two updating methods for dissipative models with non symmetric matrices
International Nuclear Information System (INIS)
Billet, L.; Moine, P.; Aubry, D.
1997-01-01
In this paper the feasibility of the extension of two updating methods to rotating machinery models is considered, the particularity of rotating machinery models is to use non-symmetric stiffness and damping matrices. It is shown that the two methods described here, the inverse Eigen-sensitivity method and the error in constitutive relation method can be adapted to such models given some modification.As far as inverse sensitivity method is concerned, an error function based on the difference between right hand calculated and measured Eigen mode shapes and calculated and measured Eigen values is used. Concerning the error in constitutive relation method, the equation which defines the error has to be modified due to the non definite positiveness of the stiffness matrix. The advantage of this modification is that, in some cases, it is possible to focus the updating process on some specific model parameters. Both methods were validated on a simple test model consisting in a two-bearing and disc rotor system. (author)
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander
2015-01-05
We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(nlogn). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and op- timal design.
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander; Genton, Marc G.; Sun, Ying; Tempone, Raul
2015-01-01
We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(nlogn). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and op- timal design.
Calibration of Ge gamma-ray spectrometers for complex sample geometries and matrices
Energy Technology Data Exchange (ETDEWEB)
Semkow, T.M., E-mail: thomas.semkow@health.ny.gov [Wadsworth Center, New York State Department of Health, Empire State Plaza, Albany, NY 12201 (United States); Department of Environmental Health Sciences, School of Public Health, University at Albany, State University of New York, Rensselaer, NY 12144 (United States); Bradt, C.J.; Beach, S.E.; Haines, D.K.; Khan, A.J.; Bari, A.; Torres, M.A.; Marrantino, J.C.; Syed, U.-F. [Wadsworth Center, New York State Department of Health, Empire State Plaza, Albany, NY 12201 (United States); Kitto, M.E. [Wadsworth Center, New York State Department of Health, Empire State Plaza, Albany, NY 12201 (United States); Department of Environmental Health Sciences, School of Public Health, University at Albany, State University of New York, Rensselaer, NY 12144 (United States); Hoffman, T.J. [Wadsworth Center, New York State Department of Health, Empire State Plaza, Albany, NY 12201 (United States); Curtis, P. [Kiltel Systems, Inc., Clyde Hill, WA 98004 (United States)
2015-11-01
A comprehensive study of the efficiency calibration and calibration verification of Ge gamma-ray spectrometers was performed using semi-empirical, computational Monte-Carlo (MC), and transfer methods. The aim of this study was to evaluate the accuracy of the quantification of gamma-emitting radionuclides in complex matrices normally encountered in environmental and food samples. A wide range of gamma energies from 59.5 to 1836.0 keV and geometries from a 10-mL jar to 1.4-L Marinelli beaker were studied on four Ge spectrometers with the relative efficiencies between 102% and 140%. Density and coincidence summing corrections were applied. Innovative techniques were developed for the preparation of artificial complex matrices from materials such as acidified water, polystyrene, ethanol, sugar, and sand, resulting in the densities ranging from 0.3655 to 2.164 g cm{sup −3}. They were spiked with gamma activity traceable to international standards and used for calibration verifications. A quantitative method of tuning MC calculations to experiment was developed based on a multidimensional chi-square paraboloid. - Highlights: • Preparation and spiking of traceable complex matrices in extended geometries. • Calibration of Ge gamma spectrometers for complex matrices. • Verification of gamma calibrations. • Comparison of semi-empirical, computational Monte Carlo, and transfer methods of Ge calibration. • Tuning of Monte Carlo calculations using a multidimensional paraboloid.
Calibration of Ge gamma-ray spectrometers for complex sample geometries and matrices
International Nuclear Information System (INIS)
Semkow, T.M.; Bradt, C.J.; Beach, S.E.; Haines, D.K.; Khan, A.J.; Bari, A.; Torres, M.A.; Marrantino, J.C.; Syed, U.-F.; Kitto, M.E.; Hoffman, T.J.; Curtis, P.
2015-01-01
A comprehensive study of the efficiency calibration and calibration verification of Ge gamma-ray spectrometers was performed using semi-empirical, computational Monte-Carlo (MC), and transfer methods. The aim of this study was to evaluate the accuracy of the quantification of gamma-emitting radionuclides in complex matrices normally encountered in environmental and food samples. A wide range of gamma energies from 59.5 to 1836.0 keV and geometries from a 10-mL jar to 1.4-L Marinelli beaker were studied on four Ge spectrometers with the relative efficiencies between 102% and 140%. Density and coincidence summing corrections were applied. Innovative techniques were developed for the preparation of artificial complex matrices from materials such as acidified water, polystyrene, ethanol, sugar, and sand, resulting in the densities ranging from 0.3655 to 2.164 g cm −3 . They were spiked with gamma activity traceable to international standards and used for calibration verifications. A quantitative method of tuning MC calculations to experiment was developed based on a multidimensional chi-square paraboloid. - Highlights: • Preparation and spiking of traceable complex matrices in extended geometries. • Calibration of Ge gamma spectrometers for complex matrices. • Verification of gamma calibrations. • Comparison of semi-empirical, computational Monte Carlo, and transfer methods of Ge calibration. • Tuning of Monte Carlo calculations using a multidimensional paraboloid
Periodic position dependence of the energy measured in the CMS electromagnetic calorimeter
Descamps, Julien
2006-01-01
A uniform energy measurement response of the CMS electromagnetic calorimeter ECAL is essential for precision physics at the LHC. The ECAL barrel calorimeter consists of 61200 lead tungstate crystals arranged in a quasi-projective geometry. The energy of photons reaching the ECAL will be reconstructed by summing the channels corresponding to matrices of 3x3 or 5x5 crystals centred on the crystal with the largest energy deposit. The energy measured using such matrices of fixed size has been studied using electron test beam data taken in 2004. The variation of the energy containment with the incident electron impact position on the central crystal leads to a degradation of the energy resolution. A method using only the calorimeter information is presented to correct for the position dependent response. After correction, the energy resolution performance for uniform impact distributions of the electrons on the front face of a crystal approaches that obtained for maximal containment with a central impact. The univ...
Energy Technology Data Exchange (ETDEWEB)
NONE
2001-07-01
New specific matrices for the conditioning of long lived radionuclides (I, Cs, Tc, minor actinides) have been developed. This report presents the conditions of their synthesis by sintering or melting and the quantifying of their crystallographic, physical and thermal properties. A 7% mass insertion of iodine can be reached with a phosphorus-vanadium-lead iodo-apatite. A 5% mass insertion of cesium is reached with the hollandite-type crystal structure (barium aluminate-titanate). An insertion level of at least 10% mass of rare earth oxides (simulating the presence of actinides) is reached for britholite, zirconolite, thorium phosphate, monazite, and zirconolite glass/ceramic materials. The chemical durability has been also determined. Enhanced aqueous corrosion resistance, 100 times better than for the glasses used today, are obtained for iodo-apatite (I), hollandite (Cs), britholite (actinides 3+/4+), thorium phosphate (actinides 4+) and monazite (3+/4+). The first elements of stability with respect to irradiation are reported for the minor actinide conditioning matrices. External post-irradiation examinations by heavy ion bombardment coupled to atomistic modeling have been performed. The characterization of self-irradiated natural analogues of britholite, zirconolite and monazite with more than 10{sup 20} {alpha}/g disintegrations confirms the very long time stability of these mineral structures (>10{sup 8} years). On the basis of the obtained results, it appears that the iodo-apatite, britholite, zirconolite, and thorium phosphate conditioning matrices have reached the stage of scientifical feasibility. The monazite matrice is on the way to reach the feasibility too. Other specific matrices for technetium (metal alloys) and cesium (hollandite) are also under development, but their long-term properties remain to be determined. (J.S.)
Multigroup P8 - elastic scattering matrices of main reactor elements
International Nuclear Information System (INIS)
Garg, S.B.; Shukla, V.K.
1979-01-01
To study the effect of anisotropic scattering phenomenon on shielding and neutronics of nuclear reactors multigroup P8-elastic scattering matrices have been generated for H, D, He, 6 Li, 7 Li, 10 B, C, N, O, Na, Cr, Fe, Ni, 233 U, 235 U, 238 U, 239 Pu, 240 Pu, 241 Pu and 242 Pu using their angular distribution, Legendre coefficient and elastic scattering cross-section data from the basic ENDF/B library. Two computer codes HSCAT and TRANS have been developed to complete this task for BESM-6 and CDC-3600 computers. These scattering matrices can be directly used as input to the transport theory codes ANISN and DOT. (auth.)
International Nuclear Information System (INIS)
Chudnovsky, D.V.; Chudnovsky, G.V.
1981-01-01
We consider general expressions of factorized S-matrices with Abelian symmetry expressed in terms of theta-functions. These expressions arise from representations of the Heisenberg group. New examples of factorized S-matrices lead to a large class of completely integrable models of statistical mechanics which generalize the XYZ-model of the eight-vertex model. (orig.)
Parallelization of mathematical library for generalized eigenvalue problem for real band matrices
International Nuclear Information System (INIS)
Tanaka, Yasuhisa.
1997-05-01
This research has focused on a parallelization of the mathematical library for a generalized eigenvalue problem for real band matrices on IBM SP and Hitachi SR2201. The origin of the library is LASO (Lanczos Algorithm with Selective Orthogonalization), which was developed on the basis of Block Lanczos method for standard eigenvalue problem for real band matrices at Texas University. We adopted D.O.F. (Degree Of Freedom) decomposition method for a parallelization of this library, and evaluated its parallel performance. (author)
A definition of column reduced proper rational matrices
Czech Academy of Sciences Publication Activity Database
Ruiz-León, J. J.; Castellanos, A.; Ramos-Velasco, Luis Enrique
2002-01-01
Roč. 75, č. 3 (2002), s. 195-203 ISSN 0020-7179 R&D Projects: GA AV ČR KSK1019101 Institutional research plan: CEZ:AV0Z1075907 Keywords : linear systems * columm reduced polynomial matrices * decoupling Subject RIV: BC - Control Systems Theory Impact factor: 0.861, year: 2002
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.
DEFF Research Database (Denmark)
Barndorff-Nielsen, Ole; Hansen, Peter Reinhard; Lunde, Asger
We propose a multivariate realised kernel to estimate the ex-post covariation of log-prices. We show this new consistent estimator is guaranteed to be positive semi-definite and is robust to measurement noise of certain types and can also handle non-synchronous trading. It is the first estimator...
Discrete Green’s function diakoptics for stable FDTD interaction between multiply-connected domains
Hon, de B.P.; Arnold, J.M.; Graglia, R.D.
2007-01-01
We have developed FDTD boundary conditions based on discrete Green's function diakoptics for arbitrary multiply-connected 2D domains. The associated Z-domain boundary operator is symmetric, with an imaginary part that can be proved to be positive semi-definite on the upper half of the unit circle in
Optimization of the determinant of the Vandermonde matrix and related matrices
Energy Technology Data Exchange (ETDEWEB)
Lundengård, Karl; Österberg, Jonas; Silvestrov, Sergei [Division of Applied Mathematics, School of Education, Culture and Communication, Mälardalen University, Box 883, SE-721 23 Västerås (Sweden)
2014-12-10
Various techniques for interpolation of data, moment matching in stochastic applications and various methods in numerical analysis can be described using Vandermonde matrices. For this reason the properties of the determinant of the Vandermonde matrix and related matrices are interesting. Here the extreme points of the Vandermonde determinant, and related determinants, on some simple surfaces such as the unit sphere are analyzed, both numerically and analytically. Some results are also visualized in various dimensions. The extreme points of the Vandermonde determinant are also related to the roots of certain orthogonal polynomials such as the Hermite polynomials.
Consolidity analysis for fully fuzzy functions, matrices, probability and statistics
Directory of Open Access Journals (Sweden)
Walaa Ibrahim Gabr
2015-03-01
Full Text Available The paper presents a comprehensive review of the know-how for developing the systems consolidity theory for modeling, analysis, optimization and design in fully fuzzy environment. The solving of systems consolidity theory included its development for handling new functions of different dimensionalities, fuzzy analytic geometry, fuzzy vector analysis, functions of fuzzy complex variables, ordinary differentiation of fuzzy functions and partial fraction of fuzzy polynomials. On the other hand, the handling of fuzzy matrices covered determinants of fuzzy matrices, the eigenvalues of fuzzy matrices, and solving least-squares fuzzy linear equations. The approach demonstrated to be also applicable in a systematic way in handling new fuzzy probabilistic and statistical problems. This included extending the conventional probabilistic and statistical analysis for handling fuzzy random data. Application also covered the consolidity of fuzzy optimization problems. Various numerical examples solved have demonstrated that the new consolidity concept is highly effective in solving in a compact form the propagation of fuzziness in linear, nonlinear, multivariable and dynamic problems with different types of complexities. Finally, it is demonstrated that the implementation of the suggested fuzzy mathematics can be easily embedded within normal mathematics through building special fuzzy functions library inside the computational Matlab Toolbox or using other similar software languages.
Likelihood Approximation With Parallel Hierarchical Matrices For Large Spatial Datasets
Litvinenko, Alexander; Sun, Ying; Genton, Marc G.; Keyes, David E.
2017-01-01
The main goal of this article is to introduce the parallel hierarchical matrix library HLIBpro to the statistical community. We describe the HLIBCov package, which is an extension of the HLIBpro library for approximating large covariance matrices and maximizing likelihood functions. We show that an approximate Cholesky factorization of a dense matrix of size $2M\\times 2M$ can be computed on a modern multi-core desktop in few minutes. Further, HLIBCov is used for estimating the unknown parameters such as the covariance length, variance and smoothness parameter of a Matérn covariance function by maximizing the joint Gaussian log-likelihood function. The computational bottleneck here is expensive linear algebra arithmetics due to large and dense covariance matrices. Therefore covariance matrices are approximated in the hierarchical ($\\H$-) matrix format with computational cost $\\mathcal{O}(k^2n \\log^2 n/p)$ and storage $\\mathcal{O}(kn \\log n)$, where the rank $k$ is a small integer (typically $k<25$), $p$ the number of cores and $n$ the number of locations on a fairly general mesh. We demonstrate a synthetic example, where the true values of known parameters are known. For reproducibility we provide the C++ code, the documentation, and the synthetic data.
Likelihood Approximation With Parallel Hierarchical Matrices For Large Spatial Datasets
Litvinenko, Alexander
2017-11-01
The main goal of this article is to introduce the parallel hierarchical matrix library HLIBpro to the statistical community. We describe the HLIBCov package, which is an extension of the HLIBpro library for approximating large covariance matrices and maximizing likelihood functions. We show that an approximate Cholesky factorization of a dense matrix of size $2M\\\\times 2M$ can be computed on a modern multi-core desktop in few minutes. Further, HLIBCov is used for estimating the unknown parameters such as the covariance length, variance and smoothness parameter of a Matérn covariance function by maximizing the joint Gaussian log-likelihood function. The computational bottleneck here is expensive linear algebra arithmetics due to large and dense covariance matrices. Therefore covariance matrices are approximated in the hierarchical ($\\\\H$-) matrix format with computational cost $\\\\mathcal{O}(k^2n \\\\log^2 n/p)$ and storage $\\\\mathcal{O}(kn \\\\log n)$, where the rank $k$ is a small integer (typically $k<25$), $p$ the number of cores and $n$ the number of locations on a fairly general mesh. We demonstrate a synthetic example, where the true values of known parameters are known. For reproducibility we provide the C++ code, the documentation, and the synthetic data.
PRIMITIVE MATRICES AND GENERATORS OF PSEUDO RANDOM SEQUENCES OF GALOIS
Directory of Open Access Journals (Sweden)
A. Beletsky
2014-04-01
Full Text Available In theory and practice of information cryptographic protection one of the key problems is the forming a binary pseudo-random sequences (PRS with a maximum length with acceptable statistical characteristics. PRS generators are usually implemented by linear shift register (LSR of maximum period with linear feedback [1]. In this paper we extend the concept of LSR, assuming that each of its rank (memory cell can be in one of the following condition. Let’s call such registers “generalized linear shift register.” The research goal is to develop algorithms for constructing Galois and Fibonacci generalized matrix of n-order over the field , which uniquely determined both the structure of corresponding generalized of n-order LSR maximal period, and formed on their basis Galois PRS generators of maximum length. Thus the article presents the questions of formation the primitive generalized Fibonacci and Galois arbitrary order matrix over the prime field . The synthesis of matrices is based on the use of irreducible polynomials of degree and primitive elements of the extended field generated by polynomial. The constructing methods of Galois and Fibonacci conjugated primitive matrices are suggested. The using possibilities of such matrices in solving the problem of constructing generalized generators of Galois pseudo-random sequences are discussed.
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/
Virial expansion for almost diagonal random matrices
International Nuclear Information System (INIS)
Yevtushenko, Oleg; Kravtsov, Vladimir E
2003-01-01
Energy level statistics of Hermitian random matrices H-circumflex with Gaussian independent random entries H i≥j is studied for a generic ensemble of almost diagonal random matrices with (vertical bar H ii vertical bar 2 ) ∼ 1 and (vertical bar H i≠j vertical bar 2 ) bF(vertical bar i - j vertical bar) parallel 1. We perform a regular expansion of the spectral form-factor K(τ) = 1 + bK 1 (τ) + b 2 K 2 (τ) + c in powers of b parallel 1 with the coefficients K m (τ) that take into account interaction of (m + 1) energy levels. To calculate K m (τ), we develop a diagrammatic technique which is based on the Trotter formula and on the combinatorial problem of graph edges colouring with (m + 1) colours. Expressions for K 1 (τ) and K 2 (τ) in terms of infinite series are found for a generic function F(vertical bar i - j vertical bar ) in the Gaussian orthogonal ensemble (GOE), the Gaussian unitary ensemble (GUE) and in the crossover between them (the almost unitary Gaussian ensemble). The Rosenzweig-Porter and power-law banded matrix ensembles are considered as examples
Directory of Open Access Journals (Sweden)
Tingting Xu
2014-01-01
Full Text Available Circulant matrices may play a crucial role in solving various differential equations. In this paper, the techniques used herein are based on the inverse factorization of polynomial. We give the explicit determinants of the RFPrLrR circulant matrices and RLPrFrL circulant matrices involving Fibonacci, Lucas, Pell, and Pell-Lucas number, respectively.
Directory of Open Access Journals (Sweden)
Keith Stuart
2009-12-01
Full Text Available This article describes research undertaken in order to design a methodology for the reticular representation of knowledge of a specific discourse community. To achieve this goal, a representative corpus of the scientific production of the members of this discourse community (Universidad Politécnica de Valencia, UPV was created. The article presents the practical analysis (frequency, keyword, collocation and cluster analysis that was carried out in the initial phases of the study aimed at establishing the theoretical and practical background and framework for our matrix and network analysis of the scientific discourse of the UPV. In the methodology section, the processes that have allowed us to extract from the corpus the linguistic elements needed to develop co-occurrence matrices, as well as the computer tools used in the research, are described. From these co-occurrence matrices, semantic networks of subject and discipline knowledge were generated. Finally, based on the results obtained, we suggest that it may be viable to extract and to represent the intellectual capital of an academic institution using corpus linguistics methods in combination with the formulations of network theory.En este artículo describimos la investigación que se ha desarrollado en el diseño de una metodología para la representación reticular del conocimiento que se genera en el seno de una institución a partir de un corpus representativo de la producción científica de los integrantes de dicha comunidad discursiva, la Universidad Politécnica de Valencia.. Para ello, presentamos las acciones que se realizaron en las fases iniciales del estudio encaminadas a establecer el marco teórico y práctico en el que se inscribe nuestro análisis. En la sección de metodología se describen las herramientas informáticas utilizadas, así como los procesos que nos permitieron disponer de aquellos elementos presentes en el corpus, que nos llevarían al desarrollo de
Systems of Differential Equations with Skew-Symmetric, Orthogonal Matrices
Glaister, P.
2008-01-01
The solution of a system of linear, inhomogeneous differential equations is discussed. The particular class considered is where the coefficient matrix is skew-symmetric and orthogonal, and where the forcing terms are sinusoidal. More general matrices are also considered.
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander
2015-01-07
We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(n log n). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and optimal design
Photoluminescence of nanocrystals embedded in oxide matrices
International Nuclear Information System (INIS)
Estrada, C.; Gonzalez, J.A.; Kunold, A.; Reyes-Esqueda, J.A.; Pereyra, P.
2006-12-01
We used the theory of finite periodic systems to explain the photoluminescence spectra dependence on the average diameter of nanocrystals embedded in oxide matrices. Because of the broad matrix band gap, the photoluminescence response is basically determined by isolated nanocrystals and sequences of a few of them. With this model we were able to reproduce the shape and displacement of the experimentally observed photoluminescence spectra. (author)
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander; Genton, Marc G.; Sun, Ying; Tempone, Raul
2015-01-01
We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(n log n). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and optimal design
Linear Maps on Upper Triangular Matrices Spaces Preserving Idempotent Tensor Products
Directory of Open Access Journals (Sweden)
Li Yang
2014-01-01
Full Text Available Suppose m, n≥2 are positive integers. Let n be the space of all n×n complex upper triangular matrices, and let ϕ be an injective linear map on m⊗n. Then ϕ(A⊗B is an idempotent matrix in m⊗n whenever A⊗B is an idempotent matrix in m⊗n if and only if there exists an invertible matrix P∈m⊗n such that ϕ(A⊗B=P(ξ1(A⊗ξ2(BP-1, ∀A∈m, B∈n, or when m=n, ϕ(A⊗B=P(ξ1(B⊗ξ2(AP-1, ∀A∈m, B∈m, where ξ1([aij]=[aij] or ξ1([aij]=[am-i+1, m-j+1] and ξ2([bij]=[bij] or ξ2([bij]=[bn-i+1, n-j+1].
Tensor Permutation Matrices in Finite Dimensions
Christian, Rakotonirina
2005-01-01
We have generalised the properties with the tensor product, of one 4x4 matrix which is a permutation matrix, and we call a tensor commutation matrix. Tensor commutation matrices can be constructed with or without calculus. A formula allows us to construct a tensor permutation matrix, which is a generalisation of tensor commutation matrix, has been established. The expression of an element of a tensor commutation matrix has been generalised in the case of any element of a tensor permutation ma...
BMP-silk composite matrices heal critically sized femoral defects
Kirker-Head, C.; Karageorgiou, V.; Hofmann, S.; Fajardo, R.; Betz, O.; Merkle, H.P.; Hilbe, M.; Rechenberg, von B.; McCool, J.; Abrahamsen, L.; Nazarian, A.; Cory, E.; Curtis, M.; Kaplan, D.L.; Meinel, L.
2007-01-01
Clinical drawbacks of bone grafting prompt the search for alternative bone augmentation technologies such as use of growth and differentiation factors, gene therapy, and cell therapy. Osteopromotive matrices are frequently employed for the local delivery and controlled release of these augmentation
Litvinenko, Alexander
2018-03-12
Part 1: Parallel H-matrices in spatial statistics 1. Motivation: improve statistical model 2. Tools: Hierarchical matrices 3. Matern covariance function and joint Gaussian likelihood 4. Identification of unknown parameters via maximizing Gaussian log-likelihood 5. Implementation with HLIBPro. Part 2: Low-rank Tucker tensor methods in spatial statistics
International Nuclear Information System (INIS)
Hoshiba, Takashi; Tanaka, Masaru
2013-01-01
Highlights: •Models mimicking ECM in tumor with different malignancy were prepared. •Cancer cell proliferation was suppressed on benign tumor ECM. •Benign tumor cell proliferation was suppressed on cancerous ECM. •Chemoresistance of cancer cell was enhanced on cancerous ECM. -- Abstract: Extracellular matrix (ECM) has been focused to understand tumor progression in addition to the genetic mutation of cancer cells. Here, we prepared “staged tumorigenesis-mimicking matrices” which mimic in vivo ECM in tumor tissue at each malignant stage to understand the roles of ECM in tumor progression. Breast tumor cells, MDA-MB-231 (invasive), MCF-7 (non-invasive), and MCF-10A (benign) cells, were cultured to form their own ECM beneath the cells and formed ECM was prepared as staged tumorigenesis-mimicking matrices by decellularization treatment. Cells showed weak attachment on the matrices derived from MDA-MB-231 cancer cells. The proliferations of MDA-MB-231 and MCF-7 was promoted on the matrices derived from MDA-MB-231 cancer cells whereas MCF-10A cell proliferation was not promoted. MCF-10A cell proliferation was promoted on the matrices derived from MCF-10A cells. Chemoresistance of MDA-MB-231 cells against 5-fluorouracil increased on only matrices derived from MDA-MB-231 cells. Our results showed that the cells showed different behaviors on staged tumorigenesis-mimicking matrices according to the malignancy of cell sources for ECM preparation. Therefore, staged tumorigenesis-mimicking matrices might be a useful in vitro ECM models to investigate the roles of ECM in tumor progression
Energy Technology Data Exchange (ETDEWEB)
Hoshiba, Takashi [Graduate School of Science and Engineering, Yamagata University, 4-3-16 Jonan, Yonezawa, Yamagata 992-8510 (Japan); International Center for Materials Nanoarchitectonics (MANA), National Institute for Materials Science, 1-1 Namiki, Tsukuba, Ibaraki 305-0044 (Japan); Tanaka, Masaru, E-mail: tanaka@yz.yamagata-u.ac.jp [Graduate School of Science and Engineering, Yamagata University, 4-3-16 Jonan, Yonezawa, Yamagata 992-8510 (Japan)
2013-09-20
Highlights: •Models mimicking ECM in tumor with different malignancy were prepared. •Cancer cell proliferation was suppressed on benign tumor ECM. •Benign tumor cell proliferation was suppressed on cancerous ECM. •Chemoresistance of cancer cell was enhanced on cancerous ECM. -- Abstract: Extracellular matrix (ECM) has been focused to understand tumor progression in addition to the genetic mutation of cancer cells. Here, we prepared “staged tumorigenesis-mimicking matrices” which mimic in vivo ECM in tumor tissue at each malignant stage to understand the roles of ECM in tumor progression. Breast tumor cells, MDA-MB-231 (invasive), MCF-7 (non-invasive), and MCF-10A (benign) cells, were cultured to form their own ECM beneath the cells and formed ECM was prepared as staged tumorigenesis-mimicking matrices by decellularization treatment. Cells showed weak attachment on the matrices derived from MDA-MB-231 cancer cells. The proliferations of MDA-MB-231 and MCF-7 was promoted on the matrices derived from MDA-MB-231 cancer cells whereas MCF-10A cell proliferation was not promoted. MCF-10A cell proliferation was promoted on the matrices derived from MCF-10A cells. Chemoresistance of MDA-MB-231 cells against 5-fluorouracil increased on only matrices derived from MDA-MB-231 cells. Our results showed that the cells showed different behaviors on staged tumorigenesis-mimicking matrices according to the malignancy of cell sources for ECM preparation. Therefore, staged tumorigenesis-mimicking matrices might be a useful in vitro ECM models to investigate the roles of ECM in tumor progression.
Evaluation of hydrophobic materials as matrices for controlled-release drug delivery.
Quadir, Mohiuddin Abdul; Rahman, M Sharifur; Karim, M Ziaul; Akter, Sanjida; Awkat, M Talat Bin; Reza, Md Selim
2003-07-01
The present study was undertaken to evaluate the effect of different insoluble and erodable wax-lipid based materials and their content level on the release profile of drug from matrix systems. Matrix tablets of theophylline were prepared using carnauba wax, bees wax, stearic acid, cetyl alcohol, cetostearyl alcohol and glyceryl monostearate as rate-retarding agents by direct compression process. The release of theophylline from these hydrophobic matrices was studied over 8-hours in buffer media of pH 6.8. Statistically significant difference was found among the drug release profile from different matrices. The release kinetics was found to be governed by the type and content of hydrophobic materials in the matrix. At lower level of wax matrices (25%), a potential burst release was observed with all the materials being studied. Bees wax could not exert any sustaining action while an extensive burst release was found with carnauba wax at this hydrophobic load. Increasing the concentration of fat-wax materials significantly decreased the burst effect of drug from the matrix. At higher hydrophobic level (50% of the matrix), the rate and extent of drug release was significantly reduced due to increased tortuosity and reduced porosity of the matrix. Cetostearyl alcohol imparted the strongest retardation of drug release irrespective of fat-wax level. Numerical fits indicate that the Higuchi square root of time model was the most appropriate one for describing the release profile of theophylline from hydrophobic matrices. The release mechanism was also explored and explained with biexponential equation. Application of this model indicates that Fickian or case I kinetics is the predominant mechanism of drug release from these wax-lipid matrices. The mean dissolution time (MDT) was calculated for all the formulations and the highest MDT value was obtained with cetostearyl matrix. The greater sustaining activity of cetostearyl alcohol can be attributed to some level of
Sharma, Manjinder; Dubey, Pawan K; Kumar, Rajesh; Nath, Amar; Kumar, G Sai; Sharma, G Taru
2013-05-01
Use of somatic cells as a feeder layer to maintain the embryonic stem cells (ESCs) in undifferentiated state limits the stem cell research design, since experimental data may result from a combined ESCs and feeder cell response to various stimuli. Therefore, present study was designed to evaluate the developmental competence of the buffalo ESCs over different homogenous feeders and compare with various extracellular matrices using different concentrations of LIF. Inner cell masses (ICMs) of in vitro hatched blastocysts were cultured onto homologous feeders viz. fetal fibroblast, granulosa and oviductal cell feeder layers and synthetic matrices viz. fibronectin, collagen type I and matrigel in culture medium. Developmental efficiency was found higher for ESCs cultured on fetal fibroblast and granulosa layers (83.33%) followed by fibronectin (77.78%) at 30 ng LIF. Oviductal feeder was found to be the least efficient feeder showing only 11.11% undifferentiated primary ESC colonies at 30 ng LIF. However, neither feeder layer nor synthetic matrix could support the development of primary colonies at 10 ng LIF. Expression of SSEA- 4, TRA-1-60 and Oct-4 were found positive in ESC colonies from all the feeders and synthetic matrices with 20 ng and 30 ng LIF. Fetal fibroblast and granulosa cell while, amongst synthetic matrices, fibronectin were found to be equally efficient to support the growth and maintenance of ESCs pluripotency with 30 ng LIF. This well-defined culture conditions may provide an animal model for culturing human embryonic stem cells in the xeno-free or feeder-free conditions for future clinical applications.
Melting Behavior of Organic Nanocrystals Grown in Sol-gel Matrices
International Nuclear Information System (INIS)
Sanz, N.; Boudet, A.; Ibanez, A.
2002-01-01
We have characterized the thermal stability of organic nanocrystals grown in the pores of sol-gel matrices. The structure has been measured with transmission electron microscopy (TEM) analysis. Depending on the nature of organic molecules and sol-gel matrices, we have modified the dye-matrix interactions and the interfacial structure between nanocrystals and gel-glasses. When the dye-matrix interactions are weak (Van der Waals' bonds), the corresponding interfacial structure observed by TEM is sharp and the nanocrystals melt below the bulk melting point. On the other hand, when the dye-matrix interactions are strong (hydrogen bonds), the interfacial structure is fuzzy and a great superheating of organic nanocrystals is observed in comparison to the bulk melting point of the dye
International Nuclear Information System (INIS)
Mazziotti, David A.
2002-01-01
Atomic and molecular ground-state energies are variationally determined by constraining the two-particle reduced density matrix (2-RDM) to satisfy positivity conditions. Because each positivity condition corresponds to correcting the ground-state energies for a class of Hamiltonians with two-particle interactions, these conditions collectively provide a new approach to many-body theory that, unlike perturbation theory, can capture significantly correlated phenomena including the multireference effects of potential-energy surfaces. The D, Q, and G conditions for the 2-RDM are extended through generalized lifting operators inspired from the formal solution of N-representability. These lifted conditions agree with the hierarchy of positivity conditions presented by Mazziotti and Erdahl [Phys. Rev. A 63, 042113 (2001)]. The connection between positivity and the formal solution explains how constraining higher RDMs to be positive semidefinite improves the N representability of the 2-RDM and suggests using pieces of higher positivity conditions that computationally scale like the D condition. With the D, Q, and G conditions as well as pieces of higher positivity the electronic energies for Be, LiH, H 2 O, and BH are computed through a primal-dual interior-point algorithm for positive semidefinite programming. The variational method produces potential-energy surfaces that are highly accurate even far from the equilibrium geometry where single-reference perturbation-based methods often fail to produce realistic energies
The influence of inorganic matrices on the decomposition of Eucalyptus litter
International Nuclear Information System (INIS)
Skene, T.M.; Oades, J.M.; Clarke, P.J.; Skjemstad, J.O.; Oades, J.M.; Skjemstad, J.O.
1997-01-01
The decomposition of Eucalyptus litter (EL) in the presence and absence of inorganic matrices [sad (S), sand+kaolin (S+K), loamy sand (LS)] with and without added N (urea) was followed over 48 weeks using chemical and spectroscopic means. At the end of the incubation, the residual organic matter in different density and particle size fractions was examined. Urea addition inhibited the mineralisation of C from the litter in all treatments except EL+S+N, whereas the inorganic matrices had little influence on mineralisation. Solid state 13 C CP/MAS NMR spectra of the whole samples suggested there were no differences in the treatments, despite significant differences in the amount of C mineralized. The NMR spectra of the whole samples suggest that a reaction between aromatic-C and urea occurred during thr first week of the incubation which may have rendered the N unavailable to microorganisms. The results were quite different from a similar study on the decomposition of straw. these differences suggest that, for high quality substrates, physical protection by inorganic matrices is the limiting factor to decomposition, whereas for low quality substrates, chemical protection is the limiting factor. 13 refs., 2 tabs., 6 figs
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.
Ren, Xuezhu; Goldhammer, Frank; Moosbrugger, Helfried; Schweizer, Karl
2012-01-01
The aim of the present study was to clarify the nature of the ability-specific and position-specific components of Raven's Advanced Progressive Matrices (APM) by relating them to a number of types of attention. The ability-specific component represents the constant part of cognitive performance whereas the position-specific component reflects the…
Completely X-symmetric S-matrices corresponding to theta functions
International Nuclear Information System (INIS)
Chudnovsky, D.V.
1981-01-01
We consider the realization of the classical Weyl commutation relations using THETA-functions. The representations of the Heisenberg group enable us to realize completely symmetric factorized S-matrices in terms of THETA-functions corresponding to the torsion subgroup of an abelian variety. (orig.)
Designer matrices for intestinal stem cell and organoid culture
Gjorevski, Nikolce; Sachs, Norman; Manfrin, Andrea; Giger, Sonja; Bragina, Maiia E.; Ordóñez-Morán, Paloma; Clevers, Hans; Lutolf, Matthias P.
2016-01-01
Epithelial organoids recapitulate multiple aspects of real organs, making them promising models of organ development, function and disease. However, the full potential of organoids in research and therapy has remained unrealized, owing to the poorly defined animal-derived matrices in which they are
Likelihood Approximation With Hierarchical Matrices For Large Spatial Datasets
Litvinenko, Alexander
2017-09-03
We use available measurements to estimate the unknown parameters (variance, smoothness parameter, and covariance length) of a covariance function by maximizing the joint Gaussian log-likelihood function. To overcome cubic complexity in the linear algebra, we approximate the discretized covariance function in the hierarchical (H-) matrix format. The H-matrix format has a log-linear computational cost and storage O(kn log n), where the rank k is a small integer and n is the number of locations. The H-matrix technique allows us to work with general covariance matrices in an efficient way, since H-matrices can approximate inhomogeneous covariance functions, with a fairly general mesh that is not necessarily axes-parallel, and neither the covariance matrix itself nor its inverse have to be sparse. We demonstrate our method with Monte Carlo simulations and an application to soil moisture data. The C, C++ codes and data are freely available.
Fast Approximate Joint Diagonalization Incorporating Weight Matrices
Czech Academy of Sciences Publication Activity Database
Tichavský, Petr; Yeredor, A.
2009-01-01
Roč. 57, č. 3 (2009), s. 878-891 ISSN 1053-587X R&D Projects: GA MŠk 1M0572 Institutional research plan: CEZ:AV0Z10750506 Keywords : autoregressive processes * blind source separation * nonstationary random processes Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.212, year: 2009 http://library.utia.cas.cz/separaty/2009/SI/tichavsky-fast approximate joint diagonalization incorporating weight matrices.pdf
Gaussian density matrices: Quantum analogs of classical states
International Nuclear Information System (INIS)
Mann, A.; Revzen, M.
1993-01-01
We study quantum analogs of clasical situations, i.e. quantum states possessing some specific classical attribute(s). These states seem quite generally, to have the form of gaussian density matrices. Such states can always be parametrized as thermal squeezed states (TSS). We consider the following specific cases: (a) Two beams that are built from initial beams which passed through a beam splitter cannot, classically, be distinguished from (appropriately prepared) two independent beams that did not go through a splitter. The only quantum states possessing this classical attribute are TSS. (b) The classical Cramer's theorem was shown to have a quantum version (Hegerfeldt). Again, the states here are Gaussian density matrices. (c) The special case in the study of the quantum version of Cramer's theorem, viz. when the state obtained after partial tracing is a pure state, leads to the conclusion that all states involved are zero temperature limit TSS. The classical analog here are gaussians of zero width, i.e. all distributions are δ functions in phase space. (orig.)
Permuting sparse rectangular matrices into block-diagonal form
Energy Technology Data Exchange (ETDEWEB)
Aykanat, Cevdet; Pinar, Ali; Catalyurek, Umit V.
2002-12-09
This work investigates the problem of permuting a sparse rectangular matrix into block diagonal form. Block diagonal form of a matrix grants an inherent parallelism for the solution of the deriving problem, as recently investigated in the context of mathematical programming, LU factorization and QR factorization. We propose graph and hypergraph models to represent the nonzero structure of a matrix, which reduce the permutation problem to those of graph partitioning by vertex separator and hypergraph partitioning, respectively. Besides proposing the models to represent sparse matrices and investigating related combinatorial problems, we provide a detailed survey of relevant literature to bridge the gap between different societies, investigate existing techniques for partitioning and propose new ones, and finally present a thorough empirical study of these techniques. Our experiments on a wide range of matrices, using state-of-the-art graph and hypergraph partitioning tools MeTiS and PaT oH, revealed that the proposed methods yield very effective solutions both in terms of solution quality and run time.
Generalisations of Fisher Matrices
Directory of Open Access Journals (Sweden)
Alan Heavens
2016-06-01
Full Text Available Fisher matrices play an important role in experimental design and in data analysis. Their primary role is to make predictions for the inference of model parameters—both their errors and covariances. In this short review, I outline a number of extensions to the simple Fisher matrix formalism, covering a number of recent developments in the field. These are: (a situations where the data (in the form of ( x , y pairs have errors in both x and y; (b modifications to parameter inference in the presence of systematic errors, or through fixing the values of some model parameters; (c Derivative Approximation for LIkelihoods (DALI - higher-order expansions of the likelihood surface, going beyond the Gaussian shape approximation; (d extensions of the Fisher-like formalism, to treat model selection problems with Bayesian evidence.
International Nuclear Information System (INIS)
Peach, M Sean; James, Roshan; Toti, Udaya S; Deng, Meng; Laurencin, Cato T; Kumbar, Sangamesh G; Morozowich, Nicole L; Allcock, Harry R
2012-01-01
Poly[(ethyl alanato) 1 (p-methyl phenoxy) 1 ] phosphazene (PNEA-mPh) was used to modify the surface of electrospun poly(ε-caprolactone) (PCL) nanofiber matrices having an average fiber diameter of 3000 ± 1700 nm for the purpose of tendon tissue engineering and augmentation. This study reports the effect of polyphosphazene surface functionalization on human mesenchymal stem cell (hMSC) adhesion, cell-construct infiltration, proliferation and tendon differentiation, as well as long term cellular construct mechanical properties. PCL fiber matrices functionalized with PNEA-mPh acquired a rougher surface morphology and led to enhanced cell adhesion as well as superior cell-construct infiltration when compared to smooth PCL fiber matrices. Long-term in vitro hMSC cultures on both fiber matrices were able to produce clinically relevant moduli. Both fibrous constructs expressed scleraxis, an early tendon differentiation marker, and a bimodal peak in expression of the late tendon differentiation marker tenomodulin, a pattern that was not observed in PCL thin film controls. Functionalized matrices achieved a more prominent tenogenic differentiation, possessing greater tenomodulin expression and superior phenotypic maturity according to the ratio of collagen I to collagen III expression. These findings indicate that PNEA-mPh functionalization is an efficient method for improving cell interactions with electrospun PCL matrices for the purpose of tendon repair. (paper)
Litvinenko, Alexander
2017-01-01
matrices. Therefore covariance matrices are approximated in the hierarchical ($\\H$-) matrix format with computational cost $\\mathcal{O}(k^2n \\log^2 n/p)$ and storage $\\mathcal{O}(kn \\log n)$, where the rank $k$ is a small integer (typically $k<25$), $p
Matrices funcionales e integración morfológica
Directory of Open Access Journals (Sweden)
Barbeito Andrés, Jimena
2012-01-01
Full Text Available Los estudios ontogénicos permiten conocer cómo se generan las diferencias morfológicas que encontramos en adultos. Éstas resultan de la asociación diferencial entre rasgos morfológicos, lo que puede deberse tanto a factores del desarrollo como funcionales. De acuerdo a la hipótesis funcional, los cambios en las estructuras óseas son consecuencia de la influencia de tejidos blandos, cavidades y órganos (matriz funcional. En este trabajo se analizaron dos estructuras craneofaciales: la bóveda, formada por varios huesos y una matriz funcional homogénea y el maxilar, un hueso único afectado por diversas matrices, para poner a prueba la hipótesis que postula que durante la ontogenia cambian los patrones de covariación. Se relevaron puntos craneofaciales sobre 267 cráneos de adultos y subadultos, se aplicó Análisis de Componentes Principales para establecer la variación en forma a lo largo de la ontogenia y se realizó un análisis de correlación entre las matrices de covarianza de las sucesivas edades para evaluar el cambio en los patrones de integración morfológica. Los resultados indicaron que mientras en la bóveda los patrones de covariación no cambian durante la ontogenia, esto sí ocurre en el maxilar. Los patrones de covariación de estas estructuras se comportarían en relación a la cantidad y características de las matrices asociadas.
Directory of Open Access Journals (Sweden)
Sunita Nayak
Full Text Available 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.
The algebraic structure of lax equations for infinite matrices
Helminck, G.F.
2002-01-01
In this paper we discuss the algebraic structure of the tower of differential difference equations that one can associate with any commutative subalgebra of $M_k(\\mathbb{C})$. These equations can be formulated conveniently in so-called Lax equations for infinite upper- resp. lowertriangular matrices
Neeft, E.A.C.
2004-01-01
Fission of actinides from nuclear waste in inert matrices (materials without uranium) can reduce the period in time that nuclear waste is more radiotoxic than uranium ore that is the rock from which ordinary reactor fuel is made. A pioneering study is performed with the inert matrices: MgO, MgAl2O4,
Determinants of (–1,1-matrices of the skew-symmetric type: a cocyclic approach
Directory of Open Access Journals (Sweden)
Álvarez Víctor
2015-01-01
Full Text Available An n by n skew-symmetric type (-1; 1-matrix K =[ki;j ] has 1’s on the main diagonal and ±1’s elsewhere with ki;j =-kj;i . The largest possible determinant of such a matrix K is an interesting problem. The literature is extensive for n ≡ 0 mod 4 (skew-Hadamard matrices, but for n ≡ 2 mod 4 there are few results known for this question. In this paper we approach this problem constructing cocyclic matrices over the dihedral group of 2t elements, for t odd, which are equivalent to (-1; 1-matrices of skew type. Some explicit calculations have been done up to t =11. To our knowledge, the upper bounds on the maximal determinant in orders 18 and 22 have been improved.
Directory of Open Access Journals (Sweden)
Emran Tohidi
2013-01-01
Full Text Available The idea of approximation by monomials together with the collocation technique over a uniform mesh for solving state-space analysis and optimal control problems (OCPs has been proposed in this paper. After imposing the Pontryagins maximum principle to the main OCPs, the problems reduce to a linear or nonlinear boundary value problem. In the linear case we propose a monomial collocation matrix approach, while in the nonlinear case, the general collocation method has been applied. We also show the efficiency of the operational matrices of differentiation with respect to the operational matrices of integration in our numerical examples. These matrices of integration are related to the Bessel, Walsh, Triangular, Laguerre, and Hermite functions.
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.
A Generalized Correction for Attenuation.
Petersen, Anne C.; Bock, R. Darrell
Use of the usual bivariate correction for attenuation with more than two variables presents two statistical problems. This pairwise method may produce a covariance matrix which is not at least positive semi-definite, and the bivariate procedure does not consider the possible influences of correlated errors among the variables. The method described…
Minimally Adhesive, Advanced Non-toxic Coatings of Dendrimeric Catalysts in Sol-Gel Matrices
2015-10-19
Catalysts in Sol -Gel Matrices 5a. CONTRACT NUMBER 5b. GRANT NUMBER N00014-09-1-0217 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) Detty, Michael R. 5d...Technical Report for ONR N00014-09-1-0217 Minimally Adhesive, Advanced Non-toxic Coatings of Dendrimeric Catalysts in Sol -Gel Matrices Michael R. Detty, PI...Environmentally benign sol -gel antifouling and foul-releasing coatings. Ace. Chem. Res. 2014, 47, 678-687. 11) Alberto, E. E.; Müller, L. M
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.
Coherence and extensions of stochastic matrices
Directory of Open Access Journals (Sweden)
Angelo Gilio
1995-11-01
Full Text Available In this paper a review of some general results on coherence of conditional probability assessments is given. Then, a necessary and sufficient condition on coherence of two finite families of discrete conditianal probability distributions, represented by two stochastic matrices P and Q, is obtained. Moreover, the possible extensions of the assessment (P,Q to the marginal distributions are examined and explicit formulas for them are given in some special case. Finally, a general algorithm to check coherence of (P,Q and to derive its extensions is proposed.
A Comparison of Teacher Stress and School Climate across Schools with Different Matric Success Rates
Milner, Karen; Khoza, Harriet
2008-01-01
Our aim was to investigate differences in teacher stress and perceptions of school climate among teachers from schools with differing matriculation success rates in the Limpopo province of South Africa. Two schools with matric pass rates of 100% and two schools with matric pass rates of less than 25% were selected from a list of schools provided…
Resistant lower rank approximation of matrices by iterative majorization
Verboon, Peter; Heiser, Willem
2011-01-01
It is commonly known that many techniques for data analysis based on the least squares criterion are very sensitive to outliers in the data. Gabriel and Odoroff (1984) suggested a resistant approach for lower rank approximation of matrices. In this approach, weights are used to diminish the
Directory of Open Access Journals (Sweden)
Jeffrey Rosenfeld
2016-03-01
Full Text Available Twenty one fully sequenced and well annotated insect genomes were used to construct genome content matrices for phylogenetic analysis and functional annotation of insect genomes. To examine the role of e-value cutoff in ortholog determination we used scaled e-value cutoffs and a single linkage clustering approach.. The present communication includes (1 a list of the genomes used to construct the genome content phylogenetic matrices, (2 a nexus file with the data matrices used in phylogenetic analysis, (3 a nexus file with the Newick trees generated by phylogenetic analysis, (4 an excel file listing the Core (CORE genes and Unique (UNI genes found in five insect groups, and (5 a figure showing a plot of consistency index (CI versus percent of unannotated genes that are apomorphies in the data set for gene losses and gains and bar plots of gains and losses for four consistency index (CI cutoffs.
Flavonoids as matrices for MALDI-TOF mass spectrometric analysis of transition metal complexes
Petkovic, Marijana; Petrovic, Biljana; Savic, Jasmina; Bugarcic, Zivadin D.; Dimitric-Markovic, Jasmina; Momic, Tatjana; Vasic, Vesna
2010-02-01
Matrix-assisted laser desorption and ionization time-of-flight mass spectrometry (MALDI-TOF MS) is a suitable method for the analysis of inorganic and organic compounds and biomolecules. This makes MALDI-TOF MS convenient for monitoring the interaction of metallo-drugs with biomolecules. Results presented in this manuscript demonstrate that flavonoids such as apigenin, kaempferol and luteolin are suitable for MALDI-TOF MS analysis of Pt(II), Pd(II), Pt(IV) and Ru(III) complexes, giving different signal-to-noise ratios of the analyte peak. The MALDI-TOF mass spectra of inorganic complexes acquired with these flavonoid matrices are easy to interpret and have some advantages over the application of other commonly used matrices: a low number of matrix peaks are detectable and the coordinative metal-ligand bond is, in most cases, preserved. On the other hand, flavonoids do not act as typical matrices, as their excess is not required for the acquisition of MALDI-TOF mass spectra of inorganic complexes.
Large-Capacity Three-Party Quantum Digital Secret Sharing Using Three Particular Matrices Coding
International Nuclear Information System (INIS)
Lai Hong; Tao Li; Liu Zhi-Ming; Luo Ming-Xing; Pieprzyk, Josef; Orgun, Mehmet A.
2016-01-01
In this paper, we develop a large-capacity quantum digital secret sharing (QDSS) scheme, combined the Fibonacci- and Lucas-valued orbital angular momentum (OAM) entanglement with the recursive Fibonacci and Lucas matrices. To be exact, Alice prepares pairs of photons in the Fibonacci- and Lucas-valued OAM entangled states, and then allocates them to two participants, say, Bob and Charlie, to establish the secret key. Moreover, the available Fibonacci and Lucas values from the matching entangled states are used as the seed for generating the Fibonacci and Lucas matrices. This is achieved because the entries of the Fibonacci and Lucas matrices are recursive. The secret key can only be obtained jointly by Bob and Charlie, who can further recover the secret. Its security is based on the facts that nonorthogonal states are indistinguishable, and Bob or Charlie detects a Fibonacci number, there is still a twofold uncertainty for Charlie' (Bob') detected value. (paper)
Diclofenac sodium sustained release hot melt extruded lipid matrices.
Vithani, K; Cuppok, Y; Mostafa, S; Slipper, I J; Snowden, M J; Douroumis, D
2014-08-01
Sustained release diclofenac sodium (Df-Na) solid lipid matrices with Compritol® 888 ATO were developed in this study. The drug/lipid powders were processed via cold and hot melt extrusion at various drug loadings. The influence of the processing temperatures, drug loading and the addition of excipients on the obtained dissolution rates was investigated. The physicochemical characterization of the extruded batches showed the existence of crystalline drug in the extrudates with a small amount being solubilized in the lipid matrix. The drug content and uniformity on the tablet surface were also investigated by using energy dispersive X-ray microanalysis. The dissolution rates were found to depend on the actual Df-Na loading and the nature of the added excipients, while the effect of the processing temperatures was negligible. The dissolution mechanism of all extruded formulations followed Peppas-Korsemeyer law, based on the estimated determination coefficients and the dissolution constant rates, indicating drug diffusion from the lipid matrices.
Determination of chromium in biological matrices by neutron activation
International Nuclear Information System (INIS)
McClendon, L.T.
1978-01-01
Chromium is recognized to be an essential trace element in several biological systems. It exists in many biological materials in a variety of chemical forms and very low concentration levels which cause problems for many analytical techniques. Both instrumental and destructive neutron activation analysis were used to determine the chromium concentration in Orchard Leaves, SRM 1571, Brewers Yeast, SRM 1569, and Bovine Liver, SRM 1577. Some of the problems inherent with determining chromium in certain biological matrices and the data obtained here at the National Bureau of Standards using this technique are discussed. The results obtained from dissolution of brewers yeast in a closed system as described in the DNAA procedure are in good agreement with the INAA results. The same phenomenon existed in the determination of chromium in bovine liver. The radiochemical procedure described for chromium (DNAA) provides the analyst with a simple, rapid and selective technique for chromium determination in a variety of matrices. (T.G.)
Energy Technology Data Exchange (ETDEWEB)
Fukuma, Masafumi; Sugishita, Sotaro; Umeda, Naoya [Department of Physics, Kyoto University,Kitashirakawa Oiwake-cho, Kyoto 606-8502 (Japan)
2015-07-17
We propose a class of models which generate three-dimensional random volumes, where each configuration consists of triangles glued together along multiple hinges. The models have matrices as the dynamical variables and are characterized by semisimple associative algebras A. Although most of the diagrams represent configurations which are not manifolds, we show that the set of possible diagrams can be drastically reduced such that only (and all of the) three-dimensional manifolds with tetrahedral decompositions appear, by introducing a color structure and taking an appropriate large N limit. We examine the analytic properties when A is a matrix ring or a group ring, and show that the models with matrix ring have a novel strong-weak duality which interchanges the roles of triangles and hinges. We also give a brief comment on the relationship of our models with the colored tensor models.
Factoring symmetric indefinite matrices on high-performance architectures
Jones, Mark T.; Patrick, Merrell L.
1990-01-01
The Bunch-Kaufman algorithm is the method of choice for factoring symmetric indefinite matrices in many applications. However, the Bunch-Kaufman algorithm does not take advantage of high-performance architectures such as the Cray Y-MP. Three new algorithms, based on Bunch-Kaufman factorization, that take advantage of such architectures are described. Results from an implementation of the third algorithm are presented.
Casas Ferreira, Ana María
2011-01-01
[ES] El objeto general de esta memoria consiste en proponer y desarrollar nuevas estrategias de tratamiento de muestra para la determinación de contaminantes orgánicos en matrices medioambientales. En muchos casos, cuando se trabaja con diferentes matrices, tales como aguas o suelos, es necesaria la utilización de técnicas de pretratamiento de muestra previas al análisis instrumental, cuyo objetivo principal es aislar los analitos de interés del resto de componentes presentes en la matriz...
Singh, Baljinder; Kumar, Ashwini; Malik, Ashok Kumar
2014-01-01
Due to the high toxicity of endocrine disruptors (EDs), studies are being undertaken to design effective techniques for separation and detection of EDs in various matrices. Recently, research activities in this area have shown that a diverse range of chromatographic techniques are available for the quantification and analysis of EDs. Therefore, on the basis of significant, recent original publications, we aimed at providing an overview of different separation and detection methods for the determination of trace-level concentrations of selected EDs. The biological effects of EDs and current pretreatment techniques applied to EDs are also discussed. Various types of chromatographic techniques are presented for quantification, highlighting time- and cost-effective techniques that separate and quantify trace levels of multiple EDs from various environmental matrices. Reports related to methods for the quantification of EDs from various matrices primarily published since 2008 have been cited.
Modelling the Long Term Leaching Behaviour of 137CS from Different Stabilized Waste Matrices
International Nuclear Information System (INIS)
El-Kamash, A.M.
2013-01-01
Leaching characteristics of ''1''3''7Cs from immobilized waste matrices in different cement-based grouts have been assessed to investigate the influence of the additives on the leaching behavior of the solid waste matrices. The International Atomic Energy's Agency (IAEA) standard leach method has been employed to study the leach pattern of 137 Cs radionuclide from the immobilized waste form. The examination of the leaching data revealed that clay additives reduces the leach rate for the studied radionuclide. The controlling leaching mechanism has been studied and the transport parameters were calculated for all studied waste matrices. Simplified analytical models have been derived to predict the Cumulative Leach Fraction (CLF) of radionuclides over the studied experimental period. These simplified research models could be used as a screening tool to assess the performance of the waste matrix under repository conditions. (author)
Smargiasso, Nicolas; Quinton, Loic; de Pauw, Edwin
2012-03-01
One of the mechanisms leading to MALDI in-source decay (MALDI ISD) is the transfer of hydrogen radicals to analytes upon laser irradiation. Analytes such as peptides or proteins may undergo ISD and this method can therefore be exploited for top-down sequencing. When performed on peptides, radical-induced ISD results in production of c- and z-ions, as also found in ETD and ECD activation. Here, we describe two new compounds which, when used as MALDI matrices, are able to efficiently induce ISD of peptides and proteins: 2-aminobenzamide and 2-aminobenzoic acid. In-source reduction of the disulfide bridge containing peptide Calcitonin further confirmed the radicalar mechanism of the ISD process. ISD of peptides led, in addition to c- and z-ions, to the generation of a-, x-, and y-ions both in positive and in negative ion modes. Finally, good sequence coverage was obtained for the sequencing of myoglobin (17 kDa protein), confirming the effectiveness of both 2-aminobenzamide and 2-aminobenzoic acid as MALDI ISD matrices.
Energy Technology Data Exchange (ETDEWEB)
Nardova, A.K.; Filippov, E.A. [All Research Institute of Chemical Technologies, Moscow (Russian Federation); Glagolenko, Y.B. [and others
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.
Diagonal K-matrices and transfer matrix eigenspectra associated with the G(1)2 R-matrix
International Nuclear Information System (INIS)
Yung, C.M.; Batchelor, M.T.
1995-01-01
We find all the diagonal K-matrices for the R-matrix associated with the minimal representation of the exceptional affine algebra G (1) 2 . The corresponding transfer matrices are diagonalized with a variation of the analytic Bethe ansatz. We find many similarities with the case of the Izergin-Korepin R-matrix associated with the affine algebra A (2) 2 . ((orig.))
International Nuclear Information System (INIS)
Roussin, R.W.; Drischler, J.D.; Marable, J.H.
1980-01-01
In recent years multigroup sensitivity profiles and covariance matrices have been added to the Radiation Shielding Information Center's Data Library Collection (DLC). Sensitivity profiles are available in a single package. DLC-45/SENPRO, and covariance matrices are found in two packages, DLC-44/COVERX and DLC-77/COVERV. The contents of these packages are described and their availability is discussed
Noisy covariance matrices and portfolio optimization II
Pafka, Szilárd; Kondor, Imre
2003-03-01
Recent studies inspired by results from random matrix theory (Galluccio et al.: Physica A 259 (1998) 449; Laloux et al.: Phys. Rev. Lett. 83 (1999) 1467; Risk 12 (3) (1999) 69; Plerou et al.: Phys. Rev. Lett. 83 (1999) 1471) found that covariance matrices determined from empirical financial time series appear to contain such a high amount of noise that their structure can essentially be regarded as random. This seems, however, to be in contradiction with the fundamental role played by covariance matrices in finance, which constitute the pillars of modern investment theory and have also gained industry-wide applications in risk management. Our paper is an attempt to resolve this embarrassing paradox. The key observation is that the effect of noise strongly depends on the ratio r= n/ T, where n is the size of the portfolio and T the length of the available time series. On the basis of numerical experiments and analytic results for some toy portfolio models we show that for relatively large values of r (e.g. 0.6) noise does, indeed, have the pronounced effect suggested by Galluccio et al. (1998), Laloux et al. (1999) and Plerou et al. (1999) and illustrated later by Laloux et al. (Int. J. Theor. Appl. Finance 3 (2000) 391), Plerou et al. (Phys. Rev. E, e-print cond-mat/0108023) and Rosenow et al. (Europhys. Lett., e-print cond-mat/0111537) in a portfolio optimization context, while for smaller r (around 0.2 or below), the error due to noise drops to acceptable levels. Since the length of available time series is for obvious reasons limited in any practical application, any bound imposed on the noise-induced error translates into a bound on the size of the portfolio. In a related set of experiments we find that the effect of noise depends also on whether the problem arises in asset allocation or in a risk measurement context: if covariance matrices are used simply for measuring the risk of portfolios with a fixed composition rather than as inputs to optimization, the
Study of remobilization polycyclic aromatic hydrocarbons (PAHs) in contaminated matrices
International Nuclear Information System (INIS)
Belkessam, L.; Vessigaud, S.; Laboudigue, A.; Vessigaud, S.; Perrin-Ganier, C.; Schiavon, M.; Denys, S.
2005-01-01
Polycyclic aromatic hydrocarbons (PAHs) originate from many pyrolysis processes. They are widespread environmental pollutants because some of them present toxic and genotoxic properties. In coal pyrolysis sites such as former manufactured gas plants and coke production plants, coal tar is a major source of PAHs. The management of such sites requires better understanding of the mechanisms that control release of PAHs to the biosphere. Determining total PAH concentrations is not sufficient since it does not inform about the pollutants availability to environmental processes. The fate and transport of PAHs in soil are governed by sorption and microbial processes which are well documented. Globally, enhancing retention of the compounds by a solid matrix reduces the risk of pollutant dispersion, but decreases their accessibility to microbial microflora. Conversely, the remobilization of organics from contaminated solid matrices represents a potential hazard since these pollutants can reach groundwater resources. However the available data are often obtained from laboratory experiments in which many field parameters can not be taken into account (long term, temperature, co-pollution, ageing phenomenon, heterogenous distribution of pollution). The present work focuses on the influence assessment and understanding of some of these parameters on PAHs remobilization from heavily polluted matrices in near-field conditions (industrial contaminated matrices, high contact time, ..). Results concerning effects of temperature and physical state of pollution (dispersed among the soil or condensed in small clusters or in coal tar) are presented. (authors)
Simplifications of rational matrices by using UML
Tasić, Milan B.; Stanimirović, Ivan P.
2013-01-01
The simplification process on rational matrices consists of simplifying each entry represented by a rational function. We follow the classic approach of dividing the numerator and denominator polynomials by their common GCD polynomial, and provide the activity diagram in UML for this process. A rational matrix representation as the quotient of a polynomial matrix and a polynomial is also discussed here and illustrated via activity diagrams. Also, a class diagram giving the links between the c...
Directory of Open Access Journals (Sweden)
Carla Regina Amorim dos Anjos Queiroz
2015-03-01
Full Text Available Pereskia aculeata Mill., popularly known in Brazil as “Ora-pro-nobis”, is an unconventional edible vegetable. Taking into account its potential for agronomic cultivation, this study aimed to evaluate the growth response of this plant under intermittent drought through controlled reductions in the substrate matric potential, in a greenhouse. Treatments consisted of adding to the pots a volume of water to raise the matric potential to -5 kPa, according to the water retention curve in the substrate, whenever the mean substrate matric potential reached values between -10 kPa and -70 kPa, depending on the treatment. At 140 days after transplanting, leaf area and dry mass of leaves, stems and roots were determined. The intermittent reduction of the matric potential in the root zone of “Ora-pro-nobis” affected less the dry mass accumulation in leaves (reduction of 21.4% than in stems (reduction of 48.1% and roots (reduction of 63.7%, and that is interesting because leaves are the main commercial product of this plant. The treatment also modified the proportionality of dry mass allocation among plant parts and reduced the photosynthetic efficiency of leaves, fact evidenced by the linear increase of the specific leaf area (0.63 cm2 g-1kPa-1 and leaf area ratio (0.39 cm-2 g-1kPa-1, although not affecting directly the leaf area.
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.
Detection of Crossing White Matter Fibers with High-Order Tensors and Rank-k Decompositions
Jiao, Fangxiang; Gur, Yaniv; Johnson, Chris R.; Joshi, Sarang
2011-01-01
Fundamental to high angular resolution diffusion imaging (HARDI), is the estimation of a positive-semidefinite orientation distribution function (ODF) and extracting the diffusion properties (e.g., fiber directions). In this work we show that these two goals can be achieved efficiently by using homogeneous polynomials to represent the ODF in the spherical deconvolution approach, as was proposed in the Cartesian Tensor-ODF (CT-ODF) formulation. Based on this formulation we first suggest an estimation method for positive-semidefinite ODF by solving a linear programming problem that does not require special parameterization of the ODF. We also propose a rank-k tensor decomposition, known as CP decomposition, to extract the fibers information from the estimated ODF. We show that this decomposition is superior to the fiber direction estimation via ODF maxima detection as it enables one to reach the full fiber separation resolution of the estimation technique. We assess the accuracy of this new framework by applying it to synthetic and experimentally obtained HARDI data. © 2011 Springer-Verlag.
On the nonnegative inverse eigenvalue problem of traditional matrices
Directory of Open Access Journals (Sweden)
Alimohammad Nazari
2014-07-01
Full Text Available In this paper, at first for a given set of real or complex numbers $\\sigma$ with nonnegativesummation, we introduce some special conditions that with them there is no nonnegativetridiagonal matrix in which $\\sigma$ is its spectrum. In continue we present some conditions forexistence such nonnegative tridiagonal matrices.
Construction of MDS self-dual codes from orthogonal matrices
Shi, Minjia; Sok, Lin; Solé, Patrick
2016-01-01
In this paper, we give algorithms and methods of construction of self-dual codes over finite fields using orthogonal matrices. Randomization in the orthogonal group, and code extension are the main tools. Some optimal, almost MDS, and MDS self-dual codes over both small and large prime fields are constructed.
A primal-dual interior point method for large-scale free material optimization
DEFF Research Database (Denmark)
Weldeyesus, Alemseged Gebrehiwot; Stolpe, Mathias
2015-01-01
Free Material Optimization (FMO) is a branch of structural optimization in which the design variable is the elastic material tensor that is allowed to vary over the design domain. The requirements are that the material tensor is symmetric positive semidefinite with bounded trace. The resulting...... optimization problem is a nonlinear semidefinite program with many small matrix inequalities for which a special-purpose optimization method should be developed. The objective of this article is to propose an efficient primal-dual interior point method for FMO that can robustly and accurately solve large...... of iterations the interior point method requires is modest and increases only marginally with problem size. The computed optimal solutions obtain a higher precision than other available special-purpose methods for FMO. The efficiency and robustness of the method is demonstrated by numerical experiments on a set...
A structural analysis of a regional economy using social accounting matrices 1990-1999
Lima, M. Carmen; Cardenete Flores, Manuel Alejandro; Hewings, Geoffrey J.D.; Vallés Ferrer, José
2004-01-01
Las matrices de contabilidad social (MCS) son un instrumento que permite ampliar la información proporcionada por el análisis imput-output al recoger además de las relaciones intersectoriales de una economía, el comportamiento de los consumidores, el sector público o el sector exterior, logrando así completar el flujo circular de la renta. En este trabajo utilizamos las matrices de contabilidad social para Andalucía correspondientes a los años 1990, 1995 y 1999 elaboradas en trabajos previos....
Fourier-Based Transmit Beampattern Design Using MIMO Radar
Lipor, John
2014-05-01
In multiple-input multiple-output (MIMO) radar settings, it is often desirable to transmit power only to a given location or set of locations defined by a beampattern. Transmit waveform design is a topic that has received much attention recently, involving synthesis of both the signal covariance matrix,, as well as the actual waveforms. Current methods involve a two-step process of designing via iterative solutions and then using to generate waveforms that fulfill practical constraints such as having a constant-envelope or drawing from a finite alphabet. In this paper, a closed-form method to design for a uniform linear array is proposed that utilizes the discrete Fourier transform (DFT) coefficients and Toeplitz matrices. The resulting covariance matrix fulfills the practical constraints such as positive semidefiniteness and the uniformelemental power constraint and provides performance similar to that of iterative methods, which require a much greater computation time. Next, a transmit architecture is presented that exploits the orthogonality of frequencies at discrete DFT values to transmit a sum of orthogonal signals from each antenna. The resulting waveforms provide a lower mean-square error than current methods at a much lower computational cost, and a simulated detection scenario demonstrates the performance advantages achieved.
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.
The Golden mean, Fibonacci matrices and partial weakly super-increasing sources
International Nuclear Information System (INIS)
Esmaeili, M.; Gulliver, T.A.; Kakhbod, A.
2009-01-01
A source S={s 1 ,s 2 ,...}, with at least i+1 source symbols, having a binary Huffman code with codeword lengths satisfying l 1 =1,l 2 =2,...,l i =i, is called an i-level partial weakly super-increasing (PWSI) source. Connections between these sources, Fibonacci matrices and the Golden mean are studied. It is shown that the Euclidean projection of the distributions associated with these sources is given by Fibonacci-Hessenberg matrices. While there is no upper bound on the expected codeword length of Huffman codes representing PWSI sources (and hence no upper bound on their entropy), the Fibonacci sequence and the Golden mean (1+√(5))/2 provide a lower bound on the maximum expected codeword length of these codes.
Modeling and Forecasting Large Realized Covariance Matrices and Portfolio Choice
Callot, Laurent A.F.; Kock, Anders B.; Medeiros, Marcelo C.
2017-01-01
We consider modeling and forecasting large realized covariance matrices by penalized vector autoregressive models. We consider Lasso-type estimators to reduce the dimensionality and provide strong theoretical guarantees on the forecast capability of our procedure. We show that we can forecast