Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2014-09-22T11:18:05Z No. of bitstreams: 2 Queiroz, Cleber da Costa.pdf: 1949775 bytes, checksum: fb4f5a0a7954a1b830a3614a3d55d110 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2014-09-22T11:29:10Z (GMT) No. of bitstreams: 2 Queiroz, Cleber da Costa.pdf: 1949775 bytes, checksum: fb4f5a0a7954a1b830a3614a3d55d110 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Made available in DSpace on 2014-09-22T11:29:10Z (GMT). No. of bitstreams: 2 Queiroz, Cleber da Costa.pdf: 1949775 bytes, checksum: fb4f5a0a7954a1b830a3614a3d55d110 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2013-03-22 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / This paper aims to study the algebric methods to solve polynomial equations, with a deeper study about 3rd grade polynomial equations. It firstly broaches the historical aspects about polynomial functions by mentioning some mathematicians who collaborated to the obtainment of these resolutive methods. One chapter is designated to the study of complexes numbers and polynomial that have a great importance to theme development. The objective was not to deepen in the study of complexes numbers and polynomial, but to put in relief the definitions, properties and theorems that are considerable to the paper base, once that a polynomial equation has at least a complex root (Fundamental Theorem of Algebra) and that we always use the knowledge about the polynomial equations. By the end, resolutive methods for polynomial equations until 4rd grade are presented, emphasizing Cardano’s Formule and the algebric method for the 4rd grade equation, besides making a study about the relation between the coefficient and the roots of the 3rd grade equation, analysis of 3rd grade equation roots and the study of the 3rd grade function’s graphic. / Este trabalho tem por objetivo estudar os métodos algébricos para resolução das equações polinomiais onde destinamos um estudo mais aprofundado para as equações polinomiais do 3o grau. Inicialmente fazemos uma abordagem dos aspectos históricos relacionados às funções polinomiais citando alguns dos matemáticos que colaboraram para obtenção desses métodos resolutivos. Destinamos um capítulo ao estudo dos números complexos e polinômios, os quais são de fundamental importância para o desenvolvimento do tema. Nosso objetivo não foi de aprofundar o estudo de números complexos e polinômios, mas sim destacar as definições, propriedades e teoremas mais relevantes para a fundamentação do trabalho, visto que uma equação polinomial possui pelo menos uma raiz complexa (Teorema Fundamental da Álgebra) e que sempre utilizamos os conhecimentos a respeito das equações polinomiais. Por fim, mostramos métodos resolutivos para equações polinomiais até o grau 4, destacando a Fórmula de Cardano e o método algébrico para equação do 4o grau, além de fazer um estudo sobre a relação entre os coeficientes e as raízes da equação do 3o grau, análise das raízes da equação do 3o grau e estudo sobre o gráfico da função do 3o grau.

The primary objective of this study is to develop new computational methods for solving a general random eigenvalue problem (REP) commonly encountered in modeling and simulation of high-dimensional, complex dynamic systems. Four major research directions, all anchored in polynomial dimensional decomposition (PDD), have been defined to meet the objective. They involve: (1) a rigorous comparison of accuracy, efficiency, and convergence properties of the polynomial chaos expansion (PCE) and PDD methods; (2) development of two novel multiplicative PDD methods for addressing multiplicative structures in REPs; (3) development of a new hybrid PDD method to account for the combined effects of the multiplicative and additive structures in REPs; and (4) development of adaptive and sparse algorithms in conjunction with the PDD methods. The major findings are as follows. First, a rigorous comparison of the PCE and PDD methods indicates that the infinite series from the two expansions are equivalent but their truncations endow contrasting dimensional structures, creating significant difference between the two approximations. When the cooperative effects of input variables on an eigenvalue attenuate rapidly or vanish altogether, the PDD approximation commits smaller error than does the PCE approximation for identical expansion orders. Numerical analysis reveal higher convergence rates and significantly higher efficiency of the PDD approximation than the PCE approximation. Second, two novel multiplicative PDD methods, factorized PDD and logarithmic PDD, were developed to exploit the hidden multiplicative structure of an REP, if it exists. Since a multiplicative PDD recycles the same component functions of the additive PDD, no additional cost is incurred. Numerical results show that indeed both the multiplicative PDD methods are capable of effectively utilizing the multiplicative structure of a random response. Third, a new hybrid PDD method was constructed for uncertainty quantification of high-dimensional complex systems. The method is based on a linear combination of an additive and a multiplicative PDD approximation. Numerical results indicate that the univariate hybrid PDD method, which is slightly more expensive than the univariate additive or multiplicative PDD approximations, yields more accurate stochastic solutions than the latter two methods. Last, two novel adaptive-sparse PDD methods were developed that entail global sensitivity analysis for defining the relevant pruning criteria. Compared with the past developments, the adaptive-sparse PDD methods do not require its truncation parameter(s) to be assigned a priori or arbitrarily. Numerical results reveal that an adaptive-sparse PDD method achieves a desired level of accuracy with considerably fewer coefficients compared with existing PDD approximations.

