011598   Sharmila Kumari M;Shekar B H (Computer Science and Engineering Dep, P.A. College of Engineering, Managlore, Karnataka, Email: sharmilabp@gmail.com) : KDE technique with ECA for accurate face image classification. Int J Inf Process 2012, 6(1), 60-6.

Reported a new face image classification algorithm based on Renyi entropy component analysis. In the proposed model, kernel discriminant analysis is integrated with entropy analysis to choose the best principal component vectors which are subsequently used for pattern projection to a lower dimensional space. Extensive experimentation on Yale and UMIST face database has been conducted to reveal the performance of the entropy based Kernel Discriminative Embedding (KDE) technique and Comparative Analysis (CA) is made with conventional kernel linear discriminant method to signify the importance of selection of principal component vectors based on entropy information rather based only on magnitude of eigen values.

4 illus, 4 tables, 8 ref

011597   Sengupta N;Sil J;Saha M (Information Technology Program, College of Bahrain Univ, PO Box 55040, Manama, Kingdom of Bahrain) : Comparison of performance for intrusion detection system using different rules of classification. Int J Inf Process 2012, 6(1), 76-83.

Classification is very important, for designing intrusion detection system that classifies network traffic data. Broadly traffic data is classified as normal or anomaly. In the work classification performance using rules obtained by different methods are applied on network traffic and compared. Classifier is built based on rules of decision table, conjunctive rule, OneR, PART, JRip. NNge, ZeroR, BayesNet, Ridor from WEKA and using rough set theory. Classification performance is compared applying on KDD data set where the whole data set is divided into training and test data set. Rules are formed using training data set by different rule generation methods and later applied on test data set to calculate accuracy of classifiers.

1 illus, 8 tables, 10 ref

011596   Mollah A F;Basu S;Nasipuri M (NO, School of Mobile Computing and Communication, Jadavpur Univ, Kolkata-700 032, Email: afmollah@gmail.com) : Novel approach towards computation and memory efficient implementation of convolution-based binarization techniques. Int J Inf Process 2012, 6(3), 67-79.

Binarization of document images is an extensively studied topic. Among the binarizatiori techniques, locally adaptive ones are most popular and majority of them are convolution-based. Computational requirements of such techniques make them unsuitable for low computing platforms and handheld mobile devices such as cell-phones, Personal Digital Assistants, etc. In this paper, we have presented a novel implementation approach for making convolution-based locally adaptive binarizatiori techniques computationally efficient as well as low memory usage while keeping the performance comparable to the algorithmic implementation. The computational complexity has been reduced from O(W²N²} to O(WN²) where W x W is the window size and N x N is the image size. Moreover, an automatic window size selection schema, has been proposed. Experiments over benchmark datasets show that the computation time has been reduced by 5 to 15 times depending on the window size without consuming additional memory with respect to the state-of-the-art algorithmic implementation. This approach is specially useful for handheld device based image analysis applications.

12 illus, 5 tables, 26 ref

011595   Mohanty P;Kabat M R;Patel M K (Computer Science and Engineering Dep, VSS Technology Univ, Burla, Sambalpur, Odisha, Email: prabhu99.mohanty@gmail.com) : Energy aware transport protocol in wireless sensor networks. Int J Inf Process 2012, 6(3), 23-31.

One of the most important challenges in the design of Wireless Senor Networks (WSN) is to maximize their lifetime. Sensor nodes are energy constrained in nature. Therefore, energy efficient communication techniques are necessary to increase the lifetime of sensor nodes. Redundant data increases the energy consumption during data transmission. In this paper, we present an Energy Efficient Transmission Control Protocol (EETCP) for data gathering and data transmission within the network. We aim to minimize the redundant data transmission with the co-ordination of Base-station, to increase the lifetime of the network. The performance of the proposed protocol is studied through simulations, ft is observed that the protocol fits to all modes of transmission and it increases the life time of the network and Packet Delivery Ratio.

12 illus, 2 tables, 15 ref

011594   Meyyappan T;Thamarai S M (Computer Science and Engineering Dep, Alagappa Univ, Karaikudi-630 003, Email: meyslotus@yahoo.com) : Hybrid method to solve linear multi objective optimization problems using fractional programming and genetic algorithm. Int J mathl Sci 2013, 12(1-2), 103-12.

Most real-world search and optimization problems naturally involve multiple objectives. Because of a lack of suitable solution methodologies, Multi-Objective Optimization has been mostly cast and solved as single objective optimization problem. A solution that is extreme with respect to one objective requires a compromise in other objectives. Classical way to solve multi-objective optimization problems is to follow the preference-based approach, where a relative preference vector is used to scalarize multiple objectives. The proposed hybrid approach employs both fractional programming technique and evolutionary technique. Given objective functions are not transformed in any way. Permutations of objective fractions are formed. 'θ' matrix fixes the lower and upper bounds of each decision variable. Parents are formed with random numbers for decision variables within their bounds. Each objective fraction is taken as a fitness function. Parents are formed with values of decision variables as chromosomes. Feasible solutions are found for chosen number of parents and chosen number of generations. The number of parents is limited to total number of decision variables and constraints to avoid searching of entire solution space. Improvements are made to parents by applying genetic operators. Solutions obtained in one generation are carried over to subsequent generations for further refinement. A parent which yields best value to the objective fraction is collected for each permutation of objective fraction and the best among them is obtained. Solution to multi-objective optimization problems converges very quickly in the proposed method. Genetic algorithm plays a vital role in faster solution convergence compared to iterative procedures. Another strength of the proposed method is the formation of θ theta matrix and limiting the solution space within the bounds of decision variables and constraints. The authors developed a package using C language to implement the proposed method.

2 tables, 11 ref

011593   Lijo V;Kalady S (Computer Science and Engineering Dep, MES College of Engneering, Kuttippuram-679 573, Email: paull.lijo@gmal.com) : User-centric design for privacy preservation in cloud environment. Int J Inf Process 2012, 6(1), 1-11.

Recently, Cloud computing attained its pace in most of the IT services. In cloud computing, the services are provided by some vendors and the customers are unaware about the storage and maintenance of their data. Logically speaking, the client has no control over the cloud. When the service providers process the data being provided by the customers, issues like privacy loss and data leakage may arise. This is an important barrier for the adoption of cloud services. A user-centric approach is essential to overcome this barrier. In this paper we present a solution which provides the control, over the data being submitted in the cloud, to the user. This proposed user-centric solution is implemented in the cloud application eyeOS as a working model.

4 illus, 17 ref

011592   Leena Silvoster M;Govindan V K (Computer Science and Engineering Dep, National Institute of Technology, Calicut, Kerala, Email: leenasilvoster@gmail.com) : Convolutional neural network generated affinity graph based segmentation. Int J Inf Process 2012, 6(1), 67-75.

