Block Tridiagonal Matrices in Electronic Structure Calculations
DEFF Research Database (Denmark)
Petersen, Dan Erik
in the Landauer–Büttiker ballistic transport regime. These calculations concentrate on determining the so– called Green’s function matrix, or portions thereof, which is the inverse of a block tridiagonal general complex matrix. To this end, a sequential algorithm based on Gaussian elimination named Sweeps...
Optimal block-tridiagonalization of matrices for coherent charge transport
International Nuclear Information System (INIS)
Wimmer, Michael; Richter, Klaus
2009-01-01
Numerical quantum transport calculations are commonly based on a tight-binding formulation. A wide class of quantum transport algorithms require the tight-binding Hamiltonian to be in the form of a block-tridiagonal matrix. Here, we develop a matrix reordering algorithm based on graph partitioning techniques that yields the optimal block-tridiagonal form for quantum transport. The reordered Hamiltonian can lead to significant performance gains in transport calculations, and allows to apply conventional two-terminal algorithms to arbitrarily complex geometries, including multi-terminal structures. The block-tridiagonalization algorithm can thus be the foundation for a generic quantum transport code, applicable to arbitrary tight-binding systems. We demonstrate the power of this approach by applying the block-tridiagonalization algorithm together with the recursive Green's function algorithm to various examples of mesoscopic transport in two-dimensional electron gases in semiconductors and graphene.
International Nuclear Information System (INIS)
Reuter, Matthew G; Hill, Judith C
2012-01-01
We present an algorithm for computing any block of the inverse of a block tridiagonal, nearly block Toeplitz matrix (defined as a block tridiagonal matrix with a small number of deviations from the purely block Toeplitz structure). By exploiting both the block tridiagonal and the nearly block Toeplitz structures, this method scales independently of the total number of blocks in the matrix and linearly with the number of deviations. Numerical studies demonstrate this scaling and the advantages of our method over alternatives.
International Nuclear Information System (INIS)
Emel'yanenko, G.A.; Sek, I.E.
1988-01-01
Many correctable unknown methods for eigenvalue calculation of general tridiagonal matrices with real elements; criteria of singular tridiagonal matrices; necessary and sufficient conditions of tridiagonal matrix degeneracy; process with boundary conditions according to calculation processes of general upper and lower tridiagonal matrix minors are obtained. 6 refs
BCYCLIC: A parallel block tridiagonal matrix cyclic solver
Hirshman, S. P.; Perumalla, K. S.; Lynch, V. E.; Sanchez, R.
2010-09-01
A block tridiagonal matrix is factored with minimal fill-in using a cyclic reduction algorithm that is easily parallelized. Storage of the factored blocks allows the application of the inverse to multiple right-hand sides which may not be known at factorization time. Scalability with the number of block rows is achieved with cyclic reduction, while scalability with the block size is achieved using multithreaded routines (OpenMP, GotoBLAS) for block matrix manipulation. This dual scalability is a noteworthy feature of this new solver, as well as its ability to efficiently handle arbitrary (non-powers-of-2) block row and processor numbers. Comparison with a state-of-the art parallel sparse solver is presented. It is expected that this new solver will allow many physical applications to optimally use the parallel resources on current supercomputers. Example usage of the solver in magneto-hydrodynamic (MHD), three-dimensional equilibrium solvers for high-temperature fusion plasmas is cited.
Bagci, Hakan
2014-11-11
We study sweeping preconditioners for symmetric and positive definite block tridiagonal systems of linear equations. The algorithm provides an approximate inverse that can be used directly or in a preconditioned iterative scheme. These algorithms are based on replacing the Schur complements appearing in a block Gaussian elimination direct solve by hierarchical matrix approximations with reduced off-diagonal ranks. This involves developing low rank hierarchical approximations to inverses. We first provide a convergence analysis for the algorithm for reduced rank hierarchical inverse approximation. These results are then used to prove convergence and preconditioning estimates for the resulting sweeping preconditioner.
Bagci, Hakan; Pasciak, Joseph E.; Sirenko, Kostyantyn
2014-01-01
We study sweeping preconditioners for symmetric and positive definite block tridiagonal systems of linear equations. The algorithm provides an approximate inverse that can be used directly or in a preconditioned iterative scheme. These algorithms are based on replacing the Schur complements appearing in a block Gaussian elimination direct solve by hierarchical matrix approximations with reduced off-diagonal ranks. This involves developing low rank hierarchical approximations to inverses. We first provide a convergence analysis for the algorithm for reduced rank hierarchical inverse approximation. These results are then used to prove convergence and preconditioning estimates for the resulting sweeping preconditioner.
Czech Academy of Sciences Publication Activity Database
Liesen, J.; Tichý, Petr
2005-01-01
Roč. 20, - (2005), s. 180-197 ISSN 1068-9613 R&D Projects: GA AV ČR(CZ) KJB1030306 Institutional research plan: CEZ:AV0Z10300504 Keywords : Krylov subspace methods * conjugate gradient method * minimal residual method * convergence analysis * tridiagonal Toeplitz matrices * Poisson equation Subject RIV: BA - General Mathematics Impact factor: 0.608, year: 2005 http://etna.mcs.kent.edu/volumes/2001-2010/vol20/abstract.php?vol=20&pages=180-197
A method to compute the inverse of a complex n-block tridiagonal quasi-hermitian matrix
International Nuclear Information System (INIS)
Godfrin, Elena
1990-01-01
This paper presents a method to compute the inverse of a complex n-block tridiagonal quasi-hermitian matrix using adequate partitions of the complete matrix. This type of matrix is very usual in quantum mechanics and, more specifically, in solid state physics (e.g., interfaces and superlattices), when the tight-binding approximation is used. The efficiency of the method is analyzed comparing the required CPU time and work-area for different usual techniques. (Author)
Ke, Rihuan; Ng, Michael K.; Sun, Hai-Wei
2015-12-01
In this paper, we study the block lower triangular Toeplitz-like with tri-diagonal blocks system which arises from the time-fractional partial differential equation. Existing fast numerical solver (e.g., fast approximate inversion method) cannot handle such linear system as the main diagonal blocks are different. The main contribution of this paper is to propose a fast direct method for solving this linear system, and to illustrate that the proposed method is much faster than the classical block forward substitution method for solving this linear system. Our idea is based on the divide-and-conquer strategy and together with the fast Fourier transforms for calculating Toeplitz matrix-vector multiplication. The complexity needs O (MNlog2 M) arithmetic operations, where M is the number of blocks (the number of time steps) in the system and N is the size (number of spatial grid points) of each block. Numerical examples from the finite difference discretization of time-fractional partial differential equations are also given to demonstrate the efficiency of the proposed method.
On the Eigenvalues and Eigenvectors of Block Triangular Preconditioned Block Matrices
Pestana, Jennifer
2014-01-01
Block lower triangular matrices and block upper triangular matrices are popular preconditioners for 2×2 block matrices. In this note we show that a block lower triangular preconditioner gives the same spectrum as a block upper triangular preconditioner and that the eigenvectors of the two preconditioned matrices are related. © 2014 Society for Industrial and Applied Mathematics.
Permuting sparse rectangular matrices into block-diagonal form
Energy Technology Data Exchange (ETDEWEB)
Aykanat, Cevdet; Pinar, Ali; Catalyurek, Umit V.
2002-12-09
This work investigates the problem of permuting a sparse rectangular matrix into block diagonal form. Block diagonal form of a matrix grants an inherent parallelism for the solution of the deriving problem, as recently investigated in the context of mathematical programming, LU factorization and QR factorization. We propose graph and hypergraph models to represent the nonzero structure of a matrix, which reduce the permutation problem to those of graph partitioning by vertex separator and hypergraph partitioning, respectively. Besides proposing the models to represent sparse matrices and investigating related combinatorial problems, we provide a detailed survey of relevant literature to bridge the gap between different societies, investigate existing techniques for partitioning and propose new ones, and finally present a thorough empirical study of these techniques. Our experiments on a wide range of matrices, using state-of-the-art graph and hypergraph partitioning tools MeTiS and PaT oH, revealed that the proposed methods yield very effective solutions both in terms of solution quality and run time.
Tridiagonal realization of the antisymmetric Gaussian β-ensemble
International Nuclear Information System (INIS)
Dumitriu, Ioana; Forrester, Peter J.
2010-01-01
The Householder reduction of a member of the antisymmetric Gaussian unitary ensemble gives an antisymmetric tridiagonal matrix with all independent elements. The random variables permit the introduction of a positive parameter β, and the eigenvalue probability density function of the corresponding random matrices can be computed explicitly, as can the distribution of (q i ), the first components of the eigenvectors. Three proofs are given. One involves an inductive construction based on bordering of a family of random matrices which are shown to have the same distributions as the antisymmetric tridiagonal matrices. This proof uses the Dixon-Anderson integral from Selberg integral theory. A second proof involves the explicit computation of the Jacobian for the change of variables between real antisymmetric tridiagonal matrices, its eigenvalues, and (q i ). The third proof maps matrices from the antisymmetric Gaussian β-ensemble to those realizing particular examples of the Laguerre β-ensemble. In addition to these proofs, we note some simple properties of the shooting eigenvector and associated Pruefer phases of the random matrices.
VanderLaan Circulant Type Matrices
Directory of Open Access Journals (Sweden)
Hongyan Pan
2015-01-01
Full Text Available Circulant matrices have become a satisfactory tools in control methods for modern complex systems. In the paper, VanderLaan circulant type matrices are presented, which include VanderLaan circulant, left circulant, and g-circulant matrices. The nonsingularity of these special matrices is discussed by the surprising properties of VanderLaan numbers. The exact determinants of VanderLaan circulant type matrices are given by structuring transformation matrices, determinants of well-known tridiagonal matrices, and tridiagonal-like matrices. The explicit inverse matrices of these special matrices are obtained by structuring transformation matrices, inverses of known tridiagonal matrices, and quasi-tridiagonal matrices. Three kinds of norms and lower bound for the spread of VanderLaan circulant and left circulant matrix are given separately. And we gain the spectral norm of VanderLaan g-circulant matrix.
Lanczos Tridiagonalization and Core Problems
Czech Academy of Sciences Publication Activity Database
Hnětynková, Iveta; Strakoš, Zdeněk
2007-01-01
Roč. 421, č. 2-3 (2007), s. 243-251 ISSN 0024-3795 R&D Projects: GA AV ČR 1ET400300415 Institutional research plan: CEZ:AV0Z10300504 Keywords : linear approximation problem * orthogonal transformation * core problem * Golub-Kahan bidiagonalization * Lanczos tridiagonalization * Jacobi matrix Subject RIV: BA - General Mathematics Impact factor: 0.702, year: 2007
A family of tridiagonal pairs and related symmetric functions
International Nuclear Information System (INIS)
Baseilhac, Pascal
2006-01-01
A family of tridiagonal pairs which appear in the context of quantum integrable systems is studied in detail. The corresponding eigenvalue sequences, eigenspaces and the block tridiagonal structure of their matrix realizations with respect the dual eigenbasis are described. The overlap functions between the two dual bases are shown to satisfy a coupled system of recurrence relations and a set of discrete second-order q-difference equations which generalize those associated with the Askey-Wilson orthogonal polynomials with a discrete argument. Normalizing the fundamental solution to unity, the hierarchies of solutions are rational functions of one discrete argument, explicitly derived in some simplest examples. The weight function which ensures the orthogonality of the system of rational functions defined on a discrete real support is given
A family of tridiagonal pairs and related symmetric functions
Energy Technology Data Exchange (ETDEWEB)
Baseilhac, Pascal [Laboratoire de Mathematiques et Physique Theorique CNRS/UMR 6083, Federation Denis Poisson, Universite de Tours, Parc de Grandmont, 37200 Tours (France)
2006-09-22
A family of tridiagonal pairs which appear in the context of quantum integrable systems is studied in detail. The corresponding eigenvalue sequences, eigenspaces and the block tridiagonal structure of their matrix realizations with respect the dual eigenbasis are described. The overlap functions between the two dual bases are shown to satisfy a coupled system of recurrence relations and a set of discrete second-order q-difference equations which generalize those associated with the Askey-Wilson orthogonal polynomials with a discrete argument. Normalizing the fundamental solution to unity, the hierarchies of solutions are rational functions of one discrete argument, explicitly derived in some simplest examples. The weight function which ensures the orthogonality of the system of rational functions defined on a discrete real support is given.
Comparison of eigensolvers for symmetric band matrices.
Moldaschl, Michael; Gansterer, Wilfried N
2014-09-15
We compare different algorithms for computing eigenvalues and eigenvectors of a symmetric band matrix across a wide range of synthetic test problems. Of particular interest is a comparison of state-of-the-art tridiagonalization-based methods as implemented in Lapack or Plasma on the one hand, and the block divide-and-conquer (BD&C) algorithm as well as the block twisted factorization (BTF) method on the other hand. The BD&C algorithm does not require tridiagonalization of the original band matrix at all, and the current version of the BTF method tridiagonalizes the original band matrix only for computing the eigenvalues. Avoiding the tridiagonalization process sidesteps the cost of backtransformation of the eigenvectors. Beyond that, we discovered another disadvantage of the backtransformation process for band matrices: In several scenarios, a lot of gradual underflow is observed in the (optional) accumulation of the transformation matrix and in the (obligatory) backtransformation step. According to the IEEE 754 standard for floating-point arithmetic, this implies many operations with subnormal (denormalized) numbers, which causes severe slowdowns compared to the other algorithms without backtransformation of the eigenvectors. We illustrate that in these cases the performance of existing methods from Lapack and Plasma reaches a competitive level only if subnormal numbers are disabled (and thus the IEEE standard is violated). Overall, our performance studies illustrate that if the problem size is large enough relative to the bandwidth, BD&C tends to achieve the highest performance of all methods if the spectrum to be computed is clustered. For test problems with well separated eigenvalues, the BTF method tends to become the fastest algorithm with growing problem size.
A Perron–Frobenius theory for block matrices associated to a multiplex network
International Nuclear Information System (INIS)
Romance, Miguel; Solá, Luis; Flores, Julio; García, Esther; García del Amo, Alejandro; Criado, Regino
2015-01-01
The uniqueness of the Perron vector of a nonnegative block matrix associated to a multiplex network is discussed. The conclusions come from the relationships between the irreducibility of some nonnegative block matrix associated to a multiplex network and the irreducibility of the corresponding matrices to each layer as well as the irreducibility of the adjacency matrix of the projection network. In addition the computation of that Perron vector in terms of the Perron vectors of the blocks is also addressed. Finally we present the precise relations that allow to express the Perron eigenvector of the multiplex network in terms of the Perron eigenvectors of its layers
A Perron-Frobenius theory for block matrices associated to a multiplex network
Romance, Miguel; Solá, Luis; Flores, Julio; García, Esther; García del Amo, Alejandro; Criado, Regino
2015-03-01
The uniqueness of the Perron vector of a nonnegative block matrix associated to a multiplex network is discussed. The conclusions come from the relationships between the irreducibility of some nonnegative block matrix associated to a multiplex network and the irreducibility of the corresponding matrices to each layer as well as the irreducibility of the adjacency matrix of the projection network. In addition the computation of that Perron vector in terms of the Perron vectors of the blocks is also addressed. Finally we present the precise relations that allow to express the Perron eigenvector of the multiplex network in terms of the Perron eigenvectors of its layers.
A general approach to analyse preconditioners two-by-two block matrices
Czech Academy of Sciences Publication Activity Database
Axelsson, Owe
2012-01-01
Roč. 19, č. 2 (2012), s. 1-20 ISSN 1070-5325 R&D Projects: GA ČR GA105/09/1830 Institutional research plan: CEZ:AV0Z30860518 Keywords : block preconditioning * nonsymmetric matrices * saddle point systems Subject RIV: BA - General Mathematics Impact factor: 1.202, year: 2012 http://www.quosafulltext.com/sc_ddm/sc_ddm.jsp
Arikan and Alamouti matrices based on fast block-wise inverse Jacket transform
Lee, Moon Ho; Khan, Md Hashem Ali; Kim, Kyeong Jin
2013-12-01
Recently, Lee and Hou (IEEE Signal Process Lett 13: 461-464, 2006) proposed one-dimensional and two-dimensional fast algorithms for block-wise inverse Jacket transforms (BIJTs). Their BIJTs are not real inverse Jacket transforms from mathematical point of view because their inverses do not satisfy the usual condition, i.e., the multiplication of a matrix with its inverse matrix is not equal to the identity matrix. Therefore, we mathematically propose a fast block-wise inverse Jacket transform of orders N = 2 k , 3 k , 5 k , and 6 k , where k is a positive integer. Based on the Kronecker product of the successive lower order Jacket matrices and the basis matrix, the fast algorithms for realizing these transforms are obtained. Due to the simple inverse and fast algorithms of Arikan polar binary and Alamouti multiple-input multiple-output (MIMO) non-binary matrices, which are obtained from BIJTs, they can be applied in areas such as 3GPP physical layer for ultra mobile broadband permutation matrices design, first-order q-ary Reed-Muller code design, diagonal channel design, diagonal subchannel decompose for interference alignment, and 4G MIMO long-term evolution Alamouti precoding design.
Preconditioners for Some Matrices of Two-by-Two Block Form, with Applications, I
Czech Academy of Sciences Publication Activity Database
Axelsson, Owe
2013-01-01
Roč. 45, č. 45 (2013), s. 45-67. ISBN 978-1-4614-7171-4. ISSN 2194-1009 R&D Projects: GA MŠk ED1.1.00/02.0070 Institutional support: RVO:68145535 Keywords : two-by-two block-structured matrices * preconditioning * complex-valued system * Cahn-Hilliard phase-field model * optimal control Subject RIV: BA - General Mathematics http://link.springer.com/chapter/10.1007/978-1-4614-7172-1_3
Recursive tridiagonalization of infinite dimensional Hamiltonians
International Nuclear Information System (INIS)
Haydock, R.; Oregon Univ., Eugene, OR
1989-01-01
Infinite dimensional, computable, sparse Hamiltonians can be numerically tridiagonalized to finite precision using a three term recursion. Only the finite number of components whose relative magnitude is greater than the desired precision are stored at any stage in the computation. Thus the particular components stored change as the calculation progresses. This technique avoids errors due to truncation of the orbital set, and makes terminators unnecessary in the recursion method. (orig.)
Replica Fourier Tansforms on Ultrametric Trees, and Block-Diagonalizing Multi-Replica Matrices
de Dominicis, C.; Carlucci, D. M.; Temesvári, T.
1997-01-01
The analysis of objects living on ultrametric trees, in particular the block-diagonalization of 4-replica matrices M^{α β;γ^δ}, is shown to be dramatically simplified through the introduction of properly chosen operations on those objects. These are the Replica Fourier Transforms on ultrametric trees. Those transformations are defined and used in the present work. On montre que l'analyse d'objets vivant sur un arbre ultramétrique, en particulier, la diagonalisation par blocs d'une matrice M^{α β;γ^δ} dépendant de 4-répliques, se simplifie de façon dramatique si l'on introduit les opérations appropriées sur ces objets. Ce sont les Transformées de Fourier de Répliques sur un arbre ultramétrique. Ces transformations sont définies et utilisées dans le présent travail.
Solution of single linear tridiagonal systems and vectorization of the ICCG algorithm on the Cray 1
International Nuclear Information System (INIS)
Kershaw, D.S.
1981-01-01
The numerical algorithms used to solve the physics equation in codes which model laser fusion are examined, it is found that a large number of subroutines require the solution of tridiagonal linear systems of equations. One dimensional radiation transport, thermal and suprathermal electron transport, ion thermal conduction, charged particle and neutron transport, all require the solution of tridiagonal systems of equations. The standard algorithm that has been used in the past on CDC 7600's will not vectorize and so cannot take advantage of the large speed increases possible on the Cray-1 through vectorization. There is however, an alternate algorithm for solving tridiagonal systems, called cyclic reduction, which allows for vectorization, and which is optimal for the Cray-1. Software based on this algorithm is now being used in LASNEX to solve tridiagonal linear systems in the subroutines mentioned above. The new algorithm runs as much as five times faster than the standard algorithm on the Cray-1. The ICCG method is being used to solve the diffusion equation with a nine-point coupling scheme on the CDC 7600. In going from the CDC 7600 to the Cray-1, a large part of the algorithm consists of solving tridiagonal linear systems on each L line of the Lagrangian mesh in a manner which is not vectorizable. An alternate ICCG algorithm for the Cray-1 was developed which utilizes a block form of the cyclic reduction algorithm. This new algorithm allows full vectorization and runs as much as five times faster than the old algorithm on the Cray-1. It is now being used in Cray LASNEX to solve the two-dimensional diffusion equation in all the physics subroutines mentioned above
Czech Academy of Sciences Publication Activity Database
Axelsson, Owe; Blaheta, Radim
2010-01-01
Roč. 17, č. 5 (2010), s. 787-810 ISSN 1070-5325 R&D Projects: GA ČR GA105/09/1830 Institutional research plan: CEZ:AV0Z30860518 Keywords : iterative solution methods * saddle point problems * preconditioning block matrices * domain decomposition * heterogeneous problems * regularization Subject RIV: JC - Computer Hardware ; Software Impact factor: 1.163, year: 2010 http://onlinelibrary.wiley.com/doi/10.1002/nla.v17:5/issuetoc
A tridiagonal parsimonious higher order multivariate Markov chain model
Wang, Chao; Yang, Chuan-sheng
2017-09-01
In this paper, we present a tridiagonal parsimonious higher-order multivariate Markov chain model (TPHOMMCM). Moreover, estimation method of the parameters in TPHOMMCM is give. Numerical experiments illustrate the effectiveness of TPHOMMCM.
Finding column depedencies in sparse matrices over $ F_ 2 $ by block Wiedemann
O. Penninga
1998-01-01
textabstractLarge systems of linear equations over $mathbb{F_2$ with sparse coefficient matrices have to be solved as a part of integer factorization with sieve-based methods such as in the Number Field Sieve algorithm. In this report, we first discuss the Wiedemann algorithm to solve these systems
Unitary tridiagonalization in M(4, C)
Indian Academy of Sciences (India)
Springer Verlag Heidelberg #4 2048 1996 Dec 15 10:16:45
Abstract. A question of interest in linear algebra is whether all n × n complex matrices can be unitarily ... passing, we also provide another elementary proof for the n = 3 case. 2. Some Lemmas. We need ... also use the letter A to denote the unique linear transformation determined by the matrix. A = [aij ] (satisfying Aej = ∑n.
Polynomial sequences generated by infinite Hessenberg matrices
Directory of Open Access Journals (Sweden)
Verde-Star Luis
2017-01-01
Full Text Available We show that an infinite lower Hessenberg matrix generates polynomial sequences that correspond to the rows of infinite lower triangular invertible matrices. Orthogonal polynomial sequences are obtained when the Hessenberg matrix is tridiagonal. We study properties of the polynomial sequences and their corresponding matrices which are related to recurrence relations, companion matrices, matrix similarity, construction algorithms, and generating functions. When the Hessenberg matrix is also Toeplitz the polynomial sequences turn out to be of interpolatory type and we obtain additional results. For example, we show that every nonderogative finite square matrix is similar to a unique Toeplitz-Hessenberg matrix.
On the nonnegative inverse eigenvalue problem of traditional matrices
Directory of Open Access Journals (Sweden)
Alimohammad Nazari
2014-07-01
Full Text Available In this paper, at first for a given set of real or complex numbers $\\sigma$ with nonnegativesummation, we introduce some special conditions that with them there is no nonnegativetridiagonal matrix in which $\\sigma$ is its spectrum. In continue we present some conditions forexistence such nonnegative tridiagonal matrices.
A Parallel Prefix Algorithm for Almost Toeplitz Tridiagonal Systems
Sun, Xian-He; Joslin, Ronald D.
1995-01-01
A compact scheme is a discretization scheme that is advantageous in obtaining highly accurate solutions. However, the resulting systems from compact schemes are tridiagonal systems that are difficult to solve efficiently on parallel computers. Considering the almost symmetric Toeplitz structure, a parallel algorithm, simple parallel prefix (SPP), is proposed. The SPP algorithm requires less memory than the conventional LU decomposition and is efficient on parallel machines. It consists of a prefix communication pattern and AXPY operations. Both the computation and the communication can be truncated without degrading the accuracy when the system is diagonally dominant. A formal accuracy study has been conducted to provide a simple truncation formula. Experimental results have been measured on a MasPar MP-1 SIMD machine and on a Cray 2 vector machine. Experimental results show that the simple parallel prefix algorithm is a good algorithm for symmetric, almost symmetric Toeplitz tridiagonal systems and for the compact scheme on high-performance computers.
Orthogonal polynomials derived from the tridiagonal representation approach
Alhaidari, A. D.
2018-01-01
The tridiagonal representation approach is an algebraic method for solving second order differential wave equations. Using this approach in the solution of quantum mechanical problems, we encounter two new classes of orthogonal polynomials whose properties give the structure and dynamics of the corresponding physical system. For a certain range of parameters, one of these polynomials has a mix of continuous and discrete spectra making it suitable for describing physical systems with both scattering and bound states. In this work, we define these polynomials by their recursion relations and highlight some of their properties using numerical means. Due to the prime significance of these polynomials in physics, we hope that our short expose will encourage experts in the field of orthogonal polynomials to study them and derive their properties (weight functions, generating functions, asymptotics, orthogonality relations, zeros, etc.) analytically.
Parallel computation for solving the tridiagonal linear system of equations
International Nuclear Information System (INIS)
Ishiguro, Misako; Harada, Hiroo; Fujii, Minoru; Fujimura, Toichiro; Nakamura, Yasuhiro; Nanba, Katsumi.
1981-09-01
Recently, applications of parallel computation for scientific calculations have increased from the need of the high speed calculation of large scale programs. At the JAERI computing center, an array processor FACOM 230-75 APU has installed to study the applicability of parallel computation for nuclear codes. We made some numerical experiments by using the APU on the methods of solution of tridiagonal linear equation which is an important problem in scientific calculations. Referring to the recent papers with parallel methods, we investigate eight ones. These are Gauss elimination method, Parallel Gauss method, Accelerated parallel Gauss method, Jacobi method, Recursive doubling method, Cyclic reduction method, Chebyshev iteration method, and Conjugate gradient method. The computing time and accuracy were compared among the methods on the basis of the numerical experiments. As the result, it is found that the Cyclic reduction method is best both in computing time and accuracy and the Gauss elimination method is the second one. (author)
Directory of Open Access Journals (Sweden)
Pablo Soto-Quiros
2015-01-01
Full Text Available This paper presents a parallel implementation of a kind of discrete Fourier transform (DFT: the vector-valued DFT. The vector-valued DFT is a novel tool to analyze the spectra of vector-valued discrete-time signals. This parallel implementation is developed in terms of a mathematical framework with a set of block matrix operations. These block matrix operations contribute to analysis, design, and implementation of parallel algorithms in multicore processors. In this work, an implementation and experimental investigation of the mathematical framework are performed using MATLAB with the Parallel Computing Toolbox. We found that there is advantage to use multicore processors and a parallel computing environment to minimize the high execution time. Additionally, speedup increases when the number of logical processors and length of the signal increase.
Linear algebra for dense matrices on a hypercube
International Nuclear Information System (INIS)
Sears, M.P.
1990-01-01
A set of routines has been written for dense matrix operations optimized for the NCUBE/6400 parallel processor. This paper was motivated by a Sandia effort to parallelize certain electronic structure calculations. Routines are included for matrix transpose, multiply, Cholesky decomposition, triangular inversion, and Householder tridiagonalization. The library is written in C and is callable from Fortran. Matrices up to order 1600 can be handled on 128 processors. For each operation, the algorithm used is presented along with typical timings and estimates of performance. Performance for order 1600 on 128 processors varies from 42 MFLOPs (House-holder tridiagonalization, triangular inverse) up to 126 MFLOPs (matrix multiply). The authors also present performance results for communications and basic linear algebra operations (saxpy and dot products)
A Fast parallel tridiagonal algorithm for a class of CFD applications
Moitra, Stuti; Sun, Xian-He
1996-01-01
The parallel diagonal dominant (PDD) algorithm is an efficient tridiagonal solver. This paper presents for study a variation of the PDD algorithm, the reduced PDD algorithm. The new algorithm maintains the minimum communication provided by the PDD algorithm, but has a reduced operation count. The PDD algorithm also has a smaller operation count than the conventional sequential algorithm for many applications. Accuracy analysis is provided for the reduced PDD algorithm for symmetric Toeplitz tridiagonal (STT) systems. Implementation results on Langley's Intel Paragon and IBM SP2 show that both the PDD and reduced PDD algorithms are efficient and scalable.
Noble, J. H.; Lubasch, M.; Stevens, J.; Jentschura, U. D.
2017-12-01
We describe a matrix diagonalization algorithm for complex symmetric (not Hermitian) matrices, A ̲ =A̲T, which is based on a two-step algorithm involving generalized Householder reflections based on the indefinite inner product 〈 u ̲ , v ̲ 〉 ∗ =∑iuivi. This inner product is linear in both arguments and avoids complex conjugation. The complex symmetric input matrix is transformed to tridiagonal form using generalized Householder transformations (first step). An iterative, generalized QL decomposition of the tridiagonal matrix employing an implicit shift converges toward diagonal form (second step). The QL algorithm employs iterative deflation techniques when a machine-precision zero is encountered "prematurely" on the super-/sub-diagonal. The algorithm allows for a reliable and computationally efficient computation of resonance and antiresonance energies which emerge from complex-scaled Hamiltonians, and for the numerical determination of the real energy eigenvalues of pseudo-Hermitian and PT-symmetric Hamilton matrices. Numerical reference values are provided.
Complex Wedge-Shaped Matrices: A Generalization of Jacobi Matrices
Czech Academy of Sciences Publication Activity Database
Hnětynková, Iveta; Plešinger, M.
2015-01-01
Roč. 487, 15 December (2015), s. 203-219 ISSN 0024-3795 R&D Projects: GA ČR GA13-06684S Keywords : eigenvalues * eigenvector * wedge-shaped matrices * generalized Jacobi matrices * band (or block) Krylov subspace methods Subject RIV: BA - General Mathematics Impact factor: 0.965, year: 2015
Solution of the nonrelativistic wave equation using the tridiagonal representation approach
Alhaidari, A. D.
2017-07-01
We choose a complete set of square integrable functions as a basis for the expansion of the wavefunction in configuration space such that the matrix representation of the nonrelativistic time-independent linear wave operator is tridiagonal and symmetric. Consequently, the matrix wave equation becomes a symmetric three-term recursion relation for the expansion coefficients of the wavefunction. The recursion relation is then solved exactly in terms of orthogonal polynomials in the energy. Some of these polynomials are not found in the mathematics literature. The asymptotics of these polynomials give the phase shift for the continuous energy scattering states and the spectrum for the discrete energy bound states. Depending on the space and boundary conditions, the basis functions are written in terms of either the Laguerre or Jacobi polynomials. The tridiagonal requirement limits the number of potential functions that yield exact solutions of the wave equation. Nonetheless, the class of exactly solvable problems in this approach is larger than the conventional class (see, for example, Table XII in the text). We also give very accurate results for cases where the wave operator matrix is not tridiagonal but its elements could be evaluated either exactly or numerically with high precision.
Czech Academy of Sciences Publication Activity Database
Axelsson, Owe; Blaheta, Radim
2013-01-01
Roč. 20, č. 3 (2013), s. 536-539 ISSN 1070-5325 Institutional support: RVO:68145535 Keywords : saddle point matrices * inverses * preconditioning Subject RIV: BA - General Mathematics Impact factor: 1.424, year: 2013 http://onlinelibrary.wiley.com/doi/10.1002/nla.816/pdf
An efficient parallel algorithm for the solution of a tridiagonal linear system of equations
Stone, H. S.
1971-01-01
Tridiagonal linear systems of equations are solved on conventional serial machines in a time proportional to N, where N is the number of equations. The conventional algorithms do not lend themselves directly to parallel computations on computers of the ILLIAC IV class, in the sense that they appear to be inherently serial. An efficient parallel algorithm is presented in which computation time grows as log sub 2 N. The algorithm is based on recursive doubling solutions of linear recurrence relations, and can be used to solve recurrence relations of all orders.
Special matrices of mathematical physics stochastic, circulant and Bell matrices
Aldrovandi, R
2001-01-01
This book expounds three special kinds of matrices that are of physical interest, centering on physical examples. Stochastic matrices describe dynamical systems of many different types, involving (or not) phenomena like transience, dissipation, ergodicity, nonequilibrium, and hypersensitivity to initial conditions. The main characteristic is growth by agglomeration, as in glass formation. Circulants are the building blocks of elementary Fourier analysis and provide a natural gateway to quantum mechanics and noncommutative geometry. Bell polynomials offer closed expressions for many formulas co
Krylov, Piotr
2017-01-01
This monograph is a comprehensive account of formal matrices, examining homological properties of modules over formal matrix rings and summarising the interplay between Morita contexts and K theory. While various special types of formal matrix rings have been studied for a long time from several points of view and appear in various textbooks, for instance to examine equivalences of module categories and to illustrate rings with one-sided non-symmetric properties, this particular class of rings has, so far, not been treated systematically. Exploring formal matrix rings of order 2 and introducing the notion of the determinant of a formal matrix over a commutative ring, this monograph further covers the Grothendieck and Whitehead groups of rings. Graduate students and researchers interested in ring theory, module theory and operator algebras will find this book particularly valuable. Containing numerous examples, Formal Matrices is a largely self-contained and accessible introduction to the topic, assuming a sol...
The Antitriangular Factorization of Saddle Point Matrices
Pestana, J.
2014-01-01
Mastronardi and Van Dooren [SIAM J. Matrix Anal. Appl., 34 (2013), pp. 173-196] recently introduced the block antitriangular ("Batman") decomposition for symmetric indefinite matrices. Here we show the simplification of this factorization for saddle point matrices and demonstrate how it represents the common nullspace method. We show that rank-1 updates to the saddle point matrix can be easily incorporated into the factorization and give bounds on the eigenvalues of matrices important in saddle point theory. We show the relation of this factorization to constraint preconditioning and how it transforms but preserves the structure of block diagonal and block triangular preconditioners. © 2014 Society for Industrial and Applied Mathematics.
Averaging operations on matrices
Indian Academy of Sciences (India)
2014-07-03
Jul 3, 2014 ... Role of Positive Definite Matrices. • Diffusion Tensor Imaging: 3 × 3 pd matrices model water flow at each voxel of brain scan. • Elasticity: 6 × 6 pd matrices model stress tensors. • Machine Learning: n × n pd matrices occur as kernel matrices. Tanvi Jain. Averaging operations on matrices ...
The Antitriangular Factorization of Saddle Point Matrices
Pestana, J.; Wathen, A. J.
2014-01-01
Mastronardi and Van Dooren [SIAM J. Matrix Anal. Appl., 34 (2013), pp. 173-196] recently introduced the block antitriangular ("Batman") decomposition for symmetric indefinite matrices. Here we show the simplification of this factorization for saddle
Inverse m-matrices and ultrametric matrices
Dellacherie, Claude; San Martin, Jaime
2014-01-01
The study of M-matrices, their inverses and discrete potential theory is now a well-established part of linear algebra and the theory of Markov chains. The main focus of this monograph is the so-called inverse M-matrix problem, which asks for a characterization of nonnegative matrices whose inverses are M-matrices. We present an answer in terms of discrete potential theory based on the Choquet-Deny Theorem. A distinguished subclass of inverse M-matrices is ultrametric matrices, which are important in applications such as taxonomy. Ultrametricity is revealed to be a relevant concept in linear algebra and discrete potential theory because of its relation with trees in graph theory and mean expected value matrices in probability theory. Remarkable properties of Hadamard functions and products for the class of inverse M-matrices are developed and probabilistic insights are provided throughout the monograph.
Encoders for block-circulant LDPC codes
Divsalar, Dariush (Inventor); Abbasfar, Aliazam (Inventor); Jones, Christopher R. (Inventor); Dolinar, Samuel J. (Inventor); Thorpe, Jeremy C. (Inventor); Andrews, Kenneth S. (Inventor); Yao, Kung (Inventor)
2009-01-01
Methods and apparatus to encode message input symbols in accordance with an accumulate-repeat-accumulate code with repetition three or four are disclosed. Block circulant matrices are used. A first method and apparatus make use of the block-circulant structure of the parity check matrix. A second method and apparatus use block-circulant generator matrices.
Introduction into Hierarchical Matrices
Litvinenko, Alexander
2013-12-05
Hierarchical matrices allow us to reduce computational storage and cost from cubic to almost linear. This technique can be applied for solving PDEs, integral equations, matrix equations and approximation of large covariance and precision matrices.
Introduction into Hierarchical Matrices
Litvinenko, Alexander
2013-01-01
Hierarchical matrices allow us to reduce computational storage and cost from cubic to almost linear. This technique can be applied for solving PDEs, integral equations, matrix equations and approximation of large covariance and precision matrices.
Incomplete block factorization preconditioning for indefinite elliptic problems
Energy Technology Data Exchange (ETDEWEB)
Guo, Chun-Hua [Univ. of Calgary, Alberta (Canada)
1996-12-31
The application of the finite difference method to approximate the solution of an indefinite elliptic problem produces a linear system whose coefficient matrix is block tridiagonal and symmetric indefinite. Such a linear system can be solved efficiently by a conjugate residual method, particularly when combined with a good preconditioner. We show that specific incomplete block factorization exists for the indefinite matrix if the mesh size is reasonably small. And this factorization can serve as an efficient preconditioner. Some efforts are made to estimate the eigenvalues of the preconditioned matrix. Numerical results are also given.
Fusion algebra and fusing matrices
International Nuclear Information System (INIS)
Gao Yihong; Li Miao; Yu Ming.
1989-09-01
We show that the Wilson line operators in topological field theories form a fusion algebra. In general, the fusion algebra is a relation among the fusing (F) matrices. In the case of the SU(2) WZW model, some special F matrix elements are found in this way, and the remaining F matrix elements are then determined up to a sign. In addition, the S(j) modular transformation of the one point blocks on the torus is worked out. Our results are found to agree with those obtained from the quantum group method. (author). 24 refs
Matrices and linear transformations
Cullen, Charles G
1990-01-01
""Comprehensive . . . an excellent introduction to the subject."" - Electronic Engineer's Design Magazine.This introductory textbook, aimed at sophomore- and junior-level undergraduates in mathematics, engineering, and the physical sciences, offers a smooth, in-depth treatment of linear algebra and matrix theory. The major objects of study are matrices over an arbitrary field. Contents include Matrices and Linear Systems; Vector Spaces; Determinants; Linear Transformations; Similarity: Part I and Part II; Polynomials and Polynomial Matrices; Matrix Analysis; and Numerical Methods. The first
Indian Academy of Sciences (India)
IAS Admin
harmonic analysis and complex analysis, in ... gebra describes not only the study of linear transforma- tions and .... special case of the Jordan canonical form of matrices. ..... Richard Bronson, Schaum's Outline Series Theory And Problems Of.
Numerical solutions of stochastic Lotka-Volterra equations via operational matrices
Directory of Open Access Journals (Sweden)
F. Hosseini Shekarabi
2016-03-01
Full Text Available In this paper, an efficient and convenient method for numerical solutions of stochastic Lotka-Volterra dynamical system is proposed. Here, we consider block pulse functions and their operational matrices of integration. Illustrative example is included to demonstrate the procedure and accuracy of the operational matrices based on block pulse functions.
DEFF Research Database (Denmark)
Sanz, Laura; Kristensen, Peter; Blanco, Belén
2002-01-01
Experimental evidence suggests that blocking the interactions between endothelial cells and extracellular matrix (ECM) components may provide a potent and general strategy to inhibit tumor neovascularization. Based on these considerations, we have focused our efforts on laminin, component of the ...
THE ALGORITHM AND PROGRAM OF M-MATRICES SEARCH AND STUDY
Directory of Open Access Journals (Sweden)
Y. N. Balonin
2013-05-01
Full Text Available The algorithm and software for search and study of orthogonal bases matrices – minimax matrices (M-matrix are considered. The algorithm scheme is shown, comments on calculation blocks are given, and interface of the MMatrix software system developed with participation of the authors is explained. The results of the universal algorithm work are presented as Hadamard matrices, Belevitch matrices (C-matrices, conference matrices and matrices of even and odd orders complementary and closely related to those ones by their properties, in particular, the matrix of the 22-th order for which there is no C-matrix. Examples of portraits for alternative matrices of the 255-th and the 257-th orders are given corresponding to the sequences of Mersenne and Fermat numbers. A new way to get Hadamard matrices is explained, different from the previously known procedures based on iterative processes and calculations of Lagrange symbols, with theoretical and practical meaning.
Threshold partitioning of sparse matrices and applications to Markov chains
Energy Technology Data Exchange (ETDEWEB)
Choi, Hwajeong; Szyld, D.B. [Temple Univ., Philadelphia, PA (United States)
1996-12-31
It is well known that the order of the variables and equations of a large, sparse linear system influences the performance of classical iterative methods. In particular if, after a symmetric permutation, the blocks in the diagonal have more nonzeros, classical block methods have a faster asymptotic rate of convergence. In this paper, different ordering and partitioning algorithms for sparse matrices are presented. They are modifications of PABLO. In the new algorithms, in addition to the location of the nonzeros, the values of the entries are taken into account. The matrix resulting after the symmetric permutation has dense blocks along the diagonal, and small entries in the off-diagonal blocks. Parameters can be easily adjusted to obtain, for example, denser blocks, or blocks with elements of larger magnitude. In particular, when the matrices represent Markov chains, the permuted matrices are well suited for block iterative methods that find the corresponding probability distribution. Applications to three types of methods are explored: (1) Classical block methods, such as Block Gauss Seidel. (2) Preconditioned GMRES, where a block diagonal preconditioner is used. (3) Iterative aggregation method (also called aggregation/disaggregation) where the partition obtained from the ordering algorithm with certain parameters is used as an aggregation scheme. In all three cases, experiments are presented which illustrate the performance of the methods with the new orderings. The complexity of the new algorithms is linear in the number of nonzeros and the order of the matrix, and thus adding little computational effort to the overall solution.
Chemiluminescence in cryogenic matrices
Lotnik, S. V.; Kazakov, Valeri P.
1989-04-01
The literature data on chemiluminescence (CL) in cryogenic matrices have been classified and correlated for the first time. The role of studies on phosphorescence and CL at low temperatures in the development of cryochemistry is shown. The features of low-temperature CL in matrices of nitrogen and inert gases (fine structure of spectra, matrix effects) and the data on the mobility and reactivity of atoms and radicals at very low temperatures are examined. The trends in the development of studies on CL in cryogenic matrices, such as the search for systems involving polyatomic molecules and extending the forms of CL reactions, are followed. The reactions of active nitrogen with hydrocarbons that are accompanied by light emission and CL in the oxidation of carbenes at T >= 77 K are examined. The bibliography includes 112 references.
Matrices in Engineering Problems
Tobias, Marvin
2011-01-01
This book is intended as an undergraduate text introducing matrix methods as they relate to engineering problems. It begins with the fundamentals of mathematics of matrices and determinants. Matrix inversion is discussed, with an introduction of the well known reduction methods. Equation sets are viewed as vector transformations, and the conditions of their solvability are explored. Orthogonal matrices are introduced with examples showing application to many problems requiring three dimensional thinking. The angular velocity matrix is shown to emerge from the differentiation of the 3-D orthogo
Infinite matrices and sequence spaces
Cooke, Richard G
2014-01-01
This clear and correct summation of basic results from a specialized field focuses on the behavior of infinite matrices in general, rather than on properties of special matrices. Three introductory chapters guide students to the manipulation of infinite matrices, covering definitions and preliminary ideas, reciprocals of infinite matrices, and linear equations involving infinite matrices.From the fourth chapter onward, the author treats the application of infinite matrices to the summability of divergent sequences and series from various points of view. Topics include consistency, mutual consi
2014-04-01
materials, the affinity ligand would need identification , as well as chemistries that graft the affinity ligand onto the surface of magnetic...ACTIVE CAPTURE MATRICES FOR THE DETECTION/ IDENTIFICATION OF PHARMACEUTICALS...6 As shown in Figure 2.3-1a, the spectra exhibit similar baselines and the spectral peaks lineup . Under these circumstances, the spectral
Malware Analysis Using Visualized Image Matrices
Directory of Open Access Journals (Sweden)
KyoungSoo Han
2014-01-01
Full Text Available This paper proposes a novel malware visual analysis method that contains not only a visualization method to convert binary files into images, but also a similarity calculation method between these images. The proposed method generates RGB-colored pixels on image matrices using the opcode sequences extracted from malware samples and calculates the similarities for the image matrices. Particularly, our proposed methods are available for packed malware samples by applying them to the execution traces extracted through dynamic analysis. When the images are generated, we can reduce the overheads by extracting the opcode sequences only from the blocks that include the instructions related to staple behaviors such as functions and application programming interface (API calls. In addition, we propose a technique that generates a representative image for each malware family in order to reduce the number of comparisons for the classification of unknown samples and the colored pixel information in the image matrices is used to calculate the similarities between the images. Our experimental results show that the image matrices of malware can effectively be used to classify malware families both statically and dynamically with accuracy of 0.9896 and 0.9732, respectively.
Malware analysis using visualized image matrices.
Han, KyoungSoo; Kang, BooJoong; Im, Eul Gyu
2014-01-01
This paper proposes a novel malware visual analysis method that contains not only a visualization method to convert binary files into images, but also a similarity calculation method between these images. The proposed method generates RGB-colored pixels on image matrices using the opcode sequences extracted from malware samples and calculates the similarities for the image matrices. Particularly, our proposed methods are available for packed malware samples by applying them to the execution traces extracted through dynamic analysis. When the images are generated, we can reduce the overheads by extracting the opcode sequences only from the blocks that include the instructions related to staple behaviors such as functions and application programming interface (API) calls. In addition, we propose a technique that generates a representative image for each malware family in order to reduce the number of comparisons for the classification of unknown samples and the colored pixel information in the image matrices is used to calculate the similarities between the images. Our experimental results show that the image matrices of malware can effectively be used to classify malware families both statically and dynamically with accuracy of 0.9896 and 0.9732, respectively.
Introduction to matrices and vectors
Schwartz, Jacob T
2001-01-01
In this concise undergraduate text, the first three chapters present the basics of matrices - in later chapters the author shows how to use vectors and matrices to solve systems of linear equations. 1961 edition.
... News Physician Resources Professions Site Index A-Z Nerve Blocks A nerve block is an injection to ... the limitations of Nerve Block? What is a Nerve Block? A nerve block is an anesthetic and/ ...
Bapat, Ravindra B
2014-01-01
This new edition illustrates the power of linear algebra in the study of graphs. The emphasis on matrix techniques is greater than in other texts on algebraic graph theory. Important matrices associated with graphs (for example, incidence, adjacency and Laplacian matrices) are treated in detail. Presenting a useful overview of selected topics in algebraic graph theory, early chapters of the text focus on regular graphs, algebraic connectivity, the distance matrix of a tree, and its generalized version for arbitrary graphs, known as the resistance matrix. Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive definite completion problem and matrix games based on a graph. Such an extensive coverage of the subject area provides a welcome prompt for further exploration. The inclusion of exercises enables practical learning throughout the book. In the new edition, a new chapter is added on the line graph of a tree, while some results in Chapter 6 on Perron-Frobenius theory are reo...
Hierarchical quark mass matrices
International Nuclear Information System (INIS)
Rasin, A.
1998-02-01
I define a set of conditions that the most general hierarchical Yukawa mass matrices have to satisfy so that the leading rotations in the diagonalization matrix are a pair of (2,3) and (1,2) rotations. In addition to Fritzsch structures, examples of such hierarchical structures include also matrices with (1,3) elements of the same order or even much larger than the (1,2) elements. Such matrices can be obtained in the framework of a flavor theory. To leading order, the values of the angle in the (2,3) plane (s 23 ) and the angle in the (1,2) plane (s 12 ) do not depend on the order in which they are taken when diagonalizing. We find that any of the Cabbibo-Kobayashi-Maskawa matrix parametrizations that consist of at least one (1,2) and one (2,3) rotation may be suitable. In the particular case when the s 13 diagonalization angles are sufficiently small compared to the product s 12 s 23 , two special CKM parametrizations emerge: the R 12 R 23 R 12 parametrization follows with s 23 taken before the s 12 rotation, and vice versa for the R 23 R 12 R 23 parametrization. (author)
M Wedderburn, J H
1934-01-01
It is the organization and presentation of the material, however, which make the peculiar appeal of the book. This is no mere compendium of results-the subject has been completely reworked and the proofs recast with the skill and elegance which come only from years of devotion. -Bulletin of the American Mathematical Society The very clear and simple presentation gives the reader easy access to the more difficult parts of the theory. -Jahrbuch über die Fortschritte der Mathematik In 1937, the theory of matrices was seventy-five years old. However, many results had only recently evolved from sp
Schneider, Hans
1989-01-01
Linear algebra is one of the central disciplines in mathematics. A student of pure mathematics must know linear algebra if he is to continue with modern algebra or functional analysis. Much of the mathematics now taught to engineers and physicists requires it.This well-known and highly regarded text makes the subject accessible to undergraduates with little mathematical experience. Written mainly for students in physics, engineering, economics, and other fields outside mathematics, the book gives the theory of matrices and applications to systems of linear equations, as well as many related t
Intermittency and random matrices
Sokoloff, Dmitry; Illarionov, E. A.
2015-08-01
A spectacular phenomenon of intermittency, i.e. a progressive growth of higher statistical moments of a physical field excited by an instability in a random medium, attracted the attention of Zeldovich in the last years of his life. At that time, the mathematical aspects underlying the physical description of this phenomenon were still under development and relations between various findings in the field remained obscure. Contemporary results from the theory of the product of independent random matrices (the Furstenberg theory) allowed the elaboration of the phenomenon of intermittency in a systematic way. We consider applications of the Furstenberg theory to some problems in cosmology and dynamo theory.
Dimension from covariance matrices.
Carroll, T L; Byers, J M
2017-02-01
We describe a method to estimate embedding dimension from a time series. This method includes an estimate of the probability that the dimension estimate is valid. Such validity estimates are not common in algorithms for calculating the properties of dynamical systems. The algorithm described here compares the eigenvalues of covariance matrices created from an embedded signal to the eigenvalues for a covariance matrix of a Gaussian random process with the same dimension and number of points. A statistical test gives the probability that the eigenvalues for the embedded signal did not come from the Gaussian random process.
Self-orthogonal codes from some bush-type Hadamard matrices ...
African Journals Online (AJOL)
By means of a construction method outlined by Harada and Tonchev, we determine some non-binary self-orthogonal codes obtained from the row span of orbit matrices of Bush-type Hadamard matrices that admit a xed-point-free and xed-block-free automorphism of prime order. We show that the code [20; 15; 4]5 obtained ...
Generalisations of Fisher Matrices
Directory of Open Access Journals (Sweden)
Alan Heavens
2016-06-01
Full Text Available Fisher matrices play an important role in experimental design and in data analysis. Their primary role is to make predictions for the inference of model parameters—both their errors and covariances. In this short review, I outline a number of extensions to the simple Fisher matrix formalism, covering a number of recent developments in the field. These are: (a situations where the data (in the form of ( x , y pairs have errors in both x and y; (b modifications to parameter inference in the presence of systematic errors, or through fixing the values of some model parameters; (c Derivative Approximation for LIkelihoods (DALI - higher-order expansions of the likelihood surface, going beyond the Gaussian shape approximation; (d extensions of the Fisher-like formalism, to treat model selection problems with Bayesian evidence.
Energy Technology Data Exchange (ETDEWEB)
Fukuma, Masafumi; Sugishita, Sotaro; Umeda, Naoya [Department of Physics, Kyoto University,Kitashirakawa Oiwake-cho, Kyoto 606-8502 (Japan)
2015-07-17
We propose a class of models which generate three-dimensional random volumes, where each configuration consists of triangles glued together along multiple hinges. The models have matrices as the dynamical variables and are characterized by semisimple associative algebras A. Although most of the diagrams represent configurations which are not manifolds, we show that the set of possible diagrams can be drastically reduced such that only (and all of the) three-dimensional manifolds with tetrahedral decompositions appear, by introducing a color structure and taking an appropriate large N limit. We examine the analytic properties when A is a matrix ring or a group ring, and show that the models with matrix ring have a novel strong-weak duality which interchanges the roles of triangles and hinges. We also give a brief comment on the relationship of our models with the colored tensor models.
Diagonalization of the mass matrices
International Nuclear Information System (INIS)
Rhee, S.S.
1984-01-01
It is possible to make 20 types of 3x3 mass matrices which are hermitian. We have obtained unitary matrices which could diagonalize each mass matrix. Since the three elements of mass matrix can be expressed in terms of the three eigenvalues, msub(i), we can also express the unitary matrix in terms of msub(i). (Author)
Enhancing Understanding of Transformation Matrices
Dick, Jonathan; Childrey, Maria
2012-01-01
With the Common Core State Standards' emphasis on transformations, teachers need a variety of approaches to increase student understanding. Teaching matrix transformations by focusing on row vectors gives students tools to create matrices to perform transformations. This empowerment opens many doors: Students are able to create the matrices for…
Hierarchical matrices algorithms and analysis
Hackbusch, Wolfgang
2015-01-01
This self-contained monograph presents matrix algorithms and their analysis. The new technique enables not only the solution of linear systems but also the approximation of matrix functions, e.g., the matrix exponential. Other applications include the solution of matrix equations, e.g., the Lyapunov or Riccati equation. The required mathematical background can be found in the appendix. The numerical treatment of fully populated large-scale matrices is usually rather costly. However, the technique of hierarchical matrices makes it possible to store matrices and to perform matrix operations approximately with almost linear cost and a controllable degree of approximation error. For important classes of matrices, the computational cost increases only logarithmically with the approximation error. The operations provided include the matrix inversion and LU decomposition. Since large-scale linear algebra problems are standard in scientific computing, the subject of hierarchical matrices is of interest to scientists ...
Intrinsic character of Stokes matrices
Gagnon, Jean-François; Rousseau, Christiane
2017-02-01
Two germs of linear analytic differential systems x k + 1Y‧ = A (x) Y with a non-resonant irregular singularity are analytically equivalent if and only if they have the same eigenvalues and equivalent collections of Stokes matrices. The Stokes matrices are the transition matrices between sectors on which the system is analytically equivalent to its formal normal form. Each sector contains exactly one separating ray for each pair of eigenvalues. A rotation in S allows supposing that R+ lies in the intersection of two sectors. Reordering of the coordinates of Y allows ordering the real parts of the eigenvalues, thus yielding triangular Stokes matrices. However, the choice of the rotation in x is not canonical. In this paper we establish how the collection of Stokes matrices depends on this rotation, and hence on a chosen order of the projection of the eigenvalues on a line through the origin.
Accelerating Matrix-Vector Multiplication on Hierarchical Matrices Using Graphical Processing Units
Boukaram, W.
2015-03-25
Large dense matrices arise from the discretization of many physical phenomena in computational sciences. In statistics very large dense covariance matrices are used for describing random fields and processes. One can, for instance, describe distribution of dust particles in the atmosphere, concentration of mineral resources in the earth\\'s crust or uncertain permeability coefficient in reservoir modeling. When the problem size grows, storing and computing with the full dense matrix becomes prohibitively expensive both in terms of computational complexity and physical memory requirements. Fortunately, these matrices can often be approximated by a class of data sparse matrices called hierarchical matrices (H-matrices) where various sub-blocks of the matrix are approximated by low rank matrices. These matrices can be stored in memory that grows linearly with the problem size. In addition, arithmetic operations on these H-matrices, such as matrix-vector multiplication, can be completed in almost linear time. Originally the H-matrix technique was developed for the approximation of stiffness matrices coming from partial differential and integral equations. Parallelizing these arithmetic operations on the GPU has been the focus of this work and we will present work done on the matrix vector operation on the GPU using the KSPARSE library.
Physical properties of the Schur complement of local covariance matrices
International Nuclear Information System (INIS)
Haruna, L F; Oliveira, M C de
2007-01-01
General properties of global covariance matrices representing bipartite Gaussian states can be decomposed into properties of local covariance matrices and their Schur complements. We demonstrate that given a bipartite Gaussian state ρ 12 described by a 4 x 4 covariance matrix V, the Schur complement of a local covariance submatrix V 1 of it can be interpreted as a new covariance matrix representing a Gaussian operator of party 1 conditioned to local parity measurements on party 2. The connection with a partial parity measurement over a bipartite quantum state and the determination of the reduced Wigner function is given and an operational process of parity measurement is developed. Generalization of this procedure to an n-partite Gaussian state is given, and it is demonstrated that the n - 1 system state conditioned to a partial parity projection is given by a covariance matrix such that its 2 x 2 block elements are Schur complements of special local matrices
The invariant theory of matrices
Concini, Corrado De
2017-01-01
This book gives a unified, complete, and self-contained exposition of the main algebraic theorems of invariant theory for matrices in a characteristic free approach. More precisely, it contains the description of polynomial functions in several variables on the set of m\\times m matrices with coefficients in an infinite field or even the ring of integers, invariant under simultaneous conjugation. Following Hermann Weyl's classical approach, the ring of invariants is described by formulating and proving the first fundamental theorem that describes a set of generators in the ring of invariants, and the second fundamental theorem that describes relations between these generators. The authors study both the case of matrices over a field of characteristic 0 and the case of matrices over a field of positive characteristic. While the case of characteristic 0 can be treated following a classical approach, the case of positive characteristic (developed by Donkin and Zubkov) is much harder. A presentation of this case...
Quantum matrices in two dimensions
International Nuclear Information System (INIS)
Ewen, H.; Ogievetsky, O.; Wess, J.
1991-01-01
Quantum matrices in two-dimensions, admitting left and right quantum spaces, are classified: they fall into two families, the 2-parametric family GL p,q (2) and a 1-parametric family GL α J (2). Phenomena previously found for GL p,q (2) hold in this general situation: (a) powers of quantum matrices are again quantum and (b) entries of the logarithm of a two-dimensional quantum matrix form a Lie algebra. (orig.)
Manin matrices and Talalaev's formula
International Nuclear Information System (INIS)
Chervov, A; Falqui, G
2008-01-01
In this paper we study properties of Lax and transfer matrices associated with quantum integrable systems. Our point of view stems from the fact that their elements satisfy special commutation properties, considered by Yu I Manin some 20 years ago at the beginning of quantum group theory. These are the commutation properties of matrix elements of linear homomorphisms between polynomial rings; more explicitly these read: (1) elements of the same column commute; (2) commutators of the cross terms are equal: [M ij , M kl ] [M kj , M il ] (e.g. [M 11 , M 22 ] = [M 21 , M 12 ]). The main aim of this paper is twofold: on the one hand we observe and prove that such matrices (which we call Manin matrices in short) behave almost as well as matrices with commutative elements. Namely, the theorems of linear algebra (e.g., a natural definition of the determinant, the Cayley-Hamilton theorem, the Newton identities and so on and so forth) have a straightforward counterpart in the case of Manin matrices. On the other hand, we remark that such matrices are somewhat ubiquitous in the theory of quantum integrability. For instance, Manin matrices (and their q-analogs) include matrices satisfying the Yang-Baxter relation 'RTT=TTR' and the so-called Cartier-Foata matrices. Also, they enter Talalaev's remarkable formulae: det(∂ z -L gaudin (z)), det(1-e -∂z T Yangian (z)) for the 'quantum spectral curve', and appear in the separation of variables problem and Capelli identities. We show that theorems of linear algebra, after being established for such matrices, have various applications to quantum integrable systems and Lie algebras, e.g. in the construction of new generators in Z(U crit (gl-hat n )) (and, in general, in the construction of quantum conservation laws), in the Knizhnik-Zamolodchikov equation, and in the problem of Wick ordering. We propose, in the appendix, a construction of quantum separated variables for the XXX-Heisenberg system
Higher dimensional unitary braid matrices: Construction, associated structures and entanglements
International Nuclear Information System (INIS)
Abdesselam, B.; Chakrabarti, A.; Dobrev, V.K.; Mihov, S.G.
2007-03-01
We construct (2n) 2 x (2n) 2 unitary braid matrices R-circumflex for n ≥ 2 generalizing the class known for n = 1. A set of (2n) x (2n) matrices (I, J,K,L) are defined. R-circumflex is expressed in terms of their tensor products (such as K x J), leading to a canonical formulation for all n. Complex projectors P ± provide a basis for our real, unitary R-circumflex. Baxterization is obtained. Diagonalizations and block- diagonalizations are presented. The loss of braid property when R-circumflex (n > 1) is block-diagonalized in terms of R-circumflex (n = 1) is pointed out and explained. For odd dimension (2n + 1) 2 x (2n + 1) 2 , a previously constructed braid matrix is complexified to obtain unitarity. R-circumflexLL- and R-circumflexTT- algebras, chain Hamiltonians, potentials for factorizable S-matrices, complex non-commutative spaces are all studied briefly in the context of our unitary braid matrices. Turaev construction of link invariants is formulated for our case. We conclude with comments concerning entanglements. (author)
On reflectionless equi-transmitting matrices
Directory of Open Access Journals (Sweden)
Pavel Kurasov
2014-01-01
Full Text Available Reflectionless equi-transmitting unitary matrices are studied in connection to matching conditions in quantum graphs. All possible such matrices of size 6 are described explicitly. It is shown that such matrices form 30 six-parameter families intersected along 12 five-parameter families closely connected to conference matrices.
Stabilization and solidification of Pb in cement matrices
International Nuclear Information System (INIS)
Gollmann, Maria A.C.; Silva, Marcia M. da; Santos, Joao H. Z. dos; Masuero, Angela B.
2010-01-01
Pb was incorporated to a series of cement matrices, which were submitted to different cure time and pH. Pb content leached to aqueous solution was monitored by atomic absorption spectroscopy. The block resistance was evaluated by unconfined compressive strength at 7 and 28 ages. Data are discussed in terms of metal mobility along the cement block monitored by X-ray fluorescence (XRF) spectrometry. The Pb incorporated matrices have shown that a long cure time is more suitable for avoiding metal leaching. For a longer cure period the action of the metal is higher and there is a decreasing in the compressive strength. The XRF analyses show that there is a lower Ca concentration in the matrix in which Pb was added. (author)
... page: //medlineplus.gov/ency/patientinstructions/000484.htm Epidural block - pregnancy To use the sharing features on this page, please enable JavaScript. An epidural block is a numbing medicine given by injection (shot) ...
Spectra of sparse random matrices
International Nuclear Information System (INIS)
Kuehn, Reimer
2008-01-01
We compute the spectral density for ensembles of sparse symmetric random matrices using replica. Our formulation of the replica-symmetric ansatz shares the symmetries of that suggested in a seminal paper by Rodgers and Bray (symmetry with respect to permutation of replica and rotation symmetry in the space of replica), but uses a different representation in terms of superpositions of Gaussians. It gives rise to a pair of integral equations which can be solved by a stochastic population-dynamics algorithm. Remarkably our representation allows us to identify pure-point contributions to the spectral density related to the existence of normalizable eigenstates. Our approach is not restricted to matrices defined on graphs with Poissonian degree distribution. Matrices defined on regular random graphs or on scale-free graphs, are easily handled. We also look at matrices with row constraints such as discrete graph Laplacians. Our approach naturally allows us to unfold the total density of states into contributions coming from vertices of different local coordinations and an example of such an unfolding is presented. Our results are well corroborated by numerical diagonalization studies of large finite random matrices
Linear algebra and matrices topics for a second course
Shapiro, Helene
2015-01-01
Linear algebra and matrix theory are fundamental tools for almost every area of mathematics, both pure and applied. This book combines coverage of core topics with an introduction to some areas in which linear algebra plays a key role, for example, block designs, directed graphs, error correcting codes, and linear dynamical systems. Notable features include a discussion of the Weyr characteristic and Weyr canonical forms, and their relationship to the better-known Jordan canonical form; the use of block cyclic matrices and directed graphs to prove Frobenius's theorem on the structure of the eigenvalues of a nonnegative, irreducible matrix; and the inclusion of such combinatorial topics as BIBDs, Hadamard matrices, and strongly regular graphs. Also included are McCoy's theorem about matrices with property P, the Bruck-Ryser-Chowla theorem on the existence of block designs, and an introduction to Markov chains. This book is intended for those who are familiar with the linear algebra covered in a typical first c...
Smith, Martin H.
1992-01-01
Describes an educational game called "Population Blocks" that is designed to illustrate the concept of exponential growth of the human population and some potential effects of overpopulation. The game material consists of wooden blocks; 18 blocks are painted green (representing land), 7 are painted blue (representing water); and the remaining…
Wilson loop invariants from WN conformal blocks
Directory of Open Access Journals (Sweden)
Oleg Alekseev
2015-12-01
Full Text Available Knot and link polynomials are topological invariants calculated from the expectation value of loop operators in topological field theories. In 3D Chern–Simons theory, these invariants can be found from crossing and braiding matrices of four-point conformal blocks of the boundary 2D CFT. We calculate crossing and braiding matrices for WN conformal blocks with one component in the fundamental representation and another component in a rectangular representation of SU(N, which can be used to obtain HOMFLY knot and link invariants for these cases. We also discuss how our approach can be generalized to invariants in higher-representations of WN algebra.
Free probability and random matrices
Mingo, James A
2017-01-01
This volume opens the world of free probability to a wide variety of readers. From its roots in the theory of operator algebras, free probability has intertwined with non-crossing partitions, random matrices, applications in wireless communications, representation theory of large groups, quantum groups, the invariant subspace problem, large deviations, subfactors, and beyond. This book puts a special emphasis on the relation of free probability to random matrices, but also touches upon the operator algebraic, combinatorial, and analytic aspects of the theory. The book serves as a combination textbook/research monograph, with self-contained chapters, exercises scattered throughout the text, and coverage of important ongoing progress of the theory. It will appeal to graduate students and all mathematicians interested in random matrices and free probability from the point of view of operator algebras, combinatorics, analytic functions, or applications in engineering and statistical physics.
Chequered surfaces and complex matrices
International Nuclear Information System (INIS)
Morris, T.R.; Southampton Univ.
1991-01-01
We investigate a large-N matrix model involving general complex matrices. It can be reinterpreted as a model of two hermitian matrices with specific couplings, and as a model of positive definite hermitian matrices. Large-N perturbation theory generates dynamical triangulations in which the triangles can be chequered (i.e. coloured so that neighbours are opposite colours). On a sphere there is a simple relation between such triangulations and those generated by the single hermitian matrix model. For the torus (and a quartic potential) we solve the counting problem for the number of triangulations that cannot be quechered. The critical physics of chequered triangulations is the same as that of the hermitian matrix model. We show this explicitly by solving non-perturbatively pure two-dimensional ''chequered'' gravity. The interpretative framework given here applies to a number of other generalisations of the hermitian matrix model. (orig.)
Loop diagrams without γ matrices
International Nuclear Information System (INIS)
McKeon, D.G.C.; Rebhan, A.
1993-01-01
By using a quantum-mechanical path integral to compute matrix elements of the form left-angle x|exp(-iHt)|y right-angle, radiative corrections in quantum-field theory can be evaluated without encountering loop-momentum integrals. In this paper we demonstrate how Dirac γ matrices that occur in the proper-time ''Hamiltonian'' H lead to the introduction of a quantum-mechanical path integral corresponding to a superparticle analogous to one proposed recently by Fradkin and Gitman. Direct evaluation of this path integral circumvents many of the usual algebraic manipulations of γ matrices in the computation of quantum-field-theoretical Green's functions involving fermions
Immanant Conversion on Symmetric Matrices
Directory of Open Access Journals (Sweden)
Purificação Coelho M.
2014-01-01
Full Text Available Letr Σn(C denote the space of all n χ n symmetric matrices over the complex field C. The main objective of this paper is to prove that the maps Φ : Σn(C -> Σn (C satisfying for any fixed irre- ducible characters X, X' -SC the condition dx(A +aB = dχ·(Φ(Α + αΦ(Β for all matrices A,В ε Σ„(С and all scalars a ε C are automatically linear and bijective. As a corollary of the above result we characterize all such maps Φ acting on ΣИ(С.
Parallelization of mathematical library for generalized eigenvalue problem for real band matrices
International Nuclear Information System (INIS)
Tanaka, Yasuhisa.
1997-05-01
This research has focused on a parallelization of the mathematical library for a generalized eigenvalue problem for real band matrices on IBM SP and Hitachi SR2201. The origin of the library is LASO (Lanczos Algorithm with Selective Orthogonalization), which was developed on the basis of Block Lanczos method for standard eigenvalue problem for real band matrices at Texas University. We adopted D.O.F. (Degree Of Freedom) decomposition method for a parallelization of this library, and evaluated its parallel performance. (author)
On families of anticommuting matrices
Czech Academy of Sciences Publication Activity Database
Hrubeš, Pavel
2016-01-01
Roč. 493, March 15 (2016), s. 494-507 ISSN 0024-3795 EU Projects: European Commission(XE) 339691 - FEALORA Institutional support: RVO:67985840 Keywords : anticommuting matrices * sum-of-squares formulas Subject RIV: BA - General Mathematics Impact factor: 0.973, year: 2016 http://www.sciencedirect.com/science/article/pii/S0024379515007296
On families of anticommuting matrices
Czech Academy of Sciences Publication Activity Database
Hrubeš, Pavel
2016-01-01
Roč. 493, March 15 (2016), s. 494-507 ISSN 0024-3795 EU Projects: European Commission(XE) 339691 - FEALORA Institutional support: RVO:67985840 Keywords : anticommuting matrices * sum -of-squares formulas Subject RIV: BA - General Mathematics Impact factor: 0.973, year: 2016 http://www.sciencedirect.com/science/article/pii/S0024379515007296
The modified Gauss diagonalization of polynomial matrices
International Nuclear Information System (INIS)
Saeed, K.
1982-10-01
The Gauss algorithm for diagonalization of constant matrices is modified for application to polynomial matrices. Due to this modification the diagonal elements become pure polynomials rather than rational functions. (author)
Double stochastic matrices in quantum mechanics
International Nuclear Information System (INIS)
Louck, J.D.
1997-01-01
The general set of doubly stochastic matrices of order n corresponding to ordinary nonrelativistic quantum mechanical transition probability matrices is given. Lande's discussion of the nonquantal origin of such matrices is noted. Several concrete examples are presented for elementary and composite angular momentum systems with the focus on the unitary symmetry associated with such systems in the spirit of the recent work of Bohr and Ulfbeck. Birkhoff's theorem on doubly stochastic matrices of order n is reformulated in a geometrical language suitable for application to the subset of quantum mechanical doubly stochastic matrices. Specifically, it is shown that the set of points on the unit sphere in cartesian n'-space is subjective with the set of doubly stochastic matrices of order n. The question is raised, but not answered, as to what is the subset of points of this unit sphere that correspond to the quantum mechanical transition probability matrices, and what is the symmetry group of this subset of matrices
Virial expansion for almost diagonal random matrices
Yevtushenko, Oleg; Kravtsov, Vladimir E.
2003-08-01
Energy level statistics of Hermitian random matrices hat H with Gaussian independent random entries Higeqj is studied for a generic ensemble of almost diagonal random matrices with langle|Hii|2rangle ~ 1 and langle|Hi\
Viscous hydrophilic injection matrices for serial crystallography
Directory of Open Access Journals (Sweden)
Gabriela Kovácsová
2017-07-01
Full Text Available Serial (femtosecond crystallography at synchrotron and X-ray free-electron laser (XFEL sources distributes the absorbed radiation dose over all crystals used for data collection and therefore allows measurement of radiation damage prone systems, including the use of microcrystals for room-temperature measurements. Serial crystallography relies on fast and efficient exchange of crystals upon X-ray exposure, which can be achieved using a variety of methods, including various injection techniques. The latter vary significantly in their flow rates – gas dynamic virtual nozzle based injectors provide very thin fast-flowing jets, whereas high-viscosity extrusion injectors produce much thicker streams with flow rates two to three orders of magnitude lower. High-viscosity extrusion results in much lower sample consumption, as its sample delivery speed is commensurate both with typical XFEL repetition rates and with data acquisition rates at synchrotron sources. An obvious viscous injection medium is lipidic cubic phase (LCP as it is used for in meso membrane protein crystallization. However, LCP has limited compatibility with many crystallization conditions. While a few other viscous media have been described in the literature, there is an ongoing need to identify additional injection media for crystal embedding. Critical attributes are reliable injection properties and a broad chemical compatibility to accommodate samples as heterogeneous and sensitive as protein crystals. Here, the use of two novel hydrogels as viscous injection matrices is described, namely sodium carboxymethyl cellulose and the thermo-reversible block polymer Pluronic F-127. Both are compatible with various crystallization conditions and yield acceptable X-ray background. The stability and velocity of the extruded stream were also analysed and the dependence of the stream velocity on the flow rate was measured. In contrast with previously characterized injection media, both new
Phenomenological mass matrices with a democratic warp
International Nuclear Information System (INIS)
Kleppe, A.
2018-01-01
Taking into account all available data on the mass sector, we obtain unitary rotation matrices that diagonalize the quark matrices by using a specific parametrization of the Cabibbo-Kobayashi-Maskawa mixing matrix. In this way, we find mass matrices for the up- and down-quark sectors of a specific, symmetric form, with traces of a democratic texture.
International Nuclear Information System (INIS)
Bombardelli, Diego
2016-01-01
In these notes we review the S-matrix theory in (1+1)-dimensional integrable models, focusing mainly on the relativistic case. Once the main definitions and physical properties are introduced, we discuss the factorization of scattering processes due to integrability. We then focus on the analytic properties of the two-particle scattering amplitude and illustrate the derivation of the S-matrices for all the possible bound states using the so-called bootstrap principle. General algebraic structures underlying the S-matrix theory and its relation with the form factors axioms are briefly mentioned. Finally, we discuss the S-matrices of sine-Gordon and SU (2), SU (3) chiral Gross–Neveu models. (topical review)
Synthesised standards in natural matrices
International Nuclear Information System (INIS)
Olsen, D.G.
1980-01-01
The problem of securing the most reliable standards for the accurate analysis of radionuclides is discussed in the paper and in the comment on the paper. It is contended in the paper that the best standards can be created by quantitative addition of accurately known spiking solutions into carefully selected natural matrices. On the other hand it is argued that many natural materials can be successfully standardized for numerous trace constituents. Both points of view are supported with examples. (U.K.)
International Nuclear Information System (INIS)
Bezak, A.
1987-01-01
A diagram is given of a detection block used for monitoring burnup of nuclear reactor fuel. A shielding block is an important part of the detection block. It stabilizes the fuel assembly in the fixing hole in front of a collimator where a suitable gamma beam is defined for gamma spectrometry determination of fuel burnup. The detector case and a neutron source case are placed on opposite sides of the fixing hole. For neutron measurement for which the water in the tank is used as a moderator, the neutron detector-fuel assembly configuration is selected such that neutrons from spontaneous fission and neutrons induced with the neutron source can both be measured. The patented design of the detection block permits longitudinal travel and rotation of the fuel assembly to any position, and thus more reliable determination of nuclear fuel burnup. (E.S.). 1 fig
Sparse Matrices in Frame Theory
DEFF Research Database (Denmark)
Lemvig, Jakob; Krahmer, Felix; Kutyniok, Gitta
2014-01-01
Frame theory is closely intertwined with signal processing through a canon of methodologies for the analysis of signals using (redundant) linear measurements. The canonical dual frame associated with a frame provides a means for reconstruction by a least squares approach, but other dual frames...... yield alternative reconstruction procedures. The novel paradigm of sparsity has recently entered the area of frame theory in various ways. Of those different sparsity perspectives, we will focus on the situations where frames and (not necessarily canonical) dual frames can be written as sparse matrices...
The Inverse of Banded Matrices
2013-01-01
indexed entries all zeros. In this paper, generalizing a method of Mallik (1999) [5], we give the LU factorization and the inverse of the matrix Br,n (if it...r ≤ i ≤ r, 1 ≤ j ≤ r, with the remaining un-indexed entries all zeros. In this paper generalizing a method of Mallik (1999) [5...matrices and applications to piecewise cubic approximation, J. Comput. Appl. Math. 8 (4) (1982) 285–288. [5] R.K. Mallik , The inverse of a lower
Transfer matrices for multilayer structures
International Nuclear Information System (INIS)
Baquero, R.
1988-08-01
We consider four of the transfer matrices defined to deal with multilayer structures. We deduce algorithms to calculate them numerically, in a simple and neat way. We illustrate their application to semi-infinite systems using SGFM formulae. These algorithms are of fast convergence and allow a calculation of bulk-, surface- and inner-layers band structure in good agreement with much more sophisticated calculations. Supermatrices, interfaces and multilayer structures can be calculated in this way with a small computational effort. (author). 10 refs
Orthogonal polynomials and random matrices
Deift, Percy
2000-01-01
This volume expands on a set of lectures held at the Courant Institute on Riemann-Hilbert problems, orthogonal polynomials, and random matrix theory. The goal of the course was to prove universality for a variety of statistical quantities arising in the theory of random matrix models. The central question was the following: Why do very general ensembles of random n {\\times} n matrices exhibit universal behavior as n {\\rightarrow} {\\infty}? The main ingredient in the proof is the steepest descent method for oscillatory Riemann-Hilbert problems.
A hybrid method for the parallel computation of Green’s functions
DEFF Research Database (Denmark)
Petersen, Dan Erik; Li, Song; Stokbro, Kurt
2009-01-01
Quantum transport models for nanodevices using the non-equilibrium Green’s function method require the repeated calculation of the block tridiagonal part of the Green’s and lesser Green’s function matrices. This problem is related to the calculation of the inverse of a sparse matrix. Because of t...
Hypercyclic Abelian Semigroups of Matrices on Cn
International Nuclear Information System (INIS)
Ayadi, Adlene; Marzougui, Habib
2010-07-01
We give a complete characterization of existence of dense orbit for any abelian semigroup of matrices on C n . For finitely generated semigroups, this characterization is explicit and is used to determine the minimal number of matrices in normal form over C which forms a hypercyclic abelian semigroup on C n . In particular, we show that no abelian semigroup generated by n matrices on C n can be hypercyclic. (author)
Directory of Open Access Journals (Sweden)
2011-02-01
Full Text Available A comparative study on the self-assembled nanostructured morphology and the rheological and mechanical properties of four different triblock copolymers, based on poly(styrene-block-diene-block-styrene and poly(styrene-block-diene-block-styrene matrices, and of their respective nanocomposites with 1 wt% silver nanoparticles, is reported in this work. In order to obtain well-dispersed nanoparticles in the block copolymer matrix, dodecanethiol was used as surfactant, showing good affinity with both nanoparticles and the polystyrene phase of the matrices as predicted by the solubility parameters calculated based on Hoftyzer and Van Krevelen theory. The block copolymer with the highest PS content shows the highest tensile modulus and tensile strength, but also the smallest elongation at break. When silver nanoparticles treated with surfactant were added to the block copolymer matrices, each system studied shows higher mechanical properties due to the good dispersion and the good interface of Ag nanoparticles in the matrices. Furthermore, it has been shown that semiempirical models such as Guth and Gold equation and Halpin-Tsai model can be used to predict the tensile modulus of the analyzed nanocomposites.
Lambda-matrices and vibrating systems
Lancaster, Peter; Stark, M; Kahane, J P
1966-01-01
Lambda-Matrices and Vibrating Systems presents aspects and solutions to problems concerned with linear vibrating systems with a finite degrees of freedom and the theory of matrices. The book discusses some parts of the theory of matrices that will account for the solutions of the problems. The text starts with an outline of matrix theory, and some theorems are proved. The Jordan canonical form is also applied to understand the structure of square matrices. Classical theorems are discussed further by applying the Jordan canonical form, the Rayleigh quotient, and simple matrix pencils with late
Pathological rate matrices: from primates to pathogens
Directory of Open Access Journals (Sweden)
Knight Rob
2008-12-01
Full Text Available Abstract Background Continuous-time Markov models allow flexible, parametrically succinct descriptions of sequence divergence. Non-reversible forms of these models are more biologically realistic but are challenging to develop. The instantaneous rate matrices defined for these models are typically transformed into substitution probability matrices using a matrix exponentiation algorithm that employs eigendecomposition, but this algorithm has characteristic vulnerabilities that lead to significant errors when a rate matrix possesses certain 'pathological' properties. Here we tested whether pathological rate matrices exist in nature, and consider the suitability of different algorithms to their computation. Results We used concatenated protein coding gene alignments from microbial genomes, primate genomes and independent intron alignments from primate genomes. The Taylor series expansion and eigendecomposition matrix exponentiation algorithms were compared to the less widely employed, but more robust, Padé with scaling and squaring algorithm for nucleotide, dinucleotide, codon and trinucleotide rate matrices. Pathological dinucleotide and trinucleotide matrices were evident in the microbial data set, affecting the eigendecomposition and Taylor algorithms respectively. Even using a conservative estimate of matrix error (occurrence of an invalid probability, both Taylor and eigendecomposition algorithms exhibited substantial error rates: ~100% of all exonic trinucleotide matrices were pathological to the Taylor algorithm while ~10% of codon positions 1 and 2 dinucleotide matrices and intronic trinucleotide matrices, and ~30% of codon matrices were pathological to eigendecomposition. The majority of Taylor algorithm errors derived from occurrence of multiple unobserved states. A small number of negative probabilities were detected from the Pad�� algorithm on trinucleotide matrices that were attributable to machine precision. Although the Pad
Quantum Hilbert matrices and orthogonal polynomials
DEFF Research Database (Denmark)
Andersen, Jørgen Ellegaard; Berg, Christian
2009-01-01
Using the notion of quantum integers associated with a complex number q≠0 , we define the quantum Hilbert matrix and various extensions. They are Hankel matrices corresponding to certain little q -Jacobi polynomials when |q|<1 , and for the special value they are closely related to Hankel matrice...
The construction of factorized S-matrices
International Nuclear Information System (INIS)
Chudnovsky, D.V.
1981-01-01
We study the relationships between factorized S-matrices given as representations of the Zamolodchikov algebra and exactly solvable models constructed using the Baxter method. Several new examples of symmetric and non-symmetric factorized S-matrices are proposed. (orig.)
Skew-adjacency matrices of graphs
Cavers, M.; Cioaba, S.M.; Fallat, S.; Gregory, D.A.; Haemers, W.H.; Kirkland, S.J.; McDonald, J.J.; Tsatsomeros, M.
2012-01-01
The spectra of the skew-adjacency matrices of a graph are considered as a possible way to distinguish adjacency cospectral graphs. This leads to the following topics: graphs whose skew-adjacency matrices are all cospectral; relations between the matchings polynomial of a graph and the characteristic
On Investigating GMRES Convergence using Unitary Matrices
Czech Academy of Sciences Publication Activity Database
Duintjer Tebbens, Jurjen; Meurant, G.; Sadok, H.; Strakoš, Z.
2014-01-01
Roč. 450, 1 June (2014), s. 83-107 ISSN 0024-3795 Grant - others:GA AV ČR(CZ) M100301201; GA MŠk(CZ) LL1202 Institutional support: RVO:67985807 Keywords : GMRES convergence * unitary matrices * unitary spectra * normal matrices * Krylov residual subspace * Schur parameters Subject RIV: BA - General Mathematics Impact factor: 0.939, year: 2014
Exact Inverse Matrices of Fermat and Mersenne Circulant Matrix
Directory of Open Access Journals (Sweden)
Yanpeng Zheng
2015-01-01
Full Text Available The well known circulant matrices are applied to solve networked systems. In this paper, circulant and left circulant matrices with the Fermat and Mersenne numbers are considered. The nonsingularity of these special matrices is discussed. Meanwhile, the exact determinants and inverse matrices of these special matrices are presented.
Universality for 1d Random Band Matrices: Sigma-Model Approximation
Shcherbina, Mariya; Shcherbina, Tatyana
2018-02-01
The paper continues the development of the rigorous supersymmetric transfer matrix approach to the random band matrices started in (J Stat Phys 164:1233-1260, 2016; Commun Math Phys 351:1009-1044, 2017). We consider random Hermitian block band matrices consisting of W× W random Gaussian blocks (parametrized by j,k \\in Λ =[1,n]^d\\cap Z^d ) with a fixed entry's variance J_{jk}=δ _{j,k}W^{-1}+β Δ _{j,k}W^{-2} , β >0 in each block. Taking the limit W→ ∞ with fixed n and β , we derive the sigma-model approximation of the second correlation function similar to Efetov's one. Then, considering the limit β , n→ ∞, we prove that in the dimension d=1 the behaviour of the sigma-model approximation in the bulk of the spectrum, as β ≫ n , is determined by the classical Wigner-Dyson statistics.
Conditioning analysis of block incomplete factorization and its application to elliptic equations
Lu, H.; Axelsson, Owe
1997-01-01
The paper deals with eigenvalue estimates for block incomplete fac- torization methods for symmetric matrices. First, some previous results on upper bounds for the maximum eigenvalue of preconditioned matrices are generalized to each eigenvalue. Second, upper bounds for the maximum eigenvalue of the
Directory of Open Access Journals (Sweden)
J. Baussand
2008-01-01
Full Text Available The adequacy of substitution matrices to model evolutionary relationships between amino acid sequences can be numerically evaluated by checking the mathematical property of triangle inequality for all triplets of residues. By converting substitution scores into distances, one can verify that a direct path between two amino acids is shorter than a path passing through a third amino acid in the amino acid space modeled by the matrix. If the triangle inequality is not verified, the intuition is that the evolutionary signal is not well modeled by the matrix, that the space is locally inconsistent and that the matrix construction was probably based on insufficient biological data. Previous analysis on several substitution matrices revealed that the number of triplets violating the triangle inequality increases with sequence divergence. Here, we compare matrices which are dedicated to the alignment of highly divergent proteins. The triangle inequality is tested on several classical substitution matrices as well as in a pair of “complementary” substitution matrices recording the evolutionary pressures inside and outside hydrophobic blocks in protein sequences. The analysis proves the crucial role of hydrophobic residues in substitution matrices dedicated to the alignment of distantly related proteins.
Community Detection for Correlation Matrices
Directory of Open Access Journals (Sweden)
Mel MacMahon
2015-04-01
Full Text Available A challenging problem in the study of complex systems is that of resolving, without prior information, the emergent, mesoscopic organization determined by groups of units whose dynamical activity is more strongly correlated internally than with the rest of the system. The existing techniques to filter correlations are not explicitly oriented towards identifying such modules and can suffer from an unavoidable information loss. A promising alternative is that of employing community detection techniques developed in network theory. Unfortunately, this approach has focused predominantly on replacing network data with correlation matrices, a procedure that we show to be intrinsically biased because of its inconsistency with the null hypotheses underlying the existing algorithms. Here, we introduce, via a consistent redefinition of null models based on random matrix theory, the appropriate correlation-based counterparts of the most popular community detection techniques. Our methods can filter out both unit-specific noise and system-wide dependencies, and the resulting communities are internally correlated and mutually anticorrelated. We also implement multiresolution and multifrequency approaches revealing hierarchically nested subcommunities with “hard” cores and “soft” peripheries. We apply our techniques to several financial time series and identify mesoscopic groups of stocks which are irreducible to a standard, sectorial taxonomy; detect “soft stocks” that alternate between communities; and discuss implications for portfolio optimization and risk management.
Community Detection for Correlation Matrices
MacMahon, Mel; Garlaschelli, Diego
2015-04-01
A challenging problem in the study of complex systems is that of resolving, without prior information, the emergent, mesoscopic organization determined by groups of units whose dynamical activity is more strongly correlated internally than with the rest of the system. The existing techniques to filter correlations are not explicitly oriented towards identifying such modules and can suffer from an unavoidable information loss. A promising alternative is that of employing community detection techniques developed in network theory. Unfortunately, this approach has focused predominantly on replacing network data with correlation matrices, a procedure that we show to be intrinsically biased because of its inconsistency with the null hypotheses underlying the existing algorithms. Here, we introduce, via a consistent redefinition of null models based on random matrix theory, the appropriate correlation-based counterparts of the most popular community detection techniques. Our methods can filter out both unit-specific noise and system-wide dependencies, and the resulting communities are internally correlated and mutually anticorrelated. We also implement multiresolution and multifrequency approaches revealing hierarchically nested subcommunities with "hard" cores and "soft" peripheries. We apply our techniques to several financial time series and identify mesoscopic groups of stocks which are irreducible to a standard, sectorial taxonomy; detect "soft stocks" that alternate between communities; and discuss implications for portfolio optimization and risk management.
Link Prediction via Convex Nonnegative Matrix Factorization on Multiscale Blocks
Directory of Open Access Journals (Sweden)
Enming Dong
2014-01-01
Full Text Available Low rank matrices approximations have been used in link prediction for networks, which are usually global optimal methods and lack of using the local information. The block structure is a significant local feature of matrices: entities in the same block have similar values, which implies that links are more likely to be found within dense blocks. We use this insight to give a probabilistic latent variable model for finding missing links by convex nonnegative matrix factorization with block detection. The experiments show that this method gives better prediction accuracy than original method alone. Different from the original low rank matrices approximations methods for link prediction, the sparseness of solutions is in accord with the sparse property for most real complex networks. Scaling to massive size network, we use the block information mapping matrices onto distributed architectures and give a divide-and-conquer prediction method. The experiments show that it gives better results than common neighbors method when the networks have a large number of missing links.
Synchronous correlation matrices and Connes’ embedding conjecture
Energy Technology Data Exchange (ETDEWEB)
Dykema, Kenneth J., E-mail: kdykema@math.tamu.edu [Department of Mathematics, Texas A& M University, College Station, Texas 77843-3368 (United States); Paulsen, Vern, E-mail: vern@math.uh.edu [Department of Mathematics, University of Houston, Houston, Texas 77204 (United States)
2016-01-15
In the work of Paulsen et al. [J. Funct. Anal. (in press); preprint arXiv:1407.6918], the concept of synchronous quantum correlation matrices was introduced and these were shown to correspond to traces on certain C*-algebras. In particular, synchronous correlation matrices arose in their study of various versions of quantum chromatic numbers of graphs and other quantum versions of graph theoretic parameters. In this paper, we develop these ideas further, focusing on the relations between synchronous correlation matrices and microstates. We prove that Connes’ embedding conjecture is equivalent to the equality of two families of synchronous quantum correlation matrices. We prove that if Connes’ embedding conjecture has a positive answer, then the tracial rank and projective rank are equal for every graph. We then apply these results to more general non-local games.
Discrete canonical transforms that are Hadamard matrices
International Nuclear Information System (INIS)
Healy, John J; Wolf, Kurt Bernardo
2011-01-01
The group Sp(2,R) of symplectic linear canonical transformations has an integral kernel which has quadratic and linear phases, and which is realized by the geometric paraxial optical model. The discrete counterpart of this model is a finite Hamiltonian system that acts on N-point signals through N x N matrices whose elements also have a constant absolute value, although they do not form a representation of that group. Those matrices that are also unitary are Hadamard matrices. We investigate the manifolds of these N x N matrices under the Sp(2,R) equivalence imposed by the model, and find them to be on two-sided cosets. By means of an algorithm we determine representatives that lead to collections of mutually unbiased bases.
ESTIMATION OF FUNCTIONALS OF SPARSE COVARIANCE MATRICES.
Fan, Jianqing; Rigollet, Philippe; Wang, Weichen
High-dimensional statistical tests often ignore correlations to gain simplicity and stability leading to null distributions that depend on functionals of correlation matrices such as their Frobenius norm and other ℓ r norms. Motivated by the computation of critical values of such tests, we investigate the difficulty of estimation the functionals of sparse correlation matrices. Specifically, we show that simple plug-in procedures based on thresholded estimators of correlation matrices are sparsity-adaptive and minimax optimal over a large class of correlation matrices. Akin to previous results on functional estimation, the minimax rates exhibit an elbow phenomenon. Our results are further illustrated in simulated data as well as an empirical study of data arising in financial econometrics.
Flux Jacobian Matrices For Equilibrium Real Gases
Vinokur, Marcel
1990-01-01
Improved formulation includes generalized Roe average and extension to three dimensions. Flux Jacobian matrices derived for use in numerical solutions of conservation-law differential equations of inviscid flows of ideal gases extended to real gases. Real-gas formulation of these matrices retains simplifying assumptions of thermodynamic and chemical equilibrium, but adds effects of vibrational excitation, dissociation, and ionization of gas molecules via general equation of state.
Supercritical fluid extraction behaviour of polymer matrices
International Nuclear Information System (INIS)
Sujatha, K.; Kumar, R.; Sivaraman, N.; Srinivasan, T.G.; Vasudeva Rao, P.R.
2007-01-01
Organic compounds present in polymeric matrices such as neoprene, surgical gloves and PVC were co-extracted during the removal of uranium using supercritical fluid extraction (SFE) technique. Hence SFE studies of these matrices were carried out to establish the extracted species using HPLC, IR and mass spectrometry techniques. The initial study indicated that uranium present in the extract could be purified from the co-extracted organic species. (author)
Protein matrices for wound dressings =
Vasconcelos, Andreia Joana Costa
Fibrous proteins such as silk fibroin (SF), keratin (K) and elastin (EL) are able to mimic the extracellular matrix (ECM) that allows their recognition under physiological conditions. The impressive mechanical properties, the environmental stability, in combination with their biocompatibility and control of morphology, provide an important basis to use these proteins in biomedical applications like protein-based wound dressings. Along time the concept of wound dressings has changed from the traditional dressings such as honey or natural fibres, used just to protect the wound from external factors, to the interactive dressings of the present. Wounds can be classified in acute that heal in the expected time frame, and chronic, which fail to heal because the orderly sequence of events is disrupted at one or more stages of the healing process. Moreover, chronic wound exudates contain high levels of tissue destructive proteolytic enzymes such as human neutrophil elastase (HNE) that need to be controlled for a proper healing. The aim of this work is to exploit the self-assemble properties of silk fibroin, keratin and elastin for the development of new protein materials to be used as wound dressings: i) evaluation of the blending effect on the physical and chemical properties of the materials; ii) development of materials with different morphologies; iii) assessment of the cytocompatibility of the protein matrices; iv) ultimately, study the ability of the developed protein matrices as wound dressings through the use of human chronic wound exudate; v) use of innovative short peptide sequences that allow to target the control of high levels of HNE found on chronic wounds. Chapter III reports the preparation of silk fibroin/keratin (SF/K) blend films by solvent casting evaporation. Two solvent systems, aqueous and acidic, were used for the preparation of films from fibroin and keratin extracted from the respective silk and wool fibres. The effect of solvent system used was
Continuous tone printing in silicone from CNC milled matrices
Hoskins, S.; McCallion, P.
2014-02-01
Current research at the Centre for Fine Print Research (CFPR) at the University of the West of England, Bristol, is exploring the potential of creating coloured pictorial imagery from a continuous tone relief surface. To create the printing matrices the research team have been using CNC milled images where the height of the relief image is dictated by creating a tone curve and then milling this curve into a series of relief blocks from which the image is cast in a silicone ink. A translucent image is cast from each of the colour matrices and each colour is assembled - one on top of another - resulting is a colour continuous tone print, where colour tone is created by physical depth of colour. This process is a contemporary method of continuous tone colour printing based upon the Nineteenth Century black and white printing process of Woodburytype as developed by Walter Bentley Woodbury in 1865. Woodburytype is the only true continuous tone printing process invented, and although its delicate and subtle surfaces surpassed all other printing methods at the time. The process died out in the late nineteenth century as more expedient and cost effective methods of printing prevailed. New research at CFPR builds upon previous research that combines 19th Century Photomechanical techniques with digital technology to reappraise the potential of these processes.
Analysis of Block OMP using Block RIP
Wang, Jun; Li, Gang; Zhang, Hao; Wang, Xiqin
2011-01-01
Orthogonal matching pursuit (OMP) is a canonical greedy algorithm for sparse signal reconstruction. When the signal of interest is block sparse, i.e., it has nonzero coefficients occurring in clusters, the block version of OMP algorithm (i.e., Block OMP) outperforms the conventional OMP. In this paper, we demonstrate that a new notion of block restricted isometry property (Block RIP), which is less stringent than standard restricted isometry property (RIP), can be used for a very straightforw...
Selection of appropriate conditioning matrices for the safe disposal of radioactive waste
International Nuclear Information System (INIS)
Vance, E.R.
2002-01-01
The selection of appropriate solid conditioning matrices or wasteforms for the safe disposal of radioactive waste is dictated by many factors. The overriding issue is that the matrix incorporating the radionuclides, together with a set of engineered barriers in a near-surface or deep geological repository, should prevent significant groundwater transport of radionuclides to the biosphere. For high-level waste (HLW) from nuclear fuel reprocessing, the favored matrices are glasses, ceramics and glass-ceramics. Borosilicate glasses are presently being used in some countries, but there are strong scientific arguments why ceramics based on assemblages of natural minerals are advantageous for HLW. Much research has been carried out in the last 40 years around the world, and different matrices are more suitable than others for a given waste composition. However a major stumbling block for HLW immobilisation is the mall number of approved geological repositories for such matrices. The most appropriate matrices for Intermediate and low-level wastes are contentious and the selection criteria are not very well defined. The candidate matrices for these latter wastes are cements, bitumen, geopolymers, glasses, glass-ceramics and ceramics. After discussing the pros and cons of various candidate matrices for given kinds of radioactive wastes, the SYNROC research program at ANSTO will be briefly surveyed. Some of the potential applications of this work using a variety of SYNROC derivatives will be given. Finally the basic research program at ANSTO on radioactive waste immobilisation will be summarised. This comprises mainly work on solid state chemistry to understand ionic valences and co-ordinations for the chemical design of wasteforms, aqueous durability to study the pH and temperature dependence of solid-water reactions, radiation damage effects on structure and solid-water reactions. (Author)
MERSENNE AND HADAMARD MATRICES CALCULATION BY SCARPIS METHOD
Directory of Open Access Journals (Sweden)
N. A. Balonin
2014-05-01
Full Text Available Purpose. The paper deals with the problem of basic generalizations of Hadamard matrices associated with maximum determinant matrices or not optimal by determinant matrices with orthogonal columns (weighing matrices, Mersenne and Euler matrices, ets.; calculation methods for the quasi-orthogonal local maximum determinant Mersenne matrices are not studied enough sufficiently. The goal of this paper is to develop the theory of Mersenne and Hadamard matrices on the base of generalized Scarpis method research. Methods. Extreme solutions are found in general by minimization of maximum for absolute values of the elements of studied matrices followed by their subsequent classification according to the quantity of levels and their values depending on orders. Less universal but more effective methods are based on structural invariants of quasi-orthogonal matrices (Silvester, Paley, Scarpis methods, ets.. Results. Generalizations of Hadamard and Belevitch matrices as a family of quasi-orthogonal matrices of odd orders are observed; they include, in particular, two-level Mersenne matrices. Definitions of section and layer on the set of generalized matrices are proposed. Calculation algorithms for matrices of adjacent layers and sections by matrices of lower orders are described. Approximation examples of the Belevitch matrix structures up to 22-nd critical order by Mersenne matrix of the third order are given. New formulation of the modified Scarpis method to approximate Hadamard matrices of high orders by lower order Mersenne matrices is proposed. Williamson method is described by example of one modular level matrices approximation by matrices with a small number of levels. Practical relevance. The efficiency of developing direction for the band-pass filters creation is justified. Algorithms for Mersenne matrices design by Scarpis method are used in developing software of the research program complex. Mersenne filters are based on the suboptimal by
A Brief Historical Introduction to Matrices and Their Applications
Debnath, L.
2014-01-01
This paper deals with the ancient origin of matrices, and the system of linear equations. Included are algebraic properties of matrices, determinants, linear transformations, and Cramer's Rule for solving the system of algebraic equations. Special attention is given to some special matrices, including matrices in graph theory and electrical…
Duality relations between SU(N)k and SU(k)NWZW models and their braid matrices
International Nuclear Information System (INIS)
Naculich, S.G.; Schnitzer, H.J.
1990-01-01
Dual relations are found between the primary fields, correlators, and conformal blocks of SU(N) k and SU(k) N WZW models, which in turn imply dual relations between the braid matrices of the two theories. These results are a consequence of the fact that the spaces of conformal blocks of SU(N) k and SU(k) N correlation functions are dual. (orig.)
Random matrix theory for pseudo-Hermitian systems: Cyclic blocks
Indian Academy of Sciences (India)
We discuss the relevance of random matrix theory for pseudo-Hermitian systems, and, for Hamiltonians that break parity and time-reversal invariance . In an attempt to understand the random Ising model, we present the treatment of cyclic asymmetric matrices with blocks and show that the nearest-neighbour spacing ...
Random matrix theory for pseudo-Hermitian systems: Cyclic blocks
Indian Academy of Sciences (India)
Abstract. We discuss the relevance of random matrix theory for pseudo-Hermitian sys- tems, and, for Hamiltonians that break parity P and time-reversal invariance T. In an attempt to understand the random Ising model, we present the treatment of cyclic asym- metric matrices with blocks and show that the nearest-neighbour ...
Bayesian Nonparametric Clustering for Positive Definite Matrices.
Cherian, Anoop; Morellas, Vassilios; Papanikolopoulos, Nikolaos
2016-05-01
Symmetric Positive Definite (SPD) matrices emerge as data descriptors in several applications of computer vision such as object tracking, texture recognition, and diffusion tensor imaging. Clustering these data matrices forms an integral part of these applications, for which soft-clustering algorithms (K-Means, expectation maximization, etc.) are generally used. As is well-known, these algorithms need the number of clusters to be specified, which is difficult when the dataset scales. To address this issue, we resort to the classical nonparametric Bayesian framework by modeling the data as a mixture model using the Dirichlet process (DP) prior. Since these matrices do not conform to the Euclidean geometry, rather belongs to a curved Riemannian manifold,existing DP models cannot be directly applied. Thus, in this paper, we propose a novel DP mixture model framework for SPD matrices. Using the log-determinant divergence as the underlying dissimilarity measure to compare these matrices, and further using the connection between this measure and the Wishart distribution, we derive a novel DPM model based on the Wishart-Inverse-Wishart conjugate pair. We apply this model to several applications in computer vision. Our experiments demonstrate that our model is scalable to the dataset size and at the same time achieves superior accuracy compared to several state-of-the-art parametric and nonparametric clustering algorithms.
Random matrices and random difference equations
International Nuclear Information System (INIS)
Uppuluri, V.R.R.
1975-01-01
Mathematical models leading to products of random matrices and random difference equations are discussed. A one-compartment model with random behavior is introduced, and it is shown how the average concentration in the discrete time model converges to the exponential function. This is of relevance to understanding how radioactivity gets trapped in bone structure in blood--bone systems. The ideas are then generalized to two-compartment models and mammillary systems, where products of random matrices appear in a natural way. The appearance of products of random matrices in applications in demography and control theory is considered. Then random sequences motivated from the following problems are studied: constant pulsing and random decay models, random pulsing and constant decay models, and random pulsing and random decay models
Quantum Entanglement and Reduced Density Matrices
Purwanto, Agus; Sukamto, Heru; Yuwana, Lila
2018-05-01
We investigate entanglement and separability criteria of multipartite (n-partite) state by examining ranks of its reduced density matrices. Firstly, we construct the general formula to determine the criterion. A rank of origin density matrix always equals one, meanwhile ranks of reduced matrices have various ranks. Next, separability and entanglement criterion of multipartite is determined by calculating ranks of reduced density matrices. In this article we diversify multipartite state criteria into completely entangled state, completely separable state, and compound state, i.e. sub-entangled state and sub-entangledseparable state. Furthermore, we also shorten the calculation proposed by the previous research to determine separability of multipartite state and expand the methods to be able to differ multipartite state based on criteria above.
Forecasting Covariance Matrices: A Mixed Frequency Approach
DEFF Research Database (Denmark)
Halbleib, Roxana; Voev, Valeri
This paper proposes a new method for forecasting covariance matrices of financial returns. The model mixes volatility forecasts from a dynamic model of daily realized volatilities estimated with high-frequency data with correlation forecasts based on daily data. This new approach allows for flexi......This paper proposes a new method for forecasting covariance matrices of financial returns. The model mixes volatility forecasts from a dynamic model of daily realized volatilities estimated with high-frequency data with correlation forecasts based on daily data. This new approach allows...... for flexible dependence patterns for volatilities and correlations, and can be applied to covariance matrices of large dimensions. The separate modeling of volatility and correlation forecasts considerably reduces the estimation and measurement error implied by the joint estimation and modeling of covariance...
Advanced incomplete factorization algorithms for Stiltijes matrices
Energy Technology Data Exchange (ETDEWEB)
Il`in, V.P. [Siberian Division RAS, Novosibirsk (Russian Federation)
1996-12-31
The modern numerical methods for solving the linear algebraic systems Au = f with high order sparse matrices A, which arise in grid approximations of multidimensional boundary value problems, are based mainly on accelerated iterative processes with easily invertible preconditioning matrices presented in the form of approximate (incomplete) factorization of the original matrix A. We consider some recent algorithmic approaches, theoretical foundations, experimental data and open questions for incomplete factorization of Stiltijes matrices which are {open_quotes}the best{close_quotes} ones in the sense that they have the most advanced results. Special attention is given to solving the elliptic differential equations with strongly variable coefficients, singular perturbated diffusion-convection and parabolic equations.
Braiding and fusion properties of the Neveu-Schwarz super-conformal blocks
Chorazkiewicz, Damian; Hadasz, Leszek
2008-01-01
We construct, generalizing appropriately the method applied by J. Teschner in the case of the Virasoro conformal blocks, the braiding and fusion matrices of the Neveu-Schwarz super-conformal blocks. Their properties allow for an explicit verification of the bootstrap equation in the NS sector of the N=1 supersymmetric Liouville field theory.
Braiding and fusion properties of the Neveu-Schwarz super-conformal blocks
International Nuclear Information System (INIS)
Chorazkiewicz, Damian; Hadasz, Leszek
2009-01-01
We construct, generalizing appropriately the method applied by J. Teschner in the case of the Virasoro conformal blocks, the braiding and fusion matrices of the Neveu-Schwarz super-conformal blocks. Their properties allow for an explicit verification of the bootstrap equation in the NS sector of the N = 1 supersymmetric Liouville field theory.
Wishart and anti-Wishart random matrices
International Nuclear Information System (INIS)
Janik, Romuald A; Nowak, Maciej A
2003-01-01
We provide a compact exact representation for the distribution of the matrix elements of the Wishart-type random matrices A † A, for any finite number of rows and columns of A, without any large N approximations. In particular, we treat the case when the Wishart-type random matrix contains redundant, non-random information, which is a new result. This representation is of interest for a procedure for reconstructing the redundant information hidden in Wishart matrices, with potential applications to numerous models based on biological, social and artificial intelligence networks
Topological expansion of the chain of matrices
International Nuclear Information System (INIS)
Eynard, B.; Ferrer, A. Prats
2009-01-01
We solve the loop equations to all orders in 1/N 2 , for the Chain of Matrices matrix model (with possibly an external field coupled to the last matrix of the chain). We show that the topological expansion of the free energy, is, like for the 1 and 2-matrix model, given by the symplectic invariants of [19]. As a consequence, we find the double scaling limit explicitly, and we discuss modular properties, large N asymptotics. We also briefly discuss the limit of an infinite chain of matrices (matrix quantum mechanics).
Partitioning sparse rectangular matrices for parallel processing
Energy Technology Data Exchange (ETDEWEB)
Kolda, T.G.
1998-05-01
The authors are interested in partitioning sparse rectangular matrices for parallel processing. The partitioning problem has been well-studied in the square symmetric case, but the rectangular problem has received very little attention. They will formalize the rectangular matrix partitioning problem and discuss several methods for solving it. They will extend the spectral partitioning method for symmetric matrices to the rectangular case and compare this method to three new methods -- the alternating partitioning method and two hybrid methods. The hybrid methods will be shown to be best.
Institute of Scientific and Technical Information of China (English)
李艳艳
2014-01-01
研究了三对角M矩阵B和三对角M矩阵A的逆矩阵A-1的Hadamard积的最小特征值q(BoA-1)界的估计问题,利用A-1的元素新的上界估计式给出了q(BoA-1)新的估计式.若A=B,得到q(AoA-1)新的估计式.
Ultrasound guided supraclavicular block.
LENUS (Irish Health Repository)
Hanumanthaiah, Deepak
2013-09-01
Ultrasound guided regional anaesthesia is becoming increasingly popular. The supraclavicular block has been transformed by ultrasound guidance into a potentially safe superficial block. We reviewed the techniques of performing supraclavicular block with special focus on ultrasound guidance.
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander; Genton, Marc G.; Sun, Ying
2015-01-01
We approximate large non-structured Matérn covariance matrices of size n×n in the H-matrix format with a log-linear computational cost and storage O(kn log n), where rank k ≪ n is a small integer. Applications are: spatial statistics, machine learning and image analysis, kriging and optimal design.
Theoretical origin of quark mass matrices
International Nuclear Information System (INIS)
Mohapatra, R.N.
1987-01-01
This paper presents the theoretical origin of specific quark mass matrices in the grand unified theories. The author discusses the first natural derivation of the Stech-type mass matrix in unified gauge theories. A solution to the strong CP-problem is provided
Moment matrices, border bases and radical computation
B. Mourrain; J.B. Lasserre; M. Laurent (Monique); P. Rostalski; P. Trebuchet (Philippe)
2013-01-01
htmlabstractIn this paper, we describe new methods to compute the radical (resp. real radical) of an ideal, assuming it complex (resp. real) variety is nte. The aim is to combine approaches for solving a system of polynomial equations with dual methods which involve moment matrices and
Moment matrices, border bases and radical computation
Lasserre, J.B.; Laurent, M.; Mourrain, B.; Rostalski, P.; Trébuchet, P.
2013-01-01
In this paper, we describe new methods to compute the radical (resp. real radical) of an ideal, assuming its complex (resp. real) variety is finite. The aim is to combine approaches for solving a system of polynomial equations with dual methods which involve moment matrices and semi-definite
Moment matrices, border bases and radical computation
B. Mourrain; J.B. Lasserre; M. Laurent (Monique); P. Rostalski; P. Trebuchet (Philippe)
2011-01-01
htmlabstractIn this paper, we describe new methods to compute the radical (resp. real radical) of an ideal, assuming it complex (resp. real) variety is nte. The aim is to combine approaches for solving a system of polynomial equations with dual methods which involve moment matrices and
Generation speed in Raven's Progressive Matrices Test
Verguts, T.; Boeck, P. De; Maris, E.G.G.
1999-01-01
In this paper, we investigate the role of response fluency on a well-known intelligence test, Raven's (1962) Advanced Progressive Matrices (APM) test. Critical in solving this test is finding rules that govern the items. Response fluency is conceptualized as generation speed or the speed at which a
Inversion of General Cyclic Heptadiagonal Matrices
Directory of Open Access Journals (Sweden)
A. A. Karawia
2013-01-01
Full Text Available We describe a reliable symbolic computational algorithm for inverting general cyclic heptadiagonal matrices by using parallel computing along with recursion. The computational cost of it is operations. The algorithm is implementable to the Computer Algebra System (CAS such as MAPLE, MATLAB, and MATHEMATICA. Two examples are presented for the sake of illustration.
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander
2015-11-30
We approximate large non-structured Matérn covariance matrices of size n×n in the H-matrix format with a log-linear computational cost and storage O(kn log n), where rank k ≪ n is a small integer. Applications are: spatial statistics, machine learning and image analysis, kriging and optimal design.
NANOSTRUCTURED METAL OXIDE CATALYSTS VIA BUILDING BLOCK SYNTHESES
Energy Technology Data Exchange (ETDEWEB)
Craig E. Barnes
2013-03-05
A broadly applicable methodology has been developed to prepare new single site catalysts on silica supports. This methodology requires of three critical components: a rigid building block that will be the main structural and compositional component of the support matrix; a family of linking reagents that will be used to insert active metals into the matrix as well as cross link building blocks into a three dimensional matrix; and a clean coupling reaction that will connect building blocks and linking agents together in a controlled fashion. The final piece of conceptual strategy at the center of this methodology involves dosing the building block with known amounts of linking agents so that the targeted connectivity of a linking center to surrounding building blocks is obtained. Achieving targeted connectivities around catalytically active metals in these building block matrices is a critical element of the strategy by which single site catalysts are obtained. This methodology has been demonstrated with a model system involving only silicon and then with two metal-containing systems (titanium and vanadium). The effect that connectivity has on the reactivity of atomically dispersed titanium sites in silica building block matrices has been investigated in the selective oxidation of phenols to benezoquinones. 2-connected titanium sites are found to be five times as active (i.e. initial turnover frequencies) than 4-connected titanium sites (i.e. framework titanium sites).
Homogeneous bilateral block shifts
Indian Academy of Sciences (India)
Douglas class were classified in [3]; they are unilateral block shifts of arbitrary block size (i.e. dim H(n) can be anything). However, no examples of irreducible homogeneous bilateral block shifts of block size larger than 1 were known until now.
On Skew Circulant Type Matrices Involving Any Continuous Fibonacci Numbers
Directory of Open Access Journals (Sweden)
Zhaolin Jiang
2014-01-01
inverse matrices of them by constructing the transformation matrices. Furthermore, the maximum column sum matrix norm, the spectral norm, the Euclidean (or Frobenius norm, and the maximum row sum matrix norm and bounds for the spread of these matrices are given, respectively.
Waller, Niels G
2016-01-01
For a fixed set of standardized regression coefficients and a fixed coefficient of determination (R-squared), an infinite number of predictor correlation matrices will satisfy the implied quadratic form. I call such matrices fungible correlation matrices. In this article, I describe an algorithm for generating positive definite (PD), positive semidefinite (PSD), or indefinite (ID) fungible correlation matrices that have a random or fixed smallest eigenvalue. The underlying equations of this algorithm are reviewed from both algebraic and geometric perspectives. Two simulation studies illustrate that fungible correlation matrices can be profitably used in Monte Carlo research. The first study uses PD fungible correlation matrices to compare penalized regression algorithms. The second study uses ID fungible correlation matrices to compare matrix-smoothing algorithms. R code for generating fungible correlation matrices is presented in the supplemental materials.
Evolutionary Games with Randomly Changing Payoff Matrices
Yakushkina, Tatiana; Saakian, David B.; Bratus, Alexander; Hu, Chin-Kun
2015-06-01
Evolutionary games are used in various fields stretching from economics to biology. In most of these games a constant payoff matrix is assumed, although some works also consider dynamic payoff matrices. In this article we assume a possibility of switching the system between two regimes with different sets of payoff matrices. Potentially such a model can qualitatively describe the development of bacterial or cancer cells with a mutator gene present. A finite population evolutionary game is studied. The model describes the simplest version of annealed disorder in the payoff matrix and is exactly solvable at the large population limit. We analyze the dynamics of the model, and derive the equations for both the maximum and the variance of the distribution using the Hamilton-Jacobi equation formalism.
An algorithmic characterization of P-matricity
Ben Gharbia , Ibtihel; Gilbert , Jean Charles
2013-01-01
International audience; It is shown that a matrix M is a P-matrix if and only if, whatever is the vector q, the Newton-min algorithm does not cycle between two points when it is used to solve the linear complementarity problem 0 ≤ x ⊥ (Mx+q) ≥ 0.; Nous montrons dans cet article qu'une matrice M est une P-matrice si, et seulement si, quel que soit le vecteur q, l'algorithme de Newton-min ne fait pas de cycle de deux points lorsqu'il est utilisé pour résoudre le problème de compl\\émentarité lin...
Introduction to random matrices theory and practice
Livan, Giacomo; Vivo, Pierpaolo
2018-01-01
Modern developments of Random Matrix Theory as well as pedagogical approaches to the standard core of the discipline are surprisingly hard to find in a well-organized, readable and user-friendly fashion. This slim and agile book, written in a pedagogical and hands-on style, without sacrificing formal rigor fills this gap. It brings Ph.D. students in Physics, as well as more senior practitioners, through the standard tools and results on random matrices, with an eye on most recent developments that are not usually covered in introductory texts. The focus is mainly on random matrices with real spectrum. The main guiding threads throughout the book are the Gaussian Ensembles. In particular, Wigner’s semicircle law is derived multiple times to illustrate several techniques (e.g., Coulomb gas approach, replica theory). Most chapters are accompanied by Matlab codes (stored in an online repository) to guide readers through the numerical check of most analytical results.
Teaching Fourier optics through ray matrices
International Nuclear Information System (INIS)
Moreno, I; Sanchez-Lopez, M M; Ferreira, C; Davis, J A; Mateos, F
2005-01-01
In this work we examine the use of ray-transfer matrices for teaching and for deriving some topics in a Fourier optics course, exploiting the mathematical simplicity of ray matrices compared to diffraction integrals. A simple analysis of the physical meaning of the elements of the ray matrix provides a fast derivation of the conditions to obtain the optical Fourier transform. We extend this derivation to fractional Fourier transform optical systems, and derive the order of the transform from the ray matrix. Some examples are provided to stress this point of view, both with classical and with graded index lenses. This formulation cannot replace the complete explanation of Fourier optics provided by the wave theory, but it is a complementary tool useful to simplify many aspects of Fourier optics and to relate them to geometrical optics
The recurrence sequences via Sylvester matrices
Karaduman, Erdal; Deveci, Ömür
2017-07-01
In this work, we define the Pell-Jacobsthal-Slyvester sequence and the Jacobsthal-Pell-Slyvester sequence by using the Slyvester matrices which are obtained from the characteristic polynomials of the Pell and Jacobsthal sequences and then, we study the sequences defined modulo m. Also, we obtain the cyclic groups and the semigroups from the generating matrices of these sequences when read modulo m and then, we derive the relationships among the orders of the cyclic groups and the periods of the sequences. Furthermore, we redefine Pell-Jacobsthal-Slyvester sequence and the Jacobsthal-Pell-Slyvester sequence by means of the elements of the groups and then, we examine them in the finite groups.
Joint Matrices Decompositions and Blind Source Separation
Czech Academy of Sciences Publication Activity Database
Chabriel, G.; Kleinsteuber, M.; Moreau, E.; Shen, H.; Tichavský, Petr; Yeredor, A.
2014-01-01
Roč. 31, č. 3 (2014), s. 34-43 ISSN 1053-5888 R&D Projects: GA ČR GA102/09/1278 Institutional support: RVO:67985556 Keywords : joint matrices decomposition * tensor decomposition * blind source separation Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 5.852, year: 2014 http://library.utia.cas.cz/separaty/2014/SI/tichavsky-0427607.pdf
Tensor Permutation Matrices in Finite Dimensions
Christian, Rakotonirina
2005-01-01
We have generalised the properties with the tensor product, of one 4x4 matrix which is a permutation matrix, and we call a tensor commutation matrix. Tensor commutation matrices can be constructed with or without calculus. A formula allows us to construct a tensor permutation matrix, which is a generalisation of tensor commutation matrix, has been established. The expression of an element of a tensor commutation matrix has been generalised in the case of any element of a tensor permutation ma...
Fast Approximate Joint Diagonalization Incorporating Weight Matrices
Czech Academy of Sciences Publication Activity Database
Tichavský, Petr; Yeredor, A.
2009-01-01
Roč. 57, č. 3 (2009), s. 878-891 ISSN 1053-587X R&D Projects: GA MŠk 1M0572 Institutional research plan: CEZ:AV0Z10750506 Keywords : autoregressive processes * blind source separation * nonstationary random processes Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.212, year: 2009 http://library.utia.cas.cz/separaty/2009/SI/tichavsky-fast approximate joint diagonalization incorporating weight matrices.pdf
Photoluminescence of nanocrystals embedded in oxide matrices
International Nuclear Information System (INIS)
Estrada, C.; Gonzalez, J.A.; Kunold, A.; Reyes-Esqueda, J.A.; Pereyra, P.
2006-12-01
We used the theory of finite periodic systems to explain the photoluminescence spectra dependence on the average diameter of nanocrystals embedded in oxide matrices. Because of the broad matrix band gap, the photoluminescence response is basically determined by isolated nanocrystals and sequences of a few of them. With this model we were able to reproduce the shape and displacement of the experimentally observed photoluminescence spectra. (author)
Equiangular tight frames and unistochastic matrices
Czech Academy of Sciences Publication Activity Database
Goyeneche, D.; Turek, Ondřej
2017-01-01
Roč. 50, č. 24 (2017), č. článku 245304. ISSN 1751-8113 R&D Projects: GA ČR GA17-01706S Institutional support: RVO:61389005 Keywords : equiangular tight frames * unistochastic matrices * SIC POVM Subject RIV: BE - Theoretical Physics OBOR OECD: Atomic, molecular and chemical physics (physics of atoms and molecules including collision, interaction with radiation, magnetic resonances, Mössbauer effect) Impact factor: 1.857, year: 2016
Simplifications of rational matrices by using UML
Tasić, Milan B.; Stanimirović, Ivan P.
2013-01-01
The simplification process on rational matrices consists of simplifying each entry represented by a rational function. We follow the classic approach of dividing the numerator and denominator polynomials by their common GCD polynomial, and provide the activity diagram in UML for this process. A rational matrix representation as the quotient of a polynomial matrix and a polynomial is also discussed here and illustrated via activity diagrams. Also, a class diagram giving the links between the c...
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander
2015-01-07
We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(n log n). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and optimal design
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander
2015-01-05
We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(nlogn). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and op- timal design.
PHAGOCYTOSIS AND REMODELING OF COLLAGEN MATRICES
Abraham, Leah C.; Dice, J Fred.; Lee, Kyongbum; Kaplan, David L.
2007-01-01
The biodegradation of collagen and the deposition of new collagen-based extracellular matrices are of central importance in tissue remodeling and function. Similarly, for collagen-based biomaterials used in tissue engineering, the degradation of collagen scaffolds with accompanying cellular infiltration and generation of new extracellular matrix is critical for integration of in vitro grown tissues in vivo. In earlier studies we observed significant impact of collagen structure on primary lun...
Preconditioners for regularized saddle point matrices
Czech Academy of Sciences Publication Activity Database
Axelsson, Owe
2011-01-01
Roč. 19, č. 2 (2011), s. 91-112 ISSN 1570-2820 Institutional research plan: CEZ:AV0Z30860518 Keywords : saddle point matrices * preconditioning * regularization * eigenvalue clustering Subject RIV: BA - General Mathematics Impact factor: 0.533, year: 2011 http://www.degruyter.com/view/j/jnma.2011.19.issue-2/jnum.2011.005/jnum.2011.005. xml
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander; Genton, Marc G.; Sun, Ying; Tempone, Raul
2015-01-01
We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(n log n). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and optimal design
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander; Genton, Marc G.; Sun, Ying; Tempone, Raul
2015-01-01
We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(nlogn). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and op- timal design.
Testing block subdivision algorithms on block designs
Wiseman, Natalie; Patterson, Zachary
2016-01-01
Integrated land use-transportation models predict future transportation demand taking into account how households and firms arrange themselves partly as a function of the transportation system. Recent integrated models require parcels as inputs and produce household and employment predictions at the parcel scale. Block subdivision algorithms automatically generate parcel patterns within blocks. Evaluating block subdivision algorithms is done by way of generating parcels and comparing them to those in a parcel database. Three block subdivision algorithms are evaluated on how closely they reproduce parcels of different block types found in a parcel database from Montreal, Canada. While the authors who developed each of the algorithms have evaluated them, they have used their own metrics and block types to evaluate their own algorithms. This makes it difficult to compare their strengths and weaknesses. The contribution of this paper is in resolving this difficulty with the aim of finding a better algorithm suited to subdividing each block type. The proposed hypothesis is that given the different approaches that block subdivision algorithms take, it's likely that different algorithms are better adapted to subdividing different block types. To test this, a standardized block type classification is used that consists of mutually exclusive and comprehensive categories. A statistical method is used for finding a better algorithm and the probability it will perform well for a given block type. Results suggest the oriented bounding box algorithm performs better for warped non-uniform sites, as well as gridiron and fragmented uniform sites. It also produces more similar parcel areas and widths. The Generalized Parcel Divider 1 algorithm performs better for gridiron non-uniform sites. The Straight Skeleton algorithm performs better for loop and lollipop networks as well as fragmented non-uniform and warped uniform sites. It also produces more similar parcel shapes and patterns.
Poly(ferrocenylsilane)-block-Polylactide Block Copolymers
Roerdink, M.; van Zanten, Thomas S.; Hempenius, Mark A.; Zhong, Zhiyuan; Feijen, Jan; Vancso, Gyula J.
2007-01-01
A PFS/PLA block copolymer was studied to probe the effect of strong surface interactions on pattern formation in PFS block copolymer thin films. Successful synthesis of PFS-b-PLA was demonstrated. Thin films of these polymers show phase separation to form PFS microdomains in a PLA matrix, and
Group inverses of M-matrices and their applications
Kirkland, Stephen J
2013-01-01
Group inverses for singular M-matrices are useful tools not only in matrix analysis, but also in the analysis of stochastic processes, graph theory, electrical networks, and demographic models. Group Inverses of M-Matrices and Their Applications highlights the importance and utility of the group inverses of M-matrices in several application areas. After introducing sample problems associated with Leslie matrices and stochastic matrices, the authors develop the basic algebraic and spectral properties of the group inverse of a general matrix. They then derive formulas for derivatives of matrix f
Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
Monajemi, Hatef; Jafarpour, Sina; Gavish, Matan; Donoho, David L.; Ambikasaran, Sivaram; Bacallado, Sergio; Bharadia, Dinesh; Chen, Yuxin; Choi, Young; Chowdhury, Mainak; Chowdhury, Soham; Damle, Anil; Fithian, Will; Goetz, Georges; Grosenick, Logan; Gross, Sam; Hills, Gage; Hornstein, Michael; Lakkam, Milinda; Lee, Jason; Li, Jian; Liu, Linxi; Sing-Long, Carlos; Marx, Mike; Mittal, Akshay; Monajemi, Hatef; No, Albert; Omrani, Reza; Pekelis, Leonid; Qin, Junjie; Raines, Kevin; Ryu, Ernest; Saxe, Andrew; Shi, Dai; Siilats, Keith; Strauss, David; Tang, Gary; Wang, Chaojun; Zhou, Zoey; Zhu, Zhen
2013-01-01
In compressed sensing, one takes samples of an N-dimensional vector using an matrix A, obtaining undersampled measurements . For random matrices with independent standard Gaussian entries, it is known that, when is k-sparse, there is a precisely determined phase transition: for a certain region in the (,)-phase diagram, convex optimization typically finds the sparsest solution, whereas outside that region, it typically fails. It has been shown empirically that the same property—with the same phase transition location—holds for a wide range of non-Gaussian random matrix ensembles. We report extensive experiments showing that the Gaussian phase transition also describes numerous deterministic matrices, including Spikes and Sines, Spikes and Noiselets, Paley Frames, Delsarte-Goethals Frames, Chirp Sensing Matrices, and Grassmannian Frames. Namely, for each of these deterministic matrices in turn, for a typical k-sparse object, we observe that convex optimization is successful over a region of the phase diagram that coincides with the region known for Gaussian random matrices. Our experiments considered coefficients constrained to for four different sets , and the results establish our finding for each of the four associated phase transitions. PMID:23277588
Skip Navigation Bar Home Current Issue Past Issues Block That Pain! Past Issues / Fall 2007 Table of ... contrast, most pain relievers used for surgical procedures block activity in all types of neurons. This can ...
... known cause. Causes can include: Left bundle branch block Heart attacks (myocardial infarction) Thickened, stiffened or weakened ... myocarditis) High blood pressure (hypertension) Right bundle branch block A heart abnormality that's present at birth (congenital) — ...
Ferdous, Zannatul; Wei, Victoria Mariko; Iozzo, Renato; Höök, Magnus; Grande-Allen, Kathryn Jane
2007-12-07
The small leucine-rich proteoglycan decorin has been demonstrated to be a key regulator of collagen fibrillogenesis; decorin deficiencies lead to irregularly shaped collagen fibrils and weakened material behavior in postnatal murine connective tissues. In an in vitro investigation of the contributions of decorin to tissue organization and material behavior, model tissues were engineered by seeding embryonic fibroblasts, harvested from 12.5-13.5 days gestational aged decorin null (Dcn(-/-)) or wild-type mice, within type I collagen gels. The resulting three-dimensional collagen matrices were cultured for 4 weeks under static tension. The collagen matrices seeded with Dcn(-/-) cells exhibited greater contraction, cell density, ultimate tensile strength, and elastic modulus than those seeded with wild-type cells. Ultrastructurally, the matrices seeded with Dcn(-/-) cells contained a greater density of collagen. The decorin-null tissues contained more biglycan than control tissues, suggesting that this related proteoglycan compensated for the absence of decorin. The effect of transforming growth factor-beta (TGF-beta), which is normally sequestered by decorin, was also investigated in this study. The addition of TGF-beta1 to the matrices seeded with wild-type cells improved their contraction and mechanical strength, whereas blocking TGF-beta1 in the Dcn(-/-) cell-seeded matrices significantly reduced the collagen gel contraction. These results indicate that the inhibitory interaction between decorin and TGF-beta1 significantly influenced the matrix organization and material behavior of these in vitro model tissues.
U.S. Environmental Protection Agency — This dataset provides the basic building blocks for the USEEIO v1.1 model and life cycle results per $1 (2013 USD) demand for all goods and services in the model in...
Determination of coefficient matrices for ARMA model
International Nuclear Information System (INIS)
Tran Dinh Tri.
1990-10-01
A new recursive algorithm for determining coefficient matrices of ARMA model from measured data is presented. The Yule-Walker equations for the case of ARMA model are derived from the ARMA innovation equation. The recursive algorithm is based on choosing appropriate form of the operator functions and suitable representation of the (n+1)-th order operator functions according to ones with the lower order. Two cases, when the order of the AR part is equal to one of the MA part, and the optimal case, were considered. (author) 5 refs
Algebraic Graph Theory Morphisms, Monoids and Matrices
Knauer, Ulrich
2011-01-01
This is a highly self-contained book about algebraic graph theory which iswritten with a view to keep the lively and unconventional atmosphere of a spoken text to communicate the enthusiasm the author feels about this subject. The focus is on homomorphisms and endomorphisms, matrices and eigenvalues. Graph models are extremely useful for almost all applications and applicators as they play an important role as structuring tools. They allow to model net structures -like roads, computers, telephones -instances of abstract data structures -likelists, stacks, trees -and functional or object orient
Coherence and extensions of stochastic matrices
Directory of Open Access Journals (Sweden)
Angelo Gilio
1995-11-01
Full Text Available In this paper a review of some general results on coherence of conditional probability assessments is given. Then, a necessary and sufficient condition on coherence of two finite families of discrete conditianal probability distributions, represented by two stochastic matrices P and Q, is obtained. Moreover, the possible extensions of the assessment (P,Q to the marginal distributions are examined and explicit formulas for them are given in some special case. Finally, a general algorithm to check coherence of (P,Q and to derive its extensions is proposed.
2D gravity and random matrices
International Nuclear Information System (INIS)
Zinn-Justin, J.
1990-01-01
Recent progress in 2D gravity coupled to d ≤ 1 matter, based on a representation of discrete gravity in terms of random matrices, is reported. The matrix problem can be solved in many cases by the introduction of suitable orthogonal polynomials. Alternatively in the continuum limit the orthogonal polynomial method can be shown to be equivalent to the construction of representation of the canonical commutation relations in terms of differential operators. In the case of pure gravity or discrete Ising-like matter the sum over topologies is reduced to the solution of non-linear differential equations. The d = 1 problem can be solved by semiclassical methods
MAIA, Eigenvalues for MHD Equation of Tokamak Plasma Stability Problems
International Nuclear Information System (INIS)
Tanaka, Y.; Azumi, M.; Kurita, G.; Tsunematsu, T.; Takeda, T.
1986-01-01
1 - Description of program or function: This program solves an eigenvalue problem zBx=Ax where A and B are real block tri-diagonal matrices. This eigenvalue problem is derived from a reduced set of linear resistive MHD equations which is often employed to study tokamak plasma stability problem. 2 - Method of solution: Both the determinant and inverse iteration methods are employed. 3 - Restrictions on the complexity of the problem: The eigenvalue z must be real
DEFF Research Database (Denmark)
Jönsson, Jeppe
2015-01-01
Block tearing is considered in several codes as a pure block tension or a pure block shear failure mechanism. However in many situations the load acts eccentrically and involves the transfer of a substantial moment in combination with the shear force and perhaps a normal force. A literature study...... shows that no readily available tests with a well-defined substantial eccentricity have been performed. This paper presents theoretical and experimental work leading towards generalized block failure capacity methods. Simple combination of normal force, shear force and moment stress distributions along...... yield lines around the block leads to simple interaction formulas similar to other interaction formulas in the codes....
Energy Technology Data Exchange (ETDEWEB)
Wagner, C.
1996-12-31
In 1992, Wittum introduced the frequency filtering decompositions (FFD), which yield a fast method for the iterative solution of large systems of linear equations. Based on this method, the tangential frequency filtering decompositions (TFFD) have been developed. The TFFD allow the robust and efficient treatment of matrices with strongly varying coefficients. The existence and the convergence of the TFFD can be shown for symmetric and positive definite matrices. For a large class of matrices, it is possible to prove that the convergence rate of the TFFD and of the FFD is independent of the number of unknowns. For both methods, schemes for the construction of frequency filtering decompositions for unsymmetric matrices have been developed. Since, in contrast to Wittums`s FFD, the TFFD needs only one test vector, an adaptive test vector can be used. The TFFD with respect to the adaptive test vector can be combined with other iterative methods, e.g. multi-grid methods, in order to improve the robustness of these methods. The frequency filtering decompositions have been successfully applied to the problem of the decontamination of a heterogeneous porous medium by flushing.
Critical statistics for non-Hermitian matrices
International Nuclear Information System (INIS)
Garcia-Garcia, A.M.; Verbaarschot, J.J.M.; Nishigaki, S.M.
2002-01-01
We introduce a generalized ensemble of non-Hermitian matrices interpolating between the Gaussian Unitary Ensemble, the Ginibre ensemble, and the Poisson ensemble. The joint eigenvalue distribution of this model is obtained by means of an extension of the Itzykson-Zuber formula to general complex matrices. Its correlation functions are studied both in the case of weak non-Hermiticity and in the case of strong non-Hermiticity. In the weak non-Hermiticity limit we show that the spectral correlations in the bulk of the spectrum display critical statistics: the asymptotic linear behavior of the number variance is already approached for energy differences of the order of the eigenvalue spacing. To lowest order, its slope does not depend on the degree of non-Hermiticity. Close the edge, the spectral correlations are similar to the Hermitian case. In the strong non-Hermiticity limit the crossover behavior from the Ginibre ensemble to the Poisson ensemble first appears close to the surface of the spectrum. Our model may be relevant for the description of the spectral correlations of an open disordered system close to an Anderson transition
Tensor Dictionary Learning for Positive Definite Matrices.
Sivalingam, Ravishankar; Boley, Daniel; Morellas, Vassilios; Papanikolopoulos, Nikolaos
2015-11-01
Sparse models have proven to be extremely successful in image processing and computer vision. However, a majority of the effort has been focused on sparse representation of vectors and low-rank models for general matrices. The success of sparse modeling, along with popularity of region covariances, has inspired the development of sparse coding approaches for these positive definite descriptors. While in earlier work, the dictionary was formed from all, or a random subset of, the training signals, it is clearly advantageous to learn a concise dictionary from the entire training set. In this paper, we propose a novel approach for dictionary learning over positive definite matrices. The dictionary is learned by alternating minimization between sparse coding and dictionary update stages, and different atom update methods are described. A discriminative version of the dictionary learning approach is also proposed, which simultaneously learns dictionaries for different classes in classification or clustering. Experimental results demonstrate the advantage of learning dictionaries from data both from reconstruction and classification viewpoints. Finally, a software library is presented comprising C++ binaries for all the positive definite sparse coding and dictionary learning approaches presented here.
Virial expansion for almost diagonal random matrices
International Nuclear Information System (INIS)
Yevtushenko, Oleg; Kravtsov, Vladimir E
2003-01-01
Energy level statistics of Hermitian random matrices H-circumflex with Gaussian independent random entries H i≥j is studied for a generic ensemble of almost diagonal random matrices with (vertical bar H ii vertical bar 2 ) ∼ 1 and (vertical bar H i≠j vertical bar 2 ) bF(vertical bar i - j vertical bar) parallel 1. We perform a regular expansion of the spectral form-factor K(τ) = 1 + bK 1 (τ) + b 2 K 2 (τ) + c in powers of b parallel 1 with the coefficients K m (τ) that take into account interaction of (m + 1) energy levels. To calculate K m (τ), we develop a diagrammatic technique which is based on the Trotter formula and on the combinatorial problem of graph edges colouring with (m + 1) colours. Expressions for K 1 (τ) and K 2 (τ) in terms of infinite series are found for a generic function F(vertical bar i - j vertical bar ) in the Gaussian orthogonal ensemble (GOE), the Gaussian unitary ensemble (GUE) and in the crossover between them (the almost unitary Gaussian ensemble). The Rosenzweig-Porter and power-law banded matrix ensembles are considered as examples
Generalized Eigenvalues for pairs on heritian matrices
Rublein, George
1988-01-01
A study was made of certain special cases of a generalized eigenvalue problem. Let A and B be nxn matrics. One may construct a certain polynomial, P(A,B, lambda) which specializes to the characteristic polynomial of B when A equals I. In particular, when B is hermitian, that characteristic polynomial, P(I,B, lambda) has real roots, and one can ask: are the roots of P(A,B, lambda) real when B is hermitian. We consider the case where A is positive definite and show that when N equals 3, the roots are indeed real. The basic tools needed in the proof are Shur's theorem on majorization for eigenvalues of hermitian matrices and the interlacing theorem for the eigenvalues of a positive definite hermitian matrix and one of its principal (n-1)x(n-1) minors. The method of proof first reduces the general problem to one where the diagonal of B has a certain structure: either diag (B) = diag (1,1,1) or diag (1,1,-1), or else the 2 x 2 principal minors of B are all 1. According as B has one of these three structures, we use an appropriate method to replace A by a positive diagonal matrix. Since it can be easily verified that P(D,B, lambda) has real roots, the result follows. For other configurations of B, a scaling and a continuity argument are used to prove the result in general.
On deriving the generalized Drazin inverse of block matrices in a ...
African Journals Online (AJOL)
a b c d] in a Banach algebra A, under specic conditions. We focus on deriving formulae for the generalized Drazin inverse of x in terms of the generalized Drazin inverses of the elements a, aπbc, a2ad + aadbcad and the generalized Schur ...
Meet and Join Matrices in the Poset of Exponential Divisors
Indian Academy of Sciences (India)
... exponential divisor ( G C E D ) and the least common exponential multiple ( L C E M ) do not always exist. In this paper we embed this poset in a lattice. As an application we study the G C E D and L C E M matrices, analogues of G C D and L C M matrices, which are both special cases of meet and join matrices on lattices.
The 'golden' matrices and a new kind of cryptography
International Nuclear Information System (INIS)
Stakhov, A.P.
2007-01-01
We consider a new class of square matrices called the 'golden' matrices. They are a generalization of the classical Fibonacci Q-matrix for continuous domain. The 'golden' matrices can be used for creation of a new kind of cryptography called the 'golden' cryptography. The method is very fast and simple for technical realization and can be used for cryptographic protection of digital signals (telecommunication and measurement systems)
Generalized Perron--Frobenius Theorem for Nonsquare Matrices
Avin, Chen; Borokhovich, Michael; Haddad, Yoram; Kantor, Erez; Lotker, Zvi; Parter, Merav; Peleg, David
2013-01-01
The celebrated Perron--Frobenius (PF) theorem is stated for irreducible nonnegative square matrices, and provides a simple characterization of their eigenvectors and eigenvalues. The importance of this theorem stems from the fact that eigenvalue problems on such matrices arise in many fields of science and engineering, including dynamical systems theory, economics, statistics and optimization. However, many real-life scenarios give rise to nonsquare matrices. A natural question is whether the...
Blocked Randomization with Randomly Selected Block Sizes
Directory of Open Access Journals (Sweden)
Jimmy Efird
2010-12-01
Full Text Available When planning a randomized clinical trial, careful consideration must be given to how participants are selected for various arms of a study. Selection and accidental bias may occur when participants are not assigned to study groups with equal probability. A simple random allocation scheme is a process by which each participant has equal likelihood of being assigned to treatment versus referent groups. However, by chance an unequal number of individuals may be assigned to each arm of the study and thus decrease the power to detect statistically significant differences between groups. Block randomization is a commonly used technique in clinical trial design to reduce bias and achieve balance in the allocation of participants to treatment arms, especially when the sample size is small. This method increases the probability that each arm will contain an equal number of individuals by sequencing participant assignments by block. Yet still, the allocation process may be predictable, for example, when the investigator is not blind and the block size is fixed. This paper provides an overview of blocked randomization and illustrates how to avoid selection bias by using random block sizes.
31 CFR 595.301 - Blocked account; blocked property.
2010-07-01
... (Continued) OFFICE OF FOREIGN ASSETS CONTROL, DEPARTMENT OF THE TREASURY TERRORISM SANCTIONS REGULATIONS General Definitions § 595.301 Blocked account; blocked property. The terms blocked account and blocked...
The chiral Gaussian two-matrix ensemble of real asymmetric matrices
International Nuclear Information System (INIS)
Akemann, G; Phillips, M J; Sommers, H-J
2010-01-01
We solve a family of Gaussian two-matrix models with rectangular N x (N + ν) matrices, having real asymmetric matrix elements and depending on a non-Hermiticity parameter μ. Our model can be thought of as the chiral extension of the real Ginibre ensemble, relevant for Dirac operators in the same symmetry class. It has the property that its eigenvalues are either real, purely imaginary or come in complex conjugate eigenvalue pairs. The eigenvalue joint probability distribution for our model is explicitly computed, leading to a non-Gaussian distribution including K-Bessel functions. All n-point density correlation functions are expressed for finite N in terms of a Pfaffian form. This contains a kernel involving Laguerre polynomials in the complex plane as a building block which was previously computed by the authors. This kernel can be expressed in terms of the kernel for complex non-Hermitian matrices, generalizing the known relation among ensembles of Hermitian random matrices. Compact expressions are given for the density at finite N as an example, as well as its microscopic large-N limits at the origin for fixed ν at strong and weak non-Hermiticity.
Tetrodotoxin Detection by a Surface Plasmon Resonance Sensor in Pufferfish Matrices and Urine
Directory of Open Access Journals (Sweden)
Allen D. Taylor
2011-01-01
Full Text Available Tetrodotoxin (TTX poisoning is most commonly associated with consumption of pufferfish. TTX is a low molecular weight (~319 Da neurotoxin that selectively blocks voltage-sensitive Na+-gated ion channels. The standard method accepted worldwide for monitoring TTX toxicity in food matrices is the mouse bioassay. Ethical concerns from live animal testing, low sample throughput, and analytical inaccuracies have led to the need for an alternative method. We have previously established that surface plasmon resonance (SPR sensors can quantify TTX in aqueous buffer samples by an antibody-based inhibition assay. In this paper, we report the extension of the assay for the detection of TTX in both clinical- and food-relevant matrices. The assay was optimized for application to three relevant complex matrices: pufferfish liver extract, pufferfish muscle extract, and human urine. Matrix effects are discussed and calibration curves are presented. Naturally contaminated pufferfish liver and muscle extracts were analyzed by the SPR method, and the data is compared to liquid-chromatography electrospray-ionization multiple reactions monitoring mass spectrometry (LC/ESI/MRM/MS data. Ten samples, including three from a poisoning incident, two control monkfish samples, and five toxic pufferfish samples, were analyzed using this method, and the data is compared to LC/ESI/MRM/MS analysis of the samples.
Intrinsic Density Matrices of the Nuclear Shell Model
International Nuclear Information System (INIS)
Deveikis, A.; Kamuntavichius, G.
1996-01-01
A new method for calculation of shell model intrinsic density matrices, defined as two-particle density matrices integrated over the centre-of-mass position vector of two last particles and complemented with isospin variables, has been developed. The intrinsic density matrices obtained are completely antisymmetric, translation-invariant, and do not employ a group-theoretical classification of antisymmetric states. They are used for exact realistic density matrix expansion within the framework of the reduced Hamiltonian method. The procedures based on precise arithmetic for calculation of the intrinsic density matrices that involve no numerical diagonalization or orthogonalization have been developed and implemented in the computer code. (author). 11 refs., 2 tabs
Noisy covariance matrices and portfolio optimization II
Pafka, Szilárd; Kondor, Imre
2003-03-01
Recent studies inspired by results from random matrix theory (Galluccio et al.: Physica A 259 (1998) 449; Laloux et al.: Phys. Rev. Lett. 83 (1999) 1467; Risk 12 (3) (1999) 69; Plerou et al.: Phys. Rev. Lett. 83 (1999) 1471) found that covariance matrices determined from empirical financial time series appear to contain such a high amount of noise that their structure can essentially be regarded as random. This seems, however, to be in contradiction with the fundamental role played by covariance matrices in finance, which constitute the pillars of modern investment theory and have also gained industry-wide applications in risk management. Our paper is an attempt to resolve this embarrassing paradox. The key observation is that the effect of noise strongly depends on the ratio r= n/ T, where n is the size of the portfolio and T the length of the available time series. On the basis of numerical experiments and analytic results for some toy portfolio models we show that for relatively large values of r (e.g. 0.6) noise does, indeed, have the pronounced effect suggested by Galluccio et al. (1998), Laloux et al. (1999) and Plerou et al. (1999) and illustrated later by Laloux et al. (Int. J. Theor. Appl. Finance 3 (2000) 391), Plerou et al. (Phys. Rev. E, e-print cond-mat/0108023) and Rosenow et al. (Europhys. Lett., e-print cond-mat/0111537) in a portfolio optimization context, while for smaller r (around 0.2 or below), the error due to noise drops to acceptable levels. Since the length of available time series is for obvious reasons limited in any practical application, any bound imposed on the noise-induced error translates into a bound on the size of the portfolio. In a related set of experiments we find that the effect of noise depends also on whether the problem arises in asset allocation or in a risk measurement context: if covariance matrices are used simply for measuring the risk of portfolios with a fixed composition rather than as inputs to optimization, the
A biclustering algorithm for binary matrices based on penalized Bernoulli likelihood
Lee, Seokho
2013-01-31
We propose a new biclustering method for binary data matrices using the maximum penalized Bernoulli likelihood estimation. Our method applies a multi-layer model defined on the logits of the success probabilities, where each layer represents a simple bicluster structure and the combination of multiple layers is able to reveal complicated, multiple biclusters. The method allows for non-pure biclusters, and can simultaneously identify the 1-prevalent blocks and 0-prevalent blocks. A computationally efficient algorithm is developed and guidelines are provided for specifying the tuning parameters, including initial values of model parameters, the number of layers, and the penalty parameters. Missing-data imputation can be handled in the EM framework. The method is tested using synthetic and real datasets and shows good performance. © 2013 Springer Science+Business Media New York.
DEFF Research Database (Denmark)
Miolane, Charlotte Vikkelsø
ensurethat no attack violatesthe securitybounds specifiedbygeneric attack namely exhaustivekey search and table lookup attacks. This thesis contains a general introduction to cryptography with focus on block ciphers and important block cipher designs, in particular the Advanced Encryption Standard(AES...... on small scale variants of AES. In the final part of the thesis we present a new block cipher proposal Present and examine its security against algebraic and differential cryptanalysis in particular....
Equiangular tight frames and unistochastic matrices
International Nuclear Information System (INIS)
Goyeneche, Dardo; Turek, Ondřej
2017-01-01
We demonstrate that a complex equiangular tight frame composed of N vectors in dimension d , denoted ETF ( d , N ), exists if and only if a certain bistochastic matrix, univocally determined by N and d , belongs to a special class of unistochastic matrices. This connection allows us to find new complex ETFs in infinitely many dimensions and to derive a method to introduce non-trivial free parameters in ETFs. We present an explicit six-parametric family of complex ETF(6,16), which defines a family of symmetric POVMs. Minimal and maximal possible average entanglement of the vectors within this qubit–qutrit family are described. Furthermore, we propose an efficient numerical procedure to compute the unitary matrix underlying a unistochastic matrix, which we apply to find all existing classes of complex ETFs containing up to 20 vectors. (paper)
Colonization of bone matrices by cellular components
Shchelkunova, E. I.; Voropaeva, A. A.; Korel, A. V.; Mayer, D. A.; Podorognaya, V. T.; Kirilova, I. A.
2017-09-01
Practical surgery, traumatology, orthopedics, and oncology require bioengineered constructs suitable for replacement of large-area bone defects. Only rigid/elastic matrix containing recipient's bone cells capable of mitosis, differentiation, and synthesizing extracellular matrix that supports cell viability can comply with these requirements. Therefore, the development of the techniques to produce structural and functional substitutes, whose three-dimensional structure corresponds to the recipient's damaged tissues, is the main objective of tissue engineering. This is achieved by developing tissue-engineering constructs represented by cells placed on the matrices. Low effectiveness of carrier matrix colonization with cells and their uneven distribution is one of the major problems in cell culture on various matrixes. In vitro studies of the interactions between cells and material, as well as the development of new techniques for scaffold colonization by cellular components are required to solve this problem.
Computing with linear equations and matrices
International Nuclear Information System (INIS)
Churchhouse, R.F.
1983-01-01
Systems of linear equations and matrices arise in many disciplines. The equations may accurately represent conditions satisfied by a system or, more likely, provide an approximation to a more complex system of non-linear or differential equations. The system may involve a few or many thousand unknowns and each individual equation may involve few or many of them. Over the past 50 years a vast literature on methods for solving systems of linear equations and the associated problems of finding the inverse or eigenvalues of a matrix has been produced. These lectures cover those methods which have been found to be most useful for dealing with such types of problem. References are given where appropriate and attention is drawn to the possibility of improved methods for use on vector and parallel processors. (orig.)
Matrices over runtime systems at exascale
Agullo, Emmanuel
2012-11-01
The goal of Matrices Over Runtime Systems at Exascale (MORSE) project is to design dense and sparse linear algebra methods that achieve the fastest possible time to an accurate solution on large-scale multicore systems with GPU accelerators, using all the processing power that future high end systems can make available. In this poster, we propose a framework for describing linear algebra algorithms at a high level of abstraction and delegating the actual execution to a runtime system in order to design software whose performance is portable accross architectures. We illustrate our methodology on three classes of problems: dense linear algebra, sparse direct methods and fast multipole methods. The resulting codes have been incorporated into Magma, Pastix and ScalFMM solvers, respectively. © 2012 IEEE.
Sparse random matrices: The eigenvalue spectrum revisited
International Nuclear Information System (INIS)
Semerjian, Guilhem; Cugliandolo, Leticia F.
2003-08-01
We revisit the derivation of the density of states of sparse random matrices. We derive a recursion relation that allows one to compute the spectrum of the matrix of incidence for finite trees that determines completely the low concentration limit. Using the iterative scheme introduced by Biroli and Monasson [J. Phys. A 32, L255 (1999)] we find an approximate expression for the density of states expected to hold exactly in the opposite limit of large but finite concentration. The combination of the two methods yields a very simple geometric interpretation of the tails of the spectrum. We test the analytic results with numerical simulations and we suggest an indirect numerical method to explore the tails of the spectrum. (author)
From Pauli Matrices to Quantum Ito Formula
International Nuclear Information System (INIS)
Pautrat, Yan
2005-01-01
This paper answers important questions raised by the recent description, by Attal, of a robust and explicit method to approximate basic objects of quantum stochastic calculus on bosonic Fock space by analogues on the state space of quantum spin chains. The existence of that method justifies a detailed investigation of discrete-time quantum stochastic calculus. Here we fully define and study that theory and obtain in particular a discrete-time quantum Ito formula, which one can see as summarizing the commutation relations of Pauli matrices.An apparent flaw in that approximation method is the difference in the quantum Ito formulas, discrete and continuous, which suggests that the discrete quantum stochastic calculus differs fundamentally from the continuous one and is therefore not a suitable object to approximate subtle phenomena. We show that flaw is only apparent by proving that the continuous-time quantum Ito formula is actually a consequence of its discrete-time counterpart
Dirac matrices for Chern-Simons gravity
Energy Technology Data Exchange (ETDEWEB)
Izaurieta, Fernando; Ramirez, Ricardo; Rodriguez, Eduardo [Departamento de Matematica y Fisica Aplicadas, Universidad Catolica de la Santisima Concepcion, Alonso de Ribera 2850, 4090541 Concepcion (Chile)
2012-10-06
A genuine gauge theory for the Poincare, de Sitter or anti-de Sitter algebras can be constructed in (2n- 1)-dimensional spacetime by means of the Chern-Simons form, yielding a gravitational theory that differs from General Relativity but shares many of its properties, such as second order field equations for the metric. The particular form of the Lagrangian is determined by a rank n, symmetric tensor invariant under the relevant algebra. In practice, the calculation of this invariant tensor can be reduced to the computation of the trace of the symmetrized product of n Dirac Gamma matrices {Gamma}{sub ab} in 2n-dimensional spacetime. While straightforward in principle, this calculation can become extremely cumbersome in practice. For large enough n, existing computer algebra packages take an inordinate long time to produce the answer or plainly fail having used up all available memory. In this talk we show that the general formula for the trace of the symmetrized product of 2n Gamma matrices {Gamma}{sub ab} can be written as a certain sum over the integer partitions s of n, with every term being multiplied by a numerical cofficient {alpha}{sub s}. We then give a general algorithm that computes the {alpha}-coefficients as the solution of a linear system of equations generated by evaluating the general formula for different sets of tensors B{sup ab} with random numerical entries. A recurrence relation between different coefficients is shown to hold and is used in a second, 'minimal' algorithm to greatly speed up the computations. Runtime of the minimal algorithm stays below 1 min on a typical desktop computer for up to n = 25, which easily covers all foreseeable applications of the trace formula.
da Rocha-Azevedo, Bruno; Ho, Chin-Han; Grinnell, Frederick
2012-01-01
Fibroblasts incubated on 3D collagen matrices in serum or lysophosphatidic acid (LPA)-containing medium self-organize into clusters through a mechanism that requires cell contraction. However, in platelet-derived growth factor (PDGF)-containing medium, cells migrate as individuals and do not form clusters even though they constantly encounter each other. Here, we present evidence that a required function of cell contraction in clustering is formation of fibronectin fibrillar matrix. We found that in serum or LPA but not in PDGF or basal medium, cells organized FN (both serum and cellular) into a fibrillar, detergent-insoluble matrix. Cell clusters developed concomitant with FN matrix formation. FN fibrils accumulated beneath cells and along the borders of cell clusters in regions of cell-matrix tension. Blocking Rho kinase or myosin II activity prevented FN matrix assembly and cell clustering. Using siRNA silencing and function-blocking antibodies and peptides, we found that cell clustering and FN matrix assembly required α5β1 integrins and fibronectin. Cells were still able to exert contractile force and compact the collagen matrix under the latter conditions, which showed that contraction was not sufficient for cell clustering to occur. Our findings provide new insights into how procontractile (serum/LPA) and promigratory (PDGF) growth factor environments can differentially regulate FN matrix assembly by fibroblasts interacting with collagen matrices and thereby influence mesenchymal cell morphogenetic behavior under physiologic circumstances such as wound repair, morphogenesis and malignancy. PMID:23117111
da Rocha-Azevedo, Bruno; Ho, Chin-Han; Grinnell, Frederick
2013-02-15
Fibroblasts incubated on 3D collagen matrices in serum or lysophosphatidic acid (LPA)-containing medium self-organize into clusters through a mechanism that requires cell contraction. However, in platelet-derived growth factor (PDGF)-containing medium, cells migrate as individuals and do not form clusters even though they constantly encounter each other. Here, we present evidence that a required function of cell contraction in clustering is formation of fibronectin (FN) fibrillar matrix. We found that in serum or LPA but not in PDGF or basal medium, cells organized FN (both serum and cellular) into a fibrillar, detergent-insoluble matrix. Cell clusters developed concomitant with FN matrix formation. FN fibrils accumulated beneath cells and along the borders of cell clusters in regions of cell-matrix tension. Blocking Rho kinase or myosin II activity prevented FN matrix assembly and cell clustering. Using siRNA silencing and function-blocking antibodies and peptides, we found that cell clustering and FN matrix assembly required α5β1 integrins and fibronectin. Cells were still able to exert contractile force and compact the collagen matrix under the latter conditions, which showed that contraction was not sufficient for cell clustering to occur. Our findings provide new insights into how procontractile (serum/LPA) and promigratory (PDGF) growth factor environments can differentially regulate FN matrix assembly by fibroblasts interacting with collagen matrices and thereby influence mesenchymal cell morphogenetic behavior under physiologic circumstances such as wound repair, morphogenesis and malignancy. Copyright © 2012 Elsevier Inc. All rights reserved.
Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
Monajemi, Hatef; Jafarpour, Sina; Gavish, Matan; Donoho, David L.; Ambikasaran, Sivaram; Bacallado, Sergio; Bharadia, Dinesh; Chen, Yuxin; Choi, Young; Chowdhury, Mainak; Chowdhury, Soham; Damle, Anil; Fithian, Will; Goetz, Georges; Grosenick, Logan
2012-01-01
In compressed sensing, one takes samples of an N-dimensional vector using an matrix A, obtaining undersampled measurements . For random matrices with independent standard Gaussian entries, it is known that, when is k-sparse, there is a precisely determined phase transition: for a certain region in the (,)-phase diagram, convex optimization typically finds the sparsest solution, whereas outside that region, it typically fails. It has been shown empirically that the same property—with the ...
Binary Positive Semidefinite Matrices and Associated Integer Polytopes
DEFF Research Database (Denmark)
Letchford, Adam N.; Sørensen, Michael Malmros
2012-01-01
We consider the positive semidefinite (psd) matrices with binary entries, along with the corresponding integer polytopes. We begin by establishing some basic properties of these matrices and polytopes. Then, we show that several families of integer polytopes in the literature-the cut, boolean qua...
CONVERGENCE OF POWERS OF CONTROLLABLE INTUITIONISTIC FUZZY MATRICES
Riyaz Ahmad Padder; P. Murugadas
2016-01-01
Convergences of powers of controllable intuitionistic fuzzy matrices have been stud¬ied. It is shown that they oscillate with period equal to 2, in general. Some equalities and sequences of inequalities about powers of controllable intuitionistic fuzzy matrices have been obtained.
Propositional matrices as alternative representation of truth values ...
African Journals Online (AJOL)
The paper considered the subject of representation of truth values in symbolic logic. An alternative representation was given based on the rows and columns properties of matrices, with the operations involving the logical connectives subjected to the laws of algebra of propositions. Matrices of various propositions detailing ...
The Modern Origin of Matrices and Their Applications
Debnath, L.
2014-01-01
This paper deals with the modern development of matrices, linear transformations, quadratic forms and their applications to geometry and mechanics, eigenvalues, eigenvectors and characteristic equations with applications. Included are the representations of real and complex numbers, and quaternions by matrices, and isomorphism in order to show…
Fast multipole preconditioners for sparse matrices arising from elliptic equations
Ibeid, Huda
2017-11-09
Among optimal hierarchical algorithms for the computational solution of elliptic problems, the fast multipole method (FMM) stands out for its adaptability to emerging architectures, having high arithmetic intensity, tunable accuracy, and relaxable global synchronization requirements. We demonstrate that, beyond its traditional use as a solver in problems for which explicit free-space kernel representations are available, the FMM has applicability as a preconditioner in finite domain elliptic boundary value problems, by equipping it with boundary integral capability for satisfying conditions at finite boundaries and by wrapping it in a Krylov method for extensibility to more general operators. Here, we do not discuss the well developed applications of FMM to implement matrix-vector multiplications within Krylov solvers of boundary element methods. Instead, we propose using FMM for the volume-to-volume contribution of inhomogeneous Poisson-like problems, where the boundary integral is a small part of the overall computation. Our method may be used to precondition sparse matrices arising from finite difference/element discretizations, and can handle a broader range of scientific applications. It is capable of algebraic convergence rates down to the truncation error of the discretized PDE comparable to those of multigrid methods, and it offers potentially superior multicore and distributed memory scalability properties on commodity architecture supercomputers. Compared with other methods exploiting the low-rank character of off-diagonal blocks of the dense resolvent operator, FMM-preconditioned Krylov iteration may reduce the amount of communication because it is matrix-free and exploits the tree structure of FMM. We describe our tests in reproducible detail with freely available codes and outline directions for further extensibility.
Fast multipole preconditioners for sparse matrices arising from elliptic equations
Ibeid, Huda; Yokota, Rio; Pestana, Jennifer; Keyes, David E.
2017-01-01
Among optimal hierarchical algorithms for the computational solution of elliptic problems, the fast multipole method (FMM) stands out for its adaptability to emerging architectures, having high arithmetic intensity, tunable accuracy, and relaxable global synchronization requirements. We demonstrate that, beyond its traditional use as a solver in problems for which explicit free-space kernel representations are available, the FMM has applicability as a preconditioner in finite domain elliptic boundary value problems, by equipping it with boundary integral capability for satisfying conditions at finite boundaries and by wrapping it in a Krylov method for extensibility to more general operators. Here, we do not discuss the well developed applications of FMM to implement matrix-vector multiplications within Krylov solvers of boundary element methods. Instead, we propose using FMM for the volume-to-volume contribution of inhomogeneous Poisson-like problems, where the boundary integral is a small part of the overall computation. Our method may be used to precondition sparse matrices arising from finite difference/element discretizations, and can handle a broader range of scientific applications. It is capable of algebraic convergence rates down to the truncation error of the discretized PDE comparable to those of multigrid methods, and it offers potentially superior multicore and distributed memory scalability properties on commodity architecture supercomputers. Compared with other methods exploiting the low-rank character of off-diagonal blocks of the dense resolvent operator, FMM-preconditioned Krylov iteration may reduce the amount of communication because it is matrix-free and exploits the tree structure of FMM. We describe our tests in reproducible detail with freely available codes and outline directions for further extensibility.
Van der Vegt, Wim
2010-01-01
Related Drupal Nodes Block This module exposes a block that uses Latent Semantic Analysis (Lsa) internally to suggest three nodes that are relevant to the node a user is viewing. This module performs three tasks. 1) It periodically indexes a Drupal site and generates a Lsa Term Document Matrix.
DEFF Research Database (Denmark)
Dickson, Thomas
2002-01-01
Artiklen indleder med: ved siden aaf Londons etablerede designmesse '100% Design', er der vokset et undergrundsmiljø af designudstillinger op. Det dominerende og mest kendte initiativ er Designers Block, der i år udstillede to steder i byen. Designers Block er et mere uformelt udstillingsforum...
Abel-grassmann's groupoids of modulo matrices
International Nuclear Information System (INIS)
Javaid, Q.; Awan, M.D.; Naqvi, S.H.A.
2016-01-01
The binary operation of usual addition is associative in all matrices over R. However, a binary operation of addition in matrices over Z/sub n/ of a nonassociative structures of AG-groupoids and AG-groups are defined and investigated here. It is shown that both these structures exist for every integer n >≥ 3. Various properties of these structures are explored like: (i) Every AG-groupoid of matrices over Z/sub n/ is transitively commutative AG-groupoid and is a cancellative AG-groupoid if n is prime. (ii) Every AG-groupoid of matrices over Z/sub n/ of Type-II is a T/sup 3/-AG-groupoid. (iii) An AG-groupoid of matrices over Z/sub n/ ; G /sub nAG/(t,u), is an AG-band, if t+u=1(mod n). (author)
Braiding properties of the N = 1 super-conformal blocks (Ramond sector)
Chorążkiewicz, Damian; Hadasz, Leszek; Jaskólski, Zbigniew
2011-11-01
Using a super scalar field representation of the chiral vertex operators we develop a general method of calculating braiding matrices for all types of N = 1 superconformal 4-point blocks involving Ramond external weights. We give explicit analytic formulae in a number of cases.
International Nuclear Information System (INIS)
Tosi, E.; Ruti, P.; Tibaldi, S.; D'Andrea, F.
1994-01-01
Tibaldi and Molteni (1990, hereafter referred to as TM) had previously investigated operational blocking predictability by the ECMWF model and the possible relationships between model systematic error and blocking in the winter season of the Northern Hemisphere, using seven years of ECMWF operational archives of analyses and day 1 to 10 forecasts. They showed that fewer blocking episodes than in the real atmosphere were generally simulated by the model, and that this deficiency increased with increasing forecast time. As a consequence of this, a major contribution to the systematic error in the winter season was shown to derive from the inability of the model to properly forecast blocking. In this study, the analysis performed in TM for the first seven winter seasons of the ECMWF operational model is extended to the subsequent five winters, during which model development, reflecting both resolution increases and parametrisation modifications, continued unabated. In addition the objective blocking index developed by TM has been applied to the observed data to study the natural low frequency variability of blocking. The ability to simulate blocking of some climate models has also been tested
Substituted amylose matrices for oral drug delivery
International Nuclear Information System (INIS)
Moghadam, S H; Wang, H W; El-Leithy, E Saddar; Chebli, C; Cartilier, L
2007-01-01
High amylose corn starch was used to obtain substituted amylose (SA) polymers by chemically modifying hydroxyl groups by an etherification process using 1,2-epoxypropanol. Tablets for drug-controlled release were prepared by direct compression and their release properties assessed by an in vitro dissolution test (USP XXIII no 2). The polymer swelling was characterized by measuring gravimetrically the water uptake ability of polymer tablets. SA hydrophilic matrix tablets present sequentially a burst effect, typical of hydrophilic matrices, and a near constant release, typical of reservoir systems. After the burst effect, surface pores disappear progressively by molecular association of amylose chains; this allows the creation of a polymer layer acting as a diffusion barrier and explains the peculiar behaviour of SA polymers. Several formulation parameters such as compression force, drug loading, tablet weight and insoluble diluent concentration were investigated. On the other hand, tablet thickness, scanning electron microscope analysis and mercury intrusion porosimetry showed that the high crushing strength values observed for SA tablets were due to an unusual melting process occurring during tabletting although the tablet external layer went only through densification, deformation and partial melting. In contrast, HPMC tablets did not show any traces of a melting process
LIBS analysis of artificial calcified tissues matrices.
Kasem, M A; Gonzalez, J J; Russo, R E; Harith, M A
2013-04-15
In most laser-based analytical methods, the reproducibility of quantitative measurements strongly depends on maintaining uniform and stable experimental conditions. For LIBS analysis this means that for accurate estimation of elemental concentration, using the calibration curves obtained from reference samples, the plasma parameters have to be kept as constant as possible. In addition, calcified tissues such as bone are normally less "tough" in their texture than many samples, especially metals. Thus, the ablation process could change the sample morphological features rapidly, and result in poor reproducibility statistics. In the present work, three artificial reference sample sets have been fabricated. These samples represent three different calcium based matrices, CaCO3 matrix, bone ash matrix and Ca hydroxyapatite matrix. A comparative study of UV (266 nm) and IR (1064 nm) LIBS for these three sets of samples has been performed under similar experimental conditions for the two systems (laser energy, spot size, repetition rate, irradiance, etc.) to examine the wavelength effect. The analytical results demonstrated that UV-LIBS has improved reproducibility, precision, stable plasma conditions, better linear fitting, and the reduction of matrix effects. Bone ash could be used as a suitable standard reference material for calcified tissue calibration using LIBS with a 266 nm excitation wavelength. Copyright © 2013 Elsevier B.V. All rights reserved.
Neutrino mass matrices with vanishing determinant
International Nuclear Information System (INIS)
Chauhan, Bhag C.; Pulido, Joao; Picariello, Marco
2006-01-01
We investigate the prospects for neutrinoless double beta decay, texture zeros. and equalities between neutrino mass matrix elements in scenarios with vanishing determinant mass matrices for vanishing and finite θ 13 mixing angles in normal and inverse mass hierarchies. For normal hierarchy and both zero and finite θ 13 it is found that neutrinoless double beta decay cannot be observed by any of the present or next generation experiments, while for inverse hierarchy it is, on the contrary, accessible to experiments. Regarding texture zeros and equalities between mass matrix elements, we find that in both normal and inverse hierarchies with θ 13 =0 no texture zeros nor any such equalities can exist apart from the obvious ones. For θ 13 ≠0 some texture zeros become possible. In normal hierarchy two texture zeros occur if 8.1x10 -2 ≤sinθ 13 ≤9.1x10 -2 while in inverse hierarchy three are possible, one with sinθ 13 ≥7x10 -3 and two others with sinθ 13 ≥0.18. All equalities between mass matrix elements are impossible with θ 13 ≠0
Calculating scattering matrices by wave function matching
International Nuclear Information System (INIS)
Zwierzycki, M.; Khomyakov, P.A.; Starikov, A.A.; Talanana, M.; Xu, P.X.; Karpan, V.M.; Marushchenko, I.; Brocks, G.; Kelly, P.J.; Xia, K.; Turek, I.; Bauer, G.E.W.
2008-01-01
The conductance of nanoscale structures can be conveniently related to their scattering properties expressed in terms of transmission and reflection coefficients. Wave function matching (WFM) is a transparent technique for calculating transmission and reflection matrices for any Hamiltonian that can be represented in tight-binding form. A first-principles Kohn-Sham Hamiltonian represented on a localized orbital basis or on a real space grid has such a form. WFM is based upon direct matching of the scattering-region wave function to the Bloch modes of ideal leads used to probe the scattering region. The purpose of this paper is to give a pedagogical introduction to WFM and present some illustrative examples of its use in practice. We briefly discuss WFM for calculating the conductance of atomic wires, using a real space grid implementation. A tight-binding muffin-tin orbital implementation very suitable for studying spin-dependent transport in layered magnetic materials is illustrated by looking at spin-dependent transmission through ideal and disordered interfaces. (copyright 2008 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim) (orig.)
Probing the Topology of Density Matrices
Directory of Open Access Journals (Sweden)
Charles-Edouard Bardyn
2018-02-01
Full Text Available The mixedness of a quantum state is usually seen as an adversary to topological quantization of observables. For example, exact quantization of the charge transported in a so-called Thouless adiabatic pump is lifted at any finite temperature in symmetry-protected topological insulators. Here, we show that certain directly observable many-body correlators preserve the integrity of topological invariants for mixed Gaussian quantum states in one dimension. Our approach relies on the expectation value of the many-body momentum-translation operator and leads to a physical observable—the “ensemble geometric phase” (EGP—which represents a bona fide geometric phase for mixed quantum states, in the thermodynamic limit. In cyclic protocols, the EGP provides a topologically quantized observable that detects encircled spectral singularities (“purity-gap” closing points of density matrices. While we identify the many-body nature of the EGP as a key ingredient, we propose a conceptually simple, interferometric setup to directly measure the latter in experiments with mesoscopic ensembles of ultracold atoms.
Visualizing complex (hydrological) systems with correlation matrices
Haas, J. C.
2016-12-01
When trying to understand or visualize the connections of different aspects of a complex system, this often requires deeper understanding to start with, or - in the case of geo data - complicated GIS software. To our knowledge, correlation matrices have rarely been used in hydrology (e.g. Stoll et al., 2011; van Loon and Laaha, 2015), yet they do provide an interesting option for data visualization and analysis. We present a simple, python based way - using a river catchment as an example - to visualize correlations and similarities in an easy and colorful way. We apply existing and easy to use python packages from various disciplines not necessarily linked to the Earth sciences and can thus quickly show how different aquifers work or react, and identify outliers, enabling this system to also be used for quality control of large datasets. Going beyond earlier work, we add a temporal and spatial element, enabling us to visualize how a system reacts to local phenomena such as for example a river, or changes over time, by visualizing the passing of time in an animated movie. References: van Loon, A.F., Laaha, G.: Hydrological drought severity explained by climate and catchment characteristics, Journal of Hydrology 526, 3-14, 2015, Drought processes, modeling, and mitigation Stoll, S., Hendricks Franssen, H. J., Barthel, R., Kinzelbach, W.: What can we learn from long-term groundwater data to improve climate change impact studies?, Hydrology and Earth System Sciences 15(12), 3861-3875, 2011
Decellularized matrices for cardiovascular tissue engineering.
Moroni, Francesco; Mirabella, Teodelinda
2014-01-01
Cardiovascular disease (CVD) is one of the leading causes of death in the Western world. The replacement of damaged vessels and valves has been practiced since the 1950's. Synthetic grafts, usually made of bio-inert materials, are long-lasting and mechanically relevant, but fail when it comes to "biointegration". Decellularized matrices, instead, can be considered biological grafts capable of stimulating in vivo migration and proliferation of endothelial cells (ECs), recruitment and differentiation of mural cells, finally, culminating in the formation of a biointegrated tissue. Decellularization protocols employ osmotic shock, ionic and non-ionic detergents, proteolitic digestions and DNase/RNase treatments; most of them effectively eliminate the cellular component, but show limitations in preserving the native structure of the extracellular matrix (ECM). In this review, we examine the current state of the art relative to decellularization techniques and biological performance of decellularized heart, valves and big vessels. Furthermore, we focus on the relevance of ECM components, native and resulting from decellularization, in mediating in vivo host response and determining repair and regeneration, as opposed to graft corruption.
On some Toeplitz matrices and their inversions
Directory of Open Access Journals (Sweden)
S. Dutta
2014-10-01
Full Text Available In this article, using the difference operator B(a[m], we introduce a lower triangular Toeplitz matrix T which includes several difference matrices such as Δ(1,Δ(m,B(r,s,B(r,s,t, and B(r̃,s̃,t̃,ũ in different special cases. For any x ∈ w and m∈N0={0,1,2,…}, the difference operator B(a[m] is defined by (B(a[m]xk=ak(0xk+ak-1(1xk-1+ak-2(2xk-2+⋯+ak-m(mxk-m,(k∈N0 where a[m] = {a(0, a(1, …, a(m} and a(i = (ak(i for 0 ⩽ i ⩽ m are convergent sequences of real numbers. We use the convention that any term with negative subscript is equal to zero. The main results of this article relate to the determination and applications of the inverse of the Toeplitz matrix T.
31 CFR 594.301 - Blocked account; blocked property.
2010-07-01
... (Continued) OFFICE OF FOREIGN ASSETS CONTROL, DEPARTMENT OF THE TREASURY GLOBAL TERRORISM SANCTIONS REGULATIONS General Definitions § 594.301 Blocked account; blocked property. The terms blocked account and...
Tompkins, Gail E.; Camp, Donna J.
1988-01-01
Describes four prewriting techniques that elementary and middle grade students can use to gather and organize ideas for writing, and by so doing, cure writer's block. Techniques discussed are: (1) brainstorming; (2) clustering; (3) freewriting; and (4) cubing.
Block copolymer battery separator
Wong, David; Balsara, Nitash Pervez
2016-04-26
The invention herein described is the use of a block copolymer/homopolymer blend for creating nanoporous materials for transport applications. Specifically, this is demonstrated by using the block copolymer poly(styrene-block-ethylene-block-styrene) (SES) and blending it with homopolymer polystyrene (PS). After blending the polymers, a film is cast, and the film is submerged in tetrahydrofuran, which removes the PS. This creates a nanoporous polymer film, whereby the holes are lined with PS. Control of morphology of the system is achieved by manipulating the amount of PS added and the relative size of the PS added. The porous nature of these films was demonstrated by measuring the ionic conductivity in a traditional battery electrolyte, 1M LiPF.sub.6 in EC/DEC (1:1 v/v) using AC impedance spectroscopy and comparing these results to commercially available battery separators.
Information geometry of density matrices and state estimation
International Nuclear Information System (INIS)
Brody, Dorje C
2011-01-01
Given a pure state vector |x) and a density matrix ρ-hat, the function p(x|ρ-hat)= defines a probability density on the space of pure states parameterised by density matrices. The associated Fisher-Rao information measure is used to define a unitary invariant Riemannian metric on the space of density matrices. An alternative derivation of the metric, based on square-root density matrices and trace norms, is provided. This is applied to the problem of quantum-state estimation. In the simplest case of unitary parameter estimation, new higher-order corrections to the uncertainty relations, applicable to general mixed states, are derived. (fast track communication)
Chain of matrices, loop equations and topological recursion
Orantin, Nicolas
2009-01-01
Random matrices are used in fields as different as the study of multi-orthogonal polynomials or the enumeration of discrete surfaces. Both of them are based on the study of a matrix integral. However, this term can be confusing since the definition of a matrix integral in these two applications is not the same. These two definitions, perturbative and non-perturbative, are discussed in this chapter as well as their relation. The so-called loop equations satisfied by integrals over random matrices coupled in chain is discussed as well as their recursive solution in the perturbative case when the matrices are Hermitean.
Bott, Lewis; Hoffman, Aaron B.; Murphy, Gregory L.
2007-01-01
Many theories of category learning assume that learning is driven by a need to minimize classification error. When there is no classification error, therefore, learning of individual features should be negligible. We tested this hypothesis by conducting three category learning experiments adapted from an associative learning blocking paradigm. Contrary to an error-driven account of learning, participants learned a wide range of information when they learned about categories, and blocking effe...
Modular Extracellular Matrices: Solutions for the Puzzle
Serban, Monica A.; Prestwich, Glenn D.
2008-01-01
The common technique of growing cells in two-dimensions (2-D) is gradually being replaced by culturing cells on matrices with more appropriate composition and stiffness, or by encapsulation of cells in three-dimensions (3-D). The universal acceptance of the new 3-D paradigm has been constrained by the absence of a commercially available, biocompatible material that offers ease of use, experimental flexibility, and a seamless transition from in vitro to in vivo applications. The challenge – the puzzle that needs a solution – is to replicate the complexity of the native extracellular matrix (ECM) environment with the minimum number of components necessary to allow cells to rebuild and replicate a given tissue. For use in drug discovery, toxicology, cell banking, and ultimately in reparative medicine, the ideal matrix would therefore need to be highly reproducible, manufacturable, approvable, and affordable. Herein we describe the development of a set of modular components that can be assembled into biomimetic materials that meet these requirements. These semi-synthetic ECMs, or sECMs, are based on hyaluronan derivatives that form covalently crosslinked, biodegradable hydrogels suitable for 3-D culture of primary and stem cells in vitro, and for tissue formation in vivo. The sECMs can be engineered to provide appropriate biological cues needed to recapitulate the complexity of a given ECM environment. Specific applications for different sECM compositions include stem cell expansion with control of differentiation, scar-free wound healing, growth factor delivery, cell delivery for osteochondral defect and liver repair, and development of vascularized tumor xenografts for personalized chemotherapy. PMID:18442709
MATXTST, Basic Operations for Covariance Matrices
International Nuclear Information System (INIS)
Geraldo, Luiz P.; Smith, Donald
1989-01-01
1 - Description of program or function: MATXTST and MATXTST1 perform the following operations for a covariance matrix: - test for singularity; - test for positive definiteness; - compute the inverse if the matrix is non-singular; - compute the determinant; - determine the number of positive, negative, and zero eigenvalues; - examine all possible 3 X 3 cross correlations within a sub-matrix corresponding to a leading principal minor which is non-positive definite. While the two programs utilize the same input, the calculational procedures employed are somewhat different and their functions are complementary. The available input options include: i) the full covariance matrix, ii) the basic variables plus the relative covariance matrix, or iii) uncertainties in the basic variables plus the correlation matrix. 2 - Method of solution: MATXTST employs LINPACK subroutines SPOFA and SPODI to test for positive definiteness and to perform further optional calculations. Subroutine SPOFA factors a symmetric matrix M using the Cholesky algorithm to determine the elements of a matrix R which satisfies the relation M=R'R, where R' is the transposed matrix of R. Each leading principal minor of M is tested until the first one is found which is not positive definite. MATXTST1 uses LINPACK subroutines SSICO, SSIFA, and SSIDI to estimate whether the matrix is near to singularity or not (SSICO), and to perform the matrix diagonalization process (SSIFA). The algorithm used in SSIFA is generalization of the Method of Lagrange Reduction. SSIDI is used to compute the determinant and inertia of the matrix. 3 - Restrictions on the complexity of the problem: Matrices of sizes up to 50 X 50 elements can be treated by present versions of the programs
The second immanant of some combinatorial matrices
Directory of Open Access Journals (Sweden)
R. B. Bapat
2015-06-01
Full Text Available Let $A = (a_{i,j}_{1 leq i,j leq n}$ be an $n times n$ matrix where $n geq 2$. Let $dt(A$, its second immanant be the immanant corresponding to the partition $lambda_2 = 2,1^{n-2}$. Let $G$ be a connected graph with blocks $B_1, B_2, ldots B_p$ and with $q$-exponential distance matrix $ED_G$. We given an explicit formula for $dt(ED_G$ which shows that $dt(ED_G$ is independent of the manner in which the blocks are connected. Our result is similar in form to the result of Graham, Hoffman and Hosoya and in spirit to that of Bapat, Lal and Pati who show that $det ED_T$ where $T$ is a tree is independent of the structure of $T$ and only its number of vertices. Our result extends more generally to a product distance matrix associated to a connected graph $G$. Similar results are shown for the $q$-analogue of $T$'s laplacian and a suitably defined matrix for arbitrary connected graphs.
Directory of Open Access Journals (Sweden)
Abdenaceur Boudlal
2010-01-01
Full Text Available This article investigates a new method of motion estimation based on block matching criterion through the modeling of image blocks by a mixture of two and three Gaussian distributions. Mixture parameters (weights, means vectors, and covariance matrices are estimated by the Expectation Maximization algorithm (EM which maximizes the log-likelihood criterion. The similarity between a block in the current image and the more resembling one in a search window on the reference image is measured by the minimization of Extended Mahalanobis distance between the clusters of mixture. Performed experiments on sequences of real images have given good results, and PSNR reached 3 dB.
Joint Estimation of Multiple Precision Matrices with Common Structures.
Lee, Wonyul; Liu, Yufeng
Estimation of inverse covariance matrices, known as precision matrices, is important in various areas of statistical analysis. In this article, we consider estimation of multiple precision matrices sharing some common structures. In this setting, estimating each precision matrix separately can be suboptimal as it ignores potential common structures. This article proposes a new approach to parameterize each precision matrix as a sum of common and unique components and estimate multiple precision matrices in a constrained l 1 minimization framework. We establish both estimation and selection consistency of the proposed estimator in the high dimensional setting. The proposed estimator achieves a faster convergence rate for the common structure in certain cases. Our numerical examples demonstrate that our new estimator can perform better than several existing methods in terms of the entropy loss and Frobenius loss. An application to a glioblastoma cancer data set reveals some interesting gene networks across multiple cancer subtypes.
Systems of Differential Equations with Skew-Symmetric, Orthogonal Matrices
Glaister, P.
2008-01-01
The solution of a system of linear, inhomogeneous differential equations is discussed. The particular class considered is where the coefficient matrix is skew-symmetric and orthogonal, and where the forcing terms are sinusoidal. More general matrices are also considered.
Finiteness properties of congruence classes of infinite matrices
Eggermont, R.H.
2014-01-01
We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.
Flexible Bayesian Dynamic Modeling of Covariance and Correlation Matrices
Lan, Shiwei; Holbrook, Andrew; Fortin, Norbert J.; Ombao, Hernando; Shahbaba, Babak
2017-01-01
Modeling covariance (and correlation) matrices is a challenging problem due to the large dimensionality and positive-definiteness constraint. In this paper, we propose a novel Bayesian framework based on decomposing the covariance matrix
Procrustes Problems for General, Triangular, and Symmetric Toeplitz Matrices
Directory of Open Access Journals (Sweden)
Juan Yang
2013-01-01
Full Text Available The Toeplitz Procrustes problems are the least squares problems for the matrix equation AX=B over some Toeplitz matrix sets. In this paper the necessary and sufficient conditions are obtained about the existence and uniqueness for the solutions of the Toeplitz Procrustes problems when the unknown matrices are constrained to the general, the triangular, and the symmetric Toeplitz matrices, respectively. The algorithms are designed and the numerical examples show that these algorithms are feasible.
An introduction to the theory of canonical matrices
Turnbull, H W
2004-01-01
Thorough and self-contained, this penetrating study of the theory of canonical matrices presents a detailed consideration of all the theory's principal features. Topics include elementary transformations and bilinear and quadratic forms; canonical reduction of equivalent matrices; subgroups of the group of equivalent transformations; and rational and classical canonical forms. The final chapters explore several methods of canonical reduction, including those of unitary and orthogonal transformations. 1952 edition. Index. Appendix. Historical notes. Bibliographies. 275 problems.
Dynamical correlations for circular ensembles of random matrices
International Nuclear Information System (INIS)
Nagao, Taro; Forrester, Peter
2003-01-01
Circular Brownian motion models of random matrices were introduced by Dyson and describe the parametric eigenparameter correlations of unitary random matrices. For symmetric unitary, self-dual quaternion unitary and an analogue of antisymmetric Hermitian matrix initial conditions, Brownian dynamics toward the unitary symmetry is analyzed. The dynamical correlation functions of arbitrary number of Brownian particles at arbitrary number of times are shown to be written in the forms of quaternion determinants, similarly as in the case of Hermitian random matrix models
Complementary Set Matrices Satisfying a Column Correlation Constraint
Wu, Di; Spasojevic, Predrag
2006-01-01
Motivated by the problem of reducing the peak to average power ratio (PAPR) of transmitted signals, we consider a design of complementary set matrices whose column sequences satisfy a correlation constraint. The design algorithm recursively builds a collection of $2^{t+1}$ mutually orthogonal (MO) complementary set matrices starting from a companion pair of sequences. We relate correlation properties of column sequences to that of the companion pair and illustrate how to select an appropriate...
Open vessel microwave digestion of food matrices (T6)
International Nuclear Information System (INIS)
Rhodes, L.; LeBlanc, G.
2002-01-01
Full text: Advancements in the field of open vessel microwave digestion continue to provide solutions for industries requiring acid digestion of large sample sizes. Those interesting in digesting food matrices are particularly interested in working with large amounts of sample and then diluting small final volumes. This paper will show the advantages of instantaneous regent addition and post-digestion evaporation when performing an open vessel digestion and evaporation methods for various food matrices will be presented along with analyte recovery data. (author)
Quantum Algorithms for Weighing Matrices and Quadratic Residues
van Dam, Wim
2000-01-01
In this article we investigate how we can employ the structure of combinatorial objects like Hadamard matrices and weighing matrices to device new quantum algorithms. We show how the properties of a weighing matrix can be used to construct a problem for which the quantum query complexity is ignificantly lower than the classical one. It is pointed out that this scheme captures both Bernstein & Vazirani's inner-product protocol, as well as Grover's search algorithm. In the second part of the ar...
Asymptotic Distribution of Eigenvalues of Weakly Dilute Wishart Matrices
Energy Technology Data Exchange (ETDEWEB)
Khorunzhy, A. [Institute for Low Temperature Physics (Ukraine)], E-mail: khorunjy@ilt.kharkov.ua; Rodgers, G. J. [Brunel University, Uxbridge, Department of Mathematics and Statistics (United Kingdom)], E-mail: g.j.rodgers@brunel.ac.uk
2000-03-15
We study the eigenvalue distribution of large random matrices that are randomly diluted. We consider two random matrix ensembles that in the pure (nondilute) case have a limiting eigenvalue distribution with a singular component at the origin. These include the Wishart random matrix ensemble and Gaussian random matrices with correlated entries. Our results show that the singularity in the eigenvalue distribution is rather unstable under dilution and that even weak dilution destroys it.
Inference for High-dimensional Differential Correlation Matrices.
Cai, T Tony; Zhang, Anru
2016-01-01
Motivated by differential co-expression analysis in genomics, we consider in this paper estimation and testing of high-dimensional differential correlation matrices. An adaptive thresholding procedure is introduced and theoretical guarantees are given. Minimax rate of convergence is established and the proposed estimator is shown to be adaptively rate-optimal over collections of paired correlation matrices with approximately sparse differences. Simulation results show that the procedure significantly outperforms two other natural methods that are based on separate estimation of the individual correlation matrices. The procedure is also illustrated through an analysis of a breast cancer dataset, which provides evidence at the gene co-expression level that several genes, of which a subset has been previously verified, are associated with the breast cancer. Hypothesis testing on the differential correlation matrices is also considered. A test, which is particularly well suited for testing against sparse alternatives, is introduced. In addition, other related problems, including estimation of a single sparse correlation matrix, estimation of the differential covariance matrices, and estimation of the differential cross-correlation matrices, are also discussed.
Uniaxial backfill block compaction
International Nuclear Information System (INIS)
Koskinen, V.
2012-05-01
The main parts of the project were: to make a literature survey of the previous uniaxial compaction experiments; do uniaxial compaction tests in laboratory scale; and do industrial scale production tests. Object of the project was to sort out the different factors affecting the quality assurance chain of the backfill block uniaxial production and solve a material sticking to mould problem which appeared during manufacturing the blocks of bentonite and cruched rock mixture. The effect of mineralogical and chemical composition on the long term functionality of the backfill was excluded from the project. However, the used smectite-rich clays have been tested for mineralogical consistency. These tests were done in B and Tech OY according their SOPs. The objective of the Laboratory scale tests was to find right material- and compaction parameters for the industrial scale tests. Direct comparison between the laboratory scale tests and industrial scale tests is not possible because the mould geometry and compaction speed has a big influence for the compaction process. For this reason the selected material parameters were also affected by the previous compaction experiments. The industrial scale tests were done in summer of 2010 in southern Sweden. Blocks were done with uniaxial compaction. A 40 tons of the mixture of bentonite and crushed rock blocks and almost 50 tons of Friedland-clay blocks were compacted. (orig.)
Impression block with orientator
International Nuclear Information System (INIS)
Brilin, V I; Ulyanova, O S
2015-01-01
Tool review, namely the impression block, applied to check the shape and size of the top of fish as well as to determine the appropriate tool for fishing operation was realized. For multiple application and obtaining of the impress depth of 3 cm and more, the standard volumetric impression blocks with fix rods are used. However, the registered impress of fish is not oriented in space and the rods during fishing are in the extended position. This leads to rods deformation and sinking due to accidental impacts of impression block over the borehole irregularity and finally results in faulty detection of the top end of fishing object in hole. The impression blocks with copy rods and fixed magnetic needle allow estimating the object configuration and fix the position of magnetic needle determining the position of the top end of object in hole. However, the magnetic needle fixation is realized in staged and the rods are in extended position during fishing operations as well as it is in standard design. The most efficient tool is the impression block with copy rods which directs the examined object in the borehole during readings of magnetic needles data from azimuth plate and averaging of readings. This significantly increases the accuracy of fishing toll direction. The rods during fishing are located in the body and extended only when they reach the top of fishing object
Modular transformations of conformal blocks in WZW models on Riemann surfaces of higher genus
International Nuclear Information System (INIS)
Miao Li; Ming Yu.
1989-05-01
We derive the modular transformations for conformal blocks in Wess-Zumino-Witten models on Riemann surfaces of higher genus. The basic ingredient consists of using the Chern-Simons theory developed by Witten. We find that the modular transformations generated by Dehn twists are linear combinations of Wilson line operators, which can be expressed in terms of braiding matrices. It can also be shown that modular transformation matrices for g > 0 Riemann surfaces depend only on those for g ≤ 3. (author). 13 refs, 15 figs
Estimated correlation matrices and portfolio optimization
Pafka, Szilárd; Kondor, Imre
2004-11-01
Correlations of returns on various assets play a central role in financial theory and also in many practical applications. From a theoretical point of view, the main interest lies in the proper description of the structure and dynamics of correlations, whereas for the practitioner the emphasis is on the ability of the models to provide adequate inputs for the numerous portfolio and risk management procedures used in the financial industry. The theory of portfolios, initiated by Markowitz, has suffered from the “curse of dimensions” from the very outset. Over the past decades a large number of different techniques have been developed to tackle this problem and reduce the effective dimension of large bank portfolios, but the efficiency and reliability of these procedures are extremely hard to assess or compare. In this paper, we propose a model (simulation)-based approach which can be used for the systematical testing of all these dimensional reduction techniques. To illustrate the usefulness of our framework, we develop several toy models that display some of the main characteristic features of empirical correlations and generate artificial time series from them. Then, we regard these time series as empirical data and reconstruct the corresponding correlation matrices which will inevitably contain a certain amount of noise, due to the finiteness of the time series. Next, we apply several correlation matrix estimators and dimension reduction techniques introduced in the literature and/or applied in practice. As in our artificial world the only source of error is the finite length of the time series and, in addition, the “true” model, hence also the “true” correlation matrix, are precisely known, therefore in sharp contrast with empirical studies, we can precisely compare the performance of the various noise reduction techniques. One of our recurrent observations is that the recently introduced filtering technique based on random matrix theory performs
International Nuclear Information System (INIS)
Cunningham, C.; Simpkin, S.D.
1975-01-01
A prismatic moderator block is described which has fuel-containing channels and coolant channels disposed parallel to each other and to edge faces of the block. The coolant channels are arranged in rows on an equilateral triangular lattice pattern and the fuel-containing channels are disposed in a regular lattice pattern with one fuel-containing channel between and equidistant from each of the coolant channels in each group of three mutually adjacent coolant channels. The edge faces of the block are parallel to the rows of coolant channels and the channels nearest to each edge face are disposed in two rows parallel thereto, with one of the rows containing only coolant channels and the other row containing only fuel-containing channels. (Official Gazette)
DEFF Research Database (Denmark)
Bussink, Barbara E; Holst, Anders Gaarsdal; Jespersen, Lasse
2013-01-01
AimsTo determine the prevalence, predictors of newly acquired, and the prognostic value of right bundle branch block (RBBB) and incomplete RBBB (IRBBB) on a resting 12-lead electrocardiogram in men and women from the general population.Methods and resultsWe followed 18 441 participants included...... in the Copenhagen City Heart Study examined in 1976-2003 free from previous myocardial infarction (MI), chronic heart failure, and left bundle branch block through registry linkage until 2009 for all-cause mortality and cardiovascular outcomes. The prevalence of RBBB/IRBBB was higher in men (1.4%/4.7% in men vs. 0.......5%/2.3% in women, P block was associated with significantly...
["Habitual" left branch block alternating with 2 "disguised" bracnch block].
Lévy, S; Jullien, G; Mathieu, P; Mostefa, S; Gérard, R
1976-10-01
Two cases of alternating left bundle branch block and "masquerading block" (with left bundle branch morphology in the stnadard leads and right bundle branch block morphology in the precordial leads) were studied by serial tracings and his bundle electrocardiography. In case 1 "the masquerading" block was associated with a first degree AV block related to a prolongation of HV interval. This case is to our knowledge the first cas of alternating bundle branch block in which his bundle activity was recorded in man. In case 2, the patient had atrial fibrilation and His bundle recordings were performed while differents degrees of left bundle branch block were present: The mechanism of the alternation and the concept of "masquerading" block are discussed. It is suggested that this type of block represents a right bundle branch block associated with severe lesions of the "left system".
E-Block: A Tangible Programming Tool with Graphical Blocks
Danli Wang; Yang Zhang; Shengyong Chen
2013-01-01
This paper designs a tangible programming tool, E-Block, for children aged 5 to 9 to experience the preliminary understanding of programming by building blocks. With embedded artificial intelligence, the tool defines the programming blocks with the sensors as the input and enables children to write programs to complete the tasks in the computer. The symbol on the programming block's surface is used to help children understanding the function of each block. The sequence information is transfer...
International Nuclear Information System (INIS)
Chudnovsky, D.V.; Chudnovsky, G.V.
1980-01-01
We consider semi-classical approximation to factorized S-matrices. We show that this new class of matrices, called s-matrices, defines Hamiltonian structures for isospectral deformation equations. Concrete examples of factorized s-matrices are constructed and they are used to define Hamiltonian structure for general two-dimensional isospectral deformation systems. (orig.)
Agricultural matrices affect ground ant assemblage composition inside forest fragments.
Directory of Open Access Journals (Sweden)
Diego Santana Assis
Full Text Available The establishment of agricultural matrices generally involves deforestation, which leads to fragmentation of the remaining forest. This fragmentation can affect forest dynamics both positively and negatively. Since most animal species are affected, certain groups can be used to measure the impact of such fragmentation. This study aimed to measure the impacts of agricultural crops (matrices on ant communities of adjacent lower montane Atlantic rainforest fragments. We sampled nine forest fragments at locations surrounded by different agricultural matrices, namely: coffee (3 replicates; sugarcane (3; and pasture (3. At each site we installed pitfall traps along a 500 m transect from the interior of the matrix to the interior of the fragment (20 pitfall traps ~25 m apart. Each transect was partitioned into four categories: interior of the matrix; edge of the matrix; edge of the fragment; and interior of the fragment. For each sample site, we measured ant species richness and ant community composition within each transect category. Ant richness and composition differed between fragments and matrices. Each sample location had a specific composition of ants, probably because of the influence of the nature and management of the agricultural matrices. Species composition in the coffee matrix had the highest similarity to its corresponding fragment. The variability in species composition within forest fragments surrounded by pasture was greatest when compared with forest fragments surrounded by sugarcane or, to a lesser extent, coffee. Functional guild composition differed between locations, but the most representative guild was 'generalist' both in the agricultural matrices and forest fragments. Our results are important for understanding how agricultural matrices act on ant communities, and also, how these isolated forest fragments could act as an island of biodiversity in an 'ocean of crops'.
Agricultural matrices affect ground ant assemblage composition inside forest fragments.
Assis, Diego Santana; Dos Santos, Iracenir Andrade; Ramos, Flavio Nunes; Barrios-Rojas, Katty Elena; Majer, Jonathan David; Vilela, Evaldo Ferreira
2018-01-01
The establishment of agricultural matrices generally involves deforestation, which leads to fragmentation of the remaining forest. This fragmentation can affect forest dynamics both positively and negatively. Since most animal species are affected, certain groups can be used to measure the impact of such fragmentation. This study aimed to measure the impacts of agricultural crops (matrices) on ant communities of adjacent lower montane Atlantic rainforest fragments. We sampled nine forest fragments at locations surrounded by different agricultural matrices, namely: coffee (3 replicates); sugarcane (3); and pasture (3). At each site we installed pitfall traps along a 500 m transect from the interior of the matrix to the interior of the fragment (20 pitfall traps ~25 m apart). Each transect was partitioned into four categories: interior of the matrix; edge of the matrix; edge of the fragment; and interior of the fragment. For each sample site, we measured ant species richness and ant community composition within each transect category. Ant richness and composition differed between fragments and matrices. Each sample location had a specific composition of ants, probably because of the influence of the nature and management of the agricultural matrices. Species composition in the coffee matrix had the highest similarity to its corresponding fragment. The variability in species composition within forest fragments surrounded by pasture was greatest when compared with forest fragments surrounded by sugarcane or, to a lesser extent, coffee. Functional guild composition differed between locations, but the most representative guild was 'generalist' both in the agricultural matrices and forest fragments. Our results are important for understanding how agricultural matrices act on ant communities, and also, how these isolated forest fragments could act as an island of biodiversity in an 'ocean of crops'.
Linoleum Block Printing Revisited.
Chetelat, Frank J.
1980-01-01
The author discusses practical considerations of teaching linoleum block printing in the elementary grades (tool use, materials, motivation) and outlines a sequence of design concepts in this area for the primary, intermediate and junior high grades. A short list of books and audiovisual aids is appended. (SJL)
Science Teacher, 2005
2005-01-01
Curcumin, the pungent yellow spice found in both turmeric and curry powders, blocks a key biological pathway needed for development of melanoma and other cancers, according to a study that appears in the journal Cancer. Researchers from The University of Texas M. D. Anderson Cancer Center demonstrate how curcumin stops laboratory strains of…
Contaminated soil concrete blocks
de Korte, A.C.J.; Brouwers, Jos; Limbachiya, Mukesh C.; Kew, Hsein Y.
2009-01-01
According to Dutch law the contaminated soil needs to be remediated or immobilised. The main focus in this article is the design of concrete blocks, containing contaminated soil, that are suitable for large production, financial feasible and meets all technical and environmental requirements. In
Theoretical Properties for Neural Networks with Weight Matrices of Low Displacement Rank
Zhao, Liang; Liao, Siyu; Wang, Yanzhi; Li, Zhe; Tang, Jian; Pan, Victor; Yuan, Bo
2017-01-01
Recently low displacement rank (LDR) matrices, or so-called structured matrices, have been proposed to compress large-scale neural networks. Empirical results have shown that neural networks with weight matrices of LDR matrices, referred as LDR neural networks, can achieve significant reduction in space and computational complexity while retaining high accuracy. We formally study LDR matrices in deep learning. First, we prove the universal approximation property of LDR neural networks with a ...
Hierarchical Matrices Method and Its Application in Electromagnetic Integral Equations
Directory of Open Access Journals (Sweden)
Han Guo
2012-01-01
Full Text Available Hierarchical (H- matrices method is a general mathematical framework providing a highly compact representation and efficient numerical arithmetic. When applied in integral-equation- (IE- based computational electromagnetics, H-matrices can be regarded as a fast algorithm; therefore, both the CPU time and memory requirement are reduced significantly. Its kernel independent feature also makes it suitable for any kind of integral equation. To solve H-matrices system, Krylov iteration methods can be employed with appropriate preconditioners, and direct solvers based on the hierarchical structure of H-matrices are also available along with high efficiency and accuracy, which is a unique advantage compared to other fast algorithms. In this paper, a novel sparse approximate inverse (SAI preconditioner in multilevel fashion is proposed to accelerate the convergence rate of Krylov iterations for solving H-matrices system in electromagnetic applications, and a group of parallel fast direct solvers are developed for dealing with multiple right-hand-side cases. Finally, numerical experiments are given to demonstrate the advantages of the proposed multilevel preconditioner compared to conventional “single level” preconditioners and the practicability of the fast direct solvers for arbitrary complex structures.
MALDI matrices for low molecular weight compounds: an endless story?
Calvano, Cosima Damiana; Monopoli, Antonio; Cataldi, Tommaso R I; Palmisano, Francesco
2018-04-23
Since its introduction in the 1980s, matrix-assisted laser desorption/ionization mass spectrometry (MALDI MS) has gained a prominent role in the analysis of high molecular weight biomolecules such as proteins, peptides, oligonucleotides, and polysaccharides. Its application to low molecular weight compounds has remained for long time challenging due to the spectral interferences produced by conventional organic matrices in the low m/z window. To overcome this problem, specific sample preparation such as analyte/matrix derivatization, addition of dopants, or sophisticated deposition technique especially useful for imaging experiments, have been proposed. Alternative approaches based on second generation (rationally designed) organic matrices, ionic liquids, and inorganic matrices, including metallic nanoparticles, have been the object of intense and continuous research efforts. Definite evidences are now provided that MALDI MS represents a powerful and invaluable analytical tool also for small molecules, including their quantification, thus opening new, exciting applications in metabolomics and imaging mass spectrometry. This review is intended to offer a concise critical overview of the most recent achievements about MALDI matrices capable of specifically address the challenging issue of small molecules analysis. Graphical abstract An ideal Book of matrices for MALDI MS of small molecules.
Hypersymmetric functions and Pochhammers of 2×2 nonautonomous matrices
Directory of Open Access Journals (Sweden)
A. F. Antippa
2004-01-01
Full Text Available We introduce the hypersymmetric functions of 2×2 nonautonomous matrices and show that they are related, by simple expressions, to the Pochhammers (factorial polynomials of these matrices. The hypersymmetric functions are generalizations of the associated elementary symmetric functions, and for a specific class of 2×2 matrices, having a high degree of symmetry, they reduce to these latter functions. This class of matrices includes rotations, Lorentz boosts, and discrete time generators for the harmonic oscillators. The hypersymmetric functions are defined over four sets of independent indeterminates using a triplet of interrelated binary partitions. We work out the algebra of this triplet of partitions and then make use of the results in order to simplify the expressions for the hypersymmetric functions for a special class of matrices. In addition to their obvious applications in matrix theory, in coupled difference equations, and in the theory of symmetric functions, the results obtained here also have useful applications in problems involving successive rotations, successive Lorentz transformations, discrete harmonic oscillators, and linear two-state systems.
Abdominal wall blocks in adults
DEFF Research Database (Denmark)
Børglum, Jens; Gögenür, Ismail; Bendtsen, Thomas F
2016-01-01
been introduced with success. Future research should also investigate the effect of specific abdominal wall blocks on neuroendocrine and inflammatory stress response after surgery. Summary USG abdominal wall blocks in adults are commonplace techniques today. Most abdominal wall blocks are assigned......Purpose of review Abdominal wall blocks in adults have evolved much during the last decade; that is, particularly with the introduction of ultrasound-guided (USG) blocks. This review highlights recent advances of block techniques within this field and proposes directions for future research....... Recent findings Ultrasound guidance is now considered the golden standard for abdominal wall blocks in adults, even though some landmark-based blocks are still being investigated. The efficiency of USG transversus abdominis plane blocks in relation to many surgical procedures involving the abdominal wall...
Nano-Fiber Reinforced Enhancements in Composite Polymer Matrices
Chamis, Christos C.
2009-01-01
Nano-fibers are used to reinforce polymer matrices to enhance the matrix dependent properties that are subsequently used in conventional structural composites. A quasi isotropic configuration is used in arranging like nano-fibers through the thickness to ascertain equiaxial enhanced matrix behavior. The nano-fiber volume ratios are used to obtain the enhanced matrix strength properties for 0.01,0.03, and 0.05 nano-fiber volume rates. These enhanced nano-fiber matrices are used with conventional fiber volume ratios of 0.3 and 0.5 to obtain the composite properties. Results show that nano-fiber enhanced matrices of higher than 0.3 nano-fiber volume ratio are degrading the composite properties.
Square matrices of order 2 theory, applications, and problems
Pop, Vasile
2017-01-01
This unique and innovative book presents an exciting and complete detail of all the important topics related to the theory of square matrices of order 2. The readers exploring every detailed aspect of matrix theory are gently led toward understanding advanced topics. They will follow every notion of matrix theory with ease, accumulating a thorough understanding of algebraic and geometric aspects of matrices of order 2. The prime jewel of this book is its offering of an unusual collection of problems, theoretically motivated, most of which are new, original, and seeing the light of publication for the first time in the literature. Nearly all of the exercises are presented with detailed solutions and vary in difficulty from easy to more advanced. Many problems are particularly challenging. These, and not only these, invite the reader to unleash their creativity and research capabilities and to discover their own methods of attacking a problem. Matrices have a vast practical importance to mathematics, science, a...
Two-mode Gaussian density matrices and squeezing of photons
International Nuclear Information System (INIS)
Tucci, R.R.
1992-01-01
In this paper, the authors generalize to 2-mode states the 1-mode state results obtained in a previous paper. The authors study 2-mode Gaussian density matrices. The authors find a linear transformation which maps the two annihilation operators, one for each mode, into two new annihilation operators that are uncorrelated and unsqueezed. This allows the authors to express the density matrix as a product of two 1-mode density matrices. The authors find general conditions under which 2-mode Gaussian density matrices become pure states. Possible pure states include the 2-mode squeezed pure states commonly mentioned in the literature, plus other pure states never mentioned before. The authors discuss the entropy and thermodynamic laws (Second Law, Fundamental Equation, and Gibbs-Duhem Equation) for the 2-mode states being considered
A Workshop on Algebraic Design Theory and Hadamard Matrices
2015-01-01
This volume develops the depth and breadth of the mathematics underlying the construction and analysis of Hadamard matrices and their use in the construction of combinatorial designs. At the same time, it pursues current research in their numerous applications in security and cryptography, quantum information, and communications. Bridges among diverse mathematical threads and extensive applications make this an invaluable source for understanding both the current state of the art and future directions. The existence of Hadamard matrices remains one of the most challenging open questions in combinatorics. Substantial progress on their existence has resulted from advances in algebraic design theory using deep connections with linear algebra, abstract algebra, finite geometry, number theory, and combinatorics. Hadamard matrices arise in a very diverse set of applications. Starting with applications in experimental design theory and the theory of error-correcting codes, they have found unexpected and important ap...
Asymmetric correlation matrices: an analysis of financial data
Livan, G.; Rebecchi, L.
2012-06-01
We analyse the spectral properties of correlation matrices between distinct statistical systems. Such matrices are intrinsically non-symmetric, and lend themselves to extend the spectral analyses usually performed on standard Pearson correlation matrices to the realm of complex eigenvalues. We employ some recent random matrix theory results on the average eigenvalue density of this type of matrix to distinguish between noise and non-trivial correlation structures, and we focus on financial data as a case study. Namely, we employ daily prices of stocks belonging to the American and British stock exchanges, and look for the emergence of correlations between two such markets in the eigenvalue spectrum of their non-symmetric correlation matrix. We find several non trivial results when considering time-lagged correlations over short lags, and we corroborate our findings by additionally studying the asymmetric correlation matrix of the principal components of our datasets.
Asymptotics of eigenvalues and eigenvectors of Toeplitz matrices
Böttcher, A.; Bogoya, J. M.; Grudsky, S. M.; Maximenko, E. A.
2017-11-01
Analysis of the asymptotic behaviour of the spectral characteristics of Toeplitz matrices as the dimension of the matrix tends to infinity has a history of over 100 years. For instance, quite a number of versions of Szegő's theorem on the asymptotic behaviour of eigenvalues and of the so-called strong Szegő theorem on the asymptotic behaviour of the determinants of Toeplitz matrices are known. Starting in the 1950s, the asymptotics of the maximum and minimum eigenvalues were actively investigated. However, investigation of the individual asymptotics of all the eigenvalues and eigenvectors of Toeplitz matrices started only quite recently: the first papers on this subject were published in 2009-2010. A survey of this new field is presented here. Bibliography: 55 titles.
SNUPPS power block engineering
Energy Technology Data Exchange (ETDEWEB)
Thompson, C A [Bechtel Power Corp., San Francisco, Calif. (USA)
1975-11-01
The Standard Power Block is based on a modular concept and consists of the following: turbine building, auxiliary building, fuel building, control building, radwaste building, diesel generators building, and outside storage tanks and transformers. Each power block unit includes a Westinghouse pressurized water reactor and has a thermal power rating of 3425 MW(t). The corresponding General Electric turbine generator net electrical output is 1188 MW(e). This standardization approach results in not only a reduction in the costs of engineering, licensing, procurement, and project planning, but should also result in additional savings by the application of experience gained in the construction of the first unit to the following units and early input of construction data to design.
Berlin, Joey
2017-04-01
Proponents of a block grant or per-capita cap trumpet them as vehicles for the federal government to give the states a capped amount of funding for Medicaid that legislatures would effectively distribute how they see fit. Questions abound as to what capped Medicaid funding would look like, and what effect it would have on the current Medicaid-eligible population, covered services, and physician payments.
SUPERFICIAL CERVICAL PLEXUS BLOCK
Directory of Open Access Journals (Sweden)
Komang Mega Puspadisari
2014-01-01
Full Text Available Superficial cervical plexus block is one of the regional anesthesia in neck were limited to thesuperficial fascia. Anesthesia is used to relieve pain caused either during or after the surgery iscompleted. This technique can be done by landmark or with ultrasound guiding. The midpointof posterior border of the Sternocleidomastoid was identified and the prosedure done on thatplace or on the level of cartilage cricoid.
E-Block: A Tangible Programming Tool with Graphical Blocks
Directory of Open Access Journals (Sweden)
Danli Wang
2013-01-01
Full Text Available This paper designs a tangible programming tool, E-Block, for children aged 5 to 9 to experience the preliminary understanding of programming by building blocks. With embedded artificial intelligence, the tool defines the programming blocks with the sensors as the input and enables children to write programs to complete the tasks in the computer. The symbol on the programming block's surface is used to help children understanding the function of each block. The sequence information is transferred to computer by microcomputers and then translated into semantic information. The system applies wireless and infrared technologies and provides user with feedbacks on both screen and programming blocks. Preliminary user studies using observation and user interview methods are shown for E-Block's prototype. The test results prove that E-Block is attractive to children and easy to learn and use. The project also highlights potential advantages of using single chip microcomputer (SCM technology to develop tangible programming tools for children.
Random Matrices for Information Processing – A Democratic Vision
DEFF Research Database (Denmark)
Cakmak, Burak
The thesis studies three important applications of random matrices to information processing. Our main contribution is that we consider probabilistic systems involving more general random matrix ensembles than the classical ensembles with iid entries, i.e. models that account for statistical...... dependence between the entries. Specifically, the involved matrices are invariant or fulfill a certain asymptotic freeness condition as their dimensions grow to infinity. Informally speaking, all latent variables contribute to the system model in a democratic fashion – there are no preferred latent variables...
An algebraic model for quark mass matrices with heavy top
International Nuclear Information System (INIS)
Krolikowski, W.; Warsaw Univ.
1991-01-01
In terms of an intergeneration U(3) algebra, a numerical model is constructed for quark mass matrices, predicting the top-quark mass around 170 GeV and the CP-violating phase around 75 deg. The CKM matrix is nonsymmetric in moduli with |V ub | being very small. All moduli are consistent with their experimental limits. The model is motivated by the author's previous work on three replicas of the Dirac particle, presumably resulting into three generations of leptons and quarks. The paper may be also viewed as an introduction to a new method of intrinsic dynamical description of lepton and quark mass matrices. (author)
ON MATRICES ARISING IN RETARDED DELAY DIFFERENTIAL SYSTEMS
Directory of Open Access Journals (Sweden)
S DJEZZAR
2002-12-01
Full Text Available Dans cet article, on considère une classe de système différentiels retardés et à laquelle on associe une matrice système sur R[s,z], l'anneau des polynômes à deux indéterminés s et z. Ensuite, en utilisant la notion de la matrice forme de Smith sur R[s,z], on étend un résultat de caractérisation obtenu précédemment [5] sur les formes canoniques, à un cas plus général.
Soft landing of size selected clusters in rare gas matrices
International Nuclear Information System (INIS)
Lau, J.T; Wurth, W.; Ehrke, H-U.; Achleitner, A.
2003-01-01
Soft landing of mass selected clusters in rare gas matrices is a technique used to preserve mass selection in cluster deposition. To prevent fragmentation upon deposition, the substrate is covered with rare gas matrices to dissipate the cluster kinetic energy upon impact. Theoretical and experimental studies demonstrate the power of this technique. Besides STM, optical absorption, excitation, and fluorescence experiments, x-ray absorption at core levels can be used as a tool to study soft landing conditions, as will be shown here. X-ray absorption spectroscopy is also well suited to follow diffusion and agglomeration of clusters on surfaces via energy shifts in core level absorption
Positive projections of symmetric matrices and Jordan algebras
DEFF Research Database (Denmark)
Fuglede, Bent; Jensen, Søren Tolver
2013-01-01
An elementary proof is given that the projection from the space of all symmetric p×p matrices onto a linear subspace is positive if and only if the subspace is a Jordan algebra. This solves a problem in a statistical model.......An elementary proof is given that the projection from the space of all symmetric p×p matrices onto a linear subspace is positive if and only if the subspace is a Jordan algebra. This solves a problem in a statistical model....
On the Wigner law in dilute random matrices
Khorunzhy, A.; Rodgers, G. J.
1998-12-01
We consider ensembles of N × N symmetric matrices whose entries are weakly dependent random variables. We show that random dilution can change the limiting eigenvalue distribution of such matrices. We prove that under general and natural conditions the normalised eigenvalue counting function coincides with the semicircle (Wigner) distribution in the limit N → ∞. This can be explained by the observation that dilution (or more generally, random modulation) eliminates the weak dependence (or correlations) between random matrix entries. It also supports our earlier conjecture that the Wigner distribution is stable to random dilution and modulation.
Block and sub-block boundary strengthening in lath martensite
Du, C.; Hoefnagels, J.P.M.; Vaes, R.; Geers, M.G.D.
2016-01-01
Well-defined uniaxial micro-tensile tests were performed on lath martensite single block specimens and multi-block specimens with different number of block boundaries parallel to the loading direction. Detailed slip trace analyses consistently revealed that in the {110}<111> slip system with the
Lee, Ken Voon
2013-04-01
The purpose of this action research was to increase the mastery level of Form Five Social Science students in Tawau II National Secondary School in the operations of addition, subtraction and multiplication of matrices in Mathematics. A total of 30 students were involved. Preliminary findings through the analysis of pre-test results and questionnaire had identified the main problem faced in which the students felt confused with the application of principles of the operations of matrices when performing these operations. Therefore, an action research was conducted using an intervention programme called "G.P.S Matrices" to overcome the problem. This programme was divided into three phases. 'Gift of Matrices' phase aimed at forming matrix teaching aids. The second and third phases were 'Positioning the Elements of Matrices' and 'Strenghtening the Concept of Matrices'. These two phases were aimed at increasing the level of understanding and memory of the students towards the principles of matrix operations. Besides, this third phase was also aimed at creating an interesting learning environment. A comparison between the results of pre-test and post-test had shown a remarkable improvement in students' performances after implementing the programme. In addition, the analysis of interview findings also indicated a positive feedback on the changes in students' attitude, particularly in the aspect of students' understanding level. Moreover, the level of students' memory also increased following the use of the concrete matrix teaching aids created in phase one. Besides, teachers felt encouraging when conducive learning environment was created through students' presentation activity held in third phase. Furthermore, students were voluntarily involved in these student-centred activities. In conclusion, this research findings showed an increase in the mastery level of students in these three matrix operations and thus the objective of the research had been achieved.
Identification of fractional-order systems with time delays using block pulse functions
Tang, Yinggan; Li, Ning; Liu, Minmin; Lu, Yao; Wang, Weiwei
2017-07-01
In this paper, a novel method based on block pulse functions is proposed to identify continuous-time fractional-order systems with time delays. First, the operational matrices of block pulse functions for fractional integral operator and time delay operator are derived. Then, these operational matrices are applied to convert the continuous-time fractional-order systems with time delays to an algebraic equation. Finally, the system's parameters along with the differentiation orders and the time delays are all simultaneously estimated through minimizing a quadric error function. The proposed method reduces the computation complexity of the identification process, and also it does not require the system's differentiation orders to be commensurate. The effectiveness of the proposed method are demonstrated by several numerical examples.
Habitat Blocks and Wildlife Corridors
Vermont Center for Geographic Information — Habitat blocks are areas of contiguous forest and other natural habitats that are unfragmented by roads, development, or agriculture. Vermonts habitat blocks are...
Atrioventricular block, ECG tracing (image)
... an abnormal rhythm (arrhythmia) called an atrioventricular (AV) block. P waves show that the top of the ... wave (and heart contraction), there is an atrioventricular block, and a very slow pulse (bradycardia).
Fermion-scalar conformal blocks
Energy Technology Data Exchange (ETDEWEB)
Iliesiu, Luca [Joseph Henry Laboratories, Princeton University,Washington Road, Princeton, NJ 08544 (United States); Kos, Filip [Department of Physics, Yale University,217 Prospect Street, New Haven, CT 06520 (United States); Poland, David [Department of Physics, Yale University,217 Prospect Street, New Haven, CT 06520 (United States); School of Natural Sciences, Institute for Advanced Study,1 Einstein Dr, Princeton, New Jersey 08540 (United States); Pufu, Silviu S. [Joseph Henry Laboratories, Princeton University,Washington Road, Princeton, NJ 08544 (United States); Simmons-Duffin, David [School of Natural Sciences, Institute for Advanced Study,1 Einstein Dr, Princeton, New Jersey 08540 (United States); Yacoby, Ran [Joseph Henry Laboratories, Princeton University,Washington Road, Princeton, NJ 08544 (United States)
2016-04-13
We compute the conformal blocks associated with scalar-scalar-fermion-fermion 4-point functions in 3D CFTs. Together with the known scalar conformal blocks, our result completes the task of determining the so-called ‘seed blocks’ in three dimensions. Conformal blocks associated with 4-point functions of operators with arbitrary spins can now be determined from these seed blocks by using known differential operators.
Powder wastes confinement block and manufacturing process of this block
International Nuclear Information System (INIS)
Dagot, L.; Brunel, G.
1996-01-01
This invention concerns a powder wastes containment block and a manufacturing process of this block. In this block, the waste powder is encapsulated in a thermo hardening polymer as for example an epoxy resin, the encapsulated resin being spread into cement. This block can contain between 45 and 55% in mass of wastes, between 18 and 36% in mass of polymer and between 14 and 32% in mass of cement. Such a containment block can be used for the radioactive wastes storage. (O.M.). 4 refs
Building Curriculum during Block Play
Andrews, Nicole
2015-01-01
Blocks are not just for play! In this article, Nicole Andrews describes observing the interactions of three young boys enthusiastically engaged in the kindergarten block center of their classroom, using blocks in a building project that displayed their ability to use critical thinking skills, physics exploration, and the development of language…
International Nuclear Information System (INIS)
Wenk, E.
1976-01-01
A suggestion is made not to lead the separated nuclear 'waste' from spent nuclear fuel elements directly to end storage, but to make use of the heat produced from the remaining radiation, e.g. for seawater desalination. According to the invention, the activated fission products are to be processed, e.g. by calcination or vitrification, so that one can handle them. They should then be arranged in layers alternately with plate-shaped heat conducting pipes to form a homogeneous block; the heat absorbed by the thermal plates should be further passed on to evaporators or heat exchangers. (UWI) [de
Blocking the Hawking radiation
DEFF Research Database (Denmark)
Autzen, M.; Kouvaris, C.
2014-01-01
grows after its formation (and eventually destroys the star) instead of evaporating. The fate of the black hole is dictated by the two opposite mechanics, i.e., accretion of nuclear matter from the center of the star and Hawking radiation that tends to decrease the mass of the black hole. We study how...... the assumptions for the accretion rate can in fact affect the critical mass beyond which a black hole always grows. We also study to what extent degenerate nuclear matter can impede Hawking radiation due to the fact that emitted particles can be Pauli blocked at the core of the star....
Schur complements of matrices with acyclic bipartite graphs
DEFF Research Database (Denmark)
Britz, Thomas Johann; Olesky, D.D.; van den Driessche, P.
2005-01-01
Bipartite graphs are used to describe the generalized Schur complements of real matrices having nos quare submatrix with two or more nonzero diagonals. For any matrix A with this property, including any nearly reducible matrix, the sign pattern of each generalized Schur complement is shown to be ...
Flexible Bayesian Dynamic Modeling of Covariance and Correlation Matrices
Lan, Shiwei
2017-11-08
Modeling covariance (and correlation) matrices is a challenging problem due to the large dimensionality and positive-definiteness constraint. In this paper, we propose a novel Bayesian framework based on decomposing the covariance matrix into variance and correlation matrices. The highlight is that the correlations are represented as products of vectors on unit spheres. We propose a variety of distributions on spheres (e.g. the squared-Dirichlet distribution) to induce flexible prior distributions for covariance matrices that go beyond the commonly used inverse-Wishart prior. To handle the intractability of the resulting posterior, we introduce the adaptive $\\\\Delta$-Spherical Hamiltonian Monte Carlo. We also extend our structured framework to dynamic cases and introduce unit-vector Gaussian process priors for modeling the evolution of correlation among multiple time series. Using an example of Normal-Inverse-Wishart problem, a simulated periodic process, and an analysis of local field potential data (collected from the hippocampus of rats performing a complex sequence memory task), we demonstrated the validity and effectiveness of our proposed framework for (dynamic) modeling covariance and correlation matrices.
Modeling and Forecasting Large Realized Covariance Matrices and Portfolio Choice
Callot, Laurent A.F.; Kock, Anders B.; Medeiros, Marcelo C.
2017-01-01
We consider modeling and forecasting large realized covariance matrices by penalized vector autoregressive models. We consider Lasso-type estimators to reduce the dimensionality and provide strong theoretical guarantees on the forecast capability of our procedure. We show that we can forecast
BMP-silk composite matrices heal critically sized femoral defects
Kirker-Head, C.; Karageorgiou, V.; Hofmann, S.; Fajardo, R.; Betz, O.; Merkle, H.P.; Hilbe, M.; Rechenberg, von B.; McCool, J.; Abrahamsen, L.; Nazarian, A.; Cory, E.; Curtis, M.; Kaplan, D.L.; Meinel, L.
2007-01-01
Clinical drawbacks of bone grafting prompt the search for alternative bone augmentation technologies such as use of growth and differentiation factors, gene therapy, and cell therapy. Osteopromotive matrices are frequently employed for the local delivery and controlled release of these augmentation
Which matrices are immune against the transportation paradox
Deineko, Vladimir G.; Klinz, Bettina; Woeginger, Gerhard
2003-01-01
We characterize the m×n cost matrices of the transportation problem for which there exist supplies and demands such that the transportation paradox arises. Our characterization is fairly simple and can be verified within O(mn) computational steps. Moreover, we discuss the corresponding question for
A definition of column reduced proper rational matrices
Czech Academy of Sciences Publication Activity Database
Ruiz-León, J. J.; Castellanos, A.; Ramos-Velasco, Luis Enrique
2002-01-01
Roč. 75, č. 3 (2002), s. 195-203 ISSN 0020-7179 R&D Projects: GA AV ČR KSK1019101 Institutional research plan: CEZ:AV0Z1075907 Keywords : linear systems * columm reduced polynomial matrices * decoupling Subject RIV: BC - Control Systems Theory Impact factor: 0.861, year: 2002
Construction of MDS self-dual codes from orthogonal matrices
Shi, Minjia; Sok, Lin; Solé, Patrick
2016-01-01
In this paper, we give algorithms and methods of construction of self-dual codes over finite fields using orthogonal matrices. Randomization in the orthogonal group, and code extension are the main tools. Some optimal, almost MDS, and MDS self-dual codes over both small and large prime fields are constructed.
Designer matrices for intestinal stem cell and organoid culture
Gjorevski, Nikolce; Sachs, Norman; Manfrin, Andrea; Giger, Sonja; Bragina, Maiia E.; Ordóñez-Morán, Paloma; Clevers, Hans; Lutolf, Matthias P.
2016-01-01
Epithelial organoids recapitulate multiple aspects of real organs, making them promising models of organ development, function and disease. However, the full potential of organoids in research and therapy has remained unrealized, owing to the poorly defined animal-derived matrices in which they are
Study on vulnerability matrices of masonry buildings of mainland China
Sun, Baitao; Zhang, Guixin
2018-04-01
The degree and distribution of damage to buildings subjected to earthquakes is a concern of the Chinese Government and the public. Seismic damage data indicates that seismic capacities of different types of building structures in various regions throughout mainland China are different. Furthermore, the seismic capacities of the same type of structure in different regions may vary. The contributions of this research are summarized as follows: 1) Vulnerability matrices and earthquake damage matrices of masonry structures in mainland China were chosen as research samples. The aim was to analyze the differences in seismic capacities of sample matrices and to present general rules for categorizing seismic resistance. 2) Curves relating the percentage of damaged masonry structures with different seismic resistances subjected to seismic demand in different regions of seismic intensity (VI to X) have been developed. 3) A method has been proposed to build vulnerability matrices of masonry structures. The damage ratio for masonry structures under high-intensity events such as the Ms 6.1 Panzhihua earthquake in Sichuan province on 30 August 2008, was calculated to verify the applicability of this method. This research offers a significant theoretical basis for predicting seismic damage and direct loss assessment of groups of buildings, as well as for earthquake disaster insurance.
More about unphysical zeroes in quark mass matrices
Energy Technology Data Exchange (ETDEWEB)
Emmanuel-Costa, David, E-mail: david.costa@tecnico.ulisboa.pt [Departamento de Física and Centro de Física Teórica de Partículas - CFTP, Instituto Superior Técnico, Universidade de Lisboa, Avenida Rovisco Pais, 1049-001 Lisboa (Portugal); González Felipe, Ricardo, E-mail: ricardo.felipe@tecnico.ulisboa.pt [Departamento de Física and Centro de Física Teórica de Partículas - CFTP, Instituto Superior Técnico, Universidade de Lisboa, Avenida Rovisco Pais, 1049-001 Lisboa (Portugal); ISEL - Instituto Superior de Engenharia de Lisboa, Instituto Politécnico de Lisboa, Rua Conselheiro Emídio Navarro, 1959-007 Lisboa (Portugal)
2017-01-10
We look for all weak bases that lead to texture zeroes in the quark mass matrices and contain a minimal number of parameters in the framework of the standard model. Since there are ten physical observables, namely, six nonvanishing quark masses, three mixing angles and one CP phase, the maximum number of texture zeroes in both quark sectors is altogether nine. The nine zero entries can only be distributed between the up- and down-quark sectors in matrix pairs with six and three texture zeroes or five and four texture zeroes. In the weak basis where a quark mass matrix is nonsingular and has six zeroes in one sector, we find that there are 54 matrices with three zeroes in the other sector, obtainable through right-handed weak basis transformations. It is also found that all pairs composed of a nonsingular matrix with five zeroes and a nonsingular and nondecoupled matrix with four zeroes simply correspond to a weak basis choice. Without any further assumptions, none of these pairs of up- and down-quark mass matrices has physical content. It is shown that all non-weak-basis pairs of quark mass matrices that contain nine zeroes are not compatible with current experimental data. The particular case of the so-called nearest-neighbour-interaction pattern is also discussed.
Eudragit E100 and Polysaccharide Polymer Blends as Matrices for ...
African Journals Online (AJOL)
Purpose: To compare the effects of two states of polymer/polymer blending (dry and aqueous/lyophilized) on the physicomechanical properties of tablets, containing blends of locust bean gum (LB) with Eudragit® E100 (E100) and sodium carboxymethylcellulose (SCMC) as matrices. Methods: LB, SCMC and E100 were ...
Dirac Matrices and Feynman’s Rest of the Universe
Directory of Open Access Journals (Sweden)
Young S. Kim
2012-10-01
Full Text Available There are two sets of four-by-four matrices introduced by Dirac. The first set consists of fifteen Majorana matrices derivable from his four γ matrices. These fifteen matrices can also serve as the generators of the group SL(4, r. The second set consists of ten generators of the Sp(4 group which Dirac derived from two coupled harmonic oscillators. It is shown possible to extend the symmetry of Sp(4 to that of SL(4, r if the area of the phase space of one of the oscillators is allowed to become smaller without a lower limit. While there are no restrictions on the size of phase space in classical mechanics, Feynman’s rest of the universe makes this Sp(4-to-SL(4, r transition possible. The ten generators are for the world where quantum mechanics is valid. The remaining five generators belong to the rest of the universe. It is noted that the groups SL(4, r and Sp(4 are locally isomorphic to the Lorentz groups O(3, 3 and O(3, 2 respectively. This allows us to interpret Feynman’s rest of the universe in terms of space-time symmetry.
REFLECTIONS The Matrices of Race, Class and Gender: how they ...
African Journals Online (AJOL)
REFLECTIONS The Matrices of Race, Class and Gender: how they. Nova Smith. Full Text: EMAIL FULL TEXT EMAIL FULL TEXT · DOWNLOAD FULL TEXT DOWNLOAD FULL TEXT · http://dx.doi.org/10.4314/safere.v3i1.23950 · AJOL African Journals Online. HOW TO USE AJOL... for Researchers · for Librarians ...
A Role for M-Matrices in Modelling Population Growth
James, Glyn; Rumchev, Ventsi
2006-01-01
Adopting a discrete-time cohort-type model to represent the dynamics of a population, the problem of achieving a desired total size of the population under a balanced growth (contraction) and the problem of maintaining the desired size, once achieved, are studied. Properties of positive-time systems and M-matrices are used to develop the results,…
Quantitative mass spectrometry of unconventional human biological matrices
Dutkiewicz, Ewelina P.; Urban, Pawel L.
2016-10-01
The development of sensitive and versatile mass spectrometric methodology has fuelled interest in the analysis of metabolites and drugs in unconventional biological specimens. Here, we discuss the analysis of eight human matrices-hair, nail, breath, saliva, tears, meibum, nasal mucus and skin excretions (including sweat)-by mass spectrometry (MS). The use of such specimens brings a number of advantages, the most important being non-invasive sampling, the limited risk of adulteration and the ability to obtain information that complements blood and urine tests. The most often studied matrices are hair, breath and saliva. This review primarily focuses on endogenous (e.g. potential biomarkers, hormones) and exogenous (e.g. drugs, environmental contaminants) small molecules. The majority of analytical methods used chromatographic separation prior to MS; however, such a hyphenated methodology greatly limits analytical throughput. On the other hand, the mass spectrometric methods that exclude chromatographic separation are fast but suffer from matrix interferences. To enable development of quantitative assays for unconventional matrices, it is desirable to standardize the protocols for the analysis of each specimen and create appropriate certified reference materials. Overcoming these challenges will make analysis of unconventional human biological matrices more common in a clinical setting. This article is part of the themed issue 'Quantitative mass spectrometry'.
Variation in Raven's Progressive Matrices Scores across Time and Place
Brouwers, Symen A.; Van de Vijver, Fons J. R.; Van Hemert, Dianne A.
2009-01-01
The paper describes a cross-cultural and historical meta-analysis of Raven's Progressive Matrices. Data were analyzed of 798 samples from 45 countries (N = 244,316), which were published between 1944 and 2003. Country-level indicators of educational permeation (which involves a broad set of interrelated educational input and output factors that…
Eudragit E100 and Polysaccharide Polymer Blends as Matrices for ...
African Journals Online (AJOL)
Methods: LB, SCMC and E100 were blended in their dry (as purchased) state or modified by aqueous blending and subsequent lyophilization, prior to use as matrices in tablets. ... pullulan from Aureobasidium pullulans, 3-(3,4- .... the frozen polymer before sublimation and drying). Subsequently, milling generated a more.
The algebraic structure of lax equations for infinite matrices
Helminck, G.F.
2002-01-01
In this paper we discuss the algebraic structure of the tower of differential difference equations that one can associate with any commutative subalgebra of $M_k(\\mathbb{C})$. These equations can be formulated conveniently in so-called Lax equations for infinite upper- resp. lowertriangular matrices
Resistant lower rank approximation of matrices by iterative majorization
Verboon, Peter; Heiser, Willem
2011-01-01
It is commonly known that many techniques for data analysis based on the least squares criterion are very sensitive to outliers in the data. Gabriel and Odoroff (1984) suggested a resistant approach for lower rank approximation of matrices. In this approach, weights are used to diminish the
Systematics of quark mass matrices in the standard electroweak model
International Nuclear Information System (INIS)
Frampton, P.H.; Jarlskog, C.; Stockholm Univ.
1985-01-01
It is shown that the quark mass matrices in the standard electroweak model satisfy the empirical relation M = M' + O(lambda 2 ), where M(M') refers to the mass matrix of the charge 2/3 (-1/3) quarks normalized to the largest eigenvalue, msub(t) (msub(b)), and lambda = Vsub(us) approx.= 0.22. (orig.)
Model-independent analysis with BPM correlation matrices
International Nuclear Information System (INIS)
Irwin, J.; Wang, C.X.; Yan, Y.T.; Bane, K.; Cai, Y.; Decker, F.; Minty, M.; Stupakov, G.; Zimmermann, F.
1998-06-01
The authors discuss techniques for Model-Independent Analysis (MIA) of a beamline using correlation matrices of physical variables and Singular Value Decomposition (SVD) of a beamline BPM matrix. The beamline matrix is formed from BPM readings for a large number of pulses. The method has been applied to the Linear Accelerator of the SLAC Linear Collider (SLC)
Applicability of non-invasively collected matrices for human biomonitoring
Directory of Open Access Journals (Sweden)
Nickmilder Marc
2009-03-01
Full Text Available Abstract With its inclusion under Action 3 in the Environment and Health Action Plan 2004–2010 of the European Commission, human biomonitoring is currently receiving an increasing amount of attention from the scientific community as a tool to better quantify human exposure to, and health effects of, environmental stressors. Despite the policy support, however, there are still several issues that restrict the routine application of human biomonitoring data in environmental health impact assessment. One of the main issues is the obvious need to routinely collect human samples for large-scale surveys. Particularly the collection of invasive samples from susceptible populations may suffer from ethical and practical limitations. Children, pregnant women, elderly, or chronically-ill people are among those that would benefit the most from non-invasive, repeated or routine sampling. Therefore, the use of non-invasively collected matrices for human biomonitoring should be promoted as an ethically appropriate, cost-efficient and toxicologically relevant alternative for many biomarkers that are currently determined in invasively collected matrices. This review illustrates that several non-invasively collected matrices are widely used that can be an valuable addition to, or alternative for, invasively collected matrices such as peripheral blood sampling. Moreover, a well-informed choice of matrix can provide an added value for human biomonitoring, as different non-invasively collected matrices can offer opportunities to study additional aspects of exposure to and effects from environmental contaminants, such as repeated sampling, historical overview of exposure, mother-child transfer of substances, or monitoring of substances with short biological half-lives.
Polymer Percolation Threshold in Multi-Component HPMC Matrices Tablets
Directory of Open Access Journals (Sweden)
Maryam Maghsoodi
2011-06-01
Full Text Available Introduction: The percolation theory studies the critical points or percolation thresholds of the system, where onecomponent of the system undergoes a geometrical phase transition, starting to connect the whole system. The application of this theory to study the release rate of hydrophilic matrices allows toexplain the changes in release kinetics of swellable matrix type system and results in a clear improvement of the design of controlled release dosage forms. Methods: In this study, the percolation theory has been applied to multi-component hydroxypropylmethylcellulose (HPMC hydrophilic matrices. Matrix tablets have been prepared using phenobarbital as drug,magnesium stearate as a lubricant employing different amount of lactose and HPMC K4M as a fillerandmatrix forming material, respectively. Ethylcelullose (EC as a polymeric excipient was also examined. Dissolution studies were carried out using the paddle method. In order to estimate the percolation threshold, the behaviour of the kinetic parameters with respect to the volumetric fraction of HPMC at time zero, was studied. Results: In both HPMC/lactose and HPMC/EC/lactose matrices, from the point of view of the percolation theory, the optimum concentration for HPMC, to obtain a hydrophilic matrix system for the controlled release of phenobarbital is higher than 18.1% (v/v HPMC. Above 18.1% (v/v HPMC, an infinite cluster of HPMC would be formed maintaining integrity of the system and controlling the drug release from the matrices. According to results, EC had no significant influence on the HPMC percolation threshold. Conclusion: This may be related to broad functionality of the swelling hydrophilic matrices.
Energy Technology Data Exchange (ETDEWEB)
Ivkovic, M; Zdravkovic, Z; Sotic, O [Department of Reactor Physics and Dynamics, Boris Kidric Institute of nuclear sciences Vinca, Belgrade (Yugoslavia)
1966-04-15
A graphite block was calibrated for the thermal neutron flux of the Ra-Be source using indium foils as detectors. Experimental values of the thermal neutron flux along the central vertical axis of the system were corrected for the self-shielding effect and depression of flux in the detector. The experimental values obtained were compared with the values calculated on the basis of solving the conservation neutron equation by the continuous slowing-down theory. In this theoretical calculation of the flux the Ra-Be source was divided into three resonance energy regions. The measurement of the thermal neutron diffusion length in the standard graphite block is described. The measurements were performed in the thermal neutron region of the system. The experimental results were interpreted by the diffusion theory for point thermal neutron source in the finite system. The thermal neutron diffusion length was calculated to be L= 50.9 {+-}3.1 cm for the following graphite characteristics: density = 1.7 g/cm{sup 3}; boron content = 0.1 ppm; absorption cross section = 3.7 mb.
International Nuclear Information System (INIS)
Ivkovic, M.; Zdravkovic, Z.; Sotic, O.
1966-04-01
A graphite block was calibrated for the thermal neutron flux of the Ra-Be source using indium foils as detectors. Experimental values of the thermal neutron flux along the central vertical axis of the system were corrected for the self-shielding effect and depression of flux in the detector. The experimental values obtained were compared with the values calculated on the basis of solving the conservation neutron equation by the continuous slowing-down theory. In this theoretical calculation of the flux the Ra-Be source was divided into three resonance energy regions. The measurement of the thermal neutron diffusion length in the standard graphite block is described. The measurements were performed in the thermal neutron region of the system. The experimental results were interpreted by the diffusion theory for point thermal neutron source in the finite system. The thermal neutron diffusion length was calculated to be L= 50.9 ±3.1 cm for the following graphite characteristics: density = 1.7 g/cm 3 ; boron content = 0.1 ppm; absorption cross section = 3.7 mb
Flach, J.; van der Waal, M.B.; van den Nieuwboer, M.; Claassen, H.J.H.M.; Larsen, O.F.A.
2017-01-01
Full Article Figures & data References Supplemental Citations Metrics Reprints & Permissions PDF ABSTRACT Probiotic microorganisms are increasingly incorporated into food matrices in order to confer proposed health benefits on the consumer. It is important that the health benefits,
The wild tapered block bootstrap
DEFF Research Database (Denmark)
Hounyo, Ulrich
In this paper, a new resampling procedure, called the wild tapered block bootstrap, is introduced as a means of calculating standard errors of estimators and constructing confidence regions for parameters based on dependent heterogeneous data. The method consists in tapering each overlapping block...... of the series first, the applying the standard wild bootstrap for independent and heteroscedastic distrbuted observations to overlapping tapered blocks in an appropriate way. Its perserves the favorable bias and mean squared error properties of the tapered block bootstrap, which is the state-of-the-art block......-order asymptotic validity of the tapered block bootstrap as well as the wild tapered block bootstrap approximation to the actual distribution of the sample mean is also established when data are assumed to satisfy a near epoch dependent condition. The consistency of the bootstrap variance estimator for the sample...
Nonconventional concrete hollow blocks evaluation by destructive and non-destructive testing
Directory of Open Access Journals (Sweden)
M.S. Rodrigues
Full Text Available The aim of this study was to evaluate cementitious matrices properties by partial replacement of Portland cement by silica fume (SF or by rice husk ash (RHA, and their application in nonbearing hollow blocks, tested by destructive and non-destructive methods. The following mixtures were produced: reference (100% of Portland cement and Portland cement replacement (10% by mass with SF or RHA. The non-destructive testing showed that the highest values of UPV were obtained for SF-based blocks and RHA-based blocks. The destructive test showed better results for SF-based blocks, but there was no statistical difference between the RHA-based and control ones.
Heinkenschloss, Matthias
2005-01-01
We study a class of time-domain decomposition-based methods for the numerical solution of large-scale linear quadratic optimal control problems. Our methods are based on a multiple shooting reformulation of the linear quadratic optimal control problem as a discrete-time optimal control (DTOC) problem. The optimality conditions for this DTOC problem lead to a linear block tridiagonal system. The diagonal blocks are invertible and are related to the original linear quadratic optimal control problem restricted to smaller time-subintervals. This motivates the application of block Gauss-Seidel (GS)-type methods for the solution of the block tridiagonal systems. Numerical experiments show that the spectral radii of the block GS iteration matrices are larger than one for typical applications, but that the eigenvalues of the iteration matrices decay to zero fast. Hence, while the GS method is not expected to convergence for typical applications, it can be effective as a preconditioner for Krylov-subspace methods. This is confirmed by our numerical tests.A byproduct of this research is the insight that certain instantaneous control techniques can be viewed as the application of one step of the forward block GS method applied to the DTOC optimality system.
Efficient linear algebra routines for symmetric matrices stored in packed form.
Ahlrichs, Reinhart; Tsereteli, Kakha
2002-01-30
Quantum chemistry methods require various linear algebra routines for symmetric matrices, for example, diagonalization or Cholesky decomposition for positive matrices. We present a small set of these basic routines that are efficient and minimize memory requirements.
Pieper, J.S.; Oosterhof, A.; Dijkstra, Pieter J.; Veerkamp, J.H.; van Kuppevelt, T.H.
1999-01-01
Porous collagen matrices with defined physical, chemical and biological characteristics are interesting materials for tissue engineering. Attachment of glycosaminoglycans (GAGs) may add to these characteristics and valorize collagen. In this study, porous type I collagen matrices were crosslinked
DEFF Research Database (Denmark)
Hanberg, Peter Jesper; Jørgensen, Anders Michael
2014-01-01
efficiency of about 15% for commercial Silicon solar cells there is still much to gain. DTU Danchip provides research facilities, equipment and expertise for the building blocks that comprises fabricating the efficient solar cell. In order to get more of the sun light into the device we provide thin film......Photovoltaics (PV), better known as solar cells, are now a common day sight on many rooftops in Denmark.The installed capacity of PV systems worldwide is growing exponentially1 and is the third most importantrenewable energy source today. The cost of PV is decreasing fast with ~10%/year but to make...... it directcompetitive with fossil energy sources a further reduction is needed. By increasing the efficiency of the solar cells one gain an advantage through the whole chain of cost. So that per produced Watt of power less material is spent, installation costs are lower, less area is used etc. With an average...
International Nuclear Information System (INIS)
Akinci, Devrim; Akhan, Okan
2005-01-01
Pain occurs frequently in patients with advanced cancers. Tumors originating from upper abdominal viscera such as pancreas, stomach, duodenum, proximal small bowel, liver and biliary tract and from compressing enlarged lymph nodes can cause severe abdominal pain, which do not respond satisfactorily to medical treatment or radiotherapy. Percutaneous celiac ganglia block (CGB) can be performed with high success and low complication rates under imaging guidance to obtain pain relief in patients with upper abdominal malignancies. A significant relationship between pain relief and degree of tumoral celiac ganglia invasion according to CT features was described in the literature. Performing the procedure in the early grades of celiac ganglia invasion on CT can increase the effectiveness of the CGB, which is contrary to World Health Organization criteria stating that CGB must be performed in patients with advanced stage cancer. CGB may also be effectively performed in patients with chronic pancreatitis for pain palliation
Scheler, Fabian; Mitzlaff, Martin; Schröder-Preikschat, Wolfgang
Die Entscheidung, einen zeit- bzw. ereignisgesteuerten Ansatz für ein Echtzeitsystem zu verwenden, ist schwierig und sehr weitreichend. Weitreichend vor allem deshalb, weil diese beiden Ansätze mit äußerst unterschiedlichen Kontrollflussabstraktionen verknüpft sind, die eine spätere Migration zum anderen Paradigma sehr schwer oder gar unmöglich machen. Wir schlagen daher die Verwendung einer Zwischendarstellung vor, die unabhängig von der jeweils verwendeten Kontrollflussabstraktion ist. Für diesen Zweck verwenden wir auf Basisblöcken basierende Atomic Basic Blocks (ABB) und bauen darauf ein Werkzeug, den Real-Time Systems Compiler (RTSC) auf, der die Migration zwischen zeit- und ereignisgesteuerten Systemen unterstützt.
Directory of Open Access Journals (Sweden)
dr.Nageh Omar
2005-01-01
Full Text Available These group of Architectural Fragments have been discovered during Excavations at Souq el – Khamees Site at the end of Mostorod Street in el – Matarya Area by the Supreme Council of Antiquities Mission Season 2003 and none published before . The Site of Excavations is Situated about 500 metres to the west Obelisk of the King Senusert I According to the inscriptions on the block (pl.1.a,fig.1 represents the coronation name of the king Senusret III, the fifth king of the twelfth dynasty within the cartouche .Through This recent discover and his Sphinx statue we Suggest that the king Senusret III built a shrine or Temple at Heliopols which was possibly a part of the great Temple of the universal God of Heliopolis . For block dating to the king Akhenaten and many monuments are discovered in Heliopolis at the same period emphasized that the king Akhenaten built temple for the god Aten in Heliopolis and through Studies about the king Akhenaten, we suggest that the king Akhenaten take his new principles from Heliopolis . The king Ramesses II mentioned from stela which discovered at Manshyt el- Sader, in the second horizontal line that he erected oblesk and some statues at the great Temple in Heliopolis , this recent Discover about Statue of the king Ramesses II emphasized site of excavations perhaps a shrine or open court from temple of the king Ramesses II at the great Temple in Heliopolis For nbt – htpt, we could show that the goddess Hathor take a forward position in Heliopolis and become the Lady of Hetepet in Heliopolis since Eighteenth dynasty at least
A hybrid method for the parallel computation of Green's functions
International Nuclear Information System (INIS)
Petersen, Dan Erik; Li Song; Stokbro, Kurt; Sorensen, Hans Henrik B.; Hansen, Per Christian; Skelboe, Stig; Darve, Eric
2009-01-01
Quantum transport models for nanodevices using the non-equilibrium Green's function method require the repeated calculation of the block tridiagonal part of the Green's and lesser Green's function matrices. This problem is related to the calculation of the inverse of a sparse matrix. Because of the large number of times this calculation needs to be performed, this is computationally very expensive even on supercomputers. The classical approach is based on recurrence formulas which cannot be efficiently parallelized. This practically prevents the solution of large problems with hundreds of thousands of atoms. We propose new recurrences for a general class of sparse matrices to calculate Green's and lesser Green's function matrices which extend formulas derived by Takahashi and others. We show that these recurrences may lead to a dramatically reduced computational cost because they only require computing a small number of entries of the inverse matrix. Then, we propose a parallelization strategy for block tridiagonal matrices which involves a combination of Schur complement calculations and cyclic reduction. It achieves good scalability even on problems of modest size.
On the norms of r-circulant matrices with generalized Fibonacci numbers
Directory of Open Access Journals (Sweden)
Amara Chandoul
2017-01-01
Full Text Available In this paper, we obtain a generalization of [6, 8]. Firstly, we consider the so-called r-circulant matrices with generalized Fibonacci numbers and then found lower and upper bounds for the Euclidean and spectral norms of these matrices. Afterwards, we present some bounds for the spectral norms of Hadamard and Kronecker product of these matrices.
Multigroup P8 - elastic scattering matrices of main reactor elements
International Nuclear Information System (INIS)
Garg, S.B.; Shukla, V.K.
1979-01-01
To study the effect of anisotropic scattering phenomenon on shielding and neutronics of nuclear reactors multigroup P8-elastic scattering matrices have been generated for H, D, He, 6 Li, 7 Li, 10 B, C, N, O, Na, Cr, Fe, Ni, 233 U, 235 U, 238 U, 239 Pu, 240 Pu, 241 Pu and 242 Pu using their angular distribution, Legendre coefficient and elastic scattering cross-section data from the basic ENDF/B library. Two computer codes HSCAT and TRANS have been developed to complete this task for BESM-6 and CDC-3600 computers. These scattering matrices can be directly used as input to the transport theory codes ANISN and DOT. (auth.)
Properties of Zero-Free Transfer Function Matrices
D. O. Anderson, Brian; Deistler, Manfred
Transfer functions of linear, time-invariant finite-dimensional systems with more outputs than inputs, as arise in factor analysis (for example in econometrics), have, for state-variable descriptions with generic entries in the relevant matrices, no finite zeros. This paper gives a number of characterizations of such systems (and indeed square discrete-time systems with no zeros), using state-variable, impulse response, and matrix-fraction descriptions. Key properties include the ability to recover the input values at any time from a bounded interval of output values, without any knowledge of an initial state, and an ability to verify the no-zero property in terms of a property of the impulse response coefficient matrices. Results are particularized to cases where the transfer function matrix in question may or may not have a zero at infinity or a zero at zero.
Determination of chromium in biological matrices by neutron activation
International Nuclear Information System (INIS)
McClendon, L.T.
1978-01-01
Chromium is recognized to be an essential trace element in several biological systems. It exists in many biological materials in a variety of chemical forms and very low concentration levels which cause problems for many analytical techniques. Both instrumental and destructive neutron activation analysis were used to determine the chromium concentration in Orchard Leaves, SRM 1571, Brewers Yeast, SRM 1569, and Bovine Liver, SRM 1577. Some of the problems inherent with determining chromium in certain biological matrices and the data obtained here at the National Bureau of Standards using this technique are discussed. The results obtained from dissolution of brewers yeast in a closed system as described in the DNAA procedure are in good agreement with the INAA results. The same phenomenon existed in the determination of chromium in bovine liver. The radiochemical procedure described for chromium (DNAA) provides the analyst with a simple, rapid and selective technique for chromium determination in a variety of matrices. (T.G.)
NDMA formation kinetics from three pharmaceuticals in four water matrices.
Shen, Ruqiao; Andrews, Susan A
2011-11-01
N, N-nitrosodimethylamine (NDMA) is an emerging disinfection by-product (DBP) that has been widely detected in many drinking water systems and commonly associated with the chloramine disinfection process. Some amine-based pharmaceuticals have been demonstrated to form NDMA during chloramination, but studies regarding the reaction kinetics are largely lacking. This study investigates the NDMA formation kinetics from ranitidine, chlorphenamine, and doxylamine under practical chloramine disinfection conditions. The formation profile was monitored in both lab-grade water and real water matrices, and a statistical model is proposed to describe and predict the NDMA formation from selected pharmaceuticals in various water matrices. The results indicate the significant impact of water matrix components and reaction time on the NDMA formation from selected pharmaceuticals, and provide fresh insights on the estimation of ultimate NDMA formation potential from pharmaceutical precursors. Copyright © 2011 Elsevier Ltd. All rights reserved.
Quark mass matrices in left-right symmetric gauge theories
International Nuclear Information System (INIS)
Ecker, G.; Grimus, W.; Konetschny, W.
1981-01-01
The most general left-right symmetry for SU(2)sub(L) x SU(2)sub(R) x U(1) gauge theories with any number of flavours and with at most two scalar multiplets transforming as anti qq bilinears is analyzed. In order to get additional constraints on the structure of quark mass matrices all possible horizontal groups (continuous or discrete) are investigated. A complete classification of physically inequivalent quark mass matrices is given for four and six flavours. It is argued that the methods and results are also applicable in the case of dynamical symmetry breaking. Parity invariance and horizontal symmetry are shown to imply CP conservation on the Lagrangian level. For all non-trivial three-generation models there is spontaneous CP violation which in most cases turns out to be naturally small. (Auth.)
Generalised Wigner surmise for (2 X 2) random matrices
International Nuclear Information System (INIS)
Chau Huu-Tai, P.; Van Isacker, P.; Smirnova, N.A.
2001-01-01
We present new analytical results concerning the spectral distributions for (2 x 2) random real symmetric matrices which generalize the Wigner surmise. The study of the statistical properties of spectra of realistic many-body Hamiltonians requires consideration of a random matrix ensemble whose elements are not independent or whose distribution is not invariant under orthogonal transformation of a chosen basis. In this letter we have concentrated on the properties of (2 x 2) real symmetric matrices whose elements are independent Gaussian variables with zero means but do not belong to the GOE. We have derived the distribution of eigenvalues for such a matrix, the nearest-neighbour spacing distribution which generalizes the Wigner surmise and we have calculated some important moments. (authors)
Likelihood Approximation With Hierarchical Matrices For Large Spatial Datasets
Litvinenko, Alexander
2017-09-03
We use available measurements to estimate the unknown parameters (variance, smoothness parameter, and covariance length) of a covariance function by maximizing the joint Gaussian log-likelihood function. To overcome cubic complexity in the linear algebra, we approximate the discretized covariance function in the hierarchical (H-) matrix format. The H-matrix format has a log-linear computational cost and storage O(kn log n), where the rank k is a small integer and n is the number of locations. The H-matrix technique allows us to work with general covariance matrices in an efficient way, since H-matrices can approximate inhomogeneous covariance functions, with a fairly general mesh that is not necessarily axes-parallel, and neither the covariance matrix itself nor its inverse have to be sparse. We demonstrate our method with Monte Carlo simulations and an application to soil moisture data. The C, C++ codes and data are freely available.
Sports drug testing using complementary matrices: Advantages and limitations.
Thevis, Mario; Geyer, Hans; Tretzel, Laura; Schänzer, Wilhelm
2016-10-25
Today, routine doping controls largely rely on testing whole blood, serum, and urine samples. These matrices allow comprehensively covering inorganic as well as low and high molecular mass organic analytes relevant to doping controls and are collecting and transferring from sampling sites to accredited anti-doping laboratories under standardized conditions. Various aspects including time and cost-effectiveness as well as intrusiveness and invasiveness of the sampling procedure but also analyte stability and breadth of the contained information have been motivation to consider and assess values potentially provided and added to modern sports drug testing programs by alternative matrices. Such alternatives could be dried blood spots (DBS), dried plasma spots (DPS), oral fluid (OF), exhaled breath (EB), and hair. In this review, recent developments and test methods concerning these alternative matrices and expected or proven contributions as well as limitations of these specimens in the context of the international anti-doping fight are presented and discussed, guided by current regulations for prohibited substances and methods of doping as established by the World Anti-Doping Agency (WADA). Focusing on literature published between 2011 and 2015, examples for doping control analytical assays concerning non-approved substances, anabolic agents, peptide hormones/growth factors/related substances and mimetics, β 2 -agonists, hormone and metabolic modulators, diuretics and masking agents, stimulants, narcotics, cannabinoids, glucocorticoids, and beta-blockers were selected to outline the advantages and limitations of the aforementioned alternative matrices as compared to conventional doping control samples (i.e. urine and blood/serum). Copyright © 2016 Elsevier B.V. All rights reserved.
Contributions to Large Covariance and Inverse Covariance Matrices Estimation
Kang, Xiaoning
2016-01-01
Estimation of covariance matrix and its inverse is of great importance in multivariate statistics with broad applications such as dimension reduction, portfolio optimization, linear discriminant analysis and gene expression analysis. However, accurate estimation of covariance or inverse covariance matrices is challenging due to the positive definiteness constraint and large number of parameters, especially in the high-dimensional cases. In this thesis, I develop several approaches for estimat...
Limit sets for the discrete spectrum of complex Jacobi matrices
International Nuclear Information System (INIS)
Golinskii, L B; Egorova, I E
2005-01-01
The discrete spectrum of complex Jacobi matrices that are compact perturbations of the discrete Laplacian is studied. The precise stabilization rate (in the sense of order) of the matrix elements ensuring the finiteness of the discrete spectrum is found. An example of a Jacobi matrix with discrete spectrum having a unique limit point is constructed. These results are discrete analogues of Pavlov's well-known results on Schroedinger operators with complex potential on a half-axis.
Electrospun Phospholipid Fibers as Micro-Encapsulation and Antioxidant Matrices
DEFF Research Database (Denmark)
Shekarforoush, Elhamalsadat; Mendes, Ana Carina Loureiro; Baj, Vanessa
2017-01-01
Electrospun phospholipid (asolectin) microfibers were investigated as antioxidants and encapsulation matrices for curcumin and vanillin. These phospholipid microfibers exhibited antioxidant properties which increased after the encapsulation of both curcumin and vanillin. The total antioxidant...... capacity (TAC) and the total phenolic content (TPC) of curcumin/phospholipid and vanillin/phospholipid microfibers remained stable over time at different temperatures (refrigerated, ambient) and pressures (vacuum, ambient). ¹H-NMR confirmed the chemical stability of both encapsulated curcumin and vanillin...
Parallel decompositions of Mueller matrices and polarimetric subtraction
Directory of Open Access Journals (Sweden)
Gil J.J.
2010-06-01
Full Text Available From a general formulation of the physically realizable parallel decompositions of the Mueller matrix M of a given depolarizing system, a procedure for determining the set of pure Mueller matrices susceptible to be subtracted from M is presented. This procedure provides a way to check if a given pure Mueller matrix N can be subtracted from M or not. If this check is positive, the value of the relative cross section of the subtracted component is also determined.
Von Willebrand protein binds to extracellular matrices independently of collagen.
Wagner, D D; Urban-Pickering, M; Marder, V J
1984-01-01
Von Willebrand protein is present in the extracellular matrix of endothelial cells where it codistributes with fibronectin and types IV and V collagen. Bacterial collagenase digestion of endothelial cells removed fibrillar collagen, but the pattern of fibronectin and of von Willebrand protein remained undisturbed. Exogenous von Willebrand protein bound to matrices of different cells, whether rich or poor in collagen. von Willebrand protein also decorated the matrix of cells grown in the prese...
Procedure for the analysis of americium in complex matrices
International Nuclear Information System (INIS)
Knab, D.
1978-02-01
A radioanalytical procedure for the analysis of americium in complex matrices has been developed. Clean separations of americium can be obtained from up to 100 g of sample ash, regardless of the starting material. The ability to analyze large masses of material provides the increased sensitivity necessary to detect americium in many environmental samples. The procedure adequately decontaminates from rare earth elements and natural radioactive nuclides that interfere with the alpha spectrometric measurements
Computation of the q -th roots of circulant matrices
Directory of Open Access Journals (Sweden)
Pakizeh Mohammadi Khanghah
2014-05-01
Full Text Available In this paper, we investigate the reduced form of circulant matrices and we show that the problem of computing the $q$-th roots of a nonsingular circulant matrix $A$ can be reduced to that of computing the $q$-th roots of two half size matrices $B-C$ and $B+C$.
Factoring symmetric indefinite matrices on high-performance architectures
Jones, Mark T.; Patrick, Merrell L.
1990-01-01
The Bunch-Kaufman algorithm is the method of choice for factoring symmetric indefinite matrices in many applications. However, the Bunch-Kaufman algorithm does not take advantage of high-performance architectures such as the Cray Y-MP. Three new algorithms, based on Bunch-Kaufman factorization, that take advantage of such architectures are described. Results from an implementation of the third algorithm are presented.
A Robust Incomplete Factorization Preconditioner for Positive Definite Matrices
Czech Academy of Sciences Publication Activity Database
Benzi, M.; Tůma, Miroslav
2003-01-01
Roč. 10, - (2003), s. 385-400 ISSN 1070-5325 R&D Projects: GA AV ČR IAA2030801; GA AV ČR IAA1030103 Institutional research plan: AV0Z1030915 Keywords : sparse linear systems * positive definite matrices * preconditioned conjugate gradient s * incomplete factorization * A-orthogonalization * SAINV Subject RIV: BA - General Mathematics Impact factor: 1.042, year: 2003
Interactions between Food Additive Silica Nanoparticles and Food Matrices
Directory of Open Access Journals (Sweden)
Mi-Ran Go
2017-06-01
Full Text Available Nanoparticles (NPs have been widely utilized in the food industry as additives with their beneficial characteristics, such as improving sensory property and processing suitability, enhancing functional and nutritional values, and extending shelf-life of foods. Silica is used as an anti-caking agent to improve flow property of powered ingredients and as a carrier for flavors or active compounds in food. Along with the rapid development of nanotechnology, the sizes of silica fall into nanoscale, thereby raising concerns about the potential toxicity of nano-sized silica materials. There have been a number of studies carried out to investigate possible adverse effects of NPs on the gastrointestinal tract. The interactions between NPs and surrounding food matrices should be also taken into account since the interactions can affect their bioavailability, efficacy, and toxicity. In the present study, we investigated the interactions between food additive silica NPs and food matrices, such as saccharides, proteins, lipids, and minerals. Quantitative analysis was performed to determine food component-NP corona using HPLC, fluorescence quenching, GC-MS, and ICP-AES. The results demonstrate that zeta potential and hydrodynamic radius of silica NPs changed in the presence of all food matrices, but their solubility was not affected. However, quantitative analysis on the interactions revealed that a small portion of food matrices interacted with silica NPs and the interactions were highly dependent on the type of food component. Moreover, minor nutrients could also affect the interactions, as evidenced by higher NP interaction with honey rather than with a simple sugar mixture containing an equivalent amount of fructose, glucose, sucrose, and maltose. These findings provide fundamental information to extend our understanding about the interactions between silica NPs and food components and to predict the interaction effect on the safety aspects of food
Discrete ergodic Jacobi matrices: Spectral properties and Quantum dynamical bounds
Han, Rui
2017-01-01
In this thesis we study discrete quasiperiodic Jacobi operators as well as ergodic operators driven by more general zero topological entropy dynamics. Such operators are deeply connected to physics (quantum Hall effect and graphene) and have enjoyed great attention from mathematics (e.g. several of Simon’s problems). The thesis has two main themes. First, to study spectral properties of quasiperiodic Jacobi matrices, in particular when off-diagonal sampling function has non-zero winding numbe...
Non-dense domain operator matrices and Cauchy problems
International Nuclear Information System (INIS)
Lalaoui Rhali, S.
2002-12-01
In this work, we study Cauchy problems with non-dense domain operator matrices. By assuming that the entries of an unbounded operator matrix are Hille-Yosida operators, we give a necessary and sufficient condition ensuring that the part of this operator matrix generates a semigroup in the closure of its domain. This allows us to prove the well-posedness of the corresponding Cauchy problem. Our results are applied to delay and neutral differential equations. (author)
Updating Stiffness and Hysteretic Damping Matrices Using Measured Modal Data
Directory of Open Access Journals (Sweden)
Jiashang Jiang
2018-01-01
Full Text Available A new direct method for the finite element (FE matrix updating problem in a hysteretic (or material damping model based on measured incomplete vibration modal data is presented. With this method, the optimally approximated stiffness and hysteretic damping matrices can be easily constructed. The physical connectivity of the original model is preserved and the measured modal data are embedded in the updated model. The numerical results show that the proposed method works well.
Updating Stiffness and Hysteretic Damping Matrices Using Measured Modal Data
Jiashang Jiang; Yongxin Yuan
2018-01-01
A new direct method for the finite element (FE) matrix updating problem in a hysteretic (or material) damping model based on measured incomplete vibration modal data is presented. With this method, the optimally approximated stiffness and hysteretic damping matrices can be easily constructed. The physical connectivity of the original model is preserved and the measured modal data are embedded in the updated model. The numerical results show that the proposed method works well.
Wound care matrices for chronic leg ulcers: role in therapy
Directory of Open Access Journals (Sweden)
Sano H
2015-07-01
Full Text Available Hitomi Sano,1 Sachio Kouraba,2 Rei Ogawa11Department of Plastic, Reconstructive, and Aesthetic Surgery, Nippon Medical School, Tokyo, Japan; 2Sapporo Wound Care and Anti-Aging Laboratory, Sapporo, JapanAbstract: Chronic leg ulcers are a significant health care concern. Although deep wounds are usually treated by flap transfers, the operation is invasive and associates with serious complications. Skin grafts may be a less invasive means of covering wounds. However, skin grafts cannot survive on deep defects unless high-quality granulation tissue can first be generated in the defects. Technologies that generate high-quality granulation tissue are needed. One possibility is to use wound care matrices, which are bioengineered skin and soft tissue substitutes. Because they all support the healing process by providing a premade extracellular matrix material, these matrices can be termed “extracellular matrix replacement therapies”. The matrix promotes wound healing by acting as a scaffold for regeneration, attracting host cytokines to the wound, stimulating wound epithelialization and angiogenesis, and providing the wound bed with bioactive components. This therapy has lasting benefits as it not only helps large skin defects to be closed with thin skin grafts or patch grafts but also restores cosmetic appearance and proper function. In particular, since it acts as a layer that slides over the subcutaneous fascia, it provides skin elasticity, tear resistance, and texture. Several therapies and products employing wound care matrices for wound management have been developed recently. Some of these can be applied in combination with negative pressure wound therapy or beneficial materials that promote wound healing and can be incorporated into the matrix. To date, the clinical studies on these approaches suggest that wound care matrices promote spontaneous wound healing or can be used to facilitate skin grafting, thereby avoiding the need to use
Estimating correlation and covariance matrices by weighting of market similarity
Michael C. M\\"unnix; Rudi Sch\\"afer; Oliver Grothe
2010-01-01
We discuss a weighted estimation of correlation and covariance matrices from historical financial data. To this end, we introduce a weighting scheme that accounts for similarity of previous market conditions to the present one. The resulting estimators are less biased and show lower variance than either unweighted or exponentially weighted estimators. The weighting scheme is based on a similarity measure which compares the current correlation structure of the market to the structures at past ...
Estimation of Fuzzy Measures Using Covariance Matrices in Gaussian Mixtures
Directory of Open Access Journals (Sweden)
Nishchal K. Verma
2012-01-01
Full Text Available This paper presents a novel computational approach for estimating fuzzy measures directly from Gaussian mixtures model (GMM. The mixture components of GMM provide the membership functions for the input-output fuzzy sets. By treating consequent part as a function of fuzzy measures, we derived its coefficients from the covariance matrices found directly from GMM and the defuzzified output constructed from both the premise and consequent parts of the nonadditive fuzzy rules that takes the form of Choquet integral. The computational burden involved with the solution of λ-measure is minimized using Q-measure. The fuzzy model whose fuzzy measures were computed using covariance matrices found in GMM has been successfully applied on two benchmark problems and one real-time electric load data of Indian utility. The performance of the resulting model for many experimental studies including the above-mentioned application is found to be better and comparable to recent available fuzzy models. The main contribution of this paper is the estimation of fuzzy measures efficiently and directly from covariance matrices found in GMM, avoiding the computational burden greatly while learning them iteratively and solving polynomial equations of order of the number of input-output variables.
Unified triminimal parametrizations of quark and lepton mixing matrices
International Nuclear Information System (INIS)
He Xiaogang; Li Shiwen; Ma Boqiang
2009-01-01
We present a detailed study on triminimal parametrizations of quark and lepton mixing matrices with different basis matrices. We start with a general discussion on the triminimal expansion of the mixing matrix and on possible unified quark and lepton parametrization using quark-lepton complementarity. We then consider several interesting basis matrices and compare the triminimal parametrizations with the Wolfenstein-like parametrizations. The usual Wolfenstein parametrization for quark mixing is a triminimal expansion around the unit matrix as the basis. The corresponding quark-lepton complementarity lepton mixing matrix is a triminimal expansion around the bimaximal basis. Current neutrino oscillation data show that the lepton mixing matrix is very well represented by the tribimaximal mixing. It is natural to take it as an expanding basis. The corresponding zeroth order basis for quark mixing in this case makes the triminimal expansion converge much faster than the usual Wolfenstein parametrization. The triminimal expansion based on tribimaximal mixing can be converted to the Wolfenstein-like parametrizations discussed in the literature. We thus have a unified description between different kinds of parametrizations for quark and lepton sectors: the standard parametrizations, the Wolfenstein-like parametrizations, and the triminimal parametrizations.
Fabrication of chemically cross-linked porous gelatin matrices.
Bozzini, Sabrina; Petrini, Paola; Altomare, Lina; Tanzi, Maria Cristina
2009-01-01
The aim of this study was to chemically cross-link gelatin, by reacting its free amino groups with an aliphatic diisocyanate. To produce hydrogels with controllable properties, the number of reacting amino groups was carefully determined. Porosity was introduced into the gelatin-based hydrogels through the lyophilization process. Porous and non-porous matrices were characterized with respect to their chemical structure, morphology, water uptake and mechanical properties. The physical, chemical and mechanical properties of the porous matrices are related to the extent of their cross-linking, showing that they can be controlled by varying the reaction parameters. Water uptake values (24 hours) vary between 160% and 200% as the degree of cross-linking increases. The flexibility of the samples also decreases by changing the extent of cross-linking. Young's modulus shows values between 0.188 KPa, for the highest degree, and 0.142 KPa for the lowest degree. The matrices are potential candidates for use as tissue-engineering scaffolds by modulating their physical chemical properties according to the specific application.
Likelihood Approximation With Parallel Hierarchical Matrices For Large Spatial Datasets
Litvinenko, Alexander
2017-11-01
The main goal of this article is to introduce the parallel hierarchical matrix library HLIBpro to the statistical community. We describe the HLIBCov package, which is an extension of the HLIBpro library for approximating large covariance matrices and maximizing likelihood functions. We show that an approximate Cholesky factorization of a dense matrix of size $2M\\\\times 2M$ can be computed on a modern multi-core desktop in few minutes. Further, HLIBCov is used for estimating the unknown parameters such as the covariance length, variance and smoothness parameter of a Matérn covariance function by maximizing the joint Gaussian log-likelihood function. The computational bottleneck here is expensive linear algebra arithmetics due to large and dense covariance matrices. Therefore covariance matrices are approximated in the hierarchical ($\\\\H$-) matrix format with computational cost $\\\\mathcal{O}(k^2n \\\\log^2 n/p)$ and storage $\\\\mathcal{O}(kn \\\\log n)$, where the rank $k$ is a small integer (typically $k<25$), $p$ the number of cores and $n$ the number of locations on a fairly general mesh. We demonstrate a synthetic example, where the true values of known parameters are known. For reproducibility we provide the C++ code, the documentation, and the synthetic data.
Study of remobilization polycyclic aromatic hydrocarbons (PAHs) in contaminated matrices
International Nuclear Information System (INIS)
Belkessam, L.; Vessigaud, S.; Laboudigue, A.; Vessigaud, S.; Perrin-Ganier, C.; Schiavon, M.; Denys, S.
2005-01-01
Polycyclic aromatic hydrocarbons (PAHs) originate from many pyrolysis processes. They are widespread environmental pollutants because some of them present toxic and genotoxic properties. In coal pyrolysis sites such as former manufactured gas plants and coke production plants, coal tar is a major source of PAHs. The management of such sites requires better understanding of the mechanisms that control release of PAHs to the biosphere. Determining total PAH concentrations is not sufficient since it does not inform about the pollutants availability to environmental processes. The fate and transport of PAHs in soil are governed by sorption and microbial processes which are well documented. Globally, enhancing retention of the compounds by a solid matrix reduces the risk of pollutant dispersion, but decreases their accessibility to microbial microflora. Conversely, the remobilization of organics from contaminated solid matrices represents a potential hazard since these pollutants can reach groundwater resources. However the available data are often obtained from laboratory experiments in which many field parameters can not be taken into account (long term, temperature, co-pollution, ageing phenomenon, heterogenous distribution of pollution). The present work focuses on the influence assessment and understanding of some of these parameters on PAHs remobilization from heavily polluted matrices in near-field conditions (industrial contaminated matrices, high contact time, ..). Results concerning effects of temperature and physical state of pollution (dispersed among the soil or condensed in small clusters or in coal tar) are presented. (authors)
Likelihood Approximation With Parallel Hierarchical Matrices For Large Spatial Datasets
Litvinenko, Alexander; Sun, Ying; Genton, Marc G.; Keyes, David E.
2017-01-01
The main goal of this article is to introduce the parallel hierarchical matrix library HLIBpro to the statistical community. We describe the HLIBCov package, which is an extension of the HLIBpro library for approximating large covariance matrices and maximizing likelihood functions. We show that an approximate Cholesky factorization of a dense matrix of size $2M\\times 2M$ can be computed on a modern multi-core desktop in few minutes. Further, HLIBCov is used for estimating the unknown parameters such as the covariance length, variance and smoothness parameter of a Matérn covariance function by maximizing the joint Gaussian log-likelihood function. The computational bottleneck here is expensive linear algebra arithmetics due to large and dense covariance matrices. Therefore covariance matrices are approximated in the hierarchical ($\\H$-) matrix format with computational cost $\\mathcal{O}(k^2n \\log^2 n/p)$ and storage $\\mathcal{O}(kn \\log n)$, where the rank $k$ is a small integer (typically $k<25$), $p$ the number of cores and $n$ the number of locations on a fairly general mesh. We demonstrate a synthetic example, where the true values of known parameters are known. For reproducibility we provide the C++ code, the documentation, and the synthetic data.
Raven's matrices and working memory: a dual-task approach.
Rao, K Venkata; Baddeley, Alan
2013-01-01
Raven's Matrices Test was developed as a "pure" measure of Spearman's concept of general intelligence, g. Subsequent research has attempted to specify the processes underpinning performance, some relating it to the concept of working memory and proposing a crucial role for the central executive, with the nature of other components currently unclear. Up to this point, virtually all work has been based on correlational analysis of number of correct solutions, sometimes related to possible strategies. We explore the application to this problem of the concurrent task methodology used widely in developing the concept of multicomponent working memory. Participants attempted to solve problems from the matrices under baseline conditions, or accompanied by backward counting or verbal repetition tasks, assumed to disrupt the central executive and phonological loop components of working memory, respectively. As in other uses of this method, number of items correct showed little effect, while solution time measures gave very clear evidence of an important role for the central executive, but no evidence for phonological loop involvement. We conclude that this and related concurrent task techniques hold considerable promise for the analysis of Raven's matrices and potentially for other established psychometric tests.
Consolidity analysis for fully fuzzy functions, matrices, probability and statistics
Directory of Open Access Journals (Sweden)
Walaa Ibrahim Gabr
2015-03-01
Full Text Available The paper presents a comprehensive review of the know-how for developing the systems consolidity theory for modeling, analysis, optimization and design in fully fuzzy environment. The solving of systems consolidity theory included its development for handling new functions of different dimensionalities, fuzzy analytic geometry, fuzzy vector analysis, functions of fuzzy complex variables, ordinary differentiation of fuzzy functions and partial fraction of fuzzy polynomials. On the other hand, the handling of fuzzy matrices covered determinants of fuzzy matrices, the eigenvalues of fuzzy matrices, and solving least-squares fuzzy linear equations. The approach demonstrated to be also applicable in a systematic way in handling new fuzzy probabilistic and statistical problems. This included extending the conventional probabilistic and statistical analysis for handling fuzzy random data. Application also covered the consolidity of fuzzy optimization problems. Various numerical examples solved have demonstrated that the new consolidity concept is highly effective in solving in a compact form the propagation of fuzziness in linear, nonlinear, multivariable and dynamic problems with different types of complexities. Finally, it is demonstrated that the implementation of the suggested fuzzy mathematics can be easily embedded within normal mathematics through building special fuzzy functions library inside the computational Matlab Toolbox or using other similar software languages.
Large deviations of the maximum eigenvalue in Wishart random matrices
International Nuclear Information System (INIS)
Vivo, Pierpaolo; Majumdar, Satya N; Bohigas, Oriol
2007-01-01
We analytically compute the probability of large fluctuations to the left of the mean of the largest eigenvalue in the Wishart (Laguerre) ensemble of positive definite random matrices. We show that the probability that all the eigenvalues of a (N x N) Wishart matrix W = X T X (where X is a rectangular M x N matrix with independent Gaussian entries) are smaller than the mean value (λ) = N/c decreases for large N as ∼exp[-β/2 N 2 Φ - (2√c + 1: c)], where β = 1, 2 corresponds respectively to real and complex Wishart matrices, c = N/M ≤ 1 and Φ - (x; c) is a rate (sometimes also called large deviation) function that we compute explicitly. The result for the anti-Wishart case (M < N) simply follows by exchanging M and N. We also analytically determine the average spectral density of an ensemble of Wishart matrices whose eigenvalues are constrained to be smaller than a fixed barrier. Numerical simulations are in excellent agreement with the analytical predictions
Large deviations of the maximum eigenvalue in Wishart random matrices
Energy Technology Data Exchange (ETDEWEB)
Vivo, Pierpaolo [School of Information Systems, Computing and Mathematics, Brunel University, Uxbridge, Middlesex, UB8 3PH (United Kingdom) ; Majumdar, Satya N [Laboratoire de Physique Theorique et Modeles Statistiques (UMR 8626 du CNRS), Universite Paris-Sud, Batiment 100, 91405 Orsay Cedex (France); Bohigas, Oriol [Laboratoire de Physique Theorique et Modeles Statistiques (UMR 8626 du CNRS), Universite Paris-Sud, Batiment 100, 91405 Orsay Cedex (France)
2007-04-20
We analytically compute the probability of large fluctuations to the left of the mean of the largest eigenvalue in the Wishart (Laguerre) ensemble of positive definite random matrices. We show that the probability that all the eigenvalues of a (N x N) Wishart matrix W = X{sup T}X (where X is a rectangular M x N matrix with independent Gaussian entries) are smaller than the mean value ({lambda}) = N/c decreases for large N as {approx}exp[-{beta}/2 N{sup 2}{phi}{sub -} (2{radical}c + 1: c)], where {beta} = 1, 2 corresponds respectively to real and complex Wishart matrices, c = N/M {<=} 1 and {phi}{sub -}(x; c) is a rate (sometimes also called large deviation) function that we compute explicitly. The result for the anti-Wishart case (M < N) simply follows by exchanging M and N. We also analytically determine the average spectral density of an ensemble of Wishart matrices whose eigenvalues are constrained to be smaller than a fixed barrier. Numerical simulations are in excellent agreement with the analytical predictions.
Geometry and arithmetic of factorized S-matrices
International Nuclear Information System (INIS)
Freund, P.G.O.
1995-01-01
In realistic four-dimensional quantum field theories integrability is elusive. Relativity, when combined with quantum theory does not permit an infinity of local conservation laws except for free fields, for which the S-matrix is trivial S = 1. In two space-time dimensions, where forward and backward scattering are the only possibilities, nontrivial S-matrices are possible even in integrable theories. Such S-matrices are known to factorize [1]. This means that there is no particle production, so that the 4-point amplitudes determine all higher n-point amplitudes. In our recent work [2, 3, 4, 5, 6] we found that in such integrable two-dimensional theories, even the input 4-point amplitudes are determined by a simple principle. Roughly speaking these amplitudes describe the S-wave scattering which one associates with free motion on certain quantum-symmetric spaces. The trivial S-matrix of free field theory describes the absence of scattering which one associates with free motion on a euclidean space, itself a symmetric space. As is well known [7, 8, 9], for curved symmetric spaces the S-matrices for S-wave scattering are no longer trivial, but rather they are determined by the Harish-Chandra c-functions of these spaces [10]. The quantum deformation of this situation is what appears when one considers excitation scattering in two-dimensional integrable models. (orig.)
Large-deviation theory for diluted Wishart random matrices
Castillo, Isaac Pérez; Metz, Fernando L.
2018-03-01
Wishart random matrices with a sparse or diluted structure are ubiquitous in the processing of large datasets, with applications in physics, biology, and economy. In this work, we develop a theory for the eigenvalue fluctuations of diluted Wishart random matrices based on the replica approach of disordered systems. We derive an analytical expression for the cumulant generating function of the number of eigenvalues IN(x ) smaller than x ∈R+ , from which all cumulants of IN(x ) and the rate function Ψx(k ) controlling its large-deviation probability Prob[IN(x ) =k N ] ≍e-N Ψx(k ) follow. Explicit results for the mean value and the variance of IN(x ) , its rate function, and its third cumulant are discussed and thoroughly compared to numerical diagonalization, showing very good agreement. The present work establishes the theoretical framework put forward in a recent letter [Phys. Rev. Lett. 117, 104101 (2016), 10.1103/PhysRevLett.117.104101] as an exact and compelling approach to deal with eigenvalue fluctuations of sparse random matrices.
PRIMITIVE MATRICES AND GENERATORS OF PSEUDO RANDOM SEQUENCES OF GALOIS
Directory of Open Access Journals (Sweden)
A. Beletsky
2014-04-01
Full Text Available In theory and practice of information cryptographic protection one of the key problems is the forming a binary pseudo-random sequences (PRS with a maximum length with acceptable statistical characteristics. PRS generators are usually implemented by linear shift register (LSR of maximum period with linear feedback [1]. In this paper we extend the concept of LSR, assuming that each of its rank (memory cell can be in one of the following condition. Let’s call such registers “generalized linear shift register.” The research goal is to develop algorithms for constructing Galois and Fibonacci generalized matrix of n-order over the field , which uniquely determined both the structure of corresponding generalized of n-order LSR maximal period, and formed on their basis Galois PRS generators of maximum length. Thus the article presents the questions of formation the primitive generalized Fibonacci and Galois arbitrary order matrix over the prime field . The synthesis of matrices is based on the use of irreducible polynomials of degree and primitive elements of the extended field generated by polynomial. The constructing methods of Galois and Fibonacci conjugated primitive matrices are suggested. The using possibilities of such matrices in solving the problem of constructing generalized generators of Galois pseudo-random sequences are discussed.
Directory of Open Access Journals (Sweden)
Lorenzo Milazzo
1997-05-01
Full Text Available An ASQS(v is a particular Steiner system featuring a set of v vertices and two separate families of blocks, B and G, whose elements have a respective cardinality of 4 and 6. It has the property that any three vertices of X belong either to a B-block or to a G-block. The parameter cb is the number of common blocks in two separate ASQSs, both defined on the same set of vertices X . In this paper it is shown that cb ≤ 29 for any pair of ASQSs(12.
Adductor Canal Block versus Femoral Nerve Block and Quadriceps Strength
DEFF Research Database (Denmark)
Jæger, Pia Therese; Nielsen, Zbigniew Jerzy Koscielniak; Henningsen, Lene Marianne
2013-01-01
: The authors hypothesized that the adductor canal block (ACB), a predominant sensory blockade, reduces quadriceps strength compared with placebo (primary endpoint, area under the curve, 0.5-6 h), but less than the femoral nerve block (FNB; secondary endpoint). Other secondary endpoints were...
International Nuclear Information System (INIS)
Bradish, G.J. III; Reid, A.E.
1986-01-01
The central instrumentation control and data acquisition (CICADA) computer system is comprised of a functionally distributed hierarchical network of thirteen (13) 32-bit mini-computers that are the heart of the control, monitoring, data collection and data analysis for the tokamak fusion test reactor (TFTR). The CICADA system was designed with the goal of providing complete control, monitoring, and data acquisition for TFTR, which includes the acquisition and storage of 20M points of data within a five-minute shot cycle. It was realized early in the system design that in order to meet this goal an ancillary system would have to be provided to supplement the subsystem CAMAC systems that, due to the relatively slow throughput of the serial highways and the overhead of relaying data to the central facilities within a star network, would not provide the necessary throughput. The authors discuss how the block transfer system provided a means of moving data directly from the CAMAC crate to the application running on the central facility computers
Some thoughts on positive definiteness in the consideration of nuclear data covariance matrices
Energy Technology Data Exchange (ETDEWEB)
Geraldo, L.P.; Smith, D.L.
1988-01-01
Some basic mathematical features of covariance matrices are reviewed, particularly as they relate to the property of positive difiniteness. Physical implications of positive definiteness are also discussed. Consideration is given to an examination of the origins of non-positive definite matrices, to procedures which encourage the generation of positive definite matrices and to the testing of covariance matrices for positive definiteness. Attention is also given to certain problems associated with the construction of covariance matrices using information which is obtained from evaluated data files recorded in the ENDF format. Examples are provided to illustrate key points pertaining to each of the topic areas covered.
Classification en référence à une matrice stochastique
Verdun , Stéphane; Cariou , Véronique; Qannari , El Mostafa
2009-01-01
International audience; Etant donné un tableau de données X portant sur un ensemble de n objets, et une matrice stochastique S qui peut être assimilée à une matrice de transition d'une chaîne de Markov, nous proposons une méthode de partitionnement consistant à appliquer la matrice S sur X de manière itérative jusqu'à convergence. Les classes formant la partition sont déterminées à partir des états stationnaires de la matrice stochastique. Cette matrice stochastique peut être issue d'une matr...
Some thoughts on positive definiteness in the consideration of nuclear data covariance matrices
International Nuclear Information System (INIS)
Geraldo, L.P.; Smith, D.L.
1988-01-01
Some basic mathematical features of covariance matrices are reviewed, particularly as they relate to the property of positive difiniteness. Physical implications of positive definiteness are also discussed. Consideration is given to an examination of the origins of non-positive definite matrices, to procedures which encourage the generation of positive definite matrices and to the testing of covariance matrices for positive definiteness. Attention is also given to certain problems associated with the construction of covariance matrices using information which is obtained from evaluated data files recorded in the ENDF format. Examples are provided to illustrate key points pertaining to each of the topic areas covered
Design of Packet-Based Block Codes with Shift Operators
Directory of Open Access Journals (Sweden)
Jacek Ilow
2010-01-01
Full Text Available This paper introduces packet-oriented block codes for the recovery of lost packets and the correction of an erroneous single packet. Specifically, a family of systematic codes is proposed, based on a Vandermonde matrix applied to a group of k information packets to construct r redundant packets, where the elements of the Vandermonde matrix are bit-level right arithmetic shift operators. The code design is applicable to packets of any size, provided that the packets within a block of k information packets are of uniform length. In order to decrease the overhead associated with packet padding using shift operators, non-Vandermonde matrices are also proposed for designing packet-oriented block codes. An efficient matrix inversion procedure for the off-line design of the decoding algorithm is presented to recover lost packets. The error correction capability of the design is investigated as well. The decoding algorithm, based on syndrome decoding, to correct a single erroneous packet in a group of n=k+r received packets is presented. The paper is equipped with examples of codes using different parameters. The code designs and their performance are tested using Monte Carlo simulations; the results obtained exhibit good agreement with the corresponding theoretical results.
Design of Packet-Based Block Codes with Shift Operators
Directory of Open Access Journals (Sweden)
Ilow Jacek
2010-01-01
Full Text Available This paper introduces packet-oriented block codes for the recovery of lost packets and the correction of an erroneous single packet. Specifically, a family of systematic codes is proposed, based on a Vandermonde matrix applied to a group of information packets to construct redundant packets, where the elements of the Vandermonde matrix are bit-level right arithmetic shift operators. The code design is applicable to packets of any size, provided that the packets within a block of information packets are of uniform length. In order to decrease the overhead associated with packet padding using shift operators, non-Vandermonde matrices are also proposed for designing packet-oriented block codes. An efficient matrix inversion procedure for the off-line design of the decoding algorithm is presented to recover lost packets. The error correction capability of the design is investigated as well. The decoding algorithm, based on syndrome decoding, to correct a single erroneous packet in a group of received packets is presented. The paper is equipped with examples of codes using different parameters. The code designs and their performance are tested using Monte Carlo simulations; the results obtained exhibit good agreement with the corresponding theoretical results.
OPAL Various Lead Glass Blocks
These lead glass blocks were part of a CERN detector called OPAL (one of the four experiments at the LEP particle detector). OPAL uses some 12 000 blocks of glass like this to measure particle energies in the electromagnetic calorimeter. This detector measured the energy deposited when electrons and photons were slowed down and stopped.
Writing Blocks and Tacit Knowledge.
Boice, Robert
1993-01-01
A review of the literature on writing block looks at two kinds: inability to write in a timely, fluent fashion, and reluctance by academicians to assist others in writing. Obstacles to fluent writing are outlined, four historical trends in treating blocks are discussed, and implications are examined. (MSE)
Block storage subsystem performance analysis
CERN. Geneva
2016-01-01
You feel that your service is slow because of the storage subsystem? But there are too many abstraction layers between your software and the raw block device for you to debug all this pile... Let's dive on the platters and check out how the block storage sees your I/Os! We can even figure out what those patterns are meaning.
Geography:The TIGER Line Files are feature classes and related database files (.) that are an extract of selected geographic and cartographic information from the U.S. Census Bureau's Master Address File / Topologically Integrated Geographic Encoding and Referencing (MAF/TIGER) Database (MTDB). The MTDB represents a seamless national file with no overlaps or gaps between parts, however, each TIGER Line File is designed to stand alone as an independent data set, or they can be combined to cover the entire nation. Census Blocks are statistical areas bounded on all sides by visible features, such as streets, roads, streams, and railroad tracks, and/or by non visible boundaries such as city, town, township, and county limits, and short line-of-sight extensions of streets and roads. Census blocks are relatively small in area; for example, a block in a city bounded by streets. However, census blocks in remote areas are often large and irregular and may even be many square miles in area. A common misunderstanding is that data users think census blocks are used geographically to build all other census geographic areas, rather all other census geographic areas are updated and then used as the primary constraints, along with roads and water features, to delineate the tabulation blocks. As a result, all 2010 Census blocks nest within every other 2010 Census geographic area, so that Census Bureau statistical data can be tabulated at the block level and aggregated up t
Long-time leaching on full size radioactive waste blocks
International Nuclear Information System (INIS)
Bernard, Andre; Nomine, J.-C.; Cornec, Georges; Bonnet, Andre; Farges, Louis.
1980-12-01
Leaching is generally accepted as the fundamental characteristic when judging the quality of radioactive waste packaging. Long duration leaching tests have been carried out on full size waste blocks at the Commissariat a l'Energie Atomique. The monoliths studied are 200 litre cylinders made up of α, β and γ emitting liquid or solid waste embedded in cement or bitumen. Leaching takes place in accordance with rules based on I.A.E.A. recommendations embodying the specific concerns of safety and radiological capacity of storage sites. The tests are carried out at a Testing Station purpose built at Saclay. It includes several loops with instrumentation (volume: 3000 litres). The counting and analyses of the leached products have enabled the aggregated released fractions of the radionuclides and the structural and chemical modifications of the matrices to be assessed. The fractions of 137 Cs and 239 Pu released at 18 months are 10 -2 and 5x10 -6 for the cement coated wastes, and 10 -4 and 10 -5 for the bitumen coated wastes. The evaluation of the changes in the matrices made it possible, in particular, to observe the start of carbonation in the cement coated wastes. These trials are to be pursued for several years so as to obtain a better understanding of the exchange mechanics between the packaged wastes and the environment [fr
A block Hankel generalized confluent Vandermonde matrix
Klein, A.; Spreij, P.
2014-01-01
Vandermonde matrices are well known. They have a number of interesting properties and play a role in (Lagrange) interpolation problems, partial fraction expansions, and finding solutions to linear ordinary differential equations, to mention just a few applications. Usually, one takes these matrices
Thermoresponsive microgels containing trehalose as soft matrices for 3D cell culture.
Burek, Małgorzata; Waśkiewicz, Sylwia; Lalik, Anna; Student, Sebastian; Bieg, Tadeusz; Wandzik, Ilona
2017-01-31
A series of thermoresponsive glycomicrogels with trehalose in the cross-links or with trehalose in the cross-links and as pending moieties was synthesized. These materials were obtained by surfactant-free precipitation copolymerization of N-isopropylacrylamide and various amounts of trehalose monomers. The resultant particles showed a spherical shape and a submicrometer hydrodynamic size with a narrow size distribution. At 25 °C, glycomicrogels in solutions with physiological ionic strength formed stable colloids, which further gelled upon heating to physiological temperature forming a macroscopic hydrogel with an interconnected porous structure. These extremely soft matrices with dynamic storage modulus in the range of 9-70 Pa were examined in 3D culture systems for HeLa cell culture in comparison to traditional 2D mode. They showed relatively low syneresis over time, especially when glycomicrogels with a high content of hydrophilic trehalose were used as building blocks. An incorporated pending trehalose composed of two α,α'-1,1'-linked d-glucose moieties was used with the intention of providing multivalent interactions with glucose transporters (GLUTs) expressed on the cell surface. A better cell viability was observed when a soft hydrogel with the highest content of trehalose and the lowest syneresis was used as a matrix compared to a 2D control assay.
Block QCA Fault-Tolerant Logic Gates
Firjany, Amir; Toomarian, Nikzad; Modarres, Katayoon
2003-01-01
Suitably patterned arrays (blocks) of quantum-dot cellular automata (QCA) have been proposed as fault-tolerant universal logic gates. These block QCA gates could be used to realize the potential of QCA for further miniaturization, reduction of power consumption, increase in switching speed, and increased degree of integration of very-large-scale integrated (VLSI) electronic circuits. The limitations of conventional VLSI circuitry, the basic principle of operation of QCA, and the potential advantages of QCA-based VLSI circuitry were described in several NASA Tech Briefs articles, namely Implementing Permutation Matrices by Use of Quantum Dots (NPO-20801), Vol. 25, No. 10 (October 2001), page 42; Compact Interconnection Networks Based on Quantum Dots (NPO-20855) Vol. 27, No. 1 (January 2003), page 32; Bit-Serial Adder Based on Quantum Dots (NPO-20869), Vol. 27, No. 1 (January 2003), page 35; and Hybrid VLSI/QCA Architecture for Computing FFTs (NPO-20923), which follows this article. To recapitulate the principle of operation (greatly oversimplified because of the limitation on space available for this article): A quantum-dot cellular automata contains four quantum dots positioned at or between the corners of a square cell. The cell contains two extra mobile electrons that can tunnel (in the quantummechanical sense) between neighboring dots within the cell. The Coulomb repulsion between the two electrons tends to make them occupy antipodal dots in the cell. For an isolated cell, there are two energetically equivalent arrangements (denoted polarization states) of the extra electrons. The cell polarization is used to encode binary information. Because the polarization of a nonisolated cell depends on Coulomb-repulsion interactions with neighboring cells, universal logic gates and binary wires could be constructed, in principle, by arraying QCA of suitable design in suitable patterns. Heretofore, researchers have recognized two major obstacles to realization of QCA
Environmental assessment of waste matrices contaminated with arsenic.
Sanchez, F; Garrabrants, A C; Vandecasteele, C; Moszkowicz, P; Kosson, D S
2003-01-31
The use of equilibrium-based and mass transfer-based leaching tests has been proposed to provide an integrated assessment of leaching processes from solid wastes. The objectives of the research presented here are to (i) validate this assessment approach for contaminated soils and cement-based matrices, (ii) evaluate the use of diffusion and coupled dissolution-diffusion models for estimating constituent release, and (iii) evaluate model parameterization using results from batch equilibrium leaching tests and physical characterization. The test matrices consisted of (i) a soil contaminated with arsenic from a pesticide production facility, (ii) the same soil subsequently treated by a Portland cement stabilization/solidification (S/S) process, and (iii) a synthetic cement-based matrix spiked with arsenic(III) oxide. Results indicated that a good assessment of contaminant release from contaminated soils and cement-based S/S treated wastes can be obtained by the integrated use of equilibrium-based and mass transfer-based leaching tests in conjunction with the appropriate release model. During the time scale of laboratory testing, the release of arsenic from the contaminated soil matrix was governed by diffusion and the solubility of arsenic in the pore solution while the release of arsenic from the cement-based matrices was mainly controlled by solubilization at the interface between the matrix and the bulk leaching solution. In addition, results indicated that (i) estimation of the activity coefficient within the matrix pore water is necessary for accurate prediction of constituent release rates and (ii) inaccurate representation of the factors controlling release during laboratory testing can result in significant errors in release estimates.
Invertibility and Explicit Inverses of Circulant-Type Matrices with k-Fibonacci and k-Lucas Numbers
Directory of Open Access Journals (Sweden)
Zhaolin Jiang
2014-01-01
Full Text Available Circulant matrices have important applications in solving ordinary differential equations. In this paper, we consider circulant-type matrices with the k-Fibonacci and k-Lucas numbers. We discuss the invertibility of these circulant matrices and present the explicit determinant and inverse matrix by constructing the transformation matrices, which generalizes the results in Shen et al. (2011.
Texture of fermion mass matrices in partially unified theories
International Nuclear Information System (INIS)
Dutta, B.; Texas Univ., Austin, TX; Nandi, S.; Texas Univ., Austin, TX
1996-01-01
We investigate the texture of fermion mass matrices in theories with partial unification (for example, SU(2) L x SU(2) R x SU(4) c ) at a scale of ∼ 10 12 GeV. Starting with the low energy values of the masses and the mixing angles, we find only two viable textures with at most four texture zeros. One of these corresponds to a somewhat modified Fritzsch textures. A theoretical derivation of these textures leads to new interesting relations among the masses and the mixing angles. 13 refs
Combustion synthesis of ceramic matrices for immobilization of 14C
International Nuclear Information System (INIS)
Bosc-Rouessac, F.; Marin-Ayral, R.M.; Haidoux, A.; Massoni, N.; Bart, F.
2008-01-01
In this study, the use of combustion synthesis for immobilization of 14 C was considered. Ceramic matrices have been prepared by this method using two different devices: one non-conventional with preheating of the samples and the other conventional device where ignition was produced thanks to tungsten filament. These two devices gave rise to different mechanisms of reactions involving different amounts of unreacted carbon graphite inside the matrix. The SHS samples were characterized by using scanning electron microscopy (SEM) and X-ray diffraction (XRD)
Thermal Expansion Behavior of Hot-Pressed Engineered Matrices
Raj, S. V.
2016-01-01
Advanced engineered matrix composites (EMCs) require that the coefficient of thermal expansion (CTE) of the engineered matrix (EM) matches those of the fiber reinforcements as closely as possible in order to reduce thermal compatibility strains during heating and cooling of the composites. The present paper proposes a general concept for designing suitable matrices for long fiber reinforced composites using a rule of mixtures (ROM) approach to minimize the global differences in the thermal expansion mismatches between the fibers and the engineered matrix. Proof-of-concept studies were conducted to demonstrate the validity of the concept.
On spectral distribution of high dimensional covariation matrices
DEFF Research Database (Denmark)
Heinrich, Claudio; Podolskij, Mark
In this paper we present the asymptotic theory for spectral distributions of high dimensional covariation matrices of Brownian diffusions. More specifically, we consider N-dimensional Itô integrals with time varying matrix-valued integrands. We observe n equidistant high frequency data points...... of the underlying Brownian diffusion and we assume that N/n -> c in (0,oo). We show that under a certain mixed spectral moment condition the spectral distribution of the empirical covariation matrix converges in distribution almost surely. Our proof relies on method of moments and applications of graph theory....
Matrices for Sensors from Inorganic, Organic, and Biological Nanocomposites
Directory of Open Access Journals (Sweden)
Eugenia Pechkova
2011-08-01
Full Text Available Matrices and sensors resulting from inorganic, organic and biological nanocomposites are presented in this overview. The term nanocomposite designates a solid combination of a matrix and of nanodimensional phases differing in properties from the matrix due to dissimilarities in structure and chemistry. The nanoocomposites chosen for a wide variety of health and environment sensors consist of Anodic Porous Allumina and P450scc, Carbon nanotubes and Conductive Polymers, Langmuir Blodgett Films of Lipases, Laccases, Cytochromes and Rhodopsins, Three-dimensional Nanoporous Materials and Nucleic Acid Programmable Protein Arrays.
Off-shell T-matrices from inverse scattering
International Nuclear Information System (INIS)
Von Geramb, H.V.; Amos, K.A.
1989-01-01
Inverse scattering theory is used to determine local, energy independent, coordinate space nucleon-nucleon potentials. Inversions are made of phase shifts obtained by analyzes of data and from meson exchange theory, in particular the Paris and the Bonn parametrizations. Half off-shell T-matrices are generated to compare the exact meson theoretical results with those of inversion and it is found that phase equivalent interactions have essentially the same off-shell behaviour for any physically significant range of momenta. 8 refs., 8 figs
Recommendations on the use and design of risk matrices
DEFF Research Database (Denmark)
Duijm, Nijs Jan
2015-01-01
of the risk matrix. The objective of this paper is to explore these weaknesses, and provide recommendations for the use and design of risk matrices. The paper reviews the few relevant publications and adds some observations of its own in order to emphasize existing recommendations and add some suggestions...... of its own. The recommendations cover a range of issues, among them: the relation between coloring the risk matrix and the definition of risk and major hazard aversion; the qualitative, subjective assessment of likelihood and consequence; the scaling of the discrete likelihood and consequence categories...
Analytical stiffness matrices with Green-Lagrange strain measure
DEFF Research Database (Denmark)
Pedersen, Pauli
2005-01-01
Separating the dependence on material and stress/strain state from the dependence on initial geometry, we obtain analytical secant and tangent stiffness matrices. For the case of a linear displacement triangle with uniform thickness and uniform constitutive behaviour closed-form results are listed...... a solution based on Green-Lagrange strain measure. The approach is especially useful in design optimization, because analytical sensitivity analysis then can be performed. The case of a three node triangular ring element for axisymmetric analysis involves small modifications and extension to four node...
3D Weight Matrices in Modeling Real Estate Prices
Mimis, A.
2016-10-01
Central role in spatial econometric models of real estate data has the definition of the weight matrix by which we capture the spatial dependence between the observations. The weight matrices presented in literature so far, treats space in a two dimensional manner leaving out the effect of the third dimension or in our case the difference in height where the property resides. To overcome this, we propose a new definition of the weight matrix including the third dimensional effect by using the Hadamard product. The results illustrated that the level effect can be absorbed into the new weight matrix.
Level density of random matrices for decaying systems
International Nuclear Information System (INIS)
Haake, F.; Izrailev, F.; Saher, D.; Sommers, H.-J.
1991-01-01
Analytical and numerical results for the level density of a certain class of random non-Hermitian matrices H=H+iΓ are presented. The conservative part H belongs to the Gaussian orthogonal ensemble while the damping piece Γ is quadratic in Gaussian random numbers and may describe the decay of resonances through various channels. In the limit of a large matrix dimension the level density assumes a surprisingly simple dependence on the relative strength of the damping and the number of channels. 18 refs.; 4 figs
Covariance matrices and applications to the field of nuclear data
International Nuclear Information System (INIS)
Smith, D.L.
1981-11-01
A student's introduction to covariance error analysis and least-squares evaluation of data is provided. It is shown that the basic formulas used in error propagation can be derived from a consideration of the geometry of curvilinear coordinates. Procedures for deriving covariances for scaler and vector functions of several variables are presented. Proper methods for reporting experimental errors and for deriving covariance matrices from these errors are indicated. The generalized least-squares method for evaluating experimental data is described. Finally, the use of least-squares techniques in data fitting applications is discussed. Specific examples of the various procedures are presented to clarify the concepts
Elemental Analysis in Biological Matrices Using ICP-MS.
Hansen, Matthew N; Clogston, Jeffrey D
2018-01-01
The increasing exploration of metallic nanoparticles for use as cancer therapeutic agents necessitates a sensitive technique to track the clearance and distribution of the material once introduced into a living system. Inductively coupled plasma mass spectrometry (ICP-MS) provides a sensitive and selective tool for tracking the distribution of metal components from these nanotherapeutics. This chapter presents a standardized method for processing biological matrices, ensuring complete homogenization of tissues, and outlines the preparation of appropriate standards and controls. The method described herein utilized gold nanoparticle-treated samples; however, the method can easily be applied to the analysis of other metals.
Interaction Matrices as a Tool for Prioritizing Radioecology Research
Energy Technology Data Exchange (ETDEWEB)
Mora, J.C.; Robles, Beatriz [Centro de Investigaciones Energeticas, Medioambientales y Tecnologicas - CIEMAT (Spain); Bradshaw, Clare; Stark, Karolina [Stockholm University (Sweden); Sweeck, Liev; Vives i Batlle, Jordi [Belgian Nuclear Research Centre SCK-CEN (Belgium); Beresford, Nick [Centre for Ecology and Hydrology - CEH (United Kingdom); Thoerring, Havard; Dowdall, Mark [Norwegian Radiation Protection Authority - NRPA (Norway); Outola, Iisa; Turtiainen, Tuukka; Vetikko, Virve [STUK - Radiation and Nuclear Safety Authority (Finland); Steiner, Martin [Federal Office for Radiation Protection - BfS (Germany); Beaugelin-Seiller, Karine; Fevrier, Laureline; Hurtevent, Pierre; Boyer, Patrick [Institut de Radioprotection et de Surete Nucleaire - IRSN (France)
2014-07-01
Interaction Matrices as a Tool for Prioritizing Radioecology Research J.C. Mora CIEMAT In 2010 the Strategy for Allied Radioecology (STAR) was launched with several objectives aimed towards integrating the radioecology research efforts of nine institutions in Europe. One of these objectives was the creation of European Radioecology Observatories. The Chernobyl Exclusion Zone (CEZ) and the Upper Silesian Coal Basin (USCB), a coal mining area in Poland, have been chosen after a selection process. A second objective was to develop a system for improving and validating the capabilities of predicting the behaviour of the main radionuclides existing at these observatories. Interaction Matrices (IM) have been used since the 1990's as a tool for developing ecological conceptual models and have also been used within radioecology. The Interaction Matrix system relies on expert judgement for structuring knowledge of a given ecosystem at the conceptual level and was selected for use in the STAR project. A group of experts, selected from each institution of STAR, designed two matrices with the main compartments for each ecosystem (a forest in CEZ and a lake in USCB). All the features, events and processes (FEPs) which could affect the behaviour of the considered radionuclides, focusing on radiocaesium in the Chernobyl forest and radium in the Rontok-Wielki lake, were also included in each IM. Two new sets of experts were appointed to review, improve and prioritize the processes included in each IM. A first processing of the various candidate interaction matrices produced a single interaction matrix for each ecosystem which incorporated all experts combined knowledge. During the prioritization of processes in the IMs, directed towards developing a whole predictive model of radionuclides behaviour in those ecosystems, raised interesting issues related to the processes and parameters involved, regarding the existing knowledge in them. This exercise revealed several processes
Bimaximal fermion mixing from the quark and leptonic mixing matrices
International Nuclear Information System (INIS)
Ohlsson, Tommy
2005-01-01
In this Letter, we show how the mixing angles of the standard parameterization add when multiplying the quark and leptonic mixing matrices, i.e., we derive explicit sum rules for the quark and leptonic mixing angles. In this connection, we also discuss other recently proposed sum rules for the mixing angles assuming bimaximal fermion mixing. In addition, we find that the present experimental and phenomenological data of the mixing angles naturally fulfill our sum rules, and thus, give rise to bilarge or bimaximal fermion mixing
NMR studies of metallic tin confined within porous matrices
International Nuclear Information System (INIS)
Charnaya, E. V.; Tien, Cheng; Lee, M. K.; Kumzerov, Yu. A.
2007-01-01
119 Sn NMR studies were carried out for metallic tin confined within synthetic opal and porous glass. Tin was embedded into nanoporous matrices in the melted state under pressure. The Knight shift for liquid confined tin was found to decrease with decreasing pore size. Correlations between NMR line shapes, Knight shift, and pore filling were observed. The melting and freezing phase transitions of tin under confinement were studied through temperature dependences of NMR signals upon warming and cooling. Melting of tin within the opal matrix agreed well with the liquid skin model suggested for small isolated particles. The influence of the pore filling on the melting process was shown
Energy Technology Data Exchange (ETDEWEB)
Zepon, Karine Modolon [CIMJECT, Departamento de Engenharia Mecânica, Universidade Federal de Santa Catarina, 88040-900 Florianópolis, SC (Brazil); TECFARMA, Universidade do Sul de Santa Catarina, 88704-900 Tubarão, SC (Brazil); Petronilho, Fabricia [FICEXP, Universidade do Sul de Santa Catarina, 88704-900 Tubarão, SC (Brazil); Soldi, Valdir [POLIMAT, Universidade Federal de Santa Catarina, 88040-900 Florianópolis, SC (Brazil); Salmoria, Gean Vitor [CIMJECT, Departamento de Engenharia Mecânica, Universidade Federal de Santa Catarina, 88040-900 Florianópolis, SC (Brazil); Kanis, Luiz Alberto, E-mail: luiz.kanis@unisul.br [TECFARMA, Universidade do Sul de Santa Catarina, 88704-900 Tubarão, SC (Brazil)
2014-11-01
The production and evaluation of cornstarch/cellulose acetate/silver sulfadiazine extrudate matrices are reported herein. The matrices were melt extruded under nine different conditions, altering the temperature and the screw speed values. The surface morphology of the matrices was examined by scanning electron microscopy. The micrographs revealed the presence of non-melted silver sulfadiazine microparticles in the matrices extruded at lower temperature and screw speed values. The thermal properties were evaluated and the results for both the biopolymer and the drug indicated no thermal degradation during the melt extrusion process. The differential scanning analysis of the extrudate matrices showed a shift to lower temperatures for the silver sulfadiazine melting point compared with the non-extruded drug. The starch/cellulose acetate matrices containing silver sulfadiazine demonstrated significant inhibition of the growth of Pseudomonas aeruginosa and Staphylococcus aureus. In vivo inflammatory response tests showed that the extrudate matrices, with or without silver sulfadiazine, did not trigger chronic inflammatory processes. - Highlights: • Melt extruded bio-based matrices containing silver sulfadiazine was produced. • The silver sulfadiazine is stable during melt-extrusion. • The extrudate matrices shown bacterial growth inhibition. • The matrices obtained have potential to development wound healing membranes.
Directory of Open Access Journals (Sweden)
Shiao-Wen Tsai
2014-01-01
Full Text Available In this study, we utilized a mandrel rotating collector consisting of two parallel, electrically conductive pieces of tape to fabricate aligned electrospun polycaprolactone/gelatin (PG and carbon nanotube/polycaprolactone/gelatin (PGC nanofibrous matrices. Furthermore, we examined the biological performance of the PGC nanofibrous and film matrices using an in vitro culture of RT4-D6P2T rat Schwann cells. Using cell adhesion tests, we found that carbon nanotube inhibited Schwann cell attachment on PGC nanofibrous and film matrices. However, the proliferation rates of Schwann cells were higher when they were immobilized on PGC nanofibrous matrices compared to PGC film matrices. Using western blot analysis, we found that NRG1 and P0 protein expression levels were higher for cells immobilized on PGC nanofibrous matrices compared to PG nanofibrous matrices. However, the carbon nanotube inhibited NRG1 and P0 protein expression in cells immobilized on PGC film matrices. Moreover, the NRG1 and P0 protein expression levels were higher for cells immobilized on PGC nanofibrous matrices compared to PGC film matrices. We found that the matrix topography and composition influenced Schwann cell behavior.
Conformal Nets II: Conformal Blocks
Bartels, Arthur; Douglas, Christopher L.; Henriques, André
2017-08-01
Conformal nets provide a mathematical formalism for conformal field theory. Associated to a conformal net with finite index, we give a construction of the `bundle of conformal blocks', a representation of the mapping class groupoid of closed topological surfaces into the category of finite-dimensional projective Hilbert spaces. We also construct infinite-dimensional spaces of conformal blocks for topological surfaces with smooth boundary. We prove that the conformal blocks satisfy a factorization formula for gluing surfaces along circles, and an analogous formula for gluing surfaces along intervals. We use this interval factorization property to give a new proof of the modularity of the category of representations of a conformal net.
Harmony of spinning conformal blocks
Energy Technology Data Exchange (ETDEWEB)
Schomerus, Volker [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany). Theory Group; Sobko, Evgeny [Stockholm Univ. (Sweden); Nordita, Stockholm (Sweden); Isachenkov, Mikhail [Weizmann Institute of Science, Rehovoth (Israel). Dept. of Particle Physics and Astrophysics
2016-12-07
Conformal blocks for correlation functions of tensor operators play an increasingly important role for the conformal bootstrap programme. We develop a universal approach to such spinning blocks through the harmonic analysis of certain bundles over a coset of the conformal group. The resulting Casimir equations are given by a matrix version of the Calogero-Sutherland Hamiltonian that describes the scattering of interacting spinning particles in a 1-dimensional external potential. The approach is illustrated in several examples including fermionic seed blocks in 3D CFT where they take a very simple form.
Harmony of spinning conformal blocks
Energy Technology Data Exchange (ETDEWEB)
Schomerus, Volker [DESY Hamburg, Theory Group,Notkestraße 85, 22607 Hamburg (Germany); Sobko, Evgeny [Nordita and Stockholm University,Roslagstullsbacken 23, SE-106 91 Stockholm (Sweden); Isachenkov, Mikhail [Department of Particle Physics and Astrophysics, Weizmann Institute of Science,Rehovot 7610001 (Israel)
2017-03-15
Conformal blocks for correlation functions of tensor operators play an increasingly important role for the conformal bootstrap programme. We develop a universal approach to such spinning blocks through the harmonic analysis of certain bundles over a coset of the conformal group. The resulting Casimir equations are given by a matrix version of the Calogero-Sutherland Hamiltonian that describes the scattering of interacting spinning particles in a 1-dimensional external potential. The approach is illustrated in several examples including fermionic seed blocks in 3D CFT where they take a very simple form.
Rolling block mazes are PSPACE-complete
Buchin, K.; Buchin, M.
2012-01-01
In a rolling block maze, one or more blocks lie on a rectangular board with square cells. In most mazes, the blocks have size k × m × n where k, m, n are integers that determine the size of the block in terms of units of the size of the board cells. The task of a rolling block maze is to roll a
DEFF Research Database (Denmark)
Risum, Niels; Strauss, David; Sogaard, Peter
2013-01-01
The relationship between myocardial electrical activation by electrocardiogram (ECG) and mechanical contraction by echocardiography in left bundle-branch block (LBBB) has never been clearly demonstrated. New strict criteria for LBBB based on a fundamental understanding of physiology have recently...
Recursion Relations for Conformal Blocks
Penedones, João; Yamazaki, Masahito
2016-09-12
In the context of conformal field theories in general space-time dimension, we find all the possible singularities of the conformal blocks as functions of the scaling dimension $\\Delta$ of the exchanged operator. In particular, we argue, using representation theory of parabolic Verma modules, that in odd spacetime dimension the singularities are only simple poles. We discuss how to use this information to write recursion relations that determine the conformal blocks. We first recover the recursion relation introduced in 1307.6856 for conformal blocks of external scalar operators. We then generalize this recursion relation for the conformal blocks associated to the four point function of three scalar and one vector operator. Finally we specialize to the case in which the vector operator is a conserved current.
Defying gravity using Jenga™ blocks
Tan, Yin-Soo; Yap, Kueh-Chin
2007-11-01
This paper describes how Jenga™ blocks can be used to demonstrate the physics of an overhanging tower that appears to defy gravity. We also propose ideas for how this demonstration can be adapted for the A-level physics curriculum.
Gaussian density matrices: Quantum analogs of classical states
International Nuclear Information System (INIS)
Mann, A.; Revzen, M.
1993-01-01
We study quantum analogs of clasical situations, i.e. quantum states possessing some specific classical attribute(s). These states seem quite generally, to have the form of gaussian density matrices. Such states can always be parametrized as thermal squeezed states (TSS). We consider the following specific cases: (a) Two beams that are built from initial beams which passed through a beam splitter cannot, classically, be distinguished from (appropriately prepared) two independent beams that did not go through a splitter. The only quantum states possessing this classical attribute are TSS. (b) The classical Cramer's theorem was shown to have a quantum version (Hegerfeldt). Again, the states here are Gaussian density matrices. (c) The special case in the study of the quantum version of Cramer's theorem, viz. when the state obtained after partial tracing is a pure state, leads to the conclusion that all states involved are zero temperature limit TSS. The classical analog here are gaussians of zero width, i.e. all distributions are δ functions in phase space. (orig.)
Graph run-length matrices for histopathological image segmentation.
Tosun, Akif Burak; Gunduz-Demir, Cigdem
2011-03-01
The histopathological examination of tissue specimens is essential for cancer diagnosis and grading. However, this examination is subject to a considerable amount of observer variability as it mainly relies on visual interpretation of pathologists. To alleviate this problem, it is very important to develop computational quantitative tools, for which image segmentation constitutes the core step. In this paper, we introduce an effective and robust algorithm for the segmentation of histopathological tissue images. This algorithm incorporates the background knowledge of the tissue organization into segmentation. For this purpose, it quantifies spatial relations of cytological tissue components by constructing a graph and uses this graph to define new texture features for image segmentation. This new texture definition makes use of the idea of gray-level run-length matrices. However, it considers the runs of cytological components on a graph to form a matrix, instead of considering the runs of pixel intensities. Working with colon tissue images, our experiments demonstrate that the texture features extracted from "graph run-length matrices" lead to high segmentation accuracies, also providing a reasonable number of segmented regions. Compared with four other segmentation algorithms, the results show that the proposed algorithm is more effective in histopathological image segmentation.
Diclofenac sodium sustained release hot melt extruded lipid matrices.
Vithani, K; Cuppok, Y; Mostafa, S; Slipper, I J; Snowden, M J; Douroumis, D
2014-08-01
Sustained release diclofenac sodium (Df-Na) solid lipid matrices with Compritol® 888 ATO were developed in this study. The drug/lipid powders were processed via cold and hot melt extrusion at various drug loadings. The influence of the processing temperatures, drug loading and the addition of excipients on the obtained dissolution rates was investigated. The physicochemical characterization of the extruded batches showed the existence of crystalline drug in the extrudates with a small amount being solubilized in the lipid matrix. The drug content and uniformity on the tablet surface were also investigated by using energy dispersive X-ray microanalysis. The dissolution rates were found to depend on the actual Df-Na loading and the nature of the added excipients, while the effect of the processing temperatures was negligible. The dissolution mechanism of all extruded formulations followed Peppas-Korsemeyer law, based on the estimated determination coefficients and the dissolution constant rates, indicating drug diffusion from the lipid matrices.
Characterization of a New Heat Dissipation Matric Potential Sensor
Directory of Open Access Journals (Sweden)
Rolf Krebs
2013-01-01
Full Text Available Soil moisture sensors can help to reduce the amount of water needed for irrigation. In this paper we describe the PlantCare soil moisture sensor as a new type of heat dissipation sensor, its calibration and the correction for temperature changes. With the PlantCare sensor it is possible to measure the matric potential indirectly to monitor or control irrigation. This sensor is based on thermal properties of a synthetic felt. After a defined heating phase the cooling time to a threshold temperature is a function of the water content in the synthetic felt. The water content in this porous matrix is controlled by the matric potential in the surrounding soil. Calibration measurements have shown that the sensor is most sensitive to −400 hPa and allows lower sensitivity measurements to −800 hPa. The disturbing effect of the temperature change during the measurement on the cooling time can be corrected by a linear function and the differences among sensors are minimized by a two point calibration.
Engineered matrices for skeletal muscle satellite cell engraftment and function.
Han, Woojin M; Jang, Young C; García, Andrés J
2017-07-01
Regeneration of traumatically injured skeletal muscles is severely limited. Moreover, the regenerative capacity of skeletal muscle declines with aging, further exacerbating the problem. Recent evidence supports that delivery of muscle satellite cells to the injured muscles enhances muscle regeneration and reverses features of aging, including reduction in muscle mass and regenerative capacity. However, direct delivery of satellite cells presents a challenge at a translational level due to inflammation and donor cell death, motivating the need to develop engineered matrices for muscle satellite cell delivery. This review will highlight important aspects of satellite cell and their niche biology in the context of muscle regeneration, and examine recent progresses in the development of engineered cell delivery matrices designed for skeletal muscle regeneration. Understanding the interactions of muscle satellite cells and their niche in both native and engineered systems is crucial to developing muscle pathology-specific cell- and biomaterial-based therapies. Copyright © 2016 International Society of Matrix Biology. Published by Elsevier B.V. All rights reserved.
Dissimilarities of reduced density matrices and eigenstate thermalization hypothesis
He, Song; Lin, Feng-Li; Zhang, Jia-ju
2017-12-01
We calculate various quantities that characterize the dissimilarity of reduced density matrices for a short interval of length ℓ in a two-dimensional (2D) large central charge conformal field theory (CFT). These quantities include the Rényi entropy, entanglement entropy, relative entropy, Jensen-Shannon divergence, as well as the Schatten 2-norm and 4-norm. We adopt the method of operator product expansion of twist operators, and calculate the short interval expansion of these quantities up to order of ℓ9 for the contributions from the vacuum conformal family. The formal forms of these dissimilarity measures and the derived Fisher information metric from contributions of general operators are also given. As an application of the results, we use these dissimilarity measures to compare the excited and thermal states, and examine the eigenstate thermalization hypothesis (ETH) by showing how they behave in high temperature limit. This would help to understand how ETH in 2D CFT can be defined more precisely. We discuss the possibility that all the dissimilarity measures considered here vanish when comparing the reduced density matrices of an excited state and a generalized Gibbs ensemble thermal state. We also discuss ETH for a microcanonical ensemble thermal state in a 2D large central charge CFT, and find that it is approximately satisfied for a small subsystem and violated for a large subsystem.
Risking Aggression: Reply to Block
Directory of Open Access Journals (Sweden)
Kris Borer
2010-05-01
Full Text Available In his paper, “Is There an ‘Anomalous’ Section of the Laffer Curve?”, Walter Block describes some situations in which it appears that a libertarian should violate the non-aggression principle. To rectify this, Block proposes a different perspective on libertarianism which he calls punishment theory. This paper argues that no new theory is needed, as the non-aggression principle can be used to resolve theapparent conundrums.
Risking Aggression: Reply to Block
Kris Borer
2010-01-01
In his paper, “Is There an ‘Anomalous’ Section of the Laffer Curve?”, Walter Block describes some situations in which it appears that a libertarian should violate the non-aggression principle. To rectify this, Block proposes a different perspective on libertarianism which he calls punishment theory. This paper argues that no new theory is needed, as the non-aggression principle can be used to resolve theapparent conundrums.
A Novel Tetrathiafulvalene Building Block
DEFF Research Database (Denmark)
Jeppesen, Jan Oskar; Takimiya, Kazuo; Thorup, Niels
1999-01-01
Efficient synthesis of a novel tetrathiafulvalene building block. 2,3-bis(2-cyanoethylthio)-6,7-bis(thiocyanato-methyl)tetrathiafulv alene (7) useful for stepwise and asymmetrical bis-function-alization is reported.......Efficient synthesis of a novel tetrathiafulvalene building block. 2,3-bis(2-cyanoethylthio)-6,7-bis(thiocyanato-methyl)tetrathiafulv alene (7) useful for stepwise and asymmetrical bis-function-alization is reported....
Lacerda, Kássio André; Lameiras, Fernando Soares; Silva, Viviane Viana
2007-01-01
In this study, non-radioactive iodine was incorporated in two types of biodegradable hydroxyapatite-based porous matrices (HA and HACL) through impregnation process from sodium iodine aqueous solutions with varying concentrations (0.5 and 1.0 mol/L) . The results revealed that both systems presented a high capacity of incorporating iodine into their matrices. The quantity of incorporated iodine was measured through Neutron Activation Analysis (NAA). The porous ceramic matrices based on hydrox...
A Conceptual Cost Benefit Analysis of Tailings Matrices Use in Construction Applications
Mahmood Ali A.; Elektorowicz Maria
2016-01-01
As part of a comprehensive research program, new tailings matrices are formulated of combinations of tailings and binder materials. The research program encompasses experimental and numerical analysis of the tailings matrices to investigate the feasibility of using them as construction materials in cold climates. This paper discusses a conceptual cost benefit analysis for the use of these new materials. It is shown here that the financial benefits of using the proposed new tailings matrices i...
Directory of Open Access Journals (Sweden)
Ruqaya M Elsayed Goda
2017-01-01
Conclusion: We concluded that ultrasound guided transverses abdominis plane block and thoracic paravertebral block were safe and effective anesthetic technique for upper abdominal surgery with longer and potent postoperative analgesia in thoracic paravertebral block than transverses abdominis block.
Data depth and rank-based tests for covariance and spectral density matrices
Chau, Joris
2017-06-26
In multivariate time series analysis, objects of primary interest to study cross-dependences in the time series are the autocovariance or spectral density matrices. Non-degenerate covariance and spectral density matrices are necessarily Hermitian and positive definite, and our primary goal is to develop new methods to analyze samples of such matrices. The main contribution of this paper is the generalization of the concept of statistical data depth for collections of covariance or spectral density matrices by exploiting the geometric properties of the space of Hermitian positive definite matrices as a Riemannian manifold. This allows one to naturally characterize most central or outlying matrices, but also provides a practical framework for rank-based hypothesis testing in the context of samples of covariance or spectral density matrices. First, the desired properties of a data depth function acting on the space of Hermitian positive definite matrices are presented. Second, we propose two computationally efficient pointwise and integrated data depth functions that satisfy each of these requirements. Several applications of the developed methodology are illustrated by the analysis of collections of spectral matrices in multivariate brain signal time series datasets.
Kyrpychova, Liubov; Carr, Richard A; Martinek, Petr; Vanecek, Tomas; Perret, Raul; Chottová-Dvořáková, Magdalena; Zamecnik, Michal; Hadravsky, Ladislav; Michal, Michal; Kazakov, Dmitry V
2017-06-01
Basal cell carcinoma (BCC) with matrical differentiation is a fairly rare neoplasm, with about 30 cases documented mainly as isolated case reports. We studied a series of this neoplasm, including cases with an atypical matrical component, a hitherto unreported feature. Lesions coded as BCC with matrical differentiation were reviewed; 22 cases were included. Immunohistochemical studies were performed using antibodies against BerEp4, β-catenin, and epithelial membrane antigen (EMA). Molecular genetic studies using Ion AmpliSeq Cancer Hotspot Panel v2 by massively parallel sequencing on Ion Torrent PGM were performed in 2 cases with an atypical matrical component (1 was previously subjected to microdissection to sample the matrical and BCC areas separately). There were 13 male and 9 female patients, ranging in age from 41 to 89 years. Microscopically, all lesions manifested at least 2 components, a BCC area (follicular germinative differentiation) and areas with matrical differentiation. A BCC component dominated in 14 cases, whereas a matrical component dominated in 4 cases. Matrical differentiation was recognized as matrical/supramatrical cells (n=21), shadow cells (n=21), bright red trichohyaline granules (n=18), and blue-gray corneocytes (n=18). In 2 cases, matrical areas manifested cytologic atypia, and a third case exhibited an infiltrative growth pattern, with the tumor metastasizing to a lymph node. BerEP4 labeled the follicular germinative cells, whereas it was markedly reduced or negative in matrical areas. The reverse pattern was seen with β-catenin. EMA was negative in BCC areas but stained a proportion of matrical/supramatrical cells. Genetic studies revealed mutations of the following genes: CTNNB1, KIT, CDKN2A, TP53, SMAD4, ERBB4, and PTCH1, with some differences between the matrical and BCC components. It is concluded that matrical differentiation in BCC in most cases occurs as multiple foci. Rare neoplasms manifest atypia in the matrical areas
National Research Council Canada - National Science Library
Trier, Steven
2008-01-01
.... Recent progress in the development of 3D culture models has provided a more physiologically relevant growth environment, in which breast cancer cells imbedded within floating collagen matrices...
National Research Council Canada - National Science Library
Trier, Steven
2007-01-01
.... Recent progress in the development of 3D culture models has provided a more physiologically relevant growth environment, in which breast cancer cells imbedded within floating collagen matrices...
Matrices Aléatoires Tri-diagonales et Par Blocs.
MEKKI, Slimane
2014-01-01
Dans ce mémoire l'étude porte sur la densité de matrice aléatoire, les densités des valeurs propres d'une matrice pour les trois ensembles G.O.E, G.U.E, G.S.E. Après nous avons explicité les formules des densités de valeurs propres des matrices tri-diagonales dans les cas HERMITE et LAGUERRE Des simulations sur les constantes de normalisations pour les densités des matrices aléatoires ou des valeurs propres sont présentées.
Data depth and rank-based tests for covariance and spectral density matrices
Chau, Joris; Ombao, Hernando; Sachs, Rainer von
2017-01-01
In multivariate time series analysis, objects of primary interest to study cross-dependences in the time series are the autocovariance or spectral density matrices. Non-degenerate covariance and spectral density matrices are necessarily Hermitian and positive definite, and our primary goal is to develop new methods to analyze samples of such matrices. The main contribution of this paper is the generalization of the concept of statistical data depth for collections of covariance or spectral density matrices by exploiting the geometric properties of the space of Hermitian positive definite matrices as a Riemannian manifold. This allows one to naturally characterize most central or outlying matrices, but also provides a practical framework for rank-based hypothesis testing in the context of samples of covariance or spectral density matrices. First, the desired properties of a data depth function acting on the space of Hermitian positive definite matrices are presented. Second, we propose two computationally efficient pointwise and integrated data depth functions that satisfy each of these requirements. Several applications of the developed methodology are illustrated by the analysis of collections of spectral matrices in multivariate brain signal time series datasets.
International Nuclear Information System (INIS)
Jarlskog, C.; Stockholm Univ.; Bergen Univ.
1985-01-01
In the standard electroweak model, with three families, a one-to-one correspondence between certain determinants involving quark mass matrices (m and m' for charge 2/3 and -1/3 quarks respectively) and the presence/absence of CP violation is given. In an arbitrary basis for mass matrices, the quantity Im det[mm + , m'm' + ] appropriately normalized is introduced as a measure of CP violation. By this measure, CP is not maximally violated in any transition in Nature. Finally, constraints on quark mass matrices are derived from experiment. Any model of mass matrices, with the ambition to explain Nature, must satisfy these conditions. (orig.)
Laminin active peptide/agarose matrices as multifunctional biomaterials for tissue engineering.
Yamada, Yuji; Hozumi, Kentaro; Aso, Akihiro; Hotta, Atsushi; Toma, Kazunori; Katagiri, Fumihiko; Kikkawa, Yamato; Nomizu, Motoyoshi
2012-06-01
Cell adhesive peptides derived from extracellular matrix components are potential candidates to afford bio-adhesiveness to cell culture scaffolds for tissue engineering. Previously, we covalently conjugated bioactive laminin peptides to polysaccharides, such as chitosan and alginate, and demonstrated their advantages as biomaterials. Here, we prepared functional polysaccharide matrices by mixing laminin active peptides and agarose gel. Several laminin peptide/agarose matrices showed cell attachment activity. In particular, peptide AG73 (RKRLQVQLSIRT)/agarose matrices promoted strong cell attachment and the cell behavior depended on the stiffness of agarose matrices. Fibroblasts formed spheroid structures on the soft AG73/agarose matrices while the cells formed a monolayer with elongated morphologies on the stiff matrices. On the stiff AG73/agarose matrices, neuronal cells extended neuritic processes and endothelial cells formed capillary-like networks. In addition, salivary gland cells formed acini-like structures on the soft matrices. These results suggest that the peptide/agarose matrices are useful for both two- and three-dimensional cell culture systems as a multifunctional biomaterial for tissue engineering. Copyright Â© 2012 Elsevier Ltd. All rights reserved.
A Conceptual Cost Benefit Analysis of Tailings Matrices Use in Construction Applications
Directory of Open Access Journals (Sweden)
Mahmood Ali A.
2016-01-01
Full Text Available As part of a comprehensive research program, new tailings matrices are formulated of combinations of tailings and binder materials. The research program encompasses experimental and numerical analysis of the tailings matrices to investigate the feasibility of using them as construction materials in cold climates. This paper discusses a conceptual cost benefit analysis for the use of these new materials. It is shown here that the financial benefits of using the proposed new tailings matrices in terms of environmental sustainability are much higher when compared to normal sand matrices.
Reinforcement of cement-based matrices with graphite nanomaterials
Sadiq, Muhammad Maqbool
Cement-based materials offer a desirable balance of compressive strength, moisture resistance, durability, economy and energy-efficiency; their tensile strength, fracture energy and durability in aggressive environments, however, could benefit from further improvements. An option for realizing some of these improvements involves introduction of discrete fibers into concrete. When compared with today's micro-scale (steel, polypropylene, glass, etc.) fibers, graphite nanomaterials (carbon nanotube, nanofiber and graphite nanoplatelet) offer superior geometric, mechanical and physical characteristics. Graphite nanomaterials would realize their reinforcement potential as far as they are thoroughly dispersed within cement-based matrices, and effectively bond to cement hydrates. The research reported herein developed non-covalent and covalent surface modification techniques to improve the dispersion and interfacial interactions of graphite nanomaterials in cement-based matrices with a dense and well graded micro-structure. The most successful approach involved polymer wrapping of nanomaterials for increasing the density of hydrophilic groups on the nanomaterial surface without causing any damage to the their structure. The nanomaterials were characterized using various spectrometry techniques, and SEM (Scanning Electron Microscopy). The graphite nanomaterials were dispersed via selected sonication procedures in the mixing water of the cement-based matrix; conventional mixing and sample preparation techniques were then employed to prepare the cement-based nanocomposite samples, which were subjected to steam curing. Comprehensive engineering and durability characteristics of cement-based nanocomposites were determined and their chemical composition, microstructure and failure mechanisms were also assessed through various spectrometry, thermogravimetry, electron microscopy and elemental analyses. Both functionalized and non-functionalized nanomaterials as well as different
ERRORJ, Multigroup covariance matrices generation from ENDF-6 format
International Nuclear Information System (INIS)
Chiba, Go
2007-01-01
1 - Description of program or function: ERRORJ produces multigroup covariance matrices from ENDF-6 format following mainly the methods of the ERRORR module in NJOY94.105. New version differs from previous version in the following features: Additional features in ERRORJ with respect to the NJOY94.105/ERRORR module: - expands processing for the covariance matrices of resolved and unresolved resonance parameters; - processes average cosine of scattering angle and fission spectrum; - treats cross-correlation between different materials and reactions; - accepts input of multigroup constants with various forms (user input, GENDF, etc.); - outputs files with various formats through utility NJOYCOVX (COVERX format, correlation matrix, relative error and standard deviation); - uses a 1% sensitivity method for processing of resonance parameters; - ERRORJ can process the JENDL-3.2 and 3.3 covariance matrices. Additional features of the version 2 with respect to the previous version of ERRORJ: - Since the release of version 2, ERRORJ has been modified to increase its reliability and stability, - calculation of the correlation coefficients in the resonance region, - Option for high-speed calculation is implemented, - Perturbation amount is optimised in a sensitivity calculation, - Effect of the resonance self-shielding can be considered, - a compact covariance format (LCOMP=2) proposed by N. M. Larson can be read. Additional features of the version 2.2.1 with respect to the previous version of ERRORJ: - Several routines were modified to reduce calculation time. The new one needs shorter calculation time (50-70%) than the old version without changing results. - In the U-233 and Pu-241 files of JENDL-3.3 an inconsistency between resonance parameters in MF=32 and those in MF=2 was corrected. NEA-1676/06: This version differs from the previous one (NEA-1676/05) in the following: ERRORJ2.2.1 was modified to treat the self-shielding effect accurately. NEA-1676/07: This version
Exact solution of corner-modified banded block-Toeplitz eigensystems
International Nuclear Information System (INIS)
Cobanera, Emilio; Alase, Abhijeet; Viola, Lorenza; Ortiz, Gerardo
2017-01-01
Motivated by the challenge of seeking a rigorous foundation for the bulk-boundary correspondence for free fermions, we introduce an algorithm for determining exactly the spectrum and a generalized-eigenvector basis of a class of banded block quasi-Toeplitz matrices that we call corner-modified . Corner modifications of otherwise arbitrary banded block-Toeplitz matrices capture the effect of boundary conditions and the associated breakdown of translational invariance. Our algorithm leverages the interplay between a non-standard, projector-based method of kernel determination (physically, a bulk-boundary separation) and families of linear representations of the algebra of matrix Laurent polynomials. Thanks to the fact that these representations act on infinite-dimensional carrier spaces in which translation symmetry is restored, it becomes possible to determine the eigensystem of an auxiliary projected block-Laurent matrix. This results in an analytic eigenvector Ansatz , independent of the system size, which we prove is guaranteed to contain the full solution of the original finite-dimensional problem. The actual solution is then obtained by imposing compatibility with a boundary matrix , whose shape is also independent of system size. As an application, we show analytically that eigenvectors of short-ranged fermionic tight-binding models may display power-law corrections to exponential behavior, and demonstrate the phenomenon for the paradigmatic Majorana chain of Kitaev. (paper)
Various semiclassical limits of torus conformal blocks
Energy Technology Data Exchange (ETDEWEB)
Alkalaev, Konstantin [I.E. Tamm Department of Theoretical Physics, P.N. Lebedev Physical Institute,Leninsky ave. 53, Moscow, 119991 (Russian Federation); Department of General and Applied Physics, Moscow Institute of Physics and Technology,Institutskiy per. 7, Dolgoprudnyi, Moscow region, 141700 (Russian Federation); Geiko, Roman [Mathematics Department, National Research University Higher School of Economics,Usacheva str. 6, Moscow, 119048 (Russian Federation); Rappoport, Vladimir [I.E. Tamm Department of Theoretical Physics, P.N. Lebedev Physical Institute,Leninsky ave. 53, Moscow, 119991 (Russian Federation); Department of Quantum Physics, Institute for Information Transmission Problems,Bolshoy Karetny per. 19, Moscow, 127994 (Russian Federation)
2017-04-12
We study four types of one-point torus blocks arising in the large central charge regime. There are the global block, the light block, the heavy-light block, and the linearized classical block, according to different regimes of conformal dimensions. It is shown that the blocks are not independent being connected to each other by various links. We find that the global, light, and heavy-light blocks correspond to three different contractions of the Virasoro algebra. Also, we formulate the c-recursive representation of the one-point torus blocks which is relevant in the semiclassical approximation.
A hybrid method for the parallel computation of Green's functions
DEFF Research Database (Denmark)
Petersen, Dan Erik; Li, Song; Stokbro, Kurt
2009-01-01
of the large number of times this calculation needs to be performed, this is computationally very expensive even on supercomputers. The classical approach is based on recurrence formulas which cannot be efficiently parallelized. This practically prevents the solution of large problems with hundreds...... of thousands of atoms. We propose new recurrences for a general class of sparse matrices to calculate Green's and lesser Green's function matrices which extend formulas derived by Takahashi and others. We show that these recurrences may lead to a dramatically reduced computational cost because they only...... require computing a small number of entries of the inverse matrix. Then. we propose a parallelization strategy for block tridiagonal matrices which involves a combination of Schur complement calculations and cyclic reduction. It achieves good scalability even on problems of modest size....
Extreme eigenvalues of sample covariance and correlation matrices
DEFF Research Database (Denmark)
Heiny, Johannes
This thesis is concerned with asymptotic properties of the eigenvalues of high-dimensional sample covariance and correlation matrices under an infinite fourth moment of the entries. In the first part, we study the joint distributional convergence of the largest eigenvalues of the sample covariance...... matrix of a p-dimensional heavy-tailed time series when p converges to infinity together with the sample size n. We generalize the growth rates of p existing in the literature. Assuming a regular variation condition with tail index ... eigenvalues are essentially determined by the extreme order statistics from an array of iid random variables. The asymptotic behavior of the extreme eigenvalues is then derived routinely from classical extreme value theory. The resulting approximations are strikingly simple considering the high dimension...
Fractionation of chromium(III) compounds in biological matrices
Energy Technology Data Exchange (ETDEWEB)
Knoechel, A.; Weseloh, G. [Institute of Inorganic and Applied Chemistry, University of Hamburg (Germany)
1999-03-01
Many details of the metabolism and biological significance of trivalent inorganic cations have remained obscure up to now, not least because of the lack of appropriate tools for species analysis of these cations in biological matrices. In order to demonstrate the capabilities of reversed-phase ion-pair chromatography, the distribution of chromium species in brewer`s yeast, previously incubated with radiolabelled {sup 51}Cr chloride was investigated. Contradictory to the findings of most other researchers in this area, two low-molecular weight, anionic chromium species were detected in cytosolic yeast extracts. In conclusion, reversed-phase ion-pair chromatography may reveal new details of intracellular metabolism of chromium(III) and, possibly, other trivalent cations. (orig.) With 1 fig., 16 refs.
Higgs-boson masses and mixing matrices in the NMSSM
DEFF Research Database (Denmark)
Drechsel, P.; Gröber, R.; Heinemeyer, S.
2017-01-01
We analyze the Higgs-boson masses and mixing matrices in the NMSSM based on an on-shell (OS) renormalization of the gauge-boson and Higgs-boson masses and the parameters of the top/scalar top sector. We compare the implementation of the OS calculations in the codes NMSSMCALC and NMSSM-FeynHiggs up...... to O(αtαs). We identify the sources of discrepancies at the one- and at the two-loop level. Finally we compare the OS and DR ¯ evaluation as implemented in NMSSMCALC. The results are important ingredients for an estimate of the theoretical precision of Higgs-boson mass calculations in the NMSSM....
Uranium Metal Reaction Behavior in Water, Sludge, and Grout Matrices
Energy Technology Data Exchange (ETDEWEB)
Delegard, Calvin H.; Schmidt, Andrew J.
2009-05-27
This report summarizes information and data on the reaction behavior of uranium metal in water, in water-saturated simulated and genuine K Basin sludge, and in grout matrices. This information and data are used to establish the technical basis for metallic uranium reaction behavior for the K Basin Sludge Treatment Project (STP). The specific objective of this report is to consolidate the various sources of information into a concise document to serve as a high-level reference and road map for customers, regulators, and interested parties outside the STP (e.g., external reviewers, other DOE sites) to clearly understand the current basis for the corrosion of uranium metal in water, sludge, and grout.
Uranium Metal Reaction Behavior in Water, Sludge, and Grout Matrices
Energy Technology Data Exchange (ETDEWEB)
Delegard, Calvin H.; Schmidt, Andrew J.
2008-09-25
This report summarizes information and data on the reaction behavior of uranium metal in water, in water-saturated simulated and genuine K Basin sludge, and in grout matrices. This information and data are used to establish the technical basis for metallic uranium reaction behavior for the K Basin Sludge Treatment Project (STP). The specific objective of this report is to consolidate the various sources of information into a concise document to serve as a high-level reference and road map for customers, regulators, and interested parties outside the STP (e.g., external reviewers, other DOE sites) to clearly understand the current basis for the corrosion of uranium metal in water, sludge, and grout.
Encapsulation of biological species in sol-gel matrices
International Nuclear Information System (INIS)
Finnie, K.S.; Bartlett, J.R.; Woolfrey, J.L.
2000-01-01
Two examples are given of the gelation of silica sols containing bio catalysts, resulting in their encapsulation in porous matrices. Urease was encapsulated in gels made from a mixture of TMOS and alkyltrimethoxysilane. Enzyme activities, monitored by measuring the rate of production of ammoniacal nitrogen as urea was decomposed, ranged up to 60% of that of the unencapsulated species. Anaerobic sulphate-reducing bacteria were encapsulated in a gel produced from colloidal silica, thus avoiding contact with alcohol. The detection of H 2 S produced in the doped gel indicated that the bacteria were able to continue normal metabolic function within the gel matrix. A gel initially doped with ∼ 5 x 10 5 cells cm -3 , exhibited an optimum sulphate reduction rate of 11 ug h -1 cm -3 ; this reduction rate was quickly re-established after storage of the gel for 14 weeks. Copyright (2000) The Australian Ceramic Society
Synthesis of metallic nanoparticles in SiO2 matrices
International Nuclear Information System (INIS)
Gutierrez W, C.; Mondragon G, G.; Perez H, R.; Mendoza A, D.
2004-01-01
Metallic nanoparticles was synthesized in SiO 2 matrices by means of a process of two stages. The first one proceeded via sol-gel, incorporating the metallic precursors to the reaction system before the solidification of the matrix. Later on, the samples underwent a thermal treatment in atmosphere of H 2 , carrying out the reduction of the metals that finally formed to the nanoparticles. Then it was detected the presence of smaller nanoparticles than 20 nm, dispersed and with the property of being liberated easily of the matrix, conserving a free surface, chemically reactive and with response to external electromagnetic radiation. The system SiO 2 -Pd showed an important thermoluminescent response. (Author)
Product of Ginibre matrices: Fuss-Catalan and Raney distributions
Penson, Karol A.; Życzkowski, Karol
2011-06-01
Squared singular values of a product of s square random Ginibre matrices are asymptotically characterized by probability distributions Ps(x), such that their moments are equal to the Fuss-Catalan numbers of order s. We find a representation of the Fuss-Catalan distributions Ps(x) in terms of a combination of s hypergeometric functions of the type sFs-1. The explicit formula derived here is exact for an arbitrary positive integer s, and for s=1 it reduces to the Marchenko-Pastur distribution. Using similar techniques, involving the Mellin transform and the Meijer G function, we find exact expressions for the Raney probability distributions, the moments of which are given by a two-parameter generalization of the Fuss-Catalan numbers. These distributions can also be considered as a two-parameter generalization of the Wigner semicircle law.
Poles of the Zagreb analysis partial-wave T matrices
Batinić, M.; Ceci, S.; Švarc, A.; Zauner, B.
2010-09-01
The Zagreb analysis partial-wave T matrices included in the Review of Particle Physics [by the Particle Data Group (PDG)] contain Breit-Wigner parameters only. As the advantages of pole over Breit-Wigner parameters in quantifying scattering matrix resonant states are becoming indisputable, we supplement the original solution with the pole parameters. Because of an already reported numeric error in the S11 analytic continuation [Batinić , Phys. Rev. CPRVCAN0556-281310.1103/PhysRevC.57.1004 57, 1004(E) (1997); arXiv:nucl-th/9703023], we declare the old BATINIC 95 solution, presently included by the PDG, invalid. Instead, we offer two new solutions: (A) corrected BATINIC 95 and (B) a new solution with an improved S11 πN elastic input. We endorse solution (B).
Autonomous identification of matrices in the APNea system
International Nuclear Information System (INIS)
Hensley, D.
1995-01-01
The APNea System is a passive and active neutron assay device which features imaging to correct for nonuniform distributions of source material. Since the imaging procedure requires a detailed knowledge of both the detection efficiency and the thermal neutron flux for (sub)volumes of the drum of interest, it is necessary to identify which mocked-up matrix, to be used for detailed characterization studies, best matches the matrix of interest. A methodology referred to as the external matrix probe (EMP) has been established which links external measures of a drum matrix to those of mocked-up matrices. These measures by themselves are sufficient to identify the appropriate mock matrix, from which the necessary characterization data are obtained. This independent matrix identification leads to an autonomous determination of the required system response parameters for the assay analysis
Harmonic R-matrices for scattering amplitudes and spectral regularization
Energy Technology Data Exchange (ETDEWEB)
Ferro, Livia; Plefka, Jan [Humboldt-Universitaet, Berlin (Germany). Inst. fuer Physik; Lukowski, Tomasz [Humboldt-Universitaet, Berlin (Germany). Inst. fuer Physik; Humboldt-Universitaet, Berlin (Germany). Inst. fuer Mathematik; Humboldt-Univ. Berlin (Germany). IRIS Adlershof; Meneghelli, Carlo [Hamburg Univ. (Germany). Fachbereich 11 - Mathematik; Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany). Theory Group; Staudacher, Matthias [Humboldt-Universitaet, Berlin (Germany). Inst. fuer Mathematik; Humboldt-Universitaet, Berlin (Germany). Inst. fuer Physik; Max-Planck-Institut fuer Gravitationsphysik (Albert-Einstein-Institut), Potsdam (Germany)
2012-12-15
Planar N=4 super Yang-Mills appears to be integrable. While this allows to find this theory's exact spectrum, integrability has hitherto been of no direct use for scattering amplitudes. To remedy this, we deform all scattering amplitudes by a spectral parameter. The deformed tree-level four-point function turns out to be essentially the one-loop R-matrix of the integrable N=4 spin chain satisfying the Yang-Baxter equation. Deformed on-shell three-point functions yield novel three-leg R-matrices satisfying bootstrap equations. Finally, we supply initial evidence that the spectral parameter might find its use as a novel symmetry-respecting regulator replacing dimensional regularization. Its physical meaning is a local deformation of particle helicity, a fact which might be useful for a much larger class of non-integrable four-dimensional field theories.
Raman spectra of ruthenium and tantalum trimers in argon matrices
Fang, Li; Shen, Xiaole; Chen, Xiaoyu; Lombardi, John R.
2000-12-01
The resonance Raman spectra of ruthenium trimers (Ru 3) in argon matrices have been obtained. Three resonance Raman transitions were observed between 570 and 590 nm. Two of them (303.4 and 603.7 cm -1) are assigned to the totally symmetric vibrational progression, giving k e=1.86 mdyne/ Å. The line at 581.5 cm-1 is assigned as the origin of a low-lying electronic state. We also report on the observation of a resonance Raman spectrum of tantalum trimers (Ta 3). Observed lines include 251.2 and 501.9 cm-1 which we assign to the fundamental and the first overtone of the symmetric stretch in Ta 3. This gives k e=2.25 mdyne/ Å.
The analytic structure of trigonometric S-matrices
International Nuclear Information System (INIS)
Hollowood, T.J.
1994-01-01
S-matrices associated to the vector representations of the quantum groups for the classical Lie algebras are constructed. For the a m-1 and c m algebras the complete S-matrix is found by an application of the bootstrap equations. It is shown that the simplest form for the S-matrix which generalizes that of the Gross-Neveu model is not consistent for the non-simply-laced algebras due to the existence of unexplained singularities on the physical strip. However, a form which generalizes the S-matrix of the principal chiral model is shown to be consistent via an argument which uses a novel application of the Coleman-Thun mechanism. The analysis also gives a correct description of the analytic structure of the S-matrix of the principle chiral model for c m . (orig.)
Solution of generalized shifted linear systems with complex symmetric matrices
International Nuclear Information System (INIS)
Sogabe, Tomohiro; Hoshi, Takeo; Zhang, Shao-Liang; Fujiwara, Takeo
2012-01-01
We develop the shifted COCG method [R. Takayama, T. Hoshi, T. Sogabe, S.-L. Zhang, T. Fujiwara, Linear algebraic calculation of Green’s function for large-scale electronic structure theory, Phys. Rev. B 73 (165108) (2006) 1–9] and the shifted WQMR method [T. Sogabe, T. Hoshi, S.-L. Zhang, T. Fujiwara, On a weighted quasi-residual minimization strategy of the QMR method for solving complex symmetric shifted linear systems, Electron. Trans. Numer. Anal. 31 (2008) 126–140] for solving generalized shifted linear systems with complex symmetric matrices that arise from the electronic structure theory. The complex symmetric Lanczos process with a suitable bilinear form plays an important role in the development of the methods. The numerical examples indicate that the methods are highly attractive when the inner linear systems can efficiently be solved.
Immobilization of radioactive waste in cement-based matrices
International Nuclear Information System (INIS)
Glasser, F.P.; Rahman, A.A.; Crawford, R.W.; McCulloch, C.E.; Angus, M.J.
1984-01-01
Tobermorite and xonotlite, two synthetic calcium silicate hydrates, improve the Cs retention of cement matrices for Cs, when incorporated at the 6 to 10% level. A kinetic and mechanistic scheme is presented for the reaction of fine grained, Cs-loaded clinoptilolite with cement. The Magnox waste form reacts quickly with cement, leading to an exchange of carbonate between waste form and cement components. Carbonation of cements leads to a marked improvement in their physical properties of Cs retentivity. Diffusion models are presented for cement systems whose variable parameters can readily be derived from experimental measurements. Predictions about scaled-up behaviour of large immobilized masses are applied to extrapolation of laboratory scale results to full-size masses. (author)
Weighted Low-Rank Approximation of Matrices and Background Modeling
Dutta, Aritra
2018-04-15
We primarily study a special a weighted low-rank approximation of matrices and then apply it to solve the background modeling problem. We propose two algorithms for this purpose: one operates in the batch mode on the entire data and the other one operates in the batch-incremental mode on the data and naturally captures more background variations and computationally more effective. Moreover, we propose a robust technique that learns the background frame indices from the data and does not require any training frames. We demonstrate through extensive experiments that by inserting a simple weight in the Frobenius norm, it can be made robust to the outliers similar to the $\\\\ell_1$ norm. Our methods match or outperform several state-of-the-art online and batch background modeling methods in virtually all quantitative and qualitative measures.
Modified conjugate gradient method for diagonalizing large matrices.
Jie, Quanlin; Liu, Dunhuan
2003-11-01
We present an iterative method to diagonalize large matrices. The basic idea is the same as the conjugate gradient (CG) method, i.e, minimizing the Rayleigh quotient via its gradient and avoiding reintroducing errors to the directions of previous gradients. Each iteration step is to find lowest eigenvector of the matrix in a subspace spanned by the current trial vector and the corresponding gradient of the Rayleigh quotient, as well as some previous trial vectors. The gradient, together with the previous trial vectors, play a similar role as the conjugate gradient of the original CG algorithm. Our numeric tests indicate that this method converges significantly faster than the original CG method. And the computational cost of one iteration step is about the same as the original CG method. It is suitable for first principle calculations.
Considerations in designing and using superconductors with high resistivity matrices
International Nuclear Information System (INIS)
Bartlett, R.J.; Carlson, R.V.; Laquer, H.L.; Migliori, A.
1976-01-01
Superconductors are often designed with matrices of much higher residual resistivities than copper for reasons of manufacturing (multifilamentary Nb 3 Sn in CuSn bronze) or loss reduction (mixed matrix NbTi with Cu and CuNi). The high resistivity matrix may complicate or degrade contact resistances at the joints, generate excess heat, reduce the stability of the conductor, and interfere with the observation of flux flow resistivities in the 10 -12 Ω-cm region. The minimization of these effects is discussed, presenting both simple and more refined models for the current transfer length, and it is shown how variations in transfer length (with current), particularly under significant self field conditions, can mimic flux flow resistivity
Multifunctional and biologically active matrices from multicomponent polymeric solutions
Kiick, Kristi L. (Inventor); Yamaguchi, Nori (Inventor)
2010-01-01
The present invention relates to a biologically active functionalized electrospun matrix to permit immobilization and long-term delivery of biologically active agents. In particular the invention relates to a functionalized polymer matrix comprising a matrix polymer, a compatibilizing polymer and a biomolecule or other small functioning molecule. In certain aspects the electrospun polymer fibers comprise at least one biologically active molecule functionalized with low molecular weight heparin. Examples of active molecules that may be used with the multicomponent polymer of the invention include, for example, a drug, a biopolymer, for example a growth factor, a protein, a peptide, a nucleotide, a polysaccharide, a biological macromolecule or the like. The invention is further directed to the formation of functionalized crosslinked matrices, such as hydrogels, that include at least one functionalized compatibilizing polymer capable of assembly.
Weighted Low-Rank Approximation of Matrices and Background Modeling
Dutta, Aritra; Li, Xin; Richtarik, Peter
2018-01-01
We primarily study a special a weighted low-rank approximation of matrices and then apply it to solve the background modeling problem. We propose two algorithms for this purpose: one operates in the batch mode on the entire data and the other one operates in the batch-incremental mode on the data and naturally captures more background variations and computationally more effective. Moreover, we propose a robust technique that learns the background frame indices from the data and does not require any training frames. We demonstrate through extensive experiments that by inserting a simple weight in the Frobenius norm, it can be made robust to the outliers similar to the $\\ell_1$ norm. Our methods match or outperform several state-of-the-art online and batch background modeling methods in virtually all quantitative and qualitative measures.
Video based object representation and classification using multiple covariance matrices.
Zhang, Yurong; Liu, Quan
2017-01-01
Video based object recognition and classification has been widely studied in computer vision and image processing area. One main issue of this task is to develop an effective representation for video. This problem can generally be formulated as image set representation. In this paper, we present a new method called Multiple Covariance Discriminative Learning (MCDL) for image set representation and classification problem. The core idea of MCDL is to represent an image set using multiple covariance matrices with each covariance matrix representing one cluster of images. Firstly, we use the Nonnegative Matrix Factorization (NMF) method to do image clustering within each image set, and then adopt Covariance Discriminative Learning on each cluster (subset) of images. At last, we adopt KLDA and nearest neighborhood classification method for image set classification. Promising experimental results on several datasets show the effectiveness of our MCDL method.
Electrospun Phospholipid Fibers as Micro-Encapsulation and Antioxidant Matrices.
Shekarforoush, Elhamalsadat; Mendes, Ana C; Baj, Vanessa; Beeren, Sophie R; Chronakis, Ioannis S
2017-10-17
Electrospun phospholipid (asolectin) microfibers were investigated as antioxidants and encapsulation matrices for curcumin and vanillin. These phospholipid microfibers exhibited antioxidant properties which increased after the encapsulation of both curcumin and vanillin. The total antioxidant capacity (TAC) and the total phenolic content (TPC) of curcumin/phospholipid and vanillin/phospholipid microfibers remained stable over time at different temperatures (refrigerated, ambient) and pressures (vacuum, ambient). ¹H-NMR confirmed the chemical stability of both encapsulated curcumin and vanillin within phospholipid fibers. Release studies in aqueous media revealed that the phenolic bioactives were released mainly due to swelling of the phospholipid fiber matrix over time. The above studies confirm the efficacy of electrospun phospholipid microfibers as encapsulation and antioxidant systems.
Electrospun Phospholipid Fibers as Micro-Encapsulation and Antioxidant Matrices
Directory of Open Access Journals (Sweden)
Elhamalsadat Shekarforoush
2017-10-01
Full Text Available Electrospun phospholipid (asolectin microfibers were investigated as antioxidants and encapsulation matrices for curcumin and vanillin. These phospholipid microfibers exhibited antioxidant properties which increased after the encapsulation of both curcumin and vanillin. The total antioxidant capacity (TAC and the total phenolic content (TPC of curcumin/phospholipid and vanillin/phospholipid microfibers remained stable over time at different temperatures (refrigerated, ambient and pressures (vacuum, ambient. 1H-NMR confirmed the chemical stability of both encapsulated curcumin and vanillin within phospholipid fibers. Release studies in aqueous media revealed that the phenolic bioactives were released mainly due to swelling of the phospholipid fiber matrix over time. The above studies confirm the efficacy of electrospun phospholipid microfibers as encapsulation and antioxidant systems.
Diagonalization of replicated transfer matrices for disordered Ising spin systems
International Nuclear Information System (INIS)
Nikoletopoulos, T; Coolen, A C C
2004-01-01
We present an alternative procedure for solving the eigenvalue problem of replicated transfer matrices describing disordered spin systems with (random) 1D nearest neighbour bonds and/or random fields, possibly in combination with (random) long range bonds. Our method is based on transforming the original eigenvalue problem for a 2 n x 2 n matrix (where n → 0) into an eigenvalue problem for integral operators. We first develop our formalism for the Ising chain with random bonds and fields, where we recover known results. We then apply our methods to models of spins which interact simultaneously via a one-dimensional ring and via more complex long-range connectivity structures, e.g., (1 + ∞)-dimensional neural networks and 'small-world' magnets. Numerical simulations confirm our predictions satisfactorily
Release and diffusional modeling of metronidazole lipid matrices.
Ozyazici, Mine; Gökçe, Evren H; Ertan, Gökhan
2006-07-01
In this study, the first aim was to investigate the swelling and relaxation properties of lipid matrix on diffusional exponent (n). The second aim was to determine the desired release profile of metronidazole lipid matrix tablets. We prepared metronidazole lipid matrix granules using Carnauba wax, Beeswax, Stearic acid, Cutina HR, Precirol ATO 5, and Compritol ATO 888 by hot fusion method and pressed the tablets of these granules. In vitro release test was performed using a standard USP dissolution apparatus I (basket method) with a stirring rate of 100 rpm at 37 degrees C in 900 ml of 0.1 N hydrochloric acid, adjusted to pH 1.2, as medium for the formulations' screening. Hardness, diameter-height ratio, friability, and swelling ratio were determined. Target release profile of metronidazole was also drawn. Stearic acid showed the highest and Carnauba wax showed the lowest release rates in all formulations used. Swelling ratios were calculated after the dissolution of tablets as 9.24%, 6.03%, 1.74%, and 1.07% for Cutina HR, Beeswax, Precirol ATO 5, and Compritol ATO 888, respectively. There was erosion in Stearic acid, but neither erosion nor swelling in Carnauba wax, was detected. According to the power law analysis, the diffusion mechanism was expressed as pure Fickian for Stearic acid and Carnauba wax and the coupling of Fickian and relaxation contributions for other Cutina HR, Beeswax, Compritol ATO 888, and Precirol ATO 5 tablets. It was found that Beeswax (kd=2.13) has a very close drug release rate with the target profile (kt=1.95). Our results suggested that swelling and relaxation properties of lipid matrices should be examined together for a correct evaluation on drug diffusion mechanism of insoluble matrices.
Climatological features of blocking anticyclones
International Nuclear Information System (INIS)
Lupo, A.R.; Smith, P.J.; Oglesby, R.J.
1994-01-01
Several climatological studies have been previously performed using large observational data sets (i.e., 10 years or longer) in order to determine the predominant characteristics of blocking anticyclones, including favored development regions, duration, preferred seasonal occurrence, and frequency of occurrence. These studies have shown that blocking anticyclones occur most frequently from October to April over the eastern Atlantic and Pacific oceans downstream from both the North American and Asian continental regions and the storm track regions to the east of these continents. Some studies have also revealed the presence of a third region block formation in western Russia near 40 degrees E which is associated with another storm track region over the Mediterranean and western Asia
Directory of Open Access Journals (Sweden)
Keith Stuart
2009-12-01
Full Text Available This article describes research undertaken in order to design a methodology for the reticular representation of knowledge of a specific discourse community. To achieve this goal, a representative corpus of the scientific production of the members of this discourse community (Universidad Politécnica de Valencia, UPV was created. The article presents the practical analysis (frequency, keyword, collocation and cluster analysis that was carried out in the initial phases of the study aimed at establishing the theoretical and practical background and framework for our matrix and network analysis of the scientific discourse of the UPV. In the methodology section, the processes that have allowed us to extract from the corpus the linguistic elements needed to develop co-occurrence matrices, as well as the computer tools used in the research, are described. From these co-occurrence matrices, semantic networks of subject and discipline knowledge were generated. Finally, based on the results obtained, we suggest that it may be viable to extract and to represent the intellectual capital of an academic institution using corpus linguistics methods in combination with the formulations of network theory.En este artículo describimos la investigación que se ha desarrollado en el diseño de una metodología para la representación reticular del conocimiento que se genera en el seno de una institución a partir de un corpus representativo de la producción científica de los integrantes de dicha comunidad discursiva, la Universidad Politécnica de Valencia.. Para ello, presentamos las acciones que se realizaron en las fases iniciales del estudio encaminadas a establecer el marco teórico y práctico en el que se inscribe nuestro análisis. En la sección de metodología se describen las herramientas informáticas utilizadas, así como los procesos que nos permitieron disponer de aquellos elementos presentes en el corpus, que nos llevarían al desarrollo de
Block ground interaction of rockfalls
Volkwein, Axel; Gerber, Werner; Kummer, Peter
2016-04-01
During a rockfall the interaction of the falling block with the ground is one of the most important factors that define the evolution of a rockfall trajectory. It steers the rebound, the rotational movement, possibly brake effects, friction losses and damping effects. Therefore, if most reliable rockfall /trajectory simulation software is sought a good understanding of the block ground interaction is necessary. Today's rockfall codes enable the simulation of a fully 3D modelled block within a full 3D surface . However, the details during the contact, i.e. the contact duration, the penetration depth or the dimension of the marks in the ground are usually not part of the simulation. Recent field tests with rocks between 20 and 80 kg have been conducted on a grassy slope in 2014 [1]. A special rockfall sensor [2] within the blocks measured the rotational velocity and the acting accelerations during the tests. External video records and a so-called LocalPositioningSystem deliver information on the travel velocity. With these data not only the flight phases of the trajectories but also the contacts with the ground can be analysed. During the single jumps of a block the flight time, jump length, the velocity, and the rotation are known. During the single impacts their duration and the acting accelerations are visible. Further, the changes of rotational and translational velocity influence the next jump of the block. The change of the rotational velocity over the whole trajectory nicely visualizes the different phases of a rockfall regarding general acceleration and deceleration in respect to the inclination and the topography of the field. References: [1] Volkwein A, Krummenacher B, Gerber W, Lardon J, Gees F, Brügger L, Ott T (2015) Repeated controlled rockfall trajectory testing. [Abstract] Geophys. Res. Abstr. 17: EGU2015-9779. [2] Volkwein A, Klette J (2014) Semi-Automatic Determination of Rockfall Trajectories. Sensors 14: 18187-18210.
Cryptanalysis of Selected Block Ciphers
DEFF Research Database (Denmark)
Alkhzaimi, Hoda A.
, pseudorandom number generators, and authenticated encryption designs. For this reason a multitude of initiatives over the years has been established to provide a secure and sound designs for block ciphers as in the calls for Data Encryption Standard (DES) and Advanced Encryption Standard (AES), lightweight...... ciphers initiatives, and the Competition for Authenticated Encryption: Security, Applicability, and Robustness (CAESAR). In this thesis, we first present cryptanalytic results on different ciphers. We propose attack named the Invariant Subspace Attack. It is utilized to break the full block cipher...
Directory of Open Access Journals (Sweden)
Zhaolin Jiang
2014-01-01
Full Text Available Circulant matrices play an important role in solving delay differential equations. In this paper, circulant type matrices including the circulant and left circulant and g-circulant matrices with any continuous Fibonacci and Lucas numbers are considered. Firstly, the invertibility of the circulant matrix is discussed and the explicit determinant and the inverse matrices by constructing the transformation matrices are presented. Furthermore, the invertibility of the left circulant and g-circulant matrices is also studied. We obtain the explicit determinants and the inverse matrices of the left circulant and g-circulant matrices by utilizing the relationship between left circulant, g-circulant matrices and circulant matrix, respectively.
Theory of quark mixing matrix and invariant functions of mass matrices
International Nuclear Information System (INIS)
Jarlskog, C.
1987-10-01
The outline of this talk is as follows: The origin of the quark mixing matrix. Super elementary theory of flavour projection operators. Equivalences and invariances. The commutator formalism and CP violation. CP conditions for any number of families. The 'angle' between the quark mass matrices. Application to Fritzsch and Stech matrices. References. (author)
International Nuclear Information System (INIS)
Boshoven, J.G.; Hein, H.; Konings, R.J.M.
1996-07-01
This report describes the fabrication of targets containing inert matrices for the heterogeneous transmutation of plutonium and minor actinides. These targets will be irradiated in the EFTTRA-T2 (RAS-2) irradiation programme. The selection, preparation and characterization of the inert matrices and fabrication and loading of the irradiation capsules are discussed. (orig.)
Empowering first year (post-matric) students in basic research skills ...
African Journals Online (AJOL)
Post-matric students from under-resourced (historically disadvantaged) black high schools generally encounter difficulties in their academic work at university. The study reported here was intended to empower first year (post-matric) students from these schools with basic research skills in a bid to counteract the effects of ...
Diagonalization of quark mass matrices and the Cabibbo-Kobayashi-Maskawa matrix
International Nuclear Information System (INIS)
Rasin, A.
1997-08-01
I discuss some general aspect of diagonalizing the quark mass matrices and list all possible parametrizations of the Cabibbo-Kobayashi-Maskawa matrix (CKM) in terms of three rotation angles and a phase. I systematically study the relation between the rotations needed to diagonalize the Yukawa matrices and various parametrizations of the CKM. (author). 17 refs, 1 tab
Elements of Calculus Quaternionic Matrices And Some Applications In Vector Algebra And Kinematics
Directory of Open Access Journals (Sweden)
Pivnyak G.G.
2016-04-01
Full Text Available Quaternionic matrices are proposed to develop mathematical models and perform computational experiments. New formulae for complex vector and scalar products matrix notation, formulae of first curvature, second curvature and orientation of true trihedron tracing are demonstrated in this paper. Application of quaternionic matrices for a problem of airspace transport system trajectory selection is shown.
Energy Technology Data Exchange (ETDEWEB)
Nardova, A.K.; Filippov, E.A. [All Research Institute of Chemical Technologies, Moscow (Russian Federation); Glagolenko, Y.B. [and others
1996-05-01
This report presents the results of investigations of plutonium immobilization from solutions on inorganic matrices with the purpose of producing a solid waste form. High-temperature sorption is described which entails the adsorption of radionuclides from solutions on porous, inorganic matrices, as for example silica gel. The solution is brought to a boil with additional thermal process (calcination) of the saturated granules.
International Nuclear Information System (INIS)
Chudnovsky, D.V.; Chudnovsky, G.V.
1981-01-01
We consider general expressions of factorized S-matrices with Abelian symmetry expressed in terms of theta-functions. These expressions arise from representations of the Heisenberg group. New examples of factorized S-matrices lead to a large class of completely integrable models of statistical mechanics which generalize the XYZ-model of the eight-vertex model. (orig.)
Tan, Yen Hock; Huang, He; Kihara, Daisuke
2006-08-15
Aligning distantly related protein sequences is a long-standing problem in bioinformatics, and a key for successful protein structure prediction. Its importance is increasing recently in the context of structural genomics projects because more and more experimentally solved structures are available as templates for protein structure modeling. Toward this end, recent structure prediction methods employ profile-profile alignments, and various ways of aligning two profiles have been developed. More fundamentally, a better amino acid similarity matrix can improve a profile itself; thereby resulting in more accurate profile-profile alignments. Here we have developed novel amino acid similarity matrices from knowledge-based amino acid contact potentials. Contact potentials are used because the contact propensity to the other amino acids would be one of the most conserved features of each position of a protein structure. The derived amino acid similarity matrices are tested on benchmark alignments at three different levels, namely, the family, the superfamily, and the fold level. Compared to BLOSUM45 and the other existing matrices, the contact potential-based matrices perform comparably in the family level alignments, but clearly outperform in the fold level alignments. The contact potential-based matrices perform even better when suboptimal alignments are considered. Comparing the matrices themselves with each other revealed that the contact potential-based matrices are very different from BLOSUM45 and the other matrices, indicating that they are located in a different basin in the amino acid similarity matrix space.
Identification of necessary and sufficient conditions for real non-negativeness of rational matrices
International Nuclear Information System (INIS)
Saeed, K.
1982-12-01
The necessary and sufficient conditions for real non-negativeness of rational matrices have been identified. A programmable algorithm is developed and is given with its computer flow chart. This algorithm can be used as a general solution to test the real non-negativeness of rational matrices. The computer program assures the feasibility of the suggested algorithm. (author)
A Technique for Controlling Matric Suction on Filter Papers . GroWth ...
African Journals Online (AJOL)
'Abstract. Moist filter papers are widely usedfor seed gennination tests but their water confent and matric suction are not usually controlled. A technique for controlling filter paper matric suction is described and usedfor germination studies involving fresh and aged sorghum seed (Sorghummcolor (L) Moench). Filter papers ...
A Technique for Controlling Matric Suction on Filter Papers Used in ...
African Journals Online (AJOL)
Moist filter papers are widely usedfor seed gennination tests but their water confent and matric suction are not usually controlled. A technique for controlling filter paper matric suction is described and usedfor germination studies involving fresh and aged sorghum seed (Sorghummcolor (L) Moench). Filter papers wetted to ...
Neeft, E.A.C.
2004-01-01
Fission of actinides from nuclear waste in inert matrices (materials without uranium) can reduce the period in time that nuclear waste is more radiotoxic than uranium ore that is the rock from which ordinary reactor fuel is made. A pioneering study is performed with the inert matrices: MgO, MgAl2O4,
Concrete minimal 3 × 3 Hermitian matrices and some general cases
Directory of Open Access Journals (Sweden)
Klobouk Abel H.
2017-12-01
Full Text Available Given a Hermitian matrix M ∈ M3(ℂ we describe explicitly the real diagonal matrices DM such that ║M + DM║ ≤ ║M + D║ for all real diagonal matrices D ∈ M3(ℂ, where ║ · ║ denotes the operator norm. Moreover, we generalize our techniques to some n × n cases.
Litvinenko, Alexander
2018-03-12
Part 1: Parallel H-matrices in spatial statistics 1. Motivation: improve statistical model 2. Tools: Hierarchical matrices 3. Matern covariance function and joint Gaussian likelihood 4. Identification of unknown parameters via maximizing Gaussian log-likelihood 5. Implementation with HLIBPro. Part 2: Low-rank Tucker tensor methods in spatial statistics
A Comparison of Teacher Stress and School Climate across Schools with Different Matric Success Rates
Milner, Karen; Khoza, Harriet
2008-01-01
Our aim was to investigate differences in teacher stress and perceptions of school climate among teachers from schools with differing matriculation success rates in the Limpopo province of South Africa. Two schools with matric pass rates of 100% and two schools with matric pass rates of less than 25% were selected from a list of schools provided…
The reflection of hierarchical cluster analysis of co-occurrence matrices in SPSS
Zhou, Q.; Leng, F.; Leydesdorff, L.
2015-01-01
Purpose: To discuss the problems arising from hierarchical cluster analysis of co-occurrence matrices in SPSS, and the corresponding solutions. Design/methodology/approach: We design different methods of using the SPSS hierarchical clustering module for co-occurrence matrices in order to compare
Litvinenko, Alexander
2017-01-01
matrices. Therefore covariance matrices are approximated in the hierarchical ($\\H$-) matrix format with computational cost $\\mathcal{O}(k^2n \\log^2 n/p)$ and storage $\\mathcal{O}(kn \\log n)$, where the rank $k$ is a small integer (typically $k<25$), $p