Pseudodifferential operators with C*-algebra-valued symbols: Abstract characterizations

Given a separable unital C*-algebra C with norm parallel to center dot parallel to, let E-n denote the Banach-space completion of the C-valued Schwartz space on R-n with norm parallel to f parallel to(2)=parallel to < f, f >parallel to(1/2), < f, g >=integral f(x)* g(x)dx. The assignment of the pseudodifferential operator A=a(x,D) with C-valued symbol a(x,xi) to each smooth function with bounded derivatives a is an element of B-C(R-2n) defines an injective mapping O, from B-C(R-2n) to the set H of all operators with smooth orbit under the canonical action of the Heisenberg group on the algebra of all adjointable operators on the Hilbert module E-n. In this paper, we construct a left-inverse S for O and prove that S is injective if C is commutative. This generalizes Cordes' description of H in the scalar case. Combined with previous results of the second author, our main theorem implies that, given a skew-symmetric n x n matrix J and if C is commutative, then any A is an element of H which commutes with every pseudodifferential operator with symbol F(x+J xi), F is an element of B-C(R-n), is a pseudodifferential operator with symbol G(x - J xi), for some G is an element of B-C(R-n). That was conjectured by Rieffel.

Síndrome do X Frágil com variante de Dandy-Walker: estudo clínico das manifestações comunicativas orais e escritas

A síndrome do X Frágil é a causa mais frequente de deficiência intelectual hereditária. A variante de Dandy-Walker trata-se de uma constelação específica de achados neurorradiológicos. Este estudo relata achados da comunicação oral e escrita de um menino de 15 anos com diagnóstico clínico e molecular da síndrome do X-Frágil e achados de neuroimagem do encéfalo compatíveis com variante de Dandy-Walker. A avaliação fonoaudiológica foi realizada por meio da Observação do Comportamento Comunicativo, aplicação do ABFW - Teste de Linguagem Infantil - Fonologia, Perfil de Habilidades Fonológicas, Teste de Desempenho Escolar, Teste Illinois de Habilidades Psicolinguísticas, avaliação do sistema estomatognático e avaliação audiológica. Observou-se: alteração de linguagem oral quanto às habilidades fonológicas, semânticas, pragmáticas e morfossintáticas; déficits nas habilidades psicolinguísticas (recepção auditiva, expressão verbal, combinação de sons, memória sequencial auditiva e visual, closura auditiva, associação auditiva e visual); e alterações morfológicas e funcionais do sistema estomatognático. Na leitura verificou-se dificuldades na decodificação dos símbolos gráficos e na escrita havia omissões, aglutinações e representações múltiplas com o uso predominante de vogais e dificuldades na organização viso-espacial. Em matemática, apesar do reconhecimento numérico, não realizou operações aritméticas. Não foram observadas alterações na avaliação audiológica periférica. A constelação de sintomas comportamentais, cognitivos, linguísticos e perceptivos, previstos na síndrome do X-Frágil, somada às alterações estruturais do sistema nervoso central, pertencentes à variante de Dandy-Walker, trouxeram interferências marcantes no desenvolvimento das habilidades comunicativas, no aprendizado da leitura e escrita e na integração social do indivíduo.

Arte e simbolismo xamânico na Amazônia

Os chamados ídolos de pedra amazônicos, apesar de conhecidos há mais de cem anos, constituem uma categoria de artefatos indígenas sem contexto arqueológico, histórico ou etnográfico. Este artigo apresenta uma primeira análise formal das peças conhecidas e algumas hipóteses sobre a sua função e finalidade. O estilo, os motivos simbólicos e o detalhe funcional de pares de furos idênticos em todos os exemplares sugerem que eles eram parte do instrumental usado nos rituais xamânicos de inalação do paricá e de outras substâncias alucinógenas.

Shell curvature as an initial deformation: A geometrically exact finite element approach

An alternative approach for the analysis of arbitrarily curved shells is developed in this paper based on the idea of initial deformations. By `alternative` we mean that neither differential geometry nor the concept of degeneration is invoked here to describe the shell surface. We begin with a flat reference configuration for the shell mid-surface, after which the initial (curved) geometry is mapped as a stress-free deformation from the plane position. The actual motion of the shell takes place only after this initial mapping. In contrast to classical works in the literature, this strategy enables the use of only orthogonal frames within the theory and therefore objects such as Christoffel symbols, the second fundamental form or three-dimensional degenerated solids do not enter the formulation. Furthermore, the issue of physical components of tensors does not appear. Another important aspect (but not exclusive of our scheme) is the possibility to describe exactly the initial geometry. The model is kinematically exact, encompasses finite strains in a totally consistent manner and is here discretized under the light of the finite element method (although implementation via mesh-free techniques is also possible). Assessment is made by means of several numerical simulations. Copyright (C) 2009 John Wiley & Sons, Ltd.

Stochastic stability analysis for the constant-modulus algorithm

We derive an easy-to-compute approximate bound for the range of step-sizes for which the constant-modulus algorithm (CMA) will remain stable if initialized close to a minimum of the CM cost function. Our model highlights the influence, of the signal constellation used in the transmission system: for smaller variation in the modulus of the transmitted symbols, the algorithm will be more robust, and the steady-state misadjustment will be smaller. The theoretical results are validated through several simulations, for long and short filters and channels.

A Geometric Approach for Turbo Decoding of Reed-Solomon Codes in QAM Modulation Schemes

This work studies the turbo decoding of Reed-Solomon codes in QAM modulation schemes for additive white Gaussian noise channels (AWGN) by using a geometric approach. Considering the relations between the Galois field elements of the Reed-Solomon code and the symbols combined with their geometric dispositions in the QAM constellation, a turbo decoding algorithm, based on the work of Chase and Pyndiah, is developed. Simulation results show that the performance achieved is similar to the one obtained with the pragmatic approach with binary decomposition and analysis.

Letters and cities: reading the urban environment with the help of perception theories

When wandering around a city such as Sao Paulo, we are surrounded by letters, numbers and symbols. These elements form part of an environment full of signs in many shapes and sizes that compete for our attention. Our perception of these elements contributes towards our spatial guidance and sense of place. The idea of `reading` the city, or urban environment, was introduced by Kevin Lynch, for whom reading the urban structure follows on from recognizing or identifying its numerous visual elements, not necessarily verbal ones. Beginning with a brief bibliographic review of perception theories, this article combines concepts from environmental psychology with concerns brought up by the fields of information design and epigraphy studies, setting out the basis of a methodological proposal for the study of typography and lettering in the urban environment.

Perfect Simulation of a Coupling Achieving the (d)over-bar-distance Between Ordered Pairs of Binary Chains of Infinite Order

We explicitly construct a stationary coupling attaining Ornstein`s (d) over bar -distance between ordered pairs of binary chains of infinite order. Our main tool is a representation of the transition probabilities of the coupled bivariate chain of infinite order as a countable mixture of Markov transition probabilities of increasing order. Under suitable conditions on the loss of memory of the chains, this representation implies that the coupled chain can be represented as a concatenation of i.i.d. sequences of bivariate finite random strings of symbols. The perfect simulation algorithm is based on the fact that we can identify the first regeneration point to the left of the origin almost surely.