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

Microphytoplankton community structure in the North Eastern Arabian Sea during Winter Monsoon

The overall attempt of the study was aimed to understand the microphytoplankton community composition and its variations along a highly complex and dynamic marine ecosystem, the northern Arabian Sea. The data generated provides a first of its kind knowledge on the major primary producers of the region. There appears significant response among the microphytoplankton community structure towards the variations in the hydrographic conditions during the winter monsoon period. Interannually, variations were observed within the microphytoplankton community associated with the variability in temperature patterns and the intensity of convective mixing. Changing bloom pattern and dominating species among the phytoplankton community open new frontiers and vistas towards more intense study on the biological responses towards physical processes. The production of large amount of organic matter as a result of intense blooming of Noctiluca as well as diatoms aggregations augment the particulate organic substances in these ecosystem. This definitely influences the carbon dynamics of the northern Arabian Sea. Detailed investigations based on time series as well as trophodynamic studies are necessary to elucidate the carbon flux and associated impacts of winter-spring blooms in NEAS. Arabian sea is considered as one among the hotspot for carbon dynamics and the pioneering records on the major primary producers fuels carbon based export production studies and provides a platform for future research. Moreover upcoming researches based on satellite based remote sensing on productivity patterns utilizes these insitu observations and taxonomic data sets of phytoplankton for validation of bloom specific algorithm development and its implementation. Furthermore Saurashtra coast is considered as a major fishing zone of Indian EEZ. The studies on the phytoplankton in these regions provide valuable raw data for fishery prediction models and identifying fishing zones. With the Summary and Conclusion 177 baseline data obtained further trophodynamic studies can be initiated in the complex productive North Eastern Arabian Seas (NEAS) ecosystem that is still remaining unexplored.