Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Entire DC Network
A Complete Characterization Of Near Outer-Planar Graphs, Tanya Allen Lueder Genannt Luehr
A Complete Characterization Of Near Outer-Planar Graphs, Tanya Allen Lueder Genannt Luehr
Doctoral Dissertations
A graph is outer-planar (OP) if it has a plane embedding in which all of the vertices lie on the boundary of the outer face. A graph is near outer-planar (NOP) if it is edgeless or has an edge whose deletion results in an outer-planar graph. An edge of a non outer-planar graph whose removal results in an outer-planar graph is a vulnerable edge. This dissertation focuses on near outer-planar (NOP) graphs. We describe the class of all such graphs in terms of a finite list of excluded graphs, in a manner similar to the well-known Kuratowski Theorem for planar …
Sports Analytics With Computer Vision, Colby T. Jeffries
Sports Analytics With Computer Vision, Colby T. Jeffries
Senior Independent Study Theses
Computer vision in sports analytics is a relatively new development. With multi-million dollar systems like STATS’s SportVu, professional basketball teams are able to collect extremely fine-detailed data better than ever before. This concept can be scaled down to provide similar statistics collection to college and high school basketball teams. Here we investigate the creation of such a system using open-source technologies and less expensive hardware. In addition, using a similar technology, we examine basketball free throws to see whether a shooter’s form has a specific relationship to a shot’s outcome. A system that learns this relationship could be used to …
Logic -> Proof -> Rest, Maxwell Taylor
Logic -> Proof -> Rest, Maxwell Taylor
Senior Independent Study Theses
REST is a common architecture for networked applications. Applications that adhere to the REST constraints enjoy significant scaling advantages over other architectures. But REST is not a panacea for the task of building correct software. Algebraic models of computation, particularly CSP, prove useful to describe the composition of applications using REST. CSP enables us to describe and verify the behavior of RESTful systems. The descriptions of each component can be used independently to verify that a system behaves as expected. This thesis demonstrates and develops CSP methodology to verify the behavior of RESTful applications.