Compressive sensing in Clifford analysis

Compressed sensing is a new paradigm in signal processing which states that for certain matrices sparse representations can be obtained by a simple l1-minimization. In this thesis we explore this paradigm for higher-dimensional signal. In particular three cases are being studied: signals taking values in a bicomplex algebra, quaternionic signals, and complex signals which are representable by a nonlinear Fourier basis, a so-called Takenaka-Malmquist system.

Polinómios de Appell multidimensionais e sua representação matricial

Nesta dissertação é apresentada uma abordagem a polinómios de Appell multidimensionais dando-se especial relevância à estrutura da sua função geradora. Esta estrutura, conjugada com uma escolha adequada de ordenação dos monómios que figuram nos polinómios, confere um carácter unificador à abordagem e possibilita uma representação matricial de polinómios de Appell por meio de matrizes particionadas em blocos. Tais matrizes são construídas a partir de uma matriz de estrutura simples, designada matriz de criação, subdiagonal e cujas entradas não nulas são os sucessivos números naturais. A exponencial desta matriz é a conhecida matriz de Pascal, triangular inferior, onde figuram os números binomiais que fazem parte integrante dos coeficientes dos polinómios de Appell. Finalmente, aplica-se a abordagem apresentada a polinómios de Appell definidos no contexto da Análise de Clifford.

Numerical and combinatorial applications of generalized Appell polynomials

This thesis studies properties and applications of different generalized Appell polynomials in the framework of Clifford analysis. As an example of 3D-quasi-conformal mappings realized by generalized Appell polynomials, an analogue of the complex Joukowski transformation of order two is introduced. The consideration of a Pascal n-simplex with hypercomplex entries allows stressing the combinatorial relevance of hypercomplex Appell polynomials. The concept of totally regular variables and its relation to generalized Appell polynomials leads to the construction of new bases for the space of homogeneous holomorphic polynomials whose elements are all isomorphic to the integer powers of the complex variable. For this reason, such polynomials are called pseudo-complex powers (PCP). Different variants of them are subject of a detailed investigation. Special attention is paid to the numerical aspects of PCP. An efficient algorithm based on complex arithmetic is proposed for their implementation. In this context a brief survey on numerical methods for inverting Vandermonde matrices is presented and a modified algorithm is proposed which illustrates advantages of a special type of PCP. Finally, combinatorial applications of generalized Appell polynomials are emphasized. The explicit expression of the coefficients of a particular type of Appell polynomials and their relation to a Pascal simplex with hypercomplex entries are derived. The comparison of two types of 3D Appell polynomials leads to the detection of new trigonometric summation formulas and combinatorial identities of Riordan-Sofo type characterized by their expression in terms of central binomial coefficients.

Uma análise da tradução de marcadores culturais em Sergeant Getulio e The Lizard's smile, à luz da linguística de corpus

Pós-graduação em Estudos Linguísticos - IBILCE

Uma análise da tradução de vocábulos relacionados à violência e criminalidade presentes em três obras de Patrícia Melo

Pós-graduação em Estudos Linguísticos - IBILCE

República Federativa Evangélica: uma análise de gênero sobre a laicidade no Brasil a partir da atuação dos/as parlamentares evangélicos/as no Congresso Nacional no exercício da 54ª Legislatura São Bernardo do Campo

Essa pesquisa objetiva a análise da relação entre religião e política, em perspectiva de gênero considerando a atuação de parlamentares evangélicos/as na 54ª Legislatura (de 2011 a 2014) e a forma de intervenção desses atores no espaço político brasileiro quanto à promulgação de leis e ao desenvolvimento de políticas públicas que contemplem, dentre outras, a regulamentação do aborto, a criminalização da homofobia, a união estável entre pessoas do mesmo sexo e os desafios oriundos dessa posição para o Estado Brasileiro que se posiciona como laico. Ora, se laico remete à ideia de neutralidade estatal em matéria religiosa, legislar legitimado por determinados princípios fundamentados em doutrinas religiosas, pode sugerir a supressão da liberdade e da igualdade, o não reconhecimento da diversidade e da pluralidade e a ausência de limites entre os interesses públicos / coletivos e privados / particulares. Os procedimentos metodológicos para o desenvolvimento dessa pesquisa fundamentam-se na análise e interpretação bibliográfica visando estabelecer a relação entre religião e política, a conceituação, qualificação e tipificação do fenômeno da laicidade; levantamento documental; análise dos discursos de parlamentares evangélicos/as divulgados pela mídia, proferidos no plenário e adotados para embasar projetos de leis; pesquisa qualitativa com a realização de entrevistas e observações das posturas públicas adotadas pelos/as parlamentares integrantes da Frente Parlamentar Evangélica - FPE. Porquanto, os postulados das Ciências da Religião devidamente correlacionados com a interpretação do conjunto de dados obtidos no campo de pesquisa podem identificar o lugar do religioso na sociedade de forma interativa com as interfaces da laicidade visando aprofundar a compreensão sobre a democracia, sobre o lugar da religião nas sociedades contemporâneas e sobre os direitos difusos, coletivos e individuais das pessoas.

