This paper proposes an Adaptive Cross-layer Mapping algorithm for Multi view Video Coding (ACM-MVC) over IEEE 802.11e Wireless Local Area Networks (WLANs). To support the varying Quality-of-Service (QoS) requirements of emerging applications, four access categories (ACs) have been defined in the IEEE 802.11e standard. Each AC has a different transmission priority, which implies the higher the transmission priority, the better the opportunity to transmit. In order to improve the transmission of video data over IP networks, the Multiview Video Coding (MVC) extension of the H.264/MPEG 4 AVC standard has been introduced. The MVC adopts the layered video scheme. The proposed mapping algorithm utilizes a cross-layer approach and dynamically assigns packets of different layers to one of the four ACs. The experiment results demonstrate that the proposed mapping algorithm achieves better QoS than the conventional methods such as the static mapping algorithm.

Keywords: Multiview Video Coding, cross-layer mapping, wireless network, QoS, Adaptive mapping, static mapping.

Breast cancer is one of the most dangerous types of cancer among women all over the world. Nowadays this disease is appearing commonly one in eight women. Early detection of breast cancer reduces life fatalities. This paper is to develop the system that analyze the diagnosis of breast cancer in digital mammogram using wavelet transforms.  Many treatment options are available if the breast cancer is detected early. In this project transforms are applied separately in digital mammogram to detect micro calcification clusters which is used to detect at an early stage.
Key Terms- fatalities, mammogram, micro calcification

The most significant feature of diagnostic medical images is to reduce Gaussian noise and salt and pepper noise which is commonly found in medical images and make better image quality. In recent years, technological development has significantly improved analyzing medical imaging. This paper proposes different hybrid filtering techniques for the removal of Gaussian noise, and salt and pepper noise  by topological approach. The filters are treated in terms of a finite set of certain estimation and neighborhood building operations. A set of such operations is suggested on the base of the analysis of a wide variety of nonlinear filters described in the literature.

Keywords: Digital topological neighborhood, brain tumor image, Gaussian noise,,saslt and pepper noise

A new method of word segmentation for document images is presented. The method uses the bounding box regions to enclose the letters (characters) of the words and then the resulting letter spaces are progressively filled to merge the character bounding boxes to get the word bounding boxes.  The method holds good for inclined and irregularly distributed words. The proposed method completely avoids the line segmentation process which normally precedes word segmentation in traditional methods.

Keywords— Bounding boxes, Connected components, Horizontal Dilation, Character spacing, Word bounding boxes, Word segmentation, Word spacing.

In the field of Web Mining more specifically Web Usage Mining an extraction of pattern sequence of navigations and session tracking of any user using Web Analysis Approach is difficult and along with the pattern sequence if we have to identify other details of any particular user like geographical location, IP address, name of web browser and operating system being used it become more tedious task. This paper introduces a new concept in which we would like to design an algorithm that will give detail about the pattern sequence of any user hitting a particular Web Applications along with other detail about that user like geographical location, IP address, name of web browser and operating system being used. This research work can be used in Market Analysis for the Web Application and its result will be helpful for different kind of advertisement for different segments of users for their different browser in Web Applications and Web Portals.

Keywords- Web Mining, Web Usage Mining, Web Analysis Approach, Pattern Sequence, Session Tracking, Geographical Location, IP Address, Browser, Operating System, Web Application, Web Portal.

 

Many theorists would agree that, had it not been for the unproven unification of 802.11b and IPv7, the simulation of I/O automata might never have occurred. After years of essential research into superblocks, we demonstrate the study of consistent hashing. In this work we use flexible methodologies to argue that Boolean logic and cache coherence can collude to address this quandary. This follows from the analysis of IPv7.

Keywords-IPv7; Internet Protocol version7, I/O; Input / Output, QoS; Quality of Service, component; formatting; style; styling; insert (key words)

 

Mobile ad-hoc networks (MANET) are characterized as networks without any physical connections. In these networks there is no fixed topology due to the mobility of nodes, interference, multipath propagation and path loss. Hence a dynamic routing protocol is needed for these networks to function properly. Many Routing protocols have been developed for accomplishing this task. MANET routing protocols can be categorized as Proactive or Table-driven Routing Protocols Reactive or On Demand routing protocols and Hybrid routing protocols. This paper presents the three types of routing protocols in MANET and makes a comparative discussion of the features of each type of that routing protocol.

Keywords— MANET, Ad hoc Networking, Routing, Routing Protocol.Introduction

 

Peer to peer technology plays an important role in spatial data sharing because of its distributed and decentralized nature.  In spatial P2P each peer stores a part of the available spatial information and runs software with equivalent functionality rather than through a central server. Spatial P2P is dynamic in nature where the network structure is always changing. Spatial objects are having distinct properties like identity, location and relationship among them and  spatial data is multidimensional. Spatial data sharing process like storing, querying and retrieving large amounts of data is a complex task. It requires the potential of preserving multidimensionality of heterogeneous spatial data without the time complexity and load balancing. It can be simplified if some intelligent  techniques  will  be  used.  The main objective of  this  paper  is  to  analyze  the process of preserving the locality and dimensionality of space in the network. It maintains the multidimensionality of the spatial data in grid approximation which is done by some  intelligent indexing technique  and searching .

Keywords-- Spatial data, P2P system

 

 

A major problem in noisy image processing is the effective segmentation of its components. In this paper, we are proposing a K - Medoid clustering algorithm for noisy image segmentation, which is able to segment all types of noisy images efficiently. As the presented clustering algorithm selects the centroids randomly hence it is less sensitive , to any type of noise as compare to other clustering algorithms. To prove this we will present experimental results on various images, effected by different noises, to demonstrate efficiency of the proposed method for segmentation of noisy image.