The recent proliferation of Scanning Electron Microscopy (SEM) image in the field of neuroscience has attracted many neuroscientists. Segmented SEM images have played a vital role in diagnosis of diseases, treatment, computer aided surgery etc.. Machine learning system is able to learn from experience, analytical observation and other means, results in a system that can improve its own speed and performance. In this work, Convolutional Neural Network (CNN) is used for learning how to segment images. CNN extract features directly from pixel images with minimal preprocessing. It is able to recognize a pattern which has not been presented before, provided it resembles one of the training patterns. After learning (from ground-truth image), CNN automatically generate a good affinity graph from raw EM images. This affinity graph can be then paired with any standard partitioning algorithm to achieve improved segmentation. In this paper, we introduce a novel flexible and powerful combined approach, where a CNN and Connected Component(CC) algorithm are used to segment SEM images. As a preprocessing step, the image is segmented using the Edge Detection and Image Segmentation (EDISON) system, which uses mean shift algorithm. F-score of the proposed algorithm was found to be 86%.

4 illus, 1 table, 20 ref

011591   Lakshmi Priya G G;Domnic S (Computer Applications Dep, National Institute of Technology, Tiruchirappalli-620 015, Email: gg_lakshmipriya@yahoo.co.in) : Detection of abrupt and gradual transitions in digital video sequences. Int J Inf Process 2012, 6(1), 21-31.

In this paper, authors proposed a new approach for the detection and identification of shot boundaries using the HSV dominant color features and Least Square Approximation method. Authors have used chi-square test metric and statistical based threshold calculation algorithm for cut identification. After detection of cuts, the remaining frames are extracted and are used for gradual transition detection process. In order to calculate the similarity between the extracted frames, block based Yakimovsky Likelihood Ratio (YLR) test metric is used. To reduce the impact of motion influences in the detection process, a novel idea, Least, Square Polynomial Approximation is used that performs approximation of the discontinuity value obtained from YLR test. Later, the gradual transition identification algorithm is employed that identifies the fade and dissolve regions correctly. Experiments are carried out on various video data sets taken from TRECVid and publically available data sets. Test results indicate that better precision and recall are achieved for the test videos by our proposed method than the other existing methods.

2 illus, 5 tables, 26 ref

011590   Hulipalled V R;Shreekrishna Kumar K; Venugopal K R;Iyengar S S;Patnaik L M (Computer Science and Engineering Dep, Visvesvaraya College of Engineering, Bangalore Univ, Bangalore, Email: vishwa.gld@gmail.com) : Similarity pattern search for stream time series image data using cluster median approach. Int J Inf Process 2012, 6(3), 98-107.

Stream Time Series retrieval has been a major area of study due to its vast application in various fields like weather forecasting, multimedia data retrieval and huge data analysis. Its original task is to identify those time series similar to pattern (query) time-series image data, where both pattern and time series image data are static. Presenly, there is a demand for image data stream processing, quick searching and fast response of such online data. Authors use a cluster median or segment median method for similarity matching between static/dynamic patterns and stream time series image data which can be computed with respect to change in temporal events and hence suitable for the temporal behaviour. Mainly, presents an effective pruning technique on the multilevel representation of the image data. The objective of pruning technique is to reduce the search space and to retrieve the similar patterns very efficiently. Experiments show that our approach MCMI performs well compared to existing methods DWT and MSM.

5 illus, 26 ref

011589   Hassan M;Bhagvati C (Computer and Information Sciences Dep, Hyderabad Univ, Hyderabad-500 046) : Objective metric for quality assessment of color quantized images. Int J Inf Process 2012, 6(3), 32-41.

Presents a novel objective image quality metric for quality assessment of color quantized images. The proposed metric models any color quantization distortion as a combination of three similarities: color similarity, edge similarity and structural similarity. Evalidates the performance of the proposed metric with an extensive subjective study involving 875 color quantized images and show that the new metric outperforms recent state-of-the-art image quality metrics in the quality assessment of color quantization distortion.

2 illus, 4 tables, 28 ref

011588   Das A K;Pati S K (Computer Science and Technology Dep, Bengal Engineering and Science Univ, Shibpur, Howrah-711 103, Email: asitdas72@rediffmail.com) : Rough set and statistical method for both way reduction of microarray cancer dataset. Int J Inf Process 2012, 6(3), 55-66.

Microarray gene dataset often contains huge number of genes and samples many of which are irrelevant and redundant with respect to classification. Therefore, the data should be pre-processed to filter out the unimportant genes and samples before passing them on to the classifier. In the paper, the concepts of Rough Set Theory (RST) and Genetic Algorithm (GA) are used for selecting only the relevant samples of the dataset. The method constructs relative discernibility matrix to compute the core attributes based on which attributes are encoded to strings used as an initial population for running the genetic algorithm. The method runs each time by adding a single attribute to the initial strings to select only a minimal attribute set known as reduct. Then statistical method uses to reduce the gene set by selecting only the informative genes. Here, genes are ranked first and select only the high ranked genes. Then Pearson Correlation Coefficients are calculated and genes are merged. Thus genes are partitioned and final gene set is obtained by selecting a gene with the highest rank from each partition. The experimental results show that, the proposed method yields better result than some well known attribute reduction algorithms. Also the goodness of the method is evaluated by computing the classification accuracy by various well known classifiers on some real world microarray cancerous datasets.

3 illus, 2 tables, 29 ref

011587   Danti A;Suresha M (Computer Applications Dep, Jawaharlal Nehru National College of Engineering, Karnataka, Email: ajitdanti@yahoo.com) : Dimensionality reduction by SVM-KNN approach for arecanut classification. Int J Inf Process 2012, 6(3), 80-8.

Combination of Support Vector Machines(SVM) and K-Nearest Neighbour (K-NN) approach is employed for effective classification of arecanut. Combined approach reduces feature dimension considerbly which inturn speed up classification of arecanut. The k-NN rule is a simple and effective method for multi-way classification that is much used in Computer Vision. However, its performance depends heavily on the distance metric being employed. K-NN classifiers suffer from the problem of high variance in the case of limited sampling. Alternatively, one could use support vector machines but they involve time-consurning optimization and computation of pairwise distances. Proposes a combination of these two methods which deals with the multiclass problem, has reasonable computational complexity in classification and gives excellent results in practice. The basic idea is to find support vectors using Support Vector Machine Classifier. k-NN classifier uses only support vectors as a feature space which is given by SVMs in training phase, k is the most important parameter in the arecanut grading system based on k-NN. This method can be applied to large, multiclass data sets. Proposed method is experimented with large data set and determined the qualitative analysis of the classification approach.

