A documentação da fé: fluxos, apropriações e enquadramentos de objetos votivos no Santuário Nacional de Aparecida

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Zeros da função zeta de Riemann e o teorema dos números primos

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Multiplicity of solutions for a biharmonic equation with subcritical or critical growth

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Teorema de Pitágoras: algumas extensões/generalizações e atividades com o Software GeoGebra

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Imageologia na odontologia e aspectos legais

The technology, through the advent of new equipments that allow imaging exams, has helped very much in the diagnosis and prognosis of diseases in Dentistry. The use of informatics, in general, in the manufacture of clinical reports is increasingly present in the dental offices. The legal validity of these systems is questioned, and is matter of discussion. This work makes considerations about Imageology or Diagnostic by image, a new area that is appearing on Dentistry. Among other exams, there are: digital radiography, tomography, computed tomography, artomography, magnetic resonance, computed cefalometry and ultra-sonography. It permits the professional to obtain a better diagnostic, and to the patient, the visualization of his problem and treatment. A survey on the possibilities of using informatics in Dentistry, particularly in Radiology, was also carried out, as well as the legal aspects, which are in accordance with the Law 8.935/94, what guarantees its practicability. Digital Certification is a mechanism that provides legal validity to documents and, as such, to radiographic images and others. It is a procedure that the dentist should take to ensure that he/she has safeguarded the judicial proofs that may be necessary in an eventual demand.

Os rapazes da Rua Panisperna e os centomila Majorana: os fatos e as versões literária e audiovisual

While a certain novel ponders about the traces left by Ettore Majorana and expounds some theories about the fate of the character mysteriously disappeared, a movie by Gianni Amelio also inspirited by facts goes through another path, of the story of Via Panisperna boys, stressing the enigmatic figure of Ettore Majorana and the exciting episodes surrounding some of the greatest physicists of the world. When Leonardo Sciascia publishes the novel in which he uses the actual fact of Ettore Majorana’s disappearance in order to create what he calls a “philosophical novel of mystery”, the public had already probably forgotten the intriguing events of 1938: the young and bright physicist disappeared, by all accounts, voluntarily, without leaving proofs of his death or reliable evidence of his whereabouts. In 1972, Sciascia learns about mysterious clues by means of Erasmo Recami and considers the motives that could have made Majorana leave Italy and later abandon his life almost in the mode fictionalized by Pirandello.

O invariante E(G, W, M): algumas propriedades e aplicações na teoria de decomposição de grupos

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Número Irracionais e transcendentes

Pós-graduação em Matemática - IBILCE

Anéis de inteiros de corpos de números e aplicações

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Regra de Sinais de Descartes para polinômios ortogonais

Pós-graduação em Matematica Aplicada e Computacional - FCT

Marguerite Tolbert Papers - Accession 203

Marguerite Tolbert (1893-1982) was a Winthrop alumna (class of 1914), club woman, and administrator with the Opportunity School in Columbia, South Carolina. The Marguerite Tolbert Papers consist of correspondence, manuscripts, galley proofs, biographical sketches, newspaper clippings, and other records relating to the publication of the book, South Carolina’s Distinguished Women of Laurens County. Miss Tolbert served as coordinator for the book project. Also included is an unpublished manuscript written by Clara Yarborough concerning the terms of office of seven former South Carolina governors. Miss Yarborough served as secretary under these governors.

Connections between the Sznajd model with general confidence rules and graph theory

The Sznajd model is a sociophysics model that is used to model opinion propagation and consensus formation in societies. Its main feature is that its rules favor bigger groups of agreeing people. In a previous work, we generalized the bounded confidence rule in order to model biases and prejudices in discrete opinion models. In that work, we applied this modification to the Sznajd model and presented some preliminary results. The present work extends what we did in that paper. We present results linking many of the properties of the mean-field fixed points, with only a few qualitative aspects of the confidence rule (the biases and prejudices modeled), finding an interesting connection with graph theory problems. More precisely, we link the existence of fixed points with the notion of strongly connected graphs and the stability of fixed points with the problem of finding the maximal independent sets of a graph. We state these results and present comparisons between the mean field and simulations in Barabasi-Albert networks, followed by the main mathematical ideas and appendices with the rigorous proofs of our claims and some graph theory concepts, together with examples. We also show that there is no qualitative difference in the mean-field results if we require that a group of size q > 2, instead of a pair, of agreeing agents be formed before they attempt to convince other sites (for the mean field, this would coincide with the q-voter model).

A relaxed constant positive linear dependence constraint qualification and applications

In this work we introduce a relaxed version of the constant positive linear dependence constraint qualification (CPLD) that we call RCPLD. This development is inspired by a recent generalization of the constant rank constraint qualification by Minchenko and Stakhovski that was called RCRCQ. We show that RCPLD is enough to ensure the convergence of an augmented Lagrangian algorithm and that it asserts the validity of an error bound. We also provide proofs and counter-examples that show the relations of RCRCQ and RCPLD with other known constraint qualifications. In particular, RCPLD is strictly weaker than CPLD and RCRCQ, while still stronger than Abadie's constraint qualification. We also verify that the second order necessary optimality condition holds under RCRCQ.

Properly coloured copies and rainbow copies of large graphs with small maximum degree

Let G be a graph on n vertices with maximum degree ?. We use the Lovasz local lemma to show the following two results about colourings ? of the edges of the complete graph Kn. If for each vertex v of Kn the colouring ? assigns each colour to at most (n - 2)/(22.4?2) edges emanating from v, then there is a copy of G in Kn which is properly edge-coloured by ?. This improves on a result of Alon, Jiang, Miller, and Pritikin [Random Struct. Algorithms 23(4), 409433, 2003]. On the other hand, if ? assigns each colour to at most n/(51?2) edges of Kn, then there is a copy of G in Kn such that each edge of G receives a different colour from ?. This proves a conjecture of Frieze and Krivelevich [Electron. J. Comb. 15(1), R59, 2008]. Our proofs rely on a framework developed by Lu and Szekely [Electron. J. Comb. 14(1), R63, 2007] for applying the local lemma to random injections. In order to improve the constants in our results we use a version of the local lemma due to Bissacot, Fernandez, Procacci, and Scoppola [preprint, arXiv:0910.1824]. (c) 2011 Wiley Periodicals, Inc. Random Struct. Alg., 40, 425436, 2012

Towards automated first-order abduction: the cut-based approach

Traditional abduction imposes as a precondition the restriction that the background information may not derive the goal data. In first-order logic such precondition is, in general, undecidable. To avoid such problem, we present a first-order cut-based abduction method, which has KE-tableaux as its underlying inference system. This inference system allows for the automation of non-analytic proofs in a tableau setting, which permits a generalization of traditional abduction that avoids the undecidable precondition problem. After demonstrating the correctness of the method, we show how this method can be dynamically iterated in a process that leads to the construction of non-analytic first-order proofs and, in some terminating cases, to refutations as well.