A comparative study between two relaxed LMI-based fuzzy control designs

A comparative study, with theoretical analysis and digital simulations, of two conditions based on LMI for the quadratic stability of nonlinear continuous-time dynamic systems, described by Takagi-Sugeno fuzzy models, are presented. This paper shows that the methods proposed by Teixeira et. al. in 2003 provide better or at least the same results of a recent method presented in the literature. © 2005 IEEE.

A procedure to estimate parameters of a line segment taking into account its representation through π circuits: Theoretical development

The objective of this paper is to show an alternative methodology to estimate per unit length parameters of a line segment of a transmission line. With this methodology the line segment parameters can be obtained starting from the phase currents and voltages in receiving and sending end of the line segment. If the line segment is represented as being one or more π circuits whose frequency dependent parameters are considered lumped, its impedance and admittance can be easily expressed as functions of the currents and voltages at the sending and receiving end. Because we are supposing that voltages and currents at the sending and receiving end of the line segment (in frequency domain) are known, it is possible to obtains its impedance and admittance and consequently its per unit length longitudinal and transversal parameters. The procedure will be applied to estimate the longitudinal and transversal parameters of a small segment of a single-phase line that is already built. © 2006 IEEE.

Design of SPR systems with dynamic compensators and output variable structure control

This paper presents necessary and sufficient conditions for the following problem: given a linear time invariant plant G(s) = N(s)D(s)-1 = C(sI - A]-1B, with m inputs, p outputs, p > m, rank(C) = p, rank(B) = rank(CB) = m, £nd a tandem dynamic controller Gc(s) = D c(s)-1Nc(s) = Cc(sI - A c)-1Bc + Dc, with p inputs and m outputs and a constant output feedback matrix Ko ε ℝm×p such that the feedback system is Strictly Positive Real (SPR). It is shown that this problem has solution if and only if all transmission zeros of the plant have negative real parts. When there exists solution, the proposed method firstly obtains Gc(s) in order to all transmission zeros of Gc(s)G(s) present negative real parts and then Ko is found as the solution of some Linear Matrix Inequalities (LMIs). Then, taking into account this result, a new LMI based design for output Variable Structure Control (VSC) of uncertain dynamic plants is presented. The method can consider the following design specifications: matched disturbances or nonlinearities of the plant, output constraints, decay rate and matched and nonmatched plant uncertainties. © 2006 IEEE.

Comparative study of LMI-based output feedback spr synthesis for plants with different numbers of inputs and outputs

New Linear Matrix Inequalities (LMI) conditions are proposed for the following problem, called Strictly Positive Real (SPR) synthesis: given a linear time-invariant plant, find a constant output feedback matrix Ko and a constant output tandem matrix F for the controlled system to be SPR. It is assumed that the plant has the number of outputs greater than the number of inputs. Some sufficient conditions for the solution of the problem are presented and compared. These results can be directly applied in the LMI-based design of Variable Structure Control (VSC) of uncertain plants. ©2008 IEEE.

Perturbations on the antidiagonals of Hankel matrices

Given a strongly regular Hankel matrix, and its associated sequence of moments which defines a quasi-definite moment linear functional, we study the perturbation of a fixed moment, i.e., a perturbation of one antidiagonal of the Hankel matrix. We define a linear functional whose action results in such a perturbation and establish necessary and sufficient conditions in order to preserve the quasi-definite character. A relation between the corresponding sequences of orthogonal polynomials is obtained, as well as the asymptotic behavior of their zeros. We also study the invariance of the Laguerre-Hahn class of linear functionals under such perturbation, and determine its relation with the so-called canonical linear spectral transformations. © 2013 Elsevier Ltd. All rights reserved.

Ordered phases in the extended Hubbard model

A novel method to probe the diverse phases for the extended Hubbard model (EHM), including the correlated hopping term, is presented. We extend an effective medium approach [1] to a bipartite lattice, allowing for charge- and/or spin-ordered phases. We calculate the necessary correlation functions to build the EHM phase diagram.

Pathway Semantics: An Algebraic Data Driven Algorithm to Generate Hypotheses about Molecular Patterns Underlying Disease Progression