4 illus, 1 table, 27 ref

011586   Bhukya S (Computer and Information Sciences Dep, Hyderabad Univ, Hyderabad, Email: sr2naik@gmail.com) : Propagation model for information dissemination among novel social networks. Int J Inf Process 2012, 6(1), 44-9.

Assortative mixing, high clustering, short average path lengths, broad degree distributions and the existence of community structure have become the main role of currently researches. Application in the domain of information propagation has been developed here, based on some existing social network models, which satisfies all the above characteristics. In addition, this model facilitates interaction between various communities. It gives very high clustering coefficient by retaining the asymptotically scale-free degree distribution. The community structure is raised from a mixture of random attachment and implicit preferential attachment. It supports the occurrence of a contact between two initial contacts if the new vertex chooses more than one initial contacts. The result shows a faster application to propagate information over social networks based on degree centrality.

4 illus, 1 table, 20 ref

011585   Bharathi S;Sheth P P;Shenoy P D;Venugopal K R;Patnaik L M (Computer Science and Engineering Dep, Visvesvaraya College of Engineering Univ, Bangalore Univ, Bangalore-560 001, Email: bharathishivu_s@yahoo.co.in) : Object based segmentation of satellite images for LC type monitoring using CA. Int J Inf Process 2012, 6(1), 32-43.

Clustering is one of the important statistical data mining techniques for discovering patterns. Large quantity of data is available from remote sensed images, but extracting the object and its features from satellite image is a difficult task. In this paper an efficient and robust object oriented segmentation technique using K-means, K-medoid and Fuzzy C-means clustering is proposed. Exact shape, texture and boundary of the object are extracted using the above techniques. Simulation results show that this technique gives better results than the earlier methods.

23 illus, 9 tables, 9 ref

011584   Bhandari V;Kapuriya B R;Kuber M M (Aerospace Engineering Dep, Defence Institute of Advanced Technology, Pune, Maharashtra, Email: v.bhandu@gmail.com) : Moving object segmentation using fuzzy C-means clustering technique. Int J Inf Process 2012, 6(1), 84-8.

Affine motion model is widely used in motion segmentation. This paper gives an approach for moving object segmentation by using Fuzzy C-Means (FCM) clustering on Affine parameters. Here this algorithm has been simulated in Matlab. Fuzzy C-Means clustering has been applied on the affine parameters of the pixels. Affine parameters have been calculated from Optical Flow data. Here Lucas Kanade method has been used for Optical flow Velocity calculation. Comparison of proposed method with respect to K-Means clustering segmentation method has been presented. By proposed method reduction in segmentation computation time has been achieved to almost half of the time compared to K-Means clustering segmentation. Segmentation output of the proposed method on the test video 'flower.yuv' and othertest videos has produced good results.

7 illus, 1 table, 5 ref

011583   Banerjee I;Bhattacharyya S;Sanyal G (Computer Science and Engineering Dep, Institute of Technology Univ, Burdwan Univ, Burdwan-713 101) : Text steganography through quantum approach with SSCE code. Int J Inf Process 2012, 6(3), 13-22.

Steganography maintain the security of the secret data through a communication channel, which causing attempts to break and reveal the original messages. In this paper, a text Steganography technique has been proposed with the help of Bengali language. Text Steganography including quantum approach based on the use of two specific characters and two special characters like invited comas (opening and closing) in Bengali language and mapping technique of quantum gate truth table have been used. The authors introduced a new code representation technique (SSCE - Secret Steganography Code for Embedding) at both ends in order to achieve high level of security. Before the embedding operation each character of the secret message has been converted to SSCE Value and then embeds to cover text. Finally stego text is formed and transmits to the receiver side. At the receiver side different reverse operation has been carried out to get back the original information.

17 illus, 24 ref

011582   Aspiras T H;Asari V K (Electrical and Computer Engineering Dep, Dayton Univ, Dayton, OH 45429, USA, Email: aspirast1@udayon.edu) : Regressive and blind source separation techniques for ocular artifact removal. Int J Inf Process 2012, 6(3), 42-54.

Several ocular artifact removal techniques for electroencephalographic data are evaluated in this paper. EEG recordings are taken from an emotion recognition experiment, which contains several instances of ocular artifacts like eye blinks and eye movements. The data is preprocessed through a Butterworth band-pass filter and a 60Hz notch filter to remove most electrical and high frequency noise. Once preprocessed, the data will be used to evaluate three different types of ocular artifact removal techniques: EOG based linear regression, Principal Component Analysis, and Independent Component Analysis. A new metric called Strength of Eye Blink (SEB) is created to automatically determine the removal of different components used in the Blind Source Separation techniques. Each technique is tested using two different metrics: Kurtosis, and a new metric called Zero-Mean Normalized Sum Squared Error. The new metric shows that Independent Component Analysis reduced eye artifacts, the best out of all methods while keeping uncontaminated EEG signals unchanged (Average SSE of 0.1126).

8 illus, 2 tables, 21 ref

011581   Arakeri M P;Reddy G R M (Information Technology Dep, National Institute of Technology Karnataka, Surathkal-575 025, Email: meghalakshman@gmail.com) : Recent trends and challenges in CAD of liver cancer on CT images. Int J Inf Process 2012, 6(1), 50-9.

Liver cancer has become a major health issue in the world over the past 30 years. Early detection is necessary to cure liver cancer without much complication. Computer Aided Diagnosis (CAD) system plays a vital role in the early detection of liver cancer and hence reduces death rate. It assists the radiologists in better interpretation of medical images and hence improves diagnostic accuracy and image analysis time. The main objective of this paper is to provide an overview of recent advances and challenges in the development of CAD systems for analysis of liver cancer using Computed Tomography (CT) images.

4 illus, 51 ref

011580   Abraham L;Sasikumar M (Electronics and Communication Engineering Dep, LBS Institute of Technology for Women, Kerala Univ, Trivandrum, Email: lizytvm@yahoo.com) : Fully automatic bridge extraction technique for satellite images. Int J Inf Process 2012, 6(3), 89-97.

Automatic detection of artificial objects from satellite images are important source of information in many applications such as terrain mapping by remote sensing and GIS (Geographic Information System) applications. In this paper, a fuzzy based integrated algorithm for automatic detection of bridges over water is proposed. In the first step, the rnultispectral satellite image is given to a fuzzy based thresholding method to segment water regions from the background. Then, candidate bridge pixels are extracted according to area analysis and bridge extraction algorithm developed. The algorithm is formulated in such a way that, the method can be applied to any complexity levels and any spatial resolutions. Also, the method is not affected for different angles of inclination of the bridge. The approach in this paper, has been implemented and tested with different types of satellite images to validate the superior performance of the algorithm.

