Publication

The e-Market Integrator is a Business to Business (b2b) Application designed to assiste in the process of Supply Chain Management. This is a J2EE Application, which makes use of the evolving Web Services standards to create an application, which integrates different system and allows them to work cooperatively to perform a product search. The technique discussed here resembles a b2c-shopping portal where Internet surfers key in a product name (which they are looking for); the site returns product details from many different online retailers. The major difference in this case is that even the customer end is going to be an automated process and data has to be exchanged in a format which is machine understandable. This is a prototype application, which aims to prove how J2EE along with new Open Source Libraries and Web Sphere Technology can be used to develop and deploy a solution to such a problem.

Document image analysis and recognition (DIAR) is the process of performing the overall interpretation of document images. These document images conform, to an implicit or explicit document structure, which may be viewed as a guiding by a model for the class of documents of interest. This model describes the physical relationships between the entities that make up the document. Character recognition is applied at the final level of this process to provide an encoding of the symbols contained in a logical entity such as a paragraph or table once the characters have been isolated by other stages. The variable error rate and lack of determination demands considerable error correction as well as interactive validation.

Document image analysis and recognition (DIAR) is the process of performing the overall interpretation of document images. These document images conform to an implicit or explicit document structure, which may be viewed as a guiding by a model for the class of documents of interest. This model describes the physical relationships between the entities that make up the document. Character recognition is applied at the final level of this process to provide an encoding of the symbols contained in a logical entity such as a paragraph or table once the characters have been isolated by other stages. The variable error rate and lack of determination demands considerable error correction as well as interactive validation.

The e-Market Integrator is a Business to Business (b2b) Application designed to assists in the process of Supply Chain Management. This is a J2EE Application, which makes use of the evolving Web Services standards to create an application, which integrates different system and allows them to work cooperatively to perform a product search. The technique discussed here resembles a b2c-shopping portal where Internet surfers key in a product name (which they are looking for); the site returns product details from many different online retailers. The major difference in this case is that even the customer end is going to be an automated process and data has to be exchanged in a format, which is machine understandable. This is a prototype application, which aims to prove how J2EE along with new Open Source Libraries and Web Sphere Technology can be used to develop and deploy a solution to such a problem.

The proposed system entitled "Analysis and Design of GPS based Target tracking system and Radar Target data" will help the pilot, test engineers and radar evaluation team in real time and during offline by means of analyzing the path of the target aircraft and HACK aircraft in desired map and will provide navigation specific parameters such as latitude, longitude, altitude, speed, range etc., The system will save the target information during flight. The system will work in both online and offline mode. In this system the data is received from two independent systems (i) GTTS: Target information is received from the data modem and (ii) RADAR: Target information tracked by the RADAR available on MIL-STD-1553Bus. Using GTTS and RADAR data, the flight position of the targets is calculated and the path of the flight is shown on the map. This system also provides different zoom in and zoom out features for different map selection. � 2006 IEEE.

Palmprint verification system using Biometrics is one of the emerging technologies, which recognizes a person based on the principle lines, wrinkles and ridges on the surface of the palm. These line structures are stable and remain unchanged throughout the life of an individual. More importantly, no two palmprints from different individuals are the same, and normally people do not feel uneasy to have their palmprint images taken for testing. Therefore palmprint recognition offers a promising future for medium-security access control systems. In this paper, a new approach for personal authentication using hand images is discussed. Gray-Scale palm images are captured using a digital camera at a resolution of 640�480. Each of these gray-scale images is aligned and then used to extract palmprint and hand geometry features. These features are then used for authenticating users. The image acquisition setup used here is inherently simple and it does not employ any special illumination nor does it use any pegs that might cause any inconvenience to users. Experimental results show that the designed system achieves an acceptable level of performance.

A framework is designed for an ad hoc network, which is a matrix of cells of equal size and are connected in taurus structure. Each cell is of equal size and there are 100 of them and contains number of nodes. The cells are connected in taurus to make the simulation space infinite i.e. if the nodes wanders off the boundary of one side then it appears at the opposite side, this guarantee that all the nodes will participate in the entire simulation. For this a parallel simulator is designed considering routing protocols. � 2006 IEEE.

