Jagdish Chandra Patni

Blind Watermarking Technique for Grey Scale Image Using Block Level Discrete Cosine Transform (DCT)

This paper presents a robust watermarking technique to copyright an image. Proposed technique is totally based on DCT and is different from most of the available techniques.We are embedding blockwise watermark against the noise, filtering and cropping attack. Before embedding the watermark for any host image we must calculate the gain factor. According to our approach gain factor will vary for two different host images . The experimental results show that in addition the invisibility and security, the scheme is also robust against signal processing.

Blind watermarking technique for greyscale image using DCT and 1-D Walsh coding

This paper presents a robust watermarking technique to copyright an image. Proposed technique is totally based on DCT and is different from most of the available techniques. Watermark is embedded block-wise into the image to protect the ownership against the ltering, cropping and noise attack. Before embedding the watermark we are converting it into Walsh coded watermark [1]. In proposed approach there will be a variation in gain factor two different host images. The experimental results show that the proposed approach ensures invisibility, security and robustness against signal processing.

Distributed load balancing model for grid computing environment

Workload information management and resource management are two key aspects in grid computing to provide the better services to grid environment users. Grid computing also faced other challenging areas like heterogeneous nature of resources, huge number of computing elements, independency of computing resources, different processing capacities of the nodes, different types of load conditions, overloading of jobs at computing nodes, underutilized of resources, etc. A distributed load balancing algorithm is proposed that can handle any kind of grid structure. The proposed algorithm is divided into two steps: To reduce the time taken for executing the jobs or we can say reduce the response time and communication cost between transferring the jobs from one computing node to another in a grid architecture. In proposed algorithm it is shown that the load will be primarily balanced at local level to reduce the communication cost.

A Dynamic and Optimal Approach of Load Balancing in Heterogeneous Grid Computing Environment

Grid computing is some sort of distributed computing which shares the resources, processor and network in the organization or between the organizations for accomplish task. It involves huge amounts of computational task which require resource sharing across multiple computing domains. Resource sharing needs an optimal algorithm; to enhance the performance we should focus on how to increase the global throughput of computational grid. Load balancing in grid which distributes the workloads across various computing nodes to achieve optimal resource utilization, reduce latency, maximize throughput and to avoid any node by overload and under load. Several existing load balancing methods and techniques only interested in distributed systems those are having interconnection between homogeneous resources and speedy networks, but in Grid computing, these methods and techniques are not feasible due the nature of grid computing environment like heterogeneity, scalability and resource selection characteristics. To consider the above problem we need to develop such an algorithm which optimally balances the loads between heterogeneous nodes. It is based on tree structure where load is managed at different levels such as neighbor-based and cluster based load balancing algorithms which reduces complexity can and less number of nodes required for communication during load balancing.

Comparison of Runtime Performance Optimization Using Template-Metaprogramming

Programs capable of generating code are known as meta-programs and the technique of writing these programs is known as meta programming Meta programming is supported by various programming languages such as C#, where reflection is used; Ruby allows defining classes and methods at runtime using meta-programming; the first language to introduce the concept of meta-programming was LISP. The meta-programs written using these languages are generally parsers, theorem proofs and interpreters. In this paper, we’ll be demonstrating the use of meta-programming in C++ through template meta-programming (TMP). We pick up common mathematical operations, creating a run time code of them along with a compile time based equivalent code done through TMP. The two set of codes are then benchmarked on the basis of their execution time and a bar-graph is generated to compare the TMP and non-TMP programs.

Distributed approach of load balancing in dynamic grid computing environment

Workload management and resource management are two key aspects in grid computing to provide the better services to grid environment users. Grid computing involves a number of challenges like heterogeneous nature of resources, large number of computing elements, independency of computing resources, different processing capacities of the nodes, different load conditions, overloading of jobs at computing nodes and underutilised resources, etc. In this paper, a distributed grid and dynamic load balancing algorithm is proposed using the forest-based model of the grid structure. The problem of heterogeneity of the resources (the individual node is independent from the physical architecture of a grid) has also been taken into account. In the proposed approach all the computing nodes are connected with a group manager in a group and request to group manager for resource allocation. The group manger is responsible for balancing the workload within the group. In case of non-availability of the resources within the group, the group manger communicates with the other adjacent groups. It has been shown that proposed algorithm firstly balance the load at local level and then goes to the grid level, which results in reduced response time and communication cost.

Capital market forecasting by using sentimental analysis

When a customer invests into a stock market, he wants to attain higher profits in short period of time but with less amount of knowledge he has, this process gets very difficult. This situation often creates more losses to customers rather than profit which is fatal for their wealth. This economically dangerous position can be overcome with proper planning, proper management, apt amount of knowledge of market and useful analysis of previous data. The markets can be studied using their previous years of data and therefore predicting future trends. Market is also affected by market sentiment at a particular moment and if customer is aware of it, then he can take appropriate decisions regarding purchasing and selling of stocks in market. In this paper, we are going to demystify the stock market to help the customers to get better idea of upcoming market trends, polarity of stocks and present market sentiment in regards to the company he is investing.

CloudBox — A virtual machine manager for KVM based virtual machines

The project aims to develop a professional Virtual Machine Manager for the KVM hypervisor. It will be a libvirt-based Web Interface for managing virtual machines. It allows creating and configuring new domains, and adjusting a domains allocation of the underlying hardware resources. A VNC viewer will present a full graphical console to the end-users in the guest domain. To work with this service you will need the OS Linux and Web browser with installed VNC client plugin. An intuitive web interface, any system administrator can handle it with basic qualifications. The service will work with a data encrypted network connection. The Service has access only to the KVM hypervisor via the libvirt library and not to the entire OS, which improves the security of the server. End-user will have the full control of the virtualization and the virtualised hardware resource. Creating, installation, shutdown, snapshots — all this and more features are incorporated with in the virtual machines. All actions are logged. Also security features based on IAM and secure data transmission between users and the server will be incorporated in the VM manager.

E-COCOMO: An effort estimation model for cleanroom software development approach

The integration of mathematical modelling, proof of correctness and statistical software quality assurance lead to extremely high-quality software. The integration was named as cleanroom software engineering. It proof the correctness of the deliverables of each phase, Instead of the classic analysis, design, code, test, and debug cycle, the cleanroom approach suggests a different point of view. Due to the evolution in development methodology there is a strong need of evolution in estimation models also. In this work we have proposed the new cost estimation model. The evolved model is proposed for the new development methodologies and includes some more factors for estimation used in these new approaches.

Dynamic load balancing model for layered grid architecture

Rapid growth of internet and other technologies seems more challenging to develop the high speed networks with powerful capabilities in lower computational cost. To cover the above problem grid computing has emerged rapidly. The previous technologies such as distributed computing cluster computing, parallel computing, etc., facing the problem of space utilization. Using Grid Computing technologies the distributed resources can be accessed or used situated around the world without any geographical limitations. Algorithms developed earlier basically focused on homogenous set of computing nodes having homogenous network with higher computational speed. In this paper we are addressing the problem of adaptability, scalability and heterogeneity that creates grid computing environment more challenging. Here covered the important aspects of grid computing; scalability heterogeneity, and allocation of resources dynamically. The proposed multilevel tree architecture that is Hierarchal; Covers scalability and heterogeneity of the resources All the computing resources are independent from the architecture of grid.