Automatic construction of explicit R matrices for the one-parameter families of irreducible typical highest weight (0(m)vertical bar alpha(n)) representations of U-q[gl(m vertical bar n)]

We detail the automatic construction of R matrices corresponding to (the tensor products of) the (O-m\alpha(n)) families of highest-weight representations of the quantum superalgebras Uq[gl(m\n)]. These representations are irreducible, contain a free complex parameter a, and are 2(mn)-dimensional. Our R matrices are actually (sparse) rank 4 tensors, containing a total of 2(4mn) components, each of which is in general an algebraic expression in the two complex variables q and a. Although the constructions are straightforward, we describe them in full here, to fill a perceived gap in the literature. As the algorithms are generally impracticable for manual calculation, we have implemented the entire process in MATHEMATICA; illustrating our results with U-q [gl(3\1)]. (C) 2002 Published by Elsevier Science B.V.

The usefulness of ultrasound in the classification of chronic liver disease

Chronic Liver Disease is a progressive, most of the time asymptomatic, and potentially fatal disease. In this paper, a semi-automatic procedure to stage this disease is proposed based on ultrasound liver images, clinical and laboratorial data. In the core of the algorithm two classifiers are used: a k nearest neighbor and a Support Vector Machine, with different kernels. The classifiers were trained with the proposed multi-modal feature set and the results obtained were compared with the laboratorial and clinical feature set. The results showed that using ultrasound based features, in association with laboratorial and clinical features, improve the classification accuracy. The support vector machine, polynomial kernel, outperformed the others classifiers in every class studied. For the Normal class we achieved 100% accuracy, for the chronic hepatitis with cirrhosis 73.08%, for compensated cirrhosis 59.26% and for decompensated cirrhosis 91.67%.

Texture zeros and weak basis transformations

We investigate the physical meaning of some of the "texture zeros" which appear in most of the Ansatze on quark masses and mixings. It is shown that starting from arbitrary quark mass matrices and making a suitable weak basis transformation one can obtain some of these sets of zeros which therefore have no physical content. We then analyse the physical implications of a four-texture zero Ansatz which is in agreement with all present experimental data. (C) 2000 Elsevier Science B.V. AU rights reserved.

Root-locus practical sketching rules for fractional-order system

For integer-order systems, there are well-known practical rules for RL sketching. Nevertheless, these rules cannot be directly applied to fractional-order (FO) systems. Besides, the existing literature on this topic is scarce and exclusively focused on commensurate systems, usually expressed as the ratio of two noninteger polynomials. The practical rules derived for those do not apply to other symbolic expressions, namely, to transfer functions expressed as the ratio of FO zeros and poles. However, this is an important case as it is an extension of the classical integer-order problem usually addressed by control engineers. Extending the RL practical sketching rules to such FO systems will contribute to decrease the lack of intuition about the corresponding system dynamics. This paper generalises several RL practical sketching rules to transfer functions specified as the ratio of FO zeros and poles. The subject is presented in a didactic perspective, being the rules applied to several examples.

On a generalized Laguerre operational matrix of fractional integration

A new operationalmatrix of fractional integration of arbitrary order for generalized Laguerre polynomials is derived.The fractional integration is described in the Riemann-Liouville sense.This operational matrix is applied together with generalized Laguerre tau method for solving general linearmultitermfractional differential equations (FDEs).Themethod has the advantage of obtaining the solution in terms of the generalized Laguerre parameter. In addition, only a small dimension of generalized Laguerre operational matrix is needed to obtain a satisfactory result. Illustrative examples reveal that the proposedmethod is very effective and convenient for linear multiterm FDEs on a semi-infinite interval.

Abelian realization of phenomenological two-zero neutrino textures

In an attempt at explaining the observed neutrino mass-squared differences and leptonic mixing, lepton mass matrices with zero textures have been widely studied. In the weak basis where the charged lepton mass matrix is diagonal, various neutrino mass matrices with two zeros have been shown to be consistent with the current experimental data. Using the canonical and Smith normal form methods, we construct the minimal Abelian symmetry realizations of these phenomenological two-zero neutrino textures. The implementation of these symmetries in the context of the seesaw mechanism for Majorana neutrino masses is also discussed. (C) 2014 The Authors. Published by Elsevier B.V.

Spectral and weak polynomial completeness for the porduct of nonsingular matrices

