Computer Engineering

Since the number of server providing the facilities for the user is usually more than one, the authentication protocols for multi-server environment are required for practical applications. Most of password authentication schemes for multi-server environment are based on static ID, so the adversary can use this information to trace and identify the user's requests. It is unfavorable to be applied to special applications, such as e-commerce. In this paper, we develop a secure dynamic ID based remote user authentication scheme to achieve user's anonymity. The proposed scheme only uses hashing functions to implement a robust authentication scheme for the multi-server environment. It provides a secure method to update password without the help of third trusted party. The proposed scheme does not only satisfy all requirements for multi-server environment but also achieve efficient computation. Besides, our scheme provides complete functionality to suit with the real applications.

Today huge amount of data are transforms over the network connected to internet. In recent day many social networking site, electronic mail, trades website etc. exchange information in term of audio, video, image, text. Here more concern is that how to secure such type of data from the various intruders. There are various algorithm is used to provide security from unauthorized of data over the network. The term cryptography is the technique to exchange the plain text (sender message) into cipher text (encoded form) and then convert it encoded message back into original message. Symmetric cryptographic is one of the cryptographic techniques where sender and receiver generate a common key that is used to encrypt and decrypt the message. Here, introduce a new emerging Geometry based Cryptography approach in the field of symmetric cryptography. In this technique used a 2-D clockwise Rotation and performs transformations such as on the object matrix to obtain cipher text. The basic idea behind this paper is that focuses on the symmetric key Cryptography approach, using the concepts of clockwise 2D-rotation of object and find out an algorithm that provide the better accuracy and security over the basic encryption algorithm. 

In this paper we describe some recent developments that have taken place in still image compression. We addresses about different compression techniques and also give a performance comparison. Functionality and principles of compression algorithms are discussed in a unified manner. This survey reviews more recent articles on image compression and discuss their role in current research directions. There are several image compression algorithms some of them are lossy and some of them are lossless. Thus medical image, pre press industry, art work, remote sensing images for lossless image compression.

Due to the Internet’s sheer size, complexity, and various routing policies, it is difficult if not impossible to locate the causes of large volumes of BGP update messages that oc-cur from time to time. To provide dependable global data delivery we need diagnostic tools that can pinpoint the ex-act connectivity changes. In this paper we describe an al-gorithm, called MVSChange, that can pin down the ori-gin of routing changes due to any single link failure or link restoration. Using a simplified model of BGP, called Sim-ple Path Vector Protocol (SPVP), and a graph model of the Internet, MVSChange takes as input the SPVP update messages collected from multiple vantage points and accu-rately locates the link that initiated the routing changes. We provide theoretical proof for the the correctness of the design.

Image segmentation is an essential but critical component in low level vision image analysis, pattern recognition, and in robotic systems. It is one of the most difficult and challenging tasks in image processing which determines the quality of the final result of the image analysis. Image segmentation is the process of dividing an image into different regions such that each region is homogeneous. The problem of segmenting the image and/or the video content into meaningful pieces of information is of crucial importance for further steps such as 3-D shape reconstruction, object and event recognition, etc. Video segmentation is different from segmentation of a single image. While several correct solutions may exist for segmenting a single image, there needs to be a consistency among segmentations of each frame for video segmentation. Various image segmentation algorithms are discussed. Some examples in different image formats are presented and overall results discussed and compared considering different parameters.

The main cause of morbidity and mortality in modern society is heart disease. Medical diagnosis is important but complex task that must be carefully and effectively. Although considerable progress has been made in the diagnosis and treatment of heart disease, but research must reach the highest accuracy. Access to a large amount of medical data requires powerful tools for analyzing the resulting data to extract useful knowledge. Data mining is an effective analysis tool for discovering hidden relationships and trends in the data. This paper heart disease through data mining algorithm C & R, the algorithm K nearest neighbor algorithm to move the mass of particles (pso) and improved algorithms, k-nearest neighbor algorithm pso investigated. In this study, we improved the effectiveness of these algorithms see for heart disease. Thus we see that data mining can identify or predict high or low risk of heart disease.

The role of electronic equipments in the industry has increased tremendously in recent past. With new technologies and techniques being considered in other domains, such as automotive, multimedia communications, mobile applications bring down the cost of the electronic gadgets. As the cost factor controls the reliability and volume issues, there is a need for design and development of low cost, reliable technology for industrial applications. The proposed techniques have been modeled using Verilog HDL and the models have been verified using test benches with a functional coverage of 95%. The results obtained have been compared with MATLAB results, which are considered to be a benchmark. The HDL (Hardware Description Language) code is synthesized using Synopsys Design Compiler targeting 130-nanometer TSMC (Taiwan Semiconductor Manufacturing Company) library and target technology. The synthesized netlist obtained for all the adaptive filtering techniques proposed in this research work is taken through physical design flow consisting of Floorplanning, Placement and Routing steps. The results obtained at each step are simulated for the functionality. The final GDSII (Graphical Design Standard II) file is generated for the proposed techniques.. The floor planning, placement and routing of the netlist ensures that the overall size for the entire chip does not exceed by 7.2 square millimeters. The results obtained for adaptive filtering techniques have proven that the complexities in the industrial applications can be met if the design is implemented on ASIC.

The main purpose of this paper is to compare the performance of the Oracle VirtualBox and VMWare virtualization technologies. The study focuses on the performance of disk I/O, memory and CPU operations under virtualization infrastructures. This performance is measured by benchmarking tools like Iozone for disk I/O performance, RAMspeed for memory performance and UnixBench for CPU performance. Results of benchmarking tools will identify which technology is better than other and in what respect.

Problem faced by today’s communicators is not only security but also the speed of communication and size of content. Security in today’s world is one of the important challenges that people are facing all over the world in every aspect of their lives. In this paper a method is proposed in which the concept of compression and data encryption is used. In this first data is compressed to reduce the size of the data and increase the data transfer rate. Thereafter compress data is encrypted to provide security.

Wireless sensor networks are those that are used for the communication between various sensor nodes to the base station. Heterogeneity in such networks are used to manage the network deployment cost and the network traffic. A hierarchical cost effective LEACH (HCEL) protocol is proposed to enhance energy efficiency of the sensor nodes thereby maximizing the network performance without increasing the network deployment cost.In this paper, a heterogeneous network that comprise three types of sensor nodes are considered. A hierarchical network structure is formed where the data are forwarded by using “aggregators”. The clustering is done inorder to maximize the energy eficiency of the sensor nodes. The cost comparision is done between various protocols like seperateLEACH(SL), proposedLEACH(PL), seperateproposed(SP) and HCEL. The energy efficiency is derived by initiating the activity window interference. Simulation results show that the HCEL protocol derive a gradual decrease in the network deployment cost ratio in terms of powerful nodes and energy factor.