14 illus, 14 ref

009544   Tiwari A;Sharma M (NO, Chhatrapati Shivaji Institute of Technology, Durg, Email: archanatiwari@csitdurg.in) : Survey of transform domain based semifragile watermaking schemes for image authentication. J Instn Engrs : Ser B 2012, 93(3), 185-91.

Image authentication is key research area for researchers' world over due to its important function in multimedia content authentication. Hence it's essential to check integrity of images before it can be put to use, in some applications such as medical, military and quality control images. In order to protect authenticity of images many approaches have been proposed, semifragile watermarking scheme is found useful in most of the practical applications. The aim of this paper is to present survey and comparison of transform domain based semifragile watermarking techniques for image authentication. Different transform domain methods used for semifragile watermark embedding are compared based on peak signal to noise ratio and mean square error. Comparative study reflects that selection of methods and parameters are application specific. Furthermore important requirements for an effective image authentication algorithm are also discussed.

1 table, 31 ref

009543   Tabarno S M;Sharma A K;Verma N (CSE Dep, MATS School of Engineering & Technology, Gullu, Aarang, Raipur, Chhattisgarh, Email: sangitaasharma1975@gmail.com) : Windows registry in forensic analysis. J Comput Technol Applic 2012, 4(2), 30-4.

Digital forensics is the buzzword in the present era of "the Information Age." It deals with the acquisition, preservation, and analysis of digital evidences. The digital forensic field is very vast. It includes operating system forensics, network forensics, web forensics, client side forensics and server side forensics, etc. A pool of operating systems is available but the Windows environment is ubiquitous in many organizations. Windows operating systems store vast data in registry. The Windows registry is the heart and soul of Windows operating systems. It is a powerful and excellent source for extracting evidences which can strongly assist in forensic analysis. Albeit a lot of work has been done in this area but still it acts as a fertile area for new researchers. Moreover, there is a dearth of suitable and well-organized literature material so as to assist the researchers and practitioners in this area. Thus, this paper aims to create a data bank to facilitate the referencing needs of researchers and practitioners in this area. To this end, this paper presents the literature review pertaining to this topic. The literature review is based on the data collected from various research papers, tools and web sources that will strongly assist in easy referencing.

^iia40 ref

009542   Sriramya P;Parvathavarthini B (Computer Science and Engineering Dep, Sathyabama Univ, Chennai, Tamilnadu, Email: sriramya82@yahoo.com) : Performance analysis of selective breeding algorithm on one dimensional bin packing problems. J Instn Engrs : Ser B 2012, 93(4), 255-8.

The bin packing optimization problem packs a set of objects into a set of bins so that the amount of wasted space is minimized. The bin packing problem has many important applications. The objective is to find a feasible assignment of all weights to bins that minimizes the total number of bins used. The bin packing problem models several practical problems in such diverse areas as industrial control, computer systems, machine scheduling, VLSI chip layout and etc. Selective breeding algorithm (SBA) is an iterative procedure which borrows the ideas of artificial selection and breeding process. By simulating artificial evolution in this way SBA algorithm can easily solve complex problems. One dimensional bin packing benchmark problems are taken for evaluating the performance of the SBA. The computational results of SBA algorithm show optimal solution for the tested benchmark problems. The proposed SBA algorithm is a good problem-solving technique for one dimensional bin packing problems.

1 illus, 1 table, 17 ref

009541   Sreeraj M;Idicula S M (Computer Science Dep, Cochin Science and Technology Univ, Cochin-682 022, Email: sreerajtkzy@gmail.com) : Writer identification in Malayalam using graphemes- a decisive evaluation. Int J Inf Process 2011, 5(4), 45-53.

Proposes a novel approach to writer identification in Malayalam using graphemes. Graphemes are small writing fragments extracted from the handwritten documents which contain meaningful patterns and possess individuality of each writer. Different classifiers like Nave-Bayes, k-NN, SVM and Adaboost were experimented with and a comparative evaluation of different classifiers is done. Also the recognition rate for different features under consideration is also computed, thus aiding to find out the influential feature. Different methods to avoid redundant characters and their influence are also done in the architecture. Experiments were done to draw conclusions at the influence of amount of text present for each writer and the codebook size on the recognition rate for the different classifiers. /

5 illus, 2 tables, 25 ref

009540   Shetty S;Tahiliani M P (Computer Science and Engineering Dep, National Institute of Technology, Surathkal, Email: shetyshivaraj@gmail.com) : RoToLo-a flexible and robust key exchange protocol. Int J Inf Process 2011, 5(4), 1-8.

Proliferation of light weight handheld devices has spurred the widespread deployment of wireless networks. This ever increasing demand for continuous network connectivity has posed several challenging issues for securing data communications. Majority of the applications in internet rely on either symmetric key cryptosystem or asymmetric key cryptosystern to securely transfer the data. However, delay sensitive applications need timely delivery of data and hence prefer symmetric key cryptosystem since asymmetric key cryptosystem are computation intensive. In this paper, we propose a Robust Two-way Locking (RoToLo) Protocol which overcomes the drawback of Diffie-Hellman key exchange protocol in terms of flexibility provided to the sender for selecting the desired key. Moreover, we demonstrate the applicability of the proposed protocol in TCP handshake and compare it with Secure TCP (STCP) which is based on Diffie-Hellman (DH) key exchange protocol. Based on extensive simulations carried out on wired and wireless networks using Network Simulator-2, it is observed that RoToLo Protocol incurs negligible overhead in the network while providing greater flexibility of key selection to the sender as compared to STCP.

7 illus, 6 ref

009539   Seetha H;Murty M N;Saravanan R (NO, School of Computinmg Science and Engineering, VIT Univ, Vellore-632 014, Email: hariseetha@gmail.com) : Note on the effect of bootstrapping and clustering on the generalization performance. Int J Inf Process 2011, 5(4), 19-34.

Generalization performance of SVM classifier is not guaranteed although it has shown prominent performance. Christopher J.C. Surges [A tutorial on Support Vector Machines for Pattern Recognition, Data Mining and Knowledge Discovery, 2(2) (1998) 121-167], states that SVMs trained with the same objective as that of a special kind of SVM called gap tolerant classifier can control the capacity from their training. The capacity of a classifier is measured by its Vapnik-Chervonenkis(VC) dimension. SVM classifier can achieve high generalization ability by minimizing the VC-dimension. In the present paper, it was shown that bootstrapping, clustering and projection methods reduce the VC dimension of SVM classifier. Experimental results showed that both clustering the class wise partition of training data and bootstrapping the original and projected data improved the generalization performance of the classifier.

