To see the other types of publications on this topic, follow the link: Maxima and minima.
Dissertations / Theses on the topic 'Maxima and minima'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Maxima and minima.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Uricks, Ryan Gerard. "Minima Maxima." Thesis, Virginia Tech, 2019. http://hdl.handle.net/10919/96212.
Full textAbstract:
Architecture can provide unique, experiential spaces at varying sizes. In situations of housing scarcity or lack of affordability, design becomes imperative in crafting spaces that, while spartan and minimal, allows for variation and individuality to arise. In the context of an urban intervention, architecture can unite the city and the people by offering space for the city and creating an active community for its occupants. This thesis uses a micro-apartment complex in Chicago overlooking a park and elevated subway tracks to show how architecture and design can provide dignified spaces of any size.Master of Architecture
Architecture can provide unique, experiential spaces at varying sizes. In situations of housing scarcity or lack of affordability, design becomes imperative in crafting spaces that, while spartan and minimal, allows for variation and individuality to arise. In the context of an urban intervention, architecture can unite the city and the people by offering space for the city and creating an active community for its occupants. This thesis uses a micro-apartment complex in Chicago overlooking a park and elevated subway tracks to show how architecture and design can provide dignified spaces of any size.
2
Helfgott, Harald, and Michel Helfgott. "Maxima and minima before calculus." Pontificia Universidad Católica del Perú, 2014. http://repositorio.pucp.edu.pe/index/handle/123456789/97261.
Full text
3
Nivens, Ryan A. "Investigating the LEMMA Curriculum from New Zealand: Identifying Maxima and Minima." Digital Commons @ East Tennessee State University, 2018. https://dc.etsu.edu/etsu-works/4738.
Full text
4
許眞眞 and Zhenzhen Xu. "A min-max theorem on packing and covering cycles in graphs." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B31226966.
Full text
5
Li, Yin-chiu, and 李燕超. "Min-max theorems on feedback vertex sets." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B42577111.
Full text
6
Li, Yin-chiu. "Min-max theorems on feedback vertex sets." Click to view the E-thesis via HKUTO, 2002. http://sunzi.lib.hku.hk/hkuto/record/B42577111.
Full text
7
Xu, Zhenzhen. "A min-max theorem on packing and covering cycles in graphs /." Hong Kong : University of Hong Kong, 2002. http://sunzi.lib.hku.hk/hkuto/record.jsp?B25155301.
Full text
8
Lerma, Miguel Angel. "An extremal majorant for the logarithm and its applications /." Digital version accessible at:, 1998. http://wwwlib.umi.com/cr/utexas/main.
Full text
9
DeFord, Dinah Lynn. "Strengthening the Precalculus Bridge: Enhancing the Precalculus Student's Understanding of Tangents to Conics, Biquadratic Equations, and Maxima and Minima." Digital Commons @ East Tennessee State University, 2007. https://dc.etsu.edu/etd/2084.
Full textAbstract:
Many students face tremendous difficulty in high school and/or college level calculus courses. The author hopes that by introducing students to the following nontraditional three topics prior to calculus, students' understanding of calculus will be enhanced. This thesis focuses on the following topics: Tangent Lines to Conics Maxima and Minima Biquadratic Equations
Because these topics are not generally covered in precalculus courses, there are several possible uses for them. An instructor could use the material as: An added classroom resource Project assignments for outside classroom study A student resource for precalculus advanced studies, or An independent study
This thesis assumes that the student is well prepared for the precalculus course by having a good understanding of foundational algebra skills.
10
Chung, Yau-lin, and 鍾有蓮. "Optimality and approximability of the rectangle covering problem." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B30294873.
Full text
11
Muller, Sonia Isoldi Marty Gama 1957. "Comparação entre os metodos da maxima verossimilhança, distancia minima e o metodo de Fisher para reconhecimento de padrões em imagens coloridas." reponame:Repositório Institucional da UFPR, 1997. http://hdl.handle.net/1884/44185.
Full textAbstract:
Orientador: Quintino DalmolinCo-orientador: Hideo Araki
Dissertação (mestrado) - Universidade Federal do Parana
Resumo: Uma das grandes preocupações no processo de automação em Fotogramentria esta relacionado com os algoritmos de reconhecimento de padrões. Apesar da metodologia ter avançado significativamente nos últimos anos, principalmente no que se refere ao tom de cinza, o reconhecimento de padrões de cores reais em imagens coloridas ainda se encontra em fase de desenvolvimento. Neste sentido objetiva-se realizar uma serie de ensaios com dados (cores) controlados e também com dados reais para comparar a performance dos métodos estatísticos de Máxima Verossimilhança, Distancia Mínima e de Fisher para reconhecimento das cores reais. A comparação entre os métodos estatísticos foi feita controlando o processo de classificação, ou seja, utilizando amostras determinísticas para treinamento das funções discriminantes e criando imagens para classificação no software (MATLAB). Com o intuito de que a comparação pudesse ser feita sem controle da imagem a ser classificada e das amostras, utilizou-se uma imagem retirada de uma foto digitalizada, para verificar a performance dos métodos frente a um caso real. A analise de desempenho dos métodos foi observada pela estatística kappa e a comparação pelo teste Z apropriado. Os resultados indicam que o Método de Distancia Mínima foi o melhor para classificação de cores reais sob todos os aspectos estudados.
Abstract: One o f the main issues in the photogrametry automation process is related to pattern recognition algorithms. Although there were significant advances in the last years, mainly in regard to the gray tones, color pattern recognition in colored images is still in a developmental stage. In this sense, a series o f tests with controlled data (colors) and also with real data is made to compare the performance o f the statistical methods: Maximum Likelihood, Minimum Distance, and Fisher's method in their ability to recognize real colors. The comparison among the statistical methods was performed by controlling the classification process, that is, using deterministic samples for the training o f discriminant functions and test images created by a software (MATLAB). For the case o f real images, the statistical methods were compared without controlling both the sample and the image by the utilization o f an image extracted from a digitized picture. The methods performance was analyzed using the kappa statistic and the Z test. The results indicated that the Minimum Distance Method was the best method to classify real colors under all assumptions.
12
Gandhi, Harith Suman. "Important Extrema of Time Series: Theory and Applications." [Tampa, Fla.] : University of South Florida, 2004. http://purl.fcla.edu/fcla/etd/SFE0000317.
Full text
13
Duarte, José Luís [UNESP]. "Problemas de máximos e mínimos no Ensino Médio." Universidade Estadual Paulista (UNESP), 2014. http://hdl.handle.net/11449/122210.
Full textAbstract:
Made available in DSpace on 2015-04-09T12:28:28Z (GMT). No. of bitstreams: 0
Previous issue date: 2014-09-22Bitstream added on 2015-04-09T12:47:21Z : No. of bitstreams: 1
000809210.pdf: 459385 bytes, checksum: dab92fb8cd81e57ec76cb5ce64b983e9 (MD5)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
O principal objetivo deste trabalho e fazer um estudo sobre problemas de máximos e mínimos de funções de uma variável no ensino médio. E destinado a professores e alunos de matemática deste nível de ensino. Tem a pretensão de melhorar a compreensão deste tema, muitas vezes s o abordado a nível de funções quadráticas. Serve também como uma aplicação da fórmula de Taylor. Neste trabalho queremos incentivar alunos e professores de matemática ao estudo de máximos e mínimos de funções de uma variável. Resolveremos diversos problemas envolvendo máximos e mínimos de funções polinomiais do 2o grau, utilizando os conceitos básicos de vértice, ponto de máximo, ponto de mínimo. Iremos também mostrar a resolução de problemas de máximos e mínimos que não recaem em uma função quadrática, utilizando o conceito de derivada. Por fim, para estes ultimos problemas, utilizaremos a fórmula de Taylor para aproximar a função obtida por seu polinômio de Taylor de 2a ordem. Encontraremos o valor máximo ou mínimo de tal polinômio usando as ferramentas básicas de função quadrática. De fato, devido a teoria de Taylor, constataremos que o valor otimo obtido no problema e o valor máximo ou mínimo de tal polinômio estarão suficientemente próximos
The main goal of this work is to make a study about problems of maxima and minima of functions of one variable in High School. It is intended for teachers and students of mathematics of this level of learning. It intends to improve the understanding of this subject which it is often only addressed to the level of quadratic functions. It also serves as an application of the Taylor formula. In this work we want to encourage students and teachers of mathematics to the study of maxima and minima of functions of one variable. We will solve several problems involving maxima and minima of polynomial functions of the second degree, using the basic concepts of vertex, maximum point, minimum point. We will also show the resolution of problems of maxima and minima that do not lead to a quadratic function, using the derivative concept. Finally, for these last problems, we will make use of the Taylor formula in order to approximate the function obtained by its Taylor polynomial of second order. We will nd the maximum or minimum value of such polynomial by using the basic tools of quadratic function. In fact, due to Taylor theory, we will note that the optimal value obtained in the problem and the maximum or minimum value of such polynomial will be su ciently close
14
Duarte, José Luís. "Problemas de máximos e mínimos no Ensino Médio /." São José do Rio Preto, 2014. http://hdl.handle.net/11449/122210.
Full textAbstract:
Orientador: Pedro Toniol CardinBanca: Edson Donizete de Carvalho
Banca: Wendel Cleber Soares
Resumo: O principal objetivo deste trabalho e fazer um estudo sobre problemas de máximos e mínimos de funções de uma variável no ensino médio. E destinado a professores e alunos de matemática deste nível de ensino. Tem a pretensão de melhorar a compreensão deste tema, muitas vezes s o abordado a nível de funções quadráticas. Serve também como uma aplicação da fórmula de Taylor. Neste trabalho queremos incentivar alunos e professores de matemática ao estudo de máximos e mínimos de funções de uma variável. Resolveremos diversos problemas envolvendo máximos e mínimos de funções polinomiais do 2o grau, utilizando os conceitos básicos de vértice, ponto de máximo, ponto de mínimo. Iremos também mostrar a resolução de problemas de máximos e mínimos que não recaem em uma função quadrática, utilizando o conceito de derivada. Por fim, para estes ultimos problemas, utilizaremos a fórmula de Taylor para aproximar a função obtida por seu polinômio de Taylor de 2a ordem. Encontraremos o valor máximo ou mínimo de tal polinômio usando as ferramentas básicas de função quadrática. De fato, devido a teoria de Taylor, constataremos que o valor otimo obtido no problema e o valor máximo ou mínimo de tal polinômio estarão suficientemente próximos
Abstract: The main goal of this work is to make a study about problems of maxima and minima of functions of one variable in High School. It is intended for teachers and students of mathematics of this level of learning. It intends to improve the understanding of this subject which it is often only addressed to the level of quadratic functions. It also serves as an application of the Taylor formula. In this work we want to encourage students and teachers of mathematics to the study of maxima and minima of functions of one variable. We will solve several problems involving maxima and minima of polynomial functions of the second degree, using the basic concepts of vertex, maximum point, minimum point. We will also show the resolution of problems of maxima and minima that do not lead to a quadratic function, using the derivative concept. Finally, for these last problems, we will make use of the Taylor formula in order to approximate the function obtained by its Taylor polynomial of second order. We will nd the maximum or minimum value of such polynomial by using the basic tools of quadratic function. In fact, due to Taylor theory, we will note that the optimal value obtained in the problem and the maximum or minimum value of such polynomial will be su ciently close
Mestre
15
Santiago, Claudio Prata. "On the nonnegative least squares." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/31768.
Full textAbstract:
Thesis (Ph.D)--Industrial and Systems Engineering, Georgia Institute of Technology, 2010.Committee Chair: Earl Barnes; Committee Member: Arkadi Nemirovski; Committee Member: Faiz Al-Khayyal; Committee Member: Guillermo H. Goldsztein; Committee Member: Joel Sokol. Part of the SMARTech Electronic Thesis and Dissertation Collection.
16
Santos, Ednaldo Sena dos. "Problemas de máximo e mínimo na geometria euclidiana /." Universidade Federal da Paraíba, 2013. http://tede.biblioteca.ufpb.br:8080/handle/tede/7390.
Full textAbstract:
Made available in DSpace on 2015-05-15T11:46:08Z (GMT). No. of bitstreams: 0
Previous issue date: 2013-08-27Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES
This work presents a research on problems of maxima and minima of the Euclidean geometry. Initially we present some preliminary results followed by statements that in essence use basic concepts of geometry. Below are some problems of maximizing area and minimizing perimeter of triangles and convex polygons, culminating in a proof of the isoperimetric inequality for polygons and review the general case. Solve some classical problems of geometry that are related to outliers and present other problems as proposed.
Este trabalho apresenta uma pesquisa sobre problemas de máximos e mínimos da Geometria Euclidiana. Inicialmente apresentamos alguns resultados preliminares seguidos de suas demonstrações que em sua essência usam conceitos básicos de geometria. Em seguida apresentamos alguns problemas de maximização de área e de minimização de perímetro em triângulos e polígonos convexos, culminando com uma prova da desigualdade isoperimétrica para polígonos e comentário do caso geral. Resolvemos alguns problemas clássicos de geometria que estão relacionados com valores extremos e apresentamos outros como problemas propostos.
17
Rochereuil, Katia. "Les accords bilatéraux de l'Union européenne." Thesis, Paris 5, 2013. http://www.theses.fr/2013PA05D001.
Full textAbstract:
La diversité des accords bilatéraux a constitué un moyen pour l'Union européenne d'étendre ses compétences externes. Cela rend compte du volontarisme mais surtout du pragmatisme de son action extérieure, ce qui n'est pas sans poser de problèmes.La mise en cohérence des accords bilatéraux devient alors une exigence impérieuse. Cette rationalisation des accords devra être confortée par un schéma institutionnel rénové autant que par la reformulation synthétique des fondements juridiques de la compétence externe de l'Union européenneThe different bilateral agreement is a tool for the European Union to wide its external competences. This illustrates it voluntarism but even more it pragmatism of it external action, what is not without raise problems.The harmonization of bilateral agreements is a very strong need. This rationalization should be hold by an institutional scheme and by a reformulation of legal basis
18
Grothe, Andre. "A maximus ad minima: The Internet and the state." Diss., Connect to online resource, 2005. http://wwwlib.umi.com/cr/colorado/fullcit?p1425797.
Full text
19
Whiston, Julius Yau. "The minimal generating sets of maximal size of selected groups." Thesis, University of Cambridge, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.621428.
Full text
20
Almeida, Maria Isabel Pereira Bezerra. "Uma proposta de oficina abordando metodos de otimizacao com o uso do software grafico Winplot." Universidade Federal de Goiás, 2014. http://repositorio.bc.ufg.br/tede/handle/tede/4707.
Full textAbstract:
Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2015-10-22T11:43:16Z
No. of bitstreams: 2
Dissertação - Maria Isabel Pereira Bezerra Almeida - 2014.pdf: 582154 bytes, checksum: 45944bf34da8b157f3aec7864ea90d4c (MD5)
license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2015-10-22T11:44:55Z (GMT) No. of bitstreams: 2 Dissertação - Maria Isabel Pereira Bezerra Almeida - 2014.pdf: 582154 bytes, checksum: 45944bf34da8b157f3aec7864ea90d4c (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)
Made available in DSpace on 2015-10-22T11:44:55Z (GMT). No. of bitstreams: 2 Dissertação - Maria Isabel Pereira Bezerra Almeida - 2014.pdf: 582154 bytes, checksum: 45944bf34da8b157f3aec7864ea90d4c (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2014-03-17
This work aims to provide high school teachers and Higher Education workshop optimization with the aid of WinPlotr program to encourage the study of mathematics and its applications . Optimization in mathematics is to study problems for maximization or minimization of functions with the choice of methods that lead to the great demand . Given this context , this work has the theme of a workshop with the help of optimization software WinPlotr and aims to encourage the student ’s third year of high school or the early years of Higher Education to want to know new methods of learning. Presents troubleshooters of Applied Mathematics with maximization or minimization . With the use of derivatives and the Bisection method , and the second method is often used in calculations of roots and was adapted for this work . It also offers all the methodological planning a workshop to be worked into eight classes dynamic , creative and with the proposal to encourage students to have a more robust and accurate knowledge fashion .
Este trabalho tem o objetivo de oferecer aos professores do Ensino Medio e do Ensino Superior uma oficina de otimizacao com o auxılio do programa WinPlotr destinado a incentivar o estudo da Matem´atica e suas aplicacoes. Otimizacao em matematica consiste em estudar problemas para maximiza¸c˜ao ou minimizacao de funcoes com a escolha de metodos que conduzam `a procura do otimo. Diante deste contexto, este trabalho tem como tema uma oficina de otimiza¸c˜ao com o auxılio do software WinPlotr e tem como objetivo incentivar o aluno do terceiro ano do Ensino Medio ou dos anos iniciais do Ensino Superior a querer conhecer novos metodos de aprendizagem. Apresenta resolucoes de problemas de Matem´atica Aplicada com maximiza¸c˜ao ou minimiza¸c˜ao. Com o uso de derivadas e pelo m´etodo da Bissec¸c˜ao, sendo que o segundo m´etodo ´e muito utilizado em calculos de raızes e foi adaptado para esse trabalho. Contempla ainda todo o planejamento metodologico de uma oficina para ser trabalhada em oito aulas de forma dinamica, criativa e com a proposta de estimular os alunos a terem um conhecimento mais solido e rigoroso.
21
McLaughlin, Christopher. "Assembly of 3D DNA architectures: towards minimal design and maximal function." Thesis, McGill University, 2013. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=117027.
Full textAbstract:
DNA serves as the essential biomacromolecule responsible for encoding, transmitting and expressing genetic information in all forms of life. However, when taken out of this biological role, the unique self-assembling properties, information rich content and easy means of chemical synthesis make DNA an ideal material for solving some of the challenging problems in chemical construction at the nanometer length scale. The emerging field of supramolecular DNA assembly presents chemical solutions to DNA construction, by synthetically modifying DNA with small molecules and supramolecular motifs. This thesis specifically examines how DNA building blocks modified with synthetic organic, inorganic and polymeric molecules can be designed to efficiently assemble into well-defined 3D structures. In part 1, a modular assembly strategy is developed whereby 2D DNA triangles are efficiently prepared and connected to create the first triangular prismatic structure that can be site-specifically coordinated with transition metals. In part 2, selective introduction of sequence symmetry is utilized to both simplify design and generate an expanded set of 3D DNA geometries in a mild, facile and high yield manner. In parts 3 and 4, a 3D DNA construction method that assembles a minimum number of DNA strands in near quantitative yield, to give a scaffold with a large number of single-stranded arms, is introduced. As demonstrated in part 3, site-specific hybridization of DNA-polymer conjugates to the single-stranded arms of this 3D-DNA scaffold gives efficient access to nanostructured DNA-block copolymer cages with enhanced nuclease resistance. In part 4, it is demonstrated that unfunctionalized 3D DNA cubes efficiently accumulate in the cytoplasm of human cervical cancer cells (HeLa) without the aid of any transfection agent. Collectively, this work develops 'DNA-economic' strategies to assemble 3D DNA structures in a facile manner and excellent yield. These assembly methods lay the foundation for fundamental assessment and future integration of 3D DNA structures as cellular probes or drug delivery tools and as a means to help solve some of the challenges facing researchers in biophysics and nanoscience.L'ADN est une biomacromolécule essentielle qui sert à encoder, transmettre et exprimer l'information génétique contenue dans toutes les formes de vie. Toutefois, al'extérieur de ce contexte biologique, les propriétés uniques d'auto-assemblage, le contenu riche en information et les méthodes de synthèse chimique simples qui sont associées à l'ADN en font un matériau idéal pour résoudre certains des grands défis dans la construction à l'échelle nanométrique. Le domaine émergent de l'assemblage supramoléculaire de l'ADN présente des solutions chimiques pour la construction de nanostructures au moyen de l'ADN, en modifiant celui-ci synthétiquement avec des molécules organiques et des motifs supramoléculaires. Cette thèse examine spécifiquement comment des blocs de construction d'ADN modifiés avec des molécules synthétiques organiques, inorganiques et des polymères peuvent être conçus pour s'assembler en structures 3D bien définies et de manière efficace. Dans la 1e partie, une stratégie d'assemblage modulaire est développée. Celle-ci permet de relier des triangles d'ADN bidimensionnels préparés de façon efficace pour créer la première structure prismatique triangulaire en 3D qui peut être coordonnée en des lieux spécifiques avec des métaux de transition. Dans la 2e partie, l'introduction sélective de symétrie dans les séquences est utilisée pour à la fois simplifier la conception et pour générer un ensemble élargi de géométries d'ADN en 3D d'une manière simple et haute en rendement. Dans les 3e et 4e parties, une méthode de construction d'ADN en 3D qui assemble un nombre minimal de brins dans un rendement presque quantitatif pour donner une structure comportant un grand nombre de sections en ADN simple-brin est introduite. Comme démontré dans la 3e partie, l'hybridation spécifique de conjugués d'ADN-polymère aux sections en simple-brin de cet échafaudage d'ADN tridimensionnel permet l'assemblage efficace de cages nanostructurées d'ADN-copolymère séquencé avec une résistance améliorée aux nucléases. Dans la 4e partie, il est démontré que des cubes d'ADN en 3D non- fonctionnalisés s'accumulent efficacement dans le cytoplasme de cellules humaines du cancer du col de l'utérus (HeLa) sans l'aide d'un agent de transfection. Collectivement, ce travail développe des stratégies «économiques en ADN» pour assembler des structures d'ADN en 3D d'une manière simple et avec un excellent rendement. Ces méthodes d'assemblage jettent les bases pour l'évaluation fondamentale et l'intégration future de structures d'ADN en 3D en tant que sondes cellulaires, outils d'administration de médicaments et moyens pour aider à résoudre certains des défis auxquels sont confrontés les chercheurs en biophysique et nanosciences.
22
BRUNO, GIOVANNA. "QUANTUM OBSERVABLES OF OPEN-SHELL SYSTEMS. A THEORETICAL STUDY." Doctoral thesis, Università degli Studi di Milano, 2022. http://hdl.handle.net/2434/936434.
Full textAbstract:
This PhD thesis reports original research results concerning the development of theoretical models and computational protocols for the quantification and analysis of two of the most important quantum observables of open-shell systems: the electron spin density and the phosphorescence energy gap. In the first part, a comprehensive theory of the electron spin density topology
is proposed for the first time [1]. Several new notions (spin density critical points, molecular spin graphs, spin density basins, spin maxima and spin minima joining paths etc.) and descriptors (local and integral spin polarization indeces, basin average spin density etc.) are introduced. This analysis reveals that the spin density topology, based on precise mathematical notions, can unveil precious information on the physical structure of spin-polarized systems. In particular, it enables to describe and quantify spin polarization and delocalization mechanisms and, at the same time, to evaluate the dependence of spin density distributions on the adopted level of theory. In the second part instead, the performance of the domain-based local pair natural orbital (DLPNO) variant of the “gold standard” CCSD(T) method for the prediction of phosphorescence energies of aromatic chromophores is investigated for the first time [2]. An extensive analysis of both accuracy and computational cost of the main parameters of the method (basis set, triples correction approximation, dimension of PNOs space) is conducted. Two procedures, the Gold DLPNO-CCSD(T) aimed at maximizing the accuracy and the Silver DLPNO-CCSD(T) aimed at minimizing the computational cost, which result in an excellent agreement with experimental data, are proposed.
1. G. Bruno, G. Macetti, L. Lo Presti and C. Gatti, “Spin Density Topology,” Molecules, 25, 3537, 2020.
2. G. Bruno, B. de Souza, F. Neese, and G. Bistoni, “Can domain-based local pair natural orbitals approaches accurately predict phosphorescence energies?,” Phys. Chem. Chem. Phys., 24, 14228–14241, 2022.
23
Barrera-Gonzalez, Claudia Patricia. "Variable swing optimal parallel links minimal power, maximal density for parallel links /." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 120 p, 2009. http://proquest.umi.com/pqdweb?did=1818417501&sid=11&Fmt=2&clientId=8331&RQT=309&VName=PQD.
Full text
24
Zavodny, Madeline. "The minimum wage : maximum controversy over a minimal effect?" Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/10843.
Full text
25
Defrain, Oscar. "On the dualization problem in graphs, hypergraphs, and lattices." Thesis, Université Clermont Auvergne (2017-2020), 2020. http://www.theses.fr/2020CLFAC022.
Full textAbstract:
Cette thèse porte sur la théorie des graphes, des hypergraphes, et des treillis. Nous nous intéressons à la complexité du problème de dualisation des fonctions monotones Booléennes, ainsi qu’à ses généralisations, à travers les différentes formes qu’il prend dans ces structures: énumération des dominants minimaux, des transversaux minimaux, dualisation dans les treillis, et énumération des éléments meet-irréductibles. De nouveaux résultats positifs et négatifs sont obtenus, et des directions de recherche futures sont proposées. La thèse se découpe comme suit. Dans une première partie, nous nous intéressons à l’énumération des dominants minimaux dans les graphes. Nous obtenons de nouveaux algorithmes output-polynomiaux dans les graphes sans grande clique, et dans d’autres classes de graphes liées aux ordres partiels de dimension bornée. Dans une seconde partie, nous nous intéressons aux généralisations de ce problème dans les treillis. Une première généralisation concerne la dualisation dans les treillis donnés par une base d’implications, l’autre concerne l’énumération des éléments meet-irréductibles. Des résultats positifs et négatifs sont obtenus sous plusieurs contraintes concernant la largeur, l’acyclicité, et la taille des prémisses dans la base d’implication. Les deux parties de la thèse sont parsemées d’énumération des transversaux minimaux d’un hypergraphe, et de notions liéesThis thesis focuses on graphs, hypergraphs, and lattices. We study the complexity of the dualization of monotone Boolean functions, and its generalizations, through the many shapes it takes on these structures: minimal dominating sets enumeration, minimal transversals enumeration, lattice dualization, and meet-irreducible enumeration. Both tractable and intractable results are obtained, and future research directions are proposed. The thesis is organized as follows. A first part is devoted to the enumeration of minimal dominating sets in graphs. We obtain new output-polynomial time algorithms in graph classes related to Kt-free graphs and to posets of bounded dimension. A second part is devoted to generalizations of this problem in lattices. One generalization concerns the dualization in lattices given by implicational bases, the other deals with the enumeration of meet-irreducible elements. Both tractability and intractability results are obtained under various restrictions concerning width, acyclicity, and premises’ size in the implicational base. The two parts are sprinkled with hypergraph transversals enumeration and related notions
26
Altner, Douglas S. "Advancements on problems involving maximum flows." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/24828.
Full textAbstract:
Thesis (Ph.D.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2008.Committee Chair: Ozlem Ergun; Committee Member: Dana Randall; Committee Member: Joel Sokol; Committee Member: Shabbir Ahmed; Committee Member: William Cook.
27
Balkey, Matthew M. "Optimization of a helicon plasma source for maximum density with minimal ion heating." Morgantown, W. Va. : [West Virginia University Libraries], 2000. http://etd.wvu.edu/templates/showETD.cfm?recnum=1686.
Full textAbstract:
Thesis (Ph. D.)--West Virginia University, 2000.Title from document title page. Document formatted into pages; contains v, 127 p. : ill. (some col.). Vita. Includes abstract. Includes bibliographical references (p. 94-98).
28
Taylor, Kevin. "EXAMINING MINIMUM BETS’ INFLUENCE ON THE ACTUAL BET WAGERED ON FIXED LINE SLOT MACHINES: A DESCRIPTIVE ANALYSIS." OpenSIUC, 2016. https://opensiuc.lib.siu.edu/theses/1851.
Full textAbstract:
A descriptive analysis was conducted to examine the influence minimum bets 30 credits and 50 credits had on the actual bets wagered on slot machines that operated on fixed-lines. Results suggested that slots with the lower minimum bets correlated with higher wagers. There was a total of 107 participants actively gambling at two casinos located just outside of Chicago, Illinois. The participant pool was divided between 37 males and 70 females. On average, the participants who played the slot machines with a minimum bet of 30 credits actually bet more than the participants who played the slot machines with a minimum bet of 50 credits. More notably, results from a Chi-square test for significance suggested that there is a significant influence between the minimum bet required to play and the presence, or absence, of “minimizers” and “maximizers” (p <.05). Additional data analyses where also conducted that examined gender’s role and wagering tendencies, including an independent t-test. The main purpose of this paper was to examine minimizing and maximizing gambling behavior across low-value and higher-value machines.
29
Théret, Marie. "Grandes déviations pour le flux maximal en percolation de premier passage." Paris 11, 2009. http://www.theses.fr/2009PA112070.
Full textAbstract:
Le sujet de cette thèse est l'étude du flux maximal en percolation de premier passage dans le graphe Zd pour d ≥ 2. Dans les trois premières parties de la thèse nous nous intéressons au flux maximal Φ entre le sommet et la base d'un cylindre et au flux maximal τ entre le bord du demi-cylindre supérieur et le bord du demi-cylindre inférieur. Une loi des grands nombres est connue pour τ quand les dimensions du cylindre tendent vers l'infini, et elle se généralise facilement à Φ dans le cas des cylindres très plats. Concernant Φ dans des cylindres droits, une loi des grands nombres beaucoup plus difficile à établir a été prouvée par Kesten en 1987, et améliorée par Zhang en 2007. Dans la première partie de cette thèse nous montrons que les grandes déviations par au-dessus de τ et Φ dans les cas cités précédemment sont d'ordre volumique. Nous obtenons de plus le principe de grande déviation correspondant pour Φ dans des cylindres droits. Dans la deuxième partie de la thèse nous prouvons que les grandes déviations par en-dessous de τ et Φ dans les mêmes cas sont d'ordre surfacique, et nous montrons les principes de grande déviation correspondant. Dans la troisième partie nous considérons le cas de la dimension deux, dans lequel nous généralisons la loi des grands nombres, le principe de grande déviation par en-dessous et l'étude de l'ordre des déviations supérieures à la variable Φ dans des cylindres inclinés. La quatrième partie de la thèse est consacrée à l'étude du flux maximal à travers un domaine connexe de Rd dont les dimensions tendent vers l'infini à la même vitesse dans toutes les directions. Nous prouvons une loi des grands nombres pour ce flux, et nous montrons que ses déviations supérieures sont d'ordre volumique tandis que ses déviations inférieures sont d'ordre surfacique. Ce résultat s'applique en particulier aux cylindres penchés dont les dimensions grandissent de manière isotrope, et généralise donc la loi des grands nombres pour Φ prouvée par Kesten dans le cas des cylindres droitsThe object of this thesis is the study of the maximal flow in first passage percolation on the graph Zd for d ≥ 2. Ln the first three parts of the thesis, we are interested in the maximal flow Φ between the top and the bottom of a cylinder and in the maximal flow τ between the boundary of the upper half cylinder and the boundary of the lower half cylinder. A law of large numbers is known for τ when the dimensions of the cylinders go to infinity, and it can be easily extended to Φ in very flat cylinders. As concerns Φ in straight cylinders, a law of large numbers much more difficult to establish has been proved by Kesten in 1987, and improved by Zhang in 2007. Ln the first part of this thesis, we prove that the upper large deviations for τ and Φ in the cases cited above are of volume order. Moreover we obtain the corresponding large deviation principle for Φ in straight cylinders. Ln the second part of the thesis, we show that the lower large deviations of τ and Φ in the same cases are of surface order, and we prove the corresponding large deviation principles. Ln the third part, we consider the case of the dimension two, in which we generalize the law of large numbers, the lower large deviation principle and the study of the order of the upper large deviations to the variable Φ in tilted cylinders. The fourth part of the thesis is devoted to the study of the maximal flow through a connected domain of Rd whose dimensions go to infinity at the same speed in every direction. We prove a law of large numbers for this flow, and we show that its upper large deviations are of volume order whereas its lower large deviations are of surface order. Ln particular, this result applies to tilted cylinders whose dimensions grow isotropically, and hence extends the law of large numbers for Φ proved by Kesten in the case of straight cylinders
30
Bhaduri, Sudipta. "Finding A Maximum Clique of A Chordal Graph by Removing Vertices of Minimum Degree." Kent State University / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=kent1208869783.
Full text
31
Williams, Ian E. "Channel Equalization and Spatial Diversity for Aeronautical Telemetry Applications." International Foundation for Telemetering, 2010. http://hdl.handle.net/10150/605946.
Full textAbstract:
ITC/USA 2010 Conference Proceedings / The Forty-Sixth Annual International Telemetering Conference and Technical Exhibition / October 25-28, 2010 / Town and Country Resort & Convention Center, San Diego, CaliforniaThis work explores aeronautical telemetry communication performance with the SOQPSK- TG ARTM waveforms when frequency-selective multipath corrupts received information symbols. A multi-antenna equalization scheme is presented where each antenna's unique multipath channel is equalized using a pilot-aided optimal linear minimum mean-square error filter. Following independent channel equalization, a maximal ratio combining technique is used to generate a single receiver output for detection. This multi-antenna equalization process is shown to improve detection performance over maximal ratio combining alone.
32
Dembin, Barbara. "Percolation and first passage percolation : isoperimetric, time and flow constants." Thesis, Université de Paris (2019-....), 2020. http://www.theses.fr/2020UNIP7023.
Full textAbstract:
Dans cette thèse, nous étudions les modèles de percolation et percolation de premier passage dans le graphe Zd, d≥2. Dans une première partie, nous étudions les propriétés d'isopérimétrie du cluster infini Cp de percolation pour p>pc. Conditionnons par l'événement 0 appartient à Cp, la constante isopérimétrique ancrée φp(n)correspond à l'infimum sur l'ensemble des sous-graphes connectés de Cp, contenant 0 et de volume inférieur à nd, du ratio entre la taille du bord et le volume. Nous montrons la convergence lorsque n tend vers l'infini de nφp(n) vers une constante déterministe φp qui est solution d'un problème isopérimétrique anisotrope continu. Nous étudions également le comportement de la constante isopérimétrique ancrée en pc, ainsi que la régularité de φp en p pour p>pc. Dans une deuxième partie, nous considérons une première interprétation du modèle de percolation de premier passage où chaque arête du graphe est munie indépendamment d'un temps de passage aléatoire distribué selon une loi G. La percolation de premier passage modélise des phénomènes de propagation, par exemple la propagation de l’eau dans une roche poreuse. Une loi des grands nombres est connue : pour chaque direction x, on peut définir une constante de temps µG(x) qui correspond à l'inverse de la vitesse asymptotique de propagation dans la direction x. Nous étudions les propriétés de régularité de µG en G. En particulier, nous étudions comment la distance de graphe dans Cp évolue avec p. Dans une troisième partie, nous considérons une deuxième interprétation du modèle de percolation de premier passage où chaque arête du graphe est muni indépendamment d'une capacité aléatoire distribuée selon une loi G. La capacité d'une arête est la quantité maximale d'eau qui peut circuler dans l'arête par seconde. Pour v un vecteur unitaire, une loi des grands nombres existe : on peut définir la constante de flux dans la direction v comme étant le débit asymptotique maximal d'eau qui peut être envoyé dans la direction v par unité de surface. Nous montrons une loi des grands nombres pour le débit maximal d'eau qu'une source convexe compacte peut envoyer à l'infini. Le problème dual du flux maximal est celui des surfaces de coupures de capacité minimale, il s'agit d'ensembles d'arêtes séparant les sources des puits qui limitent la transmission du flux en agissant comme un goulot d'étranglement ; toutes leurs arêtes sont saturées. Dans le cas particulier où G({0})>1-pc, nous montrons une loi des grands nombres pour la taille des surfaces de coupure minimale liées au flux maximal dans un cylindre plat où le haut et le bas du cylindre correspondent respectivement à la source et au puitsIn this thesis, we study the models of percolation and first passage percolation on the graph Zd, d≥2. In a first part, we study isoperimetric properties of the infinite cluster Cp of percolation of parameter p>pc. Conditioning on the event that 0 belongs to Cp, the anchored isoperimetric constant φp(n) corresponds to the infimum over all connected subgraph of Cp containing 0 of size at most nd, of the boundary size to volume ratio. We prove that n φp (n) converges when n goes to infinity towards a deterministic constant φp, which is the solution of an anisotropic isoperimetric problem in the continuous setting. We also study the behavior of the anchored isoperimetric constant at pc, and the regularity of the φp in p for p>pc. In a second part, we study a first interpretation of the first passage percolation model where to each edge of the graph, we assign independently a random passage time distributed according to a given law G. This interpretation of first passage percolation models propagation phenomenon such as the propagation of water in a porous medium. A law of large numbers is known: for any given direction x, we can define a time constant µG(x) that corresponds to the inverse of the asymptotic propagation speed in the direction x. We study the regularity properties of the µG in G. In particular, we study how the graph distance in Cp evolves with p. In a third part, we consider a second interpretation of the first passage percolation model where to each edge we assign independently a random capacity distributed according to a given law G. The capacity of G edge is the maximal amount of water that can cross the edge per second. For a given vector v of unit norm, a law of large numbers is known: we can define the flow constant in the direction v as the asymptotic maximal amount of water that can flow per second in the direction v per unit of surface. We prove a law of large numbers for the maximal flow from a compact convex source to infinity. The problem of maximal flow is dual to the problem of finding minimal cutset. A minimal cutset is a set of edges separating the sinks from the sources that limits the flow propagation by acting as a bottleneck: all its edges are saturated. In the special case where G({0})>1-pc, we prove a law of large numbers for the size of minimal cutsets associated with the maximal flow in a flat cylinder, where its top and bottom correspond respectively to the source and the sink
33
Kaaouachi, Mohamed Hamza. "Une approche distribuée pour les problèmes de couverture dans les systèmes hautement dynamiques." Thesis, Paris 6, 2016. http://www.theses.fr/2016PA066058/document.
Full textAbstract:
Un système distribué est un système composé d'éléments de calcul autonomes dotés de capacité de communication. Il s'agit d'un modèle commun pour l'étude des réseaux. L'évolution rapide des réseaux sans fils et/ou mobiles aussi bien dans la vie quotidienne que dans la recherche amène progressivement à intégrer la dynamique (i.e. l'évolution dans le temps de la connectivité) dans les systèmes distribués. Concrètement, cela revient à ajouter l'hypothèse que les capacités de communication des éléments du système peuvent varier dans le temps. De nombreux modèles considèrent ainsi la dynamique comme composante à part entière du système (et non pas comme une faute). De manière récente, une nouvelle approche, appelée graphe variant dans le temps, tente d'unifier tous ces modèles dans un formalisme commun qui permet de classifier les systèmes en fonction de leurs propriétés de connexité temporelle. Dans cette thèse, nous nous intéressons à des systèmes distribués hautement dynamiques dans lesquels les hypothèses de connexité sont minimalistes. Plus précisément, nous concentrons nos efforts sur les systèmes connexes à travers le temps dans lesquels la seule garantie est que tout élément du système peut infiniment souvent envoyer un message à tout autre (sans garantie sur la pérennité de la route utilisée ni sur le délai de communication). Nous nous intéressons plus particulièrement aux problèmes de couverture (par exemple, ensemble dominant minimal, couplage maximal, ensemble indépendant maximal, ...) dans ces systèmes distribués hautement dynamiques. Les contributions de cette thèse dans ce contexte sont les suivantes. Nous proposons tout d'abord une nouvelle définition pour les problèmes de couverture qui est plus adaptée aux systèmes distribués hautement dynamiques que les définitions existantes. Dans un deuxième temps, nous fournissons un outil générique qui permet de faciliter les preuves de résultats d'impossibilité dans les systèmes distribués dynamiques. Nous appliquons cet outil pour prouver plusieurs résultats d'impossibilité à propos de problèmes de couverture. Ensuite, nous proposons une nouvelle mesure de complexité en temps qui permet de comparer équitablement les performances de protocoles dans les systèmes distribués dynamiques. Enfin, nous donnons un algorithme de construction d'un ensemble dominant minimal dans les systèmes distribués hautement dynamiquesA distributed system is a system of autonomous computing components endowed with communication abilities. This is a common model for the study of networks. The quick evolution of wireless and mobile network both in everyday life and in research gradually leads to take in account the dynamics (i.e. the evolution over time) in distributed systems. Concretely, this means to add the assumption that the communication abilities of the components of the system may vary over time. Many models consider the dynamics as an integral component of the system (and not as a fault). Recently, a new approach, called time-varying graph, attempts to unify all these models in a common formalism which allows the classification systems based on their temporal connectivity properties. In this thesis, we are interested in highly dynamic distributed systems with minimal connectivity assumptions. Specifically, we focus on connected over time systems where the only guarantee is that any element of the system can infinitely often send a message to any other (no guarantee are provided on the sustainability of the used path nor on the time communication). We are particularly interested in covering problems (e.g., minimal dominanting set, maximal matching, maximal independent set, ...) in these highly dynamic distributed systems. The contributions of this thesis in this context are as follows. We first propose a new definition for the covering problems which is more suited to highly dynamic distributed systems that the existing definitions. Secondly, we provide a generic tool to simplify proof of impossibility results in dynamic distributed systems. We use this tool to prove some impossibility results of covering problems. Then, we propose a new time complexity measure to fairly compare the algorithms performance in dynamic distributed systems. Finally, we give an algorithm that compute a minimal dominating set in highly dynamic distributed systems
34
Junqueira, Hadura Albano Alexandre Luiz. "Polynomial growth of concept lattices, canonical bases and generators:." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-226980.
Full textAbstract:
We prove that there exist three distinct, comprehensive classes of (formal) contexts with polynomially many concepts. Namely: contexts which are nowhere dense, of bounded breadth or highly convex. Already present in G. Birkhoff's classic monograph is the notion of breadth of a lattice; it equals the number of atoms of a largest boolean suborder. Even though it is natural to define the breadth of a context as being that of its concept lattice, this idea had not been exploited before. We do this and establish many equivalences. Amongst them, it is shown that the breadth of a context equals the size of its largest minimal generator, its largest contranominal-scale subcontext, as well as the Vapnik-Chervonenkis dimension of both its system of extents and of intents. The polynomiality of the aforementioned classes is proven via upper bounds (also known as majorants) for the number of maximal bipartite cliques in bipartite graphs. These are results obtained by various authors in the last decades. The fact that they yield statements about formal contexts is a reward for investigating how two established fields interact, specifically Formal Concept Analysis (FCA) and graph theory.
We improve considerably the breadth bound. Such improvement is twofold: besides giving a much tighter expression, we prove that it limits the number of minimal generators. This is strictly more general than upper bounding the quantity of concepts. Indeed, it automatically implies a bound on these, as well as on the number of proper premises. A corollary is that this improved result is a bound for the number of implications in the canonical basis too. With respect to the quantity of concepts, this sharper majorant is shown to be best possible. Such fact is established by constructing contexts whose concept lattices exhibit exactly that many elements. These structures are termed, respectively, extremal contexts and extremal lattices. The usual procedure of taking the standard context allows one to work interchangeably with either one of these two extremal structures.
Extremal lattices are equivalently defined as finite lattices which have as many elements as possible, under the condition that they obey two upper limits: one for its number of join-irreducibles, other for its breadth. Subsequently, these structures are characterized in two ways. Our first characterization is done using the lattice perspective. Initially, we construct extremal lattices by the iterated operation of finding smaller, extremal subsemilattices and duplicating their elements. Then, it is shown that every extremal lattice must be obtained through a recursive application of this construction principle. A byproduct of this contribution is that extremal lattices are always meet-distributive. Despite the fact that this approach is revealing, the vicinity of its findings contains unanswered combinatorial questions which are relevant. Most notably, the number of meet-irreducibles of extremal lattices escapes from control when this construction is conducted.
Aiming to get a grip on the number of meet-irreducibles, we succeed at proving an alternative characterization of these structures. This second approach is based on implication logic, and exposes an interesting link between number of proper premises, pseudo-extents and concepts. A guiding idea in this scenario is to use implications to construct lattices. It turns out that constructing extremal structures with this method is simpler, in the sense that a recursive application of the construction principle is not needed. Moreover, we obtain with ease a general, explicit formula for the Whitney numbers of extremal lattices. This reveals that they are unimodal, too. Like the first, this second construction method is shown to be characteristic. A particular case of the construction is able to force - with precision - a high number of (in the sense of "exponentially many'') meet-irreducibles.
Such occasional explosion of meet-irreducibles motivates a generalization of the notion of extremal lattices. This is done by means of considering a more refined partition of the class of all finite lattices. In this finer-grained setting, each extremal class consists of lattices with bounded breadth, number of join irreducibles and meet-irreducibles as well. The generalized problem of finding the maximum number of concepts reveals itself to be challenging. Instead of attempting to classify these structures completely, we pose questions inspired by Turán's seminal result in extremal combinatorics. Most prominently: do extremal lattices (in this more general sense) have the maximum permitted breadth?
We show a general statement in this setting: for every choice of limits (breadth, number of join-irreducibles and meet-irreducibles), we produce some extremal lattice with the maximum permitted breadth. The tools which underpin all the intuitions in this scenario are hypergraphs and exact set covers. In a rather unexpected, but interesting turn of events, we obtain for free a simple and interesting theorem about the general existence of "rich'' subcontexts. Precisely: every context contains an object/attribute pair which, after removed, results in a context with at least half the original number of concepts.
35
Montealegre, Barba Pedro. "Algorithmes de graphes séquentiels et distribués : algorithmes paramétrés via des cliques maximales potentielles : modèle de diffusion dans une clique congestionnée." Thesis, Orléans, 2017. http://www.theses.fr/2017ORLE2001/document.
Full textAbstract:
Cette thèse porte sur des aspects structuraux et algorithmiques des graphes. Elle est divisée en deux parties, qui comportent deux études différentes : une partie sur des algorithmes centralisés-séquentiels, et une autre sur des algorithmes distribués. Dans la première partie, on étudie des aspects algorithmiques de deux structures de graphes appelés séparateurs minimaux et cliques maximales potentielles. Ces deux objets sont au coeur d'un méta-théorème dû à Fomin, Todinca and Villanger (SIAM J. Comput. 2015), qui affirme qu'une grande famille des problèmes d'optimisation peut être résolue en temps polynomial, si le graphe d'entrée contient un nombre polynomial de séparateurs minimaux. La contribution de cette partie consiste à prolonger le méta-théorème de Fomin et al. de deux manières : d'un côté, on l'adapte pour qu'il soit valide pour une plus grande famille des problèmes ; de l'autre, on étend ces résultats à des version paramétrées, pour certains paramètres des graphes. La deuxième partie de la thèse correspond à une étude du modèle appelé « Diffusion dans une Clique Congestionnée ». Dans ce modèle, les sommets d'un graphe communiquent entre eux dans des rondes synchrones, en diffusant un message de petite taille, visible par tout autre sommet. L'objectif ici est d'élaborer des protocoles qui reconnaissent des classes de graphes, en minimisant la taille des messages et le nombre de rondes. La contribution de cette partie est l'étude du rôle du hasard dans ce modèle, et la conception de protocoles pour la reconnaissance et la reconstruction des certaines classes des graphesThis thesis is about structural and algorithmic aspects of graphs. It is divided in two parts, which are about two different studies: one part is about centralized-sequential algorithms, and the other part is about distributed algorithms. In the first part of the thesis we study algorithmic applications of two graph structures called minimal separators and potential maximal cliques. These two objects are in the core of a meta-theorem due to Fomin, Todinca and Villanger (SIAM J. Comput. 2015), which states that a large family of graph optimization problems can be solved in polynomial time, when the input is restricted to the family of graphs with polynomially many minimal separators. The contribution of this part of the thesis is to extend the meta-theorem of Fomin et al. in two ways. On one hand, we adapt it to be valid into a larger family of problems. On the other hand, we extend it into a parameterized version, for several graph parameters. In the second part of this thesis we study the broadcast congested clique model. In this model, the nodes of a graph communicate in synchronous rounds, broadcasting a message of small size visible to every other node. The goal is to design protocols that recognize graph classes minimizing the number of rounds and the message sizes. The contribution of this part is to explore the role of randomness on this model, and provide protocols for the recognition and reconstruction of some graph classes
36
Drėzas, Mindaugas. "Vienmačių skirstinių N stabilumo tyrimas." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2011. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2011~D_20110901_162403-90214.
Full textAbstract:
Šis magistro darbas yra skirtas stochastinių ekstremumų stabilumo uždavinių sprendimui. Šiame darbe yra atlikta N stabilumo analizė, kai N yra pasiskirstęs pagal geometrinį, Sibuya ir Harris dėsnius. Taip pat yra paskaičiuotas konvergavimo greitis maksimumams ir atlikta konvergavimo greičio kompiuterinė analizė. Gautais rezultatais mes patvirtinome jau žinomą faktą, kad geometrinis N maks stabilumas ir N min stabilumas yra vienas kitą sąlygojantys. Taip pat gavome ir įrodėme naujus rezultatus, jog Sibuya ir Harris N maks ir N min stabilumai nėra vienas kitą sąlygojantys.This master’s work is dedicated to solution of the stochastic extremums stability problems. In this work the analysis of N stability is done then N is distributed by geometrical, Sibuya and Harris laws. The convergence rate for maximums was constructed and also computerized analysis of results was done. In accordance with the main results, we confirmed the known fact that geometrical N max stability and N min stability are influencing each other. Also we obtained and proved new results, that Sibuya and Harris N max stability and N min stability are not influencing each other.
37
Koyuncu, Selcuk. "Rational Realizations of the Minimum Rank of a Sign Pattern Matrix." Digital Archive @ GSU, 2006. http://digitalarchive.gsu.edu/math_theses/5.
Full textAbstract:
A sign pattern matrix is a matrix whose entries are from the set {+,-,0}. The minimum rank of a sign pattern matrix A is the minimum of the rank of the real matrices whose entries have signs equal to the corresponding entries of A. It is conjectured that the minimum rank of every sign pattern matrix can be realized by a rational matrix. The equivalence of this conjecture to several seemingly unrelated statements are established. For some special cases, such as when A is entrywise nonzero, or the minimum rank of A is at most 2, or the minimum rank of A is at least n - 1,(where A is mxn), the conjecture is shown to hold.Connections between this conjecture and the existence of positive rational solutions of certain systems of homogeneous quadratic polynomial equations with each coefficient equal to either -1 or 1 are explored. Sign patterns that almost require unique rank are also investigated.
38
Squintu, Antonello Angelo. "Daily temperature trends in Trentino Alto Adige over the last century." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/8310/.
Full textAbstract:
Numerosi lavori apparsi sulla letteratura scientifica negli ultimi decenni hanno evidenziato come, dall’inizio del XX secolo, la temperatura media globale sia aumentata. Tale fenomeno si è fatto più evidente dagli anni ’80, infatti ognuno degli ultimi tre decenni risulta più caldo dei precedenti. L’Europa e l’area mediterranea sono fra le regioni in cui il riscaldamento risulta più marcato, soprattutto per le temperature massime (dal 1951 sono cresciute di +0.39 °C per decennio) che hanno mostrato trend maggiori delle minime. Questo comportamento è stato osservato anche a scala nazionale (+0.25°C/dec per le massime e +0.20°C/dec per le minime). Accanto all’aumento dei valori medi è stato osservato un aumento (diminuzione) degli eventi di caldo (freddo) estremo, studiati attraverso la definizione di alcuni indici basati sui percentili delle distribuzioni. Resta aperto il dibattito su quali siano le cause delle variazioni negli eventi estremi: se le variazioni siano da attribuire unicamente ad un cambiamento nei valori medi, quindi ad uno shift rigido della distribuzione, o se parte del segnale sia dovuto ad una variazione nella forma della stessa, con un conseguente cambiamento nella variabilità. In questo contesto si inserisce la presente tesi con l’obiettivo di studiare l’andamento delle temperature giornaliere sul Trentino-Alto-Adige a partire dal 1926, ricercando cambiamenti nella media e negli eventi estremi in due fasce altimetriche. I valori medi delle temperature massime e minime hanno mostrato un evidente riscaldamento sull’intero periodo specialmente per le massime a bassa quota (`0.13 ̆ 0.03 °C/dec), con valori più alti per la primavera (`0.22 ̆ 0.05 °C/dec) e l’estate (`0.17 ̆ 0.05 °C/dec). Questi trends sono maggiori dopo il 1980 e non significativi in precedenza. L’andamento del numero di giorni con temperature al di sopra e al di sotto delle soglie dei percentili più estremi (stimate sull’intero periodo) indica un chiaro aumento degli estremi caldi, con valori più alti per le massime ad alta quota ( fino a +26.8% per il 99-esimo percentile) e una diminuzione degli estremi freddi (fino a -8.5% per il primo percentile delle minime a bassa quota). Inoltre, stimando anno per anno le soglie di un set di percentili e confrontando i loro trend con quelli della mediana, si è osservato, unicamente per le massime, un trend non uniforme verso temperature più alte, con i percentili più bassi (alti) caratterizzati da trend inferiori (superiori) rispetto a quello della mediana, suggerendo un allargamento della PDF.
39
Islam, Mohammad Mafijul. "Dose-Response Analysis for Time-Dependent Efficacy." Bowling Green State University / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1467295354.
Full text
40
Owens, Kayla Denise. "Properties of the Zero Forcing Number." BYU ScholarsArchive, 2009. https://scholarsarchive.byu.edu/etd/2216.
Full textAbstract:
The zero forcing number is a graph parameter first introduced as a tool for solving the minimum rank problem, which is: Given a simple, undirected graph G, and a field F, let S(F,G) denote the set of all symmetric matrices A=[a_{ij}] with entries in F such that a_{ij} doess not equal 0 if and only if ij is an edge in G. Find the minimum possible rank of a matrix in S(F,G). It is known that the zero forcing number Z(G) provides an upper bound for the maximum nullity of a graph. I investigate properties of the zero forcing number, including its behavior under various graph operations.
41
Abtini, Mona. "Plans prédictifs à taille fixe et séquentiels pour le krigeage." Thesis, Lyon, 2018. http://www.theses.fr/2018LYSEC019/document.
Full textAbstract:
La simulation numérique est devenue une alternative à l’expérimentation réelle pour étudier des phénomènes physiques. Cependant, les phénomènes complexes requièrent en général un nombre important de simulations, chaque simulation étant très coûteuse en temps de calcul. Une approche basée sur la théorie des plans d’expériences est souvent utilisée en vue de réduire ce coût de calcul. Elle consiste à partir d’un nombre réduit de simulations, organisées selon un plan d’expériences numériques, à construire un modèle d’approximation souvent appelé métamodèle, alors beaucoup plus rapide à évaluer que le code lui-même. Traditionnellement, les plans utilisés sont des plans de type Space-Filling Design (SFD). La première partie de la thèse concerne la construction de plans d’expériences SFD à taille fixe adaptés à l’identification d’un modèle de krigeage car le krigeage est un des métamodèles les plus populaires. Nous étudions l’impact de la contrainte Hypercube Latin (qui est le type de plans les plus utilisés en pratique avec le modèle de krigeage) sur des plans maximin-optimaux. Nous montrons que cette contrainte largement utilisée en pratique est bénéfique quand le nombre de points est peu élevé car elle atténue les défauts de la configuration maximin-optimal (majorité des points du plan aux bords du domaine). Un critère d’uniformité appelé discrépance radiale est proposé dans le but d’étudier l’uniformité des points selon leur position par rapport aux bords du domaine. Ensuite, nous introduisons un proxy pour le plan minimax-optimal qui est le plan le plus proche du plan IMSE (plan adapté à la prédiction par krigeage) et qui est coûteux en temps de calcul, ce proxy est basé sur les plans maximin-optimaux. Enfin, nous présentons une procédure bien réglée de l’optimisation par recuit simulé pour trouver les plans maximin-optimaux. Il s’agit ici de réduire au plus la probabilité de tomber dans un optimum local. La deuxième partie de la thèse porte sur un problème légèrement différent. Si un plan est construit de sorte à être SFD pour N points, il n’y a aucune garantie qu’un sous-plan à n points (n 6 N) soit SFD. Or en pratique le plan peut être arrêté avant sa réalisation complète. La deuxième partie est donc dédiée au développement de méthodes de planification séquentielle pour bâtir un ensemble d’expériences de type SFD pour tout n compris entre 1 et N qui soient toutes adaptées à la prédiction par krigeage. Nous proposons une méthode pour générer des plans séquentiellement ou encore emboités (l’un est inclus dans l’autre) basée sur des critères d’information, notamment le critère d’Information Mutuelle qui mesure la réduction de l’incertitude de la prédiction en tout point du domaine entre avant et après l’observation de la réponse aux points du plan. Cette approche assure la qualité des plans obtenus pour toutes les valeurs de n, 1 6 n 6 N. La difficulté est le calcul du critère et notamment la génération de plans en grande dimension. Pour pallier ce problème une solution a été présentée. Cette solution propose une implémentation astucieuse de la méthode basée sur le découpage par blocs des matrices de covariances ce qui la rend numériquement efficaceIn recent years, computer simulation models are increasingly used to study complex phenomena. Such problems usually rely on very large sophisticated simulation codes that are very expensive in computing time. The exploitation of these codes becomes a problem, especially when the objective requires a significant number of evaluations of the code. In practice, the code is replaced by global approximation models, often called metamodels, most commonly a Gaussian Process (kriging) adjusted to a design of experiments, i.e. on observations of the model output obtained on a small number of simulations. Space-Filling-Designs which have the design points evenly spread over the entire feasible input region, are the most used designs. This thesis consists of two parts. The main focus of both parts is on construction of designs of experiments that are adapted to kriging, which is one of the most popular metamodels. Part I considers the construction of space-fillingdesigns of fixed size which are adapted to kriging prediction. This part was started by studying the effect of Latin Hypercube constraint (the most used design in practice with the kriging) on maximin-optimal designs. This study shows that when the design has a small number of points, the addition of the Latin Hypercube constraint will be useful because it mitigates the drawbacks of maximin-optimal configurations (the position of the majority of points at the boundary of the input space). Following this study, an uniformity criterion called Radial discrepancy has been proposed in order to measure the uniformity of the points of the design according to their distance to the boundary of the input space. Then we show that the minimax-optimal design is the closest design to IMSE design (design which is adapted to prediction by kriging) but is also very difficult to evaluate. We then introduce a proxy for the minimax-optimal design based on the maximin-optimal design. Finally, we present an optimised implementation of the simulated annealing algorithm in order to find maximin-optimal designs. Our aim here is to minimize the probability of falling in a local minimum configuration of the simulated annealing. The second part of the thesis concerns a slightly different problem. If XN is space-filling-design of N points, there is no guarantee that any n points of XN (1 6 n 6 N) constitute a space-filling-design. In practice, however, we may have to stop the simulations before the full realization of design. The aim of this part is therefore to propose a new methodology to construct sequential of space-filling-designs (nested designs) of experiments Xn for any n between 1 and N that are all adapted to kriging prediction. We introduce a method to generate nested designs based on information criteria, particularly the Mutual Information criterion. This method ensures a good quality forall the designs generated, 1 6 n 6 N. A key difficulty of this method is that the time needed to generate a MI-sequential design in the highdimension case is very larg. To address this issue a particular implementation, which calculates the determinant of a given matrix by partitioning it into blocks. This implementation allows a significant reduction of the computational cost of MI-sequential designs, has been proposed
42
Maia, Mariana de Brito. "Módulos de Ulrich." Universidade Federal da Paraíba, 2013. http://tede.biblioteca.ufpb.br:8080/handle/tede/8019.
Full textAbstract:
Submitted by Maike Costa (maiksebas@gmail.com) on 2016-03-21T14:11:17Z
No. of bitstreams: 1
arquivo total.pdf: 931330 bytes, checksum: 351b504f68153fb01d23f3fd1d96d2a0 (MD5)Made available in DSpace on 2016-03-21T14:11:17Z (GMT). No. of bitstreams: 1 arquivo total.pdf: 931330 bytes, checksum: 351b504f68153fb01d23f3fd1d96d2a0 (MD5) Previous issue date: 2013-04-29
In this work, after the introduction of some concepts of Commutative Algebra, for instance dimension, minimal number of generators, and multiplicity, we prove the existence of a very special class of modules over Cohen-Macaulay rings, the so-called Ulrich modules. It is known that, if M is a maximal Cohen-Macaulay module over such ring, then (M) e(M). Our goal in this study is to prove the main cases where the equality (M) e(M) holds.
Neste trabalho, após introduzirmos alguns conceitos de Álgebra Comutativa, como dimensão, número mínimo de geradores, e multiplicidade, provamos a existência de uma classe de módulos bastante especial sobre anéis Cohen-Macaulay, os chamados módulos de Ulrich. É sabido que, se M é um A-módulo Cohen-Macaulay maximal sobre um tal anel, então (M) e(M). O objetivo do nosso estudo é demonstrar os principais casos em que vale (M) = e(M).
43
Amrani-Benhalima, Faïza. "Problèmes de MIN-MAX en variables 0-1 : Algorithmes de résolution exacts et approchés." Valenciennes, 1997. https://ged.uphf.fr/nuxeo/site/esupversions/6fb2c7ce-df58-4bc6-bb55-a1a7c0529fcf.
Full textAbstract:
Le problème de Minmax en variables continues ou en variables entières a toujours suscité un intérêt croissant d'une part, parce que son champs d'application est vaste. Que ce soit dans le domaine des mathématiques, l'allocation de ressource, l'économie, l'aéronautique et même des jeux. D'autres part, parce que les problèmes traités sont classés en théorie de la complexité comme NP-difficile même quand il s'agit d'un problème de Minmax en variables 0-1 sans contrainte et avec seulement deux objectifs. Cette thèse contribue à l'étude des problèmes en variables bivalentes. Elle propose la résolution exacte et approchée des problèmes de Minmax ou Maxmin en variables 0-1 qui consistent à minimiser un objectif exprimé sous la forme d'un minimum ou maximum de plusieurs fonctions linéaires et soumis à un ensemble de contraintes.
44
Kaaouachi, Mohamed Hamza. "Une approche distribuée pour les problèmes de couverture dans les systèmes hautement dynamiques." Electronic Thesis or Diss., Paris 6, 2016. http://www.theses.fr/2016PA066058.
Full textAbstract:
Un système distribué est un système composé d'éléments de calcul autonomes dotés de capacité de communication. Il s'agit d'un modèle commun pour l'étude des réseaux. L'évolution rapide des réseaux sans fils et/ou mobiles aussi bien dans la vie quotidienne que dans la recherche amène progressivement à intégrer la dynamique (i.e. l'évolution dans le temps de la connectivité) dans les systèmes distribués. Concrètement, cela revient à ajouter l'hypothèse que les capacités de communication des éléments du système peuvent varier dans le temps. De nombreux modèles considèrent ainsi la dynamique comme composante à part entière du système (et non pas comme une faute). De manière récente, une nouvelle approche, appelée graphe variant dans le temps, tente d'unifier tous ces modèles dans un formalisme commun qui permet de classifier les systèmes en fonction de leurs propriétés de connexité temporelle. Dans cette thèse, nous nous intéressons à des systèmes distribués hautement dynamiques dans lesquels les hypothèses de connexité sont minimalistes. Plus précisément, nous concentrons nos efforts sur les systèmes connexes à travers le temps dans lesquels la seule garantie est que tout élément du système peut infiniment souvent envoyer un message à tout autre (sans garantie sur la pérennité de la route utilisée ni sur le délai de communication). Nous nous intéressons plus particulièrement aux problèmes de couverture (par exemple, ensemble dominant minimal, couplage maximal, ensemble indépendant maximal, ...) dans ces systèmes distribués hautement dynamiques. Les contributions de cette thèse dans ce contexte sont les suivantes. Nous proposons tout d'abord une nouvelle définition pour les problèmes de couverture qui est plus adaptée aux systèmes distribués hautement dynamiques que les définitions existantes. Dans un deuxième temps, nous fournissons un outil générique qui permet de faciliter les preuves de résultats d'impossibilité dans les systèmes distribués dynamiques. Nous appliquons cet outil pour prouver plusieurs résultats d'impossibilité à propos de problèmes de couverture. Ensuite, nous proposons une nouvelle mesure de complexité en temps qui permet de comparer équitablement les performances de protocoles dans les systèmes distribués dynamiques. Enfin, nous donnons un algorithme de construction d'un ensemble dominant minimal dans les systèmes distribués hautement dynamiquesA distributed system is a system of autonomous computing components endowed with communication abilities. This is a common model for the study of networks. The quick evolution of wireless and mobile network both in everyday life and in research gradually leads to take in account the dynamics (i.e. the evolution over time) in distributed systems. Concretely, this means to add the assumption that the communication abilities of the components of the system may vary over time. Many models consider the dynamics as an integral component of the system (and not as a fault). Recently, a new approach, called time-varying graph, attempts to unify all these models in a common formalism which allows the classification systems based on their temporal connectivity properties. In this thesis, we are interested in highly dynamic distributed systems with minimal connectivity assumptions. Specifically, we focus on connected over time systems where the only guarantee is that any element of the system can infinitely often send a message to any other (no guarantee are provided on the sustainability of the used path nor on the time communication). We are particularly interested in covering problems (e.g., minimal dominanting set, maximal matching, maximal independent set, ...) in these highly dynamic distributed systems. The contributions of this thesis in this context are as follows. We first propose a new definition for the covering problems which is more suited to highly dynamic distributed systems that the existing definitions. Secondly, we provide a generic tool to simplify proof of impossibility results in dynamic distributed systems. We use this tool to prove some impossibility results of covering problems. Then, we propose a new time complexity measure to fairly compare the algorithms performance in dynamic distributed systems. Finally, we give an algorithm that compute a minimal dominating set in highly dynamic distributed systems
45
Akonaitė, Marta. "Markovo grandinių dviejų paprastų hipotezių asimptotinis tikrinimas." Bachelor's thesis, Lithuanian Academic Libraries Network (LABT), 2013. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20130129_134705-35396.
Full textAbstract:
Markovo proceso tikimybinio mato absoliutaus tolydumo nesudėtingos sąlygos leidžia gauti atitinkamų statistinių eksperimentų tikėtinumo santykio pavidalą, kurio asimptotinės savybės susijusios su dviejų paprastų hipotezių asimptotiniais atskyrimo uždaviniais, kai yra taikomas maksimalaus tikėtinumo arba minimakso kriterijus. Tų paprastų hipotezių asimptotinis atskyrimas yra charakterizuojamas 1-os ir 2-os rūšies klaidos tikimybėmis, kurių asimptotinis elgesys priklausomai nuo optimalaus statistinio kriterijaus parinkimo užsirašo dvejomis formulėmis. Maksimalaus kriterijaus atveju tokia formulė buvo gauta bendriausiu atveju, tik nebuvo pritaikyta Markovo procesui su dideliu būsenų skaičiumi. Šiame darbe kaip tik parodyti šie taikymai. Taikant maksimalaus tikėtinumo kriterijų (Neimono-Pirsono) atitinkamas rezultatas buvo gautas tik tuo atveju, kai stebėjimai yra nepriklausomi ir vienodai pasiskirstę. Analogiškas rezultatas gautas bendriausiu atveju – gautos sąlygos, kada galioja atitinkama asimptotinė formulė. Kartu, pavyzdžiuose yra parodyti šios asimptotinės formulės taikymai, kai stebimas Markovo procesas su dideliu būsenų skaičiumi.Absolute continuity simple conditions of probabilistic measure of Markov process allows you to get relevand statistical experiments likelihood ratio form, which asymptotic properties is associated with the asymptotic separation of the two simple hypotheses tasks, when is applied maximum likelihood (Neiman-Pirson) or minimax criterion. That asymptotic separation of the two simple hypothesis is characterized by type I and type II errors of probability, which asymptotic behavior depending on the optimal statistical criterion selection note down by two formulas. In maximum likelihood criterion case, formula was obtained on a very general case, not only been applied of the Markov process with a large number of states. These applications are shown at this work. Using maximum likelihood criterion (Neiman-Pirson) corresponding result was obtained only in that case, when observations are independent and identically distributed. Analogous result were obtained on a very general case – from conditions, when is valid the asymptotic formula. In examples of this work are shown that asymptotic formula applications, when is observed Markov process with a large number of states.
46
Lauritsen, Ryan Gerald. "Environmental Factors Influencing 20th Century Diurnal Temperature Range Variations." The Ohio State University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=osu1300723909.
Full text
47
Ma, Zongjie. "Searching on Massive Graphs and Regularizing Deep Learning." Thesis, Griffith University, 2018. http://hdl.handle.net/10072/385875.
Full textAbstract:
We have designed di erent heuristics for both searching on Massive graphs and
regularizing Deep Neural Networks in this work.
Both the problem of nding a minimum vertex cover (MinVC) and the maximum
edge weight clique (MEWC) in a graph are prominent NP-hard problems of great
importance in both theory and application. During recent decades, there has been
much interest in nding optimal or near-optimal solutions to these two problems.
Many existing heuristic algorithms for MinVC are based on local search strategies.
An algorithm called FastVC takes a rst step towards solving the MinVC
problem for large real-world graphs. However, FastVC may be trapped at local
minima during the local search stage due to the lack of suitable diversi cation
mechanisms. Besides, since the traditional best-picking heuristic was believed to
be of high complexity, FastVC replaces it with an approximate best-picking strategy.
However, best-picking has been proved to be robust for a wide range of
problems, so abandoning it may be a great sacri ce. Therefore, we rstly design
a diversi cation heuristic to help FastVC escape from local minima, and the proposed
solver is named WalkVC. Secondly, we develop a local search MinVC solver,
named NoiseVC, which utilizes best-picking (low complexity) with noise to remove
vertices during the local search stage in massive graphs. On the other hand, most
of existing heuristics for the MEWC problem focus on academic benchmarks with
relatively small size. However, very little attention was paid to solving the MEWC
problem in large sparse graphs. In this thesis, we exploit the so-called deterministic
tournament selection (DTS) heuristic for selecting edges to improve the local
search based MEWC algorithms.
Deep Neural Networks (DNN), have an extremely large number of parameters
comparing with traditional machine earning methods, su er from the the problem
of over tting. Dropout [Hinton et al., 2012, Srivastava et al., 2014] has been proposed
to address this problem. Dropout is an useful technique for regularizing and
preventing the co-adaptation of neurons in DNN. It randomly drops units with a
probability p during the training stage of DNN to avoid over tting. The working mechanism of dropout can be interpreted as approximately and exponentially combining
many di erent neural network architectures e ciently, leading to a powerful
ensemble. We propose a novel diversi cation strategy for dropout named Tabu
Dropout, which aims at generating more di erent neural network architectures in
fewer numbers of iterations. Besides, a recent work named Curriculum Dropout
achieves the state-of-the-art performance among the dropout variants by using a
scheduled p instead of a xed one. It gradually increases the dropping probability
from 0 to 1 p according to a time scheduling from curriculum learning. The
primary intuition is that dropout seems unnecessary at the beginning of training
and Curriculum Dropout starts training the whole neural networks without dropping,
which is called \starting easy". In this thesis, we design a new scheduled
dropout strategy using \starting small" instead of \starting easy", which gradually
decreases the dropping probability from 1 to p. We call this strategy Annealed
Curriculum Dropout.
Experiments conducted on related public standard datasets show that our proposed
heuristics for both searching on massive graphs and regularizing deep learning
have achieved better performance than the comparison methods.Thesis (PhD Doctorate)
Doctor of Philosophy (PhD)
Inst Integrated&IntelligentSys
Science, Environment, Engineering and Technology
Full Text
48
Gandar, Benoît. "Apprentissage actif pour l'approximation de variétés." Phd thesis, Université Blaise Pascal - Clermont-Ferrand II, 2012. http://tel.archives-ouvertes.fr/tel-00954409.
Full textAbstract:
L'apprentissage statistique cherche à modéliser un lien fonctionnel entre deux variables X et Y à partir d'un échantillon aléatoire de réalisations de (X,Y ). Lorsque la variable Y prend un nombre binaire de valeurs, l'apprentissage s'appelle la classification (ou discrimination en français) et apprendre le lien fonctionnel s'apparente à apprendre la frontière d'une variété dans l'espace de la variable X. Dans cette thèse, nous nous plaçons dans le contexte de l'apprentissage actif, i.e. nous supposons que l'échantillon d'apprentissage n'est plus aléatoire et que nous pouvons, par l'intermédiaire d'un oracle, générer les points sur lesquels l'apprentissage de la variété va s'effectuer. Dans le cas où la variable Y est continue (régression), des travaux précédents montrent que le critère de la faible discrépance pour générer les premiers points d'apprentissage est adéquat. Nous montrons, de manière surprenante, que ces résultats ne peuvent pas être transférés à la classification. Dans ce manuscrit, nous proposons alors le critère de la dispersion pour la classification. Ce critère étant difficile à mettre en pratique, nous proposons un nouvel algorithme pour générer un plan d'expérience à faible dispersion dans le carré unité. Après une première approximation de la variété, des approximations successives peuvent être réalisées afin d'affiner la connaissance de celle-ci. Deux méthodes d'échantillonnage sont alors envisageables : le " selective sampling " qui choisit les points à présenter à un oracle parmi un ensemble fini de candidats et l'" adaptative sampling " qui permet de choisir n'importe quels points de l'espace de la variable X. Le deuxième échantillonnage peut être vu comme un passage à la limite du premier. Néanmoins, en pratique, il n'est pas raisonnable d'utiliser cette méthode. Nous proposons alors un nouvel algorithme basé sur le critère de dispersion, menant de front exploitation et exploration, pour approximer une variété.
49
Moraes, Hugo Leonardo de. "Utilização do software Geogebra no estudo de pontos de máximo e pontos de mínimo de funções de uma variável." Universidade Federal de Goiás, 2013. http://repositorio.bc.ufg.br/tede/handle/tede/3243.
Full textAbstract:
Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2014-10-01T14:00:10Z
No. of bitstreams: 2
dissertação - Hugo Leonardo de Moraes - 2013.pdf: 7379480 bytes, checksum: fe95767e57f88b72c915d7bc926f4693 (MD5)
license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2014-10-01T15:18:49Z (GMT) No. of bitstreams: 2 dissertação - Hugo Leonardo de Moraes - 2013.pdf: 7379480 bytes, checksum: fe95767e57f88b72c915d7bc926f4693 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)
Made available in DSpace on 2014-10-01T15:18:49Z (GMT). No. of bitstreams: 2 dissertação - Hugo Leonardo de Moraes - 2013.pdf: 7379480 bytes, checksum: fe95767e57f88b72c915d7bc926f4693 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2013-02-28
Conselho Nacional de Pesquisa e Desenvolvimento Científico e Tecnológico - CNPq
This paper aims to present the main advantages of using the software geogebra in the study of problem situations involving points of maximum and minimum points of functions of one variable. The survey included a brief study on: geogebra software and some of their purposes, function of one variable, graphical representation of a function, limit, derivative, second derivative, critical points, maximum points, minimum points and applications of the study of points of maximum and minimum in problem situations everyday when using the software geogebra.
Este trabalho tem como objetivo principal apresentar as vantagens de se utilizar o programa geogebra no estudo de situações-problema que envolvem pontos de máximo e pontos de mínimo de funções de uma variável. A pesquisa contemplou um breve estudo sobre: o software geogebra e algumas de suas nalidades, função de uma variável, representa- ção grá ca de uma função, limite, derivada, derivada segunda, pontos críticos, pontos de máximo, pontos de mínimo e aplicações do estudo de pontos de máximo e de mínimo em situações-problema do cotidiano sempre com a utilização do software geogebra.
50
MELO, Jordanna Sousa de. "Análise de ondas de calor e de frio no Rio Grande do Sul por diferentes métodos." Universidade Federal de Campina Grande, 2017. http://dspace.sti.ufcg.edu.br:8080/jspui/handle/riufcg/1421.
Full textAbstract:
Submitted by Lucienne Costa (lucienneferreira@ufcg.edu.br) on 2018-08-13T17:25:26Z
No. of bitstreams: 1
JORDANNA SOUSA DE MELO – DISSERTAÇÃO (PPGMET) 2017.pdf: 3551837 bytes, checksum: 84c4d559fd24d6944745d0099094fe06 (MD5)Made available in DSpace on 2018-08-13T17:25:26Z (GMT). No. of bitstreams: 1 JORDANNA SOUSA DE MELO – DISSERTAÇÃO (PPGMET) 2017.pdf: 3551837 bytes, checksum: 84c4d559fd24d6944745d0099094fe06 (MD5) Previous issue date: 2017-12-15
Com o intuito de identificar e analisar as ondas de calor e de frio que ocorrem no Rio Grande do Sul foi utilizado quatro diferentes procedimentos em 13 estações meteorológicas, espacialmente distribuídas no Estado, entre os anos de 1961 a 2010. Foram consideradas ondas de calor e frio os períodos de cinco ou mais dias consecutivos de anomalias positivas e negativas de temperaturas máximas e mínimas, respectivamente. Calculou-se as médias climatológicas de temperaturas máximas e mínimas anual, estacional e diárias, e em seguida o número de ondas de calor e de frio para cada localidade, anual e sazonal pelos métodos Índice da Organização Meteorológica Mundial (IOMM), Índice Diário (ID), Índice Sazonal (IS) e RClimdex. Ao comparar os métodos verificou-se que o IOMM foi o que detectou o maior número de eventos, os métodos ID e IS praticamente não detectam ondas de calor no verão e de frio no inverno e o RClimdex mostrou-se incapaz de detectar a variabilidade internual de ondas de calor e frio no Rio Grande do Sul. Com relação às configurações espaciais das médias climatológicas das temperaturas do ar máximas e mínimas durante os dias de ondas de calor e frio, respectivamente, assim como os próprios números de dias de ondas calor e frio observou-se um gradiente do litoral para o interior e de sudeste para noroeste. De certa forma estas configurações é uma resposta aos efeitos da continentalidade, latitude e relevo. Quanto à associação da influencia dos eventos El Niño e La Niña no número de ondas de calor e frio observou-se que, em média, ocorrem um número maior de ondas de calor nos anos de El Niño e de frio nos anos de La Niña, entretanto, esta relação não é estatisticamente significativa. Portanto, não é possível afirmar categoricamente que em anos de El Niño tem-se um maior número de ondas de calor e nos de La Niña de frio.
In order to identify and analyze the heat and cold waves that occur in Rio Grande do Sul four different procedures were used in 13 meteorological stations, spatially distributed in the State, between 1961 and 2010. Heat waves were considered and periods of five or more consecutive days of positive and negative anomalies of maximum and minimum temperatures, respectively. The annual, seasonal and daily maximum and minimum climatic averages were calculated, followed by the number of heat and cold waves for each locality, annual and seasonal, using the World Meteorological Organization (IOMM), Daily Index (ID), Seasonal Index (IS) and RClimdex. When comparing the methods it was verified that the IOMM was the one that detected the greatest number of events, the ID and IS methods practically did not detect heat waves in summer and cold in the winter and RClimdex was unable to detect the internal variability of heat and cold waves in Rio Grande do Sul. Regarding the spatial configurations of the climatological means of the maximum and minimum air temperatures during the days of heat and cold waves, respectively, as well as the number of days of heat waves and cold it was observed a gradient of the coast inland and from southeast to northwest. In some ways these settings are a response to the effects of continental, latitude and relief. As for the association of the influence of the El Niño and La Niña events on the number of heat and cold waves, it was observed that, on average, a larger number of heat waves occur in the El Niño and cold years in La Niña, however, this relationship is not statistically significant. Therefore, it is not possible to state categorically that in El Niño years there is a greater number of heat waves and that of La Niña of cold.