Photocatalytic Inactivation of Escherichia coli with LbL Fabricated Immobilized TiO2 Thin Films

Photocatalysis using semiconductor catalyst such as TiO2, in presence of UV light, is a promising technique for the inactivation of various microorganisms present in water. In the current study, the photocatalytic inactivation of Escherichia coli bacteria was studied with commercial Degussa Aeroxide TiO2 P25 (Aeroxide) and combustion synthesized TiO2 (CS TiO2) catalysts immobilized on glass slides in presence of UV irradiation. Thin films of the catalyst and polyelectrolytes, poly(allyl amine hydrochloride) and poly(styrene sulfonate sodium salt), were deposited on glass slides by layer by layer (LbL) deposition method and characterized by SEM and AFM imaging. The effect of various parameters, namely, catalyst concentration, surface area and number of bilayers, on inactivation was studied. Maximum inactivation of 8-log reduction in the viable count was observed with 1.227 mg/cm(2) of catalyst loaded slides. With this loading, complete inactivation was observed within 90 min and 75 min of irradiation, for Aeroxide and CS TiO2, respectively. Further increase in the catalyst concentration or increasing number of bilayers had no significant effect on inactivation. The effect of surface area on the inactivation was studied by increasing the number of slides and the inactivation was observed to increase with increasing surface area. It was also observed that the immobilized catalyst slides can be used for several cycles leading to an economic process. The study shows potential application of TiO2, for the inactivation of bacteria, in its fixed form by a simple immobilization technique.

Free vibration analysis Of stochastic strings

The free vibration of strings with randomly varying mass and stiffness is considered. The joint probability density functions of the eigenvalues and eigenfunctions are characterized in terms of the solution of a pair of stochastic non-linear initial value problems. Analytical solutions of these equations based on the method of stochastic averaging are obtained. The effects of the mean and autocorrelation of the mass process are included in the analysis. Numerical results for the marginal probability density functions of eigenvalues and eigenfunctions are obtained and are found to compare well with Monte Carlo simulation results. The random eigenvalues, when normalized with respect to their corresponding deterministic values, are observed to tend to become first order stochastically stationary with respect to the mode count.

Structural characterization of gel-grown neodymium copper oxalate single crystals

Sparingly soluble neodymium copper oxalate (NCO) single crystals were grown by gel method, by the diffusion of a mixture of neodymium nitrate and cupric nitrate into the set gel containing oxalic acid. Tabular crystal, revealing well-defined dissolution figures has been recorded. X-ray diffraction studies of the powdered sample reveal that NCO is crystalline. Infrared absorption spectrum confirmed the formation of oxalato complex with water of crystallization, while energy dispersive X-ray analysis established the presence of neodymium dominant over copper in the sample. X-ray photoelectron spectroscopic studies established the presence of Nd and Cu in oxide states besides (C2O4)(2-) oxalate group. The intensities of Nd (3d(5/2)) and Cu (2p(3/2)) peaks measured in terms of maximum photoelectron count rates also revealed the presence of Nd in predominance. The inductively coupled plasma analysis supports the EDAX and XPS data by the estimation of neodymium percentage by weight to that of copper present in the NCO sample. On the basis of these findings, an empirical structure for NCO has been proposed. The implications are discussed.

Effect of chronic administration of Tamoxifen on fertility in male bonnet monkeys (Macaca radiata)

Administration of Tamoxifen via the Alzet pump at a rate of 50 mu g hr(-1) for 90 days in the adult male bonnet monkeys Macaca radiata had no effect on the serum testosterone concentration determined at 10 AM and 10 PM as well as total sperm count determined at 15-day intervals over a period of 260 days. However, a significant reduction in sperm motility was observed beyond 90 days up until the 225th day. Breeding studies conducted from day 90 to 260 revealed that these males were infertile.

A polynomial bound on the number of light cycles in an undirected graph

Let G be an undirected graph with a positive real weight on each edge. It is shown that the number of minimum-weight cycles of G is bounded above by a polynomial in the number of edges of G. A similar bound holds if we wish to count the number of cycles with weight at most a constant multiple of the minimum weight of a cycle of G.

Tree structure for efficient data mining using rough sets

In data mining, an important goal is to generate an abstraction of the data. Such an abstraction helps in reducing the space and search time requirements of the overall decision making process. Further, it is important that the abstraction is generated from the data with a small number of disk scans. We propose a novel data structure, pattern count tree (PC-tree), that can be built by scanning the database only once. PC-tree is a minimal size complete representation of the data and it can be used to represent dynamic databases with the help of knowledge that is either static or changing. We show that further compactness can be achieved by constructing the PC-tree on segmented patterns. We exploit the flexibility offered by rough sets to realize a rough PC-tree and use it for efficient and effective rough classification. To be consistent with the sizes of the branches of the PC-tree, we use upper and lower approximations of feature sets in a manner different from the conventional rough set theory. We conducted experiments using the proposed classification scheme on a large-scale hand-written digit data set. We use the experimental results to establish the efficacy of the proposed approach. (C) 2002 Elsevier Science B.V. All rights reserved.

Reliable Routing in Sensor Networks

In sensor networks, routing algorithms should be designed such that packet losses due to wireless links are reduced.In this paper, we present a ”potential”-based routing scheme to find routes with high packet delivery ratios. The basic idea is to define a scalar potential value at each node in the network and forward data to the neighbour with the highest potential.For a simple 2-relay network, we propose a potential function that takes into account wireless channel state. Markov-chain based analysis provides analytical expressions for packet delivery ratio. Considerable improvement can be observed compared to a channel-state-oblivious policy. This motivates us to define a channel-state-dependent potential function in a general network context. Simulations show that for a relatively slowly changing wireless network, our approach can provide up to 20% better performance than the commonly- used shortest-hop-count-based routing.