Keywords— Colour image segmentation, Image noise, PSNR, K - Medoids.

 

 

Cluster analysis has been widely used in several disciplines, such as statistics, software engineering, biology, psychology and other social sciences, in order to identify natural groups in large amounts of data. These data sets are constantly becoming larger, and their dimensionality prevents easy analysis and validation of the results. The subspace pattern mining has been tailored to microarray data clustering to find biclusters and triclusters. We focus on deterministic clustering algorithm: Triclusters, which can mine arbitrarily positioned and overlapping biclusters/triclusters. Depending on different parameter values, they can mine different types of clusters, including those with constant or similar row/column values, as well as scaling and shifting expression patterns. We also give a useful set of metrics to evaluate the clustering quality, and show their effectiveness on real data.

Keywords- Data mining, data analysis, clustering, biclustering, Triclustering .

 

 

Every years, the Internet and, by extension, the web gets bigger and better, As the Internet takes an increasingly central role in our communications infrastructure, the slow convergence of routing protocols after a network failure becomes a growing problem. To assure fast recovery from link and node failures in IP networks, we present a new recovery method called Multiple Routing Configurations (MRC). Our propose method guarantees recovery in all single failure scenarios, using a single mechanism to handle both link and node failures, and without knowing the root cause of the failure. MRC is based on keeping additional routing information in the routers, and allows packet forwarding to continue on an alternative output link immediately after the detection of a failure. In this paper we present MRC, and analyze its performance with respect to scalability, backup path lengths. An Intrusion detection system (IDS) is software and/or hardware designed to detect unwanted attempts at accessing, manipulating, and/or disabling of computer mainly through a network, such as the Internet. These attempts may take the form of attacks, as examples, by crackers, malwarer and/or disgruntled employees. IDS cannot directly detect attacks within properly encrypted traffic.

Keywords— Availability, Peer-to-Peer Networks System, Reputation, Computer network reliability, Communication system fault tolerance, Communication system routing, protection.

 

 

Cloud storage systems provide storage service on the internet. Since cloud is accessed via internet, data stored in clouds should remain private. Towards privacy and correctness of the data in cloud, several intrusion detection techniques, authentication methods and access control policies are being used. But they suffer from storage overhead. To minimize this overhead, several designs are currently using erasure codes. Now, the current research on cloud storage systems focuses on efficiency and robustness. But here, the major challenge is how to prevent silent data corruptions during reconstruction of data. This paper uses secure decentralized erasure-coded storage systems to guarantee a better privacy, efficiency and robustness and proposes a method that can reconstruct data in clouds by preventing silent data corruptions.
Keywords-cloud, privacy, silent data corruptions

 

 

Performance of a checkpointing based multiple fault tolerance is low. The main reason is overheads associate with checkpointing. A checkpointing algorithm can be improved by improved storing strategy and checkpointing scheduling. Improved storage strategy and checkpointing scheduling will reduce the overheads associated with checkpointing. Performance and efficiency is most desirable feature of recovery based on checkpointing. In this paper important critical issues involved in fast and efficient recovery are discussed based on checkpointing. Impact of each issue on performance of checkpointing based recovery is also discussed. Relationships among issues are also explored. Finally comparisons of important issues are done between coordinated checkpointing and uncoordinated checkpointing.

Keywords- Checkpointing, Distributed System, Recovery, Fault Tolerance

 

 

Wireless Sensor Networks (WSNs) consist of hundreds of sensor nodes often deployed in an unsecured or in hostile environment. Wireless sensor networks have been deployed in insecure environments. The wireless sensor networks used in military applications, health, industrial used In this paper we describe methods for dealing with security  goals.

Keywords— Sensor Networks,Wireless,Data ,Data security.

 

 

High cohesion is desirable property in software systems to achieve reusability and maintainability. Software metrics plays vital role in software development. Here we are measures for cohesion in ObjectOriented (OO) software reflect particular interpretations of cohesion and capture different aspects of it. In earlier approaches the cohesion was calculated from the structural information, for example method attributes and references. Now inConceptual Cohesion of Classes(CCC), we are calculating the unstructured information from the source code such as comments and identifiers. Unstructured information is embedded in the source code. To retrieve the unstructured information from the source code Latent Semantic Indexing is used. A  case study on open source software systems is presented, which compares the new measure with an extensive set of existing metrics and uses them to construct models that predict software faults. In this paper we are achieving the high cohesion and we are predicting the fault in Object Oriented Systems.

Keywords: Cohesion, Reusability, Object Oriented.

 

 

In communication systems, sound files and also disk space for storage, compression of these files has become a necessity. Speech compression is the technology of converting human speech into an efficiently encoded representation that can later be decoded to produce a close approximation of the original signal. In this paper we are using one of the familiar wavelet transform for compressing speech signal in frequency domain. Wavelet analysis is the breaking up of a signal into a set of scaled and translated versions of an original wavelet. Taking the wavelet transform of a signal decomposes the original signal into wavelets coefficients at different scales and positions. These coefficients represent the signal in the wavelet domain and all data operations can be performed using the just corresponding wavelet coefficients. The major issues concerning the design of this Wavelet based speech coder are choosing optimal wavelets for speech signals, decomposition level in the wavelet transform, thresholding criteria for coefficient truncation and efficient encoding of truncated coefficients. The performance of the wavelet compression scheme on recorded speech was calculated. A significant advantage of
using wavelets for speech compression ratio can easily be varied, while most of the other techniques have fixed compression ratios.
Keywords- Speech Signal, Speech Compression, Wavelet transform, Frequency domain.