Show simple item record

dc.contributor.authorArendt, Dustin Lockharten_US
dc.date.accessioned2014-03-14T20:08:19Z
dc.date.available2014-03-14T20:08:19Z
dc.date.issued2012-03-15en_US
dc.identifier.otheretd-03202012-143226en_US
dc.identifier.urihttp://hdl.handle.net/10919/26465
dc.description.abstractMany who study complex systems believe that the complexity we observe in the world around us is frequently the product of a large number of interactions between components following a simple rule. However, the task of discerning the rule governing the evolution of any given system is often quite difficult, requiring intuition, guesswork, and a great deal of expertise in that domain. To circumvent this issue, researchers have considered the inverse problem where one searches among many candidate rules to reveal those producing interesting behavior. This approach has its own challenges because the search space grows exponentially and interesting behavior is rare and difficult to rigorously define. Therefore, the contribution of this work includes tools and techniques for searching for dimer automaton rules that exhibit self-organization (the transformation of disorder into structure in the absence of centralized control). Dimer automata are simple, discrete, asynchronous rewriting systems that operate over the edges of an arbitrary graph. Specifically, these contributions include a number of novel, surprising, and useful applications of dimer automata, practical methods for measuring self-organization, advanced techniques for searching for dimer automaton rules, and two efficient GPU parallelizations of dimer automata to make searching and simulation more tractable.en_US
dc.publisherVirginia Techen_US
dc.relation.haspartArendt_DL_D_2012.pdfen_US
dc.rightsI hereby certify that, if appropriate, I have obtained and attached hereto a written permission statement from the owner(s) of each third party copyrighted matter to be included in my thesis, dissertation, or project report, allowing distribution as specified below. I certify that the version I submitted is the same as that approved by my advisory committee. I hereby grant to Virginia Tech or its agents the non-exclusive license to archive and make accessible, under the conditions specified below, my thesis, dissertation, or project report in whole or in part in all forms of media, now or hereafter known. I retain all other ownership rights to the copyright of the thesis, dissertation or project report. I also retain the right to use in future works (such as articles or books) all or part of this thesis, dissertation, or project report.en_US
dc.subjectDimer Automataen_US
dc.subjectSelf-Organizationen_US
dc.subjectGPGPUen_US
dc.subjectComplex Systemsen_US
dc.titleIn Search of Self-Organizationen_US
dc.typeDissertationen_US
dc.contributor.departmentComputer Science and Applicationsen_US
dc.description.degreePh. D.en_US
thesis.degree.namePh. D.en_US
thesis.degree.leveldoctoralen_US
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen_US
thesis.degree.disciplineComputer Science and Applicationsen_US
dc.contributor.committeechairCao, Yangen_US
dc.contributor.committeememberArthur, James D.en_US
dc.contributor.committeememberRamakrishnan, Narenen_US
dc.contributor.committeememberPaul, Mark R.en_US
dc.contributor.committeememberRibbens, Calvin J.en_US
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-03202012-143226/en_US
dc.date.sdate2012-03-20en_US
dc.date.rdate2012-05-02
dc.date.adate2012-05-02en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record