Submitted by Maike Costa (maiksebas@gmail.com) on 2016-03-29T13:33:49Z No. of bitstreams: 1 arquivo total.pdf: 5320246 bytes, checksum: 158dd460a20ce46c96d4a34623612264 (MD5) / Made available in DSpace on 2016-03-29T13:33:49Z (GMT). No. of bitstreams: 1 arquivo total.pdf: 5320246 bytes, checksum: 158dd460a20ce46c96d4a34623612264 (MD5) Previous issue date: 2011-08-25 / This work is mainly concerned with the existence and nonexistence of classical solution to the nonhomogeneous semilinear equation Δu + up + f(x) = 0 in Rn, u > 0 in Rn, when n 3, where f 0 is a Hölder continuous function. The nonexistence of classical solution is established when 1 < p n=(n 􀀀 2). For p > n=(n 􀀀 2) there may be both existence and nonexistence results depending on the asymptotic behavior of f at infinity. The existence results were obtained by employed sub and supersolutions techniques and fixed point theorem. For the nonexistence of classical solution we used a priori integral estimates obtained via averaging. / Neste trabalho, estamos interessados na existência e não existência de solução clássica para a equação não homogênea semilinear Δu + up + f(x) = 0 em Rn; u > 0 em Rn, n 3 onde f 0 é uma função Hölder contínua. A não existência de solução clássica é estabelecida quando 1 < p n=(n 􀀀 2). Para p > n=(n 􀀀 2), temos resultados de existência e não existência de solução clássica, dependendo do comportamento assin- tótico de f no infinito. Os resultados de existência foram obtidos usando o método de sub e supersolução e teoremas de ponto fixo. A não existência de solução clássica é obtida usando-se estimativas integrais a priori via média esférica.

Les limites physiques des circuits à base de silicium étant en passe d'être atteintes, de nouveaux moyens doivent être trouvés pour outrepasser la fin de la loi de Moore. Beaucoup d'applications peuvent tolérer des approximations dans leurs calculs à différents niveaux, sans dégrader la qualité de leur sortie, ou en la dégradant de manière acceptable. Cette thèse se concentre sur les architectures arithmétiques approximatives afin de saisir cette opportunité. Tout d'abord, une étude critique de l'état de l'art des additionneurs et multiplieurs approximatifs est présentée. Ensuite, un modèle de propagation d'erreur virgule-fixe mettant en œuvre la densité spectrale de puissance est proposée, suivi d'un modèle de propagation du taux d'erreur binaire positionnel des opérateurs approximatifs. Les opérateurs approximatifs sont ensuite utilisés pour la reproduction des effets de la VOS dans les opérateurs arithmétiques exacts. Grâce à notre outil de travail open-source ApxPerf et ses bibliothèques synthétisables C++ apx_fixed pour les opérateurs approximatifs et ct_float pour l'arithmétique flottante basse consommation, deux études consécutives sont proposées, basées sur des applications de traitement du signal complexes. Tout d'abord, les opérateurs approximatifs sont comparés à l'arithmétique virgule-fixe, et la supériorité de la virgule-fixe est soulignée. Enfin, la virgule fixe est comparée aux petits flottants dans des conditions équivalentes. En fonction des conditions applicatives, la virgule-flottante montre une compétitivité inattendue face à la virgule-fixe. Les résultats et discussions de cette thèse donnent un regard nouveau sur l'arithmétique approximative et suggère de nouvelles directions pour le futur des architectures efficaces en énergie. / The physical limits being reached in silicon-based computing, new ways have to be found to overcome the predicted end of Moore's law. Many applications can tolerate approximations in their computations at several levels without degrading the quality of their output, or degrading it in an acceptable way. This thesis focuses on approximate arithmetic architectures to seize this opportunity. Firstly, a critical study of state-of-the-art approximate adders and multipliers is presented. Then, a model for fixed-point error propagation leveraging power spectral density is proposed, followed by a model for bitwise-error rate propagation of approximate operators. Approximate operators are then used for the reproduction of voltage over-scaling effects in exact arithmetic operators. Leveraging our open-source framework ApxPerf and its synthesizable template-based C++ libraries apx_fixed for approximate operators, and ct_float for low-power floating-point arithmetic, two consecutive studies are proposed leveraging complex signal processing applications. Firstly, approximate operators are compared to fixed-point arithmetic, and the superiority of fixed-point is highlighted. Secondly, fixed-point is compared to small-width floating-point in equivalent conditions. Depending on the applicative conditions, floating-point shows an unexpected competitiveness compared to fixed-point. The results and discussions of this thesis give a fresh look on approximate arithmetic and suggest new directions for the future of energy-efficient architectures.

