Characterization and applications of two protease enzymes obtained by culture dependent and independent approaches from mangrove sediments

Soil community genomics or metagenomics is employed in this study to analyze the evolutionary related - ness of mangrove microbial community. The metagenomic DNA was isolated from mangrove sediment and 16SrDNA was amplified using universal primers. The amplicons were ligated into pTZ57R/T cloning vector and transformed onto E. coli JM109 host cells. The recombinant plasmids were isolated from positive clones and the insert was confirmed by its reamplification. The amplicons were subjected to Amplified Ribosomal DNA Restriction Analysis (ARDRA) using three different tetra cutter restriction enzymes namely Sau3A1, Hha1 and HpaII. The 16SrDNA insert were sequenced and their identity was determined. The sequences were submitted to NCBI database and accession numbers obtained. The phylo - genetic tree was constructed based on Neighbor-Joining technique. Clones belonged to two major phyla of the bacterial domain, namely Firmicutes and Proteobacteria, with members of Firmicutes predominating. The microbial diversity of the mangrove sediment was explored in this manner.

On Implementing Joins, Aggregates and Universal Quantifier in Temporal Databases using SQL Standards

A feasible way of implementing a temporal database is by mapping temporal data model onto a conventional data model followed by a commercial database management system. Even though extensions were proposed to standard SQL for supporting temporal databases, such proposals have not yet come across standardization processes. This paper attempts to implement database operators such as aggregates and universal quantifier for temporal databases, implemented on top of relational database systems, using currently available SQL standards.

Universal behaviour in a ``modulated'' logistic map

We study the period-doubling bifurcations to chaos in a logistic map with a nonlinearly modulated parameter and show that the bifurcation structure is modified significantly. Using the renormalisation method due to Derrida et al. we establish the universal behaviour of the system at the onset of chaos.

Studies on the universal parameters and onset of chaos in dissipative systems

It has become clear over the last few years that many deterministic dynamical systems described by simple but nonlinear equations with only a few variables can behave in an irregular or random fashion. This phenomenon, commonly called deterministic chaos, is essentially due to the fact that we cannot deal with infinitely precise numbers. In these systems trajectories emerging from nearby initial conditions diverge exponentially as time evolves)and therefore)any small error in the initial measurement spreads with time considerably, leading to unpredictable and chaotic behaviour The thesis work is mainly centered on the asymptotic behaviour of nonlinear and nonintegrable dissipative dynamical systems. It is found that completely deterministic nonlinear differential equations describing such systems can exhibit random or chaotic behaviour. Theoretical studies on this chaotic behaviour can enhance our understanding of various phenomena such as turbulence, nonlinear electronic circuits, erratic behaviour of heart and brain, fundamental molecular reactions involving DNA, meteorological phenomena, fluctuations in the cost of materials and so on. Chaos is studied mainly under two different approaches - the nature of the onset of chaos and the statistical description of the chaotic state.

Automated synthesis of delay-reduced Reed-Muller universal logic module networks

This paper presents a new approach to implement Reed-Muller Universal Logic Module (RM-ULM) networks with reduced delay and hardware for synthesizing logic functions given in Reed-Muller (RM) form. Replication of single control line RM-ULM is used as the only design unit for defining any logic function. An algorithm is proposed that does exhaustive branching to reduce the number of levels and modules required to implement any logic function in RM form. This approach attains a reduction in delay, and power over other implementations of functions having large number of variables.