SPATIAL CLUSTERING ALGORITHMS-AN OVERVIEW.

An Overview of known spatial clustering algorithms The space of interest can be the two-dimensional abstraction of the surface of the earth or a man-made space like the layout of a VLSI design, a volume containing a model of the human brain, or another 3d-space representing the arrangement of chains of protein molecules. The data consists of geometric information and can be either discrete or continuous. The explicit location and extension of spatial objects define implicit relations of spatial neighborhood (such as topological, distance and direction relations) which are used by spatial data mining algorithms. Therefore, spatial data mining algorithms are required for spatial characterization and spatial trend analysis. Spatial data mining or knowledge discovery in spatial databases differs from regular data mining in analogous with the differences between non-spatial data and spatial data. The attributes of a spatial object stored in a database may be affected by the attributes of the spatial neighbors of that object. In addition, spatial location, and implicit information about the location of an object, may be exactly the information that can be extracted through spatial data mining

A simple device for the separation of weak larvae of Macrobrachium rosenbergii (De Man)

Larvae of Macrobrachium rosenbergii (De Man) are photopositive (Ling 1969a.b) and negatively rheotactic. While investigating larval diseases of M, rosenbergii it was observed that weak larvae failed to show both these responses. It was felt that this lack of response could be used to develop a device for separating the weak larvae from the apparently healthy ones. Such a device would be a valuable tool for assessing the health of a batch in terms of the percentage of 'healthy' and 'weak' larvae. What follows is a description and mode of operation of the 'photo-flow' device developed by the authors

Axiomatic Characterization of the Antimedian Function on Paths and Hypercubes

An antimedian of a pro le = (x1; x2; : : : ; xk) of vertices of a graph G is a vertex maximizing the sum of the distances to the elements of the pro le. The antimedian function is de ned on the set of all pro les on G and has as output the set of antimedians of a pro le. It is a typical location function for nding a location for an obnoxious facility. The `converse' of the antimedian function is the median function, where the distance sum is minimized. The median function is well studied. For instance it has been characterized axiomatically by three simple axioms on median graphs. The median function behaves nicely on many classes of graphs. In contrast the antimedian function does not have a nice behavior on most classes. So a nice axiomatic characterization may not be expected. In this paper such a characterization is obtained for the two classes of graphs on which the antimedian is well-behaved: paths and hypercubes.

A simple regulated power supply for characteristics studies of klystron oscillators

A simple and inexpensive power supply suitable for characteristics studies of a klystron is described. The circuit is a modified form of the high voltage adjustable power supply based on LM 317. This provides the necessary cavity and repeller voltages over a wide range, with good regulation. The system is protected aa- ainst short circuits and is ideallv suitable for laboratorv, ex.Deri ments with reflex klystrons.

Simple approach to determine resonant frequencies of microstrip antennas

A simple approach for accurate determination of the resonant frequencies of microstrip antennas of regular geometries is developed and presented. In this approach, a generalised empirical formula for the computation of effective dielectric permittivity is given which takes into account the ratio of the fringing area to the area of the patch. A correction to the equivalent side length of an equilateral triangular patch, previously published, is modified and a new formula is given. A correction to the effective dimensions of an elliptical microstrip antenna is also carried out. Numerical results obtained for the resonant frequencies of elliptical, circular, rectangular and equilateral-triangular microstrip antennas are in good agreement with the available theoretical and experimental results reported by others. The present approach is more efficient, simpler and more accurate

Comments on Simple and Accurate Formula for the Resonant Frequency of the Equilateral Triangular Microstrip Patch Antenna

Antennas and Propagation, IEEE Transactions on,VOL 48,issue 4,pp 636

Evolution of Better Wavelet Coefficients for Fingerprint Image Compression using cropped images

This paper explains the Genetic Algorithm (GA) evolution of optimized wavelet that surpass the cdf9/7 wavelet for fingerprint compression and reconstruction. Optimized wavelets have already been evolved in previous works in the literature, but they are highly computationally complex and time consuming. Therefore, in this work, a simple approach is made to reduce the computational complexity of the evolution algorithm. A training image set comprised of three 32x32 size cropped images performed much better than the reported coefficients in literature. An average improvement of 1.0059 dB in PSNR above the classical cdf9/7 wavelet over the 80 fingerprint images was achieved. In addition, the computational speed was increased by 90.18 %. The evolved coefficients for compression ratio (CR) 16:1 yielded better average PSNR for other CRs also. Improvement in average PSNR was experienced for degraded and noisy images as well

Bayesian Analysis of Simple Step-stress Model under Weibull Lifetimes

Department of Statistics, Cochin University of Science & Technology, Part of this work has been supported by grants from DST and CSIR, Government of India. 2Department of Mathematics and Statistics, IIT Kanpur