Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 2188 for “"vertices"”.
-
Kinematic fitting of detached vertices
… was developed to reconstruct the detached vertices of these decays, where confidence level cuts on the fits are used to remove background events. Prior to fitting these decays, the exclusive reaction gammaD→ pppi- was studied in order to correct the track measurements and covariance …
-
Vertices in Total Dominating Sets.
… denote a property of interest concerning sets of vertices. A vertex u is rho-good if u is contained in a {minimum, maximum} rho-set in G and rho-bad if u is not contained in a rho-set. Let g denote the number of rho-good vertices and b denote the number of rho-bad vertices. A graph G is called …
-
Mode Vertices and Mode Graphs.
… a graph, G, is the subgraph induced by the mode vertices of G. A mode graph is a connected graph for which each vertex is a mode vertex. Note that mode graphs are a generalization of self-centered graphs. This paper presents some results based on these definitions.
-
On End Vertices of Search Algorithms
Given a graph G=(V,E), a vertex ordering of G is a total order v1,v2,...,vn of V. A graph search algorithm is a systematic method for visiting each vertex in a graph, naturally producing a vertex ordering of the graph. We explore the problem of determining whether a given vertex in a graph can be …
-
Vertices of Representations of Finite Groups
Made available in DSpace on 2014-12-14T13:09:26Z (GMT). No. of bitstreams: 1 7606726.pdf: 2014864 bytes, checksum: fe52109183d1e961a7a277a82fa930d3 (MD5) Previous issue date: 1975
-
Vertices and vortices in high Tc superconductors
This thesis is organized in two independent parts, in which I study two different aspects of high Tc superconductivity. The first part begins with an introduction aimed to briefly introduce some relevant experimental and theoretical works performed in recent years, that have helped us to think …
-
Weierstrass Vertices and Divisor Theory of Graphs
… algebraic curves. The weight of the Weierstrass vertices is then calculated in a manner analogous to the algebraic curve case. Although there are many graphs for which all vertices are Weierstrass vertices, there are bounds on the total weight of the Weierstrass vertices as a function of the …
-
Vertices for Iwahori-Hecke algebras of the symmetric group
… explore the notions of relative projectivity and vertices for H_n, the Iwahori-Hecke algebra related to the symmetric group. We begin by generalising notions from local representation theory of finite groups, such as a Green correspondence and a Brauer correspondence for the blocks of these …
-
Detoured and delayed : delving into the depths of displaced vertices
This thesis presents a search for displaced production of Higgs bosons or Z⁰ bosons, originating from the decay of a neutral long-lived particle (LLP) and reconstructed in the decay modes H → γγ and Z → ee. The thesis uses the full Run 2 data set of proton–proton collisions delivered by the LHC at …
-
Explorations in the Classification of Vertices as Good or Bad.
… otherwise it is bad. A graph G has g(G) good vertices and b(G) bad vertices. The relationship between the order of G and g(G) assigns the graph to one of four classes. Our results include a method of classifying caterpillars. Further, we develop realizability conditions for a graph G given a …
-
Search for long-lived particles with displaced vertices at CMS
… quarks, producing a signature of two displaced vertices. The analysis presented in this thesis is a continuation of previous searches for pairs of displaced vertices. Major developments include a new trigger scheme, allowing greater sensitivity to lower-mass long-lived particles, as well as …
-
Displaced Vertices: A Search for Long-Lived Particles at CMS
… two quarks. The signature is a pair of displaced vertices each formed from many tracks. This search extends a previous CMS search using the 2015 and 2016 dataset, with improvements in background rejection, background estimation techniques, as well as uncertainty estimation. Results are compared …
-
Bayesian Estimation of Graphical Gaussian Models with Edges and Vertices Symmetries
… graphical Gaussian models with edges and vertices symmetries. The graphical Gaussian models with equality constraints on the precision matrix, that is the inverse covariance matrix, introduced by Hojsgaard and Lauritzen as RCON models. The models can be represented by colored graphs, where …
-
Search for Supersymmetry with displaced vertices and muons using the ATLAS detector
… point into two muons were observed in data. No vertices passed the selection criteria which is consistent with the Standard Model background of 10-³ vertices. The strongest exclusion is observed between 20 mm and 40 mm, with an upper limit of around 10 fb on the gluino pair production …
-
Finding Dud Vertices In Defensive Alliances And Secure Sets Using Computational Tools
Defensive alliances are a way of using graphs to model the defense of resources (people, buildings, countries, etc.) against attacks where the number of potential attackers against each resource is known. The initial study of defensive alliances focused on questions of minimal defensive alliances …
-
Properties of Small Ordered Graphs Whose Vertices are Weighted by Their Degree
… However, in this thesis, we assign values to the vertices of the graph rather than the edges and we modify several standard graphical measures to incorporate these vertex weights. In particular, we designate the degree of each vertex as its weight. Previous research has not investigated weighting …
-
Data-driven Search for Long-Lived Particles via Displaced Vertices at CMS
We report on a search for pairs of displaced vertices that is sensitive to long-lived particles (LLPs) in a low-background environment. This search uses 137 fb$^{-1}$ of $\sqrt{s}$ = 13 TeV data collected by the CMS experiment and targets LLPs with mean proper decay lengths between 0.1 and 30 mm. …
-
Constrained Graph Layouts: Vertices on the Outer Face and on the Integer Grid
… layouts - that is, restricting the placement of vertices and the routing of edges to obey certain constraints - is common practice in graph drawing. In this book, we discuss algorithmic results on two different restriction types: placing vertices on the outer face and on the integer grid. For the …
Page 1 of 110