Survival of multi-drug resistant enteropathogenic Escherichia coli and Salmonella paratyphi in Vembanadu lake as a function of saltwater barrier along southwest coast of India

The objective of the study was to evaluate the survival response of multi-drug resistant enteropathogenic Escherichia coli and Salmonella paratyphi to the salinity fluctuations induced by a saltwater barrier constructed in Vembanadu lake, which separates the lake into a freshwater dominated southern and brackish water dominated northern part. Therefore, microcosms containing freshwater, brackish water and microcosms with different saline concentrations (5, 10, 15, 20, 25 ppt) inoculated with E. coli/S. paratyphi were monitored up to 34 days at 20 and 30 WC. E. coli and S. paratyphi exhibited significantly higher (p <0.05) survival at 20 WC compared to 30 WC in all microcosms. Despite fresh/brackish water, E. coli and S. paratyphi showed prolonged survival up to 34 days at both temperatures. They also demonstrated better survival potential at all tested saline concentrations except 25 ppt where a significantly higher (p<0.0001) decay was observed. Therefore, enhanced survival exhibited by the multi-drug resistant enteropathogenic E. coli and S. paratyphi over a wide range of salinity levels suggest that they are able to remain viable for a very long time at higher densities in all seasons of the year in Vembanadu lake irrespective of saline concentrations, and may pose potential public health risks during recreational activities

Multi-objective assembly job shop scheduling using genetic algorithm and tabu search

Assembly job shop scheduling problem (AJSP) is one of the most complicated combinatorial optimization problem that involves simultaneously scheduling the processing and assembly operations of complex structured products. The problem becomes even more complicated if a combination of two or more optimization criteria is considered. This thesis addresses an assembly job shop scheduling problem with multiple objectives. The objectives considered are to simultaneously minimizing makespan and total tardiness. In this thesis, two approaches viz., weighted approach and Pareto approach are used for solving the problem. However, it is quite difficult to achieve an optimal solution to this problem with traditional optimization approaches owing to the high computational complexity. Two metaheuristic techniques namely, genetic algorithm and tabu search are investigated in this thesis for solving the multiobjective assembly job shop scheduling problems. Three algorithms based on the two metaheuristic techniques for weighted approach and Pareto approach are proposed for the multi-objective assembly job shop scheduling problem (MOAJSP). A new pairing mechanism is developed for crossover operation in genetic algorithm which leads to improved solutions and faster convergence. The performances of the proposed algorithms are evaluated through a set of test problems and the results are reported. The results reveal that the proposed algorithms based on weighted approach are feasible and effective for solving MOAJSP instances according to the weight assigned to each objective criterion and the proposed algorithms based on Pareto approach are capable of producing a number of good Pareto optimal scheduling plans for MOAJSP instances.

A Multi-Objective Antenna Placement Genetic Algorithm for Matched Array Synthesis on Complex Platforms

A Multi-Objective Antenna Placement Genetic Algorithm (MO-APGA) has been proposed for the synthesis of matched antenna arrays on complex platforms. The total number of antennas required, their position on the platform, location of loads, loading circuit parameters, decoupling and matching network topology, matching network parameters and feed network parameters are optimized simultaneously. The optimization goal was to provide a given minimum gain, specific gain discrimination between the main and back lobes and broadband performance. This algorithm is developed based on the non-dominated sorting genetic algorithm (NSGA-II) and Minimum Spanning Tree (MST) technique for producing diverse solutions when the number of objectives is increased beyond two. The proposed method is validated through the design of a wideband airborne SAR

Spatial and Temporal Variability of some Meteorological Parameters over Tropical Indian Ocean

The objective of the present study is to understand the spatial and temporal variability of sea surface temperature(SST), precipitable water, zonal and meridional components of wind stress over the tropical Indian Ocean to understand the different scales of variability of these features of Indian Ocean. Empirical Orthogonal Function (EOF) and wavelet analysis techniques are utilized to understand the standing oscillations and multi scale oscillations respectively. The study has been carried out over Indian Ocean and South Indian Ocean. For the present study, NCEP/NCAR(National Center for Environmental Prediction National Center for Atmospheric Research) reanalyzed daily fields of sea surface temperature, zonal and meridional surface wind components and precipitable water amount during 1960-1998 are used. The principle of EOF analysis and the methodology used for the analysis of spatial and temporal variance modes.

Some Studies and New Results on Multi Microprocessor Applications

One of the fastest expanding areas of computer exploitation is in embedded systems, whose prime function is not that of computing, but which nevertheless require information processing in order to carry out their prime function. Advances in hardware technology have made multi microprocessor systems a viable alternative to uniprocessor systems in many embedded application areas. This thesis reports the results of investigations carried out on multi microprocessors oriented towards embedded applications, with a view to enhancing throughput and reliability. An ideal controller for multiprocessor operation is developed which would smoothen sharing of routines and enable more powerful and efficient code I data interchange. Results of performance evaluation are appended.A typical application scenario is presented, which calls for classifying tasks based on characteristic features that were identified. The different classes are introduced along with a partitioned storage scheme. Theoretical analysis is also given. A review of schemes available for reducing disc access time is carried out and a new scheme presented. This is found to speed up data base transactions in embedded systems. The significance of software maintenance and adaptation in such applications is highlighted. A novel scheme of prov1d1ng a maintenance folio to system firmware is presented, alongwith experimental results. Processing reliability can be enhanced if facility exists to check if a particular instruction in a stream is appropriate. Likelihood of occurrence of a particular instruction would be more prudent if number of instructions in the set is less. A new organisation is derived to form the basement for further work. Some early results that would help steer the course of the work are presented.