Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Nested Word)`

.
Showing records 1 – 2 of
2 total matches.

▼ Search Limiters

University of Waterloo

1. Benann Rajendra, Nirmal Joshi. A Study on the Acceleration of Arrival Curve Construction and Regular Specification Mining using GPUs.

Degree: 2018, University of Waterloo

URL: http://hdl.handle.net/10012/14284

Data analytics is a process of examining datasets using various analytical and statistical techniques. Several tools have been proposed in the literature to extract hidden patterns, gather insights and build mathematical models from large datasets. However, these tools have been known to be computationally demanding as the datasets become larger over time. Two such recently proposed tools are the construction of arrival curves from execution traces and mining specifications in the form of regular expressions from execution traces. Though the architectures in CPUs have extensively improved over the years to execute such computationally intensive tasks, further enhancements have been impeded due to increased heat dissipation. This has resulted in enabling parallel computing through GPUs as a vastly favorable alternative to overcome the computational challenges.
In this thesis, we present an exploratory work on applying GPU computing to the construction of arrival curves and mining specifications in the form of regular expressions as case studies. The novel approaches taken for each of the case studies are first presented followed by the algorithmic breakdown to expose the parallelism involved. Lastly, experiments using commodity GPUs are presented to showcase the significant speedups obtained in comparison to the equivalent non-parallel implementations.

Subjects/Keywords: GPU; Acceleration; Arrival Curves; Specification Mining; Nested Word; Timed Regular Expression; Data Analytics; Execution Traces

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Benann Rajendra, N. J. (2018). A Study on the Acceleration of Arrival Curve Construction and Regular Specification Mining using GPUs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14284

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Benann Rajendra, Nirmal Joshi. “A Study on the Acceleration of Arrival Curve Construction and Regular Specification Mining using GPUs.” 2018. Thesis, University of Waterloo. Accessed January 23, 2019. http://hdl.handle.net/10012/14284.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Benann Rajendra, Nirmal Joshi. “A Study on the Acceleration of Arrival Curve Construction and Regular Specification Mining using GPUs.” 2018. Web. 23 Jan 2019.

Vancouver:

Benann Rajendra NJ. A Study on the Acceleration of Arrival Curve Construction and Regular Specification Mining using GPUs. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Jan 23]. Available from: http://hdl.handle.net/10012/14284.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Benann Rajendra NJ. A Study on the Acceleration of Arrival Curve Construction and Regular Specification Mining using GPUs. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/14284

Not specified: Masters Thesis or Doctoral Dissertation

McMaster University

2.
Henry, Christopher S.
The (*Nested*) *Word* Problem: Formal Languages, Group Theory, and Languages of *Nested* Words.

Degree: MSc, 2012, McMaster University

URL: http://hdl.handle.net/11375/12407

This thesis concerns itself with drawing out some interesting connections between the fields of group theory and formal language theory. Given a group with a finite set of generators, it is natural to consider the set of generators and their inverses as an alphabet. We can then consider formal languages such that every group element has at least one representative in the language. We examine what the structure of the language can tell us about group theoretic properties, focusing on the word problem, automatic structures on groups, and generalizations of automatic structures. Finally we prove new results concerning applications of languages of nested words for studying the word problem.

Master of Science (MSc)

Subjects/Keywords: geometric group theory; formal languages; automatic groups; word problem; algorithmic properties of group; nested words; Algebra; Geometry and Topology; Theory and Algorithms; Algebra

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Henry, C. S. (2012). The (Nested) Word Problem: Formal Languages, Group Theory, and Languages of Nested Words. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/12407

Chicago Manual of Style (16^{th} Edition):

Henry, Christopher S. “The (Nested) Word Problem: Formal Languages, Group Theory, and Languages of Nested Words.” 2012. Masters Thesis, McMaster University. Accessed January 23, 2019. http://hdl.handle.net/11375/12407.

MLA Handbook (7^{th} Edition):

Henry, Christopher S. “The (Nested) Word Problem: Formal Languages, Group Theory, and Languages of Nested Words.” 2012. Web. 23 Jan 2019.

Vancouver:

Henry CS. The (Nested) Word Problem: Formal Languages, Group Theory, and Languages of Nested Words. [Internet] [Masters thesis]. McMaster University; 2012. [cited 2019 Jan 23]. Available from: http://hdl.handle.net/11375/12407.

Council of Science Editors:

Henry CS. The (Nested) Word Problem: Formal Languages, Group Theory, and Languages of Nested Words. [Masters Thesis]. McMaster University; 2012. Available from: http://hdl.handle.net/11375/12407