To see the other types of publications on this topic, follow the link: Vertexer.
Dissertations / Theses on the topic 'Vertexer'
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 'Vertexer.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Kohn, Eduardo. "Vertedor do tipo labirinto." Universidade de São Paulo, 2006. http://www.teses.usp.br/teses/disponiveis/3/3147/tde-11122006-142016/.
Full textAbstract:
A crista ou soleira de um vertedor, que é a parte superior e que está em contato com a água, tem em geral um desenvolvimento em planta linear, no sentido transversal ao do escoamento. Nos vertedores do tipo labirinto esse desenvolvimento em planta não é linear, é composto de um ou mais ciclos, os quais podem ter uma forma triangular ou trapezoidal. A vantagem do uso desse tipo de obra hidráulica é o aumento do comprimento total da soleira para uma mesma largura, o que se traduz em um aumento da capacidade de vazão da estrutura. A utilização de vertedores do tipo labirinto é particularmente vantajosa para cargas pequenas, pois sua eficiência se reduz com o aumento da carga. Um exemplo de aplicação é a utilização em locais nos quais a geologia ou a topografia impõe restrições de espaço para construção. Outro exemplo é o emprego em uma ampliação da capacidade de vazão de um vertedor existente, quando o vertedor labirinto seria construído sobre o mesmo. Foram apresentadas as principais metodologias de projeto publicadas desse tipo de vertedor . Para auxiliar na análise crítica das metodologias de projeto foram apresentados quatro estudos de casos de vertedores labirinto, cujas pesquisas foram realizadas em modelos físicos reduzidos, a saber: Barragem Prado (EUA), Vertedor Labirinto da Estação de Tratamento de Esgotos de Barueri (Brasil), Barragem Ute (EUA) e Barragem Dog River (EUA). Os resultados desses ensaios mostraram que as metodologias de projeto são capazes de predizer o desempenho dos vertedores dentro de uma faixa limitada de desvio, variável com a carga. Recomenda-se que projetos de maior responsabilidade, ou que tenham características diferentes das preconizadas pela bibliografia, sejam estudados em modelo físico reduzido.<br>The crest or weir of a spilway, that is the superior part and that it is in contact with the water, has usually a linear plan shape, in perpendicular to the flow direction. In the labyrinth spillways the plan shape is not linear, but varies using a triangular or trapezoidal planform. The advantage of the use of this water work is the increase of the total length of the weir for same width, what it is expressed as an increase of the capacity of discharge of the structure. The use of labyrinth spillways is particularly advantageous for small heads, therefore its efficiency reduces with the increase of the head. An application example is the use in sites in which geology or the topography impose restrictions of space for construction, another example is increase of the capacity of discharge of an existing spillway, where the labyrinth spillway would be constructed on it. The main design curves of this type of spillway had been presented. To assist in the critical analysis of the methodologies of design four case studies had been presented, whose research had been done in physical models: Prado Dam (U.S.A.), Labyrinth Spillway of the Wastewater Treatment Plant Barueri (Brazil), Ute Dam (U.S.A.) and Dog River Dam (U.S.A.). The results show that the design curves can predict the performance of the labyrinth spillways in a limited way. It is recommended that designs which have more responsibility (risks for human being) or that have different characteristics than the design methodologies should be studied in physical model.
2
Lewis, Jason Robert. "Vertex-edge and edge-vertex parameters in graphs." Connect to this title online, 2007. http://etd.lib.clemson.edu/documents/1193079748/.
Full text
3
Zaccara, Luciana. "Caratterizzazione biomeccanica di vertebre umane." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/9305/.
Full textAbstract:
Le fratture vertebrali sono tra le principali cause dell’incremento della mortalità. Queste sono dovute principalmente a traumi, tumori o particolari patologie metaboliche che colpiscono l’osso. Il tratto maggiormente interessato è quello toraco-lombare in quanto deve sopportare la maggior parte dei carichi. Risulta quindi necessario comprendere come la colonna vertebrale risponde ai carichi così da studiare e sviluppare nuovi protocolli e trattamenti per disordini del tratto spinale. Informazioni quantitative possono essere ottenute mediante test in vitro. Questi hanno alcune limitazioni dovute principalmente alla difficoltà di misurare le tensioni e le deformazioni in zone diverse dalla superficie, alla complessità e al costo delle prove. Un altro limite delle prove in vitro è rappresentato dal fatto che ciascun campione può essere testato a rottura una volta sola. Queste problematiche possono essere superate con l’utilizzo contemporaneo di modelli matematici e test in vitro. In particolare i test in vitro sono utilizzati in fase di validazione del modello matematico, ovvero nella determinazione di quanto il modello è una rappresentazione del comportamento reale che si sta simulando.
Il presente lavoro di tesi si inserisce in un progetto di caratterizzazione di vertebre toraco-lombari utilizzate per la validazione di un modello agli elementi finiti. In particolare l’obiettivo dello studio è stata la realizzazione di prove meccaniche in modo da replicare l’anterior wedge fracture. Tali prove sono state effettuate presso il Laboratorio di Biomeccanica del Dipartimento di Ingegneria Industriale dell’Università di Bologna. Gli spostamenti registrati durante le prove sono stati utilizzati dal Laboratorio di Tecnologia Medica dell’Istituto Ortopedico Rizzoli come condizioni al contorno per la realizzazione di un modello FE. Una volta validato e messo a punto, il modello sarà utilizzato per valutare lo stato di salute della colonna vertebrale in vivo.
4
Berra, Francesco. "Caratterizzazione Biomeccanica di vertebre umane." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2013. http://amslaurea.unibo.it/5296/.
Full text
5
D'Amico, Giulia. "Caratterizzazione biomeccanica di vertebre umane." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/8556/.
Full textAbstract:
Metastasi ossee, osteoporosi e traumi sono le cause più comuni di fratture vertebrali che possono portare a conseguenze severe. In particolare, le fratture determinate da patologie e dall’invecchiamento colpiscono soprattutto il tratto toraco-lombare che è quello che sopporta la maggior parte dei carichi. Inoltre, le attività quotidiane inducono dei complessi scenari di carico sulla colonna vertebrale. Pertanto la misura di carichi in vivo ha un grande interesse clinico e biomeccanico dal momento che può essere necessaria per studiare il mal di schiena, le fratture vertebrali, il progetto di impianti, ecc. Tuttavia, le misure in vivo hanno il limite di essere invasive. Invece, le prove sperimentali hanno il vantaggio di essere non invasive, anche se presentano alcune limitazioni intrinseche quali la difficoltà di misurare le tensioni o le deformazioni che non siano sulla superficie delle vertebre e l’aumento della complessità e del costo delle prove nel momento in cui si vogliano fare misurazioni addizionali o sperimentare condizioni diverse.
In alternativa, il comportamento meccanico delle strutture ossee può essere investigato con modelli numerici agli elementi finiti validati da prove sperimentali. È in questo contesto che va inserito il presente lavoro. Questa tesi ha lo scopo di cominciare un progetto sulla caratterizzazione biomeccanica di vertebre toraciche e lombari di soggetti affetti da osteoporosi da cui si ricaveranno i dati necessari per validare un modello agli elementi finiti. In particolare, durante i test meccanici si vuole riprodurre la tipica fattura vertebrale causata dall’osteoporosi, l’anterior wedge fracture. Le prove meccaniche sono state eseguite nel Laboratorio di Biomeccanica del Dipartimento di Ingegneria Industriale dell’Università di Bologna, mentre il modello agli elementi finiti sarà sviluppato dal Laboratorio di Tecnologia Medica dell’Istituto Ortopedico Rizzoli. Una volta validato, il modello sarà utilizzato per fare simulazioni di rottura in vivo.
6
Niu, Liang. "The Vertex Primitive and Vertex Bi-primitive s-arc regular graphs." The Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=osu1221597829.
Full text
7
Bianco, Simone [Verfasser]. "Tracking and vertex reconstruction with the PANDA Micro-Vertex-Detector / Simone Bianco." Bonn : Universitäts- und Landesbibliothek Bonn, 2013. http://d-nb.info/104497155X/34.
Full text
8
Roney, J. Michael (John Michael) 1958 OPAL Carleton University Dissertation Physics. "The OPAL vertex detector." Ottawa.:, 1989.
Find full text
9
Masum, Mohammad. "Vertex Weighted Spectral Clustering." Digital Commons @ East Tennessee State University, 2017. https://dc.etsu.edu/etd/3266.
Full textAbstract:
Spectral clustering is often used to partition a data set into a specified number of clusters. Both the unweighted and the vertex-weighted approaches use eigenvectors of the Laplacian matrix of a graph. Our focus is on using vertex-weighted methods to refine clustering of observations. An eigenvector corresponding with the second smallest eigenvalue of the Laplacian matrix of a graph is called a Fiedler vector. Coefficients of a Fiedler vector are used to partition vertices of a given graph into two clusters. A vertex of a graph is classified as unassociated if the Fiedler coefficient of the vertex is close to zero compared to the largest Fiedler coefficient of the graph. We propose a vertex-weighted spectral clustering algorithm which incorporates a vector of weights for each vertex of a given graph to form a vertex-weighted graph. The proposed algorithm predicts association of equidistant or nearly equidistant data points from both clusters while the unweighted clustering does not provide association. Finally, we implemented both the unweighted and the vertex-weighted spectral clustering algorithms on several data sets to show that the proposed algorithm works in general.
10
Arauz, Ivan Juncioni de. "Vertedor de superfície e escoamento sob comportas." Universidade de São Paulo, 2005. http://www.teses.usp.br/teses/disponiveis/3/3147/tde-12092005-212331/.
Full textAbstract:
Os vertedores são estruturas hidráulicas construídas para controlar o nível dágua do reservatório, permitindo a passagem das vazões escoadas com a máxima eficiência possível sem provocar problemas à estrutura. Para atingir este objetivo, as condições de aproximação do escoamento à estrutura e a forma geométrica do perfil vertente são muito importantes. O controle da soleira por comportas provoca uma mudança significativa nas condições de escoamento sobre o perfil vertente. O posicionamento e a forma da comporta tem forte influência no comportamento do coeficiente de vazão e nas pressões sobre a soleira. A formação de vórtice é um fenômeno indesejável que pode ocorrer quando a operação da comporta é parcial, prejudicando a capacidade de vazão e provocando vibrações na estrutura. Este trabalho apresenta uma abordagem teórica sobre o assunto vertedor de superfície e escoamento sob comportas, apresentando resultados de diferentes estudos para melhor compreensão do funcionamento do vertedor.<br>Spillways are hydraulic structures constructed to control the water level of the reservoir, allowing the overflows with the maximum possible efficiency without provoking problems to the structure. The approach flow pattern to the structure and the geometric form of the spillway profile are basic importance. The control of the spillway by the floodgates modifies the draining conditions. The positioning and the form of the gate have strong influence in the behavior of the discharge coefficient and the pressures on the surface profile. A vortex formation is an undesirable phenomenon that it can occur when the operation of the floodgate is partial, reducing the discharge coefficient and produce vibrations in structure. This work presents a theoretical approach about flow over spillway and under of the partial opening of the floodgate, presenting results of different studies for better understanding the function of the spillway.
11
Weigel, Martin. "Vertex Models on Random Graphs." Doctoral thesis, Universitätsbibliothek Leipzig, 2004. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-37308.
Full textAbstract:
Diese Arbeit befaßt sich mit der Koppelung von Vertex-Modellen an die planaren $\phi^4$-Zufallsgraphen des Zugangs zur Quantengravitation über dynamische Polygonifizierungen. Das betrachtete System hat eine doppelte Bedeutung, einerseits als die Koppelung einer konformen Feldtheorie mit zentraler Ladung $C=1$ an zweidimensionale Euklidische Quantengravitation, andererseits als Anwendung von geometrischer, "annealed" Unordnung auf ein prototypisches Modell der statistischen Mechanik. Da das Modell mit Hilfe einer großangelegten Reihe von Monte Carlo Simulationen untersucht wird, müssen entsprechende Techniken für die Simulation von dynamischen Quadrangulierungen bzw. die dualen $\phi^4$-Graphen entwickelt werden. Hierzu werden verschiedene Algorithmen und die dazugehörigen Züge vorgeschlagen und hinsichtlich ihrer Ergodizität und Effizienz untersucht. Zum Vergleich mit exakten Ergebnissen werden die Verteilung der Koordinationszahlen bzw. bestimmte Analoga davon konstruiert. Für Simulationen des $F$-Modells auf $\phi^4$-Zufallsgraphen wird ein Ordnungsparameter für den antiferroelektrischen Phasenübergang mit Hilfe einer Plakettenspindarstellung formuliert. Ausführliche "finite-size scaling"-Analysen des Kosterlitz-Thouless-Phasenübergangs des $F$-Modells auf dem Quadratgitter und auf Zufallsgraphen werden vorgestellt und die Positionen der jeweiligen kritischen Punkte sowie die dazugehörigen kritischen Exponenten werden bestimmt. Die Rückreaktion des Vertex-Modells auf die Zufallsgraphen wird in Form der Koordinationszahlverteilung, der Verteilung der "Baby-Universen" und dem daraus resultierenden String-Suszeptibilitäts-Exponenten sowie durch die geometrische Zweipunktfunktion analysiert, die eine Schätzung der intrinsischen Hausdorff-Dimension des gekoppelten Systems liefert<br>In this thesis, the coupling of ice-type vertex models to the planar $\phi^4$ random graphs of the dynamical polygonifications approach to quantum gravity is considered. The investigated system has a double significance as a conformal field theory with central charge $C=1$ coupled to two-dimensional Euclidean quantum gravity and as the application of a special type of annealed connectivity disorder to a prototypic model of statistical mechanics. Since the model is analyzed by means of large-scale Monte Carlo simulations, suitable simulation techniques for the case of dynamical quadrangulations and the dual $\phi^4$ random graphs have to be developed. Different algorithms and the associated update moves are proposed and investigated with respect to their ergodicity and performance. For comparison to exact results, the co-ordination number distribution of the dynamical polygonifications model, or certain analogues of it, are constructed. For simulations of the 6-vertex $F$ model on $\phi^4$ random graphs, an order parameter for its anti-ferroelectric phase transitions is constructed in terms of a "plaquette spin" representation. Extensive finite-size scaling analyses of the Kosterlitz-Thouless point of the square-lattice and random graph $F$ models are presented and the locations of the critical points as well as the corresponding critical exponents are determined. The back-reaction of the coupled vertex model on the random graphs is investigated by an analysis of the co-ordination number distribution, the distribution of "baby universes" and the string susceptibility exponent as well as the geometric two-point function, yielding an estimate for the internal Hausdorff dimension of the coupled system
12
Niesink, Patrick. "The Vertex-Switching Reconstruction Problem." Thesis, University of Ottawa (Canada), 2010. http://hdl.handle.net/10393/28629.
Full textAbstract:
Switching on a vertex of a graph involves swapping the sets of neighbours and non-neighbours of the vertex. The resultant graph is called a switch card of the original graph. The switch deck of a graph is the collection of all of its switch cards. The vertex-switch reconstruction problem then asks which graphs (termed non-VSR graphs) cannot be uniquely determined from their switch decks. A review of the published knowledge about this problem is followed by an improved bound on the number of edges in a non-VSR graph, and a bound on the size of the automorphism group of a non-VSR graph. Finally, the results of a computer search are presented, showing that no non-VSR graphs of order 8 or 12 exist.
13
Myhill, Richard Graham. "Automorphisms and twisted vertex operators." Thesis, Durham University, 1987. http://etheses.dur.ac.uk/6674/.
Full textAbstract:
This work is an examination of various aspects of twisted vertex operator representations of Kac-Moody algebras. It starts with an introduction to Kac-Moody algebras and string theories, including a discussion of the propagation of strings on orbifolds. String interactions in a subclass of such models naturally involve twisted vertex operators. The centrally extended loop algebra realization of Kac-Moody algebras is used to explain why the inequivalent gradations of basic representations of Kac-Moody algebras g(^r) associated with g are in one-to-one correspondence with the conjugacy classes of the automorphism group of the root system, aut Ф(_g).The structure of the automorphism groups of the simple Lie algebra root systems are examined. A method of classifying the conjugacy classes of the Weyl groups is explained and then extended to cover the whole automorphism group in cases where there are additional Dynkin diagram symmetries. All possible automorphisms, a, that have the property that det (1 – σ(^r)) ≠ 0, r = 1, ….. , n - 1 where n is the order of a, are determined. Such automorphisms lead to interesting orbifold models in which some of the calculations are simplified. A thorough exposition of the twisted vertex operator representation is given including a detailed explanation of the zero-mode Hilbert space and the construction of the required cocycle operators. The relation of the vacuum degeneracy to the number of fixed subspace singularities in the orbifold construction is discussed. Explicit examples of twisted vertex operators and their associated cocycles are given. Finally it is shown how the twisted and an alternative shifted vertex operator representation of the same gradation may be identified. This is used to determine the invariant subalgebras of the gradations along with the vacuum degeneracies and conformal weights of the representations. The results of calculations for inequivalent gradations of the simply laced exceptional algebras are given.
14
Skliros, Dimitri P. "Vertex operators for cosmic strings." Thesis, University of Sussex, 2011. http://sro.sussex.ac.uk/id/eprint/48134/.
Full textAbstract:
Superstring theory posits that as complicated as nature may seem to the naive observer, the variety of observed phenomena may be explained by postulating that at the fundamental scale, matter is composed of lines of energy, namely strings. These oscillating lines would be elementary and would hence have no substructure. They are expected to be incredibly tiny, their line-like structure would become noticeable at scales close to the string scale (which may lie anywhere from the TeV scale all the way up to the Planck scale) and would appear to be point-like to the macroscopic observer. Internal consistency then also requires the presence of higher dimensional objects, namely D-branes, all of which conspire and combine in such a way so as to give rise to the observable Universe. Advances in cosmology suggest the early universe was much hotter and denser than is the Universe at present, that the Universe has expanded and continues to expand (exponentially in fact) at present. This in turn has led a number of theorists to point out the remarkable possibility that some of these strings or D-branes were also stretched with the expansion. The resulting macroscopic strings, the so-called cosmic strings, would potentially stretch across the entire Universe. Cosmic strings make their presence manifest by oscillating, scattering off other structures, by decaying, producing gravitational waves and so on, and this in turn hints at the available handles that may be used to observe them. Before we can hope to observe cosmic strings however, the first step is then clearly to understand these properties which determine their evolution. A number of approximate (classical) descriptions of cosmic strings have been constructed to date, but approximations break down, especially when potentially interesting things happen (e.g. close to cusps, i.e. points on the string that reach the speed of light) and can obscure the physics. Thankfully, one can go beyond these approximations: all properties of cosmic strings can be concisely and accurately contained or encoded in a single object, the so-called fundamental cosmic string vertex operator. In the present thesis I construct precisely this, covariant vertex operators for general cosmic strings and this is the first such construction. Cosmic strings, being macroscopic, are likely to exhibit classical behaviour in which case they would most accurately be described by a string theory analogue of the well known harmonic oscillator coherent states. By minimally extending the standard definition of coherent states, so as to include the string theory requirements, I go on to construct both open and closed covariant coherent state vertex operators. The naive construction of the latter requires the existence of a lightlike compactification of spacetime. When the lightlike winding states in the underlying Hilbert space are projected out, the resulting vertex operators have a classical interpretation and can consistently propagate in noncompact spacetime. Using the DDF map I identify explicitly the corresponding general lightcone gauge classical solutions around which the exact macroscopic quantum states are fluctuating. We go on to show that both the covariant gauge coherent vertex operators, the corresponding lightcone gauge coherent states and the classical solutions all share the same mass and angular momenta, which leads us to conjecture that the covariant and lightcone gauge states are different manifestations of the same state and share identical interactions. Apart from the coherent state vertices I also present a complete set of covariant mass eigenstate vertex operators and these may also be relevant in cosmic string evolution. Finally, I also present the first amplitude computation with the coherent states, the graviton emission amplitude (including the effects of gravitational backreaction) for a simple class of cosmic string loops. As a byproduct of the above, I find that the fundamental building blocks of arbitrarily massive covariant string states are given by elementary Schur polynomials (equivalently complete Bell polynomials). This construction enables one to address the aforementioned questions concerning the properties of cosmic strings, their cosmological signatures, and may lead to the first observations of such objects in the sky. This in turn would be a remarkable way of verifying Superstring theory as the framework underlying the structure of our Universe.
15
Yu, Wen. "Vertex unique labelled subgraph mining." Thesis, University of Liverpool, 2015. http://livrepository.liverpool.ac.uk/2026959/.
Full textAbstract:
This thesis proposes the novel concept of Vertex Unique Labelled Subgraph (VULS) mining with respect to the field of graph-based knowledge discovery (or graph mining). The objective of the research is to investigate the benefits that the concept of VULS can offer in the context of vertex classification. A VULS is a subgraph with a particular structure and edge labelling that has a unique vertex labelling associated with it within a given (set of) host graph(s). VULS can describe highly discriminative and significant local geometries each with a particular associated vertex label pattern. This knowledge can then be used to predict vertex labels in 'unseen' graphs (graphs with edge labels, but without vertex labels). Thus this research is directed at identifying (mining) VULS, of various forms, that 'best' serve to both capture effectively graph information, while at the same time allowing for the generation of effective vertex label predictors (classifiers). To this end, four VULS classifiers are proposed, directed at mining four different kinds of VULS: (i) complete, (ii) minimal, (iii) frequent and (iv) minimal frequent. The thesis describes and discusses each of these in detail including, in each case, the theoretical definition and algorithms with respect to VULS identification and prediction. A full evaluation of each of the VULS categories is also presented. VULS has wide applicability in areas where the domain of interest can be represented in the form of some sort of a graph. The evaluation was primarily directed at predicting a form of deformation, known as springback, that occurs in the Asymmetric Incremental Sheet Forming (AISF) manufacturing process. For the evaluation two flat-topped, square-based, pyramid shapes were used. Each pyramid had been manufactured twice using Steel and twice using Titanium. The utilisation of VULS was also explored by applying the VULS concept to the field of satellite image interpretation. Satellite data describing two villages located in a rural part of the Ethiopian hinterland were used for this purpose. In each case the ground surface was represented in a similar manner to the way that AISF sheet metal surfaces were represented, with the $z$ dimension describing the grey scale value. The idea here was to predict vertex labels describing ground type. As will become apparent, from the work presented in this thesis, the VULS concept is well suited to the task of 3D surface classification with respect to AISF and satellite imagery. The thesis demonstrates that the use of frequent VULS (rather than the other forms of VULS considered) produces more efficient results in the AISF sheet metal forming application domain, whilst the use of minimal VULS provided promising results in the context of the satellite image interpretation domain. The reported evaluation also indicates that a sound foundation has been established for future work on more general VULS based vertex classification.
16
Bacak, Gökşen Ufuktepe Ünal. "Vertex Coloring of A Graph/." [s.l.] : [s.n.], 2004. http://library.iyte.edu.tr/tezler/master/matematik/T000416.pdf.
Full text
17
Pittau, Lorenzo. "Quantum groups and vertex models." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2012. http://amslaurea.unibo.it/4118/.
Full textAbstract:
Nella tesi vengono presentate alcune relazioni fra gruppi quantici e modelli reticolari. In particolare si associa un modello vertex a una rappresentazione di un'algebra inviluppante quantizzata affine e si mostra che, specializzando il parametro quantistico ad una radice dell'unità, si manifestano speciali simmetrie.
18
Dross, François. "Vertex partition of sparse graphs." Thesis, Montpellier, 2018. http://www.theses.fr/2018MONTS011/document.
Full textAbstract:
Le Théorème des Quatre Couleurs, conjecturé en 1852 et prouvé en 1976, est à l'origine de l'étude des partitions des sommets de graphes peu denses. Il affirme que toute carte plane peut être coloriée avec au plus quatre couleurs différentes, de telle manière que deux régions qui partagent une frontière aient des couleurs différentes. Énoncé en terme de théorie des graphes, cela veut dire que tout graphe planaire, c'est à dire tout graphe qui peut être représenté dans le plan sans que deux arêtes ne se croisent, peut voir son ensemble de sommets partitionné en quatre ensembles tels que chacun de ces ensembles ne contient pas les deux extrémités d'une même arête. Une telle partition est appelée une coloration propre en quatre couleurs. Dans cette thèse, on s'intéresse à l'étude de la structure des graphes peu denses, selon différentes notions de densité. D'une part, on étudie les graphes planaires sans petits cycles, et d'autre part les graphes dont tous les sous-graphes ont un degré moyen peu élevé. Pour ces classes de graphes, on recherche tout d'abord le plus petit nombre de sommets à retirer pour obtenir une forêt, c'est à dire un graphe sans cycles. Cela peut être vu comme une partition des sommets du graphe en un ensemble induisant une forêt et un ensemble de sommets contenant au plus une fraction donnée des sommets du graphe. La motivation première de cette étude est une conjecture d'Albertson et Berman (1976) comme quoi tout graphe planaire admettrait une telle partition où la forêt contient au moins la moitié des sommets du graphe. Dans un second temps, on s'intéresse aux partitions des sommets de ces graphes en deux ensembles, tels que les sous-graphes induits par ces deux ensembles ont des propriétés particulières. Par exemple, ces sous-graphes peuvent être des graphes sans arêtes, des forêts, des graphes de degré borné, ou des graphes dont les composantes connexes ont un nombre borné de sommets. Ces partitions des sommets sont des extensions de la notion de coloration propre de graphe.On montre, pour différentes classes de graphes peu denses, que tous les graphes de ces classes admettent de telles partitions. On s'intéresse également aux aspect algorithmiques de la construction de telles partitions<br>The study of vertex partitions of planar graphs was initiated by the Four Colour Theorem, which was conjectured in 1852, and proven in 1976. According to that theorem, one can colour the regions of any planar map by using only four colours, in such a way that any two regions sharing a border have distinct colours. In terms of graph theory, it can be reformulated this way: the vertex set of every planar graph, i.e. every graph that can be represented in the plane such that edges do not cross, can be partitioned into four sets such that no edge has its two endpoints in the same set. Such a partition is called a proper colouring of the graph.In this thesis, we look into the structure of sparse graphs, according to several notions of sparsity. On the one hand, we consider planar graphs with no small cycles, and on the other hand, we consider the graphs where every subgraph has bounded average degree.For these classes of graphs, we first look for the smallest number of vertices that can be removed such that the remaining graph is a forest, that is a graph with no cycles. That can be seen as a partition of the vertices of the graph into a set inducing a forest and a set with a bounded fraction of the vertices of the graph. The main motivation for this study is a the Albertson and Berman Conjecture (1976), which states that every planar graph admits an induced forest containing at least one half of its vertices.We also look into vertex partition of sparse graphs into two sets both inducing a subgraph with some specific prescribed properties. Exemples of such properties can be that they have no edges, or no cycles, that they have bounded degree, or that they have bounded components. These vertex partitions generalise the notion of proper colouring. We show, for different classes of sparse graphs, that every graph in those classes have some specific vertex partition. We also look into algorithmic aspects of these partitions
19
KOSSAI, DEBORD CHANTAL. "Diagnostic radiologique de l'hydatidose vertebrale." Clermont-Ferrand 1, 1988. http://www.theses.fr/1988CLF11044.
Full text
20
LAMBERON, NOEL. "L'osteo-arthropathie nerveuse vertebrale : a propos d'une observation." Besançon, 1992. http://www.theses.fr/1992BESA3042.
Full text
21
PAOLI, ALAIN. "Osteotomies vertebrales posterieures dans le traitement des cyphoses rigides severes : a propos de 15 cas." Aix-Marseille 2, 1988. http://www.theses.fr/1988AIX20511.
Full text
22
Bonidan, Olivier. "Morphometrie vertebrale : etude de la reproductibilite ; definition des valeurs normales." Amiens, 1990. http://www.theses.fr/1990AMIEM110.
Full text
23
Piel, Matthieu. "ETUDE CINEMATIQUE ET FONCTIONNELLE DU CENTROSOME DESCELLULES DE VERTEBRE." Phd thesis, Université Pierre et Marie Curie - Paris VI, 2001. http://tel.archives-ouvertes.fr/tel-00012067.
Full textAbstract:
Cette thèse tente d'aborder, avec quelques détours, deux questions centrales concernant le<br />centrosome des vertébrés : son rôle dans la motilité cellulaire et son rôle dans le cycle de<br />division cellulaire.<br />Après une introduction en trois parties (un tour d'horizon dans une optique historique, un<br />exposé détaillé des connaissances actuelles, puis une réflexion plus générale sur des bases<br />phylogénétiques), deux travaux sont présentés : une étude des rôles respectifs des deux<br />centrioles du centrosome des cellules de vertébrés, puis une étude du comportement<br />particulier du centrosome dans ces cellules en sortie de mitose.<br />L'ensemble de ce travail se fonde sur un outil précieux : l'établissement de lignées cellulaires<br />qui expriment de manière stable la centrine 1 humaine couplée à la GFP, ce qui constitue un<br />excellent marqueur des centrioles et de leur stade de maturation. En effet, le centrosome des<br />vertébrés contient deux structures microtubulaires appelée centrioles qui se reproduisent en<br />synchronie avec le cycle de division cellulaire par un mécanisme de duplication, un nouveau<br />centriole étant assemblé à proximité de chaque centriole présent. Il y a donc dans chaque<br />cellule, après une mitose, un nouveau et un ancien centriole aussi appelés centriole parental<br />ou centriole père et centriole fils.<br />La première étude, après avoir succinctement défini le comportement des centrioles dans les<br />différentes phases du cycle, se concentre plus précisément sur la phase G1 pendant laquelle il<br />a pu être observé que les deux centrioles peuvent transitoirement se séparer de plus de dix<br />microns. L'un des deux centrioles, qui a pu être identifié comme le centriole le plus jeune, a<br />une mobilité parfois importante, alors que le plus ancien, qui est associé à l'aster de<br />microtubules par des appendices qui sont caractéristiques de son ancienneté reste près du<br />centroïde de la cellule. La différence d'abondance des microtubules à proximité des deux<br />centrioles a pu être attribuée à une régulation différentielle de l'ancrage : le centriole le plus<br />ancien capture les microtubules qui sont nucléés dans un rayon de quelques microns autours<br />de lui, alors que le centriole fils, qui a une capacité de nucléation équivalente, a une capacité<br />d'ancrage des microtubules réduite. Ainsi, quand les deux centrioles sont éloignés l'un de<br />l'autre, de nombreux microtubules libres peuvent être observés dans la cellule, au contraire,<br />quand ils sont proches, la plupart des microtubules cellulaires sont ancrés sur le centrosome<br />(et en particulier sur le centriole père). Nous avons donc proposé que la cellule puisse<br />modifier son réseau microtubulaire en modulant la distance intercentriolaire.<br />La deuxième étude présentée porte sur un comportement particulier du centriole parental en<br />fin de mitose : après que les cellules se sont étalées, mais alors qu'elles sont encore reliées par<br />un pont cytoplasmique, les deux centrioles, dans chaque cellule fille, se séparent puis le<br />centriole parental quitte sa position centrale et stationne pendant 10 à 30 minutes à proximité<br />du pont cytoplasmique intercellulaire. Le pont se pince alors de chaque côté de la pièce<br />intermédiaire puis se rompt lorsque le centriole parental regagne sa position près du noyau.<br />Nous avons pu déterminer que le pincement du pont correspondait au détachement des<br />faisceaux de microtubules qu'il contient. Nous avons ensuite, à l'aide de drogue qui<br />dépolymérisent les microtubules, suggéré l'existence d'un contrôle de la présence du centriole<br />parental dans le pont. Nous avons étudié des cas de cellules acentriolaires et pu mettre en<br />évidence des défauts liés à la cytocinèse. Enfin, il nous est apparu, à la suite d'expériences sur<br />des substrats plus ou moins adhésifs que l'adhésion de la cellule à son substrat est un des<br />paramètres clé de la régulation de cet événement de fin de mitose.<br />Des interprétations plus spéculatives sont proposées dans les discussions qui suivent l'exposé<br />des résultats, ainsi que des expériences pour les tester.
24
Linde, Klaus-Juergen. "Global Vertex Algebras on Riemann Surfaces." Diss., lmu, 2004. http://nbn-resolving.de/urn:nbn:de:bvb:19-30690.
Full text
25
Qin, Yusheng. "On subgraphs of vertex-transitive graphs." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape11/PQDD_0020/NQ37743.pdf.
Full text
26
Ke, Youqi. "Theory of non-equilibrium vertex correction." Thesis, McGill University, 2011. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=96987.
Full textAbstract:
For realistic nanostructures, there are inevitably some degree ofdisorder such as impurity atoms, imperfect lattices, surfaceroughness, etc.. For situations where disorder locate randomly inthe nanostructure, any calculated quantum transport results shouldbe averaged over disorder distributions. A brute force approach isto generate many disorder configurations, calculate each of them,and then average the results. For atomistic first principlesmodeling, such a brute force averaging is computationallyprohibitive - if not impossible, to perform. It is therefore veryimportant and useful to develop a theoretical framework where thedisorder averaging is done analytically before atomic firstprinciples analysis is carried out.In this thesis, we have developed such a first principlesnon-equilibrium quantum transport theory and its associated modelingsoftware for predicting disorder scattering in nano-electronicdevices. Our theoretical formalism is based on carrying out densityfunctional theory (DFT) within the Keldysh non-equilibrium Green'sfunction (NEGF) framework, and a non-equilibrium vertex correction(NVC) theory for handling disorder configurational average at thenon-equilibrium density matrix level. In our theory, we use thecoherent potential approximation to calculate disorder averaging ofthe device Hamiltonian and one particle Green's functions, and useNVC to calculate correlated multiple impurity scattering at thenon-equilibrium density matrix level. After the NEGF-DFT-NVCself-consistent calculation is converged, we calculate thetransmission coefficients by a second, unavoidable, vertexcorrection. The NEGF-DFT-NVC theory allows us to predictnon-equilibrium quantum transport properties of nanoelectronicdevices with atomistic disorder from first principles without anyphenomenological parameters. The theory and implementation detailsare presented.We have applied the NEGF-DFT-NVC method to investigate severalimportant problems associated with disorder scattering innano-electronic device systems. These include interface roughnessscattering in Fe/vacuum/Fe magnetic tunnel junctions; the diffusivescattering of carriers due to oxygen vacancies in Fe/MgO/Fe magnetictunnel junctions; the surface roughness scattering that enhancesresistivity of copper interconnect wires; and effects of barrierlayer coating for Cu interconnects. Our investigations reveal veryimportant role played by the atomic level defects and impurities toboth equilibrium and nonequilibrium quantum transport properties,and results compare favorably with the corresponding experimentaldata.<br>Dans le cas de nanostructures concrètes, un certain degré de désordre apparaît inévitable tel que la présence d'impuretés, de structures cristallines imparfaites, de surfaces rugueuses, etc. Dans les situations où le désordre se matérialise aléatoirement dans la nanostructure, tout calcul de transport quantique devrait être réalisé en tant que moyenne sur plusieurs distributions désordonnées. Une approche par force brute consiste à générer plusieurs configurations désordonnées, calculer les propriétés d'intérêt pour chacune d'entre elles, et ensuite effectuer la moyenne des résultats. Dans le cas de la modélisation atomique à partir des principes premiers, une telle moyenne par force brute est prohibitive en terme de temps de calcul - sinon impossible. Il est ainsi très important et utile de développer un cadre théorique où la moyenne de désordre est faite analytiquement avant que l'analyse par les principes premiers ne soit effectuée. Dans cette thèse, nous avons développé une telle théorie de transport quantique hors équilibre à partir des principes premiers et le logiciel de modélisation associé pour la prédiction de la diffusion par désordre dans des dispositifs nanoélectroniques. Notre formalisme théorique est basé sur l'utilisation de la théorie de la fonctionnelle de densité (DFT) dans le cadre de la fonction de Green hors équilibre de Keldysh(NEGF), et sur l'emploi d'une correction de sommet hors équilibre (NVC) pour le traitement des moyennes configurationnelles de désordre au niveau de la matrice de densité hors équilibre. Dans notre théorie, nous utilisons l'approximation du potentiel cohérent afin de calculer les moyennes de désordre de l'Hamiltonien du dispositif et les fonctions de Green à une particule, et nous utilisons la NVC pour calculer la diffusion par impuretés multiples corrélée au niveau de la matrice de densité hors équilibre. Après que le calcul auto-cohérent NEGF-DFT-NVC ait convergé, nous calculons les coefficients de transmission par le biais d'une seconde correction de sommet inévitable. La théorie NEGF-DFT-NVC nous permet de prédire les propriétés de transport quantique hors équilibre de dispositifs nanoélectroniques avec désordre au niveau atomique à partir des principes premiers sans aucun paramètre phénoménologique. La théorie et les détails d'implémentation sont présentés dans ce travail. Nous avons appliqué la méthode NEGF-DFT-NVC afin d'examiner plusieurs problèmes importants associés à la diffusion par désordre dans des systèmes de dispositif nanoélectronique. Cela inclut la diffusion par rugosité de surface dans des jonctions tunnel magnétiques Fe/vide/Fe; la diffusion due à des lacunes d'oxygène dans des jonctions tunnel magnétiques Fe/MgO/Fe; la diffusion par rugosité de surface qui décuple la resistivité de fils deconnexion en cuivre; et les effets des revêtements couche barrière pour des connexionsen Cu. Notre étude révèle le rôle très important joué par les défauts de niveau atomique et les impuretés vis-à-vis des propriétés de transport quantique à la fois en équilibre et hors équilibre, et les résultats se comparent favorablement aux données expérimentales correspondantes.
27
Hollowood, Timothy James. "Twisted strings, vertex operators and algebras." Thesis, Durham University, 1988. http://etheses.dur.ac.uk/6424/.
Full textAbstract:
This work is principally concerned with the operator approach to the orbifold compactification of the bosonic string. Of particular importance to operator formalism is the con formal structure and the operator product expansion. These are introduced and discussed in detail. The Frenkel-Kac-Segal mechanism is then examined and is shown to be a consequence of the duality of dimension one operators of an analytic bosonic string compactified on a certain torus. Possible generalizations to higher dimension operators are discussed, this includes the cross-bracket algebra which plays a central role in the vertex operator representation of Griess's algebra, and hence the Fischer-Griess Monster Group. The mechanism of compactification is then extended to orbifolds. The exposition includes a detailed account of the twisted sectors, especially of the zero-modes and the twisted operator cocycles. The conformal structure, vertex operators and correlation functions for twisted strings are then introduced. This leads to a discussion of the vertex operators which represent the emission of untwisted states. It is shown how these operators generate Kac-Moody algebras in the twisted sectors. The vertex operators which insert twisted states are then constructed, and their role as intertwining operators is explained. Of particular importance in this discussion is the role of the operator cocycles, which are seen to be crucial for the correct working of the twisted string emission vertices. The previously established formalism is then applied in detail to the reflection twist. This includes an explicit representation of the twisted operator cocycles by elements of an appropriate Clifford algebra and the elucidation of the operator algebra of the twisted emission vertices, for the ground and first excited states in the twisted sector. This motivates the 'enhancement mechanism', a generalization of the Frenkel-Kac-Segal mechanism, involving twisted string emission vertices, in dimensions 8, 16 and 24. associated with rank 8 Lie algebras, rank 16 Lie algebras and the cross-bracket algebra for the Leech lattice, respectively. Some of the relevant characters of the 'enhanced" modules are determined, and the connection of the cross-bracket algebra to the phenomenon of 'Monstrous Moonshine' and the Monster Group is explained. Algebra enhancement is then discussed from the greatly simplified shifted picture and extensions to higher order twists are considered. Finally, a comparison of this work with other recent research is given. In particular, the connection with the path integral formalism and the extension to general asymmetric orbifolds is discussed. The possibility of reformulating the moonshine module in a 'covaxiant' twenty-six dimensional setting is also considered.
28
Van, Ekeren Jethro (Jethro William). "Modular invariance for vertex operator superalgebras." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/73375.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2012.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 133-134).<br>We generalize Zhu's theorem on modular invariance of characters of vertex operator algebras (VOAs) to the setting of vertex operator superalgebras (VOSAs) with rational, rather than integer, conformal weights. To recover SL₂ (Z)-invariance, it turns out to be necessary to consider characters of twisted modules. Initially we assume our VOSA to be rational, then we replace rationality with a different (weaker) condition. We regain SL₂(Z)-invariance by including certain 'logarithmic' characters. We apply these results to several examples. Next we define and study 'higher level twisted Zhu algebras' associated to a VOSA. Using a novel construction we compute these algebras for some well known VOAs.<br>by Jethro Van Ekeren.<br>Ph.D.
29
Heluani, Reimundo. "Super symmetric vertex algebras and supercurves." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/34546.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2006.<br>Includes bibliographical references (p. 149-151).<br>We define and study the structure of SUSY Lie conformal and vertex algebras. This leads to effective rules for computations with superfields. Given a strongly conformal SUSY vertex algebra V and a supercurve X, we construct a vector bundle [ ... ] on X, the fiber of which, is isomorphic to V. Moreover, the state-field correspondence of V canonically gives rise to (local) sections of these vector bundles. We also define chiral algebras on any supercurve X, and show that the vector bundle [ ... ] corresponding to a SUSY vertex algebra, carries the structure of a chiral algebra.<br>by Reimundo Heluani.<br>Ph.D.
30
Moitra, Ankur. "Vertex sparsification and universal rounding algorithms." Thesis, Massachusetts Institute of Technology, 2011. http://hdl.handle.net/1721.1/66019.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 125-129).<br>Suppose we are given a gigantic communication network, but are only interested in a small number of nodes (clients). There are many routing problems we could be asked to solve for our clients. Is there a much smaller network - that we could write down on a sheet of paper and put in our pocket - that approximately preserves all the relevant communication properties of the original network? As we will demonstrate, the answer to this question is YES, and we call this smaller network a vertex sparsifier. In fact, if we are asked to solve a sequence of optimization problems characterized by cuts or flows, we can compute a good vertex sparsifier ONCE and discard the original network. We can run our algorithms (or approximation algorithms) on the vertex sparsifier as a proxy - and still recover approximately optimal solutions in the original network. This novel pattern saves both space (because the network we store is much smaller) and time (because our algorithms run on a much smaller graph). Additionally, we apply these ideas to obtain a master theorem for graph partitioning problems - as long as the integrality gap of a standard linear programming relaxation is bounded on trees, then the integrality gap is at most a logarithmic factor larger for general networks. This result implies optimal bounds for many well studied graph partitioning problems as a special case, and even yields optimal bounds for more challenging problems that had not been studied before. Morally, these results are all based on the idea that even though the structure of optimal solutions can be quite complicated, these solution values can be approximated by crude (even linear) functions.<br>by Ankur Moitra.<br>Ph.D.
31
Lucke, Klaus. "On representations of vertex operator algebras." Thesis, University of Cambridge, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.627367.
Full text
32
Olbermann, Heiner. "Quantum field theory via vertex algebras." Thesis, Cardiff University, 2010. http://orca.cf.ac.uk/54994/.
Full textAbstract:
We investigate an alternative formulation of quantum field theory that elevates the Wilson- Zimmermann operator product expansion (OPE) to an axiom of the theory. We observe that the information contained in the OPE coefficients may be straightforwardly repackaged into "vertex operators". This way of formulating quantum field theory has quite obvious similarities to the theory of vertex algebras. As examples of this framework, we discuss the free massless boson in D dimensions and the massless Thirring model. We set up perturbation theory for vertex algebras. We discuss a general theory of perturbations of vertex algebras, which is similar to the Hochschild cohomology describing the deformation theory of ordinary algebras. We pass on to a more explicit discussion by looking at perturbations of the free massless boson in D dimensions. The perturbations we consider correspond to some interaction Lagrangian P(<p) = A Cp if. We construct the perturbations by exploiting the associativity of the vertex operators and the field equation in perturbative form. We develop a set of graphical rules that display the vertex operators as certain multiple series reminiscent of the hypergeometric series.
33
Gaskill, Patrick. "Modular Forms and Vertex Operator Algebras." VCU Scholars Compass, 2013. http://scholarscompass.vcu.edu/etd/3177.
Full textAbstract:
In this thesis we present the connection between vertex operator algebras and modular forms which lies at the heart of Borcherds’ proof of the Monstrous Moonshine conjecture. In order to do so we introduce modular forms, vertex algebras, vertex operator algebras and their partition functions. Each notion is illustrated with examples.
34
Fadhal, Emad Alden Sir Alkhatim Abraham. "Strong simplicity of groups and vertex - transitive graphs." Thesis, University of the Western Cape, 2010. http://etd.uwc.ac.za/index.php?module=etd&action=viewtitle&id=gen8Srv25Nme4_6774_1362393687.
Full textAbstract:
<p>In the course of exploring various symmetries of vertex-transitive graphs, we introduce the concept of quasi-normal subgroups in groups. This is done since the symmetries of vertex-transitive graphs are intimately linked to those, fait accompli, of groups. With this, we ask if the concept of strongly simple groups has a place for consideration. We have shown that for n ><br>5, An, the alternating group on n odd elements, is not strongly simple.</p>
35
RAMAMONJISOA-RAJOELISOLO, MIRANA. "Tuberculose vertebrale de l'arc posterieur : a propos d'une observation privilegiee." Aix-Marseille 2, 1990. http://www.theses.fr/1990AIX20195.
Full text
36
Weijers, Elisabeth Maria Johannes Theresia. "Nietzsche als verteller hoe het lichaam wordt wat het is /." Kampen : Amsterdam : Agora ; Universiteit van Amsterdam [Host], 2000. http://dare.uva.nl/document/83443.
Full text
37
Clark, David. "Algebraic Analysis of Vertex-Distinguishing Edge-Colorings." Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/1053.
Full textAbstract:
Vertex-distinguishing edge-colorings (vdec colorings) are a restriction of proper edge-colorings. These special colorings require that the sets of edge colors incident to every vertex be distinct. This is a relatively new field of study. We present a survey of known results concerning vdec colorings. We also define a new matrix which may be used to study vdec colorings, and examine its properties. We find several bounds on the eigenvalues of this matrix, as well as results concerning its determinant, and other properties. We finish by examining related topics and open problems.
38
Saito, Yoshihisa. "Quantum toroidal algebras and their vertex representations." 京都大学 (Kyoto University), 1997. http://hdl.handle.net/2433/202423.
Full text
39
Turner, Jason M. "Modelling disordered foams using the vertex ensemble." Thesis, Imperial College London, 1998. http://hdl.handle.net/10044/1/11940.
Full text
40
Frühwirth, Rudolf, Korbinian Eckstein, and Sylvia Frühwirth-Schnatter. "Vertex finding by sparse model-based clustering." IOP Publishing, 2016. http://epub.wu.ac.at/6173/1/jop.pdf.
Full textAbstract:
The application of sparse model-based clustering to the problem of primary vertex finding is discussed. The observed z-positions of the charged primary tracks in a bunch crossing are modeled by a Gaussian mixture. The mixture parameters are estimated via Markov Chain Monte Carlo (MCMC). Sparsity is achieved by an appropriate prior on the mixture weights. The results are shown and compared to clustering by the expectation-maximization (EM) algorithm.
41
Rudgyard, Michael A. "Cell vertex methods for compressible gas flows." Thesis, University of Oxford, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.279991.
Full text
42
Pinzon, Daniel F. "VERTEX ALGEBRAS AND STRONGLY HOMOTOPY LIE ALGEBRAS." UKnowledge, 2006. http://uknowledge.uky.edu/gradschool_diss/382.
Full textAbstract:
Vertex algebras and strongly homotopy Lie algebras (SHLA) are extensively used in qunatum field theory and string theory. Recently, it was shown that a Courant algebroid can be naturally lifted to a SHLA. The 0-product in the de Rham chiral algebra has an identical formula to the Courant bracket of vector fields and 1-forms. We show that in general, a vertex algebra has an SHLA structure and that the de Rham chiral algebra has a non-zero l4 homotopy.
43
Li, Yin-chiu, and 李燕超. "Min-max theorems on feedback vertex sets." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B42577111.
Full text
44
Awwad, Ahmad M. "Efficient structural outlooks for Vertex Product Networks." Thesis, University of Glasgow, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.400742.
Full text
45
Cosh, Benjamin Colin. "Vertex splitting and connectivity augmentation in hypergraphs." Thesis, Goldsmiths College (University of London), 2000. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.272126.
Full textAbstract:
We consider problems of splitting and connectivity augmentation in hypergraphs. In a hypergraph G = (V +s, E), to split two edges su, sv, is to replace them with a single edge uv. We are interested in doing this in such a way as to preserve a defined level of connectivity in V . The splitting technique is often used as a way of adding new edges into a graph or hypergraph, so as to augment the connectivity to some prescribed level. We begin by providing a short history of work done in this area. Then several preliminary results are given in a general form so that they may be used to tackle several problems. We then analyse the hypergraphs G = (V + s, E) for which there is no split preserving the local-edge-connectivity present in V. We provide two structural theorems, one of which implies a slight extension to Mader’s classical splitting theorem. We also provide a characterisation of the hypergraphs for which there is no such “good” split and a splitting result concerned with a specialisation of the local-connectivity function. We then use our splitting results to provide an upper bound on the smallest number of size-two edges we must add to any given hypergraph to ensure that in the resulting hypergraph we have λ(x, y) ≥ r(x, y) for all x, y in V, where r is an integer valued, symmetric requirement function on V*V. This is the so called “local-edge-connectivity augmentation problem” for hypergraphs. We also provide an extension to a Theorem of Szigeti, about augmenting to satisfy a requirement r, but using hyperedges. Next, in a result born of collaborative work with Zoltán Király from Budapest, we show that the local-connectivity augmentation problem is NP-complete for hypergraphs. Lastly we concern ourselves with an augmentation problem that includes a locational constraint. The premise is that we are given a hypergraph H = (V,E) with a bipartition P = {P1, P2} of V and asked to augment it with size-two edges, so that the result is k-edge-connected, and has no new edge contained in some P(i). We consider the splitting technique and describe the obstacles that prevent us forming “good” splits. From this we deduce results about which hypergraphs have a complete Pk-split. This leads to a minimax result on the optimal number of edges required and a polynomial algorithm to provide an optimal augmentation.
46
SPERANZA, YGOR HECHT. "OBJECT FRACTURE ANIMATION BASED ON VERTEX CLUSTERS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2012. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=21082@1.
Full textAbstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>Neste trabalho, estendemos o método de simulaão de objetos deformáveis de Muller et al. (2005) para simular fraturas. Em Muller et al.,
os vértices da superfície do objeto são tratados como partículas, sujeitas a
forças externas ao objeto e a uma forçainterna de restituição, que tenta
restaurar a forma do objeto através de uma técnica de casamento de forma.
Esse método permite-nos simular efeitos como alongamento e flexão de
forma estável e, por ser geometricamente motivado, é ideal para situações que não exijam realismo físico, como a área de animação e jogos. Muller et
al. propõem uma forma de simulação composta, onde objetos deformáveis
podem funcionar como uma composição de agrupamentos de vértices de
sua superfície: esses agrupamentos agem como objetos deformáveis em si.
Nossas contribuições concentram-se na variação deste modelo. Propomos
utilizar o método de Attene et al. (2006) de segmentação hierárquica de
superfícies para determinar de forma automática agrupamentos que sejam
partes naturais do objeto. Criamos também uma técnica para determinar
de forma suave a influência dos agrupamentos em cada vértice, levando em
consideração aspectos globais e locais do objeto. Por fim, estabelecemos o
algoritmo para a detecção de fraturas entre os agrupamentos e a execução da ruptura correspondente. Utilizamos um conjunto de objetos para provar
que nosso método é capaz de simular fraturas naturalmente, podendo ser
usado tanto em sistemas os quais exijam resultado mais simples, contudo
em tempo real, quanto em sistemas que necessitam de fraturas apresentando
maior riqueza de detalhes.<br>In this work, we extend the simulation method for deformable objects
proposed by Muller et al. (2005) so as to be able to simulate fracturing.
In Muller et al., the object surface vertices are handled such as particles
in a particle system: moved by external forces and by internal restitution
forces, which try to restore the original object form using a shape matching
technique. This method allow us to simulate stretching and twisting effects
in a stable manner, and, because it is geometrically motivated, it is ideal
to situations which does not demand physical realism, as in games and
animation. Muller et al. propose in their work a composed simulation
mode, in which deformable objects work like a composition of clusters of
its surface vertices: these clusters behave like deformable objects on their
own. Our contributions focus on a variation of this model. We propose the
hierarchical vertex surface segmentation method from Attene et al. (2006)
as an automatic way of determining clusters which are natural parts of the
object. We also created a technique to smoothly calculate the influence of
the clusters in each vertex, considering global and local aspects of the object.
Finally, we established an algorithm which detects fractures between vertex
clusters and which breaks the object surface accordingly. We employed a
set of 3D objects to demonstrate that our method is capable of naturally
simulating fractures, for systems which demand simpler, real-time results,
as well as for systems which need richer and more detailed fractures.
47
Kettle, Nathan. "Vertex disjoint subgraphs and non-repetitive sequences." Thesis, University of Cambridge, 2014. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.707981.
Full text
48
Wang, Weiqiang. "Representations of vertex operator algebras and superalgebras." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/36999.
Full text
49
Melotti, Paul. "Modèles intégrables de spins, vertex et boucles." Thesis, Sorbonne université, 2019. http://www.theses.fr/2019SORUS258.
Full textAbstract:
Cette thèse porte sur divers problèmes de mécanique statistique, liée à l'étude des modèles intégrables. Dans ces modèles, l'existence de symétries particulières, exprimées par exemple par les équations de Yang-Baxter ou transformations "triangle-étoile'', permettent de donner des formules exactes pour les observables d'intérêt. Dans un premier temps, nous étudions la transformation triangle-étoile du modèle d'Ising, reformulée par Kashaev en une équation d'évolution polynomiale. Nous montrons que cette évolution fait apparaître des objets combinatoires : les modèles de boucles C2(1). Nous montrons de plus des résultats de formes limites et des calculs d'énergie libre pour ces modèles de boucles. Dans un second temps, nous développons la compréhension du modèle des ``huit sommets'', qui généralise les modèles de glace. Nous montrons que dans le régime des fermions libres, ces modèles peuvent être compris via des modèles de dimères bipartis, et des fortes structures d'intégrabilité de ces derniers. Nous en déduisons des constructions de mesures de Gibbs et des corrélations en volume infini, notamment pour des régimes Z-invariants sur des graphes isoradiaux. Enfin, nous proposons des interprétations des équations de Yang-Baxter en géométrie discrète, via des plongements particuliers de graphes<br>This thesis deals with several problems in statistical mechanics, related to the study of integrable models. In these models, some particular symmetries, like those expressed by the Yang-Baxter equations or "star-triangle'' transformations, lead to the existence of exact formulas for observables of interest.In a first part, we study the star-triangle transformation of the Ising model, recast into a singe polynomial evolution equation by Kashaev. We show that this evolution creates combinatorial objects: C2(1) loop models. We show some limit shapes results and compute the free energy of these loop models. In a second part, we develop the study of the ``eight-vertex'' model, that generalises ice models. In the free-fermion regime, we translate these models into dimers on a bipartite graph, and use the strong integrability structures of these. We deduce the construction of Gibbs measures and correlations in infinite volume, in particular for Z-invariant regimes on isoradial graphs. Finally, we suggest interpretations of the Yang-Baxter equations in discrete geometry, via particular embeddings of graphs
50
Hlavacek, Amy Lee. "9-vertex irreducible graphs on the torus /." The Ohio State University, 1997. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487944660932981.
Full text