Harshad B. Prajapati

Analytical study of parallel and distributed image processing

The available literature on parallel and distributed image processing is scattered and not organized for use to beginners. Thus, there is a need of concise understanding of parallel and distributed image processing area. In this paper, we present analysis of parallel and distributed image processing with comprehensive details, so that it becomes very useful to beginners and to those who are new to parallel or distributed image processing field. We present the outcome of our study of parallel and distributed image processing with emphasis on mechanisms, tools/technology/API used, application domains, and ongoing research work. We examine the research issues in parallel and distributed image processing. We also identify some future research directions for distributed image processing. This study provides concise understanding of the parallel and distributed image processing area to the beginners.

Soft computing based intelligent grid architecture

Workflow generation, resource management, and scheduling of workflow are three main components of grid based computing architecture. The components in traditional grid architecture require human intervention due to lack of intelligence and use of knowledge from historical data. We have identified the need of intelligence based automatic workflow generation, and the prediction on run-time of tasks for optimal allocation and reservation of resources. We propose soft computing based architecture of intelligent grid. We also propose the neural network based algorithmic flow for the resource matchmaking, the allocation and reservation, and the scheduling of workflow. Our proposed architecture and algorithmic flow does not require human intervention in workflow generation and in finding and allocating optimal resource for task execution. As our proposed work provides flexibility and reduces complexity in workflow generation, it saves the valuable time and cost of user.

Cutting stock problem: A survey of evolutionary computing based solution

The cutting stock problem (CSP) is an important problem in class of combinatorial optimization problems because of its NP-hard nature. Cutting of the required material from available stock with minimum wastage is a challenging process in many manufacturing industries such as rod industry, paper industry, textile industry, wood industry, plastic and leather manufacturing industry etc. The objective of this paper is to present a comparison of various meta-heuristic techniques for solving cutting stock problem based on accuracy and speed of convergence. It also focuses on new chromosome representation using co-operative co-evolutionary Genetic Algorithm (CCEGA) for multiple stock size cutting stock problem (MSSCSP). The main challenge in solving cutting stock problem is to develop chromosome representation for MSSCSP in GA. Moreover, this paper also presents detailed study of the existing chromosome representations for CSP problem with their loopholes and summary of the referred papers based on meta-heuristic techniques. To overcome these loopholes, we finally present the cutting pattern based chromosome representation using co-evolutionary GA.

Classification of printed Gujarati characters using som based k-Nearest Neighbor Classifier

This paper presents a method for combining Self Organizing Map (SOM) with k-Nearest Neighbor Classifier (k-NN) to device an elegant classification technique and applying it for classification of subset of printed Gujarati characters. Many researchers have employed many different models for the classification of printed/handwritten characters for number of different languages all over the globe; few of the widely used classifiers are Template Matching, Artificial Neural Network (ANN), Hidden Markov Model (HMM), and Support Vector Machine (SVM) etc. Our attempt is to use SOM based k-NN classifier for classification of subset of printed Gujarati characters. This approach does not require prior feature identification stage hence it is faster and more generalize compare to other approaches. A prototype system is implemented for the same and tested on sufficient dataset. Average accuracy of 82.36% is reported on test dataset.

High Quality Web-Application Development on Java EE Platform

Quality of web-applications plays major role in its success. And the high quality web-application is really possible by following high quality web engineering process. The use of strong web-application architecture with strong development platform not only make web-applications robust and of high quality but also give web-application an ability to meet changing and demanding customer requirements in efficient manner. A Model View Controller (MVC) design pattern has remained fundamental architectural design pattern even after great evolution in architectures of user interactive applications. In this paper, we discuss the support for achieving quality attributes for the web-application, the support for web-application development process and the support for meeting demanding features of web application on Java EE platform. This contribution will help a lot for small scale as well as large scale web-application development and for moulding web-application into a futures high quality finished product from inception phase itself.

Advance Reservation based DAG Application Scheduling Simulator for Grid Environment

the last decade, scheduling of Directed Acyclic Graph (DAG) application in the context of Grid environment has attracted attention of many researchers. However, deployment of Grid environment requires skills, efforts, budget, and time. Although various simulation toolkits or frameworks are available for simulating Grid environment, either they support different possible studies in Grid computing area or takes lot of efforts in molding them to make them suitable for scheduling of DAG application. In this paper, design and implementation of GridSim based ready to use application scheduler for scheduling of DAG application in Grid environment is described. The proposed application scheduler supports supplying DAG application and configuration of Grid resources through GUI. An implementation of Min-Min static scheduling algorithm for scheduling of DAG application is also described to validate the proposed scheduler. The proposed DAG application scheduling simulator is useful, easy, and time-saver.

An ELFN-based adaptive probing strategy to improve TCP performance in ad hoc networks

TCP performance degrades considerably in ad hoc network due to its distinguishing characteristics, such as high channel error rate and link failure. Various schemes have been proposed to improve TCP performance in ad hoc network. ELFN (Explicit Link Failure Notification) is one of mechanisms to handle link failures with ceasing TCPpsilas exponential back-off behavior. Though ELFN improves TCP performance considerably, it uses fixed probing technique to check link status. Hence performance of TCP with ELFN depends on probing interval. In this paper, we propose an ELFN-based adaptive probing strategy that eliminates problem due to fixed probing interval. This strategy uses rapid probing initially so as to continue use of channel when link failure is due to channel contention. Our simulation results, using ns-2 simulator, indicate that the adaptive probing can handle link failures in better way, and improves TCP performance considerably.

XML based architectures for documents comparison, categorisation, and scrutinisation

Three document processing operations: comparison, categorisation, and scrutinisation are fundamental problems in any organisation that bases its business operations on electronic documents. We propose XML based architectures for documents comparison, categorisation, and scrutinisation. We also discuss all the components that are used in constructing these architectures. Moreover, we implement these proposed architectures to validate the application of XML technology in document processing operations. We found motivating results from these three architectures for selected applications. Our proposed architectures have potential for solving problems related to automated resume comparison system, automated matrimonial match-maker system, automated tender selection, automated resume scrutinisation system, and so on.

Cutting stock problem: A solution based on novel pattern based chromosome representation using modified GA

The cutting stock problem (CSP) is an important problem in class of combinatorial optimization problems because of its NP-hard nature. Cutting the required material from available stock with minimum wastage is a challenging process in many manufacturing industries such as rod industry, paper industry, textile industry, wood industry, plastic and leather manufacturing industry etc. This objective of this research work is to Propose Novel Pattern based chromosome representation using Modified Genetic Algorithm for multiple stock size cutting stock problem (MSSCSP) and Single stock size cutting stock problem (SSSCSP). The main challenge in solving cutting stock problem is to develop chromosome representation for MSSCSP in GA. Moreover, this paper Test results on 20 large dataset with LP, EP and Two-swap algorithm. Our Propose algorithm gives better results than LP in MSSCSP, EP in SSSCSP and Two-swap algorithm in SSSCSP.

Design of contract net protocol-based distributed image processing system

In the current era of large scale distributed computing, users voluntarily donate computation power of their idle computers or desktop machines. However, there is an urgent need of a utility-based distributed problem solving environment to attract more users. Related to applying the utility concept, we are working on design and implementation of a distributed image processing system that uses: 1 contract net protocol for task assignment; 2 concept of utility-based distributed computing; 3 task graph concept for application design. In this paper, we present our results of the design aspects of the system. We propose the design of contract net protocol-based distributed image processing system and analyse characteristics of the proposed system. We evaluate and select available options for implementation of the system. The proposed system allows transparent execution of task graph-based applications in a distributed environment.