Tesi sul tema "Combinatorial statistics"
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Vedi i top-50 saggi (tesi di laurea o di dottorato) per l'attività di ricerca sul tema "Combinatorial statistics".
Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.
Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.
Vedi le tesi di molte aree scientifiche e compila una bibliografia corretta.
Ning, Michael Zhu. "Relational combinatorial optimisation". Thesis, University of Oxford, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.284507.
Testo completoOlsen, McCabe J. "HILBERT BASES, DESCENT STATISTICS, AND COMBINATORIAL SEMIGROUP ALGEBRAS". UKnowledge, 2018. https://uknowledge.uky.edu/math_etds/52.
Testo completoQuinn, Kathleen Anne Sara. "Combinatorial structures with applications to information theory". Thesis, Royal Holloway, University of London, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.261791.
Testo completoMarett, Richard Colin. "Neighbourhood search techniques for multi-objective combinatorial problems". Thesis, Lancaster University, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.296889.
Testo completoMcShine, Lisa Maria. "Random sampling of combinatorial structures". Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/28771.
Testo completoWilliams, Trevor K. "Combinatorial Games on Graphs". DigitalCommons@USU, 2017. https://digitalcommons.usu.edu/etd/6502.
Testo completoNiese, Elizabeth M. "Combinatorial Properties of the Hilbert Series of Macdonald Polynomials". Diss., Virginia Tech, 2010. http://hdl.handle.net/10919/26702.
Testo completoPh. D.
Hites, Romina. "Robustness and preferences in combinatorial optimization". Doctoral thesis, Universite Libre de Bruxelles, 2005. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210905.
Testo completoTherefore, in each of these new measures, a second criteria is used to evaluate the performance of the solution in other scenarios such as the best case one.
We also study the robust deviation p-elements problem. In fact, we study when this solution is equal to the optimal solution in the scenario where the cost of each element is the midpoint of its corresponding interval.
Then, we finally formulate the robust combinatorial problem with interval data as a bicriteria problem. We also integrate the decision maker's preferences over certain types of solutions into the model. We propose a method that uses these preferences to find the set of solutions that are never preferred by any other solution. We call this set the final set.
We study the properties of the final sets from a coherence point of view and from a robust point of view. From a coherence point of view, we study necessary and sufficient conditions for the final set to be monotonic, for the corresponding preferences to be without cycles, and for the set to be stable.
Those that do not satisfy these properties are eliminated since we believe these properties to be essential. We also study other properties such as the transitivity of the preference and indifference relations and more. We note that many of our final sets are included in one another and some are even intersections of other final sets. From a robust point of view, we compare our final sets with different measures of robustness and with the first- and second-degree stochastic dominance. We show which sets contain all of these solutions and which only contain these types of solutions. Therefore, when the decision maker chooses his preferences to find the final set, he knows what types of solutions may or may not be in the set.
Lastly, we implement this method and apply it to the Robust Shortest Path Problem. We look at how this method performs using different types of randomly generated instances.
Doctorat en sciences, Orientation recherche opérationnelle
info:eu-repo/semantics/nonPublished
Talebi, Mazraeh Shahi Mohammad Sadegh. "Minimizing Regret in Combinatorial Bandits and Reinforcement Learning". Doctoral thesis, KTH, Reglerteknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-219970.
Testo completoQC 20171215
Devlin, Agatha. "A study of parallel algorithms for the solution of some combinatorial optimization problems on a distributed array of processors". Thesis, Queen's University Belfast, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.282129.
Testo completoMarch, William B. "Multi-tree algorithms for computational statistics and phyiscs". Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/49116.
Testo completoTang, Yu. "Combinatorial properties of uniform designs and their applications in the constructions of low-discrepancy designs". HKBU Institutional Repository, 2005. http://repository.hkbu.edu.hk/etd_ra/595.
Testo completoTomczuk, Randal Wade. "Autocorrelation and decomposition methods in combinational logic design". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1996. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq21952.pdf.
Testo completoSportiello, Andrea. "Combinatorial methods in Statistical Field Theory : Trees, loops, dimers and orientations vs. Potts and non-linear σ-models". Doctoral thesis, Scuola Normale Superiore, 2010. http://hdl.handle.net/11384/85875.
Testo completoCalvet, Liñán Laura. "From metaheuristics to learnheuristics: Applications to logistics, finance, and computing". Doctoral thesis, Universitat Oberta de Catalunya, 2017. http://hdl.handle.net/10803/667118.
Testo completoUn gran número de procesos de toma de decisiones en sectores estratégicos como el transporte y la producción representan problemas NP-difíciles. Frecuentemente, estos problemas se caracterizan por altos niveles de incertidumbre y dinamismo. Las metaheurísticas son métodos populares para resolver problemas difíciles de optimización de manera rápida. Sin embargo, suelen asumir que los inputs, las funciones objetivo y las restricciones son deterministas y se conocen de antemano. Estas fuertes suposiciones conducen a trabajar con problemas simplificados. Como consecuencia, las soluciones obtenidas pueden tener un pobre rendimiento. Las simheurísticas integran simulación en metaheurísticas para resolver problemas estocásticos de una manera natural. De manera similar, las learnheurísticas combinan aprendizaje estadístico y metaheurísticas para abordar problemas en entornos dinámicos, donde los inputs pueden depender de la estructura de la solución. En este contexto, las principales aportaciones de esta tesis son: el diseño de las learnheurísticas, una clasificación de trabajos que combinan estadística / aprendizaje automático y metaheurísticas, y varias aplicaciones en transporte, producción, finanzas y computación.
A large number of decision-making processes in strategic sectors such as transport and production involve NP-hard problems, which are frequently characterized by high levels of uncertainty and dynamism. Metaheuristics have become the predominant method for solving challenging optimization problems in reasonable computing times. However, they frequently assume that inputs, objective functions and constraints are deterministic and known in advance. These strong assumptions lead to work on oversimplified problems, and the solutions may demonstrate poor performance when implemented. Simheuristics, in turn, integrate simulation into metaheuristics as a way to naturally solve stochastic problems, and, in a similar fashion, learnheuristics combine statistical learning and metaheuristics to tackle problems in dynamic environments, where inputs may depend on the structure of the solution. The main contributions of this thesis include (i) a design for learnheuristics; (ii) a classification of works that hybridize statistical and machine learning and metaheuristics; and (iii) several applications for the fields of transport, production, finance and computing.
Al-Khaledi, Zaid T. "Serial Testing for Detection of Multilocus Genetic Interactions". UKnowledge, 2019. https://uknowledge.uky.edu/statistics_etds/37.
Testo completoJarman, Ben. "Essays in optimal auction design". University of Sydney, 2008. http://hdl.handle.net/2123/4627.
Testo completoAuctions are an ancient economic institution. Since Vickrey (1961), the development of auction theory has lead to an extremely detailed description of the often desirable characteristics of these simple selling procedures, in the process explaining their enduring popularity. Given the pervasiveness of auctions, the question of how a seller should engineer the rules of these mechanisms to maximize her own profits is a central issue in the organization of markets. The seminal paper of Myerson (1981) shows that when facing buyers with Independent Private Values (IPVs) a standard auction with a specifically selected reserve price (or prices) is optimal, that is, maximizes a seller's expected profits among all conceivable selling mechanisms. In this model, it is assumed that the buyers have perfect information as to the existence of gains from trade. We shall argue that the consequences of this assumption for the design of the optimal auction are not well understood, which motivates our analysis. The three essays of this thesis relax the `known seller valuation' assumption by examining the optimal auction program when the seller (and principal) holds private information representing her reservation value for the good. In the first essay we provide an original technique for comparing ex ante expected profits across mechanisms for a seller facing N>1 potential buyers when all traders hold private information. Our technique addresses mechanisms that cannot be ranked point-by-point through their allocation rules using the Revenue Equivalence Theorem. We find conditions such that the seller's expected profits increase in the slope of each buyer's allocation probability function. This provides new intuition for the fact that a principal does not benefit from holding private information under risk neutrality. Monopoly pricing induces steep probability functions so the seller/principal benefits from announcing a fixed price, and implicitly her private information. An application is presented for the well known k double auction of the bilateral trade literature. In the second and third essays of this thesis, we extend the above framework to allow for informational externalities. Specifically, we allow for the situation in which the seller's private information represents a common value component in buyers' valuations. Thus the seller's private information (say regarding the quality of the good) is of interest to bidders independently of any strategic effects. In recent work Cai, Riley and Ye (2007) have demonstrated that a seller who holds private information about the quality of a good faces an extra consideration in designing an auction; the reserve price signals information to bidders. In a separating equilibrium signalling is costly in the sense that reserves are higher than would be optimal under complete information. We examine the returns to the seller in an English auction from using different types of secret reserve regimes. We find that immediate disclosure of a reserve is preferable to announcement after the auction in the form of a take-it-or-leave-it offer to the winning bidder. Sale occurs less often during the auction for a given reserve price strategy under secret reserve regimes, which increases the incentive for the seller to report more favourable information though the reserve price offer. Separating equilibria involving later announcement therefore generate even lower expected profits to the seller (signalling is more costly) than under immediate disclosure. In the third essay we compare the benchmark signalling equilibrium of immediate disclosure to a screening regime which we call the Right of Refusal. In this extreme form of a secret reserve the seller never announces the reserve price, she simply accepts or rejects the auction price. We find that the Right of Refusal dominates immediate disclosure if the seller's valuation is a sufficient statistic for the private information of interest. Thus a seller with market-relevant private preference information can benefit from not exercising monopoly price setting power. The result also provides conditions under which a competitive screening equilibrium is more efficient than a signalling mechanism. Broadly speaking, screening is better when the common value aspect in the preferences of the informed and uninformed parties are `aligned', and potential gains from trade to the uninformed party are significant. We believe this conclusion to be of particular interest to the design of privatization schemes.
Thapper, Johan. "Combinatorial Considerations on Two Models from Statistical Mechanics". Licentiate thesis, Linköping : Matematiska institutionen, Linköpings universitet, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-10141.
Testo completoPolettini, Matteo <1982>. "Geometric and Combinatorial Aspects of NonEquilibrium Statistical Mechanics". Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2012. http://amsdottorato.unibo.it/4305/1/polettini_matteo_tesi.pdf.
Testo completoPolettini, Matteo <1982>. "Geometric and Combinatorial Aspects of NonEquilibrium Statistical Mechanics". Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2012. http://amsdottorato.unibo.it/4305/.
Testo completoMorabito, David L. "Statistical mechanics of neural networks and combinatorial opimization problems /". Online version of thesis, 1991. http://hdl.handle.net/1850/11089.
Testo completoBriend, Simon. "Inference of the past of random structures and other random problems". Electronic Thesis or Diss., université Paris-Saclay, 2024. http://www.theses.fr/2024UPASM013.
Testo completoThis thesis is decomposed in three disjoint parts. The first two parts delve into dynamically growing networks. In the first part, we infer information about the past from a snapshot of the graph. We start by the problem of root finding, where the goal is to find confidence set for the root. We propose a method for uniform L-dags and analyse its performance. It is, to the best of our knowledge, the first method achieving network archaeology in general graphs. Then, we naturally extend the question of root finding to the one of seriation. Given a snapshot of a graph, is it possible to retrieve its whole ordering? We present a method and statistical guarantee of its quality in the case of uniform random recursive trees and linear preferential attachment tree. To conclude the network archaeology section, we study the root bit finding problem, where one does not try to infer the position of the root but its state. In such problems, the root is assigned a bit and is then propagated through a noisy channel during network growth. In the L-dag, we study majority voting to infer the bit of the root and we identify three different regimes depending on the noise level. In the second part of this thesis, we study the so called friendship tree, which is a random recursive tree model with complete redirection. This model display emerging properties, but unlike in the preferential attachment model they stem from a local attachment rule. We prove conjectures about degree distribution, diameter and local structure. Finally, we delve into the world of theoretical machine learning and data analysis. We study a random approximation of the Tukey depth. The Tukey depth is a powerful tool for data visualization and can be thought of as an extension of quantiles in higher dimension (they coincide in dimension 1). Its exact computation is NP-hard, and we study the performances of a classical random approximation in the case of data sets sampled from log-concave distribution
Rava, Andrea Basilio. "Quantum approximate optimization algorithm: combinatorial problems and classical statistical models". Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/23113/.
Testo completoDI, GIOACCHINO ANDREA. "EUCLIDEAN CORRELATIONS IN COMBINATORIAL OPTIMIZATION PROBLEMS: A STATISTICAL PHYSICS APPROACH". Doctoral thesis, Università degli Studi di Milano, 2019. http://hdl.handle.net/2434/693073.
Testo completoBeeler, Robert A. "How to Count: An Introduction to Combinatorics and Its Applications". Digital Commons @ East Tennessee State University, 2015. https://dc.etsu.edu/etsu_books/179.
Testo completohttps://dc.etsu.edu/etsu_books/1199/thumbnail.jpg
Mustafa, Nabil. "Approximations of Points: Combinatorics and Algorithms". Habilitation à diriger des recherches, Université Paris-Est, 2013. http://tel.archives-ouvertes.fr/tel-01062825.
Testo completoOliveira, Saullo Haniell Galvão de 1988. "On biclusters aggregation and its benefits for enumerative solutions = Agregação de biclusters e seus benefícios para soluções enumerativas". [s.n.], 2015. http://repositorio.unicamp.br/jspui/handle/REPOSIP/259072.
Testo completoDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação
Made available in DSpace on 2018-08-27T03:28:44Z (GMT). No. of bitstreams: 1 Oliveira_SaulloHaniellGalvaode_M.pdf: 1171322 bytes, checksum: 5488cfc9b843dbab6d7a5745af1e3d4b (MD5) Previous issue date: 2015
Resumo: Biclusterização envolve a clusterização simultânea de objetos e seus atributos, definindo mo- delos locais de relacionamento entre os objetos e seus atributos. Assim como a clusterização, a biclusterização tem uma vasta gama de aplicações, desde suporte a sistemas de recomendação, até análise de dados de expressão gênica. Inicialmente, diversas heurísticas foram propostas para encontrar biclusters numa base de dados numérica. No entanto, tais heurísticas apresen- tam alguns inconvenientes, como não encontrar biclusters relevantes na base de dados e não maximizar o volume dos biclusters encontrados. Algoritmos enumerativos são uma proposta recente, especialmente no caso de bases numéricas, cuja solução é um conjunto de biclusters maximais e não redundantes. Contudo, a habilidade de enumerar biclusters trouxe mais um cenário desafiador: em bases de dados ruidosas, cada bicluster original se fragmenta em vá- rios outros biclusters com alto nível de sobreposição, o que impede uma análise direta dos resultados obtidos. Essa fragmentação irá ocorrer independente da definição escolhida de co- erência interna no bicluster, sendo mais relacionada com o próprio nível de ruído. Buscando reverter essa fragmentação, nesse trabalho propomos duas formas de agregação de biclusters a partir de resultados que apresentem alto grau de sobreposição: uma baseada na clusteriza- ção hierárquica com single linkage, e outra explorando diretamente a taxa de sobreposição dos biclusters. Em seguida, um passo de poda é executado para remover objetos ou atributos indesejados que podem ter sido incluídos como resultado da agregação. As duas propostas foram comparadas entre si e com o estado da arte, em diversos experimentos, incluindo bases de dados artificiais e reais. Essas duas novas formas de agregação não só reduziram significa- tivamente a quantidade de biclusters, essencialmente defragmentando os biclusters originais, mas também aumentaram consistentemente a qualidade da solução, medida em termos de precisão e recuperação, quando os biclusters são conhecidos previamente
Abstract: Biclustering involves the simultaneous clustering of objects and their attributes, thus defin- ing local models for the two-way relationship of objects and attributes. Just like clustering, biclustering has a broad set of applications, ranging from an advanced support for recom- mender systems of practical relevance to a decisive role in data mining techniques devoted to gene expression data analysis. Initially, heuristics have been proposed to find biclusters, and their main drawbacks are the possibility of losing some existing biclusters and the inca- pability of maximizing the volume of the obtained biclusters. Recently efficient algorithms were conceived to enumerate all the biclusters, particularly in numerical datasets, so that they compose a complete set of maximal and non-redundant biclusters. However, the ability to enumerate biclusters revealed a challenging scenario: in noisy datasets, each true bicluster becomes highly fragmented and with a high degree of overlapping, thus preventing a direct analysis of the obtained results. Fragmentation will happen no matter the boundary condi- tion adopted to specify the internal coherence of the valid biclusters, though the degree of fragmentation will be associated with the noise level. Aiming at reverting the fragmentation, we propose here two approaches for properly aggregating a set of biclusters exhibiting a high degree of overlapping: one based on single linkage and the other directly exploring the rate of overlapping. A pruning step is then employed to filter intruder objects and/or attributes that were added as a side effect of aggregation. Both proposals were compared with each other and also with the actual state-of-the-art in several experiments, including real and artificial datasets. The two newly-conceived aggregation mechanisms not only significantly reduced the number of biclusters, essentially defragmenting true biclusters, but also consistently in- creased the quality of the whole solution, measured in terms of Precision and Recall when the composition of the dataset is known a priori
Mestrado
Engenharia de Computação
Mestre em Engenharia Elétrica
Wingkono, Gracy A. "Combinatorial Technique for Biomaterial Design". Thesis, Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/7264.
Testo completoBorrotti, Matteo <1981>. "An evolutionary approach to the design of experiments for combinatorial optimization with an application to enzyme engineering". Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2011. http://amsdottorato.unibo.it/3422/1/Matteo_Borrotti_tesi.pdf.
Testo completoBorrotti, Matteo <1981>. "An evolutionary approach to the design of experiments for combinatorial optimization with an application to enzyme engineering". Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2011. http://amsdottorato.unibo.it/3422/.
Testo completoStreib, Amanda Pascoe. "Markov chains at the interface of combinatorics, computing, and statistical physics". Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/43628.
Testo completoRohwer, Christian Matthias. "Combinatorics and dynamics in polymer knots". Thesis, Stellenbosch : Stellenbosch University, 2014. http://hdl.handle.net/10019.1/86706.
Testo completoENGLISH ABSTRACT: In this dissertation we address the conservation of topological states in polymer knots. Topological constraints are frequently included into theoretical descriptions of polymer systems through invariants such as winding numbers and linking numbers of polynomial invariants. In contrast, our approach is based on sequences of manipulations of knots that maintain a given knot's topology; these are known as Reidemeister moves. We begin by discussing basic properties of knots and their representations. In particular, we show how the Reidemeister moves may be viewed as rules for dynamics of crossings in planar projections of knots. Thereafter we consider various combinatoric enumeration procedures for knot configurations that are equivalent under chosen topological constraints. Firstly, we study a reduced system where only the zeroth and first Reidemeister moves are allowed, and present a diagrammatic summation of all contributions to the associated partition function. The partition function is then calculated under basic simplifying assumptions for the Boltzmann weights associated with various configurations. Secondly, we present a combinatoric scheme for enumerating all topologically equivalent configurations of a polymer strand that is wound around a rod and closed. This system has the constraint of a fixed winding number, which may be viewed in terms of manipulations that obey a Reidemeister move of the second kind of the polymer relative to the rod. Again configurations are coupled to relevant statistical weights, and the partition function is approximated. This result is used to calculate various physical quantities for confined geometries. The work in that chapter is based on a recent publication, "Conservation of polymer winding states: a combinatoric approach", C.M. Rohwer, K.K. Müller-Nedebock, and F.-E. Mpiana Mulamba, J. Phys. A: Math. Theor. 47 (2014) 065001. The remainder of the dissertation is concerned with a dynamical description of the Reidemeister moves. We show how the rules for crossing dynamics may be addressed in an operator formalism for stochastic dynamics. Differential equations for densities and correlators for crossings on strands are calculated for some of the Reidemeister moves. These quantities are shown to encode the relevant dynamical constraints. Lastly we sketch some suggestions for the incorporation of themes in this dissertation into an algorithm for the simulated annealing of knots.
AFRIKAANSE OPSOMMING: In hierdie tesis ondersoek ons die behoud van topologiese toestande in knope. Topologiese dwangvoorwaardes word dikwels d.m.v. invariante soos windingsgetalle, skakelgetalle en polinomiese invariante in die teoretiese beskrywings van polimere ingebou. In teenstelling hiermee is ons benadering gebaseer op reekse knoopmanipulasies wat die topologie van 'n gegewe knoop behou - die sogenaamde Reidemeisterskuiwe. Ons begin met 'n bespreking van die basiese eienskappe van knope en hul daarstellings. Spesi ek toon ons dat die Reidemeisterskuiwe beskryf kan word i.t.v. reëls vir die dinamika van kruisings in planêre knoopprojeksies. Daarna beskou ons verskeie kombinatoriese prosedures om ekwivalente knoopkon gurasies te genereer onderhewig aan gegewe topologiese dwangvoorwaardes. Eerstens bestudeer ons 'n vereenvoudigde sisteem waar slegs die nulde en eerste Reidemeisterskuiwe toegelaat word, en lei dan 'n diagrammatiese sommasie van alle bydraes tot die geassosieerde toestandsfunksie af. Die partisiefunksie word dan bereken onderhewig aan sekere vereenvoudigende aannames vir die Boltzmanngewigte wat met die verskeie kon- gurasies geassosieer is. Tweedens stel ons 'n kombinatoriese skema voor om ekwivalente kon gurasies te genereer vir 'n polimeer wat om 'n staaf gedraai word. Die beperking tot 'n vaste windingsgetal in hierdie sisteem kan daargestel word i.t.v. 'n Reidemeister skuif van die polimeer t.o.v. die staaf. Weereens word kon gurasies gekoppel aan relevante statistiese gewigte en die partisiefunksie word benader. Verskeie siese hoeveelhede word dan bereken vir beperkte geometrie e. Die werk in di e hoofstuk is gebaseer op 'n onlangse publikasie, "Conservation of polymer winding states: a combinatoric approach", C.M. Rohwer, K.K. Müller-Nedebock, and F.-E. Mpiana Mulamba, J. Phys. A: Math. Theor. 47 (2014) 065001. Die res van die tesis handel oor 'n dinamiese beskrywing van die Reidemeisterskuiwe. Ons toon hoe die re els vir kruisingsdinamika beskryf kan word i.t.v. 'n operatorformalisme vir stochastiese dinamika. Di erensiaalvergelykings vir digthede en korrelatore vir kruisings op stringe word bereken vir sekere Reidemeisterskuiwe. Daar word getoon dat hierdie hoeveelhede die relevante dinamiese beperkings respekteer. Laastens maak ons 'n paar voorstelle vir hoe idees uit hierdie tesis geï nkorporeer kan word in 'n algoritme vir die gesimuleerde vereenvoudiging van knope.
Lee, Jonathan David. "Probabilistic combinatorics in factoring, percolation and related topics". Thesis, University of Cambridge, 2015. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.709255.
Testo completoMartin, Russell Andrew. "Paths, sampling, and markov chain decomposition". Diss., Georgia Institute of Technology, 2001. http://hdl.handle.net/1853/29383.
Testo completoHan, Bin. "Gamma positivity in enumerative combinatorics". Thesis, Lyon, 2019. http://www.theses.fr/2019LYSE1115/document.
Testo completoThe gamma positivity of a combinatorial sequence unifies both unimodality and symmetry. Finding new family of objets whose enumerative sequences have gamma positivity is a challenge and important topic in recent years. it has received considerable attention in recent times because of Gal’s conjecture, which asserts that the gamma-vector has nonnegative entries for any flag simple polytope. Often times, the h-polynomial for simplicial polytopes of combinatorial signification can be given as a generating function over a related set of combinatorial objects with respect to some statistic like the descent numbers, whose enumerative polynomials on permutations are Eulerian polynomials.This work deals with the gamma properties of several enumerative polynomials of permutation such as Eulerian polynomials and Narayana polynomials. This thesis contains five chapters
Farr, Graham E. "Topics in computational complexity". Thesis, University of Oxford, 1986. http://ora.ox.ac.uk/objects/uuid:ad3ed1a4-fea4-4b46-8e7a-a0c6a3451325.
Testo completoBoberg, Jonas. "Counting Double-Descents and Double-Inversions in Permutations". Thesis, Mälardalens högskola, Akademin för utbildning, kultur och kommunikation, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-54431.
Testo completoMohan, Sidharth. "Consensus, Correlation And Combinatorics Based Approaches In Engineering And Exploring Triosephosphate Isomerase Stability". The Ohio State University, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=osu1503054678218166.
Testo completoRiggle, Matthew. "Runs of Identical Outcomes in a Sequence of Bernoulli Trials". TopSCHOLAR®, 2018. https://digitalcommons.wku.edu/theses/2451.
Testo completoNoel, Jonathan A. "Extremal combinatorics, graph limits and computational complexity". Thesis, University of Oxford, 2016. https://ora.ox.ac.uk/objects/uuid:8743ff27-b5e9-403a-a52a-3d6299792c7b.
Testo completoKam-Thong, Tony Verfasser], e Klaus-Robert [Akademischer Betreuer] [Müller. "Massive parallelization of combinatorial statistical genetics analyses porting machine learning methods on general purpose graphics processing units (GPU) / Tony Kam-Thong. Betreuer: Klaus Robert Müller". Berlin : Universitätsbibliothek der Technischen Universität Berlin, 2012. http://d-nb.info/102553879X/34.
Testo completoKang, Ross J. "Improper colourings of graphs". Thesis, University of Oxford, 2008. http://ora.ox.ac.uk/objects/uuid:a93d8303-0eeb-4d01-9b77-364113b81a63.
Testo completoHahn-Klimroth, Maximilian Grischa [Verfasser], Amin [Akademischer Betreuer] Coja-Oghla, Yury [Akademischer Betreuer] Person, Amin [Gutachter] Coja-Oghlan e Uriel [Gutachter] Feige. "Large discrete structures : statistical inference, combinatorics and limits / Maximilian Grischa Hahn-Klimroth ; Gutachter: Amin Coja-Oghlan, Uriel Feige ; Amin Coja-Oghla, Yury Person". Frankfurt am Main : Universitätsbibliothek Johann Christian Senckenberg, 2021. http://d-nb.info/1239730039/34.
Testo completoSamimi, Peyman. "Combinatorial Assessment of the Influence of Composition and Exposure Time on the Oxidation Behavior and Concurrent Oxygen-induced Phase Transformations of Binary Ti-x Systems". Thesis, University of North Texas, 2015. https://digital.library.unt.edu/ark:/67531/metadc801898/.
Testo completoWarnke, Lutz. "Random graph processes with dependencies". Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:71b48e5f-a192-4684-a864-ea9059a25d74.
Testo completoRasnick, Rebecca. "Generalizations of the Arcsine Distribution". Digital Commons @ East Tennessee State University, 2019. https://dc.etsu.edu/etd/3565.
Testo completoEkiz, Funda. "Cagan Type Rational Expectations Model on Time Scales with Their Applications to Economics". TopSCHOLAR®, 2011. http://digitalcommons.wku.edu/theses/1126.
Testo completoMohan, Rathish. "Algorithmic Optimization of Sensor Placement on Civil Structures for Fault Detection and Isolation". University of Cincinnati / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1353156107.
Testo completoSadeghi, Kayvan. "Graphical representation of independence structures". Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:86ff6155-a6b9-48f9-9dac-1ab791748072.
Testo completoKelley, Logan. "The Quantum Dialectic". Scholarship @ Claremont, 2011. http://scholarship.claremont.edu/pitzer_theses/4.
Testo completo