In this paper, I have provided the user with adequate parameters of the various industries belonging to United States so that using these parameters the user can safely invest in an industry, which has a bright future and provides rich dividends on his investment. With this system, the user can predict the values of certain parameters, which can serve as a guideline to indicate the state of that particular industry at present and in the future. � 2007 IEEE.

Wind speed prediction in short term is required to asses the effect of wind on different objects in action in free space, like rockets, navigating ships and planes, guided missiles satellites in launch etc. Forecasting also helps in usage of wind energy as an alternative source of energy in Electrical power generation plants. The wind speed depends on the values of other atmospheric variables, such as pressure, moisture content, humidity, rainfall etc. This paper reports a Support Vector Machine model for short term wind speed prediction. The model uses the values of these parameters, obtained from a nearest weather station, as input data. The trained model is validated using a part of data. The model is then used to predict the wind speed, using the same meteorological information.

The proposed system entitled "Target Detection and Offline analysis of RADAR data from MIL-STD-1553B" will detect the target, plots the position on the screen and help the pilots, test engineers and RADAR evaluation team during offline. The path of the TARGET and HOST/HACK aircrafts are analyzed along with navigation specific parameters. The system has the mechanism to save the HOST/HACK and TARGET information during flight. The system will also work in on-line mode. During the on-line mode the TARGET information is detected by the RADAR and is available on MIL-STD-1553B Bus. Using the Bus Monitor (BM) mode the relevant data is extracted. Using this data the flight position of the TARGET aircrafts are calculated. In off-line the recorded data's are used to calculate the positions of the aircrafts and the paths of the aircrafts. It is plotted on the map in a graphical window. All the navigation details of the aircraft are displayed on a tote window for RADAR data analysis purpose.

A novel scheme for the embedding XML file in a 24bit BMP color image using steganographic technique is presented in this paper. The Lab color space is used instead of the RGB color space which is found to be more suitable for watermarking application. The XML file that is to be embedded is encrypted by providing a password and decrypted during watermark detection phase. The watermark detection process is fast and the embedded XML file is extracted from the watermarked color image which neither requires the original image nor the embedded XML file. Using this application user can easily watermark the image and hide the XML file in to the image. The usage of Lab technique has the advantage that the watermarked image file is imperceptible to human eye. � 2008 IEEE.

This paper describes a multi-agent methodology for the prediction of physical crime and cyber crime. The model uses clustering algorithms to determine the number of agents in the environment. The preference of each of these agents is determined by feature selection. The agents are allowed to interact in a synthetic environment. The results of the interactions are measured and the model is updated with new information. This modeling approach holds significant promise for the simulation of human criminal behavior. � 2007 IEEE.

In this paper, the development of Kannada Optical Character Recognition (OCR) is discussed. In the process of development the preprocessing, segmentation, Character Recognition and Postprocessing modules were detailed in this paper. Since all most all the characters are in curve sharp, noncursive the segmentation, Character Recognition and Post Processing is not easy for Kannada Script. Post Processing technique uses a dictionary based approach in order to increase the OCR output. At the end of this paper we have also discussed the Syntactical Analysis of Kannada Script. It is the analysis of grammatical errors in the language for kannada script. � 2008 IEEE.

Numerous graph-based frequent pattern mining algorithms have been developed in the past. Identifying frequent structures involves locating sub graphs that occur frequently over the entire set of graphs. In this paper an experimental comparison of two graph-based algorithms for identifying frequent structures in semi-structured data has been presented and discussed in this paper. The SEuS algorithm for recognizing frequent structures has been explored and the results are compared with the SUBDUE algorithm. An analysis of the experimental results indicates that pin pointing frequent structures in a huge graph using SEuS algorithm is faster compared to the SUBDUE algorithm. The computational complexity oflocating frequent structures in SEuS algorithm has been overcome using a summary data structure which prunes the search space. � 2009 ISSN.

