|
Object-Oriented Designing
and Implementation of a System
for Mushroom Cultivation
- - Manju Singh, P Bhanu Prasad and Pawan Kapur
Producing nutritious food at a profit, while using materials that would otherwise be considered waste, constitutes
a valuable service in the self-sustaining community we might envision for the future. Mushrooms require different
kinds of environment at different stages of their growth. The required environment naturally varies for each type
of mushroom. The absence of proper environment might cause diseases and/or reduce the quality and quantity of
the produce. To increase the production of mushrooms, monitoring and controlling of environmental parameters is
a must. As object-oriented design and programming provide a number of features, such as abstraction and
inheritance, that help in easy development and implementation of applications, a system has been designed and implemented
using these techniques to monitor environmental parameters like temperature, Relative Humidity (RH), etc., and control
the parameters using an Air-Handling Unit (AHU). In this paper, use of some of the object-oriented facilities provided
by C++, such as different modes of inheritance and function calls, in the application is explained through
examples, along with a brief description of the system for mushroom cultivation.
© 2009 IUP. All Rights Reserved.
A New ISODATA Algorithm
- - S Sampath and V S Vaidyanathan
A new ISODATA (Iterative Self-Organizing Data Analysis Technique)
algorithm that makes use of coefficient of variation in the cluster formation process is developed. The performance of the proposed algorithm is
evaluated against the original ISODATA algorithm in terms of cluster validity
measures, namely Sum of Squares, Purity and F-measure, using four different data sets. The results of the experimental study support the use of the newly
proposed ISODATA algorithm for clustering small as well as large data sets.
© 2009 IUP. All Rights Reserved.
Distribution of Jobs and Evaluation Factors of Computational Grid Systems with Mac OS
- - N Balaji, N Ramaraj, M Sridhar and R Sai Giridhar
The use of grid computing is growing these days. Grid computing not only uses dedicated systems but also
systems already in use, thereby improving resource utilization. In such a scenario, there is a need to develop
performance evaluation techniques (Liang et
al., 2004) that not only include execution time but also incorporate factors such
as scale up, speed up and other important factors which are elaborated in this paper. These factors have also
been tested in a grid developed with shared resources (processors) under various conditions. This paper elaborates
the grid developed, the applications tested, the factors used and finally presents results in the form of graphs.
© 2009 IUP. All Rights Reserved.
A Novel Approach to Image Edge Enhancement
Using Smoothing Filters
- - B Tirimula Rao, K Venkat Rao, G Kiran Swathi,
G Pruthvi Shanthi and J Sree Durga
Image processing is a special form of signal processing which provides valuable information towards human
image understanding. The most important image processing step in human picture recognition system consists of
the edge enhancement process (Nick et al., 1988; Jin, 1990; Bin et al., 1993; Olga et al., 1999; Remzi and Rui, 1999; Ilya et al., 2000; Ben and Hamid, 2001; Li, 2001; and Day-Fann et al., 2006). Edges are the representations of the discontinuities
of image intensity functions. For processing these discontinuities in an image, a good edge enhancement technique
is essential. This paper proposes a new idea for edge enhancement using smoothing techniques. Various
smoothing technologies are explored and implemented for comparing their performance with various threshold
values. Comparison is done by qualitative approach, quantitative approach and computational complexity. This
method of edge enhancement has a specific advantage over the traditional edge enhancement
filters, especially in enhancing the edges of a noisy image
(Nick et al., 1988; Jin, 1990; and Bin et
al., 1993). In traditional edge enhancement, the
image should be smoothened first for detecting the edges of a noisy image.
The traditional edge enhancement filters should then
be applied. If smoothing filters are used, the image will
be smoothened more efficiently. So the remaining operation is a simple operation of subtracting images.
The number of computations are very few when
smoothing filters are used compared to the traditional edge enhancement techniques. This factor provides the key
motivation for the selection of this technique in edge enhancement.
© 2009 IUP. All Rights Reserved.
A New Theory of Cryptography
on Discrete Logarithm Problem
Under Definite Integral Calculus
- - Sunil Kumar Kashyap, Birendra Kumar Sharma
and Amitabh Banerjee
The main objective of this paper is to propose a new
theory of cryptography based on the problem of solving
the discrete logarithm problem under the definite integral calculus in the multiplicative group of the finite field. This
is the first work in the cryptographic field, where we found the mathematical relation between the discreteness
and continuous mathematics. This is very difficult to solve, because three distinct discrete logarithm problems will
be solved at the same time under the definite integral in the multiplicative group of the finite field. This is the
motivation for giving the new public key cryptography.
Thus, we used this hard mathematical problem for
designing a secure public key cryptosystem, because we strongly claim that there are no algorithms and methods in the
cryptographic world for solving the proposed mathematical problem. This public key cryptosystem is also very practical in
various cryptographic applications, because the encryption and decryption algorithm is
very simple with small key length.
© 2009 IUP. All Rights Reserved.
Experiments on Clustering
and Multi-Document Summarization
- - Maruthamuthu, Maheedharan, Kirubakaran and Shanmugasundaram Hariharan
Commercially, there are many newspaper sites that produce news reports
for users in different forms and style. The content remains the same
in all such forms. Hence, an effective summary might be a solution to save the end
user time in reading all the reports. Although all exiting automatic multi-document summarizers generate
summaries from multiple clusters, it is quite challenging to identify such strongly related clusters.
This paper proposes a novel framework for clustering the documents that are domain independent.
It focuses in depth on the process of clustering the documents from large volumes of data available. The paper also investigates the optimal
threshold that can cluster the documents effectively.
It also proposes a summarization procedure for the clustered
documents. The results are promising and have some significance in
multi-document cluster generation.
© 2009 IUP. All Rights Reserved.
Research Note
The Obscure History of Graph
- - Samar Sen Sarma, Saptarshi Naskar, Krishnendu Basuli
and Raju Halder
© 2009 IUP. All Rights Reserved.
|
