Basic oxygen furnace slag as a treatment material for pathogens: Contribution of inactivation and attachment in virus attenuation

Basic oxygen furnace (BOF) slag media were studied as a potential treatment material in on-site sanitation systems. Batch and column studies were conducted to evaluate attenuation of the bacteriophage PR772 and 0.190 mu m diameter microspheres by BOF media, and to delineate the relative contributions of two principle processes of virus attenuation: inactivation and attachment. In the batch studies, conducted at 4 degrees C, substantial inactivation of PR772 did not occur in the pH 7.6 and 9.5 suspensions. At pH 11.4, bimodal inactivation of PR772 was observed, at an initial rate of 2.1 log C/C(0) day(-1) for the first two days, followed by a much slower rate of 0.124 log C/C(0) day(-1) over the following 10 days. Two column studies were conducted at 4 degrees C at a flow rate of 1 pore volume day(-1) using two slag sources (Stelco, Ontario; Tubarao, Brazil) combined with sand and pea gravel. In both column experiments, the effluent microsphere concentration approached input concentrations over time (reductions of 0.1-0.2 log C/C(0)), suggesting attachment processes for microspheres were negligible. Removal of PR772 virus was more pronounced both during the early stages of the experiments, but also after longer transport times (0.5-1.0 log C/C(0)). PR772 reduction appeared to be primarily as a result of virus inactivation in response to the elevated pH conditions generated by the BOF mixture (10.6-11.4). On-site sanitation systems using BOF media should be designed to maintain sufficient contact time between the BOF media and the wastewater to allow sufficient residence time of pathogens at elevated pH conditions. (C) 2009 Published by Elsevier Ltd.

A DISCRETIZATION SCHEME FOR AN ONE-DIMENSIONAL REACTION-DIFFUSION EQUATION WITH DELAY AND ITS DYNAMICS

The goal of this paper is to present an approximation scheme for a reaction-diffusion equation with finite delay, which has been used as a model to study the evolution of a population with density distribution u, in such a way that the resulting finite dimensional ordinary differential system contains the same asymptotic dynamics as the reaction-diffusion equation.

Covalent attachment of 3,4,9,10-perylenediimides onto the walls of mesoporous molecular sieves MCM-41 and SBA-15

This work describes the covalent grafting of 3,4,9,10-perylenediimides (PDI), which are fluorescent dyes with very interesting optical properties, onto the walls of mesoporous molecular sieves MCM-41 and SBA-15. The mesoporous materials were first treated with 3-aminopropyltriethoxysilane (APTES) in anhydrous toluene, generating amine-containing surfaces. The amine-containing materials were then reacted with 3,4,9,10-perylenetetracarboxylic dianhydride (PTCA), generating surface-grafted PDI. Infrared spectra of the materials showed that the reaction with amino groups took place at both anhydride ends of the PTCA molecule, resulting in surface attached diimides. No sign of unreacted anhydride groups were found. The new materials, designated as MCMN2PDI and SBAN(2)PDI, presented absorption and emission spectra corresponding to weakly coupled PDI chromophores, in contrast to the strongly coupled rings usually found in solid PDI samples. The materials showed a red fluorescence, which could be observed by the naked eye under UV irradiation or with a fluorescence microscope. The PDI-modified mesoporous materials showed electrical conductivity when pressed into a pellet. The results presented here show that the new materials are potentially useful in the design of nanowires. (C) 2007 Elsevier Inc. All rights reserved.

Use Multilevel Graph Partitioning Scheme to solve traveling salesman problem

The traveling salesman problem is although looking very simple problem but it is an important combinatorial problem. In this thesis I have tried to find the shortest distance tour in which each city is visited exactly one time and return to the starting city. I have tried to solve traveling salesman problem using multilevel graph partitioning approach.Although traveling salesman problem itself very difficult as this problem is belong to the NP-Complete problems but I have tried my best to solve this problem using multilevel graph partitioning it also belong to the NP-Complete problems. I have solved this thesis by using the k-mean partitioning algorithm which divides the problem into multiple partitions and solving each partition separately and its solution is used to improve the overall tour by applying Lin Kernighan algorithm on it. Through all this I got optimal solution which proofs that solving traveling salesman problem through graph partition scheme is good for this NP-Problem and through this we can solved this intractable problem within few minutes.Keywords: Graph Partitioning Scheme, Traveling Salesman Problem.

Towards a Protocol for the Attachment of Semantic Descriptions to Grid Services

Service discovery in large scale, open distributed systems is difficult because of the need to filter out services suitable to the task at hand from a potentially huge pool of possibilities. Semantic descriptions have been advocated as the key to expressive service discovery, but the most commonly used service descriptions and registry protocols do not support such descriptions in a general manner. In this paper, we present a protocol, its implementation and an API for registering semantic service descriptions and other task/user-specific metadata, and for discovering services according to these. Our approach is based on a mechanism for attaching structured and unstructured metadata, which we show to be applicable to multiple registry technologies. The result is an extremely flexible service registry that can be the basis of a sophisticated semantically-enhanced service discovery engine, an essential component of a Semantic Grid.

Towards a Protocol for the Attachment of Metadata to Service Descriptions and its Use in Semantic Discovery

Service discovery in large scale, open distributed systems is difficult because of the need to filter out services suitable to the task at hand from a potentially huge pool of possibilities. Semantic descriptions have been advocated as the key to expressive service discovery, but the most commonly used service descriptions and registry protocols do not support such descriptions in a general manner. In this paper, we present a protocol, its implementation and an API for registering semantic service descriptions and other task/user-specific metadata, and for discovering services according to these. Our approach is based on a mechanism for attaching structured and unstructured metadata, which we show to be applicable to multiple registry technologies. The result is an extremely flexible service registry that can be the basis of a sophisticated semantically-enhanced service discovery engine, an essential component of a Semantic Grid.