Tropical Mesoscale Convective Systems and Associated Energetics : Observational and Modeling Studies

The main purpose of the thesis is to improve the state of knowledge and understanding of the physical structure of the TMCS and its short range prediction. The present study principally addresses the fine structure, dynamics and microphysics of severe convective storms.The structure and dynamics of the Tropical cloud clusters over Indian region is not well understood. The observational cases discussed in the thesis are limited to the temperature and humidity observations. We propose a mesoscale observational network along with all the available Doppler radars and other conventional and non—conventional observations. Simultaneous observations with DWR, VHF and UHF radars of the same cloud system will provide new insight into the dynamics and microphysics of the clouds. More cases have to be studied in detail to obtain climatology of the storm type passing over tropical Indian region. These observational data sets provide wide variety of information to be assimilated to the mesoscale data assimilation system and can be used to force CSRM.The gravity wave generation and stratosphere troposphere exchange (STE) processes associated with convection gained a great deal of attention to modem science and meteorologist. Round the clock observations using VHF and UHF radars along with supplementary data sets like DWR, satellite, GPS/Radiosondes, meteorological rockets and aircrafl observations is needed to explore the role of convection and associated energetics in detail.

Technological Change and the Development of the Primary Fishing Industry of Kerala - A Study of Limited Growth

Induction of growth in the primary marine fishing industry of Kerala is a sine gua Qgn for improving the economy of the fishermen, the state's domestic product as well as earning more foreign exchange for the country. The State Administration has been trying to instil growth into the industry eversince the output of the industry showed marked sign of decline (particularly after 1975). Significantly, it has attempted to strengthen the traditional sector, (which is considered to be the crucial sector of the primary marine fishing industry of the state) by introducing intermediate technology and by revamping the organisational structure of the industry. But it appears that the production system in the primary marine fishing industry of Kerala has been severely constrained by the existing technology, organisation of production and marketing institutions. Regeneration of growth in the industry calls forth an understanding of the 'process' of growth in the industry and the need to réorganise it with new technology, and new organisations. The present study is an attempt to unraval the process of growth in the primary marine fishing industry of Kerala since 1951

Anomaly Detection Using System Call Sequence Sets.

This paper discusses our research in developing a generalized and systematic method for anomaly detection. The key ideas are to represent normal program behaviour using system call frequencies and to incorporate probabilistic techniques for classification to detect anomalies and intrusions. Using experiments on the sendmail system call data, we demonstrate that concise and accurate classifiers can be constructed to detect anomalies. An overview of the approach that we have implemented is provided.

Computing median and antimedian sets in median graphs

The median (antimedian) set of a profile π = (u1, . . . , uk) of vertices of a graphG is the set of vertices x that minimize (maximize) the remoteness i d(x,ui ). Two algorithms for median graphs G of complexity O(nidim(G)) are designed, where n is the order and idim(G) the isometric dimension of G. The first algorithm computes median sets of profiles and will be in practice often faster than the other algorithm which in addition computes antimedian sets and remoteness functions and works in all partial cubes

Prediction of Key Symptoms of Learning Disabilities in School-Age Children Using Rough Sets

This paper highlights the prediction of learning disabilities (LD) in school-age children using rough set theory (RST) with an emphasis on application of data mining. In rough sets, data analysis start from a data table called an information system, which contains data about objects of interest, characterized in terms of attributes. These attributes consist of the properties of learning disabilities. By finding the relationship between these attributes, the redundant attributes can be eliminated and core attributes determined. Also, rule mining is performed in rough sets using the algorithm LEM1. The prediction of LD is accurately done by using Rosetta, the rough set tool kit for analysis of data. The result obtained from this study is compared with the output of a similar study conducted by us using Support Vector Machine (SVM) with Sequential Minimal Optimisation (SMO) algorithm. It is found that, using the concepts of reduct and global covering, we can easily predict the learning disabilities in children

Median Sets and Median Number of a Graph

A profile is a finite sequence of vertices of a graph. The set of all vertices of the graph which minimises the sum of the distances to the vertices of the profile is the median of the profile. Any subset of the vertex set such that it is the median of some profile is called a median set. The number of median sets of a graph is defined to be the median number of the graph. In this paper, we identify the median sets of various classes of graphs such as Kp − e, Kp,q forP > 2, and wheel graph and so forth. The median numbers of these graphs and hypercubes are found out, and an upper bound for the median number of even cycles is established.We also express the median number of a product graph in terms of the median number of their factors.

On The Center Sets and Center Numbers of Some Graph Classes

For a set S of vertices and the vertex v in a connected graph G, max x2S d(x, v) is called the S-eccentricity of v in G. The set of vertices with minimum S-eccentricity is called the S-center of G. Any set A of vertices of G such that A is an S-center for some set S of vertices of G is called a center set. We identify the center sets of certain classes of graphs namely, Block graphs, Km,n, Kn −e, wheel graphs, odd cycles and symmetric even graphs and enumerate them for many of these graph classes. We also introduce the concept of center number which is defined as the number of distinct center sets of a graph and determine the center number of some graph classes

Fair Sets of Some Classes of Graphs

Given a non empty set S of vertices of a graph, the partiality of a vertex with respect to S is the di erence between maximum and minimum of the distances of the vertex to the vertices of S. The vertices with minimum partiality constitute the fair center of the set. Any vertex set which is the fair center of some set of vertices is called a fair set. In this paper we prove that the induced subgraph of any fair set is connected in the case of trees and characterise block graphs as the class of chordal graphs for which the induced subgraph of all fair sets are connected. The fair sets of Kn, Km;n, Kn e, wheel graphs, odd cycles and symmetric even graphs are identi ed. The fair sets of the Cartesian product graphs are also discussed