<?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-09-19T11:47:22Z</responseDate><request verb="GetRecord" identifier="oai:wakespace.lib.wfu.edu:10339/57155" metadataPrefix="dim">https://wakespace.lib.wfu.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:null:10339/57155</identifier><datestamp>2026-09-02T14:49:45Z</datestamp><setSpec>com_10339_14934</setSpec><setSpec>col_10339_38132</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" 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_US">Hodnett, Fletcher</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2015-06-23T08:35:54Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2015-06-23T08:35:54Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2015</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://wakespace.lib.wfu.edu/handle/10339/57155</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">On large networks where resources for security are at a minimum, a dynamic and lightweight approach to diagnosing threats is needed. A mobile software agent system modeled on ants provides one possible solution to this problem. Using this approach,  software agents  visit nodes (computing devices) in the network and look for evidence of a security threat.  Agents operate autonomously, determining the next node to visit in the network based on local information. Optimally, agents in this system will provide full network (graph) coverage in the most efficient way possible. One way to do this is by using the concept of heading to improve cover time (amount of time required to visit every node in a graph at least once).</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en_US">Wake Forest University</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US" />
   <dim:field mdschema="dc" element="title" lang="en_US">Using Heading to Improve Autonomous Agent Movement on Networks</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="thesis" element="contributor" qualifier="committeeChair" lang="en_US">Fulp, Errin</dim:field>
   <dim:field mdschema="thesis" element="contributor" qualifier="committeeMember" lang="en_US">Canas, Daniel</dim:field>
   <dim:field mdschema="thesis" element="contributor" qualifier="committeeMember" lang="en_US">Turkett, William</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline" lang="en_US">Computer Science</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>