Desafios Para A Implementação Do Processo De Projeto Colaborativo: Análise Do Fator Humano

The ineffectiveness of current design processes has been well studied and has resulted in widespread calls for the evolution and development of new management processes. Perhaps one problem is that with the advent of BIM we are moving from one stage to another without necessarily having resolved all the issues. CAD design technology, if well handled, could have significantly raised the level of quality and efficiency of current processes, but in practice this was not fully realized. Therefore, technology alone can´t solve all the problems and the advent of BIM could result in a similar bottleneck. For a precise definition of the problem to be solved we should start by understanding what are the main current bottlenecks that have yet to be overcome by either new technologies or management processes, and the impact of human behavior related issues despite the advent of new technologies. The fragmented and dispersed nature of the AEC sector and the huge number of small organizations that comprise it would probably be a major limiting factor. Several authors have addressed this issue and more recently IDDS has been defined as the highest level of achievement. However, what is written on IDDS shows an extremely ideal situation on a state to be achieved; it shows a holistic utopian proposition with the intent to create the research agenda to move towards that state. Key to IDDS is the framing of a new management model which should address the problems associated with key aspects: technology, processes, policies and people. One of the primary areas to be further studied is the process of collaborative work and understanding, together with the development of proposals to overcome the many cultural barriers that currently exist and impede the advance of new management methods. The purpose of this paper is to define and delimit problems to be solved so that it is possible to implement a new management model for a collaborative design process.

Um Jardim na Mata dos Medos : ou da análise inventiva do pictoresco

This text discusses the project for a garden by Gonçalo Ribeiro-Telles that argues for a different possibility of creating a garden as landscape continuum and exploring picturesque as an apparatus to expand the experience of the place

High-Rate, Multisymbol-Decodable STBCs From Clifford Algebras

It is well known that space-time block codes (STBCs) obtained from orthogonal designs (ODs) are single-symbol decodable (SSD) and from quasi-orthogonal designs (QODs) are double-symbol decodable (DSD). However, there are SSD codes that are not obtainable from ODs and DSD codes that are not obtainable from QODs. In this paper, a method of constructing g-symbol decodable (g-SD) STBCs using representations of Clifford algebras are presented which when specialized to g = 1, 2 gives SSD and DSD codes, respectively. For the number of transmit antennas 2(a) the rate (in complex symbols per channel use) of the g-SD codes presented in this paper is a+1-g/2(a-9). The maximum rate of the DSD STBCs from QODs reported in the literature is a/2(a-1) which is smaller than the rate a-1/2(a-2) of the DSD codes of this paper, for 2(a) transmit antennas. In particular, the reported DSD codes for 8 and 16 transmit antennas offer rates 1 and 3/4, respectively, whereas the known STBCs from QODs offer only 3/4 and 1/2, respectively. The construction of this paper is applicable for any number of transmit antennas. The diversity sum and diversity product of the new DSD codes are studied. It is shown that the diversity sum is larger than that of all known QODs and hence the new codes perform better than the comparable QODs at low signal-to-noise ratios (SNRs) for identical spectral efficiency. Simulation results for DSD codes at variousspectral efficiencies are provided.

STBC's from representation of extended Clifford Algebras

