Adrien-Marie Legendre (1752-1833) e suas obras em Teoria dos Números

The present thesis is an analysis of Adrien-Marie Legendre s works on Number Theory, with a certain emphasis on his 1830 edition of Theory of Numbers. The role played by these works in their historical context and their influence on the development of Number Theory was investigated. A biographic study of Legendre (1752-1833) was undertaken, in which both his personal relations and his scientific productions were related to certain historical elements of the development of both his homeland, France, and the sciences in general, during the 18th and 19th centuries This study revealed notable characteristics of his personality, as well as his attitudes toward his mathematical contemporaries, especially with regard to his seemingly incessant quarrels with Gauss about the priority of various of their scientific discoveries. This is followed by a systematic study of Lagrange s work on Number Theory, including a comparative reading of certain topics, especially that of his renowned law of quadratic reciprocity, with texts of some of his contemporaries. In this way, the dynamics of the evolution of his thought in relation to his semantics, the organization of his demonstrations and his number theoretical discoveries was delimited. Finally, the impact of Legendre s work on Number Theory on the French mathematical community of the time was investigated. This investigation revealed that he not only made substantial contributions to this branch of Mathematics, but also inspired other mathematicians to advance this science even further. This indeed is a fitting legacy for his Theory of Numbers, the first modern text on Higher Arithmetic, on which he labored half his life, producing various editions. Nevertheless, Legendre also received many posthumous honors, including having his name perpetuated on the Trocadéro face of the Eiffel Tower, which contains a list of 72 eminent scientists, and having a street and an alley in Paris named after him

Identificação não linear usando uma rede fuzzy wavelet neural network modificada

In last decades, neural networks have been established as a major tool for the identification of nonlinear systems. Among the various types of networks used in identification, one that can be highlighted is the wavelet neural network (WNN). This network combines the characteristics of wavelet multiresolution theory with learning ability and generalization of neural networks usually, providing more accurate models than those ones obtained by traditional networks. An extension of WNN networks is to combine the neuro-fuzzy ANFIS (Adaptive Network Based Fuzzy Inference System) structure with wavelets, leading to generate the Fuzzy Wavelet Neural Network - FWNN structure. This network is very similar to ANFIS networks, with the difference that traditional polynomials present in consequent of this network are replaced by WNN networks. This paper proposes the identification of nonlinear dynamical systems from a network FWNN modified. In the proposed structure, functions only wavelets are used in the consequent. Thus, it is possible to obtain a simplification of the structure, reducing the number of adjustable parameters of the network. To evaluate the performance of network FWNN with this modification, an analysis of network performance is made, verifying advantages, disadvantages and cost effectiveness when compared to other existing FWNN structures in literature. The evaluations are carried out via the identification of two simulated systems traditionally found in the literature and a real nonlinear system, consisting of a nonlinear multi section tank. Finally, the network is used to infer values of temperature and humidity inside of a neonatal incubator. The execution of such analyzes is based on various criteria, like: mean squared error, number of training epochs, number of adjustable parameters, the variation of the mean square error, among others. The results found show the generalization ability of the modified structure, despite the simplification performed

Sistema de navegação para robôs móveis autônomos

The main task and one of the major mobile robotics problems is its navigation process. Conceptualy, this process means drive the robot from an initial position and orientation to a goal position and orientation, along an admissible path respecting the temporal and velocity constraints. This task must be accomplished by some subtasks like robot localization in the workspace, admissible path planning, trajectory generation and motion control. Moreover, autonomous wheeled mobile robots have kinematics constraints, also called nonholonomic constraints, that impose the robot can not move everywhere freely in its workspace, reducing the number of feasible paths between two distinct positions. This work mainly approaches the path planning and trajectory generation problems applied to wheeled mobile robots acting on a robot soccer environment. The major dificulty in this process is to find a smooth function that respects the imposed robot kinematic constraints. This work proposes a path generation strategy based on parametric polynomials of third degree for the 'x' and 'y' axis. The 'theta' orientation is derived from the 'y' and 'x' relations in such a way that the generated path respects the kinematic constraint. To execute the trajectory, this work also shows a simple control strategy acting on the robot linear and angular velocities

Um estudo sobre polinômios matriciais

This research work aims to make a study of the algebraic theory of matrix monic polynomials, as well as the definitions, concepts and properties with respect to block eigenvalues, block eigenvectors and solvents of P(X). We investigte the main relations between the matrix polynomial and the Companion and Vandermonde matrices. We study the construction of matrix polynomials with certain solvents and the extention of the Power Method, to calculate block eigenvalues and solvents of P(X). Through the relationship between the dominant block eigenvalue of the Companion matrix and the dominant solvent of P(X) it is possible to obtain the convergence of the algorithm for the dominant solvent of the matrix polynomial. We illustrate with numerical examples for diferent cases of convergence.