Moraxella bovoculi em casos de ceratoconjuntivite infecciosa bovina no Rio Grande do Sul
Felipe Libardoni
2012-08-01
Full Text Available A ceratoconjuntivite infecciosa (CI, embora raramente fatal, resulta em perdas econômicas significativas para os rebanhos bovinos e ovinos. Os principais agentes causadores dessa enfermidade são Moraxella bovis e Moraxella ovis. Em 2007 foi descrita uma nova espécie também responsável pela CI e denominada Moraxella bovoculi, que até o presente momento, não havia sido relatada no Brasil. Assim, objetivou-se com este trabalho caracterizar e distinguir 54 isolados de Moraxella spp. de amostras clínicas oriundas de 34 bovinos e 17 ovinos, encaminhadas ao Laboratório de Bacteriologia da Universidade Federal de Santa Maria no período de 1990 a 2011, visando a identificação de M. bovoculi. A distinção dos isolados foi fundamentada nas características genotípicas, pela amplificação parcial da região intergênica 16S-23S e clivagem dos produtos da amplificação com enzima RsaI. Como resultados, 25 (46% isolados foram caracterizados como M. bovis, 17 (32% como M. ovis e 12 (22% como M. bovoculi. Logo, conclui-se que M. bovoculi encontra-se presente no rebanho bovino do Rio Grande do Sul e, portanto, no Brasil.
Differences in the antimicrobial susceptibility profiles of Moraxella bovis, M. bovoculi and M. ovis
Maboni, Grazieli; Gressler, Leticia T.; Espindola, Julia P.; Schwab, Marcelo; Tasca, Caiane; Potter, Luciana; de Vargas, Agueda Castagna
2015-01-01
The aim of this study was to determine the differences in the antimicrobial susceptibility profiles of Moraxella bovis, M. bovoculi and M. ovis. Thirty-two strains of Moraxella spp. isolated from cattle and sheep with infectious keratoconjunctivitis were tested via broth microdilution method to determine their susceptibility to ampicillin, cefoperazone, ceftiofur, cloxacillin, enrofloxacin, florfenicol, gentamicin, neomycin, oxytetracycline and penicillin. The results demonstrated that Moraxella spp. strains could be considered sensitive for most of the antimicrobials tested in this study, but differences between the antimicrobial susceptibility profiles of these three Moraxella species were found. M. bovis might differ from other species due to the higher MIC and MBC values it presented. PMID:26273272
Differences in the antimicrobial susceptibility profiles of Moraxella bovis, M. bovoculi and M. ovis
Grazieli Maboni
2015-06-01
Full Text Available The aim of this study was to determine the differences in the antimicrobial susceptibility profiles of Moraxella bovis, M. bovoculi and M. ovis. Thirty-two strains of Moraxella spp. isolated from cattle and sheep with infectious keratoconjunctivitis were tested via broth microdilution method to determine their susceptibility to ampicillin, cefoperazone, ceftiofur, cloxacillin, enrofloxacin, florfenicol, gentamicin, neomycin, oxytetracycline and penicillin. The results demonstrated that Moraxella spp. strains could be considered sensitive for most of the antimicrobials tested in this study, but differences between the antimicrobial susceptibility profiles of these three Moraxella species were found. M. bovis might differ from other species due to the higher MIC and MBC values it presented.
Channel matrix, measurement matrix and collapsed matrix in teleportation
Zha, Xin-Wei; Qi, Jian-Xia; Song, Hai-Yang
2014-01-01
In this paper, two kinds of coefficient matrixes (channel matrix, measurement matrix)associated with the pure state for teleportation are presented, the general relation among channel matrix, measurement matrix and collapsed matrix is obtained. In addition, a criterion for teleportation that the number of coefficient of an unknown state is determined by the rank of the collapsed matrix is given.
Plefka, J. C.; Serone, M.; Waldron, A.K.
1998-01-01
The technology required for eikonal scattering amplitude calculations in Matrix theory is developed. Using the entire supersymmetric completion of the v^4/r^7 Matrix theory potential we compute the graviton-graviton scattering amplitude and find agreement with eleven dimensional supergravity at tree level.
Bodewig, E
1959-01-01
Matrix Calculus, Second Revised and Enlarged Edition focuses on systematic calculation with the building blocks of a matrix and rows and columns, shunning the use of individual elements. The publication first offers information on vectors, matrices, further applications, measures of the magnitude of a matrix, and forms. The text then examines eigenvalues and exact solutions, including the characteristic equation, eigenrows, extremum properties of the eigenvalues, bounds for the eigenvalues, elementary divisors, and bounds for the determinant. The text ponders on approximate solutions, as well
Richardson, Thomas M.
2014-01-01
The reciprocal Pascal matrix is the Hadamard inverse of the symmetric Pascal matrix. We show that the ordinary matrix inverse of the reciprocal Pascal matrix has integer elements. The proof uses two factorizations of the matrix of super Catalan numbers.
Bhatia, Rajendra
1997-01-01
A good part of matrix theory is functional analytic in spirit. This statement can be turned around. There are many problems in operator theory, where most of the complexities and subtleties are present in the finite-dimensional case. My purpose in writing this book is to present a systematic treatment of methods that are useful in the study of such problems. This book is intended for use as a text for upper division and gradu ate courses. Courses based on parts of the material have been given by me at the Indian Statistical Institute and at the University of Toronto (in collaboration with Chandler Davis). The book should also be useful as a reference for research workers in linear algebra, operator theory, mathe matical physics and numerical analysis. A possible subtitle of this book could be Matrix Inequalities. A reader who works through the book should expect to become proficient in the art of deriving such inequalities. Other authors have compared this art to that of cutting diamonds. One first has to...
Belitsky, A V
2016-01-01
The Operator Product Expansion for null polygonal Wilson loop in planar maximally supersymmetric Yang-Mills theory runs systematically in terms of multiparticle pentagon transitions which encode the physics of excitations propagating on the color flux tube ending on the sides of the four-dimensional contour. Their dynamics was unravelled in the past several years and culminated in a complete description of pentagons as an exact function of the 't Hooft coupling. In this paper we provide a solution for the last building block in this program, the SU(4) matrix structure arising from internal symmetry indices of scalars and fermions. This is achieved by a recursive solution of the Mirror and Watson equations obeyed by the so-called singlet pentagons and fixing the form of the twisted component in their tensor decomposition. The non-singlet, or charged, pentagons are deduced from these by a limiting procedure.
Kargın, Levent; Kurt, Veli
2015-01-01
In this study, obtaining the matrix analog of the Euler's reflection formula for the classical gamma function we expand the domain of the gamma matrix function and give a infinite product expansion of sinπxP. Furthermore we define Riemann zeta matrix function and evaluate some other matrix integrals. We prove a functional equation for Riemann zeta matrix function.
Orthogonal Matrix in Cryptography
Santana, Yeray Cachon
2014-01-01
In this work is proposed a method using orthogonal matrix transform properties to encrypt and decrypt a message. It will be showed how to use matrix functions to create complex encryptions. Because orthogonal matrix are always diagonalizable on R, and the exponential of a diagonal matrix is easy to compute, the exponential of orthogonal matrix will be used to encrypt text messages.
Grcar, Joseph F.
2002-02-04
A matrix lower bound is defined that generalizes ideas apparently due to S. Banach and J. von Neumann. The matrix lower bound has a natural interpretation in functional analysis, and it satisfies many of the properties that von Neumann stated for it in a restricted case. Applications for the matrix lower bound are demonstrated in several areas. In linear algebra, the matrix lower bound of a full rank matrix equals the distance to the set of rank-deficient matrices. In numerical analysis, the ratio of the matrix norm to the matrix lower bound is a condition number for all consistent systems of linear equations. In optimization theory, the matrix lower bound suggests an identity for a class of min-max problems. In real analysis, a recursive construction that depends on the matrix lower bound shows that the level sets of continuously differential functions lie asymptotically near those of their tangents.
Makeenko, Yu.; Zarembo, K.
1993-01-01
We study fermionic one-matrix, two-matrix and $D$-dimensional gauge invariant matrix models. In all cases we derive loop equations which unambiguously determine the large-$N$ solution. For the one-matrix case the solution is obtained for an arbitrary interaction potential and turns out to be equivalent to the one for the Hermitean one-matrix model with a logarithmic potential and, therefore, belongs to the same universality class. The explicit solutions for the fermionic two-matrix and $D$-di...
Petersen, Kaare Brandt; Pedersen, Michael Syskind
Matrix identities, relations and approximations. A desktop reference for quick overview of mathematics of matrices.......Matrix identities, relations and approximations. A desktop reference for quick overview of mathematics of matrices....
Matrix metalloproteinases and epileptogenesis
Ikonomidou, Chrysanthy
2014-01-01
Matrix metalloproteinases are vital drivers of synaptic remodeling in health and disease. It is suggested that at early stages of epileptogenesis, inhibition of matrix metalloproteinases may help ameliorate cell death, aberrant network rewiring, and neuroinflammation and prevent development of epilepsy.
Givoni, Inmar; Cheung, Vincent; Frey, Brendan J.
2012-01-01
Many tasks require finding groups of elements in a matrix of numbers, symbols or class likelihoods. One approach is to use efficient bi- or tri-linear factorization techniques including PCA, ICA, sparse matrix factorization and plaid analysis. These techniques are not appropriate when addition and multiplication of matrix elements are not sensibly defined. More directly, methods like bi-clustering can be used to classify matrix elements, but these methods make the overly-restrictive assumptio...
Matrix Order Differintegration
Naber, Mark
2003-01-01
The Riemann-Liouville formula for fractional derivatives and integrals (differintegration) is used to derive formulae for matrix order derivatives and integrals. That is, the parameter for integration and differentiation is allowed to assume matrix values. It is found that the computation of derivatives and integrals to matrix order is well defined for any square matrix over the complex numbers. Some properties are worked out for special classes of matrices. It is hoped that this new formalis...
Fong, Jiunn N. C.; Yildiz, Fitnat H.
2015-01-01
Proteinaceous components of the biofilm matrix include secreted extracellular proteins, cell surface adhesins and protein subunits of cell appendages such as flagella and pili. Biofilm matrix proteins play diverse roles in biofilm formation and dissolution. They are involved in attaching cells to surfaces, stabilizing the biofilm matrix via interactions with exopolysaccharide and nucleic acid components, developing three-dimensional biofilm architectures, and dissolving biofilm matrix via enz...
Schell, David George
2008-01-01
The matrix partition problem has been of recent interest in graph theory. Matrix partitions generalize the study of graph colourings and homomorphisms. Many well-known graph partition problems can be stated in terms of matrices. For example skew partitions, split partitions, homogeneous sets, clique-cutsets, stable-cutsets and k-colourings can all be modeled as matrix partitions. For each matrix partition problem there is an equivalent trigraph H-colouring problem. We show a ‘dichotomy’ for t...
Matrix with Prescribed Eigenvectors
Ahmad, Faiz
2011-01-01
It is a routine matter for undergraduates to find eigenvalues and eigenvectors of a given matrix. But the converse problem of finding a matrix with prescribed eigenvalues and eigenvectors is rarely discussed in elementary texts on linear algebra. This problem is related to the "spectral" decomposition of a matrix and has important technical…
Bosonic Matrix Theory and Matrix Dbranes
Chaudhuri, S
2002-01-01
We develop new tools for an in-depth investigation of our recent proposal for Matrix Theory. We construct the anomaly-free and finite planar continuum limit of the ground state with SO(2^{13}) symmetry matching with the tadpole and tachyon free IR stable high temperature ground state of the open and closed bosonic string. The correspondence between large N limits and spacetime effective actions is demonstrated more generally for an arbitrary D25brane ground state which might include brane-antibrane pairs or NS-branes and which need not have an action formulation. Closure of the finite N matrix Lorentz algebra nevertheless requires that such a ground state is simultaneously charged under all even rank antisymmetric matrix potentials. Additional invariance under the gauge symmetry mediated by the one-form matrix potential requires a ground state charged under the full spectrum of antisymmetric (p+1)-form matrix potentials with p taking any integer value less than 26. Matrix Dbrane democracy has a beautiful larg...
Parce, J. Wallace; Bernatis, Paul; Dubrow, Robert; Freeman, William P.; Gamoras, Joel; Kan, Shihai; Meisel, Andreas; Qian, Baixin; Whiteford, Jeffery A.; Ziebarth, Jonathan
2010-01-12
Matrixes doped with semiconductor nanocrystals are provided. In certain embodiments, the semiconductor nanocrystals have a size and composition such that they absorb or emit light at particular wavelengths. The nanocrystals can comprise ligands that allow for mixing with various matrix materials, including polymers, such that a minimal portion of light is scattered by the matrixes. The matrixes of the present invention can also be utilized in refractive index matching applications. In other embodiments, semiconductor nanocrystals are embedded within matrixes to form a nanocrystal density gradient, thereby creating an effective refractive index gradient. The matrixes of the present invention can also be used as filters and antireflective coatings on optical devices and as down-converting layers. Processes for producing matrixes comprising semiconductor nanocrystals are also provided. Nanostructures having high quantum efficiency, small size, and/or a narrow size distribution are also described, as are methods of producing indium phosphide nanostructures and core-shell nanostructures with Group II-VI shells.
Parallelism in matrix computations
Gallopoulos, Efstratios; Sameh, Ahmed H
2016-01-01
This book is primarily intended as a research monograph that could also be used in graduate courses for the design of parallel algorithms in matrix computations. It assumes general but not extensive knowledge of numerical linear algebra, parallel architectures, and parallel programming paradigms. The book consists of four parts: (I) Basics; (II) Dense and Special Matrix Computations; (III) Sparse Matrix Computations; and (IV) Matrix functions and characteristics. Part I deals with parallel programming paradigms and fundamental kernels, including reordering schemes for sparse matrices. Part II is devoted to dense matrix computations such as parallel algorithms for solving linear systems, linear least squares, the symmetric algebraic eigenvalue problem, and the singular-value decomposition. It also deals with the development of parallel algorithms for special linear systems such as banded ,Vandermonde ,Toeplitz ,and block Toeplitz systems. Part III addresses sparse matrix computations: (a) the development of pa...
Motl, L
2001-01-01
In this short note we construct the DLCQ description of the flux seven-branes in type IIA string theory and discuss its basic properties. The matrix model involves dipole fields. We explain the relation of this nonlocal matrix model to various orbifolds. We also give a spacetime interpretation of the Seiberg-Witten-like map, proposed in a different context first by Bergman and Ganor, that converts this matrix model to a local, highly nonlinear theory.
He, Y.; Jejjala, V.
2003-01-01
Inspired by a formal resemblance of certain q-expansions of modular forms and the master field formalism of matrix models in terms of Cuntz operators, we construct a Hermitian one-matrix model, which we dub the ``modular matrix model.'' Together with an N=1 gauge theory and a special Calabi-Yau geometry, we find a modular matrix model that naturally encodes the Klein elliptic j-invariant, and hence, by Moonshine, the irreducible representations of the Fischer-Griess Monster group.
Matrix metalloproteinases and epileptogenesis.
Ikonomidou, Chrysanthy
2014-12-01
Matrix metalloproteinases are vital drivers of synaptic remodeling in health and disease. It is suggested that at early stages of epileptogenesis, inhibition of matrix metalloproteinases may help ameliorate cell death, aberrant network rewiring, and neuroinflammation and prevent development of epilepsy. PMID:26567100
Schneider, Jesper Wiborg; Borlund, Pia
2007-01-01
The present two-part article introduces matrix comparison as a formal means for evaluation purposes in informetric studies such as cocitation analysis. In the first part, the motivation behind introducing matrix comparison to informetric studies, as well as two important issues influencing such...... comparisons, matrix generation, and the composition of proximity measures, are introduced and discussed. In this second part, the authors introduce and thoroughly demonstrate two related matrix comparison techniques the Mantel test and Procrustes analysis, respectively. These techniques can compare and...... evaluate the degree of monotonicity between different proximity measures or their ordination results. In common with these techniques is the application of permutation procedures to test hypotheses about matrix resemblances. The choice of technique is related to the validation at hand. In the case of the...
The collision integral terms in Boltzmann equation are reformulated numerically leading to the substitution of the multiple integrals with a multiplicative matrix of the two colliding species velocity distribution functions which varies with the differential collision cross section. A matrix of lower rank may be constructed when one of the distribution functions is specified, in which case the matrix elements represent kinetic transition probabilities in the velocity space and the multiplication of the time rate collision matrix with the unknown velocity distribution function expresses the time rate of change of the distribution. The collision matrix may be used to describe the time evolution of systems in nonequilibrium conditions, to evaluate the rate of momentum and energy transfer between given species, or to generate validity criteria for linearized kinetic equations
To increase the accuracy of discrimination of true coincidences against the background of accidental ones, circuit has been developed which operates on the principle of dynamic equalization of resolution times of two coincidence circuits. The flowsheet of a 4x6 double-coincidence matrix is given. The principal elements of the matrix are commutators and output signal shapers. The matrix uses 138-series microcircuits. The resolution time of coincidence circuits is 10 ns, the dead time is 25 ns. The results of testing the matrix during experiments under conditions of a high background of accidental coincidences (70-90%) have shown that the accuracy of discrimination of true coincidences with the help of the double-coincidence matrix approximates the accuracy of time-to-digital converters within the limits of the statistical accuracy
The so-called vulnerability matrix is used in the evaluation part of the probabilistic safety assessment for a nuclear power plant, during the containment event trees calculations. This matrix is established from what is knows as Numerical Categories for Engineering Judgement. This matrix is usually established with numerical values obtained with traditional arithmetic using the set theory. The representation of this matrix with fuzzy numbers is much more adequate, due to the fact that the Numerical Categories for Engineering Judgement are better represented with linguistic variables, such as 'highly probable', 'probable', 'impossible', etc. In the present paper a methodology to obtain a Fuzzy Vulnerability Matrix is presented, starting from the recommendations on the Numerical Categories for Engineering Judgement. (author)
Hansen, Kristoffer Arnsfelt; Ibsen-Jensen, Rasmus; Podolskii, Vladimir V.;
2013-01-01
For matrix games we study how small nonzero probability must be used in optimal strategies. We show that for image win–lose–draw games (i.e. image matrix games) nonzero probabilities smaller than image are never needed. We also construct an explicit image win–lose game such that the unique optimal...... strategy uses a nonzero probability as small as image. This is done by constructing an explicit image nonsingular image matrix, for which the inverse has only nonnegative entries and where some of the entries are of value image....
Morozov, A
2012-01-01
Partition functions of eigenvalue matrix models possess a number of very different descriptions: as matrix integrals, as solutions to linear and non-linear equations, as tau-functions of integrable hierarchies and as special-geometry prepotentials, as result of the action of W-operators and of various recursions on elementary input data, as gluing of certain elementary building blocks. All this explains the central role of such matrix models in modern mathematical physics: they provide the basic "special functions" to express the answers and relations between them, and they serve as a dream model of what one should try to achieve in any other field.
Quivers from Matrix Factorizations
Aspinwall, Paul S
2010-01-01
We discuss how matrix factorizations offer a practical method of computing the quiver and associated superpotential for a hypersurface singularity. This method also yields explicit geometrical interpretations of D-branes (i.e., quiver representations) on a resolution given in terms of Grassmannians. As an example we analyze some non-toric singularities which are resolved by a single CP1 but have "length" greater than one. These examples have a much richer structure than conifolds. A picture is proposed that relates matrix factorizations in Landau-Ginzburg theories to the way that matrix factorizations are used in this paper to perform noncommutative resolutions.
Eves, Howard
1980-01-01
The usefulness of matrix theory as a tool in disciplines ranging from quantum mechanics to psychometrics is widely recognized, and courses in matrix theory are increasingly a standard part of the undergraduate curriculum.This outstanding text offers an unusual introduction to matrix theory at the undergraduate level. Unlike most texts dealing with the topic, which tend to remain on an abstract level, Dr. Eves' book employs a concrete elementary approach, avoiding abstraction until the final chapter. This practical method renders the text especially accessible to students of physics, engineeri
Araújo, C. Mendes; Juan R. Torregrosa; Urbano, Ana M.
2003-01-01
An n x n matrix is called an N-matrix if all principal minors are negative. In this paper, we are interested in N-matrix completion problems, that is, when a partial N-matrix hás an N-matrix completion. In general, a combinatorially or non-combinatorially symmetric partial N-matrix does not have an N-matrix completion. Here we prove that a combinatorially symmetric partial N-matrix has an N-matrix completion if the graph of its specified entries is a 1-chordal graph. We also prove that there ...
Matrix-Free Approximate Equilibration
Bradley, Andrew M.; Murray, Walter
2011-01-01
The condition number of a diagonally scaled matrix, for appropriately chosen scaling matrices, is often less than that of the original. Equilibration scales a matrix so that the scaled matrix's row and column norms are equal. Scaling can be approximate. We develop approximate equilibration algorithms for nonsymmetric and symmetric matrices having signed elements that access a matrix only by matrix-vector products.
The "Pesticide-exposure Matrix" was developed to help epidemiologists and other researchers identify the active ingredients to which people were likely exposed when their homes and gardens were treated for pests in past years.
Hill, William Fawcett
1971-01-01
Leadership style, group composition, and group development are simultaneously quantified through the use of the matrix. It represents an attempt to objectify the art of group therapy. Comment by Richard C. Rank follows. (Author)
The Matrix Organization Revisited
Gattiker, Urs E.; Ulhøi, John Parm
1999-01-01
This paper gives a short overview of matrix structure and technology management. It outlines some of the characteristics and also points out that many organizations may actualy be hybrids (i.e. mix several ways of organizing to allocate resorces effectively).......This paper gives a short overview of matrix structure and technology management. It outlines some of the characteristics and also points out that many organizations may actualy be hybrids (i.e. mix several ways of organizing to allocate resorces effectively)....
Bedford, J; Papageorgakis, C.; Rodriguez-Gomez, D.; Ward, J.
2007-01-01
Following the holographic description of linear dilaton null Cosmologies with a Big Bang in terms of Matrix String Theory put forward by Craps, Sethi and Verlinde, we propose an extended background describing a Universe including both Big Bang and Big Crunch singularities. This belongs to a class of exact string backgrounds and is perturbative in the string coupling far away from the singularities, both of which can be resolved using Matrix String Theory. We provide a simple theory capable of...
Periwal, Vipul; Tafjord, Oyvind
1998-01-01
String configurations have been identified in compactified Matrix theory at vanishing string coupling. We show how the interactions of these strings are determined by the Yang-Mills gauge field on the worldsheet. At finite string coupling, this suggests the underlying dynamics is not well-approximated as a theory of strings. This may explain why string perturbation theory diverges badly, while Matrix string perturbation theory presumably has a perturbative expansion with properties similar to...
Bosonic Matrix Theory and Matrix Dbranes
Chaudhuri, Shyamoli
2002-01-01
We develop new tools for an in-depth study of our recent proposal for Matrix Theory. We construct the anomaly-free and finite planar continuum limit of the ground state with SO(2^{13}) symmetry matching with the tadpole and tachyon free IR stable high temperature ground state of the open and closed bosonic string. The correspondence between large N limits and spacetime effective actions is demonstrated more generally for an arbitrary D25brane ground state which might include brane-antibrane p...
Bhatia, Rajendra
2013-01-01
This book is an outcome of the Indo-French Workshop on Matrix Information Geometries (MIG): Applications in Sensor and Cognitive Systems Engineering, which was held in Ecole Polytechnique and Thales Research and Technology Center, Palaiseau, France, in February 23-25, 2011. The workshop was generously funded by the Indo-French Centre for the Promotion of Advanced Research (IFCPAR). During the event, 22 renowned invited french or indian speakers gave lectures on their areas of expertise within the field of matrix analysis or processing. From these talks, a total of 17 original contribution or state-of-the-art chapters have been assembled in this volume. All articles were thoroughly peer-reviewed and improved, according to the suggestions of the international referees. The 17 contributions presented are organized in three parts: (1) State-of-the-art surveys & original matrix theory work, (2) Advanced matrix theory for radar processing, and (3) Matrix-based signal processing applications.
Pan, Feng [Los Alamos National Laboratory; Kasiviswanathan, Shiva [Los Alamos National Laboratory
2010-01-01
In the matrix interdiction problem, a real-valued matrix and an integer k is given. The objective is to remove k columns such that the sum over all rows of the maximum entry in each row is minimized. This combinatorial problem is closely related to bipartite network interdiction problem which can be applied to prioritize the border checkpoints in order to minimize the probability that an adversary can successfully cross the border. After introducing the matrix interdiction problem, we will prove the problem is NP-hard, and even NP-hard to approximate with an additive n{gamma} factor for a fixed constant {gamma}. We also present an algorithm for this problem that achieves a factor of (n-k) mUltiplicative approximation ratio.
Frandsen, Gudmund Skovbjerg; Frandsen, Peter Frands
2009-01-01
We consider maintaining information about the rank of a matrix under changes of the entries. For n×n matrices, we show an upper bound of O(n1.575) arithmetic operations and a lower bound of Ω(n) arithmetic operations per element change. The upper bound is valid when changing up to O(n0.575) entries...... in a single column of the matrix. We also give an algorithm that maintains the rank using O(n2) arithmetic operations per rank one update. These bounds appear to be the first nontrivial bounds for the problem. The upper bounds are valid for arbitrary fields, whereas the lower bound is valid for...... algebraically closed fields. The upper bound for element updates uses fast rectangular matrix multiplication, and the lower bound involves further development of an earlier technique for proving lower bounds for dynamic computation of rational functions....
Pérez López, César
2014-01-01
MATLAB is a high-level language and environment for numerical computation, visualization, and programming. Using MATLAB, you can analyze data, develop algorithms, and create models and applications. The language, tools, and built-in math functions enable you to explore multiple approaches and reach a solution faster than with spreadsheets or traditional programming languages, such as C/C++ or Java. MATLAB Matrix Algebra introduces you to the MATLAB language with practical hands-on instructions and results, allowing you to quickly achieve your goals. Starting with a look at symbolic and numeric variables, with an emphasis on vector and matrix variables, you will go on to examine functions and operations that support vectors and matrices as arguments, including those based on analytic parent functions. Computational methods for finding eigenvalues and eigenvectors of matrices are detailed, leading to various matrix decompositions. Applications such as change of bases, the classification of quadratic forms and ...
Perin, Charles; Le Goc, Mathieu; Di Vozzo, Romain; Fekete, Jean-Daniel; Dragicevic, Pierre
2015-01-01
In this paper, we relate the iterative fabrication of a physical Bertin Matrix. Jacques Bertin designed and refined such devices over 10 years (1970–1980) and five iterations of what he called Dominos 1–5. For the purpose of an exhibit dedicated to Bertin's work during VIS 2014 in Paris, we designed an improved version of such device by leveraging modern fabrication possibilities and in particular a laser cutter. We describe the process, iterations and improvements of our matrix, and report l...
A nonsupersymmetric matrix orbifold
Banks, Tom; Motl, Lubos
1999-01-01
We construct the matrix description for a twisted version of the IIA string theory on S^1 with fermions antiperiodic around a spatial circle. The result is a 2+1-dimensional U(N) x U(N) nonsupersymmetric Yang-Mills theory with fermionic matter transforming in the (N,Nbar). The two U(N)'s are exchanged if one goes around a twisted circle of the worldvolume. Relations with Type 0 theories are explored and we find Type 0 matrix string limits of our gauge theory. We argue however that most of the...
Brown, T.W.
2010-11-15
The same complex matrix model calculates both tachyon scattering for the c=1 non-critical string at the self-dual radius and certain correlation functions of half-BPS operators in N=4 super- Yang-Mills. It is dual to another complex matrix model where the couplings of the first model are encoded in the Kontsevich-like variables of the second. The duality between the theories is mirrored by the duality of their Feynman diagrams. Analogously to the Hermitian Kontsevich- Penner model, the correlation functions of the second model can be written as sums over discrete points in subspaces of the moduli space of punctured Riemann surfaces. (orig.)
The same complex matrix model calculates both tachyon scattering for the c=1 non-critical string at the self-dual radius and certain correlation functions of half-BPS operators in N=4 super- Yang-Mills. It is dual to another complex matrix model where the couplings of the first model are encoded in the Kontsevich-like variables of the second. The duality between the theories is mirrored by the duality of their Feynman diagrams. Analogously to the Hermitian Kontsevich- Penner model, the correlation functions of the second model can be written as sums over discrete points in subspaces of the moduli space of punctured Riemann surfaces. (orig.)
Frahm, K M
2016-01-01
Using parallels with the quantum scattering theory, developed for processes in nuclear and mesoscopic physics and quantum chaos, we construct a reduced Google matrix $G_R$ which describes the properties and interactions of a certain subset of selected nodes belonging to a much larger directed network. The matrix $G_R$ takes into account effective interactions between subset nodes by all their indirect links via the whole network. We argue that this approach gives new possibilities to analyze effective interactions in a group of nodes embedded in a large directed networks. Possible efficient numerical methods for the practical computation of $G_R$ are also described.
Hohn, Franz E
2012-01-01
This complete and coherent exposition, complemented by numerous illustrative examples, offers readers a text that can teach by itself. Fully rigorous in its treatment, it offers a mathematically sound sequencing of topics. The work starts with the most basic laws of matrix algebra and progresses to the sweep-out process for obtaining the complete solution of any given system of linear equations - homogeneous or nonhomogeneous - and the role of matrix algebra in the presentation of useful geometric ideas, techniques, and terminology.Other subjects include the complete treatment of the structur
Matrixed business support comparison study.
Parsons, Josh D.
2004-11-01
The Matrixed Business Support Comparison Study reviewed the current matrixed Chief Financial Officer (CFO) division staff models at Sandia National Laboratories. There were two primary drivers of this analysis: (1) the increasing number of financial staff matrixed to mission customers and (2) the desire to further understand the matrix process and the opportunities and challenges it creates.
Ortiz, Thomas; Samtleben, Henning; Tsimpis, Dimitrios
2014-01-01
We set up the formalism of holographic renormalization for the matter-coupled two-dimensional maximal supergravity that captures the low-lying fluctuations around the non-conformal D0-brane near-horizon geometry. As an application we compute holographically one- and two-point functions of the BFSS matrix quantum mechanics and its supersymmetric $SO(3)\\times SO(6)$ deformation.
The number of background events in nuclear and particle physics experiments which use multiwire proportional chambers can be extremely high. Using a computer to resolve these events results in a high deadtime for the experiment. A fast matrix system for decreasing the number of background events is described in this report. 4 figures
Matrix Synthesis and Characterization
1984-01-01
The role of NASA in the area of composite material synthesis; evaluation techniques; prediction analysis techniques; solvent-resistant tough composite matrix; resistance to paint strippers; acceptable processing temperature and pressure for thermoplastics; and the role of computer modeling and fiber interface improvement were discussed.
r-BlockPermutation Factor Circulant Matrix and Inverse Matrix
SUN Ji zhong; QIN Keyun; Hu, Yan
2012-01-01
The concept of r-block permutation factor circulant matrix is presented. The characteristics of r-block permutation factor circulant matrix are discussed by Kronecker. The interchange ability of r-block permutation factor circulant matrix has been demonstrated, that is AB=BA. The calculation method of matrix determinant and the sufficient condition of nonsingular matrix based on the diagonalization of circulant matrices are given. Finally, the method of inverse matrix is given in r-blo...
A nonsupersymmetric matrix orbifold
Banks, T; Banks, Tom; Motl, Lubos
2000-01-01
We construct the matrix description for a twisted version of the IIA string theory on S^1 with fermions antiperiodic around a spatial circle. The result is a 2+1-dimensional U(N) x U(N) nonsupersymmetric Yang-Mills theory with fermionic matter transforming in the (N,Nbar). The two U(N)'s are exchanged if one goes around a twisted circle of the worldvolume. Relations with Type 0 theories are explored and we find Type 0 matrix string limits of our gauge theory. We argue however that most of these results are falsified by the absence of SUSY nonrenormalization theorems and that the models do not in fact have a sensible Lorentz invariant space time interpretation.
Full text: In order to obtain meaningful analytical information from an X-Ray Fluorescence spectrometer, it is necessary to correlate measured intensity values with sample concentrations. The ability to do this to a desired level of precision depends on taking care of a number of variables which influence measured intensity values. These variables include: the sample, which needs to be homogeneous, flat and critically thick to the analyte lines used for measurement; the spectrometer, which needs to perform any mechanical movements in a highly reproducible manner; the time taken to measure an analyte line, and the software, which needs to take care of detector dead-time, the contribution of background to the measured signal, the effects of line overlaps and matrix (absorption and enhancement) effects. This presentation will address commonly used correction procedures for matrix effects and their relative success in achieving their objective. Copyright (2002) Australian X-ray Analytical Association Inc
Qian, Weixian; Zhou, Xiaojun; Lu, Yingcheng; Xu, Jiang
2015-09-15
Both the Jones and Mueller matrices encounter difficulties when physically modeling mixed materials or rough surfaces due to the complexity of light-matter interactions. To address these issues, we derived a matrix called the paths correlation matrix (PCM), which is a probabilistic mixture of Jones matrices of every light propagation path. Because PCM is related to actual light propagation paths, it is well suited for physical modeling. Experiments were performed, and the reflection PCM of a mixture of polypropylene and graphite was measured. The PCM of the mixed sample was accurately decomposed into pure polypropylene's single reflection, pure graphite's single reflection, and depolarization caused by multiple reflections, which is consistent with the theoretical derivation. Reflection parameters of rough surface can be calculated from PCM decomposition, and the results fit well with the theoretical calculations provided by the Fresnel equations. These theoretical and experimental analyses verify that PCM is an efficient way to physically model light-matter interactions. PMID:26371930
Extended Matrix Variate Hypergeometric Functions and Matrix Variate Distributions
Daya K. Nagar; Raúl Alejandro Morán-Vásquez; Gupta, Arjun K.
2015-01-01
Hypergeometric functions of matrix arguments occur frequently in multivariate statistical analysis. In this paper, we define and study extended forms of Gauss and confluent hypergeometric functions of matrix arguments and show that they occur naturally in statistical distribution theory.
BRENNER, BARBARA; Bodo B. Schlegelmilch; Ambos, Björn
2013-01-01
This case describes how Nike, a consumer goods company with an ever expanding portfolio and a tremendous brand value, manages the tradeoff between local responsiveness and global integration. In particular, the case highlights Nike's organizational structure that consists of a global matrix organization that is replicated at a regional level for the European market. While this organizational structure allows Nike to respond to local consumer tastes it also ensures that the company benefits f...
Infinite matrix products and the representation the gamma matrix function
J.-C. Cortés; Jódar, L.; Francisco J. Solís; Roberto Ku-Carrillo
2015-01-01
We introduce infinite matrix products including some of their main properties and convergence results. We apply them in order to extend to the matrix scenario the definition of the scalar gamma function given by an infinite product due to Weierstrass. A limit representation of the matrix gamma function is also provided.
Matrix Completions and Chordal Graphs
Kenneth John HARRISON
2003-01-01
In a matrix-completion problem the aim is to specifiy the missing entries of a matrix inorder to produce a matrix with particular properties. In this paper we survey results concerning matrix-completion problems where we look for completions of various types for partial matrices supported ona given pattern. We see that thc existence of completions of the required type often depends on thechordal properties of graphs associated with the pattern.
The cellulose resource matrix.
Keijsers, Edwin R P; Yılmaz, Gülden; van Dam, Jan E G
2013-03-01
The emerging biobased economy is causing shifts from mineral fossil oil based resources towards renewable resources. Because of market mechanisms, current and new industries utilising renewable commodities, will attempt to secure their supply of resources. Cellulose is among these commodities, where large scale competition can be expected and already is observed for the traditional industries such as the paper industry. Cellulose and lignocellulosic raw materials (like wood and non-wood fibre crops) are being utilised in many industrial sectors. Due to the initiated transition towards biobased economy, these raw materials are intensively investigated also for new applications such as 2nd generation biofuels and 'green' chemicals and materials production (Clark, 2007; Lange, 2007; Petrus & Noordermeer, 2006; Ragauskas et al., 2006; Regalbuto, 2009). As lignocellulosic raw materials are available in variable quantities and qualities, unnecessary competition can be avoided via the choice of suitable raw materials for a target application. For example, utilisation of cellulose as carbohydrate source for ethanol production (Kabir Kazi et al., 2010) avoids the discussed competition with easier digestible carbohydrates (sugars, starch) deprived from the food supply chain. Also for cellulose use as a biopolymer several different competing markets can be distinguished. It is clear that these applications and markets will be influenced by large volume shifts. The world will have to reckon with the increase of competition and feedstock shortage (land use/biodiversity) (van Dam, de Klerk-Engels, Struik, & Rabbinge, 2005). It is of interest - in the context of sustainable development of the bioeconomy - to categorize the already available and emerging lignocellulosic resources in a matrix structure. When composing such "cellulose resource matrix" attention should be given to the quality aspects as well as to the available quantities and practical possibilities of processing the
Eisenman, Richard L
2005-01-01
This outstanding text and reference applies matrix ideas to vector methods, using physical ideas to illustrate and motivate mathematical concepts but employing a mathematical continuity of development rather than a physical approach. The author, who taught at the U.S. Air Force Academy, dispenses with the artificial barrier between vectors and matrices--and more generally, between pure and applied mathematics.Motivated examples introduce each idea, with interpretations of physical, algebraic, and geometric contexts, in addition to generalizations to theorems that reflect the essential structur
Investigating Boolean Matrix Factorization
Snášel, V.; Platoš, J.; Krömer, P.; Húsek, Dušan; Neruda, Roman; Frolov, A. A.
- : ACM, 2008 - (Ding, C.; Li, T.; Zhu, S.), s. 18-25 ISBN 978-1-60558-307-5. [DMMT'08. Workshop in Conjunction with SIGKDD 2008 /14./. Las Vegas (US), 24.08.2008-24.08.2008] Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean factor analysis * nonnegative matrix factorization * neural networks * information retrieval * data mining * binary data Subject RIV: BB - Applied Statistics, Operational Research http://users.cs.fiu.edu/~taoli/kdd08-workshop/DMMT08-Proceedings.pdf
Matrix string partition function
Kostov, Ivan K; Kostov, Ivan K.; Vanhove, Pierre
1998-01-01
We evaluate quasiclassically the Ramond partition function of Euclidean D=10 U(N) super Yang-Mills theory reduced to a two-dimensional torus. The result can be interpreted in terms of free strings wrapping the space-time torus, as expected from the point of view of Matrix string theory. We demonstrate that, when extrapolated to the ultraviolet limit (small area of the torus), the quasiclassical expressions reproduce exactly the recently obtained expression for the partition of the completely reduced SYM theory, including the overall numerical factor. This is an evidence that our quasiclassical calculation might be exact.
Matrix algebra for linear models
Gruber, Marvin H J
2013-01-01
Matrix methods have evolved from a tool for expressing statistical problems to an indispensable part of the development, understanding, and use of various types of complex statistical analyses. This evolution has made matrix methods a vital part of statistical education. Traditionally, matrix methods are taught in courses on everything from regression analysis to stochastic processes, thus creating a fractured view of the topic. Matrix Algebra for Linear Models offers readers a unique, unified view of matrix analysis theory (where and when necessary), methods, and their applications. Written f
Hierarchical Matrix Techniques on Massively Parallel Computers
Izadi, Mohammad
2012-01-01
Hierarchical matrix (H-matrix) techniques can be used to efficiently treat dense matrices. With an H-matrix, the storage requirements and performing all fundamental operations, namely matrix-vector multiplication, matrix-matrix multiplication and matrix inversion can be done in almost linear complexity. In this work, we tried to gain even further speedup for the H-matrix arithmetic by utilizing multiple processors. Our approach towards an H-matrix distribution relies on the s...
Characterization of supercapacitors matrix
This paper treats supercapacitors matrix characterization. In order to cut off transient power peaks and to compensate for the intrinsic limitations in embedded sources, the use of supercapacitors as a storage system is quite suitable, because of their appropriate electrical characteristics (huge capacitance, small series resistance, high specific energy, high specific power), direct storage (energy ready for use), and easy control by power electronic conversion. This use requires supercapacitors modules where several cells connected in serial and/or in parallel, thus a bypass system to balance the charging or the discharging of supercapacitors is required. In the matrix of supercapacitors, six elements of three parallel BCAP0350 supercapacitors in serial connections have been considered. This topology permits to reduce the number of the bypass circuits and it can work in degraded mode. Actually, it allows the system to have more reliability by providing power continually to the load even when there are one or more cells failed. Simulation and experimental results are presented and discussed.
Ceramic matrix and resin matrix composites - A comparison
Hurwitz, Frances I.
1987-01-01
The underlying theory of continuous fiber reinforcement of ceramic matrix and resin matrix composites, their fabrication, microstructure, physical and mechanical properties are contrasted. The growing use of organometallic polymers as precursors to ceramic matrices is discussed as a means of providing low temperature processing capability without the fiber degradation encountered with more conventional ceramic processing techniques. Examples of ceramic matrix composites derived from particulate-filled, high char yield polymers and silsesquioxane precursors are provided.
Ceramic matrix and resin matrix composites: A comparison
Hurwitz, Frances I.
1987-01-01
The underlying theory of continuous fiber reinforcement of ceramic matrix and resin matrix composites, their fabrication, microstructure, physical and mechanical properties are contrasted. The growing use of organometallic polymers as precursors to ceramic matrices is discussed as a means of providing low temperature processing capability without the fiber degradation encountered with more conventional ceramic processing techniques. Examples of ceramic matrix composites derived from particulate-filled, high char yield polymers and silsesquioxane precursors are provided.
Hastings, Matthew B [Los Alamos National Laboratory
2009-01-01
We show how to combine the light-cone and matrix product algorithms to simulate quantum systems far from equilibrium for long times. For the case of the XXZ spin chain at {Delta} = 0.5, we simulate to a time of {approx} 22.5. While part of the long simulation time is due to the use of the light-cone method, we also describe a modification of the infinite time-evolving bond decimation algorithm with improved numerical stability, and we describe how to incorporate symmetry into this algorithm. While statistical sampling error means that we are not yet able to make a definite statement, the behavior of the simulation at long times indicates the appearance of either 'revivals' in the order parameter as predicted by Hastings and Levitov (e-print arXiv:0806.4283) or of a distinct shoulder in the decay of the order parameter.
Jørnø, Rasmus Leth Vergmann; Gynther, Karsten; Christensen, Ove
2014-01-01
useful information, we question whether the axis of time and space comprising the matrix pertains to relevant defining properties of the tools, technology or learning environments to which they are applied. Subsequently we offer an example of an Adobe Connect e-learning session as an illustration of a...... an appropriate unit of analysis and that categories of such practices can be established by an axis of articulation work and an axis of the codification needed to express and coordinate knowledge and work efforts. Keywords: E-learning; distance education; synchronous; distributed; assemblages...... different approach to learning situations based on the idea that tools, technology and learning environments are media through which participants simultaneously acquire proficiency to articulate and gain a perspective in order to decode what is going on. To effectively interact online, we contend that both...
Hyaluronan: A Matrix Component
Rügheimer, Louise
2008-09-01
The glucosaminoglycan hyaluronan is a key component of the extracellular matrix. It is a large, negatively charged molecule that can act as an ion exchange reservoir for positive ions. Hyaluronan is involved in renomedullary water handling through its water-binding capacity. In the renal medulla, the main source for hyaluronan production is the renomedullary interstitial cells. Hyaluronan synthases are found in the inner part of the plasma membrane and polymerize hyaluronan chains which are extruded into the extracellular space. Hyaluronidases are a family of enzymes involved in the degradation of hyaluronan. They have a wide range of properties, including differences in size, inhibitor sensitivities, catalytic mechanisms, substrate specificities and pH optima.
The light-like linear dilaton background represents a particularly simple time-dependent 1/2 BPS solution of critical type-IIA superstring theory in ten dimensions. Its lift to M-theory, as well as its Einstein frame metric, are singular in the sense that the geometry is geodesically incomplete and the Riemann tensor diverges along a light-like subspace of codimension one. We study this background as a model for a big bang type singularity in string theory/M-theory. We construct the dual Matrix theory description in terms of a (1+1)-d supersymmetric Yang-Mills theory on a time-dependent world-sheet given by the Milne orbifold of (1+1)-d Minkowski space. Our model provides a framework in which the physics of the singularity appears to be under control
Craps, B; Verlinde, E; Craps, Ben; Sethi, Savdeep; Verlinde, Erik
2005-01-01
The light-like linear dilaton background represents a particularly simple time-dependent 1/2 BPS solution of critical type IIA superstring theory in ten dimensions. Its lift to M-theory, as well as its Einstein frame metric, are singular in the sense that the geometry is geodesically incomplete and the Riemann tensor diverges along a light-like subspace of codimension one. We study this background as a model for a big bang type singularity in string theory/M-theory. We construct the dual Matrix theory description in terms of a (1+1)-d supersymmetric Yang-Mills theory on a time-dependent world-sheet given by the Milne orbifold of (1+1)-d Minkowski space. Our model provides a framework in which the physics of the singularity appears to be under control.
Matrix Quantization of Turbulence
Floratos, Emmanuel
2011-01-01
Based on our recent work on Quantum Nambu Mechanics $\\cite{af2}$, we provide an explicit quantization of the Lorenz chaotic attractor through the introduction of Non-commutative phase space coordinates as Hermitian $ N \\times N $ matrices in $ R^{3}$. For the volume preserving part, they satisfy the commutation relations induced by one of the two Nambu Hamiltonians, the second one generating a unique time evolution. Dissipation is incorporated quantum mechanically in a self-consistent way having the correct classical limit without the introduction of external degrees of freedom. Due to its volume phase space contraction it violates the quantum commutation relations. We demonstrate that the Heisenberg-Nambu evolution equations for the Matrix Lorenz system develop fast decoherence to N independent Lorenz attractors. On the other hand there is a weak dissipation regime, where the quantum mechanical properties of the volume preserving non-dissipative sector survive for long times.
Dorey, Nick; Turner, Carl
2016-01-01
We study a U(N) gauged matrix quantum mechanics which, in the large N limit, is closely related to the chiral WZW conformal field theory. This manifests itself in two ways. First, we construct the left-moving Kac-Moody algebra from matrix degrees of freedom. Secondly, we compute the partition function of the matrix model in terms of Schur and Kostka polynomials and show that, in the large $N$ limit, it coincides with the partition function of the WZW model. This same matrix model was recently shown to describe non-Abelian quantum Hall states and the relationship to the WZW model can be understood in this framework.
Dorey, Nick; Tong, David; Turner, Carl
2016-08-01
We study a U( N) gauged matrix quantum mechanics which, in the large N limit, is closely related to the chiral WZW conformal field theory. This manifests itself in two ways. First, we construct the left-moving Kac-Moody algebra from matrix degrees of freedom. Secondly, we compute the partition function of the matrix model in terms of Schur and Kostka polynomials and show that, in the large N limit, it coincides with the partition function of the WZW model. This same matrix model was recently shown to describe non-Abelian quantum Hall states and the relationship to the WZW model can be understood in this framework.
Document available in extended abstract form only. In many countries, it is planned that the long life highly radioactive nuclear spent fuel will be stored in deep argillaceous rocks. The sites selected for this purpose are anoxic and satisfy several recommendations as mechanical stability, low permeability and low redox potential. Pyrite (FeS2), iron(II) carbonate, iron(II) bearing clays and organic matter that are present in very small amounts (about 1% w:w) in soils play a major role in their reactivity and are considered today as responsible for the low redox potential values of these sites. In this communication, we describe an electrochemical technique derived from 'Salt matrix voltammetry' and allowing the almost in-situ voltammetric characterization of air-sensitive samples of soils after the only addition of the minimum humidity required for electrolytic conduction. Figure 1 shows the principle of the developed technique. It consists in the entrapment of the clay sample between a graphite working electrode and a silver counter/quasi-reference electrode. The sample was previously humidified by passing a water saturated inert gas through the electrochemical cell. The technique leads to well-defined voltammetric responses of the electro-active components of the clays. Figure 2 shows a typical voltammogram relative to a Callovo-Oxfordian argillite sample from Bure, the French place planned for the underground nuclear waste disposal. During the direct scan, one can clearly distinguish the anodic voltammetric signals for the oxidation of the iron (II) species associated with the clay and the oxidation of pyrite. The reverse scan displays a small cathodic signal for the reduction of iron (III) associated with the clay that demonstrates that the majority of the previously oxidized iron (II) species were transformed into iron (III) oxides reducible at lower potentials. When a second voltammetric cycle is performed, one can notice that the signal for iron (II
Chan, Garnet Kin-Lic; Nakatani, Naoki; Li, Zhendong; White, Steven R
2016-01-01
Current descriptions of the ab initio DMRG algorithm use two superficially different languages: an older language of the renormalization group and renormalized operators, and a more recent language of matrix product states and matrix product operators. The same algorithm can appear dramatically different when written in the two different vocabularies. In this work, we carefully describe the translation between the two languages in several contexts. First, we describe how to efficiently implement the ab-initio DMRG sweep using a matrix product operator based code, and the equivalence to the original renormalized operator implementation. Next we describe how to implement the general matrix product operator/matrix product state algebra within a pure renormalized operator-based DMRG code. Finally, we discuss two improvements of the ab initio DMRG sweep algorithm motivated by matrix product operator language: Hamiltonian compression, and a sum over operators representation that allows for perfect computational par...
Ceramic matrix composite article and process of fabricating a ceramic matrix composite article
Cairo, Ronald Robert; DiMascio, Paul Stephen; Parolini, Jason Robert
2016-01-12
A ceramic matrix composite article and a process of fabricating a ceramic matrix composite are disclosed. The ceramic matrix composite article includes a matrix distribution pattern formed by a manifold and ceramic matrix composite plies laid up on the matrix distribution pattern, includes the manifold, or a combination thereof. The manifold includes one or more matrix distribution channels operably connected to a delivery interface, the delivery interface configured for providing matrix material to one or more of the ceramic matrix composite plies. The process includes providing the manifold, forming the matrix distribution pattern by transporting the matrix material through the manifold, and contacting the ceramic matrix composite plies with the matrix material.
S. Breaz; Călugăreanu, G.; Danchev, P.; Micu, T.
2013-01-01
We characterize the nil clean matrix rings over fields. As a by product, it is proved that the full matrix rings with coefficients in commutative nil-clean rings are nil-clean, and we obtain a complete characterization of the finite rank Abelian groups with nil clean endomorphism ring and the Abelian groups with strongly nil clean endomorphism ring, respectively.
Jairam, Dharmananda; Kiewra, Kenneth A.; Kauffman, Douglas F.; Zhao, Ruomeng
2012-01-01
This study investigated how best to study a matrix. Fifty-three participants studied a matrix topically (1 column at a time), categorically (1 row at a time), or in a unified way (all at once). Results revealed that categorical and unified study produced higher: (a) performance on relationship and fact tests, (b) study material satisfaction, and…
Matrix Analysis of Tracer Transport
Mills, Peter
2015-01-01
We review matrix methods as applied to tracer transport. Because tracer transport is linear, matrix methods are an ideal fit for the problem. In particular, solutions of linear, first-order systems of ordinary differential equations (ODEs) are reviewed as well as special properties of these solutions. Detailed derivations are included
Machining of Metal Matrix Composites
2012-01-01
Machining of Metal Matrix Composites provides the fundamentals and recent advances in the study of machining of metal matrix composites (MMCs). Each chapter is written by an international expert in this important field of research. Machining of Metal Matrix Composites gives the reader information on machining of MMCs with a special emphasis on aluminium matrix composites. Chapter 1 provides the mechanics and modelling of chip formation for traditional machining processes. Chapter 2 is dedicated to surface integrity when machining MMCs. Chapter 3 describes the machinability aspects of MMCs. Chapter 4 contains information on traditional machining processes and Chapter 5 is dedicated to the grinding of MMCs. Chapter 6 describes the dry cutting of MMCs with SiC particulate reinforcement. Finally, Chapter 7 is dedicated to computational methods and optimization in the machining of MMCs. Machining of Metal Matrix Composites can serve as a useful reference for academics, manufacturing and materials researchers, manu...
Multivariate Matrix-Exponential Distributions
Bladt, Mogens; Nielsen, Bo Friis
2010-01-01
In this article we consider the distributions of non-negative random vectors with a joint rational Laplace transform, i.e., a fraction between two multi-dimensional polynomials. These distributions are in the univariate case known as matrix-exponential distributions, since their densities can be...... written as linear combinations of the elements in the exponential of a matrix. For this reason we shall refer to multivariate distributions with rational Laplace transform as multivariate matrix-exponential distributions (MVME). The marginal distributions of an MVME are univariate matrix......-exponential distributions. We prove a characterization that states that a distribution is an MVME distribution if and only if all non-negative, non-null linear combinations of the coordinates have a univariate matrix-exponential distribution. This theorem is analog to a well-known characterization theorem for the...
Matrix ALPS: Accelerated Low Rank and Sparse Matrix Reconstruction
Kyrillidis, Anastasios
2012-01-01
We propose Matrix ALPS for recovering a sparse plus low-rank decomposition of a matrix given its corrupted and incomplete linear measurements. Our approach is a first-order projected gradient method over non-convex sets, and it exploits a well-known memory-based acceleration technique. We theoretically characterize the convergence properties of Matrix ALPS using the stable embedding properties of the linear measurement operator. We then numerically illustrate that our algorithm outperforms the existing convex as well as non-convex state-of-the-art algorithms in computational efficiency without sacrificing stability.
Oehlmann, Dietmar; Ohlmann, Odile M.; Danzebrink, Hans U.
2005-04-01
perform this exchange, as a matrix, understood as source, of new ideas.
Containment Code Validation Matrix
The Committee on the Safety of Nuclear Installations (CSNI) formed the CCVM (Containment Code Validation Matrix) task group in 2002. The objective of this group was to define a basic set of available experiments for code validation, covering the range of containment (ex-vessel) phenomena expected in the course of light and heavy water reactor design basis accidents and beyond design basis accidents/severe accidents. It was to consider phenomena relevant to pressurised heavy water reactor (PHWR), pressurised water reactor (PWR) and boiling water reactor (BWR) designs of Western origin as well as of Eastern European VVER types. This work would complement the two existing CSNI validation matrices for thermal hydraulic code validation (NEA/CSNI/R(1993)14) and In-vessel core degradation (NEA/CSNI/R(2001)21). The report initially provides a brief overview of the main features of a PWR, BWR, CANDU and VVER reactors. It also provides an overview of the ex-vessel corium retention (core catcher). It then provides a general overview of the accident progression for light water and heavy water reactors. The main focus is to capture most of the phenomena and safety systems employed in these reactor types and to highlight the differences. This CCVM contains a description of 127 phenomena, broken down into 6 categories: - Containment Thermal-hydraulics Phenomena; - Hydrogen Behaviour (Combustion, Mitigation and Generation) Phenomena; - Aerosol and Fission Product Behaviour Phenomena; - Iodine Chemistry Phenomena; - Core Melt Distribution and Behaviour in Containment Phenomena; - Systems Phenomena. A synopsis is provided for each phenomenon, including a description, references for further information, significance for DBA and SA/BDBA and a list of experiments that may be used for code validation. The report identified 213 experiments, broken down into the same six categories (as done for the phenomena). An experiment synopsis is provided for each test. Along with a test description
Manufacturing Titanium Metal Matrix Composites by Consolidating Matrix Coated Fibres
Hua-Xin PENG
2005-01-01
Titanium metal matrix composites (TiMMCs) reinforced by continuous silicon carbide fibres are being developed for aerospace applications. TiMMCs manufactured by the consolidation of matrix-coated fibre (MCF) method offer optimum properties because of the resulting uniform fibre distribution, minimum fibre damage and fibre volume fraction control. In this paper, the consolidation of Ti-6Al-4V matrix-coated SiC fibres during vacuum hot pressing has been investigated. Experiments were carried out on multi-ply MCFs under vacuum hot pressing (VHP). In contrast to most of existing studies, the fibre arrangement has been carefully controlled either in square or hexagonal arraysthroughout the consolidated sample. This has enabled the dynamic consolidation behaviour of MCFs to be demonstrated by eliminating the fibre re-arrangement during the VHP process. The microstructural evolution of the matrix coating was reported and the deformation mechanisms involved were discussed.
Measuring methods of matrix diffusion
In Finland the spent nuclear fuel is planned to be disposed of at large depths in crystalline bedrock. The radionuclides which are dissolved in the groundwater may be able to diffuse into the micropores of the porous rock matrix and thus be withdrawn from the flowing water in the fractures. This phenomenon is called matrix diffusion. A review over matrix diffusion is presented in the study. The main interest is directed to the diffusion of non-sorbing species. The review covers diffusion experiments and measurements of porosity, pore size, specific surface area and water permeability
We show how to represent a class of expressions involving discrete sums over partitions as matrix models. We apply this technique to the partition functions of 2* theories, i.e. Seiberg-Witten theories with the massive hypermultiplet in the adjoint representation. We consider theories in four, five, and six dimensions, and obtain new matrix models, respectively, of rational, trigonometric, and elliptic type. The matrix models for five- and six-dimensional U(1) theories are derived from the topological vertex construction related to curves of genus one and two.
Canonical density matrix perturbation theory.
Niklasson, Anders M N; Cawkwell, M J; Rubensson, Emanuel H; Rudberg, Elias
2015-12-01
Density matrix perturbation theory [Niklasson and Challacombe, Phys. Rev. Lett. 92, 193001 (2004)] is generalized to canonical (NVT) free-energy ensembles in tight-binding, Hartree-Fock, or Kohn-Sham density-functional theory. The canonical density matrix perturbation theory can be used to calculate temperature-dependent response properties from the coupled perturbed self-consistent field equations as in density-functional perturbation theory. The method is well suited to take advantage of sparse matrix algebra to achieve linear scaling complexity in the computational cost as a function of system size for sufficiently large nonmetallic materials and metals at high temperatures. PMID:26764847
Chan, Garnet Kin-Lic; Keselman, Anna; Nakatani, Naoki; Li, Zhendong; White, Steven R
2016-07-01
Current descriptions of the ab initio density matrix renormalization group (DMRG) algorithm use two superficially different languages: an older language of the renormalization group and renormalized operators, and a more recent language of matrix product states and matrix product operators. The same algorithm can appear dramatically different when written in the two different vocabularies. In this work, we carefully describe the translation between the two languages in several contexts. First, we describe how to efficiently implement the ab initio DMRG sweep using a matrix product operator based code, and the equivalence to the original renormalized operator implementation. Next we describe how to implement the general matrix product operator/matrix product state algebra within a pure renormalized operator-based DMRG code. Finally, we discuss two improvements of the ab initio DMRG sweep algorithm motivated by matrix product operator language: Hamiltonian compression, and a sum over operators representation that allows for perfect computational parallelism. The connections and correspondences described here serve to link the future developments with the past and are important in the efficient implementation of continuing advances in ab initio DMRG and related algorithms. PMID:27394094
Chan, Garnet Kin-Lic; Keselman, Anna; Nakatani, Naoki; Li, Zhendong; White, Steven R.
2016-07-01
Current descriptions of the ab initio density matrix renormalization group (DMRG) algorithm use two superficially different languages: an older language of the renormalization group and renormalized operators, and a more recent language of matrix product states and matrix product operators. The same algorithm can appear dramatically different when written in the two different vocabularies. In this work, we carefully describe the translation between the two languages in several contexts. First, we describe how to efficiently implement the ab initio DMRG sweep using a matrix product operator based code, and the equivalence to the original renormalized operator implementation. Next we describe how to implement the general matrix product operator/matrix product state algebra within a pure renormalized operator-based DMRG code. Finally, we discuss two improvements of the ab initio DMRG sweep algorithm motivated by matrix product operator language: Hamiltonian compression, and a sum over operators representation that allows for perfect computational parallelism. The connections and correspondences described here serve to link the future developments with the past and are important in the efficient implementation of continuing advances in ab initio DMRG and related algorithms.
Bilateral matrix-exponential distributions
Bladt, Mogens; Esparza, Luz Judith R; Nielsen, Bo Friis
2012-01-01
In this article we define the classes of bilateral and multivariate bilateral matrix-exponential distributions. These distributions have support on the entire real space and have rational moment-generating functions. These distributions extend the class of bilateral phasetype distributions of [1......] and the class of multivariate matrix-exponential distributions of [9]. We prove a characterization theorem stating that a random variable has a bilateral multivariate distribution if and only if all linear combinations of the coordinates have a univariate bilateral matrix-exponential distribution. As...... an application we demonstrate that certain multivariate disions, which are governed by the underlying Markov jump process generating a phasetype distribution, have a bilateral matrix-exponential distribution at the time of absorption, see also [4]....
National Oceanic and Atmospheric Administration, Department of Commerce — This data set was taken from CRD 08-18 at the NEFSC. Specifically, the Gulf of Maine diet matrix was developed for the EMAX exercise described in that center...
Matrix Quantum Mechanics from Qubits
Hartnoll, Sean A; Mazenc, Edward A
2016-01-01
We introduce a transverse field Ising model with order N^2 spins interacting via a nonlocal quartic interaction. The model has an O(N,Z), hyperoctahedral, symmetry. We show that the large N partition function admits a saddle point in which the symmetry is enhanced to O(N). We further demonstrate that this `matrix saddle' correctly computes large N observables at weak and strong coupling. The matrix saddle undergoes a continuous quantum phase transition at intermediate couplings. At the transition the matrix eigenvalue distribution becomes disconnected. The critical excitations are described by large N matrix quantum mechanics. At the critical point, the low energy excitations are waves propagating in an emergent 1+1 dimensional spacetime.
The reciprocal super Catalan matrix
Prodinger Helmut
2015-01-01
The reciprocal super Catalan matrix has entries . Explicit formulæ for its LU-decomposition, the LU-decomposition of its inverse, and some related matrices are obtained. For all results, q-analogues are also presented.
An Aggregation Matrix MATLAB Function
Caleb Stair
2013-01-01
This Technical Document describes the foundations for an aggregation matrix function implemented in MATLAB, including the format and structure of the required aggregation vector used as an argument to the function. The function is passed with the N-dimensional aggregation vector as an argument. The aggregation vector contains N values ranging from 1 to M, each of which is the aggregate index corresponding to the N pre-aggregation indices. The function returns an aggregation matrix with M rows...
Matrix analysis of electrical machinery
Hancock, N N
2013-01-01
Matrix Analysis of Electrical Machinery, Second Edition is a 14-chapter edition that covers the systematic analysis of electrical machinery performance. This edition discusses the principles of various mathematical operations and their application to electrical machinery performance calculations. The introductory chapters deal with the matrix representation of algebraic equations and their application to static electrical networks. The following chapters describe the fundamentals of different transformers and rotating machines and present torque analysis in terms of the currents based on the p
Zambrzycka, Anna; Piotrowski, Edward W.
2007-08-01
In this paper we give definitions of matrix rates of return which do not depend on the choice of basis describing baskets. We give their economic interpretation. The matrix rate of return describes baskets of arbitrary type and extends portfolio analysis to the complex variable domain. This allows us for simultaneous analysis of evolution of baskets parameterized by complex variables in both continuous and discrete time models.
Zambrzycka, A; Zambrzycka, Anna; Piotrowski, Edward W.
2006-01-01
In this paper we give definitions of matrix rates of return which do not depend on the choice of basis describing baskets. We give their economic interpretation. The matrix rate of return describes baskets of arbitrary type and extends portfolio analysis to the complex variable domain. This allows us for simultaneous analysis of evolution of baskets parameterized by complex variables in both continuous and discrete time models.
Hyaluronan-Dependent Pericellular Matrix
Evanko, Stephen P.; Tammi, Markku I; Tammi, Raija H.; Wight, Thomas N.
2007-01-01
Hyaluronan is a multifunctional glycosaminoglycan that forms the structural basis of the pericellular matrix. Hyaluronan is extruded directly through the plasma membrane by one of three hyaluronan synthases and anchored to the cell surface by the synthase or cell surface receptors such as CD44 or RHAMM. Aggregating proteoglycans and other hyaluronan-binding proteins, contribute to the material and biological properties of the matrix and regulate cell and tissue function. The pericellular matr...
Flows for rectangular matrix models
Lafrance, Rene; Myers, Robert C.
1993-01-01
Several new results on the multicritical behavior of rectangular matrix models are presented. We calculate the free energy in the saddle point approximation, and show that at the triple-scaling point, the result is the same as that derived from the recursion formulae. In the triple-scaling limit, we obtain the string equation and a flow equation for arbitrary multicritical points. Parametric solutions are also examined for the limit of almost-square matrix models. This limit is shown to provi...
Staggered chiral random matrix theory
We present a random matrix theory for the staggered lattice QCD Dirac operator. The staggered random matrix theory is equivalent to the zero-momentum limit of the staggered chiral Lagrangian and includes all taste breaking terms at their leading order. This is an extension of previous work which only included some of the taste breaking terms. We will also present some results for the taste breaking contributions to the partition function and the Dirac eigenvalues.
Thermoplastic Matrix Composites from Towpregs
Silva, João; Nunes, João; Bernardo, C. A.; Marques, António
2011-01-01
In recent years, continuous fibre reinforced thermoplastic matrix composites have been successfully employed in the aircraft, military and aerospace industries due to the excellent properties (Brandt et al. 1993 & Nunes et al 2005a). In these and many other commercial engineering applications, they can replace other materials, such as thermosetting matrix composites. However, the high cost of the impregnation of continuous fibre thermoplastic composites, arising from the meltin...
Corrosion of ceramic matrix composites
Scanu, T. (ONERA-OM, 92 Chatillon (France) LASIR, CNRS, 94 Thiais (France)); Colomban, P. (ONERA-OM, 92 Chatillon (France) LASIR, CNRS, 94 Thiais (France))
1993-11-01
Air stable ceramic matrix composites are promising for thermostructural applications such as aircraft engine parts. Turbine parts are subject to both sulphuric acid and sodium molten salts corrosion due to sulphate traces in engine fuel and to the NaCl air content. The chemical stability is a very important criterion but this point has not received much attention to date. We report here a study of acidic and sodium corrosion of various aluminosilicate matrices : LAS matrices (Li[sub 2]OAl[sub 2]O[sub 3]2-6SiO[sub 2],nP[sub 2]O[sub 5]) in the amorphous, [beta] eucryptite and [beta] spodumene forms, BAS matrix (BaOAl[sub 2]O[sub 3]2SiO[sub 2]) in the form of monoclinic and hexagonal celsian, NASICON matrix (Na[sub 3]Zr[sub 2]Si[sub 2]PO[sub 12]) and mullite matrix. Microstructure damages and ion exchange have been analysed by X-ray diffraction, IR absorption, scanning electron microscopy and Raman microprobe. Drastic corrosion is observed for [beta] spodumene containing composites with the formation of strong hydrogen bond or with the cell expansion due to Li/Na[sup +] exchange. Medium acidic attack occurs for glassy LAS, [beta] eucryptite, BAS and NASICON matrix composites. On the other hand, [beta] eucryptite, NASICON and monoclinic celsian resist to alkaline melts. Mullite matrix composites are never corroded. (orig.).
Corrosion of ceramic matrix composites
Air stable ceramic matrix composites are promising for thermostructural applications such as aircraft engine parts. Turbine parts are subject to both sulphuric acid and sodium molten salts corrosion due to sulphate traces in engine fuel and to the NaCl air content. The chemical stability is a very important criterion but this point has not received much attention to date. We report here a study of acidic and sodium corrosion of various aluminosilicate matrices : LAS matrices (Li2OAl2O32-6SiO2,nP2O5) in the amorphous, β eucryptite and β spodumene forms, BAS matrix (BaOAl2O32SiO2) in the form of monoclinic and hexagonal celsian, NASICON matrix (Na3Zr2Si2PO12) and mullite matrix. Microstructure damages and ion exchange have been analysed by X-ray diffraction, IR absorption, scanning electron microscopy and Raman microprobe. Drastic corrosion is observed for β spodumene containing composites with the formation of strong hydrogen bond or with the cell expansion due to Li/Na+ exchange. Medium acidic attack occurs for glassy LAS, β eucryptite, BAS and NASICON matrix composites. On the other hand, β eucryptite, NASICON and monoclinic celsian resist to alkaline melts. Mullite matrix composites are never corroded. (orig.)
Grassi, Alba
2014-01-01
Some matrix models admit, on top of the usual 't Hooft expansion, an M-theory-like expansion, i.e. an expansion at large N but where the rest of the parameters are fixed, instead of scaling with N. These models, which we call M-theoretic matrix models, appear in the localization of Chern-Simons-matter theories, and also in two-dimensional statistical physics. Generically, their partition function receives non-perturbative corrections which are not captured by the 't Hooft expansion. In this paper, we discuss general aspects of these type of matrix integrals and we analyze in detail two different examples. The first one is the matrix model computing the partition function of N=4 supersymmetric Yang-Mills theory in three dimensions with one adjoint hypermultiplet and N_f fundamentals, which has a conjectured M-theory dual, and which we call the N_f matrix model. The second one, which we call the polymer matrix model, computes form factors of the 2d Ising model and is related to the physics of 2d polymers. In bo...
SVD row or column symmetric matrix
无
2000-01-01
A new architecture for row or column symmetric matrix called extended matrix is defined, and a precise correspondence of the singular values and singular vectors between the extended matrix and its original (namely, the mother matrix) is derived. As an illustration of potential, we show that, for a class of extended matrices, the singular value decomposition using the mother matrix rather than the extended matrix per se can save the CPU time and memory without loss of numerical precision.
The Astrobiology Matrix and the "Drake Matrix" in Education
Mizser, A.; Kereszturi, A.
2003-01-01
We organized astrobiology lectures in the Eotvos Lorand University of Sciences and the Polaris Observatory in 2002. We present here the "Drake matrix" for the comparison of the astrobiological potential of different bodies [1], and astrobiology matrix for the visualization of the interdisciplinary connections between different fields of astrobiology. Conclusion: In Hungary it is difficult to integrate astrobiology in the education system but the great advantage is that it can connect different scientific fields and improve the view of students. We would like to get in contact with persons and organizations who already have experience in the education of astrobiology.
A survey of matrix theory and matrix inequalities
Marcus, Marvin
2010-01-01
Written for advanced undergraduate students, this highly regarded book presents an enormous amount of information in a concise and accessible format. Beginning with the assumption that the reader has never seen a matrix before, the authors go on to provide a survey of a substantial part of the field, including many areas of modern research interest.Part One of the book covers not only the standard ideas of matrix theory, but ones, as the authors state, ""that reflect our own prejudices,"" among them Kronecker products, compound and induced matrices, quadratic relations, permanents, incidence
Matrix factorizations and elliptic fibrations
Omer, Harun
2016-09-01
I use matrix factorizations to describe branes at simple singularities of elliptic fibrations. Each node of the corresponding Dynkin diagrams of the ADE-type singularities is associated with one indecomposable matrix factorization which can be deformed into one or more factorizations of lower rank. Branes with internal fluxes arise naturally as bound states of the indecomposable factorizations. Describing branes in such a way avoids the need to resolve singularities. This paper looks at gauge group breaking from E8 fibers down to SU (5) fibers due to the relevance of such fibrations for local F-theory GUT models. A purpose of this paper is to understand how the deformations of the singularity are understood in terms of its matrix factorizations. By systematically factorizing the elliptic fiber equation, this paper discusses geometries which are relevant for building semi-realistic local models. In the process it becomes evident that breaking patterns which are identical at the level of the Kodaira type of the fibers can be inequivalent at the level of matrix factorizations. Therefore the matrix factorization picture supplements information which the conventional less detailed descriptions lack.
Octonionic matrix representation and electromagnetism
Chanyal, B. C. [Kumaun University, S. S. J. Campus, Almora (India)
2014-12-15
Keeping in mind the important role of octonion algebra, we have obtained the electromagnetic field equations of dyons with an octonionic 8 x 8 matrix representation. In this paper, we consider the eight - dimensional octonionic space as a combination of two (external and internal) four-dimensional spaces for the existence of magnetic monopoles (dyons) in a higher-dimensional formalism. As such, we describe the octonion wave equations in terms of eight components from the 8 x 8 matrix representation. The octonion forms of the generalized potential, fields and current source of dyons in terms of 8 x 8 matrix are discussed in a consistent manner. Thus, we have obtained the generalized Dirac-Maxwell equations of dyons from an 8x8 matrix representation of the octonion wave equations in a compact and consistent manner. The generalized Dirac-Maxwell equations are fully symmetric Maxwell equations and allow for the possibility of magnetic charges and currents, analogous to electric charges and currents. Accordingly, we have obtained the octonionic Dirac wave equations in an external field from the matrix representation of the octonion-valued potentials of dyons.
Matrix factorizations and elliptic fibrations
Harun Omer
2016-09-01
Full Text Available I use matrix factorizations to describe branes at simple singularities of elliptic fibrations. Each node of the corresponding Dynkin diagrams of the ADE-type singularities is associated with one indecomposable matrix factorization which can be deformed into one or more factorizations of lower rank. Branes with internal fluxes arise naturally as bound states of the indecomposable factorizations. Describing branes in such a way avoids the need to resolve singularities. This paper looks at gauge group breaking from E8 fibers down to SU(5 fibers due to the relevance of such fibrations for local F-theory GUT models. A purpose of this paper is to understand how the deformations of the singularity are understood in terms of its matrix factorizations. By systematically factorizing the elliptic fiber equation, this paper discusses geometries which are relevant for building semi-realistic local models. In the process it becomes evident that breaking patterns which are identical at the level of the Kodaira type of the fibers can be inequivalent at the level of matrix factorizations. Therefore the matrix factorization picture supplements information which the conventional less detailed descriptions lack.
For almost thirty years, sequential R-matrix computation has been used by atomic physics research groups, from around the world, to model collision phenomena involving the scattering of electrons or positrons with atomic or molecular targets. As considerable progress has been made in the understanding of fundamental scattering processes, new data, obtained from more complex calculations, is of current interest to experimentalists. Performing such calculations, however, places considerable demands on the computational resources to be provided by the target machine, in terms of both processor speed and memory requirement. Indeed, in some instances the computational requirements are so great that the proposed R-matrix calculations are intractable, even when utilising contemporary classic supercomputers. Historically, increases in the computational requirements of R-matrix computation were accommodated by porting the problem codes to a more powerful classic supercomputer. Although this approach has been successful in the past, it is no longer considered to be a satisfactory solution due to the limitations of current (and future) Von Neumann machines. As a consequence, there has been considerable interest in the high performance multicomputers, that have emerged over the last decade which appear to offer the computational resources required by contemporary R-matrix research. Unfortunately, developing codes for these machines is not as simple a task as it was to develop codes for successive classic supercomputers. The difficulty arises from the considerable differences in the computing models that exist between the two types of machine and results in the programming of multicomputers to be widely acknowledged as a difficult, time consuming and error-prone task. Nevertheless, unless parallel R-matrix computation is realised, important theoretical and experimental atomic physics research will continue to be hindered. This thesis describes work that was undertaken in
Raju, Suvrat
2009-06-01
As a simple example of how recently developed on-shell techniques apply to nonlocal theories, we study the S-matrix of noncommutative gauge theories. In the complex plane, this S-matrix has essential singularities that signal the nonlocal behavior of the theory. In spite of this, we show that tree-level amplitudes may be obtained by BCFW type recursion relations. At one loop we find a complete basis of master integrals (this basis is larger than the corresponding basis in the ordinary theory). Any one-loop noncommutative amplitude may be written as a linear combination of these integrals with coefficients that we relate to products of tree amplitudes. We show that the noncommutative Script N = 4 SYM theory has a structurally simple S-matrix, just like the ordinary Script N = 4 SYM theory.
Extracellular matrix in ovarian follicles.
Rodgers, R J; Irving-Rodgers, H F; van Wezel, I L
2000-05-25
A lot is known about the control of the development of ovarian follicles by growth factors and hormones, but less is known about the roles of extracellular matrix in the control of follicular growth and development. In this review we focus on the specialized extracellular matrix of the basal laminas that are present in ovarian follicles. These include the follicular basal lamina itself, the Call-Exner bodies of the membrana granulosa, the subendothelial and arteriole smooth muscle basal laminas in the theca, and the basal lamina-like material of the thecal matrix. We discuss the evidence that during follicle development the follicular basal lamina changes in composition, that many of its components are produced by the granulosa cells, and that the follicular basal laminas of different follicles have different ultrastructural appearances, linked to the shape of the aligning granulosa cells. All these studies suggest that the follicular basal lamina is extremely dynamic during follicular development. PMID:10963877
Matrix model approach to cosmology
Chaney, A.; Lu, Lei; Stern, A.
2016-03-01
We perform a systematic search for rotationally invariant cosmological solutions to toy matrix models. These models correspond to the bosonic sector of Lorentzian Ishibashi, Kawai, Kitazawa and Tsuchiya (IKKT)-type matrix models in dimensions d less than ten, specifically d =3 and d =5 . After taking a continuum (or commutative) limit they yield d -1 dimensional Poisson manifolds. The manifolds have a Lorentzian induced metric which can be associated with closed, open, or static space-times. For d =3 , we obtain recursion relations from which it is possible to generate rotationally invariant matrix solutions which yield open universes in the continuum limit. Specific examples of matrix solutions have also been found which are associated with closed and static two-dimensional space-times in the continuum limit. The solutions provide for a resolution of cosmological singularities, at least within the context of the toy matrix models. The commutative limit reveals other desirable features, such as a solution describing a smooth transition from an initial inflation to a noninflationary era. Many of the d =3 solutions have analogues in higher dimensions. The case of d =5 , in particular, has the potential for yielding realistic four-dimensional cosmologies in the continuum limit. We find four-dimensional de Sitter d S4 or anti-de Sitter AdS4 solutions when a totally antisymmetric term is included in the matrix action. A nontrivial Poisson structure is attached to these manifolds which represents the lowest order effect of noncommutativity. For the case of AdS4 , we find one particular limit where the lowest order noncommutativity vanishes at the boundary, but not in the interior.
Supersymmetry in random matrix theory
I study the applications of supersymmetry in random matrix theory. I generalize the supersymmetry method and develop three new approaches to calculate eigenvalue correlation functions. These correlation functions are averages over ratios of characteristic polynomials. In the first part of this thesis, I derive a relation between integrals over anti-commuting variables (Grassmann variables) and differential operators with respect to commuting variables. With this relation I rederive Cauchy- like integral theorems. As a new application I trace the supermatrix Bessel function back to a product of two ordinary matrix Bessel functions. In the second part, I apply the generalized Hubbard-Stratonovich transformation to arbitrary rotation invariant ensembles of real symmetric and Hermitian self-dual matrices. This extends the approach for unitarily rotation invariant matrix ensembles. For the k-point correlation functions I derive supersymmetric integral expressions in a unifying way. I prove the equivalence between the generalized Hubbard-Stratonovich transformation and the superbosonization formula. Moreover, I develop an alternative mapping from ordinary space to superspace. After comparing the results of this approach with the other two supersymmetry methods, I obtain explicit functional expressions for the probability densities in superspace. If the probability density of the matrix ensemble factorizes, then the generating functions exhibit determinantal and Pfaffian structures. For some matrix ensembles this was already shown with help of other approaches. I show that these structures appear by a purely algebraic manipulation. In this new approach I use structures naturally appearing in superspace. I derive determinantal and Pfaffian structures for three types of integrals without actually mapping onto superspace. These three types of integrals are quite general and, thus, they are applicable to a broad class of matrix ensembles. (orig.)
Supersymmetry in random matrix theory
Kieburg, Mario
2010-05-04
I study the applications of supersymmetry in random matrix theory. I generalize the supersymmetry method and develop three new approaches to calculate eigenvalue correlation functions. These correlation functions are averages over ratios of characteristic polynomials. In the first part of this thesis, I derive a relation between integrals over anti-commuting variables (Grassmann variables) and differential operators with respect to commuting variables. With this relation I rederive Cauchy- like integral theorems. As a new application I trace the supermatrix Bessel function back to a product of two ordinary matrix Bessel functions. In the second part, I apply the generalized Hubbard-Stratonovich transformation to arbitrary rotation invariant ensembles of real symmetric and Hermitian self-dual matrices. This extends the approach for unitarily rotation invariant matrix ensembles. For the k-point correlation functions I derive supersymmetric integral expressions in a unifying way. I prove the equivalence between the generalized Hubbard-Stratonovich transformation and the superbosonization formula. Moreover, I develop an alternative mapping from ordinary space to superspace. After comparing the results of this approach with the other two supersymmetry methods, I obtain explicit functional expressions for the probability densities in superspace. If the probability density of the matrix ensemble factorizes, then the generating functions exhibit determinantal and Pfaffian structures. For some matrix ensembles this was already shown with help of other approaches. I show that these structures appear by a purely algebraic manipulation. In this new approach I use structures naturally appearing in superspace. I derive determinantal and Pfaffian structures for three types of integrals without actually mapping onto superspace. These three types of integrals are quite general and, thus, they are applicable to a broad class of matrix ensembles. (orig.)
Polychoric/Tetrachoric Matrix or Pearson Matrix? A methodological study
Dominguez Lara, Sergio Alexis
2014-04-01
Full Text Available The use of product-moment correlation of Pearson is common in most studies in factor analysis in psychology, but it is known that this statistic is only applicable when the variables related are in interval scale and normally distributed, and when are used in ordinal data may to produce a distorted correlation matrix . Thus is a suitable option using polychoric/tetrachoric matrices in item-level factor analysis when the items are in level measurement nominal or ordinal. The aim of this study was to show the differences in the KMO, Bartlett`s Test and Determinant of the Matrix, percentage of variance explained and factor loadings in depression trait scale of Depression Inventory Trait - State and the Neuroticism dimension of the short form of the Eysenck Personality Questionnaire -Revised, regarding the use of matrices polychoric/tetrachoric matrices and Pearson. These instruments was analyzed with different extraction methods (Maximum Likelihood, Minimum Rank Factor Analysis, Unweighted Least Squares and Principal Components, keeping constant the rotation method Promin were analyzed. Were observed differences regarding sample adequacy measures, as well as with respect to the explained variance and the factor loadings, for solutions having as polychoric/tetrachoric matrix. So it can be concluded that the polychoric / tetrachoric matrix give better results than Pearson matrices when it comes to item-level factor analysis using different methods.
Matrix methods applied linear algebra
Bronson, Richard
2008-01-01
Matrix Methods: Applied Linear Algebra, 3e, as a textbook, provides a unique and comprehensive balance between the theory and computation of matrices. The application of matrices is not just for mathematicians. The use by other disciplines has grown dramatically over the years in response to the rapid changes in technology. Matrix methods is the essence of linear algebra and is what is used to help physical scientists; chemists, physicists, engineers, statisticians, and economists solve real world problems.* Applications like Markov chains, graph theory and Leontief Models are placed i
Towards Google matrix of brain
We apply the approach of the Google matrix, used in computer science and World Wide Web, to description of properties of neuronal networks. The Google matrix G is constructed on the basis of neuronal network of a brain model discussed in PNAS 105 (2008) 3593. We show that the spectrum of eigenvalues of G has a gapless structure with long living relaxation modes. The PageRank of the network becomes delocalized for certain values of the Google damping factor α. The properties of other eigenstates are also analyzed. We discuss further parallels and similarities between the World Wide Web and neuronal networks.
Venturini Method Based Matrix Converter
Derick Mathew
2015-03-01
Full Text Available Recently, matrix converter has received considerable interest as a viable alternative to the conventional ac-dc-ac converter. This direct ac-ac converter provides some attractive characteristics such as: four quadrant operation, absence of bulky dc-link electrolyte capacitors, clean input power characteristics. Due to the absence of dc link energy storage elements any disturbance in the input voltage will be immediately reflected to the output voltages. In this paper venturini method for matrix converter has been presented. Three phase sinusoidal symmetrical voltage or current can obtained .
Inverse Interval Matrix: A Survey
Rohn, Jiří; Farhadsefat, R.
2011-01-01
Roč. 22, - (2011), s. 704-719. E-ISSN 1081-3810 R&D Projects: GA ČR GA201/09/1957; GA ČR GC201/08/J020 Institutional research plan: CEZ:AV0Z10300504 Keywords : interval matrix * inverse interval matrix * NP-hardness * enclosure * unit midpoint * inverse sign stability * nonnegative invertibility * absolute value equation * algorithm Subject RIV: BA - General Math ematics Impact factor: 0.808, year: 2010 http://www. math .technion.ac.il/iic/ela/ela-articles/articles/vol22_pp704-719.pdf
Towards Google matrix of brain
Shepelyansky, D. L.; Zhirov, O. V.
2010-01-01
We apply the approach of the Google matrix, used in computer science and World Wide Web, to description of properties of neuronal networks. The Google matrix ${\\bf G}$ is constructed on the basis of neuronal network of a brain model discussed in PNAS {\\bf 105}, 3593 (2008). We show that the spectrum of eigenvalues of ${\\bf G}$ has a gapless structure with long living relaxation modes. The PageRank of the network becomes delocalized for certain values of the Google damping factor $\\alpha$. The...
Staggered weak matrix element miscellany
I report on work, done with Rajan Gupta and Greg Kilcup, using staggered fermions to study weak matrix elements in quenched QCD. I give an update on the ΔI = 1/2 rule on matrix elements relevant for ε'. I show results of a study of the dependence of BK on non-leading terms in the chiral expansion. I present our results for BK from quenched calculation at β = 6.4 on 323 x 48 lattices, based on ensemble of 12 configurations. 15 refs., 5 figs
Holomorphic anomaly and matrix models
Eynard, B; Orantin, Nicolas; Eynard, Bertrand; Marino, Marcos; Orantin, Nicolas
2007-01-01
The genus g free energies of matrix models can be promoted to modular invariant, non-holomorphic amplitudes which only depend on the geometry of the classical spectral curve. We show that these non-holomorphic amplitudes satisfy the holomorphic anomaly equations of Bershadsky, Cecotti, Ooguri and Vafa. We derive as well holomorphic anomaly equations for the open string sector. These results provide evidence at all genera for the Dijkgraaf--Vafa conjecture relating matrix models to type B topological strings on certain local Calabi--Yau threefolds.
Steerneman, A.G.M.; van Perlo -ten Kleij, Frederieke
2005-01-01
The main topic of this paper is the matrix V = A - XY*, where A is a nonsingular complex k x k matrix and X and Y are k x p complex matrices of full column rank. Because properties of the matrix V can be derived from those of the matrix Q = I - XY*, we will consider in particular the case where A =
Symmetries and Interactions in Matrix String Theory
F.H. Hacquebord
1999-01-01
This PhD-thesis reviews matrix string theory and recent developments therein. The emphasis is put on symmetries, interactions and scattering processes in the matrix model. We start with an introduction to matrix string theory and a review of the orbifold model that flows out of matrix string theory
The symmetric N-matrix completion problem
Araújo, C. Mendes; Juan R. Torregrosa; Urbano, Ana M.
2005-01-01
An $n\\times n$ matrix is called an $N$-matrix if all its principal minors are negative. In this paper, we are interested in the symmetric $N$-matrix completion problem, that is, when a partial symmetric $N$-matrix has a symmetric $N$-matrix completion. Here, we prove that a partial symmetric $N$-matrix has a symmetric $N$-matrix completion if the graph of its specified entries is chordal. Furthermore, if this graph is not chordal, then examples exist without symmetric $N$...
Sign Patterns That Allow the Given Matrix
邵燕灵; 孙良
2003-01-01
Let P be a property referring to a real matrix. For a sign pattern A, if there exists a real matrix B in the qualitative class of A such that B has property P, then we say A allows P. Three cases that A allows an M-matrix, an inverse M-matrix and a P0-matrix are considered. The complete characterizations are obtained.
Multivariate Modelling via Matrix Subordination
Nicolato, Elisa
stochastic volatility via time-change is quite ineffective when applied to the multivariate setting. In this work we propose a new class of models, which is obtained by conditioning a multivariate Brownian Motion to a so-called matrix subordinator. The obtained model-class encompasses the vast majority of...
MATRIX FORMULATION OF REAL QUATERNIONS
Jafari, Mehdi
2015-01-01
Real quaternions have been expressed in terms of 4×4 matrices by means of Hamilton operators. These matrices are applied for rotations in Euclidean 4-space, and are determined also a Hamilton motions in E4. We study these matrices and show that the set of these matrices with the group operation of matrix multiplication is Lie group of 6-dimension.
The T-matrix averaging procedure advocated by Burke, Berrington and Sukumar [1981, J. Phys. B. At. Mol. Phys. 14, 289] is demonstrated to hold in a class of soluble models for two different L2 basis expansions. The convergence rates as the bases are extended to completeness are determined. (author)
S matrix for absorptive Hamiltonians
The existence of a matrix S such that SS = 1 in the presence of absorption is demonstrated. In the limit a of hermitian Hamiltonian the unitarity conditions SS = 1 is recovered. A dispersion relation for forward scattering is derived and the properties of the reactance matrices K and K are obtained. It is shown that K = K
The COMPADRE Plant Matrix Database
2014-01-01
COMPADRE contains demographic information on hundreds of plant species. The data in COMPADRE are in the form of matrix population models and our goal is to make these publicly available to facilitate their use for research and teaching purposes. COMPADRE is an open-access database. We only request...
Rohn, Jiří
2013-01-01
Roč. 26, 15 December (2013), s. 836-841. ISSN 1537-9582 Institutional support: RVO:67985807 Keywords : two-matrix alternative * solution * algorithm Subject RIV: BA - General Math ematics Impact factor: 0.514, year: 2013 http://www. math .technion.ac.il/iic/ela/ela-articles/articles/vol26_pp836-841.pdf
Amorphous metal matrix composite ribbons
Composite ribbons with amorphous matrix and ceramic (SiC, WC, MoB) particles were produced by modified planar melt flow casting methods. Weldability, abrasive wear and wood sanding examinations were carried out in order to find optimal material and technology for elevated wear resistance and sanding durability. The correlation between structure and composite properties is discussed. (author)
Survey of aluminum matrix composites
This is a review of the current stage of development of fiber reinforced Al matrix composites: primary and secondary fabrication, physical and mechanical properties, environmental effects, applications, current and projected costs of raw material and composites, and future developments. Boron and beryllium are among the filament materials. (101 references, 32 fig.) (U.S.)
Kuhapatanakul, Kantaphon
2015-11-01
In this note, we study the Fibonacci and Lucas p-numbers. We introduce the Lucas p-matrix and companion matrices for the sums of the Fibonacci and Lucas p-numbers to derive some interesting identities of the Fibonacci and Lucas p-numbers.
Hyper-systolic matrix multiplication
Lippert, Th.; Petkov, N.; Palazzari, P.; Schilling, K.
2001-01-01
A novel parallel algorithm for matrix multiplication is presented. It is based on a 1-D hyper-systolic processor abstraction. The procedure can be implemented on all types of parallel systems. (C) 2001 Elsevier Science B,V. All rights reserved.
Parallel Sparse Matrix - Vector Product
Alexandersen, Joe; Lazarov, Boyan Stefanov; Dammann, Bernd
This technical report contains a case study of a sparse matrix-vector product routine, implemented for parallel execution on a compute cluster with both pure MPI and hybrid MPI-OpenMP solutions. C++ classes for sparse data types were developed and the report shows how these class can be used...
Matrix Representation of Evolving Networks
We present the distance matrix evolution for different types of networks:exponential, scale-free and classical random ones. Statistical properties of these matrices are discussed as well as topological features of the networks. Numerical data on the degree and distance distributions are compared with theoretical predictions. (author)
A DIRECT ALGORITHM FOR DISTINGUISHING NONSINGULAR M-MATRIX AND H-MATRIX
Li Yaotang; Zhu Yan
2005-01-01
A direct algorithm is proposed by which one can distinguish whether a matrix is an M-matrix (or H-matrix) or not quickly and effectively. Numerical examples show that it is effective and convincible to distinguish M-matrix (or H-matrix) by using the algorithm.
Some considerations of matrix equations using the concept of reproductivity
Malesevic, Branko; Radicic, Biljana
2011-01-01
In this paper we analyse Cline's matrix equation, generalized Penrose's matrix system and a matrix system for k-commutative {1}-inverses. We determine reproductive and non-reproductive general solutions of analysed matrix equation and analysed matrix systems.
The Constrained Solutions of Two Matrix Equations
An Ping LIAO; Zhong Zhi BAI
2002-01-01
We study the symmetric positive semidefinite solution of the matrix equation AX1AT +BX2BT = C, where A is a given real m × n matrix, B is a given real m × p matrix, and C is a givenreal m × m matrix, with m, n, p positive integers; and the bisymmetric positive semidefinite solutionof the matrix equation DTXD = C, where D is a given real n × m matrix, C is a given real m × mmatrix, with m, n positive integers. By making use of the generalized singular value decomposition, wederive general analytic formulae, and present necessary and sufficient conditions for guaranteeing theexistence of these solutions.
Matrix Factorization for Evolution Data
Xiao-Yu Huang
2014-01-01
Full Text Available We study a matrix factorization problem, that is, to find two factor matrices U and V such that R≈UT×V, where R is a matrix composed of the values of the objects O1,O2,…,On at consecutive time points T1,T2,…,Tt. We first present MAFED, a constrained optimization model for this problem, which straightforwardly performs factorization on R. Then based on the interplay of the data in U, V, and R, a probabilistic graphical model using the same optimization objects is constructed, in which structural dependencies of the data in these matrices are revealed. Finally, we present a fitting algorithm to solve the proposed MAFED model, which produces the desired factorization. Empirical studies on real-world datasets demonstrate that our approach outperforms the state-of-the-art comparison algorithms.
Clustering Assisted Fundamental Matrix Estimation
Hao Wu
2015-03-01
Full Text Available In computer vision, the estimation of the fundament al matrix is a basic problem that has been extensively studied. The accuracy of the estimation imposes a significant influence on subsequent tasks such as the camera trajectory dete rmination and 3D reconstruction. In this paper we propose a new method for fundamental matri x estimation that makes use of clustering a group of 4D vectors. The key insight is the obser vation that among the 4D vectors constructed from matching pairs of points obtained from the SIF T algorithm, well-defined cluster points tend to be reliable inliers suitable for fundamenta l matrix estimation. Based on this, we utilizes a recently proposed efficient clustering method thr ough density peaks seeking and propose a new clustering assisted method. Experimental resul ts show that the proposed algorithm is faster and more accurate than currently commonly us ed methods.
Scrambling with matrix black holes
Brady, Lucas; Sahakian, Vatche
2013-08-01
If black holes are not to be dreaded sinks of information but rather fully described by unitary evolution, they must scramble in-falling data and eventually leak it through Hawking radiation. Sekino and Susskind have conjectured that black holes are fast scramblers; they generate entanglement at a remarkably efficient rate, with the characteristic time scaling logarithmically with the entropy. In this work, we focus on Matrix theory—M-theory in the light-cone frame—and directly probe the conjecture. We develop a concrete test bed for quantum gravity using the fermionic variables of Matrix theory and show that the problem becomes that of chains of qubits with an intricate network of interactions. We demonstrate that the black hole system evolves much like a Brownian quantum circuit, with strong indications that it is indeed a fast scrambler. We also analyze the Berenstein-Maldacena-Nastase model and reach the same tentative conclusion.
Link Prediction via Matrix Completion
Pech, Ratha; Pan, Liming; Cheng, Hong; Zhou, Tao
2016-01-01
Inspired by practical importance of social networks, economic networks, biological networks and so on, studies on large and complex networks have attracted a surge of attentions in the recent years. Link prediction is a fundamental issue to understand the mechanisms by which new links are added to the networks. We introduce the method of robust principal component analysis (robust PCA) into link prediction, and estimate the missing entries of the adjacency matrix. On one hand, our algorithm is based on the sparsity and low rank property of the matrix, on the other hand, it also performs very well when the network is dense. This is because a relatively dense real network is also sparse in comparison to the complete graph. According to extensive experiments on real networks from disparate fields, when the target network is connected and sufficiently dense, whatever it is weighted or unweighted, our method is demonstrated to be very effective and with prediction accuracy being considerably improved comparing wit...
Distributed-memory matrix computations
Balle, Susanne Mølleskov
1995-01-01
algorithms is that many scientific applications rely heavily on the performance of the involved dense linear algebra building blocks. Even though we consider the distributed-memory as well as the shared-memory programming paradigm, the major part of the thesis is dedicated to distributed-memory architectures....... We emphasize distributed-memory massively parallel computers - such as the Connection Machines model CM-200 and model CM-5/CM-5E - available to us at UNI-C and at Thinking Machines Corporation. The CM-200 was at the time this project started one of the few existing massively parallel computers....... Several areas in the numerical linear algebra field are investigated and they illustrate the problems that arise as well as the techniques that are related to the use of massively parallel computers: 1.Study of Strassen's matrix-matrix multiplication on the Connection Machine model CM-200. What...
Corrosion of Titanium Matrix Composites
Covino, B.S., Jr.; Alman, D.E.
2002-09-22
The corrosion behavior of unalloyed Ti and titanium matrix composites containing up to 20 vol% of TiC or TiB{sub 2} was determined in deaerated 2 wt% HCl at 50, 70, and 90 degrees C. Corrosion rates were calculated from corrosion currents determined by extrapolation of the tafel slopes. All curves exhibited active-passive behavior but no transpassive region. Corrosion rates for Ti + TiC composites were similar to those for unalloyed Ti except at 90 degrees C where the composites were slightly higher. Corrosion rates for Ti + TiB{sub 2} composites were generally higher than those for unalloyed Ti and increased with higher concentrations of TiB{sub 2}. XRD and SEM-EDS analyses showed that the TiC reinforcement did not react with the Ti matrix during fabrication while the TiB{sub 2} reacted to form a TiB phase.
The Simplest Neutrino Mass Matrix
Harrison, P F
2004-01-01
We motivate the simplest ansatz for the neutrino mass matrix consistent with the data from neutrino oscillation experiments, and admitting CP violation. It has only two free parameters: an arbitrary mass-scale and a small dimensionless ratio. This mass matrix exhibits two symmetries, Democracy and Mutativity, which respectively ensure trimaximal mixing of the |nu_2> mass eigenstate, and mixing parameter values |theta_{23}|=45 degrees and |delta|=90 degrees, consistent with bimaximal mixing of the |nu_3> mass eigenstate. A third constraint relates the smallness of |U_{e3}|^2 to that of the mass-squared difference ratio, Delta m^2_sol/Delta m^2_atm, yielding the prediction sin(theta_{13})=sqrt{2 Delta m^2_sol/3 Delta m^2_atm} ~ 0.13 +- 0.03.
Matrix factorisations and permutation branes
The description of B-type D-branes on a tensor product of two N = 2 minimal models in terms of matrix factorisations is related to the boundary state description in conformal field theory. As an application we show that the D0- and D2-brane for a number of Gepner models are described by permutation boundary states. In some cases (including the quintic) the images of the D2-brane under the Gepner monodromy generate the full charge lattice
Matrix Factorizations and Kauffman Homology
Gukov, S; Gukov, Sergei; Walcher, Johannes
2005-01-01
The topological string interpretation of homological knot invariants has led to several insights into the structure of the theory in the case of sl(N). We study possible extensions of the matrix factorization approach to knot homology for other Lie groups and representations. In particular, we introduce a new triply graded theory categorifying the Kauffman polynomial, test it, and predict the Kauffman homology for several simple knots.
Knot theory and matrix integrals
Zinn-Justin, P
2010-01-01
The large size limit of matrix integrals with quartic potential may be used to count alternating links and tangles. The removal of redundancies amounts to renormalizations of the potential. This extends into two directions: higher genus and the counting of "virtual" links and tangles; and the counting of "coloured" alternating links and tangles. We discuss the asymptotic behavior of the number of tangles as the number of crossings goes to infinity.
A matrix weighted $T1$ theorem for matrix kernelled Calderon Zygmund operators - I
Isralowitz, Joshua; Kwon, Hyun Kyoung; Pott, Sandra
2014-01-01
In this series of two papers, we will prove a natural matrix weighted $T1$ theorem for matrix kernelled CZOs. In the current paper, we will prove matrix weighted norm inequalities for matrix symbolled paraproducts via a general matrix weighted Carleson embedding theorem. Along the way, we will also provide a stopping time proof of the identification of $L^p(W)$ as a weighted Triebel-Lizorkin space when $W$ is a matrix A${}_p$ weight.
Polychoric/Tetrachoric Matrix or Pearson Matrix? A methodological study
Dominguez Lara, Sergio Alexis
2014-01-01
The use of product-moment correlation of Pearson is common in most studies in factor analysis in psychology, but it is known that this statistic is only applicable when the variables related are in interval scale and normally distributed, and when are used in ordinal data may to produce a distorted correlation matrix . Thus is a suitable option using polychoric/tetrachoric matrices in item-level factor analysis when the items are in level measurement nominal or ordinal. The aim of this study ...
SINE TRANSFORM MATRIX FOR SOLVING TOEPLITZ MATRIX PROBLEMS
Li-zhi Cheng
2001-01-01
In recent papers, some authors studied the solutions of symmetricpositive definite(SPD) Toeplitz systems Tn x = b by the conjugate gradient method(CG) with different sine trans- forms based preconditioners. In this paper, we first discuss the properties of eigenvalues for the main known circulant, skew circulant and sine transform based preconditioners. A counter example shows that E.Boman's preconditioner is only positive semi-definite for the banded Toeplitz matrix. To use preconditioner effectively, then we propose a modified Boman's preconditioner and a new Cesaro sum type sine transform based preconditioner. Finally, the results of numerical experimentation with these two preconditioners are pre- sented.
Some Additive Combinatorics Problems in Matrix Rings
Ferguson, R.; Hoffman, C.; De Luca, F.; Ostafe, A; Shparlinski, I. E.
2009-01-01
We study the distribution of singular and unimodular matrices in sumsets in matrix rings over finite fields. We apply these results to estimate the largest prime divisor of the determinants in sumsets in matrix rings over the integers.
A New Proposal for Matrix Theory
Chaudhuri, S
2002-01-01
We give a detailed exposition of our recent proposal for Matrix Theory. Starting with the pedagogical case of bosonic matrix theory we identify a matrix Lagrangian whose large N limit coincides with the spacetime Lagrangian of an open and closed bosonic string theory. We describe the appearance of spacetime and of the basic elements of spacetime geometry in our framework. We identify the symmetry algebra governing the matrix Lagrangian at finite N and illustrate the phenomenon of matrix Dbrane democracy. The supersymmetric matrix Lagrangian is a nontrivial extension of the bosonic theory giving rise in the large N limit to the spacetime Lagrangians of supersymmetric open and closed string theories with Dbranes. We give a matrix path integral prescription for the Hartle-Hawking wavefunction of the Universe derived from Matrix Theory.
Matrix Theory on Non-Orientable Surfaces
Zwart, Gysbert
1997-01-01
We construct the Matrix theory descriptions of M-theory on the Mobius strip and the Klein bottle. In a limit, these provide the matrix string theories for the CHL string and an orbifold of type IIA string theory.
Cubic Matrix, Nambu Mechanics and Beyond
Kawamura, Yoshiharu
2002-01-01
We propose a generalization of cubic matrix mechanics by introducing a canonical triplet and study its relation to Nambu mechanics. The generalized cubic matrix mechanics we consider can be interpreted as a 'quantum' generalization of Nambu mechanics.
Orthogonal Matrix-Valued Wavelet Packets
Qingjiang Chen; Cuiling Wang; Zhengxing Cheng
2007-01-01
In this paper,we introduce matrix-valued multiresolution analysis and matrixvalued wavelet packets. A procedure for the construction of the orthogonal matrix-valued wavelet packets is presented. The properties of the matrix-valued wavelet packets are investigated. In particular,a new orthonormal basis of L2(R,Cs×s) is obtained from the matrix-valued wavelet packets.
Continued Fraction Algorithm for Matrix Exponentials
无
2001-01-01
A recursive rational algorithm for matrix exponentials was obtained by making use of the generalized inverse of a matrix in this paper. On the basis of the n-th convergence of Thiele-type continued fraction expansion, a new type of the generalized inverse matrix-valued Padé approximant (GMPA) for matrix exponentials was defined and its remainder formula was proved. The results of this paper were illustrated by some examples.
Bergman orthogonal polynomials and the Grunsky matrix
Beckermann, Bernhard; Stylianopoulos, Nikos
2016-01-01
By exploiting a link between Bergman orthogonal polynomials and the Grunsky matrix, probably first observed by Kühnau in 1985, we improve some recent results on strong asymptotics of Bergman polynomials outside the domain G of orthogonality, and on entries of the Bergman shift operator. In our proofs we suggest a new matrix approach involving the Grunsky matrix, and use well-established results in the literature relating properties of the Grunsky matrix to the regularity of the boundary of G,...
Traffic Matrix Reloaded: Impact of Routing Changes
Teixeira, Renata; Duffield, Nick; Rexford, Jennifer; Roughan, Matthew
2005-01-01
International audience A traffic matrix represents the load from each ingress point to each egress point in an IP network. Although networks are engineered to tolerate some variation in the traffic matrix, large changes can lead to congested links and poor performance. The variations in the traffic matrix are caused by statistical fluc-tuations in the traffic entering the network and shifts in where the traffic leaves the network. For an accurate view of how the traffic matrix evolves over...
The Theory of Quaternion Matrix Derivatives
Xu, Dongpo; Mandic, Danilo P.
2014-01-01
A systematic theory is introduced for calculating the derivatives of quaternion matrix function with respect to quaternion matrix variables. The proposed methodology is equipped with the matrix product rule and chain rule and it is able to handle both analytic and nonanalytic functions. This corrects a flaw in the existing methods, that is, the incorrect use of the traditional product rule. In the framework introduced, the derivatives of quaternion matrix functions can be calculated directly ...
Bayesian analysis of matrix data with rstiefel
Hoff, Peter D.
2013-01-01
We illustrate the use of the R-package "rstiefel" for matrix-variate data analysis in the context of two examples. The first example considers estimation of a reduced-rank mean matrix in the presence of normally distributed noise. The second example considers the modeling of a social network of friendships among teenagers. Bayesian estimation for these models requires the ability to simulate from the matrix-variate von Mises-Fisher distributions and the matrix-variate Bingham distributions on...
Ultrastructure of a hyaluronic acid matrix
Hadler, Nortin M.; Dourmashkin, Robert R; Nermut, Milan V.; Williams, Lynn D.
1982-01-01
Freeze-etch replicas of a hylauronic acid matrix were visualized by electron microscopy. In water a coarse branching fibrillar network of hyaluronic acid aggregates was seen. The high solvent permeability of this matrix suggests that the spaces observed are relatively devoid of unaggregated polymer. Addition of calcium disordered the matrix, resulting in a more dispersed felt of polymer.
An inversion algorithm for general tridiagonal matrix
Rui-sheng RAN; Ting-zhu HUANG; Xing-ping LIU; Tong-xiang GU
2009-01-01
An algorithm for the inverse of a general tridiagonal matrix is presented. For a tridiagonal matrix having the Doolittle factorization, an inversion algorithm is established.The algorithm is then generalized to deal with a general tridiagonal matrix without any restriction. Comparison with other methods is provided, indicating low computational complexity of the proposed algorithm, and its applicability to general tridiagonal matrices.
Matrix metalloproteinases: old dogs with new tricks
Somerville, Robert PT; Oblander, Samantha A; Apte, Suneel S.
2003-01-01
The matrix metalloproteinase family in humans comprises 23 enzymes, which are involved in many biological processes and diseases. It was previously thought that these enzymes acted only to degrade components of the extracellular matrix, but this view has changed with the discovery that non-extracellular-matrix molecules are also substrates.
Corrosion of ceramic matrix composites
Scanu, T.; Colomban, Ph.
1993-01-01
Air stable ceramic matrix composites are promising for thermostructural applications such as aircraft engine parts. Turbine parts are subject to both sulphuric acid and sodium molten salts corrosion due to sulphate traces in engine fuel and to the NaCl air content. The chemical stability is a very important criterion but this point has not received much attention to date. We report here a study of acidic and sodium corrosion of various aluminosilicate matrices : LAS matrices (Li2OAl2O32-6SiO2...
Random Matrix Theory and Econophysics
Rosenow, Bernd
2000-03-01
Random Matrix Theory (RMT) [1] is used in many branches of physics as a ``zero information hypothesis''. It describes generic behavior of different classes of systems, while deviations from its universal predictions allow to identify system specific properties. We use methods of RMT to analyze the cross-correlation matrix C of stock price changes [2] of the largest 1000 US companies. In addition to its scientific interest, the study of correlations between the returns of different stocks is also of practical relevance in quantifying the risk of a given stock portfolio. We find [3,4] that the statistics of most of the eigenvalues of the spectrum of C agree with the predictions of RMT, while there are deviations for some of the largest eigenvalues. We interpret these deviations as a system specific property, e.g. containing genuine information about correlations in the stock market. We demonstrate that C shares universal properties with the Gaussian orthogonal ensemble of random matrices. Furthermore, we analyze the eigenvectors of C through their inverse participation ratio and find eigenvectors with large ratios at both edges of the eigenvalue spectrum - a situation reminiscent of localization theory results. This work was done in collaboration with V. Plerou, P. Gopikrishnan, T. Guhr, L.A.N. Amaral, and H.E Stanley and is related to recent work of Laloux et al.. 1. T. Guhr, A. Müller Groeling, and H.A. Weidenmüller, ``Random Matrix Theories in Quantum Physics: Common Concepts'', Phys. Rep. 299, 190 (1998). 2. See, e.g. R.N. Mantegna and H.E. Stanley, Econophysics: Correlations and Complexity in Finance (Cambridge University Press, Cambridge, England, 1999). 3. V. Plerou, P. Gopikrishnan, B. Rosenow, L.A.N. Amaral, and H.E. Stanley, ``Universal and Nonuniversal Properties of Cross Correlations in Financial Time Series'', Phys. Rev. Lett. 83, 1471 (1999). 4. V. Plerou, P. Gopikrishnan, T. Guhr, B. Rosenow, L.A.N. Amaral, and H.E. Stanley, ``Random Matrix Theory
Teaching Tip: When a Matrix and Its Inverse Are Stochastic
Ding, J.; Rhee, N. H.
2013-01-01
A stochastic matrix is a square matrix with nonnegative entries and row sums 1. The simplest example is a permutation matrix, whose rows permute the rows of an identity matrix. A permutation matrix and its inverse are both stochastic. We prove the converse, that is, if a matrix and its inverse are both stochastic, then it is a permutation matrix.
Singular Value Decomposition for Unitary Symmetric Matrix
ZOUHongxing; WANGDianjun; DAIQionghai; LIYanda
2003-01-01
A special architecture called unitary sym-metric matrix which embodies orthogonal, Givens, House-holder, permutation, and row (or column) symmetric ma-trices as its special cases, is proposed, and a precise corre-spondence of singular values and singular vectors between the unitary symmetric matrix and its mother matrix is de-rived. As an illustration of potential, it is shown that, for a class of unitary symmetric matrices, the singular value decomposition (SVD) using the mother matrix rather than the unitary symmetric matrix per se can save dramatically the CPU time and memory without loss of any numerical precision.
The Theory of Quaternion Matrix Derivatives
Xu, Dongpo; Mandic, Danilo P.
2015-03-01
A systematic theory is introduced for calculating the derivatives of quaternion matrix function with respect to quaternion matrix variables. The proposed methodology is equipped with the matrix product rule and chain rule and it is able to handle both analytic and nonanalytic functions. This corrects a flaw in the existing methods, that is, the incorrect use of the traditional product rule. In the framework introduced, the derivatives of quaternion matrix functions can be calculated directly without the differential of this function. Key results are summarized in tables. Several examples show how the quaternion matrix derivatives can be used as an important tool for solving problems related to signal processing.
The q-Laguerre matrix polynomials.
Salem, Ahmed
2016-01-01
The Laguerre polynomials have been extended to Laguerre matrix polynomials by means of studying certain second-order matrix differential equation. In this paper, certain second-order matrix q-difference equation is investigated and solved. Its solution gives a generalized of the q-Laguerre polynomials in matrix variable. Four generating functions of this matrix polynomials are investigated. Two slightly different explicit forms are introduced. Three-term recurrence relation, Rodrigues-type formula and the q-orthogonality property are given. PMID:27190749
Fuzzy Symmetric Solutions of Fuzzy Matrix Equations
Xiaobin Guo; Dequan Shang
2012-01-01
The fuzzy symmetric solution of fuzzy matrix equation AX˜=B˜, in which A is a crisp m×m nonsingular matrix and B˜ is an m×n fuzzy numbers matrix with nonzero spreads, is investigated. The fuzzy matrix equation is converted to a fuzzy system of linear equations according to the Kronecker product of matrices. From solving the fuzzy linear system, three types of fuzzy symmetric solutions of the fuzzy matrix equation are derived. Finally, two examples are given to illustrate the proposed method....
Linear algebra and matrix analysis for statistics
Banerjee, Sudipto
2014-01-01
Matrices, Vectors, and Their OperationsBasic definitions and notations Matrix addition and scalar-matrix multiplication Matrix multiplication Partitioned matricesThe ""trace"" of a square matrix Some special matricesSystems of Linear EquationsIntroduction Gaussian elimination Gauss-Jordan elimination Elementary matrices Homogeneous linear systems The inverse of a matrixMore on Linear EquationsThe LU decompositionCrout's Algorithm LU decomposition with row interchanges The LDU and Cholesky factorizations Inverse of partitioned matrices The LDU decomposition for partitioned matricesThe Sherman-W
MatrixPlot: visualizing sequence constraints
Gorodkin, Jan; Stærfeldt, Hans Henrik; Lund, Ole;
1999-01-01
MatrixPlot: visualizing sequence constraints. Sub-title Abstract Summary : MatrixPlot is a program for making high-quality matrix plots, such as mutual information plots of sequence alignments and distance matrices of sequences with known three-dimensional coordinates. The user can add information...... about the sequences (e.g. a sequence logo profile) along the edges of the plot, as well as zoom in on any region in the plot. Availability : MatrixPlot can be obtained on request, and can also be accessed online at http://www. cbs.dtu.dk/services/MatrixPlot. Contact : gorodkin@cbs.dtu.dk...
Minimal solution for inconsistent singular fuzzy matrix equations
M. Nikuie; M. K. Mirnia
2013-01-01
The fuzzy matrix equations $Ailde{X}=ilde{Y}$ is called a singular fuzzy matrix equations while the coefficients matrix of its equivalent crisp matrix equations be a singular matrix. The singular fuzzy matrix equations are divided into two parts: consistent singular matrix equations and inconsistent fuzzy matrix equations. In this paper, the inconsistent singular fuzzy matrix equations is studied and the effect of generalized inverses in finding minimal solution of an inconsistent singular fu...
Colored graphs and matrix integrals
In this article we discuss two different asymptotic expansions of matrix integrals. The original approach using the so-called Feynman diagram techniques leads to sums over isomorphism classes of ribbon graphs. Asymptotic expansions of more general Gaussian integrals are sums over isomorphism classes of colored graphs without ribbon structure. Here we derive the former expansion from the latter one. This provides an independent proof for the expansion used by Kontsevich. It might be very interesting to compare the algebra arising in these two approaches. The asymptotic expansion using ribbon graphs leads to the tau function of the KDV hierarchy while the sums over colored graphs satisfy simple partial differential equations which generalize the Burgers equation. We describe the general approach using colored graphs in the second section. In the third section we specialize the results of the second section for the matrix integral. In this section we also derive the expansion over ribbon graphs. The proof is based on simple topological considerations which are contained in section 5. In the last section we give an explicit calculation of the first term of the expansion using colored graphs
Interpolation of rational matrix functions
Ball, Joseph A; Rodman, Leiba
1990-01-01
This book aims to present the theory of interpolation for rational matrix functions as a recently matured independent mathematical subject with its own problems, methods and applications. The authors decided to start working on this book during the regional CBMS conference in Lincoln, Nebraska organized by F. Gilfeather and D. Larson. The principal lecturer, J. William Helton, presented ten lectures on operator and systems theory and the interplay between them. The conference was very stimulating and helped us to decide that the time was ripe for a book on interpolation for matrix valued functions (both rational and non-rational). When the work started and the first partial draft of the book was ready it became clear that the topic is vast and that the rational case by itself with its applications is already enough material for an interesting book. In the process of writing the book, methods for the rational case were developed and refined. As a result we are now able to present the rational case as an indepe...
Sparse Matrix Inversion with Scaled Lasso
Sun, Tingni
2012-01-01
We propose a new method of learning a sparse nonnegative-definite target matrix. Our primary example of the target matrix is the inverse of a population covariance matrix or correlation matrix. The algorithm first estimates each column of the matrix by scaled Lasso, a joint estimation of regression coefficients and noise level, and then adjusts the matrix estimator to be symmetric. The procedure is efficient in the sense that the penalty level of the scaled Lasso for each column is completely determined by the data via convex minimization, without using cross-validation. We prove that this method guarantees the fastest proven rate of convergence in the spectrum norm under conditions of weaker form than those in the existing analyses of other $\\ell_1$ algorithms, and has faster guaranteed rate of convergence when the ratio of the $\\ell_1$ and spectrum norms of the target inverse matrix diverges to infinity. A simulation study also demonstrates the competitive performance of the proposed estimator.
A New Proposal for Matrix Theory
Chaudhuri, Shyamoli
2002-01-01
We explain the motivation and main ideas underlying our proposal for a Lagrangian for Matrix Theory based on sixteen supercharges. Starting with the pedagogical example of a bosonic matrix theory we describe the appearance of a continuum spacetime geometry from a discrete, and noncommutative, spacetime with both Lorentz and Yang-Mills invariances. We explain the appearance of large N ground states with Dbranes and elucidate the principle of matrix Dbrane democracy at finite N. Based on the un...
Cell mediated calcification and matrix vesicles
This publication on calcification and the sequence of events directed by the cell to facilitate this process contains the following topics: New Ultrastructural Techniques for Study of Calcification; Mechanisms of Matrix Vesicle Calcification; Role of Mitochondria, Matrix Proteins and Cytokines in Calcification; Role of Phospholipids and Membranes in Calcification; Biogenesis of Matrix Vesicles in Vivo and in Vitro; Calcification and Ossification in Vitro; Calcific Diseases and Abnormal Bone Mineralization. (Auth.)
Random matrix representations of critical statistics
Kravtsov, V. E.
2009-01-01
We consider two random matrix ensembles which are relevant for describing critical spectral statistics in systems with multifractal eigenfunction statistics. One of them is the Gaussian non-invariant ensemble which eigenfunction statistics is multifractal, while the other is the invariant random matrix ensemble with a shallow, log-square confinement potential. We demonstrate a close correspondence between the spectral as well as eigenfuncton statistics of these random matrix ensembles and tho...
k-Means Clustering Is Matrix Factorization
Bauckhage, Christian
2015-01-01
We show that the objective function of conventional k-means clustering can be expressed as the Frobenius norm of the difference of a data matrix and a low rank approximation of that data matrix. In short, we show that k-means clustering is a matrix factorization problem. These notes are meant as a reference and intended to provide a guided tour towards a result that is often mentioned but seldom made explicit in the literature.
A note on quantization of matrix models
Starodubtsev, Artem
2002-01-01
The issue of non-perturbative background independent quantization of matrix models is addressed. The analysis is carried out by considering a simple matrix model which is a matrix extension of ordinary mechanics reduced to 0 dimension. It is shown that this model has an ordinary mechanical system evolving in time as a classical solution. But in this treatment the action principle admits a natural modification which results in algebraic relations describing quantum theory. The origin of quanti...
Imposing causality on a matrix model
We introduce a new matrix model that describes Causal Dynamical Triangulations (CDT) in two dimensions. In order to do so, we introduce a new, simpler definition of 2D CDT and show it to be equivalent to the old one. The model makes use of ideas from dually weighted matrix models, combined with multi-matrix models, and can be studied by the method of character expansion.
Role of Matrix Vesicles in Biomineralization
Golub, Ellis E.
2009-01-01
Matrix vesicles have been implicated in the mineralization of calcified cartilage, bone and dentin for more than 40 years. During this period, their exact role, if any in the nucleation of hydroxyapatite mineral, and its subsequent association with the collagen fibrils in the organic matrix has been debated and remains controversial. Several hypotheses have been recently introduced to explain in greater detail how matrix vesicles function in biomineralization. This review will summarize recen...
Cassatella-Contra, Giovanni A
2011-01-01
In this paper matrix orthogonal polynomials in the real line are described in terms of a Riemann--Hilbert problem. This approach provides an easy derivation of discrete equations for the corresponding matrix recursion coefficients. The discrete equation is explicitly derived in the matrix Freud case, associated with matrix quartic potentials. It is shown that, when the initial condition and the measure are simultaneously triangularizable, this matrix discrete equation possesses the singularity confinement property, independently if the solution under consideration is given by recursion coefficients to quartic Freud matrix orthogonal polynomials or not.
Xu, Guo-Ming; Ni, Si-Dao
1998-11-01
The `auxiliary' symmetry properties of the system matrix (symmetry with respect to the trailing diagonal) for a general anisotropic dissipative medium and the special form for a monoclinic medium are revealed by rearranging the motion-stress vector. The propagator matrix of a single-layer general anisotropic dissipative medium is also shown to have auxiliary symmetry. For the multilayered case, a relatively simple matrix method is utilized to obtain the inverse of the propagator matrix. Further, Woodhouse's inverse of the propagator matrix for a transversely isotropic medium is extended in a clearer form to handle the monoclinic symmetric medium. The properties of a periodic layer system are studied through its system matrix Aly , which is computed from the propagator matrix P. The matrix Aly is then compared with Aeq , the system matrix for the long-wavelength equivalent medium of the periodic isotropic layers. Then we can find how the periodic layered medium departs from its long-wavelength equivalent medium when the wavelength decreases. In our numerical example, the results show that, when λ/D decreases to 6-8, the components of the two matrices will depart from each other. The component ratio of these two matrices increases to its maximum (more than 15 in our numerical test) when λ/D is reduced to 2.3, and then oscillates with λ/D when it is further reduced. The eigenvalues of the system matrix Aly show that the velocities of P and S waves decrease when λ/D is reduced from 6-8 and reach their minimum values when λ/D is reduced to 2.3 and then oscillate afterwards. We compute the time shifts between the peaks of the transmitted waves and the incident waves. The resulting velocity curves show a similar variation to those computed from the eigenvalues of the system matrix Aly , but on a smaller scale. This can be explained by the spectrum width of the incident waves.
Reactive Power Compensation using a Matrix Converter
Holtsmark, Nathalie Marie-Anna
2010-01-01
This Master's thesis investigates a new application for the matrix converter: Shunt reactive power compensation. The suggested Matrix Converter-based Reactive power Compensation (MCRC) device is composed of a matrix converter, which input is connected to the grid and an electric machine at the output of the converter. The reactive power flowing in or out of the grid can be regulated with the matrix converter by controlling the magnitude and/or phase angle of the current at the input of the co...
Shrinkage estimation with a matrix loss function
Abu-Shanab, Reman; Strawderman, William E
2011-01-01
Consider estimating the n by p matrix of means of an n by p matrix of independent normally distributed observations with constant variance, where the performance of an estimator is judged using a p by p matrix quadratic error loss function. A matrix version of the James-Stein estimator is proposed, depending on a tuning constant. It is shown to dominate the usual maximum likelihood estimator for some choices of of the tuning constant when n is greater than or equal to 3. This result also extends to other shrinkage estimators and settings.
Random Correlation Matrix and De-Noising
Ken-ichi Mitsui; Yoshio Tabata
2006-01-01
In Finance, the modeling of a correlation matrix is one of the important problems. In particular, the correlation matrix obtained from market data has the noise. Here we apply the de-noising processing based on the wavelet analysis to the noisy correlation matrix, which is generated by a parametric function with random parameters. First of all, we show that two properties, i.e. symmetry and ones of all diagonal elements, of the correlation matrix preserve via the de-noising processing and the...
Titanium Matrix Composite Pressure Vessel Project
National Aeronautics and Space Administration — For over 15 years, FMW Composite Systems has developed Metal Matrix Composite manufacturing methodologies for fabricating silicon-carbide-fiber-reinforced titanium...
Symmetries and interactions in matrix string theory
Hacquebord, F.H.
1999-01-01
This PhD-thesis reviews matrix string theory and recent developments therein. The emphasis is put on symmetries, interactions and scattering processes in the matrix model. We start with an introduction to matrix string theory and a review of the orbifold model that flows out of matrix string theory in the strong YM coupling limit. Then we turn our attention to the appearance of U-duality symmetry in gauge models, after a (very) short summary of string duality, D-branes and M-theory. The last ...
Basic matrix algebra and transistor circuits
Zelinger, G
1963-01-01
Basic Matrix Algebra and Transistor Circuits deals with mastering the techniques of matrix algebra for application in transistors. This book attempts to unify fundamental subjects, such as matrix algebra, four-terminal network theory, transistor equivalent circuits, and pertinent design matters. Part I of this book focuses on basic matrix algebra of four-terminal networks, with descriptions of the different systems of matrices. This part also discusses both simple and complex network configurations and their associated transmission. This discussion is followed by the alternative methods of de
New recursive algorithm for matrix inversion
Cao Jianshu; Wang Xuegang
2008-01-01
To reduce the computational complexity of matrix inversion, which is the majority of processing in many practical applications, two numerically efficient recursive algorithms (called algorithms Ⅰ and Ⅱ, respectively)are presented. Algorithm Ⅰ is used to calculate the inverse of such a matrix, whose leading principal minors are all nonzero. Algorithm Ⅱ, whereby, the inverse of an arbitrary nonsingular matrix can be evaluated is derived via improving the algorithm Ⅰ. The implementation, for algorithm Ⅱ or Ⅰ, involves matrix-vector multiplications and vector outer products. These operations are computationally fast and highly parallelizable. MATLAB simulations show that both recursive algorithms are valid.
Risk matrix model for rotating equipment
Wassan Rano Khan
2014-07-01
Full Text Available Different industries have various residual risk levels for their rotating equipment. Accordingly the occurrence rate of the failures and associated failure consequences categories are different. Thus, a generalized risk matrix model is developed in this study which can fit various available risk matrix standards. This generalized risk matrix will be helpful to develop new risk matrix, to fit the required risk assessment scenario for rotating equipment. Power generation system was taken as case study. It was observed that eight subsystems were under risk. Only vibration monitor system was under high risk category, while remaining seven subsystems were under serious and medium risk categories.
Zhong, Zai-Zhe
2004-01-01
The partial separability of multipartite qubit density matrixes is strictly defined. We give a reduction way from N-partite qubit density matrixes to bipartite qubit density matrixes, and prove a necessary condition that a N-partite qubit density matrix to be partially separable is its reduced density matrix to satisfy PPT condition.
Direct Model Checking Matrix Algorithm
Zhi-Hong Tao; Hans Kleine Büning; Li-Fu Wang
2006-01-01
During the last decade, Model Checking has proven its efficacy and power in circuit design, network protocol analysis and bug hunting. Recent research on automatic verification has shown that no single model-checking technique has the edge over all others in all application areas. So, it is very difficult to determine which technique is the most suitable for a given model. It is thus sensible to apply different techniques to the same model. However, this is a very tedious and time-consuming task, for each algorithm uses its own description language. Applying Model Checking in software design and verification has been proved very difficult. Software architectures (SA) are engineering artifacts that provide high-level and abstract descriptions of complex software systems. In this paper a Direct Model Checking (DMC) method based on Kripke Structure and Matrix Algorithm is provided. Combined and integrated with domain specific software architecture description languages (ADLs), DMC can be used for computing consistency and other critical properties.
Analysis Matrix for Smart Cities
Pablo E. Branchi
2014-01-01
Full Text Available The current digital revolution has ignited the evolution of communications grids and the development of new schemes for productive systems. Traditional technologic scenarios have been challenged, and Smart Cities have become the basis for urban competitiveness. The citizen is the one who has the power to set new scenarios, and that is why a definition of the way people interact with their cities is needed, as is commented in the first part of the article. At the same time, a lack of clarity has been detected in the way of describing what Smart Cities are, and the second part will try to set the basis for that. For all before, the information and communication technologies that manage and transform 21st century cities must be reviewed, analyzing their impact on new social behaviors that shape the spaces and means of communication, as is posed in the experimental section, setting the basis for an analysis matrix to score the different elements that affect a Smart City environment. So, as the better way to evaluate what a Smart City is, there is a need for a tool to score the different technologies on the basis of their usefulness and consequences, considering the impact of each application. For all of that, the final section describes the main objective of this article in practical scenarios, considering how the technologies are used by citizens, who must be the main concern of all urban development.
The Evolution of Extracellular Matrix
Özbek, Suat; Balasubramanian, Prakash G.; Chiquet-Ehrismann, Ruth; Tucker, Richard P.
2010-01-01
We present a perspective on the molecular evolution of the extracellular matrix (ECM) in metazoa that draws on research publications and data from sequenced genomes and expressed sequence tag libraries. ECM components do not function in isolation, and the biological ECM system or “adhesome” also depends on posttranslational processing enzymes, cell surface receptors, and extracellular proteases. We focus principally on the adhesome of internal tissues and discuss its origins at the dawn of the metazoa and the expansion of complexity that occurred in the chordate lineage. The analyses demonstrate very high conservation of a core adhesome that apparently evolved in a major wave of innovation in conjunction with the origin of metazoa. Integrin, CD36, and certain domains predate the metazoa, and some ECM-related proteins are identified in choanoflagellates as predicted sequences. Modern deuterostomes and vertebrates have many novelties and elaborations of ECM as a result of domain shuffling, domain innovations and gene family expansions. Knowledge of the evolution of metazoan ECM is important for understanding how it is built as a system, its roles in normal tissues and disease processes, and has relevance for tissue engineering, the development of artificial organs, and the goals of synthetic biology. PMID:21160071
Resonance parameters from K-matrix and T-matrix poles
Workman, R L
2008-01-01
We extract K-matrix poles from our fits to elastic pion-nucleon scattering and eta-nucleon production data in order to test a recently proposed method for the determination of resonance properties, based on the trace of the K-matrix. We have considered issues associated with the separation of background and resonance contributions, the correspondence between K-matrix and T-matrix poles, and the complicated behavior of eigenphases.
D-MATRIX: A web tool for constructing weight matrix of conserved DNA motifs
Sen, Naresh; Mishra, Manoj; Khan, Feroz; Meena, Abha; Sharma, Ashok
2009-01-01
Despite considerable efforts to date, DNA motif prediction in whole genome remains a challenge for researchers. Currently the genome wide motif prediction tools required either direct pattern sequence (for single motif) or weight matrix (for multiple motifs). Although there are known motif pattern databases and tools for genome level prediction but no tool for weight matrix construction. Considering this, we developed a D-MATRIX tool which predicts the different types of weight matrix based o...
Fast construction of hierarchical matrix representation from matrix-vector multiplication
Lin, Lin; Ying, Lexing
2010-01-01
We develop a hierarchical matrix construction algorithm using matrix-vector multiplications, based on the randomized singular value decomposition of low-rank matrices. The algorithm uses $\\mathcal{O}(\\log n)$ applications of the matrix on structured random test vectors and $\\mathcal{O}(n \\log n)$ extra computational cost, where $n$ is the dimension of the unknown matrix. Numerical examples on constructing Green's functions for elliptic operators in two dimensions show efficiency and accuracy of the proposed algorithm.
Matrix subordinators and related Upsilon transformations
Barndorff-Nielsen, Ole Eiler; Pérez-Abreu, V.
2008-01-01
A class of upsilon transformations of Lévy measures for matrix subordinators is introduced. Some regularizing properties of these transformations are derived, such as absolute continuity and complete monotonicity. The class of Lévy measures with completely monotone matrix densities is characterized...
Modeling and Simulation of Matrix Converter
Liu, Fu-rong; Klumpner, Christian; Blaabjerg, Frede
2005-01-01
This paper discusses the modeling and simulation of matrix converter. Two models of matrix converter are presented: one is based on indirect space vector modulation and the other is based on power balance equation. The basis of these two models is• given and the process on modeling is introduced in...
Transition matrix from a random walk
Schulman, Lawrence S
2016-01-01
Given a random walk a method is presented to produce a matrix of transition probabilities that is consistent with that random walk. The method is tested by using a transition matrix to produce a path and then using that path to create the estimate. The two matrices are then compared.
Permutation branes and linear matrix factorisations
All the known rational boundary states for Gepner models can be regarded as permutation branes. On general grounds, one expects that topological branes in Gepner models can be encoded as matrix factorisations of the corresponding Landau-Ginzburg potentials. In this paper we identify the matrix factorisations associated to arbitrary B-type permutation branes
On quasi-exactly solvable matrix models
Zhdanov, R S
1997-01-01
An efficient procedure for constructing quasi-exactly solvable matrix models is suggested. It is based on the fact that the representation spaces of representations of the algebra sl(2,R) within the class of first-order matrix differential operators contain finite dimensional invariant subspaces.
The Cartan Matrix of a Centralizer Algebra
Umesh V Dubey; Amritanshu Prasad; Pooja Singla
2012-02-01
The centralizer algebra of a matrix consists of those matrices that commute with it. We investigate the basic representation-theoretic invariants of centralizer algebras, namely their radicals, projective indecomposable modules, injective indecomposable modules, simple modules and Cartan matrices. With the help of our Cartan matrix calculations we determine their global dimensions. Many of these algebras are of infinite global dimension.
On the Bound States of Matrix Strings
Sahakian, Vatche
1997-01-01
We investigate excitations in Matrix Theory on T^2 corresponding to bound states of strings. We demonstrate the Dirichlet aspect of R-R charged vacua through a non-trivial connection between the U(1) and SU(n) sectors of the matrix SYM.
Matrix model description of baryonic deformations
Bena, Iosif; Murayama, Hitoshi; Roiban, Radu; Tatar, Radu
2003-03-13
We investigate supersymmetric QCD with N{sub c} + 1 flavors using an extension of the recently proposed relation between gauge theories and matrix models.The impressive agreement between the two sides provides a beautiful confirmation of the extension of the gauge theory-matrix model relation to this case.
Indecomposability of polynomials via Jacobian matrix
Uni-multivariate decomposition of polynomials is a special case of absolute factorization. Recently, thanks to the Ruppert's matrix some effective results about absolute factorization have been improved. Here we show that with a jacobian matrix we can get sharper bounds for the special case of uni-multivariate decomposition. (author)
Examination of pairs in neutrino mixing matrix
Liu, Dianjing
2015-01-01
We exam the pairs of neutrino mixing matrix and suggest pairs that can be used in the construction of new mixing patterns, with "pair" denoting the equality of the modulus of a pair of matrix elements. The results show that the tri-maximal mixing in $\
Finding nonoverlapping substructures of a sparse matrix
Pinar, Ali; Vassilevska, Virginia
2004-08-09
Many applications of scientific computing rely on computations on sparse matrices, thus the design of efficient implementations of sparse matrix kernels is crucial for the overall efficiency of these applications. Due to the high compute-to-memory ratio and irregular memory access patterns, the performance of sparse matrix kernels is often far away from the peak performance on a modern processor. Alternative data structures have been proposed, which split the original matrix A into A{sub d} and A{sub s}, so that A{sub d} contains all dense blocks of a specified size in the matrix, and A{sub s} contains the remaining entries. This enables the use of dense matrix kernels on the entries of A{sub d} producing better memory performance. In this work, we study the problem of finding a maximum number of non overlapping rectangular dense blocks in a sparse matrix, which has not been studied in the sparse matrix community. We show that the maximum non overlapping dense blocks problem is NP-complete by using a reduction from the maximum independent set problem on cubic planar graphs. We also propose a 2/3-approximation algorithm for 2 times 2 blocks that runs in linear time in the number of nonzeros in the matrix. We discuss alternatives to rectangular blocks such as diagonal blocks and cross blocks and present complexity analysis and approximation algorithms.
Optimum interface properties for metal matrix composites
Ghosn, Louis J.; Lerch, Bradley A.
1989-01-01
Due to the thermal expansion coefficient mismatch (CTE) between the fiber and the matrix, high residual sresses exist in metal matrix composite systems upon cool down from processing temperature to room temperature. An interface material can be placed between the fiber and the matrix to reduce the high tensile residual stresses in the matrix. A computer program was written to minimize the residual stress in the matrix subject to the interface material properties. The decision variables are the interface modulus, thickness and thermal expansion coefficient. The properties of the interface material are optimized such that the average distortion energy in the matrix and the interface is minimized. As a result, the only active variable is the thermal expansion coefficient. The optimum modulus of the interface is always the minimum allowable value and the interface thickness is always the maximum allowable value, independent of the fiber/matrix system. The optimum interface thermal expansion coefficient is always between the values of the fiber and the matrix. Using this analysis, a survey of materials was conducted for use as fiber coatings in some specific composite systems.
Counseling Uses of the Hill Interaction Matrix.
Boyd, Robert E.
While the Hill Interaction Matrix was developed as a research instrument to assess interview process, it is also generally useful in any undertaking requiring the evaluation of verbal interaction and, hence, can be used as an aid in modifying communication in order to increase its therapeutic effect. The Hill Interaction Matrix with accompanying…
Confocal Microscopy Imaging of the Biofilm Matrix
Schlafer, Sebastian; Meyer, Rikke Louise
2016-01-01
. Confocal microscopes are held by many research groups, and a number of methods for qualitative and quantitative imaging of the matrix have emerged in recent years. This review provides an overview and a critical discussion of techniques used to visualize different matrix compounds, to determine the...
Fragmentation of extracellular matrix by hypochlorous acid
Woods, Alan A; Davies, Michael Jonathan
2003-01-01
/chloramide decomposition, with copper and iron ions being effective catalysts, and decreased by compounds which scavenge chloramines/chloramides, or species derived from them. The effect of such matrix modifications on cellular behaviour is poorly understood, though it is known that changes in matrix materials can have...
The Iteration Solution of Matrix Equation AXB=C Subject to a Linear Matrix Inequality Constraint
Na Huang; Changfeng Ma
2014-01-01
We propose a feasible and effective iteration method to find solutions to the matrix equation $AXB=C$ subject to a matrix inequality constraint $DXE\\ge F$ , where $DXE\\ge F$ means that the matrix $DXE-F$ is nonnegative. And the global convergence results are obtained. Some numerical results are reported to illustrate the applicability of the method.
Making the matrix work how matrix managers engage people and cut through complexity
Hall, Kevan
2013-01-01
Welcome to the matrix, where multiple bosses, competing goals, influence withoutauthority and accountability without control make work more complex. Most largeorganizations have adopted some form of matrix organization to manage globalcustomers and supply chains, implement common business processes and run moreintegrated business functions. But in a matrix, structure solves nothing. It ismatrix management, the way people work together, that makes the differencebetween matrix success and failure. Makingthe Matrix Work will show you how to establish and engage networksthat do not depend on role,
Active Matrix OLED Test Report
Salazar, George
2013-01-01
This report focuses on the limited environmental testing of the AMOLED display performed as an engineering evaluation by The NASA Johnson Space Center (JSC)-specifically. EMI. Thermal Vac, and radiation tests. The AMOLED display is an active-matrix Organic Light Emitting Diode (OLED) technology. The testing provided an initial understanding of the technology and its suitability for space applications. Relative to light emitting diode (LED) displays or liquid crystal displays (LCDs), AMOLED displays provide a superior viewing experience even though they are much lighter and smaller, produce higher contrast ratio and richer colors, and require less power to operate than LCDs. However, AMOLED technology has not been demonstrated in a space environment. Therefore, some risks with the technology must be addressed before they can be seriously considered for human spaceflight. The environmental tests provided preliminary performance data on the ability of the display technology to handle some of the simulated induced space/spacecraft environments that an AMOLED display will see during a spacecraft certification test program. This engineering evaluation is part of a Space Act Agreement (SM) between The NASA/JSC and Honeywell International (HI) as a collaborative effort to evaluate the potential use of AMOLED technology for future human spaceflight missions- both government-led and commercial. Under this SM, HI is responsible for doing optical performance evaluation, as well as temperature and touch screen studies. The NASA/JSC is responsible for performing environmental testing comprised of EMI, Thermal Vac, and radiation tests. Additionally, as part of the testing, limited optical data was acquired to assess performance as the display was subjected to the induced environments. The NASA will benefit from this engineering evaluation by understanding AMOLED suitability for future use in space as well as becoming a smarter buyer (or developer) of the technology. HI benefits
[Modern polymers in matrix tablets technology].
Zimmer, Łukasz; Kasperek, Regina; Poleszak, Ewa
2014-01-01
Matrix tablets are the most popular method of oral drug administration, and polymeric materials have been used broadly in matrix formulations to modify and modulate drug release rate. The main goal of the system is to extend drug release profiles to maintain a constant in vivo plasma drug concentration and a consistent pharmacological effect. Polymeric matrix tablets offer a great potential as oral controlled drug delivery systems. Cellulose derivatives, like hydroxypropyl methylcellulose (HPMC) are often used as matrix formers. However, also other types of polymers can be used for this purpose including: Kollidon SR, acrylic acid polymers such as Eudragits and Carbopols. Nevertheless, polymers of natural origin like: carragens, chitosan and alginates widely used in the food and cosmetics industry are now coming to the fore of pharmaceutical research and are used in matrix tablets technology. Modern polymers allow to obtain matrix tablets by 3D printing, which enables to develop new formulation types. In this paper, the polymers used in matrix tablets technology and examples of their applications were described. PMID:25739125
Radiation effects on polymer matrix composites
As the structural material and the electric and heat insulators for the superconducting magnets of nuclear fusion reactors, large quantity of polymer matrix composites is used. The radiation resistance of the polymer matrix composite insulators determines practically the operation life of superconducting magnets. This is the review of the results of research from 1983 to 1991 carried out in Takasaki Establishment of Japan Atomic Energy Research Institute, and mainly the mechanical properties of polymer matrix composites at 77 K, 4.2 K and room temperature after the irradiation with 60Co gamma ray or neutrons are introduced. The reinforcement was the plain fabrics of E glass or T glass fibers, and the matrix was epoxy resin. The load-deflection curves by three-point bending test are shown. The breaking mode was bending mode or shearing mode or their mixed mode. The effect of the degree of hardening of matrix resin, and the deteriorating behavior due to gamma ray irradiation are reported. The mechanism of the deterioration is the radiation damage of matrix or the interface between matrix and fibers. The determination of absorbed neutron dose, the effects of the kinds of reinforcement and the atmosphere of irradiation are discussed. (K.I.)
Random matrix approach to shareholding networks
Souma, Wataru; Fujiwara, Yoshi; Aoyama, Hideaki
2004-12-01
A shareholding network is represented by a symmetrical adjacency matrix. The random matrix theoretical approach to this matrix shows that the spectrum follows a power law distribution, ρ(λ)∼|λ|, in the tail part. It is also shown that the degree distribution of this network follows a power law distribution, p(k)∼k, in the large degree range. The scaling law δ=2γ-1 is found in this network. The reason why this relation holds is attributed to the local tree-like structure of the shareholding network.
Earthquake prediction decision and risk matrix
Zou, Qi-Jia
1993-08-01
The issuance of an earthquake prediction must cause widespread social responses. It is suggested and discussed in this paper that the comprehensive decision issue for earthquake prediction considering the factors of the social and economic cost. The method of matrix decision for earthquake prediction (MDEP) is proposed in this paper and it is based on the risk matrix. The goal of decision is that search the best manner issuing earthquake prediction so that minimize the total losses of economy. The establishment and calculation of the risk matrix is discussed, and the decision results taking account of economic factors and not considering the economic factors are compared by examples in this paper.
The Matrix exponential, Dynamic Systems and Control
Poulsen, Niels Kjølstad
2004-01-01
The matrix exponential can be found in various connections in analysis and control of dynamic systems. In this short note we are going to list a few examples. The matrix exponential usably pops up in connection to the sampling process, whatever it is in a deterministic or a stochastic setting or it...... is a tool for determining a Gramian matrix. This note is intended to be used in connection to the teaching post the course in Stochastic Adaptive Control (02421) given at Informatics and Mathematical Modelling (IMM), The Technical University of Denmark. This work is a result of a study of the...
A transilient matrix for moist convection
Romps, D.; Kuang, Z.
2011-08-15
A method is introduced for diagnosing a transilient matrix for moist convection. This transilient matrix quantifies the nonlocal transport of air by convective eddies: for every height z, it gives the distribution of starting heights z{prime} for the eddies that arrive at z. In a cloud-resolving simulation of deep convection, the transilient matrix shows that two-thirds of the subcloud air convecting into the free troposphere originates from within 100 m of the surface. This finding clarifies which initial height to use when calculating convective available potential energy from soundings of the tropical troposphere.
Solving logic equation via matrix expression
Daizhan CHENG; Zhiqiang LI
2009-01-01
A new matrix product, called semi-tensor product of matrices, is introduced. Using this, an algebraic expression of logic is proposed, where a logical variability is expressed as a vector, a logic function is expressed as a matrix and the function values are obtained by the product of matrix with its arguments' vectors. Under this frame-work, the problem of solving logic equations is investi-gated. For a static logic equation, we convert it into a set of linear algebraic equations. Then the solution becomes obvious. Some examples are presented to show that it is useful for logic infection.
Visual Matrix Clustering of Social Networks
Wong, Pak C.; Mackey, Patrick S.; Foote, Harlan P.; May, Richard A.
2013-07-01
The prevailing choices to graphically represent a social network in today’s literature are a node-link graph layout and an adjacency matrix. Both visualization techniques have unique strengths and weaknesses when applied to different domain applications. In this article, we focus our discussion on adjacency matrix and how to turn the matrix-based visualization technique from merely showing pairwise associations among network actors (or graph nodes) to depicting clusters of a social network. We also use node-link layouts to supplement the discussion.
Analysis Of Single Phase Matrix Converter
Divya Ahirrao
2014-03-01
Full Text Available This paper presents concept of single phase matrix converter. Single phase matrix converter (SPMC performs a function such as frequency changer, rectifier, inverter; chopper. This reduces the need for new converter hardware. Pulse width modulation (SPWM techniques are used to calculate the switch duty ratio to synthesis the output. The simulation of converter is carried out in MATLAB/SIMULINK. Hardware design is obtained using readily available IC‟s and other components. This paper discusses the new multiple converter for single phase input using matrix topology using just a single control logic.
Dielectric Fundamental Strings in Matrix String Theory
Brecher, Dominic; Janssen, Bert; Lozano, Yolanda
2001-01-01
Matrix string theory is equivalent to type IIA superstring theory in the light-cone gauge, together with extra degrees of freedom representing D-brane states. It is therefore the appropriate framework in which to study systems of multiple fundamental strings expanding into higher-dimensional D-branes. Starting from Matrix theory in a weakly curved background, we construct the linear couplings of closed string fields to type IIA Matrix strings. As a check, we show that at weak coupling the res...
Democratic-type neutrino mass matrix
Miura, T; Yoshimura, M; Miura, Takahiro; Takasugi, Eiichi; Yoshimura, Masaki
2000-01-01
We consider the democratic-type neutrino mass matrix and show that this matrix predicts the atmospheric neutrino mixing to be almost maximal, $\\sin^2 2\\theta_{atm}>0.999$ as well as the large CP violation (the CP violation phase in the standard form is maximal $\\delta=\\pi/2$). We construct the $Z_3$ symmetric dimension five effective Lagrangian with two up-type Higgs doublets and show that this Lagrangian leads to the democratic neutrino mass matrix. Furthermore, we consider the restricted model with one up-type Higgs doublet and obtain the prediction, $0.87<\\sin^2 2\\theta_{sol}<8/9$.
Development of a Java Package for Matrix Programming
Lim, Ngee-Peng; Ling, Maurice HT; Lim, Shawn YC; Choi, Ji-Hee; Teo, Henry BK
2003-01-01
We had assembled a Java package, known as MatrixPak, of four classes for the purpose of numerical matrix computation. The classes are matrix, matrix_operations, StrToMatrix, and MatrixToStr; all of which are inherited from java.lang.Object class. Class matrix defines a matrix as a two-dimensional array of float types, and contains the following mathematical methods: transpose, adjoint, determinant, inverse, minor and cofactor. Class matrix_operations contains the following mathematical method...
Neutrino masses from an approximate mixing matrix with $\\theta_{13}\
Damanik, Asan
2016-01-01
An approximate neutrino mixing matrix is formutated by using the standard neutrino mixing matrix as a basis and experimental data of neutrino oscillations as inputs. By using the resulted approximate neutrino mixing matrix to proceed the neutrino mass matrix and constraining the resulted neutrino mass matrix with zero texture: $M_{\
A matrix of social accounting for Asturias
Margarita Argüelles
2003-01-01
Full Text Available A Social Accounting Matrix is an integrated system of accounts that presents in a double-entry table all the transactions made in an economy among productive sectors, production factors, institutional sectors and the rest of the world. In comparison with an Input-Output Table, it offers a greater deal of information and shows completely the circular process of income, captivating more precisely the effects of exogenous changes. One of the main profits of a Social Accounting Matrix is to serve as a database for the development and application of a computable general equilibrium model. This is, in fact, the aim pursued with the elaboration of the Social Accounting Matrix for the Asturian economy presented here. This Matrix has been constructed with data from the 1995 Regional Accounts of Asturias, and its structure has been adapted to its future use as a database for a computable general equilibrium model of this regional economy.
Celsian Glass-Ceramic Matrix Composites
Bansal, Narottam P.; Dicarlo, James A.
1996-01-01
Glass-ceramic matrix reinforced fiber composite materials developed for use in low dielectric applications, such as radomes. Materials strong and tough, exhibit low dielectric properties, and endure high temperatures.
Design of lipid matrix particles for fenofibrate
Xia, Dengning; Cui, Fude; Gan, Yong;
2014-01-01
The effect of polymorphism of glycerol monostearate (GMS) on drug incorporation and release from lipid matrix particles (LMPs) was investigated using fenofibrate as a model drug. X-ray powder diffraction and differential scanning calorimetry were used to study the polymorphism change of GMS and the...... drug incorporation in GMS matrix. When medium-chain triglycerides (MCT) was absent, melted GMS was frozen to α-form of GMS with drug molecularly dispersed, whereas β-form of GMS was formed with part of drug crystallized out when the ratio of GMS/MCT in the lipid matrix was 2:1 (w/w). For LMP composed......, the polymorphism of GMS is an important factor determining particle stability, drug incorporation, and the release of the drug from LMP. Critical attention should be paid on the investigation as well as control of the lipid polymorphism when formulating lipid-based matrix particles. © 2013 Wiley...
Extracellular matrix component signaling in cancer
Multhaupt, Hinke A. B.; Leitinger, Birgit; Gullberg, Donald;
2016-01-01
Cell responses to the extracellular matrix depend on specific signaling events. These are important from early development, through differentiation and tissue homeostasis, immune surveillance, and disease pathogenesis. Signaling not only regulates cell adhesion cytoskeletal organization and...... motility but also provides survival and proliferation cues. The major classes of cell surface receptors for matrix macromols. are the integrins, discoidin domain receptors, and transmembrane proteoglycans such as syndecans and CD44. Cells respond not only to specific ligands, such as collagen, fibronectin......, or basement membrane glycoproteins, but also in terms of matrix rigidity. This can regulate the release and subsequent biol. activity of matrix-bound growth factors, for example, transforming growth factor-β. In the environment of tumors, there may be changes in cell populations and their receptor...