Thesis (M.S.)--Rutgers University, 2009. / "Graduate Program in Physics and Astronomy." Includes bibliographical references (p. 17).

Thesis (Ph. D.)--Rutgers University, 2009. / "Graduate Program in Mathematics." Includes bibliographical references (p. 151-154).

We provide first a purely VOA-theoretic guide to the theory of coordinate transformations for a VOA in direct accordance with its first appearance in a paper of Zhu. Among these results, we are able to obtain new closed-form expressions for the square-bracket Heisenberg modes. We then elaborate on the connection to p-adic modular forms which arise as characters of states in p-adic VOAs. In particular, we show that the image of the p-adic character map for the p-adic Heisenberg VOA contains infinitely-many p-adic modular forms of level one which are not quasi-modular. Finally, we introduce a new VOA structure obtained from the Artin-Hasse exponential, and serving as the p-adic analogue of the square-bracket formalism. / Thesis / Master of Science (MSc)

Le modèle de Hubbard bi-dimensionnel (2D) est souvent considéré comme le modèle minimal pour les supraconducteurs à haute température critique à base d'oxyde de cuivre (SCHT). Sur un réseau carré, ce modèle possède les phases qui sont communes à tous les SCHT, la phase antiferromagnétique, la phase supraconductrice et la phase dite du pseudogap. Il n'a pas de solution exacte, toutefois, plusieurs méthodes approximatives permettent d'étudier ses propriétés de façon numérique. Les propriétés optiques et de transport sont bien connues dans les SCHT et sont donc de bonne candidates pour valider un modèle théorique et aider à comprendre mieux la physique de ces matériaux. La présente thèse porte sur le calcul de ces propriétés pour le modèle de Hubbard 2D à couplage faible ou intermédiaire. La méthode de calcul utilisée est l'approche auto-cohérente à deux particules (ACDP), qui est non-perturbative et inclue [i.e. inclut] l'effet des fluctuations de spin et de charge à toutes les longueurs d'onde. La dérivation complète de l'expression de la conductivité dans l'approche ACDP est présentée. Cette expression contient ce qu'on appelle les corrections de vertex, qui tiennent compte des corrélations entre quasi-particules. Pour rendre possible le calcul numérique de ces corrections, des algorithmes utilisant, entre autres, des transformées de Fourier rapides et des splines cubiques sont développés. Les calculs sont faits pour le réseau carré avec sauts aux plus proches voisins autour du point critique antiferromagnétique. Aux dopages plus faibles que le point critique, la conductivité optique présente une bosse dans l'infrarouge moyen à basse température, tel qu'observé dans plusieurs SCHT. Dans la résistivité en fonction de la température, on trouve un comportement isolant dans le pseudogap lorsque les corrections de vertex sont négligées et métallique lorsqu'elles sont prises en compte. Près du point critique, la résistivité est linéaire en T à basse température et devient progressivement proportionnelle à T[indice supérieur 2] à fort dopage. Quelques résultats avec sauts aux voisins plus éloignés sont aussi présentés.

A spherometer is often used to precisely measure the radius of curvature of a spherical surface. It can also measure the vertex radius of a more complex surface such as an off-axis parabola (OAP). This paper provides a reliable algorithm to find the vertex radius of an OAP by solving a few equations based on the test geometry. This algorithm can also be easily expanded to any conic surface with high-order aspheric coefficients. The algorithm was verified by measuring an 8-inch diameter OAP and comparing the results with its known prescription. Results show good agreement. An example of measuring the vertex radius of a 4-m diameter OAP is also presented. In addition to this, a calculation was done to show that the coma and astigmatism are independent of the clocking of the spherometer on the optic. (C) 2016 Society of Photo-Optical Instrumentation Engineers (SPIE)

