Dissertations / Theses on the topic 'Generalized graphs'
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 'Generalized graphs.'
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.
Hennayake, Kamal P. "Generalized edge connectivity in graphs." Morgantown, W. Va. : [West Virginia University Libraries], 1998. http://etd.wvu.edu/templates/showETD.cfm?recnum=383.
Title from document title page. Document formatted into pages; contains v, 87 p. : ill. Includes abstract. Includes bibliographical references (p. 64-72).
Pensaert, William. "Hamilton Paths in Generalized Petersen Graphs." Thesis, University of Waterloo, 2002. http://hdl.handle.net/10012/1198.
Ali, Seema. "Colouring generalized Kneser graphs and homotopy theory." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape15/PQDD_0014/MQ34938.pdf.
Nukala, Murthy V. R. K. N. "Generalized models of design iteration using signal flow graphs." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/11486.
Werner, Rose-Line. "Concrete constructions of unbalanced bipartite expander graphs and generalized conductors." Zürich : ETH, Eidgenössische Technische Hochschule Zürich, Departement Informatik, Institut für Informationssysteme, 2008. http://e-collection.ethbib.ethz.ch/show?type=dipl&nr=389.
Sanford, Alice Jewel. "Cycle spectra, automorphic uniqueness, and isomorphism classes of generalized Petersen graphs /." Full text available from ProQuest UM Digital Dissertations, 2005. http://0-proquest.umi.com.umiss.lib.olemiss.edu/pqdweb?index=0&did=1264606591&SrchMode=1&sid=3&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1185199901&clientId=22256.
Sharifiyazdi, Elham [Verfasser]. "The clique number of generalized Hamming graphs / submitted by Elham Sharifiyazdi." [Clausthal-Zellerfeld] : [Univ.-Bibliothek], 2007. http://d-nb.info/986579076/34.
Knechtel, lessa Micheli. "Extended Generalized Blockmodeling." Thesis, Avignon, 2021. http://www.theses.fr/2021AVIG0281.
Blockmodeling is a set of techniques initially designed to analyse social networks but whose practical interest becomes larger, as we will see further in this thesis for terminology graphs. One of the goals of blockmodeling is to reduce a large, potentially incoherent network to a smaller comprehensible structure that can be interpreted more readily. There is great interest in capturing the cluster structure of a network in terms of equivalences, blocks and partitions. Up to now, most blockmodeling methods are focused in fitting the network structure to only one type of structure pattern. However, there are a variety of social networking applications in which it is interesting to consider more than one type of pattern simultaneously, so that the structure of the network can take the form of several indicators for underlying relationships. The research question is, how to deal with the situations where an analyst has several relations types of relations for a set of actors. Thus, we propose an optimization model, which we call the extended generalized blockmodeling. The main objective of extended generalized blockmodeling is to find the partition size and the set of patterns that has the best representation of the network structure. The extended generalized blockmodeling expands the possibilities of the framework, making it possible to analyze networks without any prior knowledge about them. The extended generalized block modeling belongs to the class of highly combinatorial problems, the exact method is only suitable for small networks, so the second question is how to make this approach viable for medium and large networks. Therefore, we propose the first non-exact approach to generalized extended block modeling, based on the VNS algorithm as an alternative for medium-sized networks. Even though the results found by the heuristic may not be the best of all the solutions to the problem, the experiments show that it converges to a satisfactory result in a not prohibitively long time. The third question, which we address in this thesis, is the extended generalized blockmodeling a suitable approach in the field of bibliometrics and Natural Language processing. To do so, we analyse the network of terms concerning terrorism research. For all these questions, we demonstrate the numerical results, based on artificial and real datasets benchmarks. These results allow the exploration of the application opportunities of the extended generalized block modeling as well as it’s limitations
Djang, Claire. "Two-Coloring Cycles In Complete Graphs." Oberlin College Honors Theses / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=oberlin1370618319.
Mooney, Christopher Park. "Generalized factorization in commutative rings with zero-divisors." Thesis, The University of Iowa, 2013. http://pqdtopen.proquest.com/#viewpdf?dispub=3595128.
The study of factorization in integral domains has a long history. Unique factorization domains, like the integers, have been studied extensively for many years. More recently, mathematicians have turned their attention to generalizations of this such as Dedekind domains or other domains which have weaker factorization properties. Many authors have sought to generalize the notion of factorization in domains. One particular method which has encapsulated many of the generalizations into a single study is that of τ-factorization, studied extensively by A. Frazier and D.D. Anderson.
Another generalization comes in the form of studying factorization in rings with zero-divisors. Factorization gets quite complicated when zero-divisors are present due to the existence of several types of associate relations as well as several choices about what to consider the irreducible elements.
In this thesis, we investigate several methods for extending the theory of τ-factorization into rings with zero-divisors. We investigate several methods including: 1) the approach used by A.G. Agˇargün and D.D. Anderson, S. Chun and S. Valdes-Leon in several papers; 2) the method of U-factorization developed by C.R. Fletcher and extended by M. Axtell, J. Stickles, and N. Baeth and 3) the method of regular factorizations and 4) the method of complete factorizations.
This thesis synthesizes the work done in the theory of generalized factorization and factorization in rings with zero-divisors. Along the way, we encounter several nice applications of the factorization theory. Using τ z-factorizations, we discover a nice relationship with zero-divisor graphs studied by I. Beck as well as D.D. Anderson, D.F. Anderson, A. Frazier, A. Lauve, and P. Livingston. Using τ-U-factorization, we are able to answer many questions that arise when discussing direct products of rings.
There are several benefits to the regular factorization factorization approach due to the various notions of associate and irreducible coinciding on regular elements greatly simplifying many of the finite factorization property relationships. Complete factorization is a very natural and effective approach taken to studying factorization in rings with zero-divisors. There are several nice results stemming from extending τ-factorization in this way. Lastly, an appendix is provided in which several examples of rings satisfying the various finite factorization properties studied throughout the thesis are given.
Sibel, Jean-Christophe. "Region-based approximation to solve inference in loopy factor graphs : decoding LDPC codes by the Generalized Belief Propagation." Phd thesis, Université de Cergy Pontoise, 2013. http://tel.archives-ouvertes.fr/tel-00905668.
Pfingsthorn, Max [Verfasser], Andreas [Akademischer Betreuer] Birk, Kausthubh [Akademischer Betreuer] Pathak, and Udo [Akademischer Betreuer] Frese. "Generalized Simultaneous Localization and Mapping (SLAM) on Graphs with Multimodal Probabilities and Hyperedges / Max Pfingsthorn. Betreuer: Andreas Birk. Gutachter: Andreas Birk ; Kausthubh Pathak ; Udo Frese." Bremen : IRC-Library, Information Resource Center der Jacobs University Bremen, 2014. http://d-nb.info/1087295173/34.
Farrugia, Alastair. "Uniqueness and Complexity in Generalised Colouring." Thesis, University of Waterloo, 2003. http://hdl.handle.net/10012/1018.
Vandomme, Elise. "Contributions to combinatorics on words in an abelian context and covering problems in graphs." Thesis, Université Grenoble Alpes (ComUE), 2015. http://www.theses.fr/2015GRENM010/document.
This dissertation is divided into two (distinct but connected) parts that reflect the joint PhD. We study and we solve several questions regarding on the one hand combinatorics on words in an abelian context and on the other hand covering problems in graphs. Each particular problem is the topic of a chapter. In combinatorics on words, the first problem considered focuses on the 2-regularity of sequences in the sense of Allouche and Shallit. We prove that a sequence satisfying a certain symmetry property is 2-regular. Then we apply this theorem to show that the 2-abelian complexity functions of the Thue--Morse word and the period-doubling word are 2-regular. The computation and arguments leading to these results fit into a quite general scheme that we hope can be used again to prove additional regularity results. The second question concerns the notion of return words up to abelian equivalence, introduced by Puzynina and Zamboni. We obtain a characterization of Sturmian words with non-zero intercept in terms of the finiteness of the set of abelian return words to all prefixes. We describe this set of abelian returns for the Fibonacci word but also for the Thue-Morse word (which is not Sturmian). We investigate the relationship existing between the abelian complexity and the finiteness of this set. In graph theory, the first problem considered deals with identifying codes in graphs. These codes were introduced by Karpovsky, Chakrabarty and Levitin to model fault-diagnosis in multiprocessor systems. The ratio between the optimal size of an identifying code and the optimal size of a fractional relaxation of an identifying code is between 1 and 2 ln(|V|)+1 where V is the vertex set of the graph. We focus on vertex-transitive graphs, since we can compute the exact fractional solution for them. We exhibit infinite families, called generalized quadrangles, of vertex-transitive graphs with integer and fractional identifying codes of order |V|^k with k in {1/4,1/3,2/5}. The second problem concerns (r,a,b)-covering codes of the infinite grid already studied by Axenovich and Puzynina. We introduce the notion of constant 2-labellings of weighted graphs and study them in four particular weighted cycles. We present a method to link these labellings with covering codes. Finally, we determine the precise values of the constants a and b of any (r,a,b)-covering code of the infinite grid with |a-b|>4. This is an extension of a theorem of Axenovich
Jiang, Yiting. "Many aspects of graph coloring." Electronic Thesis or Diss., Université Paris Cité, 2022. https://wo.app.u-paris.fr/cgi-bin/WebObjects/TheseWeb.woa/wa/show?t=5613&f=42533.
Graph coloring is a central topic in graph theory, and various coloring concepts have been studied in the literature. This thesis studies some of the coloring concepts and related problems. These include coloring of generalized signed graphs, strong fractional choice number of graphs, generalized coloring number of graphs, twin-width of graphs, (combinatorial) discrepancy of definable set systems and chi_p-bounded classes of graphs. A signed graph is a pair (G, sigma), where G is a graph and sigma: E(G) to {+,-} is a signature. A generalized signed graph is also a pair (G, sigma), where the signature sigma assigns to each edge e a permutation sigma(e) in a set S as its sign. In a coloring of a signed graph or a generalized signed graph (G, sigma), the sign sigma(e) determines the pairs of colors that need to be avoided as the colors of the end vertices of e. Let S_k be the set of all permutations of [k]. A natural question motivated by the four color theorem is for which subsets S of S_4, every planar graph is S-4-colorable. This question is now completely answered: only S={id} has this property, which means that the four color theorem is tight in the sense of generalized signed graph coloring. This answer is obtained in a sequence of six papers, by different groups of authors. The contribution of this thesis is the results in one of the papers, which shows that many sets S do not have the desired property. The thesis also considers similar questions for triangle-free planar graphs, which can be viewed as exploring the tightness of Grötzsch Theorem. Our result shows that for any subset S of S_3, if S is not conjugate to a subset of {id, (12)}, then there exists a triangle-free planar graph which is not S-3-colorable. Another attempt to strengthen Grötzsch Theorem is to consider multiple list coloring of triangle-free planar graphs. It was proved by Voigt that there are triangle-free planar graphs that are not 3-choosable. This thesis strengthens Voigt's result by considering the strong fractional choice number of graphs and proves that the supremum of the strong fractional choice number of triangle-free planar graphs is at least 3+1/17. One important subject in structural graph theory is to study the structural complexity of graphs or classes of graphs and a few concepts and graph invariants are studied extensively in the literature. These include treewidth of graphs, generalized coloring number, etc. Recently, the concept of twin-width was introduced by Bonnet, Kim, Thomassé and Watrigant. In this thesis, we study the relation between twin-width and generalized coloring number. We prove that a graph $G$ with no K_{s,s}-subgraph and twin-width d has strong(weak) r-coloring numbers bounded by an exponential function of r and that we can construct graphs achieving such a dependency in r. One of the two central notions in structural theory of classes of sparse graphs is the classes with bounded expansion. These classes have strong algorithmic and structural properties and enjoy numerous characterizations and applications. Combinatorial discrepancy is a significant subject in its own right. It measures the inevitable irregularities of set systems and the inherent difficulty to approximate them. In this thesis, we give a new characterization of bounded expansion classes in terms of discrepancy of definable set systems. The notion of chi-boundedness is a central topic in chromatic graph theory. This thesis studies chi-bounded classes in the context of star colorings and, more generally, chi_p-colorings, say chi_s-bounded and (strongly and weakly) chi_p-bounded classes. This fits to a general scheme of sparsity and leads to natural extensions of the notion of bounded expansion class. Here we solve two conjectures related to star coloring ({i.e.} chi_2) boundedness and give structural characterizations of strongly chi_p-bounded classes and weakly chi_p-bounded classes
Kostic, Dimitrije Nenad. "Graph searching and a generalized parking function." [College Station, Tex. : Texas A&M University, 2007. http://hdl.handle.net/1969.1/ETD-TAMU-1549.
Pedrosa, Diogo Pinheiro Fernandes. "Mapeamento de ambientes estruturados com extra??o de informa??es geom?tricas atrav?s de dados sensoriais." Universidade Federal do Rio Grande do Norte, 2006. http://repositorio.ufrn.br:8080/jspui/handle/123456789/15114.
Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior
The objective of this thesis is proposes a method for a mobile robot to build a hybrid map of an indoor, semi-structured environment. The topological part of this map deals with spatial relationships among rooms and corridors. It is a topology-based map, where the edges of the graph are rooms or corridors, and each link between two distinct edges represents a door. The metric part of the map consists in a set of parameters. These parameters describe a geometric figure which adapts to the free space of the local environment. This figure is calculated by a set of points which sample the boundaries of the local free space. These points are obtained with range sensors and with knowledge about the robot s pose. A method based on generalized Hough transform is applied to this set of points in order to obtain the geomtric figure. The building of the hybrid map is an incremental procedure. It is accomplished while the robot explores the environment. Each room is associated with a metric local map and, consequently, with an edge of the topo-logical map. During the mapping procedure, the robot may use recent metric information of the environment to improve its global or relative pose
Esta tese tem o objetivo de propor uma metodologia para constru??o de um mapa h?brido de um ambiente interno. A parte topol?gica da representa??o trata das rela??es de conectividade existentes entre as salas e corredores, sendo assim um grafo que representa a topologia do ambiente global. A parte m?trica consiste em armazenar um conjunto de par?metros que descreve uma figura geom?trica plana que melhor se ajusta ao espa?o livre local. Esta figura ? calculada atrav?s do conhecimento de pontos, ou amostras, dos limites do espa?o livre. Estes pontos s?o obtidos com sensores de dist?ncia e a informa??o ? complementada com a estimativa da pose do rob?. Uma vez que estes pontos est?o determinados, o rob? ent?o aplica uma ferramenta baseada na transformada generalizada de Hough para obter a figura em quest?o. O processo de constru??o do mapa ? incremental e totalmente realizado enquanto o rob? explora o ambiente. Cada sala ? representada por este mapa local e cada n? do grafo que representa a topologia do ambiente est? associado a este mapa. Durante o mapeamento o rob? pode utilizar as informa??es rec?m-adquiridas do ambiente para obter uma melhor estimativa de sua pose global ou relativa a uma sala ou corredor
Cano, Vila María del Pilar. "Generalized Delaunay triangulations : graph-theoretic properties and algorithms." Doctoral thesis, Universitat Politècnica de Catalunya, 2020. http://hdl.handle.net/10803/669310.
Esta tesis estudia diferentes generalizaciones de la triangulación de Delaunay, tanto desde un punto de vista combinatorio como algorítmico. La triangulación de Delaunay de un conjunto de puntos S, denotada DT(S), tiene como conjunto de vértices a S. Una arista uv está en DT(S) si satisface la propiedad del círculo vacío: existe un círculo con u y v en su frontera que no contiene ningún punto de S en su interior. Debido a distintos criterios de optimización, se han propuesto varias generalizaciones de la DT (S). Hoy en día, se conocen bastantes propiedades de la DT(S), sin embargo, poco se sabe sobre sus generalizaciones. La pregunta principal que exploramos es: ¿Hasta qué punto las propiedades de la DT(S) se pueden extender para generalizaciones de gráficas de Delaunay? Primero, exploramos la conectividad de la gráfica de flips de las triangulaciones de Delaunay de orden alto de un conjunto de puntos S en el plano. La gráfica de flips de triangulaciones de orden k = 3 podría ser disconexa, sin embargo, nosotros damos una cota superior e inferior para la distancia en flips de una triangulación de orden k a alguna otra cuando S cumple con ciertas características. Luego, probamos que existe una secuencia de árboles generadores sin cruces tal que la suma total de la longitud de las aristas con respecto a una distancia convexa arbitraria es decreciente y converge al árbol generador mínimo con respecto a la distancia correspondiente. Cada par de árboles consecutivos en la secuencia se encuentran en una triangulación de Delaunay con restricciones. Adicionalmente, damos una cota superior lineal para la longitud de la secuencia y cotas específicas cuando el conjunto convexo es un cuadrado. Aún concentrados en distancias convexas, estudiamos hamiltonicidad en las gráficas de Delaunay de distancia convexa de k-orden. Dependiendo en la distancia convexa, exhibimos diversas cotas superiores para el mínimo valor de k que satisface que la gráfica de Delaunay de distancia convexa de orden-k es hamiltoniana. También damos cotas inferiores para k cuando el conjunto convexo pertenece a un conjunto de ciertos polígonos regulares. Finalmente, re-visitamos una triangulación afín invariante, la cual es un caso especial de triangulación de Delaunay de distancia convexa. Probamos que muchas propiedades de la triangulación de Delaunay estándar se preservan en estas triangulaciones. Además, motivados por esta triangulación afín invariante, estudiamos diferentes algoritmos que producen otros objetos geométricos afín invariantes.
Collyer, Thomas P. A. "On generalised Farey graphs and applications to the curve complex." Thesis, University of Warwick, 2012. http://wrap.warwick.ac.uk/56823/.
Choset, Howie M. Burdick Joel Wakeman Burdick Joel Wakeman. "Sensor based motion planning : the hierarchical generalized Voronoi graph /." Diss., Pasadena, Calif. : California Institute of Technology, 1996. http://resolver.caltech.edu/CaltechETD:etd-12182007-090504.
Yirci, Murat. "Arrangements 2D pour la Cartographie de l’Espace Public et des Transports." Thesis, Paris Est, 2016. http://www.theses.fr/2016PESC1075/document.
This thesis addresses easy and effective development of mapping and transportation applications which especially focuses on the generation of pedestrian networks for applications like navigation, itinerary calculation, accessibility analysis and urban planning. In order to achieve this goal, we proposed a two layered data model which encodes the public space into a hierarchy of semantic geospatial objects. At the lower level, the 2D geometry of the geospatial objects are captured using a planar partition which is represented as a topological 2D arrangement. This representation of a planar partition allows efficient and effective geometry processing and easy maintenance and validation throughout the editions when the geometry or topology of an object is modified. At the upper layer, the semantic and thematic aspects of geospatial objects are modelled and managed. The hierarchy between these objects is maintained using a directed acyclic graph (DAG) in which the leaf nodes correspond to the geometric primitives of the 2D arrangement and the higher level nodes represent the aggregated semantic geospatial objects at different levels. We integrated the proposed data model into our GIS framework called StreetMaker together with a set of generic algorithms and basic GIS capabilities. This framework is then rich enough to generate pedestrian network graphs automatically. In fact, within an accessibility analysis project, the full proposed pipeline was successfully used on two sites to produce pedestrian network graphs from various types of input data: existing GIS vector maps, semi-automatically created vector data and vector objects extracted from Mobile Mapping lidar point clouds.While modelling 2D ground surfaces may be sufficient for 2D GIS applications, 3D GIS applications require 3D models of the environment. 3D modelling is a very broad topic but as a first step to such 3D models, we focused on the semi-automatic modelling of objects which can be modelled or approximated by generalized cylinders (such as poles, lampposts, tree trunks, etc.) from single images. The developed methods and techniques are presented and discussed
Travers, Brian J. "New results for Z-cyclic generalized whist tournaments and Z-cyclic generalized whist frames /." View online ; access limited to URI, 2004. http://0-wwwlib.umi.com.helin.uri.edu/dissertations/dlnow/3135919.
Begeot, Jocelyn. "Autour de la stabilité de différents modèles d'appariements aléatoires." Electronic Thesis or Diss., Université de Lorraine, 2022. http://www.theses.fr/2022LORR0201.
Stochastic matching models represent many concrete stochastic systems in which elements of different classes are matched according to specified compatibility rules. For example, we can cite systems dedicated to organs allocation, job search sites, housing allocation programs, etc. Such models are typically associated to a triplet of elements: a connected graph, called compatibility graph, whose vertices represent the classes of elements that can enter the system and whose edges connect two compatible classes, amatching policy which decides the matches to be concretely executed, in case of multiple choices, and an arrival rate according to which the elements enter within it. In this thesis, we consider generalized graphs, meaning that we allow the matching of two elements of the same class, and we therefore extend to this framework some results already known in the case of simple graphs.The stability of a system governed by a matching model is a very important property. It ensures that the admissions within the system under study, are regulated, so that the elements do not accumulate in the system in the long run. It is therefore essential that the arrival rate of the elements allows the system to be stable. In this manuscript, we characterize, algebraically, this stability region for some matching models (general, general with reneging, bipartite, extended bipartite) or skill-based queueing systems.Moreover, we demonstrate that the matching policy called First Come, First Matched (FCFM) has the property of being (generalized) maximal, meaning that the stability region of the general matching model associated with a compatibility graph and with any policy is always included in the one associated with this same graph and ruled by FCFM. Note that this latter then coincides with a set of measures defined by purely algebraic conditions. In this case, the study of stability of the matching model at hand boils down to the more elementary question of characterizing of a deterministic set of measures. We then givea (simple) way to construct the measures belonging to the latter set. This turns out to be very useful for admission control, as checking the algebraic conditions requires a number of operations which is polynomial in the number of vertices of the considered compatibility graph, and therefore becomes very expensive as the number of vertices grows large.We also give, in a product form, the expression of the stationary distribution of the number-in-system process of a stable system governed by a general matching model and under the FCFM policy, allowing, in particular, to explicitly calculate characteristics at equilibrium of concrete systems and to estimate their long-time performance. We can thus, for example, calculate the size average at equilibrium of a waiting list in the case of cross-donation of kidneys, or even, estimate the average waiting time on a peer-to-peerinterface or on a dating website.Finally, the matching rates associated with a stable matching model (general or extended bipartite) are studied. They are defined as the asymptotic frequencies of the executed respective matchings, and provide an insightful performance criterion for the corresponding matching systems, as well as the policy-insensitivity and fairness properties of the matching rates, which are also discussed
Ghidelli, Luca. "On Gaps Between Sums of Powers and Other Topics in Number Theory and Combinatorics." Thesis, Université d'Ottawa / University of Ottawa, 2020. http://hdl.handle.net/10393/40014.
Bouazza, Syrine. "Contrôle des processus de désassemblage à l'aide des formalismes des systèmes à évènements discrets." Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPAST215.
Disassembly process control involves the methods and techniques used to safely and efficiently disassemble mechanical components or complex assemblies. To do this, control approaches are developed to satisfy the constraints imposed on these systems. More specifically, in this thesis we are interested in three types of specifications: marking constraints, Generalized Marking Constraints (GMCs), and Mutual Exclusion Constraints (MECs).To this aim, we have proposed three analytical methods. The first contribution concerns a new technique for designing control laws for disassembly systems to ensure the satisfaction of marking constraints in Timed Event Graphs (TEGs) with some uncontrollable input transitions. The second technique focuses on controller synthesis while ensuring GMCs specified by weighted inequalities in the Min-Plus algebra subject to GETs. The final method aims to control disassembly processes modelled by Timed Event Graph Networks (NGETs) imposed on MECs.Alternatively, it is worth noting that these approaches are based on the conceptual structures of Discrete Event Systems (DES) and the Min-Plus algebra. These tools offer the ability to represent manufacturing systems accurately and methodically. Consequently, the problem is formulated using linear control models based on Min-Plus algebra. In fact, the behaviour of these graphs is described using linear Min-Plus equations, and constraints are expressed by inequalities or weighted inequalities in the Min-Plus algebra.Sufficient conditions for the existence of causal control laws are established. These developed controllers are state feedbacks that can be represented by monitoring places preventing the system from any constraint violation. The graph is alive and unblocked
Tu, Ronghui. "Generalized Survey Propagation." Thèse, Université d'Ottawa / University of Ottawa, 2011. http://hdl.handle.net/10393/19972.
Blazere, Melanie. "Inférence statistique en grande dimension pour des modèles structurels. Modèles linéaires généralisés parcimonieux, méthode PLS et polynômes orthogonaux et détection de communautés dans des graphes." Thesis, Toulouse, INSA, 2015. http://www.theses.fr/2015ISAT0018/document.
This thesis falls within the context of high-dimensional data analysis. Nowadays we have access to an increasing amount of information. The major challenge relies on our ability to explore a huge amount of data and to infer their dependency structures.The purpose of this thesis is to study and provide theoretical guarantees to some specific methods that aim at estimating dependency structures for high-dimensional data. The first part of the thesis is devoted to the study of sparse models through Lasso-type methods. In Chapter 1, we present the main results on this topic and then we generalize the Gaussian case to any distribution from the exponential family. The major contribution to this field is presented in Chapter 2 and consists in oracle inequalities for a Group Lasso procedure applied to generalized linear models. These results show that this estimator achieves good performances under some specific conditions on the model. We illustrate this part by considering the case of the Poisson model. The second part concerns linear regression in high dimension but the sparsity assumptions is replaced by a low dimensional structure underlying the data. We focus in particular on the PLS method that attempts to find an optimal decomposition of the predictors given a response. We recall the main idea in Chapter 3. The major contribution to this part consists in a new explicit analytical expression of the dependency structure that links the predictors to the response. The next two chapters illustrate the power of this formula by emphasising new theoretical results for PLS. The third and last part is dedicated to graphs modelling and especially to community detection. After presenting the main trends on this topic, we draw our attention to Spectral Clustering that allows to cluster nodes of a graph with respect to a similarity matrix. In this thesis, we suggest an alternative to this method by considering a $l_1$ penalty. We illustrate this method through simulations
Lim, Tian Khoon. "Edge-transitive homogeneous factorisations of complete graphs." University of Western Australia. School of Mathematics and Statistics, 2004. http://theses.library.uwa.edu.au/adt-WU2004.0039.
Cristo, Fernando de. "DESENVOLVIMENTO DE METAHEURÍSTICAS PARA O PROBLEMA DA ÁRVORE GERADORA MÍNIMA GENERALIZADO." Universidade Federal de Santa Maria, 2008. http://repositorio.ufsm.br/handle/1/8051.
The generalized minimum spanning tree problem is present in several situations of the real world, such as in the context of the telecommunications, transports and grouping of data, where a net of necessary clusters to be connected using a node of each cluster. In that work it is presented the project and the implementation of an algorithm of tabu search with path relinking and iterated local search for the generalized minimum spanning tree problem and your variant with at least one vertex by group. In the computational tests 271 instances of TSPLIB were used generated through the grouping methods Center Clustering and Grid Clustering, and more 20 instances for the extension of the problem with at least one vertex by group. The results demonstrate the efficiency of the algorithm proposed in the obtaining of satisfactory solutions for the two problems.
O problema da árvore geradora mínima generalizado está presente em várias situações do mundo real, tais como no contexto das telecomunicações, transportes e agrupamento de dados, nas quais uma rede de grupos precisa ser conectada utilizando um nodo de cada grupo. Nesse trabalho é apresentado o projeto e a implementação de um algoritmo de busca tabu com reconexão de caminhos e busca local iterativa para o problema da árvore geradora mínima generalizado e sua variante com pelo menos um vértice por grupo. Nos testes computacionais foram utilizadas 271 instâncias da TSPLIB geradas através dos métodos de agrupamento Center Clustering e Grid Clustering, e mais 20 instâncias para a extensão do problema com pelo menos um vértice por grupo. Os resultados demonstram a eficiência do algoritmo proposto na obtenção de soluções satisfatórias para os dois problemas.
Zhang, Peng. "A study on generalized solution concepts in constraint satisfaction and graph colouring." Thesis, University of British Columbia, 2014. http://hdl.handle.net/2429/50022.
Graduate Studies, College of (Okanagan)
Graduate
Sun, Feng, and 孙峰. "Shape-preserving meshes and generalized Morse-Smale complexes." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2011. http://hub.hku.hk/bib/B4786963X.
published_or_final_version
Computer Science
Doctoral
Doctor of Philosophy
Mohammed, Dilbak. "Generalised Frobenius numbers : geometry of upper bounds, Frobenius graphs and exact formulas for arithmetic sequences." Thesis, Cardiff University, 2015. http://orca.cf.ac.uk/98161/.
Miolane, Léo. "Fundamental limits of inference : a statistical physics approach." Thesis, Paris Sciences et Lettres (ComUE), 2019. http://www.theses.fr/2019PSLEE043.
We study classical statistical problems such as community detection on graphs, Principal Component Analysis (PCA), sparse PCA, Gaussian mixture clustering, linear and generalized linear models, in a Bayesian framework. We compute the best estimation performance (often denoted as “Bayes Risk”) achievable by any statistical method in the high dimensional regime. This allows to observe surprising phenomena: for many problems, there exists a critical noise level above which it is impossible to estimate better than random guessing. Below this threshold, we compare the performance of existing polynomial-time algorithms to the optimal one and observe a gap in many situations: even if non-trivial estimation is theoretically possible, computationally efficient methods do not manage to achieve optimality. From a statistical physics point of view that we adopt throughout this manuscript, these phenomena can be explained by phase transitions. The tools and methods of this thesis are therefore mainly issued from statistical physics, more precisely from the mathematical study of spin glasses
REDOUANE, YOUSSEF. "Communication dans les reseaux d'interconnexion et degres generalises dans les graphes." Paris 11, 1997. http://www.theses.fr/1997PA112372.
Loop, Charles Teorell. "Generalized B-spline surfaces of arbitrary topological type /." Thesis, Connect to this title online; UW restricted, 1992. http://hdl.handle.net/1773/6888.
Fernandes, Antonio M. "A study of nonlinear physical systems in generalized phase space." Virtual Press, 1996. http://liblink.bsu.edu/uhtbin/catkey/1020161.
Department of Physics and Astronomy
Cardot, Anaïs. "Rejeu basé sur des règles de transformation de graphes." Thesis, Poitiers, 2019. http://www.theses.fr/2019POIT2254.
In many modelling fields, such as architecture, archaeology or CAD, performing many variations of the same model is an expanding need. But building all those variations manually takes time. It is therefore needed to use automatic technics to revaluate some parts of a model, or even an entire model, after the user specifies the modifications. Most of the existing approaches dedicated to revaluating models are based on a system called parametric modelling. It is made of two parts, a geometric model and a parametric specification, which allows to record the series of operation that created the model, and the different parameters of those operations. This way, the user can change some parameters, or edit the list of operations to modify the model. To do so, we use a system called persistent naming, introduced during the 90ies, that allows us to identify and match the entities of an initial specification and the ones of a revaluated specification. In this thesis, our goal is to propose a persistent naming system that would be general, homogeneous and that would allow the user to edit a parametric specification (which means move, add, or delete some operations). We base our system on the Jerboa library, which uses graph transformation rules. This way, we will be able to use those rules to create our naming system, while also linking the notions of graph transformation rules and parametric specification. We will then describe how to use our naming method to revaluate or edit parametric specifications. Finally, we will compare our method with the other ones from the literature
Franco, Ana Catarina Roque da Silva. "Ansiedade na infância." Master's thesis, Universidade de Lisboa. Faculdade de Arquitetura, 2016. http://hdl.handle.net/10400.5/11697.
As crianças com transtorno de ansiedade sentem uma constante tensão que pode ser causada por inúmeras situações do quotidiano. Este é um distúrbio que provoca grandes alterações emocionais, manifestando medos e preocupações exageradas e irracionais, em diversas situações das suas vidas. Na maioria das ocorrências, o transtorno surge num processo insidioso. Deste modo, os pais apresentam alguma dificuldade em precisar o começo do distúrbio, o que os leva à procura de ajuda especializada já numa fase em que o quadro se encontra agravado e intolerável. Pretende-se com a presente investigação, contribuir para o combate à ansiedade na infância, através de um objeto impresso lúdico e interativo, com a finalidade de auxiliar pais e crianças na tomada de consciência deste distúrbio psicológico, com o auxílio de pistas e métodos dinâmicos, atenuando o seu sofrimento. Através de uma metodologia de natureza mista, intervencionista e não- intervencionista de base qualitativa, apoiadas na revisão literária e investigação ativa, criaram- se bases sólidas, estruturadas e sistematizadas para o sucesso e viabilidade da investigação. Recorrendo previamente a uma abordagem teórica, foi imprescindível estudar a importância do design gráfico no seu todo, como meio de resolução de problemas de comunicação para um público-alvo, bem como, o design do livro centrado no utilizador, a interação e participação do mesmo e, ainda, a ilustração do livro infantil. Procedeu-se a um estudo preliminar, onde foram analisados casos já existentes, a partir dos quais foram identificados os requisitos necessários ao desenvolvimento do projeto prático. O projeto consiste na criação de um livro de cariz informativo e interativo com o intuito de aliviar o problema da ansiedade na criança, ajudando-a a exteriorizar os sentimentos e os efeitos que a ansiedade lhe provoca e, em simultâneo, ajudando-a a encontrar meios para amenizar o problema. Para além disto, o livro pretende também auxiliar os pais a reforçar os laços com os filhos que sofrem deste distúrbio Este trabalho passou por uma fase de validação com profissionais especializados tanto na área pedagógica como na vertente da psicologia e foi também submetido a estudos de usabilidade com o público-alvo para a melhoria do resultado final.
ABSTRACT : Children with anxiety disorder feel a constant tension that can be causeed by many situations of their daily routine. This is a disorder that causes great emotional alterations, manifesting fears and exaggerated irrational concerns, in various situations of their lives. Most of the times, the disorder sufaces in an insidious process. Thus parents have a hard time diagnosing the disorder, wich leads to a seach for expert help at a stage where the senario is already agravated and intolerable. The aim of this research is the contribution to the fight against childhood anxiety. Through a playful and interactive printed object, with the objective of assisting parents and children in awareness of this psychological disorder, it presents help , clues and dynamic methods, for alleviation of their suffering. Through a methodology of mixed type, interventionist and non-interventionist qualitative basis, supported by literature review and active investigation, solid foundations were created, structured and systematized to the success and viability of the investigation. The previous use of a theoretical approach, was essential to this study, the importance of graphic design as a whole, and as a resolution media for problems of communication for a target audience, as well as the design of the user-centred book, its interaction and participation and even the illustration of a children’s book. We proceeded to a preliminary theoretical study in which existing cases were analysed, and from which the necessary requirements for the development of practical design were identified. The project consists of creating a book with an informative and interactive character in order to relieve the problem of anxiety in children, helping them externalizing feelings and the effects that anxiety creates on them. Helping at the same time to find ways to solve the problem. In addition, the book also aims to help parents reinforce ties with children suffering from this disorder. This work went through a validation phase with specialized professionals both in teaching and in the area of psychology. This project was also submitted to usability studies with the target audience to improve the final result.
Matcha, Chaitanya Kumar, Mohsen Bahrami, Shounak Roy, Shayan Garani Srinivasa, and Bane Vasic. "Generalized belief propagation based TDMR detector and decoder." IEEE, 2016. http://hdl.handle.net/10150/622831.
Dogbey, James K. "Concepts of Variable in Middle-Grades Mathematics Textbooks during Four Eras of Mathematics Education in the United States." Scholar Commons, 2010. https://scholarcommons.usf.edu/etd/1615.
Poudret, Mathieu. "Transformations de graphes pour les opérations topologiques en modélisation géométrique - Application à l'étude de la dynamique de l'appareil de Golgi." Phd thesis, Université d'Evry-Val d'Essonne, 2009. http://tel.archives-ouvertes.fr/tel-00503818.
Assunção, Valdecino Ferreira de. "Otimização energetica de rede de trocadores de calor : abordagem multi-objetivo em grafo generalizado." [s.n.], 1997. http://repositorio.unicamp.br/jspui/handle/REPOSIP/265547.
Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Mecanica
Made available in DSpace on 2018-07-22T00:56:06Z (GMT). No. of bitstreams: 1 Assuncao_ValdecinoFerreirade_M.pdf: 5948222 bytes, checksum: 1004c2f9409ac5ca5896ed6357048d70 (MD5) Previous issue date: 1997
Resumo: Neste trabalho procura-se desenvolver um modelo de otimização de rede de trocadores de calor que represente adequadamente o processo e permita avaliar a influência de algumas variáveis da integração energética do mesmo, objetivando a redução do uso das utilidades e da área de transferência de calor. Neste sentido, busca-se apresentar não apenas uma solução em que um dos objetivos é ótimo, mas um conjunto de soluções eficientes que permita ao analista escolher a situação mais conveniente. As funções objetivos são analisadas utilizando técnicas de otimização multi-objetivo, com as trocas térmicas realizadas de acordo com as restrições impostas pelas técnicas de otimização em grafo generalizado e por um algoritmo que avalia adequadamente os intervalos de temperatura das correntes envolvidas no processo. Além disso, o modelo permite que se inclua todas as restrições relativas às combinações entre correntes e também parte das perdas de calor inerentes a estas, gerando, portanto, resultados mais realísticos. No entanto, para atingir os objetivos propostos pelo modelo são necessárias diversas combinações entre correntes, acarretando geralmente no uso de vários equipamentos de transferência de calor
Abstract: This work develops an optimization model for heat exchanger network synthesis which adequately represents the actual process. The model allows the evaluation of the intluence of the minimum utility usage and of the minimum heat transfer area in the heat exchange process. Rather than presenting a single solution where one of the objectives has been optimized, a complete set of efficient solutions is generated. The most suitable solution can then be chosen. The objectives are analyzed based on multiple criteria optimization techniques. The heat transfer is modeled in accordance with constraints imposed by generalized graph theory. An algorithm is used to correctly evaluate the stream temperature intervals in the processo Moreover, the model allows the inclusion of alI restrictions regarding the combinations among the streams and part of the heat loss inherent to them. Since heat dissipation to environment is considered, the model generates results similar to those achieved in practice. Nevertheless, to reach the objectives it is necessary to utilize several combinations between streams, increasing the amount of heat exchange equipment required.
Mestrado
Termica e Fluidos
Mestre em Engenharia Mecânica
Saavedra, Cayan Atreio Portela Bárcena. "Um aplicativo shiny para modelos lineares generalizados." Universidade de São Paulo, 2018. http://www.teses.usp.br/teses/disponiveis/11/11134/tde-22012019-174209/.
Recent technological and computational advances have brought alternatives that have led to changes in the way data analyzes and visualizations are done. One of these changes is characterized by the use of interactive platforms and dynamic graphics to carry out such analyzes. In this way, data analyzes and visualizations are no longer limited to a static environment, so exploring this dynamic interactivity can enable a wider range of data exploration and presentation. The present work aims to propose an interactive application, easy to use and with user-friendly interface, which enables studies and descriptive analysis and fit generalized linear models. This application is made using the shiny package in the R environment of statistical computing. The purpose of the application is to act as a support tool for statistical research and teaching. Users with no familiarity in programming can explore the data and perform the fit of generalized linear models without typing a single code line. Regarding teaching, the dynamics and interactivity of the application gives the student an uncomplicated way to investigate the methods involved, making it easier to assimilate concepts related to the subject.
Torres, Bobadilla William Javier. "Generalised Unitarity, Integrand Decomposition, and Hidden properties of QCD Scattering Amplitudes in Dimensional Regularisation." Doctoral thesis, Università degli studi di Padova, 2017. http://hdl.handle.net/11577/3423251.
In questa tesi discutiamo le proprietà di analiticità delle ampiezze di scattering e presentiamo nuovi metodi per il loro calcolo analitico, sia a tree-level e agli ordini perturbativi successivi. Proponiamo un nuovo schema di regolarizzazione dimensionale, la Four-dimensional formulation (FDF), che mostriamo equivalente al Four-dimensional helicity scheme (FDH). Nella nostra formulazione, consideriamo le particelle che si propagano all'interno dei loop in quattro dimensioni, fornendo una rappresentazione esplicitamente quadridimensionale dei loro stati di polarizzazione ed elicità. La massa di tali particelle virtuali agisce da regolatore delle divergenze. Lavorando in FDF, utilizziamo le tecniche di unitarietà e il metodo dell'integrand reduction per calcolare analiticamente ampiezze di scattering a un loop, mostrando che la conoscenza delle ampiezze a tree-level consente, in questo formalismo, di ottenere sia la cosiddetta parte cut-constructibile dell'ampiezza di loop sia i suoi termini razionali. Presentiamo una serie di esempi non banali e illustriamo come FDF consenta di calcolare ampiezze partoniche per processi $2\to 2,3,4$ di notevole rilevanza fenomenologica. In particolare, iniziamo considerando la produzione di due gluoni a partire da una coppia di quark-antiquark per poi analizzare ampiezze puramente gluoniche del tipo $gg\to ng$, con $n=2,3,4$. Infine, lavorando nel limite di massa infinita del quark top, presentiamo i risultati per la produzione via gluon-fusion di un bosone di Higgs in associazione con jet gluonici, $gg\to ngH$, $n=1,2,3$. Seguendo un approccio diagrammatico, investighiamo il ruolo della colour-kinematics duality (C/K) in teorie di gauge accoppiate alla materia, sia in quattro che in $d$ dimensioni, adottando, nel secondo caso, le prescrizioni di FDF. Mostriamo che le identità di Jacobi tra i numeratori cinematici dei diagrammi di Feynman off-shell (per i quali utilizziamo il gauge assiale) producono violazioni della C/K dualità riconducibili all'esclusivo contributo di sottodiagrammi. Discutiamo il ruolo di tale decomposizione off-shell nella costruzione diretta di numeratori esplicitamente duali. In particolare, analizziamo il processo $gg\to q\bar{q}g$ in quattro dimensioni per poi estendere tale studio, mediante l'utilizzo di FDF, al caso $d$-dimensionale. Nel seguito, studiamo il comportamento delle ampiezze a tree-level di QCD nel limite di emissione di radiazione soffice. Nel caso dell'emissione di un singolo gluone, mostriamo che il termine sottodominante nell'approssimazione soffice dell'ampiezza è descritto da operatori differenziali la cui espressione universale può essere derivata sia delle relazioni di ricorrenza di Britto-Cachazo-Feng-Witten sia dalle proprietà di invarianza di gauge dell'ampiezza. Tali proprietà si rivelano valide, oltre che per processi gluonici, per lo scattering tra gravitoni. Nell'ultima parte di questa tesi, discutiamo le caratteristiche principali del calcolo di ampiezze di scattering oltre un loop. Descriviamo brevemente il metodo dell'adaptive integrand decomposition (AID), una formulazione alternativa della tecnica di integrand decomposition tradizionale, che sfrutta la scomposizione dello spazio-tempo nei sottospazi parallelo ed ortogonale alla cinematica esterna. In particolare, ci concentriamo su calcolo di ampiezze partoniche $2\to2,3$ a due loop.
Costa, Rafael Carneiro da. "A relaÃÃo entre receitas e despesas nos MunicÃpios Brasileiros: uma anÃlise sob as TÃcnicas de Bootstrap." Universidade Federal do CearÃ, 2010. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=5308.
Trabalhos recentes mostraram que a teoria assintÃtica traz resultados equivocados nos testes de causalidade quando o MÃtodo de Momentos Generalizados (MGM) à utilizado. Este estudo re-examina a relaÃÃo dinÃmica entre receitas prÃprias, despesas correntes e transferÃncias correntes para os governos municipais brasileiros no perÃodo de 2000 a 2008. A estimaÃÃo do modelo de dados em painel dinÃmico à feita atravÃs do MGM, mas os testes de especificaÃÃo utilizam valores crÃticos gerados por bootstrap para fornecer melhor aproximaÃÃo à distribuiÃÃo da estatÃstica de teste. Uma defasagem de dois anos à encontrada na equaÃÃo de despesas, mas nenhuma dinÃmica à observada nas equaÃÃes de receitas prÃprias e de transferÃncias, sugerindo a hipÃtese de que receitas passadas afetam despesas correntes
Recent works has shown that the asymptotic theory provides misleading results in causality tests when the Generalized Method of Moments (GMM) is used. This study re-examines the dynamic relationship between own revenues, current expenditures and current grants to municipal governments in Brazil in the period 2000 to 2008. The dynamic panel data model estimation is done by GMM, but the specification tests use bootstrap critical values to provide a better approximation to the distribution of the test statistic. A lag of two years is found in the expenditure equation, but no dynamics is observed in the own revenues and transfers equations, suggesting the hypothesis that past revenues affect current expenditures
Torki-Hamza, Nabila. "Stabilité des valeurs propres et champ magnétique sur une variété Riemannienne et sur un graphe." Phd thesis, Grenoble 1, 1989. http://tel.archives-ouvertes.fr/tel-00555758.
Kumar, Ashwani. "Optimizing Parameters for High-quality Metagenomic Assembly." Miami University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=miami1437997082.
Pereira, Mike. "Champs aléatoires généralisés définis sur des variétés riemanniennes : théorie et pratique." Thesis, Paris Sciences et Lettres (ComUE), 2019. http://www.theses.fr/2019PSLEM055.
Geostatistics is the branch of statistics attached to model spatial phenomena through probabilistic models. In particular, the spatial phenomenon is described by a (generally Gaussian) random field, and the observed data are considered as resulting from a particular realization of this random field. To facilitate the modeling and the subsequent geostatistical operations applied to the data, the random field is usually assumed to be stationary, thus meaning that the spatial structure of the data replicates across the domain of study. However, when dealing with complex spatial datasets, this assumption becomes ill-adapted. Indeed, how can the notion of stationarity be defined (and applied) when the data lie on non-Euclidean domains (such as spheres or other smooth surfaces)? Also, what about the case where the data clearly display a spatial structure that varies across the domain? Besides, using more complex models (when it is possible) generally comes at the price of a drastic increase in operational costs (computational and storage-wise), rendering them impossible to apply to large datasets. In this work, we propose a solution to both problems, which relies on the definition of generalized random fields on Riemannian manifolds. On one hand, working with generalized random fields allows to naturally extend ongoing work that is done to leverage a characterization of random fields used in Geostatistics as solutions of stochastic partial differential equations. On the other hand, working on Riemannian manifolds allows to define such fields on both (only) locally Euclidean domains and on locally deformed spaces (thus yielding a framework to account for non-stationary cases). The discretization of these generalized random fields is undertaken using a finite element approach, and we provide an explicit formula for a large class of fields comprising those generally used in applications. Finally, to solve the scalability problem,we propose algorithms inspired from graph signal processing to tackle the simulation, the estimation and the inference of these fields using matrix-free approaches
Song, Hyunjin. "A Dynamic Longitudinal Examination of Social Networks and Political Behavior: The Moderating Effect of Local Network Properties and Its Implication for Social Influence Processes." The Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1427490761.
Pocztar, Laurence. "Mise en correspondance spatio-temporelle d'images pour la restitution d'une gerbe de particules." Grenoble 2 : ANRT, 1987. http://catalogue.bnf.fr/ark:/12148/cb376089045.