Tesis sobre el tema "Vertexer"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores tesis para su investigación sobre el tema "Vertexer".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore tesis sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Kohn, Eduardo. "Vertedor do tipo labirinto". Universidade de São Paulo, 2006. http://www.teses.usp.br/teses/disponiveis/3/3147/tde-11122006-142016/.
Texto completoThe 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.
Lewis, Jason Robert. "Vertex-edge and edge-vertex parameters in graphs". Connect to this title online, 2007. http://etd.lib.clemson.edu/documents/1193079748/.
Texto completoZaccara, Luciana. "Caratterizzazione biomeccanica di vertebre umane". Master's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/9305/.
Texto completoBerra, Francesco. "Caratterizzazione Biomeccanica di vertebre umane". Master's thesis, Alma Mater Studiorum - Università di Bologna, 2013. http://amslaurea.unibo.it/5296/.
Texto completoD'Amico, Giulia. "Caratterizzazione biomeccanica di vertebre umane". Master's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/8556/.
Texto completoNiu, 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.
Texto completoBianco, 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.
Texto completoRoney, J. Michael (John Michael) 1958 OPAL Carleton University Dissertation Physics. "The OPAL vertex detector". Ottawa.:, 1989.
Buscar texto completoMasum, Mohammad. "Vertex Weighted Spectral Clustering". Digital Commons @ East Tennessee State University, 2017. https://dc.etsu.edu/etd/3266.
Texto completoArauz, 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/.
Texto completoSpillways 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.
Weigel, Martin. "Vertex Models on Random Graphs". Doctoral thesis, Universitätsbibliothek Leipzig, 2004. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-37308.
Texto completoIn 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
Niesink, Patrick. "The Vertex-Switching Reconstruction Problem". Thesis, University of Ottawa (Canada), 2010. http://hdl.handle.net/10393/28629.
Texto completoMyhill, Richard Graham. "Automorphisms and twisted vertex operators". Thesis, Durham University, 1987. http://etheses.dur.ac.uk/6674/.
Texto completoSkliros, Dimitri P. "Vertex operators for cosmic strings". Thesis, University of Sussex, 2011. http://sro.sussex.ac.uk/id/eprint/48134/.
Texto completoYu, Wen. "Vertex unique labelled subgraph mining". Thesis, University of Liverpool, 2015. http://livrepository.liverpool.ac.uk/2026959/.
Texto completoBacak, 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.
Texto completoPittau, Lorenzo. "Quantum groups and vertex models". Master's thesis, Alma Mater Studiorum - Università di Bologna, 2012. http://amslaurea.unibo.it/4118/.
Texto completoDross, François. "Vertex partition of sparse graphs". Thesis, Montpellier, 2018. http://www.theses.fr/2018MONTS011/document.
Texto completoThe 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
KOSSAI, DEBORD CHANTAL. "Diagnostic radiologique de l'hydatidose vertebrale". Clermont-Ferrand 1, 1988. http://www.theses.fr/1988CLF11044.
Texto completoLAMBERON, NOEL. "L'osteo-arthropathie nerveuse vertebrale : a propos d'une observation". Besançon, 1992. http://www.theses.fr/1992BESA3042.
Texto completoPAOLI, 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.
Texto completoBonidan, Olivier. "Morphometrie vertebrale : etude de la reproductibilite ; definition des valeurs normales". Amiens, 1990. http://www.theses.fr/1990AMIEM110.
Texto completoPiel, 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.
Texto completocentrosome des vertébrés : son rôle dans la motilité cellulaire et son rôle dans le cycle de
division cellulaire.
Après une introduction en trois parties (un tour d'horizon dans une optique historique, un
exposé détaillé des connaissances actuelles, puis une réflexion plus générale sur des bases
phylogénétiques), deux travaux sont présentés : une étude des rôles respectifs des deux
centrioles du centrosome des cellules de vertébrés, puis une étude du comportement
particulier du centrosome dans ces cellules en sortie de mitose.
L'ensemble de ce travail se fonde sur un outil précieux : l'établissement de lignées cellulaires
qui expriment de manière stable la centrine 1 humaine couplée à la GFP, ce qui constitue un
excellent marqueur des centrioles et de leur stade de maturation. En effet, le centrosome des
vertébrés contient deux structures microtubulaires appelée centrioles qui se reproduisent en
synchronie avec le cycle de division cellulaire par un mécanisme de duplication, un nouveau
centriole étant assemblé à proximité de chaque centriole présent. Il y a donc dans chaque
cellule, après une mitose, un nouveau et un ancien centriole aussi appelés centriole parental
ou centriole père et centriole fils.
La première étude, après avoir succinctement défini le comportement des centrioles dans les
différentes phases du cycle, se concentre plus précisément sur la phase G1 pendant laquelle il
a pu être observé que les deux centrioles peuvent transitoirement se séparer de plus de dix
microns. L'un des deux centrioles, qui a pu être identifié comme le centriole le plus jeune, a
une mobilité parfois importante, alors que le plus ancien, qui est associé à l'aster de
microtubules par des appendices qui sont caractéristiques de son ancienneté reste près du
centroïde de la cellule. La différence d'abondance des microtubules à proximité des deux
centrioles a pu être attribuée à une régulation différentielle de l'ancrage : le centriole le plus
ancien capture les microtubules qui sont nucléés dans un rayon de quelques microns autours
de lui, alors que le centriole fils, qui a une capacité de nucléation équivalente, a une capacité
d'ancrage des microtubules réduite. Ainsi, quand les deux centrioles sont éloignés l'un de
l'autre, de nombreux microtubules libres peuvent être observés dans la cellule, au contraire,
quand ils sont proches, la plupart des microtubules cellulaires sont ancrés sur le centrosome
(et en particulier sur le centriole père). Nous avons donc proposé que la cellule puisse
modifier son réseau microtubulaire en modulant la distance intercentriolaire.
La deuxième étude présentée porte sur un comportement particulier du centriole parental en
fin de mitose : après que les cellules se sont étalées, mais alors qu'elles sont encore reliées par
un pont cytoplasmique, les deux centrioles, dans chaque cellule fille, se séparent puis le
centriole parental quitte sa position centrale et stationne pendant 10 à 30 minutes à proximité
du pont cytoplasmique intercellulaire. Le pont se pince alors de chaque côté de la pièce
intermédiaire puis se rompt lorsque le centriole parental regagne sa position près du noyau.
Nous avons pu déterminer que le pincement du pont correspondait au détachement des
faisceaux de microtubules qu'il contient. Nous avons ensuite, à l'aide de drogue qui
dépolymérisent les microtubules, suggéré l'existence d'un contrôle de la présence du centriole
parental dans le pont. Nous avons étudié des cas de cellules acentriolaires et pu mettre en
évidence des défauts liés à la cytocinèse. Enfin, il nous est apparu, à la suite d'expériences sur
des substrats plus ou moins adhésifs que l'adhésion de la cellule à son substrat est un des
paramètres clé de la régulation de cet événement de fin de mitose.
Des interprétations plus spéculatives sont proposées dans les discussions qui suivent l'exposé
des résultats, ainsi que des expériences pour les tester.
Linde, Klaus-Juergen. "Global Vertex Algebras on Riemann Surfaces". Diss., lmu, 2004. http://nbn-resolving.de/urn:nbn:de:bvb:19-30690.
Texto completoQin, 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.
Texto completoKe, 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.
Texto completoDans 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.
Hollowood, Timothy James. "Twisted strings, vertex operators and algebras". Thesis, Durham University, 1988. http://etheses.dur.ac.uk/6424/.
Texto completoVan, Ekeren Jethro (Jethro William). "Modular invariance for vertex operator superalgebras". Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/73375.
Texto completoCataloged from PDF version of thesis.
Includes bibliographical references (p. 133-134).
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.
by Jethro Van Ekeren.
Ph.D.
Heluani, Reimundo. "Super symmetric vertex algebras and supercurves". Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/34546.
Texto completoIncludes bibliographical references (p. 149-151).
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.
by Reimundo Heluani.
Ph.D.
Moitra, Ankur. "Vertex sparsification and universal rounding algorithms". Thesis, Massachusetts Institute of Technology, 2011. http://hdl.handle.net/1721.1/66019.
Texto completoCataloged from PDF version of thesis.
Includes bibliographical references (p. 125-129).
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.
by Ankur Moitra.
Ph.D.
Lucke, Klaus. "On representations of vertex operator algebras". Thesis, University of Cambridge, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.627367.
Texto completoOlbermann, Heiner. "Quantum field theory via vertex algebras". Thesis, Cardiff University, 2010. http://orca.cf.ac.uk/54994/.
Texto completo
Gaskill, Patrick. "Modular Forms and Vertex Operator Algebras". VCU Scholars Compass, 2013. http://scholarscompass.vcu.edu/etd/3177.
Texto completoFadhal, 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.
Texto completoIn 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 >
5, An, the alternating group on n odd elements, is not strongly simple.
RAMAMONJISOA-RAJOELISOLO, MIRANA. "Tuberculose vertebrale de l'arc posterieur : a propos d'une observation privilegiee". Aix-Marseille 2, 1990. http://www.theses.fr/1990AIX20195.
Texto completoWeijers, 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.
Texto completoClark, David. "Algebraic Analysis of Vertex-Distinguishing Edge-Colorings". Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/1053.
Texto completoSaito, Yoshihisa. "Quantum toroidal algebras and their vertex representations". 京都大学 (Kyoto University), 1997. http://hdl.handle.net/2433/202423.
Texto completoTurner, Jason M. "Modelling disordered foams using the vertex ensemble". Thesis, Imperial College London, 1998. http://hdl.handle.net/10044/1/11940.
Texto completoFrühwirth, Rudolf, Korbinian Eckstein y Sylvia Frühwirth-Schnatter. "Vertex finding by sparse model-based clustering". IOP Publishing, 2016. http://epub.wu.ac.at/6173/1/jop.pdf.
Texto completoRudgyard, 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.
Texto completoPinzon, Daniel F. "VERTEX ALGEBRAS AND STRONGLY HOMOTOPY LIE ALGEBRAS". UKnowledge, 2006. http://uknowledge.uky.edu/gradschool_diss/382.
Texto completoLi, Yin-chiu y 李燕超. "Min-max theorems on feedback vertex sets". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B42577111.
Texto completoAwwad, 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.
Texto completoCosh, 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.
Texto completoSPERANZA, 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.
Texto completoNeste 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.
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.
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.
Texto completoWang, Weiqiang. "Representations of vertex operator algebras and superalgebras". Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/36999.
Texto completoMelotti, Paul. "Modèles intégrables de spins, vertex et boucles". Thesis, Sorbonne université, 2019. http://www.theses.fr/2019SORUS258.
Texto completoThis 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
Hlavacek, Amy Lee. "9-vertex irreducible graphs on the torus /". The Ohio State University, 1997. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487944660932981.
Texto completo