Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for +publisher:"University of Victoria" +contributor:("Myrvold, Wendy"). Showing records 1 – 3 of 3 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters

1. Campbell, Russell J. Finding obstructions within irreducible triangulations.

Degree: Department of Computer Science, 2017, University of Victoria

The main results of this dissertation show evidence supporting the Successive Surface Scaffolding Conjecture. This is a new conjecture that, if true, guarantees the existence of all the wye-delta-order minimal obstructions of a surface S as subgraphs of the irreducible triangulations of the surface S with a crosscap added. A new data structure, i.e. an augmented rotation system, is presented and used to create an exponential-time algorithm for embedding graphs in any surface with a constant-time check of the change in genus when inserting an edge. A depiction is a new formal definition for representing an embedding graphically, and it is shown that more than one depiction can be given for nonplanar embeddings, and that sometimes two depictions for the same embedding can be drastically different from each other. An algorithm for finding the essential cycles of an embedding is given, and is used to confirm for the projective-plane obstructions, a theorem that shows any embedding of an obstruction must have every edge in an essential cycle. Obstructions of a general surface S that are minor-minimal and not double-wye-delta-minimal are shown to each have an embedding on the surface S with a crosscap added. Finally, open questions for further research are presented. Advisors/Committee Members: Myrvold, Wendy (supervisor).

Subjects/Keywords: graph theory; topological graph theory; obstruction; embedding algorithm; irreducible triangulation; torus; projective plane; Klein bottle

…my ability and I want to acknowledge them for this. I also want to thank the University of… …Victoria administration in both the general offices and the offices of the Department of Computer… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Campbell, R. J. (2017). Finding obstructions within irreducible triangulations. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/8212

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Campbell, Russell J. “Finding obstructions within irreducible triangulations.” 2017. Thesis, University of Victoria. Accessed July 10, 2020. http://hdl.handle.net/1828/8212.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Campbell, Russell J. “Finding obstructions within irreducible triangulations.” 2017. Web. 10 Jul 2020.

Vancouver:

Campbell RJ. Finding obstructions within irreducible triangulations. [Internet] [Thesis]. University of Victoria; 2017. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/1828/8212.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Campbell RJ. Finding obstructions within irreducible triangulations. [Thesis]. University of Victoria; 2017. Available from: http://hdl.handle.net/1828/8212

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

2. Guan, Aimin. Forest aboveground biomass and carbon mapping with computational cloud.

Degree: Department of Computer Science, 2017, University of Victoria

In the last decade, advances in sensor and computing technology are revolutionary. The latest-generation of hyperspectral and synthetic aperture radar ((SAR) instruments have increased their spectral, spatial, and temporal resolution. Consequently, the data sets collected are increasing rapidly in size and frequency of acquisition. Remote sensing applications are requiring more computing resources for data analysis. High performance computing (HPC) infrastructure such as clusters, distributed networks, grids, clouds and specialized hardware components, have been used to disseminate large volumes of remote sensing data and to accelerate the computational speed in processing raw images and extracting information from remote sensing data. In previous research we have shown that we can improve computational efficiency of a hyperspectral image denoising algorithm by parallelizing the algorithm utilizing a distributed computing grid. In recent years, computational cloud technology is emerging, bringing more flexibility and simplicity for data processing. Hadoop MapReduce is a software framework for distributed commodity computing clusters, allowing parallel processing of massive datasets. In this project, we implement a software application to map forest aboveground biomass (AGB) with normalized difference vegetation indices (NDVI) using Landsat Thematic Mapper’s bands 4 and 5 (ND45). We present observations and experimental results on the performance and the algorithmic complexity of the implementation. There are three research questions answered in this thesis, as follows. 1) How do we implement remote sensing algorithms, such as forest AGB mapping, in a computer cloud environment? 2) What are the requirements to implement distributed processing of remote sensing images using the cloud programming model? 3) What is the performance increase for large area remote sensing image processing in a cloud environment? Advisors/Committee Members: Myrvold, Wendy (supervisor), Goodenough, David G. (supervisor).

Subjects/Keywords: Remote Sensing; Computational Cloud; Forest Above Ground Biomass; Carbon Mapping; Hadoop MapReduce; Parallel Computing; Computational Grid

…Hao Chen, and Dr. Belaid Moa at the Department of Computer Science, University of Victoria… …while finishing my research. I am also thankful to the faculty and staff at the University of… …Victoria (UVic) and at the Pacific Forestry Centre (PFC), where I conducted… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Guan, A. (2017). Forest aboveground biomass and carbon mapping with computational cloud. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/7992

Chicago Manual of Style (16th Edition):

Guan, Aimin. “Forest aboveground biomass and carbon mapping with computational cloud.” 2017. Masters Thesis, University of Victoria. Accessed July 10, 2020. http://hdl.handle.net/1828/7992.

MLA Handbook (7th Edition):

Guan, Aimin. “Forest aboveground biomass and carbon mapping with computational cloud.” 2017. Web. 10 Jul 2020.

Vancouver:

Guan A. Forest aboveground biomass and carbon mapping with computational cloud. [Internet] [Masters thesis]. University of Victoria; 2017. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/1828/7992.

Council of Science Editors:

Guan A. Forest aboveground biomass and carbon mapping with computational cloud. [Masters Thesis]. University of Victoria; 2017. Available from: http://hdl.handle.net/1828/7992


University of Victoria

3. Woodcock, Jennifer Roselynn. A faster algorithm for torus embedding.

Degree: Dept. of Computer Science, 2007, University of Victoria

Although theoretically practical algorithms for torus embedding exist, they have not yet been successfully implemented and their complexity may be prohibitive to their practicality. We describe a simple exponential algorithm for embedding graphs on the torus (a surface shaped like a doughnut) and discuss how it was inspired by the quadratic time planar embedding algorithm of Demoucron, Malgrange and Pertuiset. We show that it is faster in practice than the only fully implemented alternative (also exponential) and explain how both the algorithm itself and the knowledge gained during its development might be used to solve the well-studied problem of finding the complete set of torus obstructions. Advisors/Committee Members: Myrvold, Wendy (supervisor), Ruskey, Frank (supervisor).

Subjects/Keywords: torus; obstruction; graph theory; embedding; graph; graph minor; UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Woodcock, J. R. (2007). A faster algorithm for torus embedding. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/130

Chicago Manual of Style (16th Edition):

Woodcock, Jennifer Roselynn. “A faster algorithm for torus embedding.” 2007. Masters Thesis, University of Victoria. Accessed July 10, 2020. http://hdl.handle.net/1828/130.

MLA Handbook (7th Edition):

Woodcock, Jennifer Roselynn. “A faster algorithm for torus embedding.” 2007. Web. 10 Jul 2020.

Vancouver:

Woodcock JR. A faster algorithm for torus embedding. [Internet] [Masters thesis]. University of Victoria; 2007. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/1828/130.

Council of Science Editors:

Woodcock JR. A faster algorithm for torus embedding. [Masters Thesis]. University of Victoria; 2007. Available from: http://hdl.handle.net/1828/130

.