The overarching goal of the Pathway Semantics Algorithm (PSA) is to improve the in silico identification of clinically useful hypotheses about molecular patterns in disease progression. By framing biomedical questions within a variety of matrix representations, PSA has the flexibility to analyze combined quantitative and qualitative data over a wide range of stratifications. The resulting hypothetical answers can then move to in vitro and in vivo verification, research assay optimization, clinical validation, and commercialization. Herein PSA is shown to generate novel hypotheses about the significant biological pathways in two disease domains: shock / trauma and hemophilia A, and validated experimentally in the latter. The PSA matrix algebra approach identified differential molecular patterns in biological networks over time and outcome that would not be easily found through direct assays, literature or database searches. In this dissertation, Chapter 1 provides a broad overview of the background and motivation for the study, followed by Chapter 2 with a literature review of relevant computational methods. Chapters 3 and 4 describe PSA for node and edge analysis respectively, and apply the method to disease progression in shock / trauma. Chapter 5 demonstrates the application of PSA to hemophilia A and the validation with experimental results. The work is summarized in Chapter 6, followed by extensive references and an Appendix with additional material.

Análise de acetona em ar exalado: desenvolvimento de método eletroanalítico e algoritmo para processamento de sinais

Propõe-se método novo e completo para análise de acetona em ar exalado envolvendo coleta com pré-concentração em água, derivatização química e determinação eletroquímica assistida por novo algoritmo de processamento de sinais. Na literatura recente a acetona expirada vem sendo avaliada como biomarcador para monitoramento não invasivo de quadros clínicos como diabetes e insuficiência cardíaca, daí a importância da proposta. Entre as aminas que reagem com acetona para formar iminas eletroativas, estudadas por polarografia em meados do século passado, a glicina apresentou melhor conjunto de características para a definição do método de determinação por voltametria de onda quadrada sem a necessidade de remoção de oxigênio (25 Hz, amplitude de 20 mV, incremento de 5 mV, eletrodo de gota de mercúrio). O meio reacional, composto de glicina (2 mol·L-1) em meio NaOH (1 mol·L-1), serviu também de eletrólito e o pico de redução da imina em -1,57 V vs. Ag|AgCl constituiu o sinal analítico. Para tratamento dos sinais, foi desenvolvido e avaliado um algoritmo inovador baseado em interpolação de linha base por ajuste de curvas de Bézier e ajuste de gaussiana ao pico. Essa combinação permitiu reconhecimento e quantificação de picos relativamente baixos e largos sobre linha com curvatura acentuada e ruído, situação em que métodos convencionais falham e curvas do tipo spline se mostraram menos apropriadas. A implementação do algoritmo (disponível em http://github.com/batistagl/chemapps) foi realizada utilizando programa open source de álgebra matricial integrado diretamente com software de controle do potenciostato. Para demonstrar a generalidade da extensão dos recursos nativos do equipamento mediante integração com programação externa em linguagem Octave (open source), implementou-se a técnica da cronocoulometria tridimensional, com visualização de resultados já tratados em projeções de malha de perspectiva 3D sob qualquer ângulo. A determinação eletroquímica de acetona em fase aquosa, assistida pelo algoritmo baseado em curvas de Bézier, é rápida e automática, tem limite de detecção de 3,5·10-6 mol·L-1 (0,2 mg·L-1) e faixa linear que atende aos requisitos da análise em ar exalado. O acetaldeído, comumente presente em ar exalado, em especial, após consumo de bebidas alcoólicas, dá origem a pico voltamétrico em -1,40 V, contornando interferência que prejudica vários outros métodos publicados na literatura e abrindo possibilidade de determinação simultânea. Resultados obtidos com amostras reais são concordantes com os obtidos por método espectrofotométrico, em uso rotineiro desde o seu aperfeiçoamento na dissertação de mestrado do autor desta tese. Em relação à dissertação, também se otimizou a geometria do dispositivo de coleta, de modo a concentrar a acetona num volume menor de água gelada e prover maior conforto ao paciente. O método completo apresentado, englobando o dispositivo de amostragem aperfeiçoado e o novo e efetivo algoritmo para tratamento automático de sinais voltamétricos, está pronto para ser aplicado. Evolução para um analisador portátil depende de melhorias no limite de detecção e facilidade de obtenção eletrodos sólidos (impressos) com filme de mercúrio, vez que eletrodos de bismuto ou diamante dopado com boro, entre outros, não apresentaram resposta.

Braided m-Lie algebras

Braided m-Lie algebras induced by multiplication are introduced, which generalize Lie algebras, Lie color algebras and quantum Lie algebras. The necessary and sufficient conditions for the braided m-Lie algebras to be strict Jacobi braided Lie algebras are given. Two classes of braided m-Lie algebras are given, which are generalized matrix braided m-Lie algebras and braided m-Lie subalgebras of End(F)M, where M is a Yetter-Drinfeld module over B with dimB < infinity. In particular, generalized classical braided m-Lie algebras sl(q,f)(GM(G)(A),F) and osp(q,l)(GM(G)(A),M,F) of generalized matrix algebra GMG(A) are constructed and their connection with special generalized matrix Lie superalgebra sl(s,f)(GM(Z2)(A(s)),F) and orthosymplectic generalized matrix Lie super algebra osp(s,l) (GM(Z2)(A(s)),M-s,F) are established. The relationship between representations of braided m-Lie algebras and their associated algebras are established.

Comment on "Grover search with pairs of trapped ions"

In this Comment on Feng's paper [Phys. Rev. A 63, 052308 (2001)], we show that Grover's algorithm may be performed exactly using the gate set given, provided that small changes are made to the gate sequence. An analytic expression for the probability of success of Grover's algorithm for any unitary operator U instead of Hadamard gate is presented.

Modelling of induction motors for system faults and transient stability studies

The research carried out in this thesis was mainly concerned with the effects of large induction motors and their transient performance in power systems. Computer packages using the three phase co-ordinate frame of reference were developed to simulate the induction motor transient performance. A technique using matrix algebra was developed to allow extension of the three phase co-ordinate method to analyse asymmetrical and symmetrical faults on both sides of the three phase delta-star transformer which is usually required when connecting large induction motors to the supply system. System simulation, applying these two techniques, was used to study the transient stability of a power system. The response of a typical system, loaded with a group of large induction motors, two three-phase delta-star transformers, a synchronous generator and an infinite system was analysed. The computer software developed to study this system has the advantage that different types of fault at different locations can be studied by simple changes in input data. The research also involved investigating the possibility of using different integrating routines such as Runge-Kutta-Gill, RungeKutta-Fehlberg and the Predictor-Corrector methods. The investigation enables the reduction of computation time, which is necessary when solving the induction motor equations expressed in terms of the three phase variables. The outcome of this investigation was utilised in analysing an introductory model (containing only minimal control action) of an isolated system having a significant induction motor load compared to the size of the generator energising the system.

A Basis for Z-Graded Identities of Matrices over Infinite Fields

2000 Mathematics Subject Classification: 16R10, 16R20, 16R50

RcppArmadillo : accelerating R with high-performance C++ linear algebra

The R statistical environment and language has demonstrated particular strengths for interactive development of statistical algorithms, as well as data modelling and visualisation. Its current implementation has an interpreter at its core which may result in a performance penalty in comparison to directly executing user algorithms in the native machine code of the host CPU. In contrast, the C++ language has no built-in visualisation capabilities, handling of linear algebra or even basic statistical algorithms; however, user programs are converted to high-performance machine code, ahead of execution. A new method avoids possible speed penalties in R by using the Rcpp extension package in conjunction with the Armadillo C++ matrix library. In addition to the inherent performance advantages of compiled code, Armadillo provides an easy-to-use template-based meta-programming framework, allowing the automatic pooling of several linear algebra operations into one, which in turn can lead to further speedups. With the aid of Rcpp and Armadillo, conversion of linear algebra centered algorithms from R to C++ becomes straightforward. The algorithms retains the overall structure as well as readability, all while maintaining a bidirectional link with the host R environment. Empirical timing comparisons of R and C++ implementations of a Kalman filtering algorithm indicate a speedup of several orders of magnitude.

Matrix Decomposition Methods for Data Mining : Computational Complexity and Algorithms

Matrix decompositions, where a given matrix is represented as a product of two other matrices, are regularly used in data mining. Most matrix decompositions have their roots in linear algebra, but the needs of data mining are not always those of linear algebra. In data mining one needs to have results that are interpretable -- and what is considered interpretable in data mining can be very different to what is considered interpretable in linear algebra. --- The purpose of this thesis is to study matrix decompositions that directly address the issue of interpretability. An example is a decomposition of binary matrices where the factor matrices are assumed to be binary and the matrix multiplication is Boolean. The restriction to binary factor matrices increases interpretability -- factor matrices are of the same type as the original matrix -- and allows the use of Boolean matrix multiplication, which is often more intuitive than normal matrix multiplication with binary matrices. Also several other decomposition methods are described, and the computational complexity of computing them is studied together with the hardness of approximating the related optimization problems. Based on these studies, algorithms for constructing the decompositions are proposed. Constructing the decompositions turns out to be computationally hard, and the proposed algorithms are mostly based on various heuristics. Nevertheless, the algorithms are shown to be capable of finding good results in empirical experiments conducted with both synthetic and real-world data.

The Gaussian Toeplitz matrix

An analytical expression for the LL(T) decomposition for the Gaussian Toeplitz matrix with elements T(ij) = [1/(2-pi)1/2-sigma] exp[-(i - j)2/2-sigma-2] is derived. An exact expression for the determinant and bounds on the eigenvalues follows. An analytical expression for the inverse T-1 is also derived.