Let F be a field with at least four elements. In this paper, we identify all the pairs (A, B) of n x n nonsingular matrices over F , satisfying the following property: for every monic polynomial f(x) = xn + an-1xn-1 + … +a1x + aο over F, with a root in F and aο = (-1)n det(AB), there are nonsingular matrices X, Y ϵ Fnxn such that X A X-1 Y BY-1 has characteristic polynomial f (x). © 2014 © 2014 Taylor & Francis.

Confronting predictive texture zeros in lepton mass matrices with current data

Several popular Ansatze of lepton mass matrices that contain texture zeros are confronted with current neutrino observational data. We perform a systematic chi(2) analysis in a wide class of schemes, considering arbitrary Hermitian charged-lepton mass matrices and symmetric mass matrices for Majorana neutrinos or Hermitian mass matrices for Dirac neutrinos. Our study reveals that several patterns are still consistent with all the observations at the 68.27% confidence level, while some others are disfavored or excluded by the experimental data. The well-known Frampton-Glashow-Marfatia two-zero textures, hybrid textures, and parallel structures (among others) are considered.

Spectral and weak polynomial completeness for the product of nonsingular matrices

Let F be a field with at least four elements. In this paper, we identify all the pairs (A, B) of n x n nonsingular matrices over F, satisfying the following property: for every monic polynomial f (x) = x(n) + a(n-1)x(n-1) +... + a(1)x + a(0) over F, with a root in F and a(0) = (-1)(n) det(AB), there are nonsingular matrices X, Y is an element of F-nxn such that XAX(-1)Y BY-1 has characteristic polynomial f (x).

Time-domain optimization of amplifiers based on distributed genetic algorithms

Thesis presented in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the subject of Electrical and Computer Engineering

Weakly spectrally complete pair of matrices

Let and be matrices over an algebraically closed field. Let be elements of such that and . We give necessary and sufficient condition for the existence of matrices and similar to and, respectively, such that has eigenvalues.

A Review of Operational Matrices and Spectral Techniques for Fractional Calculus

Recently, operational matrices were adapted for solving several kinds of fractional differential equations (FDEs). The use of numerical techniques in conjunction with operational matrices of some orthogonal polynomials, for the solution of FDEs on finite and infinite intervals, produced highly accurate solutions for such equations. This article discusses spectral techniques based on operational matrices of fractional derivatives and integrals for solving several kinds of linear and nonlinear FDEs. More precisely, we present the operational matrices of fractional derivatives and integrals, for several polynomials on bounded domains, such as the Legendre, Chebyshev, Jacobi and Bernstein polynomials, and we use them with different spectral techniques for solving the aforementioned equations on bounded domains. The operational matrices of fractional derivatives and integrals are also presented for orthogonal Laguerre and modified generalized Laguerre polynomials, and their use with numerical techniques for solving FDEs on a semi-infinite interval is discussed. Several examples are presented to illustrate the numerical and theoretical properties of various spectral techniques for solving FDEs on finite and semi-infinite intervals.

Study of forbidden transitions in atomic systems

A Thesis submitted for the co-tutelle degree of Doctor in Physics at Universidade Nova de Lisboa and Université Pierre et Marie Curie

Under the veil of citations

Academics are often ranked on citation counts’, which is considered an adequate proxy for author's quality and reputation. This paper seeks to find what is behind a cited academic / a cited article. We constructed a rich dataset from Portuguese affiliated economists and use zero inflated negative binomial model. This procedure is appropriate for count outcomes, correcting for overdispersion and excess zeros. We also use a fixed effect poisson model to accomodate authors' unobserved heterogeneity. We analyze results in detail comparing with existing literature and making some theoretical considerations around.

Comparison of different numerical methods for the solution of the time-fractional reaction-diffusion equation with variable diffusion coefficient

In this work we perform a comparison of two different numerical schemes for the solution of the time-fractional diffusion equation with variable diffusion coefficient and a nonlinear source term. The two methods are the implicit numerical scheme presented in [M.L. Morgado, M. Rebelo, Numerical approximation of distributed order reaction- diffusion equations, Journal of Computational and Applied Mathematics 275 (2015) 216-227] that is adapted to our type of equation, and a colocation method where Chebyshev polynomials are used to reduce the fractional differential equation to a system of ordinary differential equations