Inter and intra crystalline ion exchange equilibria in the system Fe Cr Al O

The tie lines delineating ion-exchange equilibria between FeCr2O4FeAl2O4 spinel solid solution and Cr2O3Al2O3 solid solution with corundum structure have been determined at 1373 K by electron microprobe and EDAX point count analysis of oxide phases equilibrated with metallic iron. Activities in the spinel solid solution are derived from the tie lines and the thermodynamic data on Cr2O3Al2O3 solid solution available in the literature. The oxygen potentials corresponding to the tie-line composition of oxide phases in equilibrium with metallic iron were measured using solid oxide galvanic cells with CaOZrO2 and Y2O3ThO2 electrolytes. These electrochemical measurements also yield activities in the spinel solid solution, in good agreement with those obtained from tie lines. The activity-composition relationship in the spinel solid solution is analysed in terms of the intra-crystalline ion exchange between the tetrahedral and octahedral sites of the spinel structures. The ion exchange is governed by site-preference energies of the cations and the entropy of cations mixing on each site.

Phase relations and activities in the Co Ni O system at 1373 K

The tie-lines delineating equilibria between CoO-NiO and Co-Ni solid solutions in the ternary Co-Ni-O system at 1373 K have been determined by electron microprobe andedax point count analysis of the oxide phase equilibrated with the alloy. The oxygen potentials corresponding to the tie-line compositions have been measured using a solid oxide galvanic cell with calcia-stabilized zirconia electrolyte and Ni + NiO reference electrode. Activities in the metallic and oxide solid solution have been derived using a new Gibbs-Duhem integration technique. Both phases exhibit small positive deviations from ideality; the values ofG E/X 1 X 2 are 2640 J mol−1 for the metallic phase and 2870 J mol−1 for the oxide solid solution.

Phase equilibria in the Co Ni F system and activities in (CoxNi1 x)F2 solid solutions at 1373 K

The tie-lines delineating equilibria between CoF2-NiF2 and Co-Ni solid solutions in the ternary Co-Ni-F system at 1373 K have been determined by electron microprobe and EDAX point count analysis of the equilibrated phases. Activities in the fluoride solid solution have been derived from the knowledge of activitycomposition relation in the metallic solid solution and tie-line data,using a modified form of the Gibbs-Duhem integration. The fluorine potentials corresponding to the tie-line compositions have been calculated.The excess Gibbs' energy of mixing for the fluoride solid solution derived from the present data can be represented by the expression

A unified view of the Apriori-based algorithms for frequent episode discovery

Frequent episode discovery framework is a popular framework in temporal data mining with many applications. Over the years, many different notions of frequencies of episodes have been proposed along with different algorithms for episode discovery. In this paper, we present a unified view of all the apriori-based discoverymethods for serial episodes under these different notions of frequencies. Specifically, we present a unified view of the various frequency counting algorithms. We propose a generic counting algorithm such that all current algorithms are special cases of it. This unified view allows one to gain insights into different frequencies, and we present quantitative relationships among different frequencies.Our unified view also helps in obtaining correctness proofs for various counting algorithms as we show here. It also aids in understanding and obtaining the anti-monotonicity properties satisfied by the various frequencies, the properties exploited by the candidate generation step of any apriori-based method. We also point out how our unified view of counting helps to consider generalization of the algorithm to count episodes with general partial orders.

System and Method for Temporal Datamining

A system for temporal data mining includes a computer readable medium having an application configured to receive at an input module a temporal data series and a threshold frequency. The system is further configured to identify, using a candidate identification and tracking module, one or more occurrences in the temporal data series of a candidate episode and increment a count for each identified occurrence. The system is also configured to produce at an output module an output for those episodes whose count of occurrences results in a frequency exceeding the threshold frequency.

System and Method for mining of Temporal Data

A system for temporal data mining includes a computer readable medium having an application configured to receive at an input module a temporal data series having events with start times and end times, a set of allowed dwelling times and a threshold frequency. The system is further configured to identify, using a candidate identification and tracking module, one or more occurrences in the temporal data series of a candidate episode and increment a count for each identified occurrence. The system is also configured to produce at an output module an output for those episodes whose count of occurrences results in a frequency exceeding the threshold frequency.

Fast algorithms for frequent episode discovery in event sequences

In this paper we consider the process of discovering frequent episodes in event sequences. The most computationally intensive part of this process is that of counting the frequencies of a set of candidate episodes. We present two new frequency counting algorithms for speeding up this part. These, referred to as non-overlapping and non-inteleaved frequency counts, are based on directly counting suitable subsets of the occurrences of an episode. Hence they are different from the frequency counts of Mannila et al [1], where they count the number of windows in which the episode occurs. Our new frequency counts offer a speed-up factor of 7 or more on real and synthetic datasets. We also show how the new frequency counts can be used when the events in episodes have time-durations as well.

A unified view of the apriori-based algorithms for frequent episode discovery

Frequent episode discovery framework is a popular framework in temporal data mining with many applications. Over the years, many different notions of frequencies of episodes have been proposed along with different algorithms for episode discovery. In this paper, we present a unified view of all the apriori-based discovery methods for serial episodes under these different notions of frequencies. Specifically, we present a unified view of the various frequency counting algorithms. We propose a generic counting algorithm such that all current algorithms are special cases of it. This unified view allows one to gain insights into different frequencies, and we present quantitative relationships among different frequencies. Our unified view also helps in obtaining correctness proofs for various counting algorithms as we show here. It also aids in understanding and obtaining the anti-monotonicity properties satisfied by the various frequencies, the properties exploited by the candidate generation step of any apriori-based method. We also point out how our unified view of counting helps to consider generalization of the algorithm to count episodes with general partial orders.