Neste trabalho abordamos o problema de coloraÃÃo de vÃrtices via programaÃÃo inteira. Uma versÃo expandida da formulaÃÃo por conjuntos independentes à utilizada para abrigar outras sub-estruturas do grafos alÃm dos vÃrtices. Cada uma dessas sub-estruturas define uma restriÃÃo que determina quantos conjuntos independentes sÃo necessarios para cobrir aquele subgrafo. Experimentos com um mÃtodo de geraÃÃo de cortes e colunas para o problema sÃo feitos para determinar um limite inferior para um conjunto de instÃncias classicas para esse problema a biblioteca DIMACS. / In this work the vertex coloring problem is approached via integer programming. A tighter version of the independent set formulation is used, where the vertex-related constraints are substituted by subgraph-related constraints. Each constraint establishes a lower bound on the number of independent sets intersecting a subgraph H. It is shown a sufficient condition for this inequality to define a facet of the associated polytope. Basically, H is required to be color critical, not included in another color critical subgraph, and to have a connected complement. Also, the column generation algorithm proposed by Mehotra and Trick (INFORMS Journal in Computing, 1996) is adapted to allow the addition of cutting planes and to provide lower bounds along the process, which may abbreviate its end. Some computational experiments are reported.

Research Doctorate - Doctor of Philosophy (PhD) / In this thesis, a number of new methods for constructing vertex-magic total-labelings of graphs are presented. These represent an advance on existing methods since they are general constructions rather than ad hoc constructions for specific families of graphs. Broadly, five new kinds of construction methods are presented. Firstly, we present a class of methods characterized by adding 2- or 4-factors to a labeled graph, reassigning vertex labels to the edges of these factors and then adding new vertex labels to create a VMTL of the new graph. The major result is a unified method for constructing VMTL of large families of regular graphs, providing strong evidence for MacDougall's conjecture that, apart from a few minor exceptions, all regular graphs possess vertex-magic total-labelings. Secondly, we present methods for obtaining a labeling of a union of two graphs, one of which possesses a strong labeling, and then building on this labeling to create a labeling of an irregular graph. These methods as well as results in the Appendices provide strong evidence against an early conjecture regarding labelings and vertex degrees. Thirdly, constructions are presented for a new kind of magic square, containing some zeroes, which can be used to build labelings of graphs from labeled spanning subgraphs. Next, constructions are presented for a new kind of anti-magic square, containing some zeroes, which is equivalent to a strong labeling of certain kinds of bipartite graphs which can in turn be built upon to produce labelings of graphs with more edges. Finally, we present a method of mutating a graph labeling by reassigning edges in a way that preserves the magic constant to obtain a labeling of a different graph. This method provides a prolific source of new labelings.

This thesis focuses on efficient design of a vertex shader for per-vertex operations such as Transformation and Lighting in the OpenGL ES 2.0 graphics pipeline. The vertex shader performs these complex operations using logarithmic number system, and makes partial optimization for the hardware area based on the accuracy requirement of half-precision floating-point. The vertex shader design emphasizes low cost, and is well suited to low-accuracy embedded applications. The vertex shader is an SIMD (Single-Instruction-Multiple-Data) design with customized instruction set that allows users to write efficient vertex shader programs.

OpenGL ES 2.0 programmable 3D graphics pipeline is the current new standard for embedded graphics processor designs. The programmable vertex shader replaces the geometry operations in the previous fixed-function graphics pipeline and provides more flexible APIs for more realistic animation effects. In this thesis, we introduce the OpenGL ES 2.0 specification, and the design of programmable vertex shader architecture and instruction set. In particular, we focus on the integration issues encountered when the vertex shader is integrated with other hardware components and software during the entire SoC design, and verify the vertex shader on FPGA with demonstration.

Clustering is the unsupervised classification of patterns into groups, which is easy provided the data of patterns are consistent. However, real data are almost always tempered with inconsistencies, which make it a hard problem, and actually, the most widely studied formulations, correlation clustering and hierarchical clustering, are both NP-hard. In the graph representation of data, inconsistencies also frequently present themselves as cycles, also called deadlocks, and to break cycles by removing vertices is the objective of the classical feedback vertex set (FVS) problem. This dissertation studies the three problems, correlation clustering, hierarchical clustering, and disjoint-FVS (a variation of FVS), from a kernelization approach. A kernelization algorithm in polynomial time reduces a problem instance provably to speed up the further processing with other approaches. For each of the problems studied, an efficient kernelization algorithm of linear or sub-quadratic running time is presented. All the kernels obtained in this dissertation have linear size with very small constants. Better parameterized algorithms are also designed based on the kernels for the last two problems. Finally, some concluding remarks on possible directions for future research are briefly mentioned.