19 illus, 7 tables, 43 ref

009538   Saurabh S;Sairam A S;Singh S S (Computer Science and Engineering Dep, Indian Institute of Technology, Patna-800 013, Email: ssaurabh@iitp.ac.in) : Two tier storage and distributed indexing for flash based sensor network. Int J Inf Process 2011, 5(4), 9-18.

Introduction of energy-efficient flash memory has greatly facilitated archival storage of sensor data that is necessary for applications that query, mine, and analyze such data for interesting features and trends. This trend has necessitated the need for a global distributed index for in-network storage in power constrained sensor networks. Proposes and evaluate the architecture for such networks and a distributed indexing for the architecture that allows distributed queries to proceed in a fault-tolerant and energy efficient manner with low latency. Authors discuss the rationale behind the choice of our indexing scheme and evaluate some of the characteristics of the scheme.

6 illus, 2 tables, 17 ref

009537   Sarala B;Venketeswarlu D S;Bhandari B N (ECE Dep, MVSR Engineering College, Hyderabad, Email: b.sarala@rediffmail.com) : Performance evaluation of MC CDMA PAPR reduction techniques using DT. Int J Inf Process 2011, 5(4), 95-104.

High Peak to Average Power Ratio (PAPR) of the transmitted signal is a major problem in Multicar-rier Code Division Multiple Access (MC CDMA) systems, which reduces power amplifier efficiency, the battery life, and resolution. In this paper a newly proposed system that reduces PAPR,, improves Bit Error Rate (BER) performance and reduction in power spectral density of the Multicarrier Code Division Multiple Access (MC CDMA) signals based on combining the Discrete Transform either Discrete Cosine Transform (DCT) or multi-resolution Discrete Wavelet Transform (DWT) with companding is analyzed and implemented using MATLAB. Simulation results of reduction in PAPR, BER, of the MC CDMA with companding and without companding are compared with the MC CDMA with DCT and companding, DWT and companding systems. The proposed techniques reduce PAPR, better BER, performance, and system has less mean amplitude over conventional MC CDMA techniques, and improves the spectrum efficiency.

14 illus, 3 tables, 13 ref

009536   Rathi G;Goel S (Computer Science & Engineerng Dep, Thapar Institute of Engineering and Technology, Patiala, Email: grathi12@gmail.com) : Applications of depth-first search. J Comput Technol Applic 2012, 4(2), 1-9.

In this paper, various applications of depth-first search algorithms (DFS) are surveyed. The value of DFS or "Backtracking" as a technique for solving problem is illustrated by many applications such as cycle detection, strongly connected components, topological sort, and find articulation point in a graph. The time complexity in different applications of DFS is also summarized.

9 illus, 2 tables, 10 ref

009535   Rao V V;Dasari D (NO, Computer Science and Engineering Dep, Pedatadepalli, Tadepalligudem-534 101, Email: venkatvedula@yahoo.com) : Efficient clustering techniques with presence of noise. Int J Inf Process 2011, 5(2), 31-7.

Mining Information and Knowledge patterns from large databases have been recognized by many researchers as key research topic in database systems, Knowledgebase systems, and statastics and in Information providing services. Several Emerging applications in Business organizations Scientific and Government organization need data mining process and tools to extract knowledge patterns. Clustering analysis method is one of the main analytical methods in data mining; the method of clustering algorithm will influence the clustering results directly. Clustering can be applied on database using various approaches based on distance, density, hierarchy and partition. The presence of Noise is a major problem in clustering. Noise is a data item that is not relevant to data mining. The Objective of the paper is to present new algorithms for clustering techniques that handles the noise effectively. Our focus is to show the effect of noise on the performance of various types of clustering techniques. Purpose is to study how noise effects the clustering process in terms of time and space. Authors have implemented various clustering techniques such as CURE, K-Mediods and FCMeans. Authors have compluted time complexity and space complexity of various clustering techniques for different number of clusters. These results are presented in various visual presentations like Line Chart, Bar Chart. Then we will conclude which algorithm is more efficient to deal noise.

2 illus, 2 tables, 10 ref

009534   Rao M C;Murthy A V S N;Satyanarayana C (NO, Srinivasa Institute of Engineering & Technology, Mummidivaram, Email: chinnaraokite@yahoo.com) : Identification of english dialects and emotions using spectral and prosodic features of speech signal processing. J Comput Technol Applic 2012, 4(2), 10-7.

In this paper, the authors have explored speech features to identify English dialects and emotions. A dialect is any distinguishable variety of a language spoken by a group of people. Emotions provide naturalness to speech. Speech database considered for dialect identification task consists of spontaneous speech spoken by male and female speakers. The emotions considered in this study are anger, disgust, fear, happy, neutral and sad. Prosodic and spectral features extracted from speech are used for discriminating the dialects and emotions. Spectral features are represented by Mel frequency cepstral coefficients (MFCC) and prosodic features are represented by durations of syllables, pitch and energy contours. Auto-associative neural network (AANN) models and support vector machines (SVM) are explored for capturing the dialect-specific and emotion-specific information from the above specified features. AANN models are expected to capture the nonlinear relations specific to dialects or emotions through the distributions of feature vectors. SVMs perform dialect or emotion classification based on discriminative characteristics present among the dialects or emotions. Classification systems are developed separately for dialect classification and emotion classification itiO] systems are developed separately for dialect classification and emotion classification.

4 illus, 1 table, 12 ref

009533   Pushpa C N;Thriveni J;Venugopal K R;Patnaik L M (Computer Science and Engineering Dep, Visvesvaraya College of Engineering, Bangalore Univ, Bangalore-560 001, Email: pushpacn@gmail.com ) : Enhancement of F-measure for web people search using hashing technique. Int J Inf Process 2011, 5(4), 35-44.

Searching the people names on the web is a challenging task when a single name is shared by many people and it becomes an active research topic now a day. People Search is one of the most common query types to the web search engines today on the web. When a person name is queried, the returned result often contains web pages related to several distinct keywords that have the queried name. In this paper, we have proposed Hash Table Clustering Algorithm, a new approach to improve the precision, recall and F-measure metrics of the web search engine. When user gives keywords such as a person name, the summary description of the keyword is displayed. The user can get the required web pages of interest by reading description provided with each cluster. The proposed approach aims to remove the unwanted resulting web pages, so that the precision and recall metrics of the web search engine can be improved. The Hash Table Clustering algorithm outperforms by 15.9 percent of F-measure improvement compared to WWW2005 dataset.

4 illus, 3 tables, 18 ref

