<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T10:22:05Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/908" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/908</identifier><datestamp>2017-03-21T19:34:56Z</datestamp><setSpec>com_10012_9900</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9914</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en" authority="061cfb6e-a5bb-4cbb-9146-5fd6956dccf3" confidence="600">Singh, Raymon</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2006-08-22T13:56:47Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2006-08-22T13:56:47Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en">2005</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted" lang="en">2005</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/908</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">During the past decade, a new class of knowledge representation has emerged known as structured distributed representation (SDR).    A number of schemes for encoding and manipulating such representations have been developed; e.  g.   Pollack&amp;apos;s Recursive Auto-Associative Memory (RAAM), Kanerva&amp;apos;s Binary Spatter Code (BSC), Gayler&amp;apos;s MAP encoding, and Plate&amp;apos;s Holographically Reduced Representations (HRR).    All such schemes encode structural information throughout the elements of high dimensional vectors, and are manipulated with rudimentary algebraic operations.      &amp;lt;br /&amp;gt;&amp;lt;br /&amp;gt;  Most SDRs are very compact; components and compositions of components are all represented as fixed-width vectors.    However, such compact compositions are unavoidably noisy.    As a result, resolving constituent components requires a cleanup memory.    In its simplest form, cleanup is performed with a list of vectors that are sequentially compared using a similarity metric.    The closest match is deemed the cleaned codevector.      &amp;lt;br /&amp;gt;&amp;lt;br /&amp;gt;  While SDR schemes were originally designed to perform cognitive tasks, none of them have been demonstrated in a neurobiologically plausible substrate.   Potentially, mathematically proven properties of these systems may not be neurally realistic.    Using Eliasmith and Anderson&amp;apos;s (2003) Neural Engineering Framework, I  construct various spiking neural networks to simulate a general cleanup memory that is suitable for many schemes.      &amp;lt;br /&amp;gt;&amp;lt;br /&amp;gt;  Importantly, previous work has not taken advantage of parallelization or the high-dimensional properties of neural networks.    Nor have they considered the effect of noise within these systems.    As well, additional improvements to the cleanup operation may be possible by more efficiently structuring the memory itself.   In this thesis I address these lacuna, provide an analysis of systems accuracy, capacity, scalability, and robustness to noise, and explore ways to improve the search efficiency.</dim:field>
   <dim:field mdschema="dc" element="format" lang="en">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">1253300 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en">Copyright: 2005, 
  Singh, Raymon. All rights reserved.</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Systems Design</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">biological neural networks</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">distributed representation</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">cleanup</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">associative memory</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Cleanup Memory in Biologically Plausible Neural Networks</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Systems Design Engineering</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Applied Science</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>