671 resultados para Infinity
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
The subject of this research is the publicity discourse, in its configuration as speech genres, according to theoretical-methodological perspective in Bakhtinian Studies. Considering that there are infinite fields of human communication, Bakhtin says that there is also infinity of speech genres. However, according to the author, every sphere of human activity produces, and even requires, certain genres, with theirs thematic, compositional and stylistics aspects defined according to social-ideological values that materialize in that sphere and in the dialogue in which the texts are produced. The objective of this research is to study, according to this theoretical-methodological perspective, a print advertising piece by the Brazilian Federal Government, conveyed in the Língua Portuguesa magazine, with themes concerning the national public education. We analyze how the image of author is built and how the image of the Other is outlined by that author. It is assumed that the gender to which an advertising piece belongs intends to sell a product or idea. One of the specific objectives of this research is to identify what is being sold in the advertising piece that we analyze and what discursive and stylistic resources are utilized to achieve success in what it intends to promote. The results show that the author (in the voice of the Federal Government), while adopting the position of information-holder, also puts himself in the same plane of the reader, where everyone is responsible for the development of education in the country. The advertising piece intends to project a positive image of the Government, and this project of saying is realized, in the analysis, in the compositional aspects of the text as well in the stylistic aspects
Resumo:
In this paper we introduce a type of Hypercomplex Fourier Series based on Quaternions, and discuss on a Hypercomplex version of the Square of the Error Theorem. Since their discovery by Hamilton (Sinegre [1]), quaternions have provided beautifully insights either on the structure of different areas of Mathematics or in the connections of Mathematics with other fields. For instance: I) Pauli spin matrices used in Physics can be easily explained through quaternions analysis (Lan [2]); II) Fundamental theorem of Algebra (Eilenberg [3]), which asserts that the polynomial analysis in quaternions maps into itself the four dimensional sphere of all real quaternions, with the point infinity added, and the degree of this map is n. Motivated on earlier works by two of us on Power Series (Pendeza et al. [4]), and in a recent paper on Liouville’s Theorem (Borges and Mar˜o [5]), we obtain an Hypercomplex version of the Fourier Series, which hopefully can be used for the treatment of hypergeometric partial differential equations such as the dumped harmonic oscillation.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
A simple description of the KP hierarchy and its multi-hamiltonian structure is given in terms of two Bose currents. A deformation scheme connecting various W-infinity algebras and the relation between two fundamental nonlinear structures are discussed. Properties of Faá di Bruno polynomials are extensively explored in this construction. Applications of our method are given for the Conformal Affine Toda model, WZNW models and discrete KP approach to Toda lattice chain.
Resumo:
It is shown that the two-loop Kac-Moody algebra is equivalent to a two-variable-loop algebra and a decoupled β-γ system. Similarly WZNW and CSW models having as algebraic structure the Kac-Moody algebra are equivalent to an infinity of versions of the corresponding ordinary models and decoupled abelian fields.
Resumo:
Using the pure spinor formalism, a quantizable sigma model has been constructed for the superstring in an AdS(5) X S-5 background with manifest PSU(2,2 vertical bar 4) invariance. The PSU(2,2 vertical bar 4) metric g(AB) has both vector components gab and spinor components g, 3, and in the limit where the spinor components g, 3 are taken to infinity, the AdS5 X S5 sigma model reduces to the worldsheet action in a flat background. In this paper, we instead consider the limit where the vector components g(ab) are taken to infinity. In this limit, the AdS5 X S5 sigma model simplifies to a topological A-model constructed from fermionic N=2 superfields whose bosonic components transform like twistor variables. Just as d=3 Chern-Simons theory can be described by the open string sector of a topological A-model, the open string sector of this topological A-model describes d=4 N=4 super-Yang-Mills. These results might be useful for constructing a worldsheet proof of the Maldacena conjecture analogous to the Gopakumar-Vafa-Ooguri worldsheet proof of Chern-Simons/conifold duality.
Resumo:
This research aims to elucidate some of the historical aspects of the idea of infinity during the creation of calculus and set theory. It also seeks to raise discussions about the nature of infinity: current infinite and potential infinite. For this, we conducted a survey with a qualitative approach in the form of exploratory study. This study was based on books of Mathematics' History and other scientific works such as articles, theses and dissertations on the subject. This work will bring the view of some philosophers and thinkers about the infinite, such as: Pythagoras, Plato, Aristotle, Galilei, Augustine, Cantor. The research will be presented according to chronological order. The objective of the research is to understand the infinite from ancient Greece with the paradoxes of Zeno, during the time which the conflict between the conceptions atomistic and continuity were dominant, and in this context that Zeno launches its paradoxes which contradict much a concept as another, until the theory Cantor set, bringing some paradoxes related to this theory, namely paradox of Russell and Hilbert's paradox. The study also presents these paradoxes mentioned under the mathematical point of view and the light of calculus and set theory
Resumo:
Este artigo tem por objetivo discutir o conceito de subjetividade em sua relação com a alteridade em educação, com base no pensamento filosófico de Emanuel Levinas. Inicialmente, apresenta a discussão da subjetividade na filosofia moderna e sua forma de concebê-la como ideal de sujeito livre e soberano. Em seguida, desenvolve uma análise crítica que problematiza a pretensa soberania do sujeito e reconstrói uma nova subjetividade ética, situada na condição de refém, capaz de acolher a irredutível alteridade do Outro enquanto ideia do infinito. No contexto de reconstrução da subjetividade, o estudo estabelece aproximações com o campo da educação, destacando a experiência educativa como um acontecimento ético por excelência.
Resumo:
Maximum-likelihood decoding is often the optimal decoding rule one can use, but it is very costly to implement in a general setting. Much effort has therefore been dedicated to find efficient decoding algorithms that either achieve or approximate the error-correcting performance of the maximum-likelihood decoder. This dissertation examines two approaches to this problem. In 2003 Feldman and his collaborators defined the linear programming decoder, which operates by solving a linear programming relaxation of the maximum-likelihood decoding problem. As with many modern decoding algorithms, is possible for the linear programming decoder to output vectors that do not correspond to codewords; such vectors are known as pseudocodewords. In this work, we completely classify the set of linear programming pseudocodewords for the family of cycle codes. For the case of the binary symmetric channel, another approximation of maximum-likelihood decoding was introduced by Omura in 1972. This decoder employs an iterative algorithm whose behavior closely mimics that of the simplex algorithm. We generalize Omura's decoder to operate on any binary-input memoryless channel, thus obtaining a soft-decision decoding algorithm. Further, we prove that the probability of the generalized algorithm returning the maximum-likelihood codeword approaches 1 as the number of iterations goes to infinity.