Tesis sobre el tema "Higher-order theorie"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores tesis para su investigación sobre el tema "Higher-order theorie".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore tesis sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Fabbri, Luca <1978>. "Higher-order theories of gravitation". Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2007. http://amsdottorato.unibo.it/333/1/libro.pdf.
Texto completoFabbri, Luca <1978>. "Higher-order theories of gravitation". Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2007. http://amsdottorato.unibo.it/333/.
Texto completoMahanta, Uma Prasad. "Higher order corrections in walking technicolor theories /". The Ohio State University, 1989. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487598748019643.
Texto completoKrishnaswami, Neelakantan R. "Verifying Higher-Order Imperative Programs with Higher-Order Separation Logic". Research Showcase @ CMU, 2012. http://repository.cmu.edu/dissertations/164.
Texto completoBenecke, Stephen. "Higher order domination of graphs". Thesis, Stellenbosch : University of Stellenbosch, 2004. http://hdl.handle.net/10019.1/16257.
Texto completoENGLISH ABSTRACT: Motivation for the study of protection strategies for graphs is rooted in antiquity and has evolved as a subdiscipline of graph theory since the early 1990s. Using, as a point of departure, the notions of weak Roman domination and secure domination (where protection of a graph is required against a single attack) an initial framework for higher order domination was introduced in 2002 (allowing for the protection of a graph against an arbitrary finite, or even infinite, number of attacks). In this thesis, the theory of higher order domination in graphs is broadened yet further to include the possibility of an arbitrary number of guards being stationed at a vertex. The thesis firstly provides a comprehensive survey of the combinatorial literature on Roman domination, weak Roman domination, secure domination and other higher order domination strategies, with a view to summarise the state of the art in the theory of higher order graph domination as at the start of 2004. Secondly, a generalised framework for higher order domination is introduced in two parts: the first catering for the protection of a graph against a finite number of consecutive attacks, and the second concerning the perpetual security of a graph (protection of the graph against an infinite number of consecutive attacks). Two types of higher order domination are distinguished: smart domination (requiring the existence of a protection strategy for any sequence of consecutive attacks of a pre–specified length, but leaving it up to a strategist to uncover such a guard movement strategy for a particular instance of the attack sequence), and foolproof domination (requiring that any possible guard movement strategy be a successful protection strategy for the graph in question). Properties of these higher order domination parameters are examined—first by investigating the application of known higher order domination results from the literature, and secondly by obtaining new results, thereby hopefully improving current understanding of these domination parameters. Thirdly, the thesis contributes by (i) establishing higher order domination parameter values for some special graph classes not previously considered (such as complete multipartite graphs, wheels, caterpillars and spiders), by (ii) summarising parameter values for special graph classes previously established (such as those for paths, cycles and selected cartesian products), and by (iii) improving higher order domination parameter bounds previously obtained (in the case of the cartesian product of two cycles). Finally, a clear indication of unresolved problems in higher order graph domination is provided in the conclusion to this thesis, together with some suggestions as to possibly desirable future generalisations of the theory.
AFRIKAANSE OPSOMMING: Die motivering vir die studie van verdedigingstrategie¨e vir grafieke het sy ontstaan in die antieke wˆereld en het sedert die vroe¨e 1990s as ’n subdissipline in grafiekteorie begin ontwikkel. Deur gebruik te maak van die idee van swak Romynse dominasie en versterkte dominasie (waar verdediging van ’n grafiek teen ’n enkele aanval vereis word) het ’n aanvangsraamwerk vir ho¨er– orde dominasie (wat ’n grafiek teen ’n veelvuldige, of selfs oneindige aantal, aanvalle verdedig) in 2002 die lig gesien. Die teorie van ho¨er–orde dominasie in grafieke word in hierdie tesis verbreed, deur toe te laat dat ’n arbitrˆere aantal wagte by elke punt van die grafiek gestasioneer mag word. Eerstens voorsien die tesis ’n omvangryke oorsig van die kombinatoriese literatuur oor Romynse dominasie, swak Romynse dominasie, versterkte dominasie en ander ho¨er–orde dominasie strategie ¨e, met die doel om die kundigheid betreffende die teorie van ho¨er–orde dominasie, soos aan die begin van 2004, op te som. Tweedens word ’n veralgemeende raamwerk vir ho¨er–orde dominasie bekendgestel, en wel in twee dele. Die eerste deel maak voorsiening vir die verdediging van ’n grafiek teen ’n eindige aantal opeenvolgende aanvalle, terwyl die tweede deel betrekking het op die oneindige sekuriteit van ’n grafiek (verdediging teen ’n oneindige aantal opeenvolgende aanvalle). Daar word tussen twee tipes h¨oer–orde dominasie onderskei: intelligente dominasie (wat slegs die bestaan van ’n verdedigingstrategie vir enige reeks opeenvolgende aanvalle vereis, maar dit aan ’n strateeg oorlaat om ’n suksesvolle bewegingstrategie vir die verdediging teen ’n spesifieke reeks aanvalle te vind), en onfeilbare dominasie (wat vereis dat enige moontlike bewegingstrategie resulteer in ’n suksesvolle verdedigingstrategie vir die betrokke grafiek). Eienskappe van hierdie ho¨er–orde dominasie parameters word ondersoek, deur eerstens die toepasbaarheid van bekende ho¨er–orde dominasie resultate vanuit die literatuur te assimileer, en tweedens nuwe resultate te bekom, in die hoop om die huidige kundigheid met betrekking tot hierdie dominasie parameters te verbreed. Derdens word ’n bydrae gelewer deur (i) ho¨er–orde dominasie parameterwaardes vas te stel vir sommige spesiale klasse grafieke wat nie voorheen ondersoek is nie (soos volledig veelledige grafieke, wiele, ruspers en spinnekoppe), deur (ii) parameterwaardes wat reeds bepaal is (soos byvoorbeeld di´e vir paaie, siklusse en sommige kartesiese produkte) op te som, en deur (iii) bekende ho¨er–orde dominasie parametergrense te verbeter (in die geval van die kartesiese produk van twee siklusse). Laastens word ’n aanduiding van oop probleme in die teorie van ho¨er–orde dominasie in die slothoofstuk van die tesis voorsien, tesame met voorstelle ten opsigte van moontlik sinvolle veralgemenings van die teorie.
Hunt, D'Hania J. "Constructing higher-order de Bruijn graphs". Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2002. http://library.nps.navy.mil/uhtbin/hyperion-image/02Jun%5FHunt.pdf.
Texto completoThesis advisor(s): Harold Fredricksen, Craig W. Rasmussen. Includes bibliographical references (p. 45-46). Also available online.
Fritz, Peter. "Intensional type theory for higher-order contingentism". Thesis, University of Oxford, 2015. http://ora.ox.ac.uk/objects/uuid:b9415266-ad21-494a-9a78-17d2395eb8dd.
Texto completoCotsakis, Spiros. "Cosmological models in higher-order gravity". Thesis, University of Sussex, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.303168.
Texto completoBrowning, Andrew David. "Becchi-Rouet-Stora-Tyutin symmetry in higher order theories". Thesis, Imperial College London, 1985. http://hdl.handle.net/10044/1/37647.
Texto completoMiddleton, Jonathan Ian. "The cosmology of higher-order Lagrangian theories of gravity". Thesis, University of Cambridge, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.609455.
Texto completoBlech, Jan Olaf. "Certifying system translations using higher order theorem provers". Berlin Logos-Verl, 2008. http://d-nb.info/994725647/04.
Texto completoMorrison, Tegan Ann. "Asymptotics of higher-order Painlevé equations". Thesis, The University of Sydney, 2009. http://hdl.handle.net/2123/5140.
Texto completoMorrison, Tegan Ann. "Asymptotics of higher-order Painlevé equations". University of Sydney, 2009. http://hdl.handle.net/2123/5140.
Texto completoWe undertake an asymptotic study of a second Painlevé hierarchy based on the Jimbo-Miwa Lax pair in the limit as the independent variable approaches infinity. The hierarchy is defined by an infinite sequence of non-linear ordinary differential equations, indexed by order, with the classical second Painlevé equation as the first member. We investigate general and special asymptotic behaviours admitted by each equation in the hierarchy. We show that the general asymptotic behaviour is described by two related hyperelliptic functions, where the genus of the functions increases with each member of the hierarchy, and we prove that there exist special families of solutions which are represented by algebraic formal power series. For specific values of the constants which appear in the higher-order second Painlevé equations, exact solutions are also constructed. Particular attention is given to the fourth-order analogue of the classical second Painlevé equation. In this case, the general asymptotic behaviour is given to leading-order by two related genus-2 hyperelliptic functions. These functions are characterised by four complex parameters which depend on the independent variable through the perturbation terms of the leading-order equations, and we investigate how these parameters change with respect to this variable. We also show that the fourth-order equation admits two classes of algebraic formal power series and that there exist families of true solutions with these behaviours in specified sectors of the complex plane, as well as unique solutions in extended sectors. To complement our asymptotic study of higher-order Painlevé equations, we consider a new setting in which classical Painlevé equations arise. We study reaction-diffusion equations with quadratic and cubic source terms, with a spatio-temporal dependence included in those terms, and show that solutions of these equations are given by first and second Painlevé transcendents.
Nishiyama, Yoshihiko. "Higher order asymptotic theory for semiparametric averaged derivatives". Thesis, London School of Economics and Political Science (University of London), 2001. http://etheses.lse.ac.uk/2003/.
Texto completoCheung, Ho Yin. "Function approximation with higher-order fuzzy systems /". View abstract or full-text, 2006. http://library.ust.hk/cgi/db/thesis.pl?ELEC%202006%20CHEUNG.
Texto completoPrieto, Martínez Pere Daniel. "Geometrical structures of higher-order dynamical systems and field theories". Doctoral thesis, Universitat Politècnica de Catalunya, 2014. http://hdl.handle.net/10803/284215.
Texto completoLa física geomètrica és una branca relativament jove de la matemàtica aplicada que es va iniciar als anys 60 i 70 qua A. Lichnerowicz, W.M. Tulczyjew and J.M. Souriau, entre molts altres, van començar a estudiar diversos problemes en física usant mètodes de geometria diferencial. Aquesta "geometrització" proporciona una manera d'analitzar les característiques dels sistemes físics des d'una perspectiva global, obtenint així propietats qualitatives que faciliten la integració de les equacions que els descriuen. D'ençà s'ha produït un fort desenvolupamewnt en el tractament intrínsic d'una gran varietat de problemes en física teòrica, matemàtica aplicada i teoria de control usant mètodes de geometria diferencial. Gran part del treball realitzat en la física geomètrica des dels seus primers dies s'ha dedicat a l'estudi de teories de primer ordre, és a dir, teories tals que la informació física depèn en, com a molt, derivades de primer ordre de les coordenades de posició generalitzades (velocitats). Tanmateix, hi ha teories en física en les que la informació física depèn de manera explícita en acceleracions o derivades d'ordre superior de les coordenades de posició generalitzades, requerint, per tant, d'eines geomètriques més sofisticades per a modelar-les de manera acurada. En aquesta Tesi Doctoral ens proposem donar una descripció geomètrica d'algunes d'aquestes teories. En particular, estudiarem sistemes dinàmics i teories de camps tals que la seva informació dinàmica ve donada en termes d'una funció lagrangiana, o d'un hamiltonià que prové d'un sitema lagrangià. Per a ser més precisos emprarem la formulació unificada Lagrangiana-Hamiltoniana per tal de desenvolupar marcs geomètrics per a sistemes dinàmics d'ordre superior autònoms i no autònoms, i per a teories de camps de segon ordre. Amb aquest marc geomètric estudiarem alguns exemples físics rellevants i algunes aplicacions, com la teoria de Hamilton-Jacobi per a sistemes mecànics d'ordre superior, partícules relativístiques amb spin i problemes de deformació en mecànica, i l'equació de Korteweg-de Vries i altres sistemes en teories de camps.
BRECCIONE, MATTUCCI ALESSANDRO. "Post-Newtonian approximation in higher-order metric theories of gravity". Doctoral thesis, Università degli Studi dell'Aquila, 2021. http://hdl.handle.net/11697/170004.
Texto completoSwan, Christopher. "The higher order dynamics of progressive waves". Thesis, University of Cambridge, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.328829.
Texto completoMeng, Jia. "The integration of higher order interactive proof with first order automatic theorem proving". Thesis, University of Cambridge, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.615216.
Texto completoFerreira, William. "Semantic theories for concurrent ML". Thesis, University of Sussex, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.307726.
Texto completoNeatherway, Robin Philip. "Higher-order model checking with traversals". Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:240bd517-1582-45f9-86c3-eb30f85757de.
Texto completoTan, Ta Sheng. "Higher order tournaments and other combinatorial results". Thesis, University of Cambridge, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.610761.
Texto completoMoazzami, Mehdi. "A higher order layer-wise theory of laminated plates". The Ohio State University, 1991. http://rave.ohiolink.edu/etdc/view?acc_num=osu1273001724.
Texto completoSteggles, L. J. "Extensions of higher-order algebra : fundamental theory and case studies". Thesis, Swansea University, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.639103.
Texto completoGhosh, Swarnava Ghosh. "Orbital-free density functional theory using higher-order finite differences". Thesis, Georgia Institute of Technology, 2015. http://hdl.handle.net/1853/53603.
Texto completoMadiot, Jean-Marie. "Higher-order languages : dualities and bisimulation enhancements". Thesis, Lyon, École normale supérieure, 2015. http://www.theses.fr/2015ENSL0988/document.
Texto completoThe behaviours of concurrent processes can be expressed using process calculi, which are simple formal languages that let us establish precise mathematical results on the behaviours and interactions between processes. A very simple example is CCS, another one is the pi-calculus, which is more expressive thanks to a name-passing mechanism. The pi-calculus supports the addition of type systems (to refine the analysis to more subtle environments) and the encoding of the lambda-calculus (which represents sequential computations).Some of these calculi, like CCS or variants of the pi-calculus such as fusion calculi, enjoy a property of symmetry. First, we use this symmetry as a tool to prove that two encodings of the lambda-calculus in the pi-calculus are in fact equivalent.This proof using a type system and a form of symmetry, we wonder if other existing symmetric calculi can support the addition of type systems. We answer negatively to this question with an impossibility theorem.Investigating this theorem leads us to a fundamental constraint of these calculi that forbids types: they induce an equivalence relation on names. Relaxing this constraint to make it a preorder relation yields another calculus that recovers important notions of the pi-calculus, that fusion calculi do not satisfy: the notions of types and of privacy of names. The first part of this thesis focuses on the study of this calculus, a pi-calculus with preorders on names.The second part of this thesis focuses on bisimulation, a proof method for equivalence of agents in higher-order languages, like the pi- or the lambda-calculi. An enhancement of this method is the powerful theory of bisimulations up to, which unfortunately only applies for first-order systems, like automata or CCS.We then proceed to describe higher-order languages as first-order systems. This way, we inherit the general theory of up-to techniques for these languages, by proving correct the translations and up-to techniques that are specific to each language. We give details on the approach, to provide the necessary tools for future applications of this method to other higher-order languages
Chamseddine, Ismail. "Construction of random signals from their higher order moments". Thesis, Imperial College London, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.266089.
Texto completoGioev, Dimitri. "Generalizations of Szego Limit Theorem : Higher Order Terms and Discontinuous Symbols". Doctoral thesis, KTH, Mathematics, 2001. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-3123.
Texto completoGioev, Dimitri. "Generalizations of Szegö limit theorem : higher order terms and discontinuous symbols /". Stockholm : Tekniska högsk, 2001. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-3123.
Texto completoNiezgoda, Stephen Richard Kalidindi Surya. "Stochastic representation of microstructure via higher-order statistics : theory and application /". Philadelphia, Pa. : Drexel University, 2010. http://hdl.handle.net/1860/3320.
Texto completoMcKinley, Michael Scott. "Higher-order boundary condition perturbation methods in transport and diffusion theory". Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/16034.
Texto completoCarter, Jonathan Paul. "Higher order corrections in perturbative quantum field theory via sector decomposition". Thesis, Durham University, 2011. http://etheses.dur.ac.uk/3370/.
Texto completoClaire, Narinder Singh. "Spectral theory and heat kernel estimates for higher order differential operators". Thesis, King's College London (University of London), 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.395811.
Texto completoSiddiqui, Faisal Karim. "Extended higher order theory for sandwich plates of arbitrary aspect ratio". Diss., Georgia Institute of Technology, 2015. http://hdl.handle.net/1853/54334.
Texto completoBrown, Howard Wm. "Higher order theory analysis of a modified free-edge delamination specimen /". The Ohio State University, 1987. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487326511715167.
Texto completoNagappan, Govindan. "Analysis of composite moving beams using higher order shear deformation theory". Morgantown, W. Va. : [West Virginia University Libraries], 2004. https://etd.wvu.edu/etd/controller.jsp?moduleName=documentdata&jsp%5FetdId=3463.
Texto completoTitle from document title page. Document formatted into pages; contains xi, 126 p. : ill. Includes abstract. Includes bibliographical references (p. 123-126).
Martin, Alan J. "Reasoning Using Higher-Order Abstract Syntax in a Higher-Order Logic Proof Environment: Improvements to Hybrid and a Case Study". Thesis, Université d'Ottawa / University of Ottawa, 2010. http://hdl.handle.net/10393/19711.
Texto completoAtzemoglou, George Philip. "Higher-order semantics for quantum programming languages with classical control". Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:9fdc4a26-cce3-48ed-bbab-d54c4917688f.
Texto completoCHIBA, Yuki y Keiichirou KUSAKARI. "A Higher-Order Knuth-Bendix Procedure and Its Applications". Institute of Electronics, Information and Communication Engineers, 2007. http://hdl.handle.net/2237/14974.
Texto completoHopkins, David G. B. "Game semantics based equivalence checking of higher-order programs". Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:bd68eb38-4159-475f-9a3c-0d6b9de7155a.
Texto completoJunes, Leandro. "Duality of higher order non-Euclidean property for oriented matroids". Diss., Online access via UMI:, 2008.
Buscar texto completoCampbell, Newton Henry Jr. "Algorithmic Foundations of Heuristic Search using Higher-Order Polygon Inequalities". NSUWorks, 2016. http://nsuworks.nova.edu/gscis_etd/374.
Texto completoVelasco, Carlos. "Higher order asymptotic theory for nonparametric time series analysis and related contributions". Thesis, London School of Economics and Political Science (University of London), 1996. http://etheses.lse.ac.uk/2563/.
Texto completoTom, Christine. "Using Modern Measurement Theory to Validate Teachers' Assessment of Higher order Thinking". Thesis, Griffith University, 2008. http://hdl.handle.net/10072/365880.
Texto completoThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Education and Professional Studies
Arts, Education and Law
Full Text
Carrasco, Hugo Alexandre Sacristão. "Higher order boundary value problems on unbounded intervals". Doctoral thesis, Universidade de Évora, 2017. http://hdl.handle.net/10174/21093.
Texto completoGilbert, Frédéric. "Extending higher-order logic with predicate subtyping : application to PVS". Thesis, Sorbonne Paris Cité, 2018. http://www.theses.fr/2018USPCC009/document.
Texto completoThe type system of higher-order logic allows to exclude some unexpected expressions such as the application of a predicate to itself. However, it is not sufficient to verify more complex criteria such as the absence of divisions by zero. This thesis is dedicated to the study of an extension of higher-order logic, named predicate subtyping, whose purpose is to make the assignment of types as expressive as the assignment of predicates. Starting from a type A and a predicate P(x) of domain A, predicate subtyping allows to build a subtype of A, denoted {x : A | P(x)}, whose elements are the terms t of type A such that P(t) is provable. Predicate subtyping is at the heart of the proof system PVS.This work presents the formalization of a minimal system expressing predicate subtyping, named PVS-Core, as well as a system of verifiable certificates for PVS-Core. This second system, named PVS-Cert, is based on the introduction of proof terms and explicit coercions. PVS-Core and PVS-Cert are equipped with a notion of conversion corresponding respectively to equality modulo beta and to equality modulo beta and the erasure of coercions, chosen to establish a simple correspondence between the two systems.The construction of PVS-Cert is similar to that of PTSs (Pure Type Systems) with dependent pairs and PVS-Cert can be equipped with the notion of beta-sigma-reduction used at the core of these systems. One of the main theorems proved in this work is the strong normalization of both the reduction underlying the conversion and beta-sigma-reduction. This theorem allows, on the one hand, to build a type-checking (and proof-checking) algorithm for PVS-Cert and, on the other hand, to prove a cut elimination result, used in turn to prove important properties of the two studied systems. Furthermore, it is also proved that PVS-Cert is a conservative extension of the PTS lambda-HOL and that, as a consequence, PVS-Core is a conservative extension of higher-order logic.A second part presents the prototype of an instrumentation of PVS to generate proof certificates. A third and final part is dedicated to the study of links between classical and constructive logic, with the definition of a minimal double-negation translation as well as the presentation of an automated proof constructivization algorithm
Rontsch, Raoul Horst. "Higher order QCD corrections to diboson production at hadron colliders". Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:5c4c3e7e-5c2a-4878-9fad-d9e5e0535d30.
Texto completoJenkins, Robert David. "Higher order energy transfer : quantum electrodynamical calculations and graphical representation". Thesis, University of East Anglia, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.327601.
Texto completo陸貴文 y Kwai-man Luk. "Complex-source-point theory of the higher-order modes in an open resonator". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1985. http://hub.hku.hk/bib/B31230532.
Texto completoSandfeld, Stefan. "Evolution of dislocation density in a higher-order continuum theory of dislocation plasticity". Thesis, University of Edinburgh, 2010. http://hdl.handle.net/1842/11367.
Texto completo