Steganography is the art of concealing the existence of information within seemingly harmless carriers. It is a method similar to covert channels, spread spectrum communication and invisible inks which adds another step in security. A message in cipher text may arouse suspicion while an invisible message will not. A digital image is a flexible medium used to carry a secret message because the slight modification of a cover image is hard to distinguish by human eyes. In this paper, we propose a revised version of information hiding scheme using Sudoku puzzle. The original work was proposed by Chang et al. in 2008, and their work was inspired by Zhang and Wang's method and Sudoku solutions. Chang et al. successfully used Sudoku solutions to guide cover pixels to modify pixel values so that secret messages can be embedded. Our proposed method is a modification of Chang et al's method. Here a 27 X 27 Reference matrix is used instead of 256 X 256 reference matrix as proposed in the previous method. The earlier version is for a grayscale image but the proposed method is for a colored image. � 2009 IEEE.

[No abstract available]

In this paper, we consider the problem of routing and wavelength assignment (RWA) in all-optical Wavelength Division Multiplexing (WDM) networks, where signals propagate in the optical domain (with no electrical regeneration) from end-to-end. We design and implement a quality of transmission aware routing algorithm for online traffic in all-optical WDM networks. In transparent optical networks the quality of a transmission degrades due to physical layer impairments. In an optical network, a connection is set up to carry a data signal via an all-optical channel (lightpath) from its source to destination node. The optical signal transmitted along the lightpath may need to travel through a number of crossconnect switches (OXCs), optical amplifiers, and fiber segments. While the signal propagates toward its destination, the optical components would continuously degrade the signal quality by inducing impairments. When the signal degradation is so severe that the received bit-error rate (BER) becomes unacceptably high, the lightpath would not be able to provide good service quality to a connection request. Such a lightpath, which has poor signal quality due to transmission impairments in the physical layer, should not be used for connection provisioning in the network layer. To serve a connection, the proposed algorithm finds a path and a free wavelength (a lightpath) that has acceptable signal quality performance by estimating a quality of transmission measure, called the Q factor. We take into account channel utilization in the network, which changes as new connections are established or released, in order to calculate the noise variances that correspond to physical impairments on the links. The quality of transmission routing algorithm finds a set of so called non-dominated Q paths from the given source to the given destination. Various objective functions are then evaluated in order to choose the optimal lightpath to serve the connection. � 2010 IEEE.

The World-Wide-Web (WWW) is growing exponentially and has become increasingly difficult to retrieve relevant information on the web. The rapid growth of the WWW poses unprecedented scaling challenges for general purpose crawlers and search engines. In this paper we describe a new hypertext resource discovery system called topic specific crawler. The goal of this crawler is to selectively seek out pages that are relevant to a predefined set of topics, rather than collecting and indexing all accessible web documents to be able to answer all possible ad-hoc queries. A topic specific crawler analyses its crawl boundary to find the links that are likely to be most relevant for the crawl. This leads to significant savings in hardware and network resources, and helps keep the crawl more up-to-date. �2010 IEEE.

We address the problem of Kannada character recognition, and propose a recognition mechanism based on k-means clustering. The large dataset of Kannada characters and their similarity makes the problem one order of magnitude more difficult than for a standard language like English. We propose a segmentation technique to decompose each character into components from 3 base classes, thus reducing the magnitude of the problem. k-means provides a natural degree of font independence and this is used to reduce the size of the training database to about a tenth of those used in related work. Consequently, recognition proceeds an order of magnitude faster. We present accuracy comparisons with related work, showing the proposed method to yield a better peak accuracy. We also discuss the relative merits of probabilistic and geometric seeding in k-means. �2010 IEEE.

Current technology trend is to implement multiple solutions in a single device. The devices like Stateful Inspection firewalls and Load balancers use session tables to maintain the session information. They also run traffic analyzers like NetFlow which are separate modules running on these devices. In this paper, we propose a design where session table and other existing processes can be effectively used to achieve the functionality of NetFlow. �2010 IEEE.