[pt] Esse trabalho tem como objetivo reunir os teoremas topológicos de ponto fixo clássicos e seus corolários, além de teoremas de ponto fixo provenientes da teoria do grau e algumas importantes aplicações desses teoremas a variadas áreas - desde as clássicas aplicações à teoria de EDOs e EDPs à uma aplicação à teoria dos jogos. Um exemplo é o Teorema do Ponto Fixo de Schauder-Tychonoff, para aplicações compactas em convexos de espaços localmente convexos, do qual segue como corolário que todo compacto convexo de um espaço vetorial normado (não necessariamente de dimensão finita) possui a propriedade do ponto fixo. No que se refere à teoria dos jogos em particular, foi deduzido o Teorema de Nash, que determina condições sobre as quais certos jogos possuem equilíbrios nos seus espaços das estratégias. Toda a topologia geral necessária nas demonstrações foi desenvolvida extensiva e detalhadamente a partir de topologia elementar, seguindo algumas das referências bibliográficas. O Teorema de Extensão de Dugundji - uma extensão do Teorema de Extensão de Tietze a fechados de espaços métricos sobre espaços localmente convexos -, por exemplo, é demonstrado com detalhes e usado diversas vezes ao longo da dissertação. / [en] The goal of the present work is to gather the classical fixed-point theorems and their corollaries, as well as other fixed-point theorems arising from degree theory, and some important applications to diverse fields - from the classical applications to ODEs and PDEs to an application to the game theory. An example is the Schauder-Tychonoff Fixed-Point Theorem, 1 concerning compact mappings in convex subsets of locally convex spaces, from which it follows as a corollary that every compact convex subset of a normed vector space is a fixed-point space. In regard to game theory in particular, we obtained Nash s theorem, 2 which ascertains conditions over which certain games have equilibria in their strategy spaces. All general topology necessary in the proofs was developed extensively and in details from a basic topology starting point, following some of the bibliographic references. Dugundji s Extension Theorem 3 - an extension of Tietze s Extension Theorem 4 for closed subsets of metric spaces into locally convex spaces-, for instance, is obtained with detais and used throughout the dissertation.

Banach's contraction principle is probably one of the most important theorems in fixed point theory. It has been used to develop much of the rest of fixed point theory. Another key result in the field is a theorem due to Browder, Göhde, and Kirk involving Hilbert spaces and nonexpansive mappings. Several applications of Banach's contraction principle are made. Some of these applications involve obtaining new metrics on a space, forcing a continuous map to have a fixed point, and using conditions on the boundary of a closed ball in a Banach space to obtain a fixed point. Finally, a development of the theorem due to Browder et al. is given with Hilbert spaces replaced by uniformly convex Banach spaces.