A set of sufficient conditions to construct lambda-real symbol Maximum Likelihood (ML) decodable STBCs have recently been provided by Karmakar et al. STBCs satisfying these sufficient conditions were named as Clifford Unitary Weight (CUW) codes. In this paper, the maximal rate (as measured in complex symbols per channel use) of CUW codes for lambda = 2(a), a is an element of N is obtained using tools from representation theory. Two algebraic constructions of codes achieving this maximal rate are also provided. One of the constructions is obtained using linear representation of finite groups whereas the other construction is based on the concept of right module algebra over non-commutative rings. To the knowledge of the authors, this is the first paper in which matrices over non-commutative rings is used to construct STBCs. An algebraic explanation is provided for the 'ABBA' construction first proposed by Tirkkonen et al and the tensor product construction proposed by Karmakar et al. Furthermore, it is established that the 4 transmit antenna STBC originally proposed by Tirkkonen et al based on the ABBA construction is actually a single complex symbol ML decodable code if the design variables are permuted and signal sets of appropriate dimensions are chosen.

Minimum-Decoding-Complexity, maximum-rate Space-Time Block Codes from Clifford algebras

It is well known that Alamouti code and, in general, Space-Time Block Codes (STBCs) from complex orthogonal designs (CODs) are single-symbol decodable/symbolby-symbol decodable (SSD) and are obtainable from unitary matrix representations of Clifford algebras. However, SSD codes are obtainable from designs that are not CODs. Recently, two such classes of SSD codes have been studied: (i) Coordinate Interleaved Orthogonal Designs (CIODs) and (ii) Minimum-Decoding-Complexity (MDC) STBCs from Quasi-ODs (QODs). In this paper, we obtain SSD codes with unitary weight matrices (but not CON) from matrix representations of Clifford algebras. Moreover, we derive an upper bound on the rate of SSD codes with unitary weight matrices and show that our codes meet this bound. Also, we present conditions on the signal sets which ensure full-diversity and give expressions for the coding gain.

High-rate, Double-Symbol-Decodable STBCs from Clifford Algebras

For the number of transmit antennas N = 2(a) the maximum rate (in complex symbols per channel use) of all the Quasi-Orthogonal Designs (QODs) reported in the literature is a/2(a)-1. In this paper, we report double-symbol-decodable Space-Time Block Codes with rate a-1/2(a)-2 for N = 2(a) transmit antennas. In particular, our code for 8 and 16 transmit antennas offer rates 1 and 3/4 respectively, the known QODs offer only 3/4 and 1/2 respectively. Our construction is based on the representations of Clifford algebras and applicable for any number of transmit antennas. We study the diversity sum and diversity product of our codes. We show that our diversity sum is larger than that of all known QODs and hence our codes perform better than the comparable QODs at low SNRs for identical spectral efficiency. We provide simulation results for various spectral efficiencies.

Multigroup-Decodable STBCs from Clifford Algebras

A Space-Time Block Code (STBC) in K symbols (variables) is called g-group decodable STBC if its maximum-likelihood decoding metric can be written as a sum of g terms such that each term is a function of a subset of the K variables and each variable appears in only one term. In this paper we provide a general structure of the weight matrices of multi-group decodable codes using Clifford algebras. Without assuming that the number of variables in each group to be the same, a method of explicitly constructing the weight matrices of full-diversity, delay-optimal g-group decodable codes is presented for arbitrary number of antennas. For the special case of Nt=2a we construct two subclass of codes: (i) A class of 2a-group decodable codes with rate a2(a−1), which is, equivalently, a class of Single-Symbol Decodable codes, (ii) A class of (2a−2)-group decodable with rate (a−1)2(a−2), i.e., a class of Double-Symbol Decodable codes. Simulation results show that the DSD codes of this paper perform better than previously known Quasi-Orthogonal Designs.

A moeda como um discurso : uma análise das representações de Otávio, Cleópatra e Marco Antônio

Abstract: The present article discusses about the representation of Octavius, Mark Antony and Cleopatra in three coins, to reflect about how the ancient mintage contributed for these personages could shape their images to the populus romanus in general.

A Lei de Proteção de Cultivares : análise de sua formulação e conteúdo

Registra e analisa o processo de elaboração da Lei 9.456, de 25 de abril de 1997, que trata da proteção de cultivares, enfocando a tramitação dos projetos de lei, as polêmicas em torno do tema, os atores em ação e os argumentos técnicos, políticos e ideológicos debatidos. Analisa também as principais disposições da lei e sua interligação com o agronegócio brasileiro.