In situ bioremediation of pentachlorophenol-contaminated ground water in a sequential anaerobic-aerobic down borehole permeable barrier reactor requires a non-toxic primary substrate for dichlorophenol cometabolism. Serum bottle tests comparing the effectiveness of eight primary substrates for aerobic dichlorophenol degradation showed phenol to be the most effective followed by imitation vanilla flavoring, guaiacol, sodium benzoate, molasses, acetic acid, propylene glycol and ethyl vanillin in propylene glycol. As phenol is a pollutant, imitation vanilla flavoring is the recommended primary substrate for field use. In a second bottle test, 3,4,5-trichlorophenol was not sufficiently biotransformed, emphasizing the need for biotransformation to occur in the anaerobic zone of the reactor. / Graduation date: 1996

Network decontamination is a well known mobile agent problem with many applications. We assume that all nodes of a network are contaminated (e.g., by a virus) and a set of agents is deployed to decontaminate them. An agent passing by a node decontaminates it, however a decontaminated node can be recontaminated if any of its neighbours is contaminated. In the vast literature a variety of models are considered and different assumptions are made on the power of the agents. In this thesis we study variation of the decontamination problem in mesh and tori topologies, under the assumption that when a node is decontaminated, it is immune to recontamination for a predefined amount of time t (called immunity time). After the immunity time is elapsed, recontamination can occur. We focus on three different models: mobile agents (MA), cellular automata (CA), and mobile cellular automata (MCA). The first two models are commonly studied and employed in several other contexts, the third model is introduced in this thesis for the first time. In each model we study the temporal decontamination problem (adapted to the particular setting) under a variety of assumptions on the capabilities of the decontaminating elements (agents for MA and MCA, decontaminating cells for CA). Some of the parameters we consider in this study are: visibility of the active elements, their ability to make copies of themselves, their ability to communicate, and the possibility to remember their past actions (memory). We describe several solutions in the various scenarios and we analyze their complexity. Efficiency is evaluated slightly differently in each model, but essentially the effort is in the minimization of the number of simultaneous decontaminating elements active in the system while performing the decontamination with a given immunity time.

Network decontamination is a well known mobile agent problem with many applications. We assume that all nodes of a network are contaminated (e.g., by a virus) and a set of agents is deployed to decontaminate them. An agent passing by a node decontaminates it, however a decontaminated node can be recontaminated if any of its neighbours is contaminated. In the vast literature a variety of models are considered and different assumptions are made on the power of the agents. In this thesis we study variation of the decontamination problem in mesh and tori topologies, under the assumption that when a node is decontaminated, it is immune to recontamination for a predefined amount of time t (called immunity time). After the immunity time is elapsed, recontamination can occur. We focus on three different models: mobile agents (MA), cellular automata (CA), and mobile cellular automata (MCA). The first two models are commonly studied and employed in several other contexts, the third model is introduced in this thesis for the first time. In each model we study the temporal decontamination problem (adapted to the particular setting) under a variety of assumptions on the capabilities of the decontaminating elements (agents for MA and MCA, decontaminating cells for CA). Some of the parameters we consider in this study are: visibility of the active elements, their ability to make copies of themselves, their ability to communicate, and the possibility to remember their past actions (memory). We describe several solutions in the various scenarios and we analyze their complexity. Efficiency is evaluated slightly differently in each model, but essentially the effort is in the minimization of the number of simultaneous decontaminating elements active in the system while performing the decontamination with a given immunity time.

Thesis (M.S. in Applied Physics)--Naval Postgraduate School, June 2004. / Thesis advisor(s): Xavier Maruyama. Includes bibliographical references (p. 71-77, 79-81). Also available online.

Network decontamination is a well known mobile agent problem with many applications. We assume that all nodes of a network are contaminated (e.g., by a virus) and a set of agents is deployed to decontaminate them. An agent passing by a node decontaminates it, however a decontaminated node can be recontaminated if any of its neighbours is contaminated. In the vast literature a variety of models are considered and different assumptions are made on the power of the agents. In this thesis we study variation of the decontamination problem in mesh and tori topologies, under the assumption that when a node is decontaminated, it is immune to recontamination for a predefined amount of time t (called immunity time). After the immunity time is elapsed, recontamination can occur. We focus on three different models: mobile agents (MA), cellular automata (CA), and mobile cellular automata (MCA). The first two models are commonly studied and employed in several other contexts, the third model is introduced in this thesis for the first time. In each model we study the temporal decontamination problem (adapted to the particular setting) under a variety of assumptions on the capabilities of the decontaminating elements (agents for MA and MCA, decontaminating cells for CA). Some of the parameters we consider in this study are: visibility of the active elements, their ability to make copies of themselves, their ability to communicate, and the possibility to remember their past actions (memory). We describe several solutions in the various scenarios and we analyze their complexity. Efficiency is evaluated slightly differently in each model, but essentially the effort is in the minimization of the number of simultaneous decontaminating elements active in the system while performing the decontamination with a given immunity time.

No description available.

Thesis (M.Eng.). / Written for the Dept. of Mining, Metals and Materials Engineering. Title from title page of PDF (viewed 2008/01/14). Includes bibliographical references.

Thesis (Ph. D.)--Auburn University, 2008. / Abstract. Vita. Includes bibliographical references (p. 160-171).

Thesis (Ph. D.)--University of Missouri-Columbia, 1997. / Typescript. Vita. Includes bibliographical references (leaves 123-127). Also available on the Internet.

Thesis (Ph. D.)--University of Missouri-Columbia, 1997. / Typescript. Vita. Includes bibliographical references (leaves 123-127). Also available on the Internet.