To fix, comment below in the following format:MSc http://purl.org/ontology/bibo/degrees/ms
Record:
=LDR 02061nam 22002893a 4500
=001 000042777385
=005 20140618\\\.0
=006 m\\\\d\\\\
=007 cr\uz\
=008 140618s2014\\onc\\\smab\000\0\eng\
=040 \$aCaOONL$beng$cCaOONL
=099 \2$aTC-OOU-31170
=100 1\$aAlotaibi, Modhawi.
=245 10$aBlack Virus Disinfection in Chordal Rings$h[electronic resource].
=260 \$aOttawa :$bUniversité d'Ottawa / University of Ottawa,$c2014.
=502 \$aThesis (MCS)--Université d'Ottawa / University of Ottawa, 2014
=504 \$aIncludes bibliographical references.
=516 \$aapplication/pdf
=529 \$aThe topic of this thesis is black virus disinfection using mobile agents. The black virus is a faulty node that destroys any visiting agent without leaving a trace; moreover, once the black virus is triggered by an agent, it clones itself and spreads to neighbouring nodes. These viruses can only be destroyed if they move to nodes that have been occupied by agents. In this thesis, we consider the black virus disinfection problem in chordal rings. Initially, the system contains a single black virus that resides at an unknown location. We propose a solution that involves deploying a team of mobile agents to locate the original black virus and to prevent further damage once it has been triggered. Our protocol is divided into two phases: 1) searching the graph until the black virus is found and triggered and 2) sending agents to occupy the neighbouring nodes of the black virus in order to trigger and destroy all the black viruses at once. Our solutions are monotone, meaning that once a node has been explored it
=653 \$ablack virus.
=653 \$achordal rings.
=653 \$aBV.
=653 \$amobile agents.
=655 \7$aElectronic thesis or dissertation.$2local
=856 40$uhttp://hdl.handle.net/10393/31170
=856 40$uhttp://www.collectionscanada.gc.ca/obj/thesescanada/vol2/OOU/TC-OOU-31170.pdf
=856 40$uhttp://www.ruor.uottawa.ca/en/bitstream/10393/31170/1/Alotaibi_Modhawi_2014_thesis.pdf
sfarnel
commented
6 years ago
The URI for MCS could not be found
To fix, comment below in the following format:
MSc http://purl.org/ontology/bibo/degrees/msRecord: =LDR 02061nam 22002893a 4500 =001 000042777385 =005 20140618\\\.0 =006 m\\\\d\\\\ =007 cr\uz\ =008 140618s2014\\onc\\\smab\000\0\eng\ =040 \$aCaOONL$beng$cCaOONL =099 \2$aTC-OOU-31170 =100 1\$aAlotaibi, Modhawi. =245 10$aBlack Virus Disinfection in Chordal Rings$h[electronic resource]. =260 \$aOttawa :$bUniversité d'Ottawa / University of Ottawa,$c2014. =502 \$aThesis (MCS)--Université d'Ottawa / University of Ottawa, 2014 =504 \$aIncludes bibliographical references. =516 \$aapplication/pdf =529 \$aThe topic of this thesis is black virus disinfection using mobile agents. The black virus is a faulty node that destroys any visiting agent without leaving a trace; moreover, once the black virus is triggered by an agent, it clones itself and spreads to neighbouring nodes. These viruses can only be destroyed if they move to nodes that have been occupied by agents. In this thesis, we consider the black virus disinfection problem in chordal rings. Initially, the system contains a single black virus that resides at an unknown location. We propose a solution that involves deploying a team of mobile agents to locate the original black virus and to prevent further damage once it has been triggered. Our protocol is divided into two phases: 1) searching the graph until the black virus is found and triggered and 2) sending agents to occupy the neighbouring nodes of the black virus in order to trigger and destroy all the black viruses at once. Our solutions are monotone, meaning that once a node has been explored it =653 \$ablack virus. =653 \$achordal rings. =653 \$aBV. =653 \$amobile agents. =655 \7$aElectronic thesis or dissertation.$2local =856 40$uhttp://hdl.handle.net/10393/31170 =856 40$uhttp://www.collectionscanada.gc.ca/obj/thesescanada/vol2/OOU/TC-OOU-31170.pdf =856 40$uhttp://www.ruor.uottawa.ca/en/bitstream/10393/31170/1/Alotaibi_Modhawi_2014_thesis.pdf
Record File: d359d2d5dc3f6f97a3b2fc5dc65e372f.mrc