We discuss some new invariants of quark mixing and show their usefulness with a simple example. We also present some other new tools for analyzing quark mixing. ∗ talk presented at the Yukawa couplings and the origin of mass workshop, February 1994, University of Florida, Gainesville, Florida ∗∗address after September 1, 1994: Department of Physics, University of Pennsylvania, Philadelphia, PA ...

The effects of ball milling parameters, namely, the ball-to-powder mass ratio and milling speed, on the synthesis of (K0.5Na0.5)NbO3 nanopowders by high-energy ball milling method from a stoichiometric mixture containing Na2CO3, K2CO3, and Nb2O5 were investigated in this paper. The results indicated that the single crystalline phase of (K0.5Na0.5)NbO3 was received in as-milled samples synthesiz...

Information-efficient approaches for extracting randomness from imperfect sources have been extensively studied, but simpler and faster ones are required in the high-speed applications of random number generation. In this paper, we focus on linear constructions, namely, applying linear transformation for randomness extraction. We show that linear transformations based on sparse random matrices ...

Large-scale scientific applications frequently compute sparse matrix vector products in their computational core. For this reason, techniques for computing sparse matrix vector products efficiently on modern architectures are important. This paper describes a strategy for improving the performance of sparse matrix vector product computations using a loop transformation known as unroll-and-jam. ...

The goal of this study was to investigate how alterations in extracellular matrix (ECM) biophysical properties modulate corneal keratocyte phenotypes in response to specific wound healing cytokines and Rho GTPases. Rabbit corneal keratocytes were plated within standard collagen matrices (2.5 mg/mL) or compressed collagen matrices (~100 mg/mL) and cultured in serum-free media, PDGF BB, IGF, FGF2...

Independent Components Analysis nds a linear transformation to variables which are maximally statistically independent. We examine ICA from the point of view of maximising the likelihood of the data. We elucidate how scaling of the unmixing matrix permits a \static" nonlinearity to adapt to various marginal densities and we demonstrate a new algorithm that uses generalised exponentials function...

We study the genuine multipartite entanglement in tripartite quantum systems by using principal basis matrix representations of density matrices. Using Schmidt decomposition and local unitary transformation, we first convert general states to simpler forms then construct some special matrices from correlation tensors simplified Based on different linear combinations these matrices, necessary co...

For xed matricesM and N , the linear transformation A 7! A MAN is called a displacement of the matrix A. Displacements can simplify matrix equations, as well as matrices themselves. Four principles to solve matrix equations are identi ed: 1) a variety of displacements are needed, 2) we want to recover a matrix from its displacement, 3) changing M and N is natural when A is transposed or inverte...

This paper deals with Fountain codes, and especially with their encoding matrices, which are required here to be invertible. A result is stated that an encoding matrix induces a permutation. Also, a result is that encoding matrices form a group with multiplication operation. An encoding is a transformation, which reduces the entropy of an initially high-entropy input vector. A special encoding ...