Mathematical models have extensively been used in problems related to engineering, computer sciences, economics, social, natural and medical sciences etc. It has become very common to use mathematical tools to solve, study the behavior and different aspects of a system and its different subsystems. Because of various uncertainties arising in real world situations, methods of classical mathematics may not be successfully applied to solve them. Thus, new mathematical theories such as probability theory and fuzzy set theory have been introduced by mathematicians and computer scientists to handle the problems associated with the uncertainties of a model. But there are certain deficiencies pertaining to the parametrization in fuzzy set theory. Soft set theory aims to provide enough tools in the form of parameters to deal with the uncertainty in a data and to represent it in a useful way. The distinguishing attribute of soft set theory is that unlike probability theory and fuzzy set theory, it does not uphold a precise quantity. This attribute has facilitated applications in decision making, demand analysis, forecasting, information sciences, mathematics and other disciplines. In this thesis we will discuss several algebraic and topological properties of soft sets and fuzzy soft sets. Since soft sets can be considered as setvalued maps, the study of fixed point theory for multivalued maps on soft topological spaces and on other related structures will be also explored. The contributions of the study carried out in this thesis can be summarized as follows: i) Revisit of basic operations in soft set theory and proving some new results based on these modifications which would certainly set a new dimension to explore this theory further and would help to extend its limits further in different directions. Our findings can be applied to develop and modify the existing literature on soft topological spaces ii) Defining some new classes of mappings and then proving the existence and uniqueness of such mappings which can be viewed as a positive contribution towards an advancement of metric fixed point theory iii) Initiative of soft fixed point theory in framework of soft metric spaces and proving the results lying at the intersection of soft set theory and fixed point theory which would help in establishing a bridge between these two flourishing areas of research. iv) This study is also a starting point for the future research in the area of fuzzy soft fixed point theory. / Abbas, M. (2014). Soft Set Theory: Generalizations, Fixed Point Theorems, and Applications [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/48470 / TESIS

Orientador: German Jesus Lozada Cruz / Banca: Cosme Eustaquio Rubio Mercedes / Banca: Rita de Cássia Pavani Lamas / Resumo: O principal objetivo deste trabalho consiste na produção de um referencial teórico relacionado aos conceitos de ponto fixo, que possibilite, aos alunos do Ensino Médio, o desenvolvimento de habilidades e competências relacionadas à Matemática. Neste trabalho são colocadas abordagens contextualizadas e proposições referentes às noções de ponto fixo nas principais funções reais (afim, quadrática, modular, dentre outras) e sua interpretação geométrica. São abordados de maneira introdutória os conceitos do teorema do ponto fixo de Brouwer, o teorema do ponto fixo de Banach e o método de resolução de equações por aproximações sucessivas / Abstract: The main objective of this work is to produce a theoretical concepts related to fixed point, enabling, for high school students, the development of skills and competencies related to Mathematics. This work placed contextualized approaches and proposals relating to notions of fixed point in the main real functions (affine, quadratic, modular, among others) and its geometric interpretation. Are approached introductory concepts of the fixed point theorem of Brouwer's, fixed point theorem of Banach and the method of solving equations by successive approximations / Mestre

AN ABSTRACT OF THE DISSERTATION OFSaleh Aljurbua, for the Doctor of Philosophy degree in APPLIED MATHEMATICS, presented on January 27th, 2021, at Southern Illinois University Carbondale. TITLE: THE EXISTENCE OF SOLUTIONS FOR FRACTIONAL DIFFERENTIAL EQUATIONS FOR ORDER q ∈ (n − 1, n], n ∈ N, WITH ANTIPERIODIC BOUNDARY CONDITIONS MAJOR PROFESSOR: Dr. Mingqing Xiao Differential equations play a major role in natural science, physics and technology. Fractional differential equations (FDE) gained a lot of popularity in the past three decades and they became very important in economics, physics and chemistry. In fact, fractional integrals and derivatives became essential and made a significant contribution in dynamical systems which simulate it. They fill the gaps between the integer-types of integrations and derivatives in the classical settings. This work consists of four Chapters. The first Chapter will be covering background, preliminary and fundamental tools used in our dissertation topic. The second Chapter consists of the existence of solutions for nonlinear fractional differential equations of some specific orders with antiperiodic boundary conditions followed by the main topic which is the existence of solutions for nonlinear fractional differential equations of order q ∈ (n−1, n], n ∈ N with antiperiodic boundary conditions of a continuous function f(t, x(t)). Moreover, definitions, theorems and some lemmas will be provided. v In the third Chapter, we offer some examples to illustrate our approach in the main topic. Finally, the fourth Chapter includes the summary and perspective researches.

The representation of terminological knowledge may naturally lead to terminological cycles. In addition to descriptive semantics, the meaning of cyclic terminologies can also be captured by fixed-point semantics, namely, greatest and least fixed-point semantics. To gain a more profound understanding of these semantics and to obtain inference algorithms as well as complexity results for inconsistency, subsumption, and related inference tasks, this paper provides automata theoretic characterizations of these semantics. More precisely, the already existing results for FL₀ are extended to the language ALN, which additionally allows for primitive negation and number-restrictions. Unlike FL₀, the language ALN can express inconsistent concepts, which makes non-trivial extensions of the characterizations and algorithms necessary. Nevertheless, the complexity of reasoning does not increase when going from FL₀ to ALN. This distinguishes ALN from the very expressive languages with fixed-point operators proposed in the literature. It will be shown, however, that cyclic ALN-terminologies are expressive enough to capture schemata in certain semantic data models.

The aim of this study is to examine the capability, performance, and relevance of a signal processing toolkit in Java, a programming language for Web-based applications. Due to the simplicity, ease and application use of the toolkit and with the advanced Internet technologies such as Remote Method Invocation (RMI), a spectral estimation applet has been created in the Java environment. This toolkit also provides an interactive and visual approach in understanding the various theoretical concepts of spectral estimation and shows the need to create more application applets to better understand the various concepts of signal and image processing. This study also focuses on creating a Java toolkit for embedded systems, such as Personal Digital Assistants (PDAs), embedded Java board, and supporting integer precision, and utilizing COordinate Rotation DIgital Computer (CORDIC) algorithm, both aimed to provide good performance in resource-limited environments. The results show a feasibility and necessity of developing a standardized Application Programming Interface (API) for the fixed-point signal processing library.

This thesis is comprised of three parts. The first part describes a novel framework for computing importance measures on graph vertices. The concept of a D-spectrum is introduced, based on vertex ranks within certain chains of nested sub-graphs. We show that the D- spectrum integrates the degree distribution and coreness information of the graph as two particular such chains. We prove that these spectra are realized as fixed points of certain monotone and contractive SDSs we call t-systems. Finally, we give a vertex deletion algorithm that efficiently computes D-spectra, and we illustrate their correlation with stochastic SIR-processes on real world networks. The second part deals with the topology of the intersection nerve for a bi-secondary structure, and its singular homology. A bi-secondary structure R, is a combinatorial object that can be viewed as a collection of cycles (loops) of certain at most tetravalent planar graphs. Bi-secondary structures arise naturally in the study of RNA riboswitches - molecules that have an MFE binary structural degeneracy. We prove that this loop nerve complex has a euclidean 3-space embedding characterized solely by H2(R), its second homology group. We show that this group is the only non-trivial one in the sequence and furthermore it is free abelian. The third part further describes the features of the loop nerve. We identify certain disjoint objects in the structure of R which we call crossing components (CC). These are non-trivial connected components of a graph that captures a particular non-planar embedding of R. We show that each CC contributes a unique generator to H2(R) and thus the total number of these crossing components in fact equals the rank of the second homology group. / Doctor of Philosophy / This Thesis is divided into three parts. The first part describes a novel mathematical framework for decomposing a real world network into layers. A network is comprised of interconnected nodes and can model anything from transportation of goods to the way the internet is organized. Two key numbers describe the local and global features of a network: the number of neighbors, and the number of neighbors in a certain layer, a node has. Our work shows that there are other numbers in-between the two, that better characterize a node. We also give explicit means of computing them. Finally, we show that these numbers are connected to the way information spreads on the network, uncovering a relation between the network’s structure and dynamics on said network. The last two parts of the thesis have a common theme and study the same mathematical object. In the first part of the two, we provide a new model for the way riboswtiches organize themselves. Riboswitches, are RNA molecules within a cell, that can take two mutually opposite conformations, depending on what function they need to perform within said cell. They are important from an evolutionary standpoint and are actively studied within that context, usually being modeled as networks. Our model captures the shapes of the two possible conformations, and encodes it within a mathematical object called a topological space. Once this is done, we prove that certain numbers that are attached to all topological spaces carry specific values for riboswitches. Namely, we show that the shapes of the two possible conformations for a riboswich are always characterized by a single integer. In the last part of the Thesis we identify what exactly in the structure of riboswitches contributes to this number being large or small. We prove that the more tangled the two conformations are, the larger the number. We can thus conclude that this number is directly proportional to how complex the riboswitch is.