009532   Prakash E;Raju R;Varatharajan R (Electronics and Communication Engineering Dep, Sri Lakshmi Aammal Engineering College, Chennai-73, Email: prsharrows89@gmail.com) : Effective method for implementation of Wallace tree multiplier using fast adders. J Innovative Res Solut 2013, 1(2), 88-94.

Arithmetic and Logic Unit (ALU), core unit of a processor, when used for scientific computations, will spend more time in multiplications. For higher order multiplications, a huge number of adders are to be used to perform the partial product addition. Reducing delay in the multiplier reduces the overall computation time. Wallace multipliers perform in parallel, resulting in high speed. It uses full adders and half adders in their reduction phase. Reduced Complexity Wallace multiplier will have fewer adders than normal Wallace multiplier. A new 16 X 16 multiplier is proposed with fast adders at the final stage of Wallace multipliers to reduce the delay. The presence of larger carry propagating adder indicates wallace multiplier as faster multiplier. The fast adder (Modified carry save adder j is used at the final stage of the Wallace multipliers to reduce the delay. This paper presents a detailed analysis of several fast adder architectures for high performance VLSI design.

8 illus, 1 table, 7 ref

009531   Krishnamoorthy P;Mahadeva Prasanna S R (NO, Samsung India Software Center, Noida-201 301, Email: pkmkicha@gmail.com ) : Noisy speech enhancement method by spectral subtraction and harmonics enhancement. Int J Inf Process 2011, 5(2), 1-12.

Improved spectral subtraction method is proposed for enhancing speech corrupted by additive background noise. The proposed method involves two steps. In the first step noisy components are estimated and are subtracted from the noisy speech by conventional spectral subtraction method. In the second step, the musical noise in the spectral subtracted speech is reduced by identifying and enhancing spectral regions which are significant both from production and perception point of view. The speech regions in the time domain, pitch and harmonics in the frequency domain are used as significant components in this work. The experimental results show that the spectral subtraction method along with harmonics enhancement provides a improved performance over the conventional spectral subtraction method and suffers minimally from musical noise.

4 illus, 2 tables, 23 ref

009530   Khetarpaul S;Gupta S K;Chauhan R (Computer Science and Engineering Dep, Indian Insttute of Technology, Delhi, Email: kpaul.sonia@gmail.com) : SR-match: discovering complex semantic matches based on semantic relationship. Int J Inf Process 2011, 5(4), 54-63.

In data integration, schema matching plays an important role. Present schema matching tools combine various match algorithms, each employing a specific technique to improve matching accuracy. However there is still no fully automatic tool available and also there is lack of accuracy. As a step in this direction, we propose a new and efficient Semantic-Relationship schema matching (SR-Match) approach which considers the semantic relationships as one of the parameters for matching. Here in SR-Match, the initial mappings performed by the basic schema mapping techniques, acts as input to the relationship matcher. Relationship matcher compares the remaining unmapped elements based on their semantic relationship with their parents and discovers remaining complex matches among attributes of two schemas. It is observed that, if both semantics and relationships are taken into account, the degree of accuracy in matching results is improved.

8 illus, 14 ref

009529   Jiji G W;Marsilin J R (Computer Science and Engineering Dep, Dr. Sivanthi Aditanar College of Engineering, Tiruchendur-628 215, Email: jijivevin@yahoo.co.in) : Automatic diagnose of the stages of breast cancer using intelligent technique. J Instn Engrs : Ser B 2012, 93(4), 209-15.

Objective of this paper is to locate the stage of the breast cancer and to locate the tumor tissues. The proposed work is performed in two stages. In the first stage, location of tumour is done and in the second phase retrieving of the tumor images and its stages based on the "query input". Texture and Shape features are used here as Feature descriptors. Shape features used are asymmetry, aspect ratio, eccentricity and Bending Energy. Texture features used are contrast, energy and Gabor Filter. KNN classifier is used for classification and for Pattern matching, Euclidean distance is used. The proposed approach which gives 95.6% accuracy has been compared with earlier approaches. The proposed approach was tested with 32 samples and got annotated by radiologists.

9 illus, 11 ref

009528   Jiji G W;Anantharadha S (Computer Science and Engineering Dep, Dr. Sivanthi Aditanar College of Engineering, Tiruchendur-628 215, Email: jijivevin@yahoo.co.in) : Automatic tracking of criminals using data mining techniques. J Instn Engrs : Ser B 2012, 93(4), 217-21.

This paper provides a new tool for the investigators working with crime analysis. Information stored in the database are analysed using data mining techniques Back Propagation NN-Classifier and Data Association Algorithms in tracking criminals and have given promising suggestions for the judiciary process. It has been concluded that the work BPN-Classifier is better than Data Association Algorithm.

3 illus, 1 table, 6 ref

009527   Jain R B (Information Networks Lab, Electrical Engineering Dep, Indian Institute of Technology, Bombay, Mumbai-400 076, Email: ranjanbala@gmail.com) : Reverse link outage probability analysis for cellular OFDMA networks. Int J Inf Process 2011, 5(4), 64-72.

In Orthogonal Frequency Division Multiple Access (OFDMA) network, it is important to specify outage probability in order to ensure a certain quality of service (QoS) like Signal to Interference and Noise Ratio (SINR), BW demand, data rate, Bit Error Rate (BER) etc. The determination of outage can be done either by performing simulations or by some analytic or semi analytic approaches. The most important issue in OFDMA cellular network is Inter-Cell Interference (ICI) due to universal frequency reuse. The : characterization of ICI is important to evaluate the outage probability and consequently the system capacity for cellular OFDMA network. We/derive an analytical expression for ICI on a particular user in a reference cell from all interfering cells irrespective of the position of user. Since OFDMA downlink involves the sum of correlated interference powers, we consider the effect pf path loss, shadowing and fading on correlated interference powers from three tiers of cells. Then, author determine the Cumulative Distribution Function (CDF) of ICI. It is used to find the outage probability of a user for a given threshold SIR, or Data rate or a target BER.

4 illus, 12 ref

009526   Jagannath H S;Virmani J;Kumar V (Biomedical Instrumentation Laboratory, Electrical Engineering Dep, Indian Institute of Technology, Roorkee-247 67, Email: jitendra.virmani@gmail.com ) : Morphological enhancement of microcalcifications in digital mammograms. J Instn Engrs : Ser B 2012, 93(3), 163-72.

Mammography is a commonly used technique for early detection of breast cancer. In mammograms, microcalcifications show low contrast margin with the background parenchymal tissue (specifically when the background tissue type is fibroglandular) as a result, subjective analysis of these calcifications with respect to their size, shape and morphology presents a daunting challenge even for experienced radiologists. Thus the present work investigates the potential of two morphological techniques i.e., top-hat morphological processing and h-dome morphological processing for enhancement of microcalcifications embedded in variety of background tissue types including fatty, glandular and fibroglandular tissues while restoring their shape and size. The enhancement results are also compared with standard contrast limited adaptive histogram equalization method. For subjective analysis, 25 synthetic images with simulated microcalcifications of various shapes and sizes are used. Objective analysis is carried out on 50 mammographic images taken from benchmark dataset (McGill University mammographic database) by computing quantitative indices like contrast improvement ratio and detail variance/background variance ratios. After rigorous experimentation on both synthetic and benchmark data set it was observed that h-dome morphological processing (with h = 60) is ideally suited for enhancement of microcalcifications while restoring their shape and size.

8 illus, 1 table, 20 ref

009525   George N (Computer Science Dep, Adi Shankara Institute of Engineering and Technology, Kalady, Ernakulam Dist., Kerala, Email: nimmy4ever@gmail.com) : Measurement based multichannel scheduler with packet concatenation. Sci Soc 2012, 10(1), 97-102.

Multichannel scheduler with packet concatenation is used to increase the throughput of the wireless channel and to utilize the channel bandwidth efficiently. In the proposed solution a modified strictly deadline ordered algorithm is used for Packet concatenation. In the existing system deterministic bound based call admission control is derived. When the underlying channel conditions are varying, this approach is not performing well. So measurement-based call admission control can be a good approach when the underlying channel condition is varying. It should be interesting to device an algorithm that decides call admission according to the observed statistics, such as the concatenated frame size, the channel conditions, etc.

1 illus, 14 ref

009524   Geetha R;Thamarai P;Kirankumar T V (ECE dep, Bharath Institute of Science and Technology, Chennai, Tamil Nadu, Email: geetha2004128@yahoo.co.in) : Low power fir filter architecture using accumulator based radix-2 multiplier. J Innovative Res Solut 2013, 1(2), 95-100.

Presents the low power FIR filter using accumulator based Radix-2 multiplier. It is mandatory or any filter designer to propose a low power multiplier as most of the power consumption of the filter occurs in multiplier unit. Hence, in this paper accumulator based Radix-2 multiplier has been proposed. Even though designing a FIR Filter is a traditional trend, achieving a low power in FIR Filter using enhanced low power technique is most concerned. The proposed multiplier achieves less power and critical path delay is low than conventional multiplier architecture. The power consumed by the adder structure is also very significant while designing a low power filter. It is found that for a 8 bit input the ripple carry adder consumes more power than carry look ahead adder. With proposed accumulator based radix-2multiplier unit and carry look ahead adder, the designed FIR Filter consumes low power than the conventional filter . The design is implemented on Altera cyclone II EP2C35F672C6.

3 illus, 1 table, 12 ref

009523   Dhaya R;Sadasivam V;Kanthavel R (Information Technology Dep, National Engineering College, Kovilpatti-628 503, Email: dhayavel@yahoo.co.in) : Consistent steering system using SCTP for bluetooth scatternet sensor network. J Instn Engrs : Ser B 2012, 93(4), 267-70.

Wireless communication is the best way to convey information from source to destination with flexibility and mobility and Bluetooth is the wireless technology suitable for short distance. On the other hand a wireless sensor network (WSN) consists of spatially distributed autonomous sensors to cooperatively monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, motion or pollutants. Using Bluetooth piconet wireless technique in sensor nodes creates limitation in network depth and placement. The introduction of Scatternet solves the network restrictions with lack of reliability in data transmission. When the depth of the network increases, it results in more difficulties in routing. No authors so far focused on the reliability factors of Scatternet sensor network's routing. This paper illustrates the proposed system architecture and routing mechanism to increase the reliability. The another objective is to use reliable transport protocol that uses the multi-homing concept and supports multiple streams to prevent head-of-line blocking. The results show that the Scatternet sensor network has lower packet loss even in the congestive environment than the existing system suitable for all surveillance applications.

5 illus, 13 ref

009522   Chithik Raja M (NO, Mekelle Univ, Ethiopia) : Multicasting in delay tolerant networks: semantic models and routing algorithms. Int J Inf Process 2011, 5(2), 59-72.

Delay tolerant networks (DTNs) are a class of emerging networks that experience frequent and long-duration partitions. These networks have a variety of applications in situations such as crisis environments and deep-space communication. In this paper, we study the problem of multicasting in DTNs. Multicast supports the distribution of data to a group of users, a service needed for many potential DTN applications. While multicasting in the Internet and mobile ad hoc networks has been studied extensively, due to the unique characteristic of frequent partitioning in DTNs, multicasting in DTNs is a considerably different and challenging problem. It not only requires new definitions of multicast semantics but also brings new issues to the design of routing algorithms. In this paper, we propose new semantic models for DTN multicast and develop several multicast routing algorithms with different routing strategies. We present a framework to evaluate these algorithms in DTNs. To the best of our knowledge, this is the first study of multicasting in DTNs. Our objectives are to understand how routing performance is affected by the availability of knowledge about network topology and group membership and to guide the design of DTN routing protocols. Using NS2 simulations, we find that efficient multicast routing for DTNs can be constructed using only partial knowledge. In addition, accurate topology information is generally more important in routing than up-to-date membership information. We also find that routing algorithms that forward data along multiple paths achieve better delivery ratios, especially when available knowledge is limited.

7 illus, 1 table, 24 ref

009521   Bavithiraja S V M G;Radhakrishnan R (CSE Dep, CMS College of Engineering and Technology, Coimbatore-32, Email: bavithra2000@yahoo.co.in) : Adaptive routing protocol for broadcasting in mobile Ad Hoc networks. Int J Inf Process 2011, 5(2), 46-58.

Reliable Broadcasting in mobile ad hoc networks requires delivery of messages from different sources to all the nodes of the network within bounded time. The nodes are highly mobile and the network is highly dynamic. Most of the existing routing protocols in MANET have the assumption that a path exists between the sender and the receiver. But the decentralized mobile ad hoc network is characterized by frequent network partitions. A new routing protocol is proposed for broadcasting using context-awareness. The protocol is based on the idea of exploiting nodes as carriers of messages among network partitions to achieve delivery. The choice of the best carrier is made using Kalman filter based prediction techniques and utility theory.

5 illus, 1 table, 12 ref

009520   Ashish Kumar;Chauhan S S;Sarje A K (IIT Roorkee, Indian Institute of Technology Roorkee, Roorkee-247 667, Email: luck.ashish@gmail.com) : Segmented average-sufferage heuristic for QoS based independent task scheduling in grid. Int J Inf Process 2011, 5(2), 38-45.

Task scheduling is one of the most sought research topic in grid computing. It is more complicated the varying characteristics like processing power, hardware configurations, operating systems, etc., of grid resources. The dynamic nature of grid resources also imposes constraints in scheduling. In this paper, we present a QoS based task scheduling heuristic Segmented Average-Sufferage. This heuristic is for heterogeneous independent task scheduling in grid. The heuristic first divides the tasks in two QoS groups: high and low. In each group the heuristic divides the task in number of segments. This segmentation helps in better load balancing. We have evaluated this heuristic using GridSim. The results of makespan. resource utilization and load balancing are obtained and compared with the results of Segmened Avg-Sufferage, Min-Min, Max-Min and Sufferage heuristics. The results are far better than other heuristics.

3 illus, 5 tables, 10 ref

009519   Arjunan R V;Vijaya Kumar V (NO, Manipal Institute of Technology Manipal Univ, Karnataka) : Adaptive spatio-temporal filtering for video denoising using integer wavelet transform. Int J Inf Process 2011, 5(2), 73-9.

Spatial video denoising using wavelet transform has been focussed as it requires less computation and more suitable for real-time applications. Two specific techniques for spatial video denoising using wavelet transform are considered in this work, 2D Discrete Wavelet Transform (2D DWT) and Integer wavelet transform. Each of these techniques has its advantages and disadvantages. The first technique gives less quality at high levels of noise but consumes less time while the second gives high quality video while consuming long. In this work, we introduce an intelligent denoising system that makes a trade-off between the quality of the denoised video and the time required for denoising. The simulation results show that the proposed system is more suitable for real time applications where the time is critical while giving high quality videos especially at low to moderate levels of noise.

1 illus, 1 table, 15 ref

009518   Archana Nair S;Samuel P (Computer Science Dep, School of Engineering, Cochin Science and Technology Univ, Cochin-682 022, Email: aarcha85@gmail.com) : Counter based termination detection algorithm for mobile Ad Hoc systems. Int J Inf Process 2011, 5(2), 80-8.

Detecting the termination of a computation when the nodes are mobile and ad hoc is a challenging task. Presents a new termination detection algorithm in mobile ad hoc environment and try to detect the termination in presence of faulty nodes. In an ad hoc environment there is a need for frequent establishment of connections. A parent node may become disconnected before getting an idle report from the child node. In our proposed algorithm the termination message is propagated independent of the connectivity to the parent node. In addition the algorithm detects a weak termination in the presence of faulty nodes. It also permits restarting of the failed nodes. A counter based scheme is applied to detect the terminated status. Another unique advantage of the algorithm is that there is no restriction to network topology.

3 illus, 2 tables, 30 ref

009517   Ali M M;Lakshmirajamani (NO, , CSE Dep, College of Engineering and Technology Osmania Univ, Email: mahmoodedu@gmail.com) : APD: ARM phishing detector a system for detecting phishing in instant messengers. Int J Inf Process 2011, 5(2), 22-30.

Phishing is the major problem in Instant Messengers, one is able to disclose sensitive information, including personal information, fact, or even patterns that are not supposed to be disclosed, the simplistic solution to address the problem of privacy in Instant Messengers (IM) is presented. Online criminals have adapted traditional fraudulent schemes like phishing in electronic form. Increasingly, such schemes target an individual's IM, where they mingle among, and are masked by, honest communications. The targeting and conniving nature of these schemes are an infringement upon an individual's personal privacy, as well as a threat to personal safety. In order to focus on privacy preserving the proposed APD (Anti Plusher Detection) system embeds association rule mining technique in IM's to detect phishing. There are many techniques developed to tackle e-mail phishing. But. a very little research literature on phishing in Instant Messengers where the location of a user is often unknown to users. This is one of the motivating factor for the research project described using data mining technique.

7 illus, 2 tables, 7 ref

009516   Ahmad M;Farooq O (Computer Engineering Dep, Faculty of Engineering and Technology, Jamia Millia Islamia, New Delhi-110 025, Email: musheer.cse@gmail.com) : Chaos and wavelets based image encryption. Int J Inf Process 2011, 5(2), 13-21.

An image encryption algorithm based on chaos and discrete wavelet transform is proposed. The plain-image is first transformed to wavelet domain and low frequency band is decomposed into non-overlapping blocks of DWT coefficients. A novel Block-Based Scrambling (BBS) using 2D Cat Map is performed in DWT domain. BBS scrambling is implemented by considering with a large block size and the blocks size is gets reduced iteratively at each level of scrambling. The scrambling of blocks is performed at multiple levels to get cumulative effect. Moreover, the control parameters of scrambling are randomly generated at each level through 2D coupled Logistic map to make scrambling process key dependent. The scrambled image obtained after carrying out DWT is encrypted using chaotic sequence generated by one-dimensional Logistic map. The experimental results show that algorithm has large key space and high sensitivity to secret keys. The simulation analysis also demonstrates that the ciphered images have high information entropy, very low correlation coefficients and uniform gray level distribution.

4 illus, 4 tables, 24 ref

008383   Viswanathan P;Venkata Krishna P (NO, School of Information Technology and Engineering, VIT Univ, Vellore-632 014, Email: pviswanathan@vit.ac.in) : Cryptographic text watermaking in medical image with reversible property. Int J Inf Process 2011, 5(3), 74-80.

Medical information of patients are uploaded in internet requires more amount of time. The information may be easily pirated and grabbed by the hackers due online. One of the solutions to solve this problem is using watermarking and cryptography in a single system, which is proposed in this article. In this technique, first, the document of the patient is encrypted. The cipher is embedded in the medical image using bit wise operation with reversible property. Due to embedding, some of the details of the medical image may be corrupted, which can be recovered by using reversible property. The proposed algorithm provides high payload capacity, less computational complexity, security, validation, quality and privacy of the patient.

6 illus, 4 tables, 8 ref

008382   Vinit Kumar (NO, Institute of Library and Informaion Science, Bundelkhand Univ, Uttar Pradesh-284 128) : Exposing library catalogues to search engines. DESIDOC J Libr Inf Technol 2012, 32(6), 493-8.

Paper attempts to provide ways to reach out to the users by exploiting present day mighty web search engines. Present day library Web OPACs architecture does not really help search engine robots or crawlers to index the huge library data. By exploiting some of the best practices of information architects and webmasters, libraries can also open their huge data to the search engines and can get listed in the top results to get more visibility. This paper describes the problem of unfriendliness of library OPACs and the reasons behind this. The paper further suggests the use of sitemaps to expose the bibliographic records to search engines. Further by discussing the different options to create, upload, and submit the sitemaps to search engines, the paper moves to list some of the benefits and concludes by giving some future insights in this area.

14 ref