An important advantage of Elliptic Curve Cryptosystem (ECC) is the shorter key length in public key cryptographic systems. It can provide adequate security when the bit length over than 160 bits. Therefore, it has become a popular system in recent years. Scalar multiplication also called point multiplication is the core operation in ECC. In this thesis, we propose the ECC architectures of two different irreducible polynomial versions that are trinomial in GF(2167) and pentanomial in GF(2163). These architectures are based on Montgomery point multiplication with projective coordinate. We use polynomial basis representation for finite field arithmetic. All adopted multiplication, square and add operations over binary field can be completed within one clock cycle, and the critical path lies on multiplication. In addition, we use Itoh-Tsujii algorithm combined with addition chain, to execute binary inversion through using iterative binary square and multiplication. Because the double and add operations in point multiplication need to run many iterations, the execution time in overall design will be decreased if we can improve this partition. We propose two ways to improve the performance of point multiplication. The first way is Minus Cycle Version. In this version, we reschedule the double and add operations according to point multiplication algorithm. When the clock cycle time (i.e., critical path) of multiplication is longer than that of add and square, this method will be useful in improving performance. The second way is Pipeline Version. It speeds up the multiplication operations by executing them in pipeline, leading to shorter clock cycle time. For the hardware implementation, TSMC 0.13um library is employed and all modules are organized in a hierarchy structure. The implementation result shows that the proposed 167-bit Minus Cycle Version requires 156.4K gates, and the execution time of point multiplication is 2.34us and the maximum speed is 591.7Mhz. Moreover, we compare the Area x Time (AT) value of proposed architectures with other relative work. The results exhibit that proposed 167-bit Minus Cycle Version is the best one and it can save up to 38% A T value than traditional one.

Weighted polynomial regression of degree d with weight function Exp(£\ x) on an interval is considered. The D-optimal designs £i_d^* are completely characterized via three differential equations. Some invariant properties of £i_d^* under affine transformation are derived. The design £i_d^* as d goes to 1, is shown to converge weakly to the arcsin distribution. Comparisons of £i_d^* with the arcsin distribution are also made.

We propose novel methods to utilize orthogonal polynomial approximation in higher dimension spaces, which enable us to modify classical differential equation solvers to perform high precision, long-term orbit propagation. These methods have immediate application to efficient propagation of catalogs of Resident Space Objects (RSOs) and improved accounting for the uncertainty in the ephemeris of these objects. More fundamentally, the methodology promises to be of broad utility in solving initial and two point boundary value problems from a wide class of mathematical representations of problems arising in engineering, optimal control, physical sciences and applied mathematics. We unify and extend classical results from function approximation theory and consider their utility in astrodynamics. Least square approximation, using the classical Chebyshev polynomials as basis functions, is reviewed for discrete samples of the to-be-approximated function. We extend the orthogonal approximation ideas to n-dimensions in a novel way, through the use of array algebra and Kronecker operations. Approximation of test functions illustrates the resulting algorithms and provides insight into the errors of approximation, as well as the associated errors arising when the approximations are differentiated or integrated. Two sets of applications are considered that are challenges in astrodynamics. The first application addresses local approximation of high degree and order geopotential models, replacing the global spherical harmonic series by a family of locally precise orthogonal polynomial approximations for efficient computation. A method is introduced which adapts the approximation degree radially, compatible with the truth that the highest degree approximations (to ensure maximum acceleration error < 10^−9ms^−2, globally) are required near the Earths surface, whereas lower degree approximations are required as radius increases. We show that a four order of magnitude speedup is feasible, with both speed and storage efficiency op- timized using radial adaptation. The second class of problems addressed includes orbit propagation and solution of associated boundary value problems. The successive Chebyshev-Picard path approximation method is shown well-suited to solving these problems with over an order of magnitude speedup relative to known methods. Furthermore, the approach is parallel-structured so that it is suited for parallel implementation and further speedups. Used in conjunction with orthogonal Finite Element Model (FEM) gravity approximations, the Chebyshev-Picard path approximation enables truly revolutionary speedups in orbit propagation without accuracy loss.

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / This dissertation aims to propose a new approach in teaching polynomials. As this subject is worked in the last year of high school, we offer a proposal focused on higher education, but in an investigative and intuitive way while emphasizing the definitions and theorems. In the first chapter we will make a historical overview about the study of polynomials, highlighting the most important facts and their researchers, as well as their relevance. In the second chapter we will deal with the way the subject is approached in schools and books currently in high school in Brazil, emphasizing the important aspects that we think should be revised. A new proposal for the study of polynomials is presented in the third chapter. We conclude with the fourth chapter where we report the partial application of this proposal in a class of third year of the technical computer course in IFRS - Câmpus Ibirubá. / O presente trabalho de dissertação tem como objetivo propor uma nova forma de abordagem no ensino de polinômios. Como este assunto é trabalhado no último ano do Ensino Médio, oferecemos uma proposta focada no Ensino Superior, porém de uma forma investigativa e intuitiva sem deixar de dar ênfase às definições e teoremas. No primeiro capítulo faremos um apanhado histórico sobre o estudo dos polinômios destacando os principais fatos e seus estudiosos, bem como sua relevância. No segundo capítulo trataremos sobre a forma que o assunto é abordado atualmente nas escolas e livros de Ensino Médio do Brasil, salientando os aspectos que consideramos importantes que sejam revistos. Uma nova proposta de trabalho de estudo de polinômios é apresentada no terceiro capítulo. Concluímos com o quarto capítulo onde relataremos a aplicação parcial desta proposta em uma turma de terceiro ano técnico em informática do IFRS Câmpus Ibirubá.

Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2014-10-31T11:26:53Z No. of bitstreams: 2 Dissertação - Emílio Curi Neto - 2014.pdf: 3380066 bytes, checksum: d90415ab2be40c912a8f3437adf514bb (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2014-10-31T13:45:48Z (GMT) No. of bitstreams: 2 Dissertação - Emílio Curi Neto - 2014.pdf: 3380066 bytes, checksum: d90415ab2be40c912a8f3437adf514bb (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Made available in DSpace on 2014-10-31T13:45:48Z (GMT). No. of bitstreams: 2 Dissertação - Emílio Curi Neto - 2014.pdf: 3380066 bytes, checksum: d90415ab2be40c912a8f3437adf514bb (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2014-07-03 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / In this work the main goal is focused on applying the theory of Taylor polynomial approximations applied on the trigonometric function defined by f : [0; 2 ] 􀀀! R, where f(x) = sin(x). To achieve this goal, eight sections were developed, in which initially a reflection on the problem and the need to obtain the values in this respect in that it is wide angle measure x is presented. Is presented and subsequently treated a problem involving the movement of a pendulum, which uses the approximation sin(x) x where x belongs to a certain range. In the sections that follow a literature review of the theories of differential and integral calculus is presented, and the related theory of Taylor approximation of functions by polynomials. Later we used these theories to analyze and determine polynomials approximating the function f(x) = sin(x) in a neighborhood of the point x = 0, and estimate the error when we applied these approaches. At this time the error occurred due to the approach used in the pendulum problem was also analyzed. Finally a hint of practice to be held in the classroom using the theories treated here as well as the study of the problem of heat transfer in a bar through the theory of Fourier activity is presented. / Neste trabalho o objetivo principal está focado em aplicar a teoria de Taylor relativa à aproximações polinomiais aplicadas à função trigonométrica definida por f : [0; 2 ] 􀀀! R, onde f(x) = sen(x). Para alcançar esse objetivo, foram desenvolvidas oito seções, nas quais inicialmente é apresentada uma reflexão sobre a necessidade e a problemática de obtêr-se os valores desta relação a medida em que varia-se a medida do ângulo x. Posteriormente é apresentado e tratado um problema envolvendo o movimento de um pêndulo, o qual utiliza a aproximação sen(x) x onde x pertence o um certo intervalo. Nas seções que seguem é apresentada uma revisão bibliográfica das Teorias do Cálculo Diferencial e Integral, assim como da Teoria de Taylor relacionada à aproximação de funções através de polinômios. Posteriormente utilizou-se estas teorias para analisar e determinar polinômios que aproximam a função sen(x) em uma vizinhança do ponto x = 0, assim como estimar o erro gerado ao utilizar-se estas aproximações. Nesse momento também foi analisado o erro ocorrido devido à aproximação utilizada no problema do pêndulo. Por fim é apresentada uma sugestão de atividade prática a ser realizada em sala de aula utilizando as teorias aqui tratadas, assim como o estudo do problema de transferência de calor em uma barra através da teoria de Fourier.

Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2015-01-27T14:36:34Z No. of bitstreams: 3 license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Dissertação - Claudio Umberto de Melo - 2014.pdf: 1397821 bytes, checksum: 73643dda4277353d441b401766d5aded (MD5) Dissertação - Claudio Umberto de Melo - 2014.pdf: 1397821 bytes, checksum: 73643dda4277353d441b401766d5aded (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2015-01-28T12:37:26Z (GMT) No. of bitstreams: 3 license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Dissertação - Claudio Umberto de Melo - 2014.pdf: 1397821 bytes, checksum: 73643dda4277353d441b401766d5aded (MD5) Dissertação - Claudio Umberto de Melo - 2014.pdf: 1397821 bytes, checksum: 73643dda4277353d441b401766d5aded (MD5) / Made available in DSpace on 2015-01-28T12:37:26Z (GMT). No. of bitstreams: 3 license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Dissertação - Claudio Umberto de Melo - 2014.pdf: 1397821 bytes, checksum: 73643dda4277353d441b401766d5aded (MD5) Dissertação - Claudio Umberto de Melo - 2014.pdf: 1397821 bytes, checksum: 73643dda4277353d441b401766d5aded (MD5) Previous issue date: 2014-08-15 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / This work presents a study on the Cardano's method applied in 3rd degree polynomial equations of the form x3 + px + q = 0; p; q 2 R and use in the classroom, the 3rd year of high school, working with the procedure without the use of formula to determine a root of 3rd degree polynomial equation. The application of this method searches enable to students a relevant intellectual enrichment for future studies of the exact sciences. In this work not used a diagnostic evaluation to analyse the level of understanding of theme, only search to apply the procedure used by Cardano, in the classroom, and especially present a demonstration of this procedure to an equation in the general form of the 3rd degree. The study brings a historical approach of the resolutions of the equations, after, a theoretical foundation for the study of polynomials, detaching the theorems main, propositions and key de nitions for the study of the polynomial functions. Moreover, detach the study of the characteristics of the roots of an equation of the 3rd degree of analytical and graphical form, where we present an analytical resolution for the 4th degree equations. However, we conclude that the application of this study demonstrates that students have greater facility to nd a root of an equation in the general form, as well as the other roots. Therefore, the procedure used in classroom presents a method to nd at least one root of an equation of the 3rd degree, without the use of formula. Keywords / Este trabalho apresenta um estudo sobre o método de Cardano aplicado em equações polinomiais do 3o grau da forma x3 + px + q = 0; p; q 2 R e a utilização em sala, do 3o ano do Ensino Médio, trabalhando com o procedimento sem o uso de fórmula para determinar uma raiz de equação polinomial do 3o grau. A aplicação deste método busca possibilitar aos alunos um enriquecimento intelectual relevante para futuros estudos das ciências exatas. Neste trabalho não foi utilizado uma avaliação diagnóstica para analisar o nível de compreensão do tema, apenas buscou aplicar o procedimento utilizado por Cardano, em sala de aula, e principalmente apresentar uma demonstração deste procedimento para uma equação na forma geral do 3o grau. O estudo traz uma abordagem histórica das resoluções das equações, posteriormente, uma fundamentação teórica para o estudo dos polinômios, destacando os principais teoremas, proposições e de nições fundamentais para o estudo das funções polinomiais. Além disso, destaca o estudo das características das raízes de uma equação do 3o grau de forma analítica e grá ca, onde apresentamos uma resolução analítica para as equações do 4o grau. Contudo, concluímos que a aplicação deste estudo demonstra que os alunos apresentam maior facilidade para encontrar uma raiz de uma equação na forma geral, assim como as demais raízes. Portanto, o procedimento utilizado em sala apresenta um método para encontrar

Knot theory is the mathematical study of knots. In this thesis we study knots and one of its applications in DNA. Knot theory sits in the mathematical field of topology and naturally this is where the work begins. Topological concepts such as topological spaces, homeomorphisms, and homology are considered. Thereafter knot theory, and in particular, knot theoretical invariants are examined, aiming to provide insights into why it is difficult to answer the question "How can we tell knots appart?". In knot theory invariants such as the bracket polynomial, the Jones polynomial and tricolorability are considered as well as other helpful results like Seifert surfaces. Lastly knot theory is applied to DNA, where it will shed light on how certain enzymes interact with the genome.

No description available.