Perception and musical preferences in Wishart's work

DEFF Research Database (Denmark)

Brattico, E; Sassanelli, F

2000-01-01

This paper has its origin from the analysis of the works of Trevor Wishart, one of the most representative composers of the English electroacoustic tradition, who has been orienting his research to study the possibilities of electroacoustics applied to human voice. Quoting Schaeffer, ill his book...... to human language differently manipulated,Wishart gives his personal interpretation of the problem. His solution and how it is coherent with the last theories and findings of cognitive sciences are here examined....

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

Virial expansion for almost diagonal random matrices

Science.gov (United States)

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\

Free probability and random matrices

CERN Document Server

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.

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

Science.gov (United States)

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

Functional inverted Wishart for Bayesian multivariate spatial modeling with application to regional climatology model data.

Science.gov (United States)

Duan, L L; Szczesniak, R D; Wang, X

2017-11-01

Modern environmental and climatological studies produce multiple outcomes at high spatial resolutions. Multivariate spatial modeling is an established means to quantify cross-correlation among outcomes. However, existing models typically suffer from poor computational efficiency and lack the flexibility to simultaneously estimate auto- and cross-covariance structures. In this article, we undertake a novel construction of covariance by utilizing spectral convolution and by imposing an inverted Wishart prior on the cross-correlation structure. The cross-correlation structure with this functional inverted Wishart prior flexibly accommodates not only positive but also weak or negative associations among outcomes while preserving spatial resolution. Furthermore, the proposed model is computationally efficient and produces easily interpretable results, including the individual autocovariances and full cross-correlation matrices, as well as a partial cross-correlation matrix reflecting the outcome correlation after excluding the effects caused by spatial convolution. The model is examined using simulated data sets under different scenarios. It is also applied to the data from the North American Regional Climate Change Assessment Program, examining long-term associations between surface outcomes for air temperature, pressure, humidity, and radiation, on the land area of the North American West Coast. Results and predictive performance are compared with findings from approaches using convolution only or coregionalization.

Functional inverted Wishart for Bayesian multivariate spatial modeling with application to regional climatology model data

Science.gov (United States)

Duan, L. L.; Szczesniak, R. D.; Wang, X.

2018-01-01

Modern environmental and climatological studies produce multiple outcomes at high spatial resolutions. Multivariate spatial modeling is an established means to quantify cross-correlation among outcomes. However, existing models typically suffer from poor computational efficiency and lack the flexibility to simultaneously estimate auto- and cross-covariance structures. In this article, we undertake a novel construction of covariance by utilizing spectral convolution and by imposing an inverted Wishart prior on the cross-correlation structure. The cross-correlation structure with this functional inverted Wishart prior flexibly accommodates not only positive but also weak or negative associations among outcomes while preserving spatial resolution. Furthermore, the proposed model is computationally efficient and produces easily interpretable results, including the individual autocovariances and full cross-correlation matrices, as well as a partial cross-correlation matrix reflecting the outcome correlation after excluding the effects caused by spatial convolution. The model is examined using simulated data sets under different scenarios. It is also applied to the data from the North American Regional Climate Change Assessment Program, examining long-term associations between surface outcomes for air temperature, pressure, humidity, and radiation, on the land area of the North American West Coast. Results and predictive performance are compared with findings from approaches using convolution only or coregionalization. PMID:29576735

A Fractionally Integrated Wishart Stochastic Volatility Model

NARCIS (Netherlands)

M. Asai (Manabu); M.J. McAleer (Michael)

2013-01-01

textabstractThere has recently been growing interest in modeling and estimating alternative continuous time multivariate stochastic volatility models. We propose a continuous time fractionally integrated Wishart stochastic volatility (FIWSV) process. We derive the conditional Laplace transform of

On the Wigner law in dilute random matrices

Science.gov (United States)

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.

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

Efficient Bayesian hierarchical functional data analysis with basis function approximations using Gaussian-Wishart processes.

Science.gov (United States)

Yang, Jingjing; Cox, Dennis D; Lee, Jong Soo; Ren, Peng; Choi, Taeryon

2017-12-01

Functional data are defined as realizations of random functions (mostly smooth functions) varying over a continuum, which are usually collected on discretized grids with measurement errors. In order to accurately smooth noisy functional observations and deal with the issue of high-dimensional observation grids, we propose a novel Bayesian method based on the Bayesian hierarchical model with a Gaussian-Wishart process prior and basis function representations. We first derive an induced model for the basis-function coefficients of the functional data, and then use this model to conduct posterior inference through Markov chain Monte Carlo methods. Compared to the standard Bayesian inference that suffers serious computational burden and instability in analyzing high-dimensional functional data, our method greatly improves the computational scalability and stability, while inheriting the advantage of simultaneously smoothing raw observations and estimating the mean-covariance functions in a nonparametric way. In addition, our method can naturally handle functional data observed on random or uncommon grids. Simulation and real studies demonstrate that our method produces similar results to those obtainable by the standard Bayesian inference with low-dimensional common grids, while efficiently smoothing and estimating functional data with random and high-dimensional observation grids when the standard Bayesian inference fails. In conclusion, our method can efficiently smooth and estimate high-dimensional functional data, providing one way to resolve the curse of dimensionality for Bayesian functional data analysis with Gaussian-Wishart processes. © 2017, The International Biometric Society.

Orthogonal polynomials and random matrices

CERN Document Server

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.

Simple simulation schemes for CIR and Wishart processes

DEFF Research Database (Denmark)

Pisani, Camilla

2013-01-01

We develop some simple simulation algorithms for CIR and Wishart processes. The main idea is the splitting of their generator into the sum of the square of an Ornstein-Uhlenbeck matrix process and a deterministic process. Joint work with Paolo Baldi, Tor Vergata University, Rome...

Intermittency and random matrices

Science.gov (United States)

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.

The rank of a normally distributed matrix and positive definiteness of a noncentral Wishart distributed matrix

NARCIS (Netherlands)

Steerneman, A. G. M.; van Perlo-ten Kleij, Frederieke

2008-01-01

If X similar to N-nxk(M, I-n circle times Sigma), then S = X'X has the noncentral Wishart distribution W-k(')(n, Sigma; A), where Lambda = M'M. Here Sigma is allowed to be singular. It is well known that if Lambda = 0, then S has a (central) Wishart distribution and. S is positive definite with

Introduction to random matrices theory and practice

CERN Document Server

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.

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...

Eigenfunction statistics of Wishart Brownian ensembles

International Nuclear Information System (INIS)

Shukla, Pragya

2017-01-01

We theoretically analyze the eigenfunction fluctuation measures for a Hermitian ensemble which appears as an intermediate state of the perturbation of a stationary ensemble by another stationary ensemble of Wishart (Laguerre) type. Similar to the perturbation by a Gaussian stationary ensemble, the measures undergo a diffusive dynamics in terms of the perturbation parameter but the energy-dependence of the fluctuations is different in the two cases. This may have important consequences for the eigenfunction dynamics as well as phase transition studies in many areas of complexity where Brownian ensembles appear. (paper)

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

G0-WISHART Distribution Based Classification from Polarimetric SAR Images

Science.gov (United States)

Hu, G. C.; Zhao, Q. H.

2017-09-01

Enormous scientific and technical developments have been carried out to further improve the remote sensing for decades, particularly Polarimetric Synthetic Aperture Radar(PolSAR) technique, so classification method based on PolSAR images has getted much more attention from scholars and related department around the world. The multilook polarmetric G0-Wishart model is a more flexible model which describe homogeneous, heterogeneous and extremely heterogeneous regions in the image. Moreover, the polarmetric G0-Wishart distribution dose not include the modified Bessel function of the second kind. It is a kind of simple statistical distribution model with less parameter. To prove its feasibility, a process of classification has been tested with the full-polarized Synthetic Aperture Radar (SAR) image by the method. First, apply multilook polarimetric SAR data process and speckle filter to reduce speckle influence for classification result. Initially classify the image into sixteen classes by H/A/α decomposition. Using the ICM algorithm to classify feature based on the G0-Wshart distance. Qualitative and quantitative results show that the proposed method can classify polaimetric SAR data effectively and efficiently.

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)

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

OpenAIRE

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 ...

Numerically Stable Evaluation of Moments of Random Gram Matrices With Applications

KAUST Repository

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

KAUST Repository

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.

Universality for 1d Random Band Matrices: Sigma-Model Approximation

Science.gov (United States)

Shcherbina, Mariya; Shcherbina, Tatyana

2018-02-01

The paper continues the development of the rigorous supersymmetric transfer matrix approach to the random band matrices started in (J Stat Phys 164:1233-1260, 2016; Commun Math Phys 351:1009-1044, 2017). We consider random Hermitian block band matrices consisting of W× W random Gaussian blocks (parametrized by j,k \\in Λ =[1,n]^d\\cap Z^d ) with a fixed entry's variance J_{jk}=δ _{j,k}W^{-1}+β Δ _{j,k}W^{-2} , β >0 in each block. Taking the limit W→ ∞ with fixed n and β , we derive the sigma-model approximation of the second correlation function similar to Efetov's one. Then, considering the limit β , n→ ∞, we prove that in the dimension d=1 the behaviour of the sigma-model approximation in the bulk of the spectrum, as β ≫ n , is determined by the classical Wigner-Dyson statistics.

Level density of random matrices for decaying systems

International Nuclear Information System (INIS)

Haake, F.; Izrailev, F.; Saher, D.; Sommers, H.-J.

1991-01-01

Analytical and numerical results for the level density of a certain class of random non-Hermitian matrices H=H+iΓ are presented. The conservative part H belongs to the Gaussian orthogonal ensemble while the damping piece Γ is quadratic in Gaussian random numbers and may describe the decay of resonances through various channels. In the limit of a large matrix dimension the level density assumes a surprisingly simple dependence on the relative strength of the damping and the number of channels. 18 refs.; 4 figs

Random volumes from matrices

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.

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.

2D gravity and random matrices

International Nuclear Information System (INIS)

Zinn-Justin, J.

1990-01-01

Recent progress in 2D gravity coupled to d ≤ 1 matter, based on a representation of discrete gravity in terms of random matrices, is reported. The matrix problem can be solved in many cases by the introduction of suitable orthogonal polynomials. Alternatively in the continuum limit the orthogonal polynomial method can be shown to be equivalent to the construction of representation of the canonical commutation relations in terms of differential operators. In the case of pure gravity or discrete Ising-like matter the sum over topologies is reduced to the solution of non-linear differential equations. The d = 1 problem can be solved by semiclassical methods

Optimal Portfolios in Wishart Models and Effects of Discrete Rebalancing on Portfolio Distribution and Strategy Selection

OpenAIRE

Li, Zejing

2012-01-01

This dissertation is mainly devoted to the research of two problems - the continuous-time portfolio optimization in different Wishart models and the effects of discrete rebalancing on portfolio wealth distribution and optimal portfolio strategy.

Covariance-Based Estimation from Multisensor Delayed Measurements with Random Parameter Matrices and Correlated Noises

Directory of Open Access Journals (Sweden)

R. Caballero-Águila

2014-01-01

Full Text Available The optimal least-squares linear estimation problem is addressed for a class of discrete-time multisensor linear stochastic systems subject to randomly delayed measurements with different delay rates. For each sensor, a different binary sequence is used to model the delay process. The measured outputs are perturbed by both random parameter matrices and one-step autocorrelated and cross correlated noises. Using an innovation approach, computationally simple recursive algorithms are obtained for the prediction, filtering, and smoothing problems, without requiring full knowledge of the state-space model generating the signal process, but only the information provided by the delay probabilities and the mean and covariance functions of the processes (signal, random parameter matrices, and noises involved in the observation model. The accuracy of the estimators is measured by their error covariance matrices, which allow us to analyze the estimator performance in a numerical simulation example that illustrates the feasibility of the proposed algorithms.

A theory of solving TAP equations for Ising models with general invariant random matrices

DEFF Research Database (Denmark)

Opper, Manfred; Çakmak, Burak; Winther, Ole

2016-01-01

We consider the problem of solving TAP mean field equations by iteration for Ising models with coupling matrices that are drawn at random from general invariant ensembles. We develop an analysis of iterative algorithms using a dynamical functional approach that in the thermodynamic limit yields...... the iteration dependent on a Gaussian distributed field only. The TAP magnetizations are stable fixed points if a de Almeida–Thouless stability criterion is fulfilled. We illustrate our method explicitly for coupling matrices drawn from the random orthogonal ensemble....

On the mean density of complex eigenvalues for an ensemble of random matrices with prescribed singular values

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)

Change detection in polarimetric SAR data over several time points

DEFF Research Database (Denmark)

Conradsen, Knut; Nielsen, Allan Aasbjerg; Skriver, Henning

2014-01-01

A test statistic for the equality of several variance-covariance matrices following the complex Wishart distribution is introduced. The test statistic is applied successfully to detect change in C-band EMISAR polarimetric SAR data over four time points.......A test statistic for the equality of several variance-covariance matrices following the complex Wishart distribution is introduced. The test statistic is applied successfully to detect change in C-band EMISAR polarimetric SAR data over four time points....

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.

Improving Wishart Classification of Polarimetric SAR Data Using the Hopfield Neural Network Optimization Approach

Directory of Open Access Journals (Sweden)

Íñigo Molina

2012-11-01

Full Text Available This paper proposes the optimization relaxation approach based on the analogue Hopfield Neural Network (HNN for cluster refinement of pre-classified Polarimetric Synthetic Aperture Radar (PolSAR image data. We consider the initial classification provided by the maximum-likelihood classifier based on the complex Wishart distribution, which is then supplied to the HNN optimization approach. The goal is to improve the classification results obtained by the Wishart approach. The classification improvement is verified by computing a cluster separability coefficient and a measure of homogeneity within the clusters. During the HNN optimization process, for each iteration and for each pixel, two consistency coefficients are computed, taking into account two types of relations between the pixel under consideration and its corresponding neighbors. Based on these coefficients and on the information coming from the pixel itself, the pixel under study is re-classified. Different experiments are carried out to verify that the proposed approach outperforms other strategies, achieving the best results in terms of separability and a trade-off with the homogeneity preserving relevant structures in the image. The performance is also measured in terms of computational central processing unit (CPU times.

Research Article Comparing covariance matrices: random skewers method compared to the common principal components model

Directory of Open Access Journals (Sweden)

James M. Cheverud

2007-03-01

Full Text Available Comparisons of covariance patterns are becoming more common as interest in the evolution of relationships between traits and in the evolutionary phenotypic diversification of clades have grown. We present parallel analyses of covariance matrix similarity for cranial traits in 14 New World Monkey genera using the Random Skewers (RS, T-statistics, and Common Principal Components (CPC approaches. We find that the CPC approach is very powerful in that with adequate sample sizes, it can be used to detect significant differences in matrix structure, even between matrices that are virtually identical in their evolutionary properties, as indicated by the RS results. We suggest that in many instances the assumption that population covariance matrices are identical be rejected out of hand. The more interesting and relevant question is, How similar are two covariance matrices with respect to their predicted evolutionary responses? This issue is addressed by the random skewers method described here.

Sparse random matrices: The eigenvalue spectrum revisited

International Nuclear Information System (INIS)

Semerjian, Guilhem; Cugliandolo, Leticia F.

2003-08-01

We revisit the derivation of the density of states of sparse random matrices. We derive a recursion relation that allows one to compute the spectrum of the matrix of incidence for finite trees that determines completely the low concentration limit. Using the iterative scheme introduced by Biroli and Monasson [J. Phys. A 32, L255 (1999)] we find an approximate expression for the density of states expected to hold exactly in the opposite limit of large but finite concentration. The combination of the two methods yields a very simple geometric interpretation of the tails of the spectrum. We test the analytic results with numerical simulations and we suggest an indirect numerical method to explore the tails of the spectrum. (author)

A differential calculus for random matrices with applications to (max,+)-linear stochastic systems

NARCIS (Netherlands)

Heidergott, B.F.

2001-01-01

We introducet he concept of weak differentiabilityf or randomm atricesa nd therebyo btain closedform analytical expressions for derivatives of functions of random matrices. More specifically, we develop a calculus of weak differentiationf or randomm atricest hat resembles the standardc alculus of

On the extreme value statistics of normal random matrices and 2D Coulomb gases: Universality and finite N corrections

Science.gov (United States)

Ebrahimi, R.; Zohren, S.

2018-03-01

In this paper we extend the orthogonal polynomials approach for extreme value calculations of Hermitian random matrices, developed by Nadal and Majumdar (J. Stat. Mech. P04001 arXiv:1102.0738), to normal random matrices and 2D Coulomb gases in general. Firstly, we show that this approach provides an alternative derivation of results in the literature. More precisely, we show convergence of the rescaled eigenvalue with largest modulus of a normal Gaussian ensemble to a Gumbel distribution, as well as universality for an arbitrary radially symmetric potential. Secondly, it is shown that this approach can be generalised to obtain convergence of the eigenvalue with smallest modulus and its universality for ring distributions. Most interestingly, the here presented techniques are used to compute all slowly varying finite N correction of the above distributions, which is important for practical applications, given the slow convergence. Another interesting aspect of this work is the fact that we can use standard techniques from Hermitian random matrices to obtain the extreme value statistics of non-Hermitian random matrices resembling the large N expansion used in context of the double scaling limit of Hermitian matrix models in string theory.

NATO Advanced Study Institute: Marie Curie Training Course: Applications of Random Matrices in Physics

CERN Document Server

Kazakov, Vladimir; Serban, Didina; Wiegmann, Paul; Zabrodin, Anton

2006-01-01

Random matrices are widely and successfully used in physics for almost 60-70 years, beginning with the works of Dyson and Wigner. Although it is an old subject, it is constantly developing into new areas of physics and mathematics. It constitutes now a part of the general culture of a theoretical physicist. Mathematical methods inspired by random matrix theory become more powerful, sophisticated and enjoy rapidly growing applications in physics. Recent examples include the calculation of universal correlations in the mesoscopic system, new applications in disordered and quantum chaotic systems, in combinatorial and growth models, as well as the recent breakthrough, due to the matrix models, in two dimensional gravity and string theory and the non-abelian gauge theories. The book consists of the lectures of the leading specialists and covers rather systematically many of these topics. It can be useful to the specialists in various subjects using random matrices, from PhD students to confirmed scientists.

Products of random matrices from fixed trace and induced Ginibre ensembles

Science.gov (United States)

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.

2 × 2 random matrix ensembles with reduced symmetry: from Hermitian to PT -symmetric matrices

International Nuclear Information System (INIS)

Gong Jiangbin; Wang Qinghai

2012-01-01

A possibly fruitful extension of conventional random matrix ensembles is proposed by imposing symmetry constraints on conventional Hermitian matrices or parity–time (PT)-symmetric matrices. To illustrate the main idea, we first study 2 × 2 complex Hermitian matrix ensembles with O(2)-invariant constraints, yielding novel level-spacing statistics such as singular distributions, the half-Gaussian distribution, distributions interpolating between the GOE (Gaussian orthogonal ensemble) distribution and half-Gaussian distributions, as well as the gapped-GOE distribution. Such a symmetry-reduction strategy is then used to explore 2 × 2 PT-symmetric matrix ensembles with real eigenvalues. In particular, PT-symmetric random matrix ensembles with U(2) invariance can be constructed, with the conventional complex Hermitian random matrix ensemble being a special case. In two examples of PT-symmetric random matrix ensembles, the level-spacing distributions are found to be the standard GUE (Gaussian unitary ensemble) statistics or the ‘truncated-GUE’ statistics. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to ‘Quantum physics with non-Hermitian operators’. (paper)

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

Multivariable Christoffel-Darboux Kernels and Characteristic Polynomials of Random Hermitian Matrices

Directory of Open Access Journals (Sweden)

Hjalmar Rosengren

2006-12-01

Full Text Available We study multivariable Christoffel-Darboux kernels, which may be viewed as reproducing kernels for antisymmetric orthogonal polynomials, and also as correlation functions for products of characteristic polynomials of random Hermitian matrices. Using their interpretation as reproducing kernels, we obtain simple proofs of Pfaffian and determinant formulas, as well as Schur polynomial expansions, for such kernels. In subsequent work, these results are applied in combinatorics (enumeration of marked shifted tableaux and number theory (representation of integers as sums of squares.

Finite-range Coulomb gas models of banded random matrices and quantum kicked rotors.

Science.gov (United States)

Pandey, Akhilesh; Kumar, Avanish; Puri, Sanjay

2017-11-01

Dyson demonstrated an equivalence between infinite-range Coulomb gas models and classical random matrix ensembles for the study of eigenvalue statistics. We introduce finite-range Coulomb gas (FRCG) models via a Brownian matrix process, and study them analytically and by Monte Carlo simulations. These models yield new universality classes, and provide a theoretical framework for the study of banded random matrices (BRMs) and quantum kicked rotors (QKRs). We demonstrate that, for a BRM of bandwidth b and a QKR of chaos parameter α, the appropriate FRCG model has the effective range d=b^{2}/N=α^{2}/N, for large N matrix dimensionality. As d increases, there is a transition from Poisson to classical random matrix statistics.

Change detection in a time series of polarimetric SAR images

DEFF Research Database (Denmark)

Skriver, Henning; Nielsen, Allan Aasbjerg; Conradsen, Knut

A test statistic for the equality of two or several variance-covariance matrices following the real (as opposed to the complex) Wishart distribution with an associated probability of finding a smaller value of the test statistic is described in the literature [1]. In 2003 we introduced a test...... statistic for the equality of two variance-covariance matrices following the complex Wishart distribution with an associated probability measure [2]. In that paper we also demonstrated the use of the test statistic to change detection over time in both fully polarimetric and azimuthal symmetric SAR data...... positives (postulating a change when there actually is none) and/or false negatives (missing an actual change). Therefore we need to test for equality for all time points simultaneously. In this paper we demonstrate a new test statistic for the equality of several variance-covariance matrices from the real...

Efficient Statistical Extraction of the Per-Unit-Length Capacitance and Inductance Matrices of Cables with Random Parameters

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.

Dynamic fair node spectrum allocation for ad hoc networks using random matrices

Science.gov (United States)

Rahmes, Mark; Lemieux, George; Chester, Dave; Sonnenberg, Jerry

2015-05-01

Dynamic Spectrum Access (DSA) is widely seen as a solution to the problem of limited spectrum, because of its ability to adapt the operating frequency of a radio. Mobile Ad Hoc Networks (MANETs) can extend high-capacity mobile communications over large areas where fixed and tethered-mobile systems are not available. In one use case with high potential impact, cognitive radio employs spectrum sensing to facilitate the identification of allocated frequencies not currently accessed by their primary users. Primary users own the rights to radiate at a specific frequency and geographic location, while secondary users opportunistically attempt to radiate at a specific frequency when the primary user is not using it. We populate a spatial radio environment map (REM) database with known information that can be leveraged in an ad hoc network to facilitate fair path use of the DSA-discovered links. Utilization of high-resolution geospatial data layers in RF propagation analysis is directly applicable. Random matrix theory (RMT) is useful in simulating network layer usage in nodes by a Wishart adjacency matrix. We use the Dijkstra algorithm for discovering ad hoc network node connection patterns. We present a method for analysts to dynamically allocate node-node path and link resources using fair division. User allocation of limited resources as a function of time must be dynamic and based on system fairness policies. The context of fair means that first available request for an asset is not envied as long as it is not yet allocated or tasked in order to prevent cycling of the system. This solution may also save money by offering a Pareto efficient repeatable process. We use a water fill queue algorithm to include Shapley value marginal contributions for allocation.

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

Science.gov (United States)

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.

Crossover ensembles of random matrices and skew-orthogonal polynomials

International Nuclear Information System (INIS)

Kumar, Santosh; Pandey, Akhilesh

2011-01-01

Highlights: → We study crossover ensembles of Jacobi family of random matrices. → We consider correlations for orthogonal-unitary and symplectic-unitary crossovers. → We use the method of skew-orthogonal polynomials and quaternion determinants. → We prove universality of spectral correlations in crossover ensembles. → We discuss applications to quantum conductance and communication theory problems. - Abstract: In a recent paper (S. Kumar, A. Pandey, Phys. Rev. E, 79, 2009, p. 026211) we considered Jacobi family (including Laguerre and Gaussian cases) of random matrix ensembles and reported exact solutions of crossover problems involving time-reversal symmetry breaking. In the present paper we give details of the work. We start with Dyson's Brownian motion description of random matrix ensembles and obtain universal hierarchic relations among the unfolded correlation functions. For arbitrary dimensions we derive the joint probability density (jpd) of eigenvalues for all transitions leading to unitary ensembles as equilibrium ensembles. We focus on the orthogonal-unitary and symplectic-unitary crossovers and give generic expressions for jpd of eigenvalues, two-point kernels and n-level correlation functions. This involves generalization of the theory of skew-orthogonal polynomials to crossover ensembles. We also consider crossovers in the circular ensembles to show the generality of our method. In the large dimensionality limit, correlations in spectra with arbitrary initial density are shown to be universal when expressed in terms of a rescaled symmetry breaking parameter. Applications of our crossover results to communication theory and quantum conductance problems are also briefly discussed.

Fine structure of spectral properties for random correlation matrices: an application to financial markets.

Science.gov (United States)

Livan, Giacomo; Alfarano, Simone; Scalas, Enrico

2011-07-01

We study some properties of eigenvalue spectra of financial correlation matrices. In particular, we investigate the nature of the large eigenvalue bulks which are observed empirically, and which have often been regarded as a consequence of the supposedly large amount of noise contained in financial data. We challenge this common knowledge by acting on the empirical correlation matrices of two data sets with a filtering procedure which highlights some of the cluster structure they contain, and we analyze the consequences of such filtering on eigenvalue spectra. We show that empirically observed eigenvalue bulks emerge as superpositions of smaller structures, which in turn emerge as a consequence of cross correlations between stocks. We interpret and corroborate these findings in terms of factor models, and we compare empirical spectra to those predicted by random matrix theory for such models.

Fine structure of spectral properties for random correlation matrices: An application to financial markets

Science.gov (United States)

Livan, Giacomo; Alfarano, Simone; Scalas, Enrico

2011-07-01

We study some properties of eigenvalue spectra of financial correlation matrices. In particular, we investigate the nature of the large eigenvalue bulks which are observed empirically, and which have often been regarded as a consequence of the supposedly large amount of noise contained in financial data. We challenge this common knowledge by acting on the empirical correlation matrices of two data sets with a filtering procedure which highlights some of the cluster structure they contain, and we analyze the consequences of such filtering on eigenvalue spectra. We show that empirically observed eigenvalue bulks emerge as superpositions of smaller structures, which in turn emerge as a consequence of cross correlations between stocks. We interpret and corroborate these findings in terms of factor models, and we compare empirical spectra to those predicted by random matrix theory for such models.

Evolutionary Games with Randomly Changing Payoff Matrices

Science.gov (United States)

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.

Chain of matrices, loop equations and topological recursion

CERN Document Server

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.

Fluctuations of Wigner-type random matrices associated with symmetric spaces of class DIII and CI

Science.gov (United States)

Stolz, Michael

2018-02-01

Wigner-type randomizations of the tangent spaces of classical symmetric spaces can be thought of as ordinary Wigner matrices on which additional symmetries have been imposed. In particular, they fall within the scope of a framework, due to Schenker and Schulz-Baldes, for the study of fluctuations of Wigner matrices with additional dependencies among their entries. In this contribution, we complement the results of these authors by explicit calculations of the asymptotic covariances for symmetry classes DIII and CI and thus obtain explicit CLTs for these classes. On the technical level, the present work is an exercise in controlling the cumulative effect of systematically occurring sign factors in an involved sum of products by setting up a suitable combinatorial model for the summands. This aspect may be of independent interest. Research supported by Deutsche Forschungsgemeinschaft (DFG) via SFB 878.

On the density of eigenvalues of a random matrix; Concernant la densite des racines caracteristiques d'une matrice stochastique

Energy Technology Data Exchange (ETDEWEB)

Mehta, M. L. [Institute of Fundamental Research Bombay (India); Gaudin, M. [Commissariat a l' energie atomique et aux energies alternatives - CEA, Centre d' Etudes Nucleaires de Saclay, Gif-sur-Yvette (France)

1960-07-01

An exact expression for the density of eigenvalues of a random- matrix is derived. When the order of the matrix becomes infinite, it can be seen very directly that it goes over to Wigner's 'semi-circle law'. Reprint of a paper published in 'Nuclear Physics' 18, 1960, p. 420-427 [French] On deduit une expression precise pour la densite des racines caracteristiques d'une matrice stochastique. Quand l'ordre de la matrice devient infini, on peut voir facilement qu'elle obeit a la loi dite 'semi-circulaire' de Wigner. Reproduction d'un article publie dans 'Nuclear Physics' 18, 1960, p. 420-427.

Uniform Recovery Bounds for Structured Random Matrices in Corrupted Compressed Sensing

Science.gov (United States)

Zhang, Peng; Gan, Lu; Ling, Cong; Sun, Sumei

2018-04-01

We study the problem of recovering an $s$-sparse signal $\\mathbf{x}^{\\star}\\in\\mathbb{C}^n$ from corrupted measurements $\\mathbf{y} = \\mathbf{A}\\mathbf{x}^{\\star}+\\mathbf{z}^{\\star}+\\mathbf{w}$, where $\\mathbf{z}^{\\star}\\in\\mathbb{C}^m$ is a $k$-sparse corruption vector whose nonzero entries may be arbitrarily large and $\\mathbf{w}\\in\\mathbb{C}^m$ is a dense noise with bounded energy. The aim is to exactly and stably recover the sparse signal with tractable optimization programs. In this paper, we prove the uniform recovery guarantee of this problem for two classes of structured sensing matrices. The first class can be expressed as the product of a unit-norm tight frame (UTF), a random diagonal matrix and a bounded columnwise orthonormal matrix (e.g., partial random circulant matrix). When the UTF is bounded (i.e. $\\mu(\\mathbf{U})\\sim1/\\sqrt{m}$), we prove that with high probability, one can recover an $s$-sparse signal exactly and stably by $l_1$ minimization programs even if the measurements are corrupted by a sparse vector, provided $m = \\mathcal{O}(s \\log^2 s \\log^2 n)$ and the sparsity level $k$ of the corruption is a constant fraction of the total number of measurements. The second class considers randomly sub-sampled orthogonal matrix (e.g., random Fourier matrix). We prove the uniform recovery guarantee provided that the corruption is sparse on certain sparsifying domain. Numerous simulation results are also presented to verify and complement the theoretical results.

Change detection in multi-temporal dual polarization Sentinel-1 data

DEFF Research Database (Denmark)

Nielsen, Allan Aasbjerg; Canty, Morton J.; Skriver, Henning

2017-01-01

Based on an omnibus likelihood ratio test statistic for the equality of several variance-covariance matrices following the complex Wishart distribution with an associated p-value and a factorization of this test statistic, change analysis in a time series of 19 multilook, dual polarization Sentin...

Site Monitoring with Synthetic Aperture Radar Satellite Imagery

DEFF Research Database (Denmark)

Canty, Morton J.; Nielsen, Allan Aasbjerg

2017-01-01

Based on a statistical test for the equality of polarimetric matrices following the complex Wishart distribution and a factorization of the test statistic, change analysis in a time series of multi-look polarimetric SAR data in variance-covariance or polarimetric matrix representation is carried...

Change detection in a series of Sentinel-1 SAR data

DEFF Research Database (Denmark)

Nielsen, Allan Aasbjerg; Conradsen, Knut; Skriver, Henning

2017-01-01

Based on an omnibus likelihood ratio test statistic for the equality of several variance-covariance matrices following the complex Wishart distribution with an associated p-value and a factorization of this test statistic, change analysis in a time series of seven multilook, dual polarization...

Bi-dimensional null model analysis of presence-absence binary matrices.

Science.gov (United States)

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

Inverse m-matrices and ultrametric matrices

CERN Document Server

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.

Bayesian estimation of covariance matrices: Application to market risk management at EDF

International Nuclear Information System (INIS)

Jandrzejewski-Bouriga, M.

2012-01-01

In this thesis, we develop new methods of regularized covariance matrix estimation, under the Bayesian setting. The regularization methodology employed is first related to shrinkage. We investigate a new Bayesian modeling of covariance matrix, based on hierarchical inverse-Wishart distribution, and then derive different estimators under standard loss functions. Comparisons between shrunk and empirical estimators are performed in terms of frequentist performance under different losses. It allows us to highlight the critical importance of the definition of cost function and show the persistent effect of the shrinkage-type prior on inference. In a second time, we consider the problem of covariance matrix estimation in Gaussian graphical models. If the issue is well treated for the decomposable case, it is not the case if you also consider non-decomposable graphs. We then describe a Bayesian and operational methodology to carry out the estimation of covariance matrix of Gaussian graphical models, decomposable or not. This procedure is based on a new and objective method of graphical-model selection, combined with a constrained and regularized estimation of the covariance matrix of the model chosen. The procedures studied effectively manage missing data. These estimation techniques were applied to calculate the covariance matrices involved in the market risk management for portfolios of EDF (Electricity of France), in particular for problems of calculating Value-at-Risk or in Asset Liability Management. (author)

Invariant β-Wishart ensembles, crossover densities and asymptotic corrections to the Marčenko–Pastur law

International Nuclear Information System (INIS)

Allez, Romain; Bouchaud, Jean-Philippe; Majumdar, Satya N; Vivo, Pierpaolo

2013-01-01

We construct a diffusive matrix model for the β-Wishart (or Laguerre) ensemble for general continuous β ∈ [0, 2], which preserves invariance under the orthogonal/unitary group transformation. Scaling the Dyson index β with the largest size M of the data matrix as β = 2c/M (with c a fixed positive constant), we obtain a family of spectral densities parametrized by c. As c is varied, this density interpolates continuously between the Marčenko–Pastur (c → ∞ limit) and the Gamma law (c → 0 limit). Analyzing the full Stieltjes transform (resolvent) equation, we obtain as a byproduct the correction to the Marčenko–Pastur density in the bulk up to order 1/M for all β and up to order 1/M 2 for the particular cases β = 1, 2. (paper)

Random walks on reductive groups

CERN Document Server

Benoist, Yves

2016-01-01

The classical theory of Random Walks describes the asymptotic behavior of sums of independent identically distributed random real variables. This book explains the generalization of this theory to products of independent identically distributed random matrices with real coefficients. Under the assumption that the action of the matrices is semisimple – or, equivalently, that the Zariski closure of the group generated by these matrices is reductive - and under suitable moment assumptions, it is shown that the norm of the products of such random matrices satisfies a number of classical probabilistic laws. This book includes necessary background on the theory of reductive algebraic groups, probability theory and operator theory, thereby providing a modern introduction to the topic.

Dimension from covariance matrices.

Science.gov (United States)

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.

Neutrino mass priors for cosmology from random matrices

Science.gov (United States)

Long, Andrew J.; Raveri, Marco; Hu, Wayne; Dodelson, Scott

2018-02-01

Cosmological measurements of structure are placing increasingly strong constraints on the sum of the neutrino masses, Σ mν, through Bayesian inference. Because these constraints depend on the choice for the prior probability π (Σ mν), we argue that this prior should be motivated by fundamental physical principles rather than the ad hoc choices that are common in the literature. The first step in this direction is to specify the prior directly at the level of the neutrino mass matrix Mν, since this is the parameter appearing in the Lagrangian of the particle physics theory. Thus by specifying a probability distribution over Mν, and by including the known squared mass splittings, we predict a theoretical probability distribution over Σ mν that we interpret as a Bayesian prior probability π (Σ mν). Assuming a basis-invariant probability distribution on Mν, also known as the anarchy hypothesis, we find that π (Σ mν) peaks close to the smallest Σ mν allowed by the measured mass splittings, roughly 0.06 eV (0.1 eV) for normal (inverted) ordering, due to the phenomenon of eigenvalue repulsion in random matrices. We consider three models for neutrino mass generation: Dirac, Majorana, and Majorana via the seesaw mechanism; differences in the predicted priors π (Σ mν) allow for the possibility of having indications about the physical origin of neutrino masses once sufficient experimental sensitivity is achieved. We present fitting functions for π (Σ mν), which provide a simple means for applying these priors to cosmological constraints on the neutrino masses or marginalizing over their impact on other cosmological parameters.

Chaos, complexity, and random matrices

Science.gov (United States)

Cotler, Jordan; Hunter-Jones, Nicholas; Liu, Junyu; Yoshida, Beni

2017-11-01

Chaos and complexity entail an entropic and computational obstruction to describing a system, and thus are intrinsically difficult to characterize. In this paper, we consider time evolution by Gaussian Unitary Ensemble (GUE) Hamiltonians and analytically compute out-of-time-ordered correlation functions (OTOCs) and frame potentials to quantify scrambling, Haar-randomness, and circuit complexity. While our random matrix analysis gives a qualitatively correct prediction of the late-time behavior of chaotic systems, we find unphysical behavior at early times including an O(1) scrambling time and the apparent breakdown of spatial and temporal locality. The salient feature of GUE Hamiltonians which gives us computational traction is the Haar-invariance of the ensemble, meaning that the ensemble-averaged dynamics look the same in any basis. Motivated by this property of the GUE, we introduce k-invariance as a precise definition of what it means for the dynamics of a quantum system to be described by random matrix theory. We envision that the dynamical onset of approximate k-invariance will be a useful tool for capturing the transition from early-time chaos, as seen by OTOCs, to late-time chaos, as seen by random matrix theory.

Application of the random coil index to studying protein flexibility

Energy Technology Data Exchange (ETDEWEB)

Berjanskii, Mark V.; Wishart, David S. [University of Alberta, Department of Computing Science (Canada)], E-mail: david.wishart@ualberta.ca

2008-01-15

Protein flexibility lies at the heart of many protein-ligand binding events and enzymatic activities. However, the experimental measurement of protein motions is often difficult, tedious and error-prone. As a result, there is a considerable interest in developing simpler and faster ways of quantifying protein flexibility. Recently, we described a method, called Random Coil Index (RCI), which appears to be able to quantitatively estimate model-free order parameters and flexibility in protein structural ensembles using only backbone chemical shifts. Because of its potential utility, we have undertaken a more detailed investigation of the RCI method in an attempt to ascertain its underlying principles, its general utility, its sensitivity to chemical shift errors, its sensitivity to data completeness, its applicability to other proteins, and its general strengths and weaknesses. Overall, we find that the RCI method is very robust and that it represents a useful addition to traditional methods of studying protein flexibility. We have implemented many of the findings and refinements reported here into a web server that allows facile, automated predictions of model-free order parameters, MD RMSF and NMR RMSD values directly from backbone {sup 1}H, {sup 13}C and {sup 15}N chemical shift assignments. The server is available at http: //wishart.biology.ualberta.ca/rcihttp://wishart.biology.ualberta.ca/rci.

Black holes and random matrices

Energy Technology Data Exchange (ETDEWEB)

Cotler, Jordan S.; Gur-Ari, Guy [Stanford Institute for Theoretical Physics, Stanford University,Stanford, CA 94305 (United States); Hanada, Masanori [Stanford Institute for Theoretical Physics, Stanford University,Stanford, CA 94305 (United States); Yukawa Institute for Theoretical Physics, Kyoto University,Kyoto 606-8502 (Japan); The Hakubi Center for Advanced Research, Kyoto University,Kyoto 606-8502 (Japan); Polchinski, Joseph [Department of Physics, University of California,Santa Barbara, CA 93106 (United States); Kavli Institute for Theoretical Physics, University of California,Santa Barbara, CA 93106 (United States); Saad, Phil; Shenker, Stephen H. [Stanford Institute for Theoretical Physics, Stanford University,Stanford, CA 94305 (United States); Stanford, Douglas [Institute for Advanced Study,Princeton, NJ 08540 (United States); Streicher, Alexandre [Stanford Institute for Theoretical Physics, Stanford University,Stanford, CA 94305 (United States); Department of Physics, University of California,Santa Barbara, CA 93106 (United States); Tezuka, Masaki [Department of Physics, Kyoto University,Kyoto 606-8501 (Japan)

2017-05-22

We argue that the late time behavior of horizon fluctuations in large anti-de Sitter (AdS) black holes is governed by the random matrix dynamics characteristic of quantum chaotic systems. Our main tool is the Sachdev-Ye-Kitaev (SYK) model, which we use as a simple model of a black hole. We use an analytically continued partition function |Z(β+it)|{sup 2} as well as correlation functions as diagnostics. Using numerical techniques we establish random matrix behavior at late times. We determine the early time behavior exactly in a double scaling limit, giving us a plausible estimate for the crossover time to random matrix behavior. We use these ideas to formulate a conjecture about general large AdS black holes, like those dual to 4D super-Yang-Mills theory, giving a provisional estimate of the crossover time. We make some preliminary comments about challenges to understanding the late time dynamics from a bulk point of view.

Accelerating Matrix-Vector Multiplication on Hierarchical Matrices Using Graphical Processing Units

KAUST Repository

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.

Bayesian conjugate analysis using a generalized inverted Wishart distribution accounts for differential uncertainty among the genetic parameters--an application to the maternal animal model.

Science.gov (United States)

Munilla, S; Cantet, R J C

2012-06-01

Consider the estimation of genetic (co)variance components from a maternal animal model (MAM) using a conjugated Bayesian approach. Usually, more uncertainty is expected a priori on the value of the maternal additive variance than on the value of the direct additive variance. However, it is not possible to model such differential uncertainty when assuming an inverted Wishart (IW) distribution for the genetic covariance matrix. Instead, consider the use of a generalized inverted Wishart (GIW) distribution. The GIW is essentially an extension of the IW distribution with a larger set of distinct parameters. In this study, the GIW distribution in its full generality is introduced and theoretical results regarding its use as the prior distribution for the genetic covariance matrix of the MAM are derived. In particular, we prove that the conditional conjugacy property holds so that parameter estimation can be accomplished via the Gibbs sampler. A sampling algorithm is also sketched. Furthermore, we describe how to specify the hyperparameters to account for differential prior opinion on the (co)variance components. A recursive strategy to elicit these parameters is then presented and tested using field records and simulated data. The procedure returned accurate estimates and reduced standard errors when compared with non-informative prior settings while improving the convergence rates. In general, faster convergence was always observed when a stronger weight was placed on the prior distributions. However, analyses based on the IW distribution have also produced biased estimates when the prior means were set to over-dispersed values. © 2011 Blackwell Verlag GmbH.

Propiedades de las distribuciones beta y Dirichlet de matrices complejas

OpenAIRE

Bedoya Macías, Elizabeth

2007-01-01

Las distribuciones multivariadas complejas juegan un papel importante en varios campos de investigación. La distribución Gaussiana compleja fue introducida por Wooding [66], Turin [61], y Goodman [16]. La distribución Wishart fue definida por Goodman [16] para aproximar la distribución de un estimativo de la matriz de densidad espectral para un proceso Gaussiano estacionario vectorial. En análisis de series de tiempo las distribuciones complejas se usan para describir estimadores de parámetro...

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. �

No Eigenvalues Outside the Limiting Support of Generally Correlated Gaussian Matrices

KAUST Repository

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

KAUST Repository

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.

Probabilistic Signal Recovery and Random Matrices

Science.gov (United States)

2016-12-08

that classical methods for linear regression (such as Lasso) are applicable for non- linear data. This surprising finding has already found several...we studied the complexity of convex sets. In numerical linear algebra , we analyzed the fastest known randomized approximation algorithm for...and perfect matchings In numerical linear algebra , we studied the fastest known randomized approximation algorithm for computing the permanents of

Asymmetric correlation matrices: an analysis of financial data

Science.gov (United States)

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.

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 ...

Random matrix ensembles for PT-symmetric systems

International Nuclear Information System (INIS)

Graefe, Eva-Maria; Mudute-Ndumbe, Steve; Taylor, Matthew

2015-01-01

Recently much effort has been made towards the introduction of non-Hermitian random matrix models respecting PT-symmetry. Here we show that there is a one-to-one correspondence between complex PT-symmetric matrices and split-complex and split-quaternionic versions of Hermitian matrices. We introduce two new random matrix ensembles of (a) Gaussian split-complex Hermitian; and (b) Gaussian split-quaternionic Hermitian matrices, of arbitrary sizes. We conjecture that these ensembles represent universality classes for PT-symmetric matrices. For the case of 2 × 2 matrices we derive analytic expressions for the joint probability distributions of the eigenvalues, the one-level densities and the level spacings in the case of real eigenvalues. (fast track communication)

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.

Cavity approach to the first eigenvalue problem in a family of symmetric random sparse matrices

International Nuclear Information System (INIS)

Kabashima, Yoshiyuki; Takahashi, Hisanao; Watanabe, Osamu

2010-01-01

A methodology to analyze the properties of the first (largest) eigenvalue and its eigenvector is developed for large symmetric random sparse matrices utilizing the cavity method of statistical mechanics. Under a tree approximation, which is plausible for infinitely large systems, in conjunction with the introduction of a Lagrange multiplier for constraining the length of the eigenvector, the eigenvalue problem is reduced to a bunch of optimization problems of a quadratic function of a single variable, and the coefficients of the first and the second order terms of the functions act as cavity fields that are handled in cavity analysis. We show that the first eigenvalue is determined in such a way that the distribution of the cavity fields has a finite value for the second order moment with respect to the cavity fields of the first order coefficient. The validity and utility of the developed methodology are examined by applying it to two analytically solvable and one simple but non-trivial examples in conjunction with numerical justification.

Random matrix theory for heavy-tailed time series

DEFF Research Database (Denmark)

Heiny, Johannes

2017-01-01

This paper is a review of recent results for large random matrices with heavy-tailed entries. First, we outline the development of and some classical results in random matrix theory. We focus on large sample covariance matrices, their limiting spectral distributions, the asymptotic behavior...

Construction of MDS self-dual codes from orthogonal matrices

OpenAIRE

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.

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

Polarimetric synthetic aperture radar data and the complex Wishart distribution

DEFF Research Database (Denmark)

Nielsen, Allan Aasbjerg; Conradsen, Knut; Skriver, Henning

2003-01-01

distribution. Based on this distribution a test statistic for equality of two such matrices and an associated asymptotic probability for obtaining a smaller value of the test statistic are given and applied to segmentation, change detection and edge detection in polarimetric SAR data. In a case study EMISAR L...

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

Science.gov (United States)

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.

On-Chip Neural Data Compression Based On Compressed Sensing With Sparse Sensing Matrices.

Science.gov (United States)

Zhao, Wenfeng; Sun, Biao; Wu, Tong; Yang, Zhi

2018-02-01

On-chip neural data compression is an enabling technique for wireless neural interfaces that suffer from insufficient bandwidth and power budgets to transmit the raw data. The data compression algorithm and its implementation should be power and area efficient and functionally reliable over different datasets. Compressed sensing is an emerging technique that has been applied to compress various neurophysiological data. However, the state-of-the-art compressed sensing (CS) encoders leverage random but dense binary measurement matrices, which incur substantial implementation costs on both power and area that could offset the benefits from the reduced wireless data rate. In this paper, we propose two CS encoder designs based on sparse measurement matrices that could lead to efficient hardware implementation. Specifically, two different approaches for the construction of sparse measurement matrices, i.e., the deterministic quasi-cyclic array code (QCAC) matrix and -sparse random binary matrix [-SRBM] are exploited. We demonstrate that the proposed CS encoders lead to comparable recovery performance. And efficient VLSI architecture designs are proposed for QCAC-CS and -SRBM encoders with reduced area and total power consumption.

Infinite matrices and sequence spaces

CERN Document Server

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

Eigenvalue distribution of large random matrices

CERN Document Server

Pastur, Leonid

2011-01-01

Random matrix theory is a wide and growing field with a variety of concepts, results, and techniques and a vast range of applications in mathematics and the related sciences. The book, written by well-known experts, offers beginners a fairly balanced collection of basic facts and methods (Part 1 on classical ensembles) and presents experts with an exposition of recent advances in the subject (Parts 2 and 3 on invariant ensembles and ensembles with independent entries). The text includes many of the authors' results and methods on several main aspects of the theory, thus allowing them to present a unique and personal perspective on the subject and to cover many topics using a unified approach essentially based on the Stieltjes transform and orthogonal polynomials. The exposition is supplemented by numerous comments, remarks, and problems. This results in a book that presents a detailed and self-contained treatment of the basic random matrix ensembles and asymptotic regimes. This book will be an important refer...

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.

Colloquium: Random matrices and chaos in nuclear spectra

International Nuclear Information System (INIS)

Papenbrock, T.; Weidenmueller, H. A.

2007-01-01

Chaos occurs in quantum systems if the statistical properties of the eigenvalue spectrum coincide with predictions of random-matrix theory. Chaos is a typical feature of atomic nuclei and other self-bound Fermi systems. How can the existence of chaos be reconciled with the known dynamical features of spherical nuclei? Such nuclei are described by the shell model (a mean-field theory) plus a residual interaction. The question is answered using a statistical approach (the two-body random ensemble): The matrix elements of the residual interaction are taken to be random variables. Chaos is shown to be a generic feature of the ensemble and some of its properties are displayed, emphasizing those which differ from standard random-matrix theory. In particular, the existence of correlations among spectra carrying different quantum numbers is demonstrated. These are subject to experimental verification

Free random variables

CERN Document Server

Voiculescu, Dan; Nica, Alexandru

1992-01-01

This book presents the first comprehensive introduction to free probability theory, a highly noncommutative probability theory with independence based on free products instead of tensor products. Basic examples of this kind of theory are provided by convolution operators on free groups and by the asymptotic behavior of large Gaussian random matrices. The probabilistic approach to free products has led to a recent surge of new results on the von Neumann algebras of free groups. The book is ideally suited as a textbook for an advanced graduate course and could also provide material for a seminar. In addition to researchers and graduate students in mathematics, this book will be of interest to physicists and others who use random matrices.

Diagonalization of replicated transfer matrices for disordered Ising spin systems

International Nuclear Information System (INIS)

Nikoletopoulos, T; Coolen, A C C

2004-01-01

We present an alternative procedure for solving the eigenvalue problem of replicated transfer matrices describing disordered spin systems with (random) 1D nearest neighbour bonds and/or random fields, possibly in combination with (random) long range bonds. Our method is based on transforming the original eigenvalue problem for a 2 n x 2 n matrix (where n → 0) into an eigenvalue problem for integral operators. We first develop our formalism for the Ising chain with random bonds and fields, where we recover known results. We then apply our methods to models of spins which interact simultaneously via a one-dimensional ring and via more complex long-range connectivity structures, e.g., (1 + ∞)-dimensional neural networks and 'small-world' magnets. Numerical simulations confirm our predictions satisfactorily

Complex Wishart distribution based analysis of polarimetric synthetic aperture radar data

DEFF Research Database (Denmark)

Nielsen, Allan Aasbjerg; Skriver, Henning; Conradsen, Knut

2007-01-01

statistic for equality of two such matrices and an associated asymptotic probability for obtaining a smaller value of the test statistic are given and applied to change detection, edge detection and segmentation in polarimetric SAR data. In a case study EMISAR L-band data from 17 April 1998 and 20 May 1998...

Change detection in polarimetric SAR data and the complex Wishart distribution

DEFF Research Database (Denmark)

Conradsen, Knut; Nielsen, Allan Aasbjerg; Schou, Jesper

2001-01-01

. Based on this distribution a test statistic for equality of two such matrices and an associated asymptotic probability for obtaining a smaller value of the test statistic are given and applied to change detection in polarimetric SAR data. In a case study EMISAR L-band data from 17 April 1998 and 20 May...

Evolutionary formalism from random Leslie matrices in biology

International Nuclear Information System (INIS)

Caceres, M.O.; Caceres-Saez, I.

2008-07-01

We present a perturbative formalism to deal with linear random matrix difference equations. We generalize the concept of the population growth rate when a Leslie matrix has random elements (i.e., characterizing the disorder in the vital parameters). The dominant eigenvalue of which defines the asymptotic dynamics of the mean value population vector state, is presented as the effective growth rate of a random Leslie model. This eigenvalue is calculated from the largest positive root of a secular polynomial. Analytical (exact and perturbative calculations) results are presented for several models of disorder. A 3 x 3 numerical example is applied to study the effective growth rate characterizing the long-time dynamics of a population biological case: the Tursiops sp. (author)

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

Random matrices and chaos in nuclear physics: Nuclear structure

International Nuclear Information System (INIS)

Weidenmueller, H. A.; Mitchell, G. E.

2009-01-01

Evidence for the applicability of random-matrix theory to nuclear spectra is reviewed. In analogy to systems with few degrees of freedom, one speaks of chaos (more accurately, quantum chaos) in nuclei whenever random-matrix predictions are fulfilled. An introduction into the basic concepts of random-matrix theory is followed by a survey over the extant experimental information on spectral fluctuations, including a discussion of the violation of a symmetry or invariance property. Chaos in nuclear models is discussed for the spherical shell model, for the deformed shell model, and for the interacting boson model. Evidence for chaos also comes from random-matrix ensembles patterned after the shell model such as the embedded two-body ensemble, the two-body random ensemble, and the constrained ensembles. All this evidence points to the fact that chaos is a generic property of nuclear spectra, except for the ground-state regions of strongly deformed nuclei.

Matrices and linear transformations

CERN Document Server

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

CERN Document Server

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

KAUST Repository

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

KAUST Repository

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.

Random sampling of quantum states: a survey of methods and some issues regarding the Overparametrized Method

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)

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

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.

Random matrices, Frobenius eigenvalues, and monodromy

CERN Document Server

Katz, Nicholas M

1998-01-01

The main topic of this book is the deep relation between the spacings between zeros of zeta and L-functions and spacings between eigenvalues of random elements of large compact classical groups. This relation, the Montgomery-Odlyzko law, is shown to hold for wide classes of zeta and L-functions over finite fields. The book draws on and gives accessible accounts of many disparate areas of mathematics, from algebraic geometry, moduli spaces, monodromy, equidistribution, and the Weil conjectures, to probability theory on the compact classical groups in the limit as their dimension goes to infinit

Analytical Derivation of the Inverse Moments of One-Sided Correlated Gram Matrices With Applications

KAUST Repository

Elkhalil, Khalil

2016-02-03

This paper addresses the development of analytical tools for the computation of the inverse moments of random Gram matrices with one side correlation. Such a question is mainly driven by applications in signal processing and wireless communications wherein such matrices naturally arise. In particular, we derive closed-form expressions for the inverse moments and show that the obtained results can help approximate several performance metrics such as the average estimation error corresponding to the Best Linear Unbiased Estimator (BLUE) and the Linear Minimum Mean Square Error (LMMSE) estimator or also other loss functions used to measure the accuracy of covariance matrix estimates.

Intrinsic character of Stokes matrices

Science.gov (United States)

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

CERN Document Server

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 ...

Exact closed-form expression for the inverse moments of one-sided correlated Gram matrices

KAUST Repository

Elkhalil, Khalil

2016-08-15

In this paper, we derive a closed-form expression for the inverse moments of one sided-correlated random Gram matrices. Such a question is mainly motivated by applications in signal processing and wireless communications for which evaluating this quantity is a question of major interest. This is for instance the case of the best linear unbiased estimator, in which the average estimation error corresponds to the first inverse moment of a random Gram matrix.

Exact closed-form expression for the inverse moments of one-sided correlated Gram matrices

KAUST Repository

Elkhalil, Khalil; Kammoun, Abla; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

2016-01-01

In this paper, we derive a closed-form expression for the inverse moments of one sided-correlated random Gram matrices. Such a question is mainly motivated by applications in signal processing and wireless communications for which evaluating this quantity is a question of major interest. This is for instance the case of the best linear unbiased estimator, in which the average estimation error corresponds to the first inverse moment of a random Gram matrix.

ATLAS, an integrated structural analysis and design system. Volume 4: Random access file catalog

Science.gov (United States)

Gray, F. P., Jr. (Editor)

1979-01-01

A complete catalog is presented for the random access files used by the ATLAS integrated structural analysis and design system. ATLAS consists of several technical computation modules which output data matrices to corresponding random access file. A description of the matrices written on these files is contained herein.

Noisy covariance matrices and portfolio optimization II

Science.gov (United States)

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

Special matrices of mathematical physics stochastic, circulant and Bell matrices

CERN Document Server

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

Tensor Dictionary Learning for Positive Definite Matrices.

Science.gov (United States)

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.

A random matrix approach to VARMA processes

International Nuclear Information System (INIS)

Burda, Zdzislaw; Jarosz, Andrzej; Nowak, Maciej A; Snarska, Malgorzata

2010-01-01

We apply random matrix theory to derive the spectral density of large sample covariance matrices generated by multivariate VMA(q), VAR(q) and VARMA(q 1 , q 2 ) processes. In particular, we consider a limit where the number of random variables N and the number of consecutive time measurements T are large but the ratio N/T is fixed. In this regime, the underlying random matrices are asymptotically equivalent to free random variables (FRV). We apply the FRV calculus to calculate the eigenvalue density of the sample covariance for several VARMA-type processes. We explicitly solve the VARMA(1, 1) case and demonstrate perfect agreement between the analytical result and the spectra obtained by Monte Carlo simulations. The proposed method is purely algebraic and can be easily generalized to q 1 >1 and q 2 >1.

Random matrices and the New York City subway system

OpenAIRE

Jagannath, Aukosh; Trogdon, Thomas

2017-01-01

We analyze subway arrival times in the New York City subway system. We find regimes where the gaps between trains exhibit both (unitarily invariant) random matrix statistics and Poisson statistics. The departure from random matrix statistics is captured by the value of the Coulomb potential along the subway route. This departure becomes more pronounced as trains make more stops.

Random matrix approach to cross correlations in financial data

Science.gov (United States)

Plerou, Vasiliki; Gopikrishnan, Parameswaran; Rosenow, Bernd; Amaral, Luís A.; Guhr, Thomas; Stanley, H. Eugene

2002-06-01

We analyze cross correlations between price fluctuations of different stocks using methods of random matrix theory (RMT). Using two large databases, we calculate cross-correlation matrices C of returns constructed from (i) 30-min returns of 1000 US stocks for the 2-yr period 1994-1995, (ii) 30-min returns of 881 US stocks for the 2-yr period 1996-1997, and (iii) 1-day returns of 422 US stocks for the 35-yr period 1962-1996. We test the statistics of the eigenvalues λi of C against a ``null hypothesis'' - a random correlation matrix constructed from mutually uncorrelated time series. We find that a majority of the eigenvalues of C fall within the RMT bounds [λ-,λ+] for the eigenvalues of random correlation matrices. We test the eigenvalues of C within the RMT bound for universal properties of random matrices and find good agreement with the results for the Gaussian orthogonal ensemble of random matrices-implying a large degree of randomness in the measured cross-correlation coefficients. Further, we find that the distribution of eigenvector components for the eigenvectors corresponding to the eigenvalues outside the RMT bound display systematic deviations from the RMT prediction. In addition, we find that these ``deviating eigenvectors'' are stable in time. We analyze the components of the deviating eigenvectors and find that the largest eigenvalue corresponds to an influence common to all stocks. Our analysis of the remaining deviating eigenvectors shows distinct groups, whose identities correspond to conventionally identified business sectors. Finally, we discuss applications to the construction of portfolios of stocks that have a stable ratio of risk to return.

Random matrices and the New York City subway system

Science.gov (United States)

Jagannath, Aukosh; Trogdon, Thomas

2017-09-01

We analyze subway arrival times in the New York City subway system. We find regimes where the gaps between trains are well modeled by (unitarily invariant) random matrix statistics and Poisson statistics. The departure from random matrix statistics is captured by the value of the Coulomb potential along the subway route. This departure becomes more pronounced as trains make more stops.

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.

Frequency filtering decompositions for unsymmetric matrices and matrices with strongly varying coefficients

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.

Introduction to matrices and vectors

CERN Document Server

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.

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

Analogies between random matrix ensembles and the one-component plasma in two-dimensions

Directory of Open Access Journals (Sweden)

Peter J. Forrester

2016-03-01

Full Text Available The eigenvalue PDF for some well known classes of non-Hermitian random matrices — the complex Ginibre ensemble for example — can be interpreted as the Boltzmann factor for one-component plasma systems in two-dimensional domains. We address this theme in a systematic fashion, identifying the plasma system for the Ginibre ensemble of non-Hermitian Gaussian random matrices G, the spherical ensemble of the product of an inverse Ginibre matrix and a Ginibre matrix G1−1G2, and the ensemble formed by truncating unitary matrices, as well as for products of such matrices. We do this when each has either real, complex or real quaternion elements. One consequence of this analogy is that the leading form of the eigenvalue density follows as a corollary. Another is that the eigenvalue correlations must obey sum rules known to characterise the plasma system, and this leads us to an exhibit of an integral identity satisfied by the two-particle correlation for real quaternion matrices in the neighbourhood of the real axis. Further random matrix ensembles investigated from this viewpoint are self dual non-Hermitian matrices, in which a previous study has related to the one-component plasma system in a disk at inverse temperature β=4, and the ensemble formed by the single row and column of quaternion elements from a member of the circular symplectic ensemble.

Parametric Bayesian Estimation of Differential Entropy and Relative Entropy

OpenAIRE

Gupta; Srivastava

2010-01-01

Given iid samples drawn from a distribution with known parametric form, we propose the minimization of expected Bregman divergence to form Bayesian estimates of differential entropy and relative entropy, and derive such estimators for the uniform, Gaussian, Wishart, and inverse Wishart distributions. Additionally, formulas are given for a log gamma Bregman divergence and the differential entropy and relative entropy for the Wishart and inverse Wishart. The results, as always with Bayesian est...

Chemiluminescence in cryogenic matrices

Science.gov (United States)

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.

Visualization of and Software for Omnibus Test Based Change Detected in a Time Series of Polarimetric SAR Data

DEFF Research Database (Denmark)

Nielsen, Allan Aasbjerg; Conradsen, Knut; Skriver, Henning

2017-01-01

Based on an omnibus likelihood ratio test statistic for the equality of several variance-covariance matrices following the complex Wishart distribution and a factorization of this test statistic with associated p-values, change analysis in a time series of multilook polarimetric SAR data...... in the covariance matrix representation is carried out. The omnibus test statistic and its factorization detect if and when change occurs. Using airborne EMISAR and spaceborne RADARSAT-2 data this paper focuses on change detection based on the p-values, on visualization of change at pixel as well as segment level......, and on computer software....

An omnibus likelihood test statistic and its factorization for change detection in time series of polarimetric SAR data

DEFF Research Database (Denmark)

Nielsen, Allan Aasbjerg; Conradsen, Knut; Skriver, Henning

2016-01-01

Based on an omnibus likelihood ratio test statistic for the equality of several variance-covariance matrices following the complex Wishart distribution with an associated p-value and a factorization of this test statistic, change analysis in a short sequence of multilook, polarimetric SAR data...... in the covariance matrix representation is carried out. The omnibus test statistic and its factorization detect if and when change(s) occur. The technique is demonstrated on airborne EMISAR L-band data but may be applied to Sentinel-1, Cosmo-SkyMed, TerraSAR-X, ALOS and RadarSat-2 or other dual- and quad...

Change detection in a time series of polarimetric SAR data by an omnibus test statistic and its factorization

DEFF Research Database (Denmark)

Nielsen, Allan Aasbjerg; Conradsen, Knut; Skriver, Henning

2016-01-01

Based on an omnibus likelihood ratio test statistic for the equality of several variance-covariance matrices following the complex Wishart distribution with an associated p-value and a factorization of this test statistic, change analysis in a short sequence of multilook, polarimetric SAR data...... in the covariance matrix representation is carried out. The omnibus test statistic and its factorization detect if and when change(s) occur. The technique is demonstrated on airborne EMISAR L-band data but may be applied to Sentinel-1, Cosmo-SkyMed, TerraSAR-X, ALOS and RadarSat-2 or other dual- and quad...

Rational decisions, random matrices and spin glasses

Science.gov (United States)

Galluccio, Stefano; Bouchaud, Jean-Philippe; Potters, Marc

We consider the problem of rational decision making in the presence of nonlinear constraints. By using tools borrowed from spin glass and random matrix theory, we focus on the portfolio optimisation problem. We show that the number of optimal solutions is generally exponentially large, and each of them is fragile: rationality is in this case of limited use. In addition, this problem is related to spin glasses with Lévy-like (long-ranged) couplings, for which we show that the ground state is not exponentially degenerate.

Skew-adjacency matrices of graphs

NARCIS (Netherlands)

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

The invariant theory of matrices

CERN Document Server

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...

Eigenvalue Tests and Distributions for Small Sample Order Determination for Complex Wishart Matrices

Science.gov (United States)

1994-08-13

does not apply. The physical world is much nicer because we never have the case of a truly deficient covariance matrix. The problem becomes one of...jJ(LLH --+ A)I =(2P ll(TkkLkk)2P)1 (ft Tk~kk-1) (2-P fpjL k=1 k=1k=1 PPP = IJ Tk2 = (det T) 2p = (det TTH)P = (det B)P k=1 Therefore IJ(Y --+ A)l...proof. From theorem 32, (dZ) = [ft Tk2 -m-k] I [M) j + dT 3 ], [kk [(H~ffdH, )Tjj A ~j dTij (HHdH,) k=i= jjiI 437 Also, A = ZHZ = (H 1T)H(HIT) = THH HHIT

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

Science.gov (United States)

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…

Group inverses of M-matrices and their applications

CERN Document Server

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

Spectral properties of embedded Gaussian unitary ensemble of random matrices with Wigner's SU(4) symmetry

International Nuclear Information System (INIS)

Vyas, Manan; Kota, V.K.B.

2010-01-01

For m fermions in Ω number of single particle orbitals, each fourfold degenerate, we introduce and analyze in detail embedded Gaussian unitary ensemble of random matrices generated by random two-body interactions that are SU(4) scalar [EGUE(2)-SU(4)]. Here the SU(4) algebra corresponds to the Wigner's supermultiplet SU(4) symmetry in nuclei. Embedding algebra for the EGUE(2)-SU(4) ensemble is U(4Ω) contains U(Ω) x SU(4). Exploiting the Wigner-Racah algebra of the embedding algebra, analytical expression for the ensemble average of the product of any two m particle Hamiltonian matrix elements is derived. Using this, formulas for a special class of U(Ω) irreducible representations (irreps) {4 r , p}, p = 0, 1, 2, 3 are derived for the ensemble averaged spectral variances and also for the covariances in energy centroids and spectral variances. On the other hand, simplifying the tabulations of Hecht for SU(Ω) Racah coefficients, numerical calculations are carried out for general U(Ω) irreps. Spectral variances clearly show, by applying Jacquod and Stone prescription, that the EGUE(2)-SU(4) ensemble generates ground state structure just as the quadratic Casimir invariant (C 2 ) of SU(4). This is further corroborated by the calculation of the expectation values of C 2 [SU(4)] and the four periodicity in the ground state energies. Secondly, it is found that the covariances in energy centroids and spectral variances increase in magnitude considerably as we go from EGUE(2) for spinless fermions to EGUE(2) for fermions with spin to EGUE(2)-SU(4) implying that the differences in ensemble and spectral averages grow with increasing symmetry. Also for EGUE(2)-SU(4) there are, unlike for GUE, non-zero cross-correlations in energy centroids and spectral variances defined over spaces with different particle numbers and/or U(Ω) [equivalently SU(4)] irreps. In the dilute limit defined by Ω → ∞, r >> 1 and r/Ω → 0, for the {4 r , p} irreps, we have derived analytical

Inference for High-dimensional Differential Correlation Matrices.

Science.gov (United States)

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.

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 biennial life strategy in a random environment

NARCIS (Netherlands)

Roerdink, J.B.T.M.

1988-01-01

A discrete-time population model with two age classes is studied which describes the growth of biennial plants in a randomly varying environment. A fraction of the oldest age class delays its flowering each year. The solution of the model involves products of random matrices. We calculate the exact

Minimax Rate-optimal Estimation of High-dimensional Covariance Matrices with Incomplete Data.

Science.gov (United States)

Cai, T Tony; Zhang, Anru

2016-09-01

Missing data occur frequently in a wide range of applications. In this paper, we consider estimation of high-dimensional covariance matrices in the presence of missing observations under a general missing completely at random model in the sense that the missingness is not dependent on the values of the data. Based on incomplete data, estimators for bandable and sparse covariance matrices are proposed and their theoretical and numerical properties are investigated. Minimax rates of convergence are established under the spectral norm loss and the proposed estimators are shown to be rate-optimal under mild regularity conditions. Simulation studies demonstrate that the estimators perform well numerically. The methods are also illustrated through an application to data from four ovarian cancer studies. The key technical tools developed in this paper are of independent interest and potentially useful for a range of related problems in high-dimensional statistical inference with missing data.

Minimax Rate-optimal Estimation of High-dimensional Covariance Matrices with Incomplete Data*

Science.gov (United States)

Cai, T. Tony; Zhang, Anru

2016-01-01

Missing data occur frequently in a wide range of applications. In this paper, we consider estimation of high-dimensional covariance matrices in the presence of missing observations under a general missing completely at random model in the sense that the missingness is not dependent on the values of the data. Based on incomplete data, estimators for bandable and sparse covariance matrices are proposed and their theoretical and numerical properties are investigated. Minimax rates of convergence are established under the spectral norm loss and the proposed estimators are shown to be rate-optimal under mild regularity conditions. Simulation studies demonstrate that the estimators perform well numerically. The methods are also illustrated through an application to data from four ovarian cancer studies. The key technical tools developed in this paper are of independent interest and potentially useful for a range of related problems in high-dimensional statistical inference with missing data. PMID:27777471

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.)

Calculations of light scattering matrices for stochastic ensembles of nanosphere clusters

International Nuclear Information System (INIS)

Bunkin, N.F.; Shkirin, A.V.; Suyazov, N.V.; Starosvetskiy, A.V.

2013-01-01

Results of the calculation of the light scattering matrices for systems of stochastic nanosphere clusters are presented. A mathematical model of spherical particle clustering with allowance for cluster–cluster aggregation is used. The fractal properties of cluster structures are explored at different values of the model parameter that governs cluster–cluster interaction. General properties of the light scattering matrices of nanosphere-cluster ensembles as dependent on their mean fractal dimension have been found. The scattering-matrix calculations were performed for finite samples of 10 3 random clusters, made up of polydisperse spherical nanoparticles, having lognormal size distribution with the effective radius 50 nm and effective variance 0.02; the mean number of monomers in a cluster and its standard deviation were set to 500 and 70, respectively. The implemented computation environment, modeling the scattering matrices for overall sequences of clusters, is based upon T-matrix program code for a given single cluster of spheres, which was developed in [1]. The ensemble-averaged results have been compared with orientation-averaged ones calculated for individual clusters. -- Highlights: ► We suggested a hierarchical model of cluster growth allowing for cluster–cluster aggregation. ► We analyzed the light scattering by whole ensembles of nanosphere clusters. ► We studied the evolution of the light scattering matrix when changing the fractal dimension

Matrices in Engineering Problems

CERN Document Server

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

Correlated Random Systems Five Different Methods : CIRM Jean-Morlet Chair

CERN Document Server

Kistler, Nicola

2015-01-01

This volume presents five different methods recently developed to tackle the large scale behavior of highly correlated random systems, such as spin glasses, random polymers, local times and loop soups and random matrices. These methods, presented in a series of lectures delivered within the Jean-Morlet initiative (Spring 2013), play a fundamental role in the current development of probability theory and statistical mechanics. The lectures were: Random Polymers by E. Bolthausen, Spontaneous Replica Symmetry Breaking and Interpolation Methods by F. Guerra, Derrida's Random Energy Models by N. Kistler, Isomorphism Theorems by J. Rosen and Spectral Properties of Wigner Matrices by B. Schlein. This book is the first in a co-edition between the Jean-Morlet Chair at CIRM and the Springer Lecture Notes in Mathematics which aims to collect together courses and lectures on cutting-edge subjects given during the term of the Jean-Morlet Chair, as well as new material produced in its wake. It is targeted at researchers, i...

Limit distributions of random walks on stochastic matrices

Indian Academy of Sciences (India)

condition that μm(P) > 0 for some positive integer m (as opposed to just 1, instead of m, considered in [1]), where μm is the ...... Limit distributions of random walks. 611. PROPOSITION 3.2. Let f be as introduced before Proposition 3.1. The probability distribution λ is the image of π by the map b ↦→ f (b). In other words, λ = ∑.

A Brief Historical Introduction to Matrices and Their Applications

Science.gov (United States)

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…

Qubits in a random environment

International Nuclear Information System (INIS)

Akhalwaya, I; Fannes, M; Petruccione, F

2007-01-01

Decoherence phenomena in a small quantum system coupled to a complex environment can be modelled with random matrices. We propose a simple deterministic model in the limit of a high dimensional environment. The model is investigated numerically and some analytically addressable questions are singled out

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

OpenAIRE

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...

Formal matrices

CERN Document Server

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.

Science.gov (United States)

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.

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.

Random matrix theory for pseudo-Hermitian systems: Cyclic blocks

Indian Academy of Sciences (India)

We discuss the relevance of random matrix theory for pseudo-Hermitian systems, and, for Hamiltonians that break parity and time-reversal invariance . In an attempt to understand the random Ising model, we present the treatment of cyclic asymmetric matrices with blocks and show that the nearest-neighbour spacing ...

Fortran code for generating random probability vectors, unitaries, and quantum states

Directory of Open Access Journals (Sweden)

Jonas eMaziero

2016-03-01

Full Text Available The usefulness of generating random configurations is recognized in many areas of knowledge. Fortran was born for scientific computing and has been one of the main programming languages in this area since then. And several ongoing projects targeting towards its betterment indicate that it will keep this status in the decades to come. In this article, we describe Fortran codes produced, or organized, for the generation of the following random objects: numbers, probability vectors, unitary matrices, and quantum state vectors and density matrices. Some matrix functions are also included and may be of independent interest.

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...

Universal correlations and power-law tails in financial covariance matrices

Science.gov (United States)

Akemann, G.; Fischmann, J.; Vivo, P.

2010-07-01

We investigate whether quantities such as the global spectral density or individual eigenvalues of financial covariance matrices can be best modelled by standard random matrix theory or rather by its generalisations displaying power-law tails. In order to generate individual eigenvalue distributions a chopping procedure is devised, which produces a statistical ensemble of asset-price covariances from a single instance of financial data sets. Local results for the smallest eigenvalue and individual spacings are very stable upon reshuffling the time windows and assets. They are in good agreement with the universal Tracy-Widom distribution and Wigner surmise, respectively. This suggests a strong degree of robustness especially in the low-lying sector of the spectra, most relevant for portfolio selections. Conversely, the global spectral density of a single covariance matrix as well as the average over all unfolded nearest-neighbour spacing distributions deviate from standard Gaussian random matrix predictions. The data are in fair agreement with a recently introduced generalised random matrix model, with correlations showing a power-law decay.

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)

Random matrix approach to plasmon resonances in the random impedance network model of disordered nanocomposites

Science.gov (United States)

Olekhno, N. A.; Beltukov, Y. M.

2018-05-01

Random impedance networks are widely used as a model to describe plasmon resonances in disordered metal-dielectric and other two-component nanocomposites. In the present work, the spectral properties of resonances in random networks are studied within the framework of the random matrix theory. We have shown that the appropriate ensemble of random matrices for the considered problem is the Jacobi ensemble (the MANOVA ensemble). The obtained analytical expressions for the density of states in such resonant networks show a good agreement with the results of numerical simulations in a wide range of metal filling fractions 0

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.)

Random quantum operations

International Nuclear Information System (INIS)

Bruzda, Wojciech; Cappellini, Valerio; Sommers, Hans-Juergen; Zyczkowski, Karol

2009-01-01

We define a natural ensemble of trace preserving, completely positive quantum maps and present algorithms to generate them at random. Spectral properties of the superoperator Φ associated with a given quantum map are investigated and a quantum analogue of the Frobenius-Perron theorem is proved. We derive a general formula for the density of eigenvalues of Φ and show the connection with the Ginibre ensemble of real non-symmetric random matrices. Numerical investigations of the spectral gap imply that a generic state of the system iterated several times by a fixed generic map converges exponentially to an invariant state

Some open problems in random matrix theory and the theory of integrable systems

OpenAIRE

Deift, Percy

2007-01-01

We describe a list of open problems in random matrix theory and integrable systems which was presented at the conference ``Integrable Systems, Random Matrices, and Applications'' at the Courant Institute in May 2006.

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.

Realm of Matrices

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.

Extreme eigenvalues of sample covariance and correlation matrices

DEFF Research Database (Denmark)

Heiny, Johannes

This thesis is concerned with asymptotic properties of the eigenvalues of high-dimensional sample covariance and correlation matrices under an infinite fourth moment of the entries. In the first part, we study the joint distributional convergence of the largest eigenvalues of the sample covariance...... matrix of a p-dimensional heavy-tailed time series when p converges to infinity together with the sample size n. We generalize the growth rates of p existing in the literature. Assuming a regular variation condition with tail index ... eigenvalues are essentially determined by the extreme order statistics from an array of iid random variables. The asymptotic behavior of the extreme eigenvalues is then derived routinely from classical extreme value theory. The resulting approximations are strikingly simple considering the high dimension...

Random matrix theory for pseudo-Hermitian systems: Cyclic blocks

Indian Academy of Sciences (India)

Abstract. We discuss the relevance of random matrix theory for pseudo-Hermitian sys- tems, and, for Hamiltonians that break parity P and time-reversal invariance T. In an attempt to understand the random Ising model, we present the treatment of cyclic asym- metric matrices with blocks and show that the nearest-neighbour ...

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.)

Algorithm-Eigenvalue Estimation of Hyperspectral Wishart Covariance Matrices from a Limited Number of Samples

Science.gov (United States)

2015-03-01

biometrics for physiological characteristics, hyperspectral remote sensing for detecting signals buried in noise and clutter, and medical genetics for...s); %approximate bounds on the eigenvalues used in Eq. (8) that are derived %from the Marcenko- Pastur law k=p./n; %band

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

Parametric Bayesian Estimation of Differential Entropy and Relative Entropy

Directory of Open Access Journals (Sweden)

Maya Gupta

2010-04-01

Full Text Available Given iid samples drawn from a distribution with known parametric form, we propose the minimization of expected Bregman divergence to form Bayesian estimates of differential entropy and relative entropy, and derive such estimators for the uniform, Gaussian, Wishart, and inverse Wishart distributions. Additionally, formulas are given for a log gamma Bregman divergence and the differential entropy and relative entropy for the Wishart and inverse Wishart. The results, as always with Bayesian estimates, depend on the accuracy of the prior parameters, but example simulations show that the performance can be substantially improved compared to maximum likelihood or state-of-the-art nonparametric estimators.

Quantum Entanglement and Reduced Density Matrices

Science.gov (United States)

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.

Medium-induced change of the optical response of metal clusters in rare-gas matrices

Science.gov (United States)

Xuan, Fengyuan; Guet, Claude

2017-10-01

Interaction with the surrounding medium modifies the optical response of embedded metal clusters. For clusters from about ten to a few hundreds of silver atoms, embedded in rare-gas matrices, we study the environment effect within the matrix random phase approximation with exact exchange (RPAE) quantum approach, which has proved successful for free silver clusters. The polarizable surrounding medium screens the residual two-body RPAE interaction, adds a polarization term to the one-body potential, and shifts the vacuum energy of the active delocalized valence electrons. Within this model, we calculate the dipole oscillator strength distribution for Ag clusters embedded in helium droplets, neon, argon, krypton, and xenon matrices. The main contribution to the dipole surface plasmon red shift originates from the rare-gas polarization screening of the two-body interaction. The large size limit of the dipole surface plasmon agrees well with the classical prediction.

Random matrices and the six-vertex model

CERN Document Server

Bleher, Pavel

2013-01-01

This book provides a detailed description of the Riemann-Hilbert approach (RH approach) to the asymptotic analysis of both continuous and discrete orthogonal polynomials, and applications to random matrix models as well as to the six-vertex model. The RH approach was an important ingredient in the proofs of universality in unitary matrix models. This book gives an introduction to the unitary matrix models and discusses bulk and edge universality. The six-vertex model is an exactly solvable two-dimensional model in statistical physics, and thanks to the Izergin-Korepin formula for the model with domain wall boundary conditions, its partition function matches that of a unitary matrix model with nonpolynomial interaction. The authors introduce in this book the six-vertex model and include a proof of the Izergin-Korepin formula. Using the RH approach, they explicitly calculate the leading and subleading terms in the thermodynamic asymptotic behavior of the partition function of the six-vertex model with domain wa...

Malware analysis using visualized image matrices.

Science.gov (United States)

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.

Production and characterization of cornstarch/cellulose acetate/silver sulfadiazine extrudate matrices

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.

S-matrices and integrability

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)

Matrices Aléatoires Tri-diagonales et Par Blocs.

OpenAIRE

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.

Science.gov (United States)

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.

The Golden-Thompson inequality: Historical aspects and random matrix applications

International Nuclear Information System (INIS)

Forrester, Peter J.; Thompson, Colin J.

2014-01-01

The Golden-Thompson inequality, Tr (e A+B ) ⩽ Tr (e A e B ) for A, B Hermitian matrices, appeared in independent works by Golden and Thompson published in 1965. Both of these were motivated by considerations in statistical mechanics. In recent years the Golden-Thompson inequality has found applications to random matrix theory. In this article, we detail some historical aspects relating to Thompson's work, giving in particular a hitherto unpublished proof due to Dyson, and correspondence with Pólya. We show too how the 2 × 2 case relates to hyperbolic geometry, and how the original inequality holds true with the trace operation replaced by any unitarily invariant norm. In relation to the random matrix applications, we review its use in the derivation of concentration type lemmas for sums of random matrices due to Ahlswede-Winter, and Oliveira, generalizing various classical results

The Antitriangular Factorization of Saddle Point Matrices

KAUST Repository

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.

Dirac matrices for Chern-Simons gravity

Energy Technology Data Exchange (ETDEWEB)

Izaurieta, Fernando; Ramirez, Ricardo; Rodriguez, Eduardo [Departamento de Matematica y Fisica Aplicadas, Universidad Catolica de la Santisima Concepcion, Alonso de Ribera 2850, 4090541 Concepcion (Chile)

2012-10-06

A genuine gauge theory for the Poincare, de Sitter or anti-de Sitter algebras can be constructed in (2n- 1)-dimensional spacetime by means of the Chern-Simons form, yielding a gravitational theory that differs from General Relativity but shares many of its properties, such as second order field equations for the metric. The particular form of the Lagrangian is determined by a rank n, symmetric tensor invariant under the relevant algebra. In practice, the calculation of this invariant tensor can be reduced to the computation of the trace of the symmetrized product of n Dirac Gamma matrices {Gamma}{sub ab} in 2n-dimensional spacetime. While straightforward in principle, this calculation can become extremely cumbersome in practice. For large enough n, existing computer algebra packages take an inordinate long time to produce the answer or plainly fail having used up all available memory. In this talk we show that the general formula for the trace of the symmetrized product of 2n Gamma matrices {Gamma}{sub ab} can be written as a certain sum over the integer partitions s of n, with every term being multiplied by a numerical cofficient {alpha}{sub s}. We then give a general algorithm that computes the {alpha}-coefficients as the solution of a linear system of equations generated by evaluating the general formula for different sets of tensors B{sup ab} with random numerical entries. A recurrence relation between different coefficients is shown to hold and is used in a second, 'minimal' algorithm to greatly speed up the computations. Runtime of the minimal algorithm stays below 1 min on a typical desktop computer for up to n = 25, which easily covers all foreseeable applications of the trace formula.

Graphs and matrices

CERN Document Server

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...

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 ΣИ(С.

Generating and using truly random quantum states in Mathematica

Science.gov (United States)

Miszczak, Jarosław Adam

2012-01-01

The problem of generating random quantum states is of a great interest from the quantum information theory point of view. In this paper we present a package for Mathematica computing system harnessing a specific piece of hardware, namely Quantis quantum random number generator (QRNG), for investigating statistical properties of quantum states. The described package implements a number of functions for generating random states, which use Quantis QRNG as a source of randomness. It also provides procedures which can be used in simulations not related directly to quantum information processing. Program summaryProgram title: TRQS Catalogue identifier: AEKA_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEKA_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 7924 No. of bytes in distributed program, including test data, etc.: 88 651 Distribution format: tar.gz Programming language: Mathematica, C Computer: Requires a Quantis quantum random number generator (QRNG, http://www.idquantique.com/true-random-number-generator/products-overview.html) and supporting a recent version of Mathematica Operating system: Any platform supporting Mathematica; tested with GNU/Linux (32 and 64 bit) RAM: Case dependent Classification: 4.15 Nature of problem: Generation of random density matrices. Solution method: Use of a physical quantum random number generator. Running time: Generating 100 random numbers takes about 1 second, generating 1000 random density matrices takes more than a minute.

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.

On the Eigenvalues and Eigenvectors of Block Triangular Preconditioned Block Matrices

KAUST Repository

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.

Large leptonic Dirac CP phase from broken democracy with random perturbations

Science.gov (United States)

Ge, Shao-Feng; Kusenko, Alexander; Yanagida, Tsutomu T.

2018-06-01

A large value of the leptonic Dirac CP phase can arise from broken democracy, where the mass matrices are democratic up to small random perturbations. Such perturbations are a natural consequence of broken residual S3 symmetries that dictate the democratic mass matrices at leading order. With random perturbations, the leptonic Dirac CP phase has a higher probability to attain a value around ± π / 2. Comparing with the anarchy model, broken democracy can benefit from residual S3 symmetries, and it can produce much better, realistic predictions for the mass hierarchy, mixing angles, and Dirac CP phase in both quark and lepton sectors. Our approach provides a general framework for a class of models in which a residual symmetry determines the general features at leading order, and where, in the absence of other fundamental principles, the symmetry breaking appears in the form of random perturbations.

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

"G.P.S Matrices" programme: A method to improve the mastery level of social science students in matrices operations

Science.gov (United States)

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.

CONVERGENCE OF POWERS OF CONTROLLABLE INTUITIONISTIC FUZZY MATRICES

OpenAIRE

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.

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

Classification en référence à une matrice stochastique

OpenAIRE

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...

Capture Matrices Handbook

Science.gov (United States)

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

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...

Theoretical Properties for Neural Networks with Weight Matrices of Low Displacement Rank

OpenAIRE

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

Science.gov (United States)

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

Science.gov (United States)

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.

Data depth and rank-based tests for covariance and spectral density matrices

KAUST Repository

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

KAUST Repository

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.

Exact Wigner surmise type evaluation of the spacing distribution in the bulk of the scaled random matrix ensembles

International Nuclear Information System (INIS)

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

2000-01-01

Random matrix ensembles with orthogonal and unitary symmetry correspond to the cases of real symmetric and Hermitian random matrices respectively. We show that the probability density function for the corresponding spacings between consecutive eigenvalues can be written exactly in the Wigner surmise type form a(s) e-b(s) for a simply related to a Painleve transcendent and b its anti-derivative. A formula consisting of the sum of two such terms is given for the symplectic case (Hermitian matrices with real quaternion elements)

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

Science.gov (United States)

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 ...

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)

Fabrication of Aligned Carbon Nanotube/Polycaprolactone/Gelatin Nanofibrous Matrices for Schwann Cell Immobilization

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.

Nano-Fiber Reinforced Enhancements in Composite Polymer Matrices

Science.gov (United States)

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.

Product of Ginibre matrices: Fuss-Catalan and Raney distributions

Science.gov (United States)

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.

New distributed fusion filtering algorithm based on covariances over sensor networks with random packet dropouts

Science.gov (United States)

Caballero-Águila, R.; Hermoso-Carazo, A.; Linares-Pérez, J.

2017-07-01

This paper studies the distributed fusion estimation problem from multisensor measured outputs perturbed by correlated noises and uncertainties modelled by random parameter matrices. Each sensor transmits its outputs to a local processor over a packet-erasure channel and, consequently, random losses may occur during transmission. Different white sequences of Bernoulli variables are introduced to model the transmission losses. For the estimation, each lost output is replaced by its estimator based on the information received previously, and only the covariances of the processes involved are used, without requiring the signal evolution model. First, a recursive algorithm for the local least-squares filters is derived by using an innovation approach. Then, the cross-correlation matrices between any two local filters is obtained. Finally, the distributed fusion filter weighted by matrices is obtained from the local filters by applying the least-squares criterion. The performance of the estimators and the influence of both sensor uncertainties and transmission losses on the estimation accuracy are analysed in a numerical example.

Low-temperature random matrix theory at the soft edge

International Nuclear Information System (INIS)

Edelman, Alan; Persson, Per-Olof; Sutton, Brian D.

2014-01-01

“Low temperature” random matrix theory is the study of random eigenvalues as energy is removed. In standard notation, β is identified with inverse temperature, and low temperatures are achieved through the limit β → ∞. In this paper, we derive statistics for low-temperature random matrices at the “soft edge,” which describes the extreme eigenvalues for many random matrix distributions. Specifically, new asymptotics are found for the expected value and standard deviation of the general-β Tracy-Widom distribution. The new techniques utilize beta ensembles, stochastic differential operators, and Riccati diffusions. The asymptotics fit known high-temperature statistics curiously well and contribute to the larger program of general-β random matrix theory

Joint Estimation of Multiple Precision Matrices with Common Structures.

Science.gov (United States)

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.

A random matrix approach to credit risk.

Directory of Open Access Journals (Sweden)

Michael C Münnix

Full Text Available We estimate generic statistical properties of a structural credit risk model by considering an ensemble of correlation matrices. This ensemble is set up by Random Matrix Theory. We demonstrate analytically that the presence of correlations severely limits the effect of diversification in a credit portfolio if the correlations are not identically zero. The existence of correlations alters the tails of the loss distribution considerably, even if their average is zero. Under the assumption of randomly fluctuating correlations, a lower bound for the estimation of the loss distribution is provided.

A random matrix approach to credit risk.

Science.gov (United States)

Münnix, Michael C; Schäfer, Rudi; Guhr, Thomas

2014-01-01

We estimate generic statistical properties of a structural credit risk model by considering an ensemble of correlation matrices. This ensemble is set up by Random Matrix Theory. We demonstrate analytically that the presence of correlations severely limits the effect of diversification in a credit portfolio if the correlations are not identically zero. The existence of correlations alters the tails of the loss distribution considerably, even if their average is zero. Under the assumption of randomly fluctuating correlations, a lower bound for the estimation of the loss distribution is provided.

Asymptotics of eigenvalues and eigenvectors of Toeplitz matrices

Science.gov (United States)

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.

What Randomized Benchmarking Actually Measures

International Nuclear Information System (INIS)

Proctor, Timothy; Rudinger, Kenneth; Young, Kevin; Sarovar, Mohan; Blume-Kohout, Robin

2017-01-01

Randomized benchmarking (RB) is widely used to measure an error rate of a set of quantum gates, by performing random circuits that would do nothing if the gates were perfect. In the limit of no finite-sampling error, the exponential decay rate of the observable survival probabilities, versus circuit length, yields a single error metric r. For Clifford gates with arbitrary small errors described by process matrices, r was believed to reliably correspond to the mean, over all Clifford gates, of the average gate infidelity between the imperfect gates and their ideal counterparts. We show that this quantity is not a well-defined property of a physical gate set. It depends on the representations used for the imperfect and ideal gates, and the variant typically computed in the literature can differ from r by orders of magnitude. We present new theories of the RB decay that are accurate for all small errors describable by process matrices, and show that the RB decay curve is a simple exponential for all such errors. Here, these theories allow explicit computation of the error rate that RB measures (r), but as far as we can tell it does not correspond to the infidelity of a physically allowed (completely positive) representation of the imperfect gates.

Subjective randomness as statistical inference.

Science.gov (United States)

Griffiths, Thomas L; Daniels, Dylan; Austerweil, Joseph L; Tenenbaum, Joshua B

2018-06-01

Some events seem more random than others. For example, when tossing a coin, a sequence of eight heads in a row does not seem very random. Where do these intuitions about randomness come from? We argue that subjective randomness can be understood as the result of a statistical inference assessing the evidence that an event provides for having been produced by a random generating process. We show how this account provides a link to previous work relating randomness to algorithmic complexity, in which random events are those that cannot be described by short computer programs. Algorithmic complexity is both incomputable and too general to capture the regularities that people can recognize, but viewing randomness as statistical inference provides two paths to addressing these problems: considering regularities generated by simpler computing machines, and restricting the set of probability distributions that characterize regularity. Building on previous work exploring these different routes to a more restricted notion of randomness, we define strong quantitative models of human randomness judgments that apply not just to binary sequences - which have been the focus of much of the previous work on subjective randomness - but also to binary matrices and spatial clustering. Copyright © 2018 Elsevier Inc. All rights reserved.

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

OpenAIRE

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...

The physics of randomness and regularities for languages (lifetimes, family trees, and the second languages); in terms of random matrices

OpenAIRE

Tuncay, Caglar

2007-01-01

The physics of randomness and regularities for languages (mother tongues) and their lifetimes and family trees and for the second languages are studied in terms of two opposite processes; random multiplicative noise [1], and fragmentation [2], where the original model is given in the matrix format. We start with a random initial world, and come out with the regularities, which mimic various empirical data [3] for the present languages.

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.

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.

Science.gov (United States)

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'.

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

Science.gov (United States)

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

Science.gov (United States)

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.

On the pertinence to Physics of random walks induced by random dynamical systems: a survey

International Nuclear Information System (INIS)

Petritis, Dimitri

2016-01-01

Let be an abstract space and a denumerable (finite or infinite) alphabet. Suppose that is a family of functions such that for all we have and a family of transformations . The pair (( S_a)_a , ( p_a)_a ) is termed an iterated function system with place dependent probabilities. Such systems can be thought as generalisations of random dynamical systems. As a matter of fact, suppose we start from a given ; we pick then randomly, with probability p_a (x) , the transformation S_a and evolve to S_a (x) . We are interested in the behaviour of the system when the iteration continues indefinitely. Random walks of the above type are omnipresent in both classical and quantum Physics. To give a small sample of occurrences we mention: random walks on the affine group, random walks on Penrose lattices, random walks on partially directed lattices, evolution of density matrices induced by repeated quantum measurements, quantum channels, quantum random walks, etc. In this article, we review some basic properties of such systems and provide with a pathfinder in the extensive bibliography (both on mathematical and physical sides) where the main results have been originally published. (paper)

Quantitative mass spectrometry of unconventional human biological matrices

Science.gov (United States)

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.

Community Detection for Correlation Matrices

Directory of Open Access Journals (Sweden)

Mel MacMahon

2015-04-01

Full Text Available A challenging problem in the study of complex systems is that of resolving, without prior information, the emergent, mesoscopic organization determined by groups of units whose dynamical activity is more strongly correlated internally than with the rest of the system. The existing techniques to filter correlations are not explicitly oriented towards identifying such modules and can suffer from an unavoidable information loss. A promising alternative is that of employing community detection techniques developed in network theory. Unfortunately, this approach has focused predominantly on replacing network data with correlation matrices, a procedure that we show to be intrinsically biased because of its inconsistency with the null hypotheses underlying the existing algorithms. Here, we introduce, via a consistent redefinition of null models based on random matrix theory, the appropriate correlation-based counterparts of the most popular community detection techniques. Our methods can filter out both unit-specific noise and system-wide dependencies, and the resulting communities are internally correlated and mutually anticorrelated. We also implement multiresolution and multifrequency approaches revealing hierarchically nested subcommunities with “hard” cores and “soft” peripheries. We apply our techniques to several financial time series and identify mesoscopic groups of stocks which are irreducible to a standard, sectorial taxonomy; detect “soft stocks” that alternate between communities; and discuss implications for portfolio optimization and risk management.

Community Detection for Correlation Matrices

Science.gov (United States)

MacMahon, Mel; Garlaschelli, Diego

2015-04-01

A challenging problem in the study of complex systems is that of resolving, without prior information, the emergent, mesoscopic organization determined by groups of units whose dynamical activity is more strongly correlated internally than with the rest of the system. The existing techniques to filter correlations are not explicitly oriented towards identifying such modules and can suffer from an unavoidable information loss. A promising alternative is that of employing community detection techniques developed in network theory. Unfortunately, this approach has focused predominantly on replacing network data with correlation matrices, a procedure that we show to be intrinsically biased because of its inconsistency with the null hypotheses underlying the existing algorithms. Here, we introduce, via a consistent redefinition of null models based on random matrix theory, the appropriate correlation-based counterparts of the most popular community detection techniques. Our methods can filter out both unit-specific noise and system-wide dependencies, and the resulting communities are internally correlated and mutually anticorrelated. We also implement multiresolution and multifrequency approaches revealing hierarchically nested subcommunities with "hard" cores and "soft" peripheries. We apply our techniques to several financial time series and identify mesoscopic groups of stocks which are irreducible to a standard, sectorial taxonomy; detect "soft stocks" that alternate between communities; and discuss implications for portfolio optimization and risk management.

An introduction to the theory of canonical matrices

CERN Document Server

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

OpenAIRE

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...

Hamiltonian structure of isospectral deformation equation and semi-classical approximation to factorized S-matrices

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 ...

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

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.

Number-conserving random phase approximation with analytically integrated matrix elements

International Nuclear Information System (INIS)

Kyotoku, M.; Schmid, K.W.; Gruemmer, F.; Faessler, A.

1990-01-01

In the present paper a number conserving random phase approximation is derived as a special case of the recently developed random phase approximation in general symmetry projected quasiparticle mean fields. All the occurring integrals induced by the number projection are performed analytically after writing the various overlap and energy matrices in the random phase approximation equation as polynomials in the gauge angle. In the limit of a large number of particles the well-known pairing vibration matrix elements are recovered. We also present a new analytically number projected variational equation for the number conserving pairing problem

Change detection in a time series of polarimetric SAR data by an omnibus test statistic and its factorization (Conference Presentation)

Science.gov (United States)

Nielsen, Allan A.; Conradsen, Knut; Skriver, Henning

2016-10-01

Test statistics for comparison of real (as opposed to complex) variance-covariance matrices exist in the statistics literature [1]. In earlier publications we have described a test statistic for the equality of two variance-covariance matrices following the complex Wishart distribution with an associated p-value [2]. We showed their application to bitemporal change detection and to edge detection [3] in multilook, polarimetric synthetic aperture radar (SAR) data in the covariance matrix representation [4]. The test statistic and the associated p-value is described in [5] also. In [6] we focussed on the block-diagonal case, we elaborated on some computer implementation issues, and we gave examples on the application to change detection in both full and dual polarization bitemporal, bifrequency, multilook SAR data. In [7] we described an omnibus test statistic Q for the equality of k variance-covariance matrices following the complex Wishart distribution. We also described a factorization of Q = R2 R3 … Rk where Q and Rj determine if and when a difference occurs. Additionally, we gave p-values for Q and Rj. Finally, we demonstrated the use of Q and Rj and the p-values to change detection in truly multitemporal, full polarization SAR data. Here we illustrate the methods by means of airborne L-band SAR data (EMISAR) [8,9]. The methods may be applied to other polarimetric SAR data also such as data from Sentinel-1, COSMO-SkyMed, TerraSAR-X, ALOS, and RadarSat-2 and also to single-pol data. The account given here closely follows that given our recent IEEE TGRS paper [7]. Selected References [1] Anderson, T. W., An Introduction to Multivariate Statistical Analysis, John Wiley, New York, third ed. (2003). [2] Conradsen, K., Nielsen, A. A., Schou, J., and Skriver, H., "A test statistic in the complex Wishart distribution and its application to change detection in polarimetric SAR data," IEEE Transactions on Geoscience and Remote Sensing 41(1): 4-19, 2003. [3] Schou, J

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.

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

Science.gov (United States)

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

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.

Quantum Algorithms for Weighing Matrices and Quadratic Residues

OpenAIRE

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.

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

Science.gov (United States)

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.

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

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....

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

Science.gov (United States)

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

2006-08-15

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

The optimal version of Hua's fundamental theorem of geometry of rectangular matrices

CERN Document Server

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 ...

Random matrix theory and analysis of nucleus-nucleus collision at high energies

International Nuclear Information System (INIS)

Shahaliev, E.I.; Inst. of Radiation Problems, Baku; ); Kuznetsov, A.A.; Suleymanov, M.K.; ); Teryaev, O.V.; )

2006-01-01

A novel method for analysis of experimental data obtained at relativistic nucleus-nucleus collisions is proposed. The method, based on the ideas of Random Matrix Theory, is applied to detect systematic errors that occur at measurements of momentum distributions of emitted particles. The unfolded momentum distribution is well described by the Gaussian orthogonal ensemble of random matrices, when the uncertainty in the momentum distribution is maximal. The method is free from unwanted background contributions [ru

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.

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

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

Science.gov (United States)

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.

Application of Parallel Hierarchical Matrices in Spatial Statistics and Parameter Identification

KAUST Repository

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

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

OpenAIRE

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...

Learning of couplings for random asymmetric kinetic Ising models revisited: random correlation matrices and learning curves

International Nuclear Information System (INIS)

Bachschmid-Romano, Ludovica; Opper, Manfred

2015-01-01

We study analytically the performance of a recently proposed algorithm for learning the couplings of a random asymmetric kinetic Ising model from finite length trajectories of the spin dynamics. Our analysis shows the importance of the nontrivial equal time correlations between spins induced by the dynamics for the speed of learning. These correlations become more important as the spin’s stochasticity is decreased. We also analyse the deviation of the estimation error (paper)

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.

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

Fabrication of chemically cross-linked porous gelatin matrices.

Science.gov (United States)

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.

Randomized interpolative decomposition of separated representations

Science.gov (United States)

Biagioni, David J.; Beylkin, Daniel; Beylkin, Gregory

2015-01-01

We introduce an algorithm to compute tensor interpolative decomposition (dubbed CTD-ID) for the reduction of the separation rank of Canonical Tensor Decompositions (CTDs). Tensor ID selects, for a user-defined accuracy ɛ, a near optimal subset of terms of a CTD to represent the remaining terms via a linear combination of the selected terms. CTD-ID can be used as an alternative to or in combination with the Alternating Least Squares (ALS) algorithm. We present examples of its use within a convergent iteration to compute inverse operators in high dimensions. We also briefly discuss the spectral norm as a computational alternative to the Frobenius norm in estimating approximation errors of tensor ID. We reduce the problem of finding tensor IDs to that of constructing interpolative decompositions of certain matrices. These matrices are generated via randomized projection of the terms of the given tensor. We provide cost estimates and several examples of the new approach to the reduction of separation rank.

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.

Spectral statistics in semiclassical random-matrix ensembles

International Nuclear Information System (INIS)

Feingold, M.; Leitner, D.M.; Wilkinson, M.

1991-01-01

A novel random-matrix ensemble is introduced which mimics the global structure inherent in the Hamiltonian matrices of autonomous, ergodic systems. Changes in its parameters induce a transition between a Poisson and a Wigner distribution for the level spacings, P(s). The intermediate distributions are uniquely determined by a single scaling variable. Semiclassical constraints force the ensemble to be in a regime with Wigner P(s) for systems with more than two freedoms

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

CERN Document Server

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...

Inconsistent Distances in Substitution Matrices can be Avoided by Properly Handling Hydrophobic Residues

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.

Lectures on matrices

CERN Document Server

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 ...

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)

Hematopoietic stem cell cytokines and fibroblast growth factor-2 stimulate human endothelial cell-pericyte tube co-assembly in 3D fibrin matrices under serum-free defined conditions.

Directory of Open Access Journals (Sweden)

Annie O Smith

Full Text Available We describe a novel 3D fibrin matrix model using recombinant hematopoietic stem cell cytokines under serum-free defined conditions which promotes the assembly of human endothelial cell (EC tubes with co-associated pericytes. Individual ECs and pericytes are randomly mixed together and EC tubes form that is accompanied by pericyte recruitment to the EC tube abluminal surface over a 3-5 day period. These morphogenic processes are stimulated by a combination of the hematopoietic stem cell cytokines, stem cell factor, interleukin-3, stromal derived factor-1α, and Flt-3 ligand which are added in conjunction with fibroblast growth factor (FGF-2 into the fibrin matrix. In contrast, this tube morphogenic response does not occur under serum-free defined conditions when VEGF and FGF-2 are added together in the fibrin matrices. We recently demonstrated that VEGF and FGF-2 are able to prime EC tube morphogenic responses (i.e. added overnight prior to the morphogenic assay to hematopoietic stem cell cytokines in collagen matrices and, interestingly, they also prime EC tube morphogenesis in 3D fibrin matrices. EC-pericyte interactions in 3D fibrin matrices leads to marked vascular basement membrane assembly as demonstrated using immunofluorescence and transmission electron microscopy. Furthermore, we show that hematopoietic stem cell cytokines and pericytes stimulate EC sprouting in fibrin matrices in a manner dependent on the α5β1 integrin. This novel co-culture system, under serum-free defined conditions, allows for a molecular analysis of EC tube assembly, pericyte recruitment and maturation events in a critical ECM environment (i.e. fibrin matrices that regulates angiogenic events in postnatal life.

Square matrices of order 2 theory, applications, and problems

CERN Document Server

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

CERN Document Server

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)

Preparation and characterization of porous crosslinked collagenous matrices containing bioavailable chondroitin sulphate

NARCIS (Netherlands)

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

CERN Document Server

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.)

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.

SUPERCRITICAL FLUID TREATMENT OF THREE-DIMENSIONAL HYDROGEL MATRICES, COMPOSED OF CHITOSAN DERIVATIVES

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

NARCIS (Netherlands)

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

Study on vulnerability matrices of masonry buildings of mainland China

Science.gov (United States)

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

KAUST Repository

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.

Preparation and characterization of chitosan-heparin composite matrices for blood contacting tissue engineering

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.

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

Science.gov (United States)

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.

Random graph states, maximal flow and Fuss-Catalan distributions

International Nuclear Information System (INIS)

Collins, BenoIt; Nechita, Ion; Zyczkowski, Karol

2010-01-01

For any graph consisting of k vertices and m edges we construct an ensemble of random pure quantum states which describe a system composed of 2m subsystems. Each edge of the graph represents a bipartite, maximally entangled state. Each vertex represents a random unitary matrix generated according to the Haar measure, which describes the coupling between subsystems. Dividing all subsystems into two parts, one may study entanglement with respect to this partition. A general technique to derive an expression for the average entanglement entropy of random pure states associated with a given graph is presented. Our technique relies on Weingarten calculus and flow problems. We analyze the statistical properties of spectra of such random density matrices and show for which cases they are described by the free Poissonian (Marchenko-Pastur) distribution. We derive a discrete family of generalized, Fuss-Catalan distributions and explicitly construct graphs which lead to ensembles of random states characterized by these novel distributions of eigenvalues.

Random-Effects Models for Meta-Analytic Structural Equation Modeling: Review, Issues, and Illustrations

Science.gov (United States)

Cheung, Mike W.-L.; Cheung, Shu Fai

2016-01-01

Meta-analytic structural equation modeling (MASEM) combines the techniques of meta-analysis and structural equation modeling for the purpose of synthesizing correlation or covariance matrices and fitting structural equation models on the pooled correlation or covariance matrix. Both fixed-effects and random-effects models can be defined in MASEM.…

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

Monomer-dimer problem on random planar honeycomb lattice

Energy Technology Data Exchange (ETDEWEB)

Ren, Haizhen [School of Mathematical Sciences, Xiamen University, Xiamen 361005, Fujian (China); Department of Mathematics, Qinghai Normal University, Xining 810008, Qinghai (China); Zhang, Fuji; Qian, Jianguo, E-mail: jqqian@xmu.edu.cn [School of Mathematical Sciences, Xiamen University, Xiamen 361005, Fujian (China)

2014-02-15

We consider the monomer-dimer (MD) problem on a random planar honeycomb lattice model, namely, the random multiple chain. This is a lattice system with non-periodic boundary condition, whose generating process is inspired by the growth of single walled zigzag carbon nanotubes. By applying algebraic and combinatorial techniques we establish a calculating expression of the MD partition function for bipartite graphs, which corresponds to the permanent of a matrix. Further, by using the transfer matrix argument we show that the computing problem of the permanent of high order matrix can be converted into some lower order matrices for this family of lattices, based on which we derive an explicit recurrence formula for evaluating the MD partition function of multiple chains and random multiple chains. Finally, we analyze the expectation of the number of monomer-dimer arrangements on a random multiple chain and the asymptotic behavior of the annealed MD entropy when the multiple chain becomes infinite in width and length, respectively.

Universality in chaos: Lyapunov spectrum and random matrix theory.

Science.gov (United States)

Hanada, Masanori; Shimada, Hidehiko; Tezuka, Masaki

2018-02-01

We propose the existence of a new universality in classical chaotic systems when the number of degrees of freedom is large: the statistical property of the Lyapunov spectrum is described by random matrix theory. We demonstrate it by studying the finite-time Lyapunov exponents of the matrix model of a stringy black hole and the mass-deformed models. The massless limit, which has a dual string theory interpretation, is special in that the universal behavior can be seen already at t=0, while in other cases it sets in at late time. The same pattern is demonstrated also in the product of random matrices.

Universality in chaos: Lyapunov spectrum and random matrix theory

Science.gov (United States)

Hanada, Masanori; Shimada, Hidehiko; Tezuka, Masaki

2018-02-01

We propose the existence of a new universality in classical chaotic systems when the number of degrees of freedom is large: the statistical property of the Lyapunov spectrum is described by random matrix theory. We demonstrate it by studying the finite-time Lyapunov exponents of the matrix model of a stringy black hole and the mass-deformed models. The massless limit, which has a dual string theory interpretation, is special in that the universal behavior can be seen already at t =0 , while in other cases it sets in at late time. The same pattern is demonstrated also in the product of random matrices.

Laser beam propagation through random media

CERN Document Server

Andrews, Larry C

2005-01-01

Since publication of the first edition of this text in 1998, there have been several new, important developments in the theory of beam wave propagation through a random medium, which have been incorporated into this second edition. Also new to this edition are models for the scintillation index under moderate-to-strong irradiance fluctuations; models for aperture averaging based on ABCD ray matrices; beam wander and its effects on scintillation; theory of partial coherence of the source; models of rough targets for ladar applications; phase fluctuations; analysis of other beam shapes; plus exp

Properties of Zero-Free Transfer Function Matrices

Science.gov (United States)

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.

Science.gov (United States)

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.

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

NARCIS (Netherlands)

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,

Matrices and linear algebra

CERN Document Server

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

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

Quantification of iodine in porous hydroxyapatite matrices for application as radioactive sources in brachytherapy

OpenAIRE

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...

A test statistic in the complex Wishart distribution and its application to change detection in polarimetric SAR data

DEFF Research Database (Denmark)

Conradsen, Knut; Nielsen, Allan Aasbjerg; Schou, Jesper

2003-01-01

. Based on this distribution, a test statistic for equality of two such matrices and an associated asymptotic probability for obtaining a smaller value of the test statistic are derived and applied successfully to change detection in polarimetric SAR data. In a case study, EMISAR L-band data from April 17...... to HH, VV, or HV data alone, the derived test statistic reduces to the well-known gamma likelihood-ratio test statistic. The derived test statistic and the associated significance value can be applied as a line or edge detector in fully polarimetric SAR data also....

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

Characteristic Polynomials of Sample Covariance Matrices: The Non-Square Case

OpenAIRE

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.

Random matrix theory with an external source

CERN Document Server

Brézin, Edouard

2016-01-01

This is a first book to show that the theory of the Gaussian random matrix is essential to understand the universal correlations with random fluctuations and to demonstrate that it is useful to evaluate topological universal quantities. We consider Gaussian random matrix models in the presence of a deterministic matrix source. In such models the correlation functions are known exactly for an arbitrary source and for any size of the matrices. The freedom given by the external source allows for various tunings to different classes of universality. The main interest is to use this freedom to compute various topological invariants for surfaces such as the intersection numbers for curves drawn on a surface of given genus with marked points, Euler characteristics, and the Gromov–Witten invariants. A remarkable duality for the average of characteristic polynomials is essential for obtaining such topological invariants. The analysis is extended to nonorientable surfaces and to surfaces with boundaries.

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.

Science.gov (United States)

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.

A basis independent formulation of the connection between quark mass matrices, CP violation and experiment

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.

Science.gov (United States)

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

Science.gov (United States)

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.

Random unitary maps for quantum state reconstruction

International Nuclear Information System (INIS)

Merkel, Seth T.; Riofrio, Carlos A.; Deutsch, Ivan H.; Flammia, Steven T.

2010-01-01

We study the possibility of performing quantum state reconstruction from a measurement record that is obtained as a sequence of expectation values of a Hermitian operator evolving under repeated application of a single random unitary map, U 0 . We show that while this single-parameter orbit in operator space is not informationally complete, it can be used to yield surprisingly high-fidelity reconstruction. For a d-dimensional Hilbert space with the initial observable in su(d), the measurement record lacks information about a matrix subspace of dimension ≥d-2 out of the total dimension d 2 -1. We determine the conditions on U 0 such that the bound is saturated, and show they are achieved by almost all pseudorandom unitary matrices. When we further impose the constraint that the physical density matrix must be positive, we obtain even higher fidelity than that predicted from the missing subspace. With prior knowledge that the state is pure, the reconstruction will be perfect (in the limit of vanishing noise) and for arbitrary mixed states, the fidelity is over 0.96, even for small d, and reaching F>0.99 for d>9. We also study the implementation of this protocol based on the relationship between random matrices and quantum chaos. We show that the Floquet operator of the quantum kicked top provides a means of generating the required type of measurement record, with implications on the relationship between quantum chaos and information gain.

MGI-oriented High-throughput Measurement of Interdiffusion Coefficient Matrices in Ni-based Superalloys

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.

Inflation with a graceful exit in a random landscape

International Nuclear Information System (INIS)

Pedro, F.G.; Westphal, A.

2016-11-01

We develop a stochastic description of small-field inflationary histories with a graceful exit in a random potential whose Hessian is a Gaussian random matrix as a model of the unstructured part of the string landscape. The dynamical evolution in such a random potential from a small-field inflation region towards a viable late-time de Sitter (dS) minimum maps to the dynamics of Dyson Brownian motion describing the relaxation of non-equilibrium eigenvalue spectra in random matrix theory. We analytically compute the relaxation probability in a saddle point approximation of the partition function of the eigenvalue distribution of the Wigner ensemble describing the mass matrices of the critical points. When applied to small-field inflation in the landscape, this leads to an exponentially strong bias against small-field ranges and an upper bound N<<10 on the number of light fields N participating during inflation from the non-observation of negative spatial curvature.

Inflation with a graceful exit in a random landscape

Energy Technology Data Exchange (ETDEWEB)

Pedro, F.G. [Univ. Autonoma de Madrid (Spain). Dept. de Fisica Teorica y Inst. de Fisica Teorica UAM/CSIC; Westphal, A. [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany). Theory Group

2016-11-15

We develop a stochastic description of small-field inflationary histories with a graceful exit in a random potential whose Hessian is a Gaussian random matrix as a model of the unstructured part of the string landscape. The dynamical evolution in such a random potential from a small-field inflation region towards a viable late-time de Sitter (dS) minimum maps to the dynamics of Dyson Brownian motion describing the relaxation of non-equilibrium eigenvalue spectra in random matrix theory. We analytically compute the relaxation probability in a saddle point approximation of the partition function of the eigenvalue distribution of the Wigner ensemble describing the mass matrices of the critical points. When applied to small-field inflation in the landscape, this leads to an exponentially strong bias against small-field ranges and an upper bound N<<10 on the number of light fields N participating during inflation from the non-observation of negative spatial curvature.

Inflation with a graceful exit in a random landscape

Energy Technology Data Exchange (ETDEWEB)

Pedro, F.G. [Departamento de Física Teórica and Instituto de Física Teórica UAM/CSIC,Universidad Autónoma de Madrid,Cantoblanco, 28049 Madrid (Spain); Westphal, A. [Deutsches Elektronen-Synchrotron DESY, Theory Group,D-22603 Hamburg (Germany)

2017-03-30

We develop a stochastic description of small-field inflationary histories with a graceful exit in a random potential whose Hessian is a Gaussian random matrix as a model of the unstructured part of the string landscape. The dynamical evolution in such a random potential from a small-field inflation region towards a viable late-time de Sitter (dS) minimum maps to the dynamics of Dyson Brownian motion describing the relaxation of non-equilibrium eigenvalue spectra in random matrix theory. We analytically compute the relaxation probability in a saddle point approximation of the partition function of the eigenvalue distribution of the Wigner ensemble describing the mass matrices of the critical points. When applied to small-field inflation in the landscape, this leads to an exponentially strong bias against small-field ranges and an upper bound N≪10 on the number of light fields N participating during inflation from the non-observation of negative spatial curvature.

Moment matrices, border bases and radical computation

NARCIS (Netherlands)

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

NARCIS (Netherlands)

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

Porcine skin as a source of biodegradable matrices: alkaline treatment and glutaraldehyde crosslinking

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.

Supersymmetry applied to the spectrum edge of random matrix ensembles

International Nuclear Information System (INIS)

Andreev, A.V.; Simons, B.D.; Taniguchi, N.

1994-01-01

A new matrix ensemble has recently been proposed to describe the transport properties in mesoscopic quantum wires. Both analytical and numerical studies have shown that the ensemble of Laguerre or of chiral random matrices provides a good description of scattering properties in this class of systems. Until now only conventional methods of random matrix theory have been used to study statistical properties within this ensemble. We demonstrate that the supersymmetry method, already employed in the study Dyson ensembles, can be extended to treat this class of random matrix ensembles. In developing this approach we investigate both new, as well as verify known statistical measures. Although we focus on ensembles in which T-invariance is violated our approach lays the foundation for future studies of T-invariant systems. ((orig.))

Non-equilibrium random matrix theory. Transition probabilities

International Nuclear Information System (INIS)

Pedro, Francisco Gil; Westphal, Alexander

2016-06-01

In this letter we present an analytic method for calculating the transition probability between two random Gaussian matrices with given eigenvalue spectra in the context of Dyson Brownian motion. We show that in the Coulomb gas language, in large N limit, memory of the initial state is preserved in the form of a universal linear potential acting on the eigenvalues. We compute the likelihood of any given transition as a function of time, showing that as memory of the initial state is lost, transition probabilities converge to those of the static ensemble.

Non-equilibrium random matrix theory. Transition probabilities

Energy Technology Data Exchange (ETDEWEB)

Pedro, Francisco Gil [Univ. Autonoma de Madrid (Spain). Dept. de Fisica Teorica; Westphal, Alexander [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany). Gruppe Theorie

2016-06-15

In this letter we present an analytic method for calculating the transition probability between two random Gaussian matrices with given eigenvalue spectra in the context of Dyson Brownian motion. We show that in the Coulomb gas language, in large N limit, memory of the initial state is preserved in the form of a universal linear potential acting on the eigenvalues. We compute the likelihood of any given transition as a function of time, showing that as memory of the initial state is lost, transition probabilities converge to those of the static ensemble.

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

Science.gov (United States)

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.

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

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.

Quantification of iodine in porous hydroxyapatite matrices for application as radioactive sources in brachytherapy

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)

Moment matrices, border bases and radical computation

NARCIS (Netherlands)

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

Generation speed in Raven's Progressive Matrices Test

NARCIS (Netherlands)

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

Electrospun composite matrices of poly(ε-caprolactone)-montmorillonite made using tenside free Pickering emulsions

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.

Electrospun composite matrices of poly(ε-caprolactone)-montmorillonite made using tenside free Pickering emulsions

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.

Approximate joint diagonalization and geometric mean of symmetric positive definite matrices.

Science.gov (United States)

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.

The Inverse of Banded Matrices

Science.gov (United States)

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.)

The Invertibility, Explicit Determinants, and Inverses of Circulant and Left Circulant and g-Circulant Matrices Involving Any Continuous Fibonacci and Lucas Numbers

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.

Temperature dependence of electron spin-lattice relaxation of radiation-produced silver atoms in polycrystalline aqueous and glassy organic matrices. Importance of relaxation by tunneling modes in disordered matrices

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)

Raney Distributions and Random Matrix Theory

Science.gov (United States)

Forrester, Peter J.; Liu, Dang-Zheng

2015-03-01

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

Universality in invariant random-matrix models: Existence near the soft edge

International Nuclear Information System (INIS)

Kanzieper, E.; Freilikher, V.

1997-01-01

We consider two non-Gaussian ensembles of large Hermitian random matrices with strong level confinement and show that near the soft edge of the spectrum both scaled density of states and eigenvalue correlations follow so-called Airy laws inherent in the Gaussian unitary ensemble. This suggests that the invariant one-matrix models should display universal eigenvalue correlations in the soft-edge scaling limit. copyright 1997 The American Physical Society

Positive Eigenvalues of Generalized Words in Two Hermitian Positive Definite Matrices

OpenAIRE

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...

Very high performance pseudo-random number generation on DAP

Science.gov (United States)

Smith, K. A.; Reddaway, S. F.; Scott, D. M.

1985-07-01

Since the National DAP Service began at QMC in 1980, extensive use has been made of pseudo-random numbers in Monte Carlo simulation. Matrices of uniform numbers have been produced by various generators: (a) multiplicative ( x+ 1 = 13 13xn mod 2 59); (b) very long period shift register ( x4423 + x271 + 1); (c) multiple shorter period ( x127 + x7 + 1) shift registers generating several matrices per iteration. The above uniform generators can also feed a normal distribution generator that uses the Box-Muller transformation. This paper describes briefly the generators, their implementation and speed. Generator (b) has been greatly speeded-up by re-implementation, and now produces more than 100 × 10 6 high quality 16-bit numbers/s. Generator (c) is under development and will achieve even higher performance, mainly due to producing data in greater bulk. High quality numbers are expected, and performance will range from 400 to 800 × 10 6 numbers/s, depending on how the generator is used.

Finiteness properties of congruence classes of infinite matrices

NARCIS (Netherlands)

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.

Multiplicative Structure and Hecke Rings of Generator Matrices for Codes over Quotient Rings of Euclidean Domains

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.

A random matrix model for elliptic curve L-functions of finite conductor

International Nuclear Information System (INIS)

Dueñez, E; Huynh, D K; Keating, J P; Snaith, N C; Miller, S J

2012-01-01

We propose a random-matrix model for families of elliptic curve L-functions of finite conductor. A repulsion of the critical zeros of these L-functions away from the centre of the critical strip was observed numerically by Miller (2006 Exp. Math. 15 257–79); such behaviour deviates qualitatively from the conjectural limiting distribution of the zeros (for large conductors this distribution is expected to approach the one-level density of eigenvalues of orthogonal matrices after appropriate rescaling). Our purpose here is to provide a random-matrix model for Miller’s surprising discovery. We consider the family of even quadratic twists of a given elliptic curve. The main ingredient in our model is a calculation of the eigenvalue distribution of random orthogonal matrices whose characteristic polynomials are larger than some given value at the symmetry point in the spectra. We call this sub-ensemble of SO(2N) the excised orthogonal ensemble. The sieving-off of matrices with small values of the characteristic polynomial is akin to the discretization of the central values of L-functions implied by the formulae of Waldspurger and Kohnen–Zagier. The cut-off scale appropriate to modelling elliptic curve L-functions is exponentially small relative to the matrix size N. The one-level density of the excised ensemble can be expressed in terms of that of the well-known Jacobi ensemble, enabling the former to be explicitly calculated. It exhibits an exponentially small (on the scale of the mean spacing) hard gap determined by the cut-off value, followed by soft repulsion on a much larger scale. Neither of these features is present in the one-level density of SO(2N). When N → ∞ we recover the limiting orthogonal behaviour. Our results agree qualitatively with Miller’s discrepancy. Choosing the cut-off appropriately gives a model in good quantitative agreement with the number-theoretical data. (paper)

Optimal system size for complex dynamics in random neural networks near criticality

Energy Technology Data Exchange (ETDEWEB)

Wainrib, Gilles, E-mail: wainrib@math.univ-paris13.fr [Laboratoire Analyse Géométrie et Applications, Université Paris XIII, Villetaneuse (France); García del Molino, Luis Carlos, E-mail: garciadelmolino@ijm.univ-paris-diderot.fr [Institute Jacques Monod, Université Paris VII, Paris (France)

2013-12-15

In this article, we consider a model of dynamical agents coupled through a random connectivity matrix, as introduced by Sompolinsky et al. [Phys. Rev. Lett. 61(3), 259–262 (1988)] in the context of random neural networks. When system size is infinite, it is known that increasing the disorder parameter induces a phase transition leading to chaotic dynamics. We observe and investigate here a novel phenomenon in the sub-critical regime for finite size systems: the probability of observing complex dynamics is maximal for an intermediate system size when the disorder is close enough to criticality. We give a more general explanation of this type of system size resonance in the framework of extreme values theory for eigenvalues of random matrices.

Optimal system size for complex dynamics in random neural networks near criticality

International Nuclear Information System (INIS)

Wainrib, Gilles; García del Molino, Luis Carlos

2013-01-01

In this article, we consider a model of dynamical agents coupled through a random connectivity matrix, as introduced by Sompolinsky et al. [Phys. Rev. Lett. 61(3), 259–262 (1988)] in the context of random neural networks. When system size is infinite, it is known that increasing the disorder parameter induces a phase transition leading to chaotic dynamics. We observe and investigate here a novel phenomenon in the sub-critical regime for finite size systems: the probability of observing complex dynamics is maximal for an intermediate system size when the disorder is close enough to criticality. We give a more general explanation of this type of system size resonance in the framework of extreme values theory for eigenvalues of random matrices

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

OpenAIRE

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.

Science.gov (United States)

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.

Constrained Perturbation Regularization Approach for Signal Estimation Using Random Matrix Theory

KAUST Repository

Suliman, Mohamed Abdalla Elhag

2016-10-06

In this work, we propose a new regularization approach for linear least-squares problems with random matrices. In the proposed constrained perturbation regularization approach, an artificial perturbation matrix with a bounded norm is forced into the system model matrix. This perturbation is introduced to improve the singular-value structure of the model matrix and, hence, the solution of the estimation problem. Relying on the randomness of the model matrix, a number of deterministic equivalents from random matrix theory are applied to derive the near-optimum regularizer that minimizes the mean-squared error of the estimator. Simulation results demonstrate that the proposed approach outperforms a set of benchmark regularization methods for various estimated signal characteristics. In addition, simulations show that our approach is robust in the presence of model uncertainty.

Hierarchical matrix approximation of large covariance matrices

KAUST Repository

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

KAUST Repository

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.

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

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

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

OpenAIRE

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.

Science.gov (United States)

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

Flexible Bayesian Dynamic Modeling of Covariance and Correlation Matrices

KAUST Repository

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

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

Science.gov (United States)

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.

Heterogeneity Measurement Based on Distance Measure for Polarimetric SAR Data

Science.gov (United States)

Xing, Xiaoli; Chen, Qihao; Liu, Xiuguo

2018-04-01

To effectively test the scene heterogeneity for polarimetric synthetic aperture radar (PolSAR) data, in this paper, the distance measure is introduced by utilizing the similarity between the sample and pixels. Moreover, given the influence of the distribution and modeling texture, the K distance measure is deduced according to the Wishart distance measure. Specifically, the average of the pixels in the local window replaces the class center coherency or covariance matrix. The Wishart and K distance measure are calculated between the average matrix and the pixels. Then, the ratio of the standard deviation to the mean is established for the Wishart and K distance measure, and the two features are defined and applied to reflect the complexity of the scene. The proposed heterogeneity measure is proceeded by integrating the two features using the Pauli basis. The experiments conducted on the single-look and multilook PolSAR data demonstrate the effectiveness of the proposed method for the detection of the scene heterogeneity.

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.)

Statistics of the Von Mises Stress Response For Structures Subjected To Random Excitations

Directory of Open Access Journals (Sweden)

Mu-Tsang Chen

1998-01-01

Full Text Available Finite element-based random vibration analysis is increasingly used in computer aided engineering software for computing statistics (e.g., root-mean-square value of structural responses such as displacements, stresses and strains. However, these statistics can often be computed only for Cartesian responses. For the design of metal structures, a failure criterion based on an equivalent stress response, commonly known as the von Mises stress, is more appropriate and often used. This paper presents an approach for computing the statistics of the von Mises stress response for structures subjected to random excitations. Random vibration analysis is first performed to compute covariance matrices of Cartesian stress responses. Monte Carlo simulation is then used to perform scatter and failure analyses using the von Mises stress response.

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

NARCIS (Netherlands)

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

Fabrication of inert matrices for heterogeneous transmutation. EFTTRA-T2 (RAS 2) irradiation programme

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.)

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

Hierarchical matrix approximation of large covariance matrices

KAUST Repository

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

KAUST Repository

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

Report on the scientific feasibility of new matrices for the conditioning of long lived radionuclides; Rapport sur la faisabilite scientifique des matrices nouvelles de conditionnement des radionucleides a vie longue

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.)

Skew-orthogonal polynomials and random matrix theory

CERN Document Server

Ghosh, Saugata

2009-01-01

Orthogonal polynomials satisfy a three-term recursion relation irrespective of the weight function with respect to which they are defined. This gives a simple formula for the kernel function, known in the literature as the Christoffel-Darboux sum. The availability of asymptotic results of orthogonal polynomials and the simple structure of the Christoffel-Darboux sum make the study of unitary ensembles of random matrices relatively straightforward. In this book, the author develops the theory of skew-orthogonal polynomials and obtains recursion relations which, unlike orthogonal polynomials, depend on weight functions. After deriving reduced expressions, called the generalized Christoffel-Darboux formulas (GCD), he obtains universal correlation functions and non-universal level densities for a wide class of random matrix ensembles using the GCD. The author also shows that once questions about higher order effects are considered (questions that are relevant in different branches of physics and mathematics) the ...

Completely X-symmetric S-matrices corresponding to theta functions and models of statistical mechanics

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.)

Randomized Oversampling for Generalized Multiscale Finite Element Methods

KAUST Repository

Calo, Victor M.

2016-03-23

In this paper, we develop efficient multiscale methods for flows in heterogeneous media. We use the generalized multiscale finite element (GMsFEM) framework. GMsFEM approximates the solution space locally using a few multiscale basis functions. This approximation selects an appropriate snapshot space and a local spectral decomposition, e.g., the use of oversampled regions, in order to achieve an efficient model reduction. However, the successful construction of snapshot spaces may be costly if too many local problems need to be solved in order to obtain these spaces. We use a moderate quantity of local solutions (or snapshot vectors) with random boundary conditions on oversampled regions with zero forcing to deliver an efficient methodology. Motivated by the randomized algorithm presented in [P. G. Martinsson, V. Rokhlin, and M. Tygert, A Randomized Algorithm for the approximation of Matrices, YALEU/DCS/TR-1361, Yale University, 2006], we consider a snapshot space which consists of harmonic extensions of random boundary conditions defined in a domain larger than the target region. Furthermore, we perform an eigenvalue decomposition in this small space. We study the application of randomized sampling for GMsFEM in conjunction with adaptivity, where local multiscale spaces are adaptively enriched. Convergence analysis is provided. We present representative numerical results to validate the method proposed.

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

Behavior of sulfur mustard in sand, concrete, and asphalt matrices: Evaporation, degradation, and decontamination.

Science.gov (United States)

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.

Model selection with multiple regression on distance matrices leads to incorrect inferences.

Directory of Open Access Journals (Sweden)

Ryan P Franckowiak

Full Text Available In landscape genetics, model selection procedures based on Information Theoretic and Bayesian principles have been used with multiple regression on distance matrices (MRM to test the relationship between multiple vectors of pairwise genetic, geographic, and environmental distance. Using Monte Carlo simulations, we examined the ability of model selection criteria based on Akaike's information criterion (AIC, its small-sample correction (AICc, and the Bayesian information criterion (BIC to reliably rank candidate models when applied with MRM while varying the sample size. The results showed a serious problem: all three criteria exhibit a systematic bias toward selecting unnecessarily complex models containing spurious random variables and erroneously suggest a high level of support for the incorrectly ranked best model. These problems effectively increased with increasing sample size. The failure of AIC, AICc, and BIC was likely driven by the inflated sample size and different sum-of-squares partitioned by MRM, and the resulting effect on delta values. Based on these findings, we strongly discourage the continued application of AIC, AICc, and BIC for model selection with MRM.

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.

Likelihood Approximation With Parallel Hierarchical Matrices For Large Spatial Datasets

KAUST Repository

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

KAUST Repository

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.

ReplacementMatrix: a web server for maximum-likelihood estimation of amino acid replacement rate matrices.

Science.gov (United States)

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/

Random walk centrality for temporal networks

International Nuclear Information System (INIS)

Rocha, Luis E C; Masuda, Naoki

2014-01-01

Nodes can be ranked according to their relative importance within a network. Ranking algorithms based on random walks are particularly useful because they connect topological and diffusive properties of the network. Previous methods based on random walks, for example the PageRank, have focused on static structures. However, several realistic networks are indeed dynamic, meaning that their structure changes in time. In this paper, we propose a centrality measure for temporal networks based on random walks under periodic boundary conditions that we call TempoRank. It is known that, in static networks, the stationary density of the random walk is proportional to the degree or the strength of a node. In contrast, we find that, in temporal networks, the stationary density is proportional to the in-strength of the so-called effective network, a weighted and directed network explicitly constructed from the original sequence of transition matrices. The stationary density also depends on the sojourn probability q, which regulates the tendency of the walker to stay in the node, and on the temporal resolution of the data. We apply our method to human interaction networks and show that although it is important for a node to be connected to another node with many random walkers (one of the principles of the PageRank) at the right moment, this effect is negligible in practice when the time order of link activation is included. (paper)

Random walk centrality for temporal networks

Science.gov (United States)

Rocha, Luis E. C.; Masuda, Naoki

2014-06-01

Nodes can be ranked according to their relative importance within a network. Ranking algorithms based on random walks are particularly useful because they connect topological and diffusive properties of the network. Previous methods based on random walks, for example the PageRank, have focused on static structures. However, several realistic networks are indeed dynamic, meaning that their structure changes in time. In this paper, we propose a centrality measure for temporal networks based on random walks under periodic boundary conditions that we call TempoRank. It is known that, in static networks, the stationary density of the random walk is proportional to the degree or the strength of a node. In contrast, we find that, in temporal networks, the stationary density is proportional to the in-strength of the so-called effective network, a weighted and directed network explicitly constructed from the original sequence of transition matrices. The stationary density also depends on the sojourn probability q, which regulates the tendency of the walker to stay in the node, and on the temporal resolution of the data. We apply our method to human interaction networks and show that although it is important for a node to be connected to another node with many random walkers (one of the principles of the PageRank) at the right moment, this effect is negligible in practice when the time order of link activation is included.

Explicit Determinants of the RFPrLrR Circulant and RLPrFrL Circulant Matrices Involving Some Famous Numbers

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.

Corpus Linguistics, Network Analysis and Co-occurrence Matrices Corpus Linguistics, Network Analysis and Co-occurrence Matrices

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

Science.gov (United States)

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

KAUST Repository

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

KAUST Repository

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

Tensor Permutation Matrices in Finite Dimensions

OpenAIRE

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...

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

Science.gov (United States)

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

2010-05-01

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

BMP-silk composite matrices heal critically sized femoral defects

NARCIS (Netherlands)

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

Application of Parallel Hierarchical Matrices and Low-Rank Tensors in Spatial Statistics and Parameter Identification

KAUST Repository

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

Breast cancer cell behaviors on staged tumorigenesis-mimicking matrices derived from tumor cells at various malignant stages

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

Breast cancer cell behaviors on staged tumorigenesis-mimicking matrices derived from tumor cells at various malignant stages

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.

A random-matrix theory of the number sense.

Science.gov (United States)

Hannagan, T; Nieder, A; Viswanathan, P; Dehaene, S

2017-02-19

Number sense, a spontaneous ability to process approximate numbers, has been documented in human adults, infants and newborns, and many other animals. Species as distant as monkeys and crows exhibit very similar neurons tuned to specific numerosities. How number sense can emerge in the absence of learning or fine tuning is currently unknown. We introduce a random-matrix theory of self-organized neural states where numbers are coded by vectors of activation across multiple units, and where the vector codes for successive integers are obtained through multiplication by a fixed but random matrix. This cortical implementation of the 'von Mises' algorithm explains many otherwise disconnected observations ranging from neural tuning curves in monkeys to looking times in neonates and cortical numerotopy in adults. The theory clarifies the origin of Weber-Fechner's Law and yields a novel and empirically validated prediction of multi-peak number neurons. Random matrices constitute a novel mechanism for the emergence of brain states coding for quantity.This article is part of a discussion meeting issue 'The origins of numerical abilities'. © 2017 The Author(s).

Evaluation of hydrophobic materials as matrices for controlled-release drug delivery.

Science.gov (United States)

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

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

Universal properties of two-port scattering, impedance, and admittance matrices of wave-chaotic systems

International Nuclear Information System (INIS)

Hemmady, Sameer; Zheng, Xing; Hart, James; Antonsen, Thomas M. Jr.; Ott, Edward; Anlage, Steven M.

2006-01-01

Statistical fluctuations in the eigenvalues of the scattering, impedance, and admittance matrices of two-port wave-chaotic systems are studied experimentally using a chaotic microwave cavity. These fluctuations are universal in that their properties are dependent only upon the degree of loss in the cavity. We remove the direct processes introduced by the nonideally coupled driving ports through a matrix normalization process that involves the radiation-impedance matrix of the two driving ports. We find good agreement between the experimentally obtained marginal probability density functions (PDFs) of the eigenvalues of the normalized impedance, admittance, and scattering matrix and those from random matrix theory (RMT). We also experimentally study the evolution of the joint PDF of the eigenphases of the normalized scattering matrix as a function of loss. Experimental agreement with the theory by Brouwer and Beenakker for the joint PDF of the magnitude of the eigenvalues of the normalized scattering matrix is also shown

Mean anisotropy of homogeneous Gaussian random fields and anisotropic norms of linear translation-invariant operators on multidimensional integer lattices

Directory of Open Access Journals (Sweden)

Phil Diamond

2003-01-01

Full Text Available Sensitivity of output of a linear operator to its input can be quantified in various ways. In Control Theory, the input is usually interpreted as disturbance and the output is to be minimized in some sense. In stochastic worst-case design settings, the disturbance is considered random with imprecisely known probability distribution. The prior set of probability measures can be chosen so as to quantify how far the disturbance deviates from the white-noise hypothesis of Linear Quadratic Gaussian control. Such deviation can be measured by the minimal Kullback-Leibler informational divergence from the Gaussian distributions with zero mean and scalar covariance matrices. The resulting anisotropy functional is defined for finite power random vectors. Originally, anisotropy was introduced for directionally generic random vectors as the relative entropy of the normalized vector with respect to the uniform distribution on the unit sphere. The associated a-anisotropic norm of a matrix is then its maximum root mean square or average energy gain with respect to finite power or directionally generic inputs whose anisotropy is bounded above by a≥0. We give a systematic comparison of the anisotropy functionals and the associated norms. These are considered for unboundedly growing fragments of homogeneous Gaussian random fields on multidimensional integer lattice to yield mean anisotropy. Correspondingly, the anisotropic norms of finite matrices are extended to bounded linear translation invariant operators over such fields.

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

On the representation matrices of the spin permutation group. [for atomic and molecular electronic structures

Science.gov (United States)

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.

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

NARCIS (Netherlands)

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

KAUST Repository

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.

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.

The structure of completely positive matrices according to their CP-rank and CP-plus-rank

NARCIS (Netherlands)

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

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.

Polyphosphazene functionalized polyester fiber matrices for tendon tissue engineering: in vitro evaluation with human mesenchymal stem cells

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)

HLIBCov: Parallel Hierarchical Matrix Approximation of Large Covariance Matrices and Likelihoods with Applications in Parameter Identification

KAUST Repository

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.

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

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

NARCIS (Netherlands)

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

Mechanical behaviour and diffusion of gas during neutron irradiation of actinides in ceramic inert matrices

NARCIS (Netherlands)

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.

Robustness of Operational Matrices of Differentiation for Solving State-Space Analysis and Optimal Control Problems

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.

Conserved G-matrices of morphological and life-history traits among continental and island blue tit populations.

Science.gov (United States)

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.

Minimally Adhesive, Advanced Non-toxic Coatings of Dendrimeric Catalysts in Sol-Gel Matrices

Science.gov (United States)

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

Nanocomposites from Stable Dispersions of Carbon Nanotubes in Polymeric Matrices Using Dispersion Interaction

Science.gov (United States)

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

Science.gov (United States)

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

NARCIS (Netherlands)

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

Data for constructing insect genome content matrices for phylogenetic analysis and functional annotation

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

Science.gov (United States)

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.

Science.gov (United States)

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.)

A pedestrian's view on interacting particle systems, KPZ universality and random matrices

International Nuclear Information System (INIS)

Kriecherbauer, Thomas; Krug, Joachim

2010-01-01

These notes are based on lectures delivered by the authors at a Langeoog seminar of SFB/TR12 Symmetries and Universality in Mesoscopic Systems to a mixed audience of mathematicians and theoretical physicists. After a brief outline of the basic physical concepts of equilibrium and nonequilibrium states, the one-dimensional simple exclusion process is introduced as a paradigmatic nonequilibrium interacting particle system. The stationary measure on the ring is derived and the idea of the hydrodynamic limit is sketched. We then introduce the phenomenological Kardar-Parisi-Zhang (KPZ) equation and explain the associated universality conjecture for surface fluctuations in growth models. This is followed by a detailed exposition of a seminal paper of Johansson [59] that relates the current fluctuations of the totally asymmetric simple exclusion process (TASEP) to the Tracy-Widom distribution of random matrix theory. The implications of this result are discussed within the framework of the KPZ conjecture. (topical review)

Factoring symmetric indefinite matrices on high-performance architectures

Science.gov (United States)

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.

New sample treatment strategies for the determination of organic contaminants in environmental matrices.

OpenAIRE

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...

Recent advances in sample preparation methods for analysis of endocrine disruptors from various matrices.

Science.gov (United States)

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.