Information Processing and Management

Presently the WWW phenomenon has brought the world in to the personal computer. Digital media is thereby given high priority. But this has increased the frequency of security breach of intellectual properties. Therefore copyright protections and content integrity verification are highly recommended. What we need is newer data hiding techniques that must be imperceptible, robust, highly secured, etc. Digital image watermarking is one of the ways that is resilient to various attacks on the image based digital media where data authentication is done by embedding of a watermark in image characteristics. This work incorporates singular value decomposition (SVD) based image watermarking. Here unlike previous work done by researchers, error control coding (ECC) and artificial neural networks (ANN) for the authentication purposes have been used. ECC and ANN increase the robustness of the method against malicious attacks.

This paper expounds a method to improve the precision of Web retrieval based on proximity and semantic association of terms for a multi-term query. We implement the three proximity measures: first appearance term distance (FTD), minimum term distance (MTD), and local occurrence density (LOD); and study the effectiveness of these measures from the perspective of semantic association of query terms. The experimental evaluation show that for the topic modifying type query terms, the MTD method has a remarkable effect on improving Web retrieval precision and for the topic collocating type query terms the LOD method has a remarkable effect on improving Web retrieval precision.

We are presenting a detailed study for the administering and monitoring of the existing IT Infrastructure for SAP. The SAP Infrastructure requirements like the users involved in the transaction, the real time monitoring and bandwidth management, are the crucial issues for the designing of the existing IT Infrastructure. Redesigning is done in such a way that, network becomes simple and secure. During the implementation phase, we have explored different methodology for the PIX firewall implementation involved in the different security profiles of the wired and wireless network. In the design and implementation phase, some of the prime solutions are proposed for the effective utilization of the available resources.

Mobility is becoming ubiquitous now-a-days. Mobility management has been a growing concern in IPv6 with numerous problems originating from roaming between IPv6 and IPv4 access networks owing to ever-growing research. The various architectures concerning transition / mobility among IPv6 and IPv4 are studied. The study reveals that only IPv6 initiated communications (from IPv6 based network) with IPv4 nodes (in IPv4 based network) are considered. The existing architectures in the study do not consider the scenarios such as the IPv6 nodes visiting IPv4 network; IPv4 nodes visiting IPv6 network; IPv4 initiated communications with other nodes irrespective of IP version of network. The newly proposed mobility management system for the integrated IPv4 and IPv6 networks is referred to as IMM-I46 and provides a detailed solution that can be implemented immediately. The proposed IMM-I46 system helps IPv6 mobile users to roam freely also into IPv4 based networks besides roaming in IPv6 networks, get serviced, connected with internet and vice versa.

Multicasting reduces communication cost for applications which need to send same data packets to multiple destinations instead of sending via multiple unicasts. It also reduces the required channel bandwidth, sender and router processing and delivery delay. This paper compares the performance of an efficient multicast hybrid routing protocol with the existing one. i.e. MAODV. We explore the reliability as well as proactive approaches of Multicast Hybrid Distance Vector (MHDV) for MANETs, which are used to improve the Packet Delivery Ratio (PDR) in all possible mobility rates as compared with MAODV. It is also observed that, the PDR and end-to-end delay of proposed routing protocol are better for less number of senders.

Biometric systems are considered as human pattern recognition systems that can be used for individual identification and verification. The decision on the authenticity is done with the help of some specific measurable physiological or behavioral characteristics possessed by the individuals. Robust architecture of any biometric system provides very good performance of the system against rotation, translation, scaling effect and deformation of the image on the image plane. Further, there is a need of development of real-time biometric system. There exist many graph matching techniques used to design robust and real-time biometrics systems. This paper discusses two graph matching techniques that have been successfully used in face biometric traits.

This paper proposes a substitution-diffusion based image cipher using chaotic standard maps and 3D cat map. The first stage consists of stretches of plain image using arnold cat map, XOR-ing with synthetic image which is generated using chaotic standards map and total number of rounds are controlled by secret key and plain image. Then in second stage further diffusion and confusion is obtained in the horizontal and vertical pixels by mixing the properties of the horizontally and vertically adjacent pixels, respectively, with XORing by generating an intermediate chaotic key stream (CKS)image in a novel manner with the help of chaotic standard map and total numbers of rounds are controlled by secret key and plain image. The performance is done such as entropy analysis, difference analysis, statistical analysis, key sensitivity analysis,, key space analysis, speed analysis. This proposed technique is trade of between security and time. The experimental results illustrate that performance of this is highly secured.

With upcoming availability of low cost short ranges along with advances in wireless networking it is expected that Wireless Ad hoc Sensor Network will become commonly deployed. Many applications for wireless communication networks such as wireless sensors, industrial control and monitoring, intelligent agriculture, inventory tracking, and security would benefit from a communication protocol. Routing has important role in these types of scenarios. In this paper a hybrid routing protocol named as Hybrid-AODV has been proposed. The goal of this paper is to characterize the performance of proposed protocol based on ad hoc sensor network. An exhaustive simulation experiment reveals that, the proposed Hybrid-AODV protocol performs better than AODV in terms of PDR and end-to-end delay for all mobility rates and various area grid sizes.

Scheduling in computer science means determining which tasks run when there are multiple runnable tasks. Several CPU scheduling algorithms have different features, and no single one is ideal absolutely for every application. This paper presents an attempt to apply fuzzy logic in the design and implementation of a rule-based scheduling algorithm to solve the shortcoming of well-known scheduling algorithms. Results given in this paper demonstrate that the average waiting time and the average turnaround time in the proposed algorithm are better than that obtained using priority scheduling, and closed to that obtained from shortest-job-first (SJF) scheduling. The new proposed algorithm is a dynamic scheduling algorithm which deals with both task priority and its execution time, while the SJF algorithm doesn’t.

Object location Services (OLS) in MANET is a challenging issue due to limitation of the applications of MANET such as bandwidth, mobility, battery power, memory etc.., For more significance and efficient results we have worked out on the clustering architecture for location services in MANET. We brief in this paper about location services in MANET. Due to frequent mobility of the mobile hosts the physical topology of the network continuously changes as result frequent link breaks of existing paths. The absence of any centralized, dedicated servers to maintain the location information of the mobile hosts in Mobile ad-hoc networks is a challenging issue. Therefore location management becomes an important issue. Location management refers to updating and searching the “whereabouts” of mobile nodes in a network. The proposed algorithm for object location in MANET using clustering has shown effective and better results when comparing with the very well known location protocol that is GLS (Grid Location Services). The algorithm also registers and updates the location information of mobile nodes as well as searches their current location in ClusterHead tables. The simulation results show that lesser overhead cost of object location and better throughput are achieved when using the clustering methodologies by implementing a mechanism to track the location of other Mobile nodes (MN) in the network topology.

In wireless communication, concept of parallel transmission of symbols is applied to achieve high throughput and better transmission quality. Orthogonal Frequency Division Multiplexing (OFDM) is one of the techniques for parallel transmission. The performance of uncoded orthogonal frequency division multiplexing (OFDM) over fading channels is generally improved by introducing some kind of channel coding. Coded OFDM (COFDM) has therefore been chosen for two recent new standards for broadcasting namely DAB and DVB-T. Different coding schemes for OFDM have been reported in the literature. In this paper our aim is to evaluate COFDM performance using block interleaver/Reed Solomon (RS) codes with convolution code and result is compared with uncoded OFDM. The performance parameter used for evaluation is BER with AWGN channel assumption. All other parameters used are as per IEEE 802.11a specification.

In 3G and beyond wireless networks orthogonal variable spreading factor (OVSF) codes are used to handle multimedia rates. These codes suffer from code blocking limitation which reduces the throughput and spectral efficiency of the system. Also, real time calls suffer from call processing delay. We propose a single OVSF code assignment design which utilizes offline optimum code selection algorithm so that the optimum code is available at the arrival of new call. The design finds the optimum code using a variable

code index

for all the parents of the available vacant codes. If a tie occurs for two or more parents for

code index

, the parent with the higher

code index

is chosen. The procedure repeats till a unique solution is reached. If still tie is not resolved the average elapse time of busy children of these parents can be used to choose single optimum code option.

This work presents an accurate and efficient closed form model to compute the slew metric of on-chip RC interconnects of high speed CMOS VLSI circuits. Our slew metric computation is based on the Burr’s distribution function. The Burr’s distribution is used to characterize the normalized homogeneous portion of the step response. The simulation results performed on the practical industrial nets justifies the accuracy of our approach.

In this paper, a two-stage coder based near-lossless compression of Electroencephalogram (EEG) is discussed. It consists of wavelet based lossy coding layer (until bitplane

n

d

) followed by entropy coding of the wavelet domain residuals.

L

 ∞ 

-error bound is fixed in wavelet domain and the corresponding time-domain absolute error variation is studied. Studies show that intermediate demarcating bit-planes (

n

d

) register a higher compression and gives a nearly constant time-domain error. Both the normal and epileptic EEG registered a comparable compression performance.

After finding wide range of applications in the field of communications over decades, the wired networks are replaced by mobile and wireless networks and have become ubiquitous in the recent past. This is mainly due to the dynamic nature of these wireless networks. The interesting feature of the wireless communications is the need for connectivity at any place and at any time, which leads to frequent handoff. Due to larger bandwidth of wireless communications, the cell phones are not only used to communicate voice, but also to send and receive text, video and pictures. This requires some QoS criteria such as bandwidth utilization and time delay to be managed. In this paper, we present a novel approach for designing a high performance QoS management scheme that exploits attractive features of fuzzy logic and provide adaptation to dynamic cellular environment.

To go with today’s technology there is need of improving network communication performance. Its number of bits required to store an image that decides the speed of transmission of that image, in network communication. Here comes the need to reduce the number of bits required to represent an image. Many scholars have discovered that the most of the vital information lies in the edge of the image. Edges being the local property of a pixel and its immediate neighborhood, characterizes boundary. When image is represented as edge, the number of bits or pixels required to store an image reduces and also has a property of reducing the redundancy when restored. Hence one of the techniques for edge detection is proposed called as “Sobel edge detection”.

Intrusion Detection System (IDS) is the science of detection of malicious activity on a computer network. Due to the enormous volume existing and newly appearing network data, Data Mining classification methods are used for Intrusion Detection System. In this paper the classifying methods used are ID3, J48, Naive Bayes and OneR. The data set used for this experiment is kddcup1999. The dimensionality reduction is being performed from 41 attributes to 7 and 14 attributes based on Best First Search method and the 4 classifying methods are being applied. The result shows that ID3 and J48 method carry the highest accuracy and sensitivity with 7 and 14 attributes. Naive Bayes holds the highest degree of specification for all three dimensionalities. OneR has the worst Sensitivity with 7 and 14 attributes but the time taken by OneR for classification is very less. It is found that the optimal algorithm may vary based on the dimensionality.

Indian Sign Language (ISL) consists of static as well as dynamic hand gestures for communication among deaf and dumb persons. Most of the ISL gestures are produced using both hands. A video database is created and utilized which contains several videos, for a large number of signs. Direction histogram is the feature used for classification due to its appeal for illumination and orientation invariance. Two different approaches utilized for recognition are Euclidean distance and K-nearest neighbor metrics.

Power efficiency in VLSI design is in prime focus in today’s state of the art. A simple method of reducing power consumption in cache memories and other logic is presented here. We make use of both edges of clock signals to perform cache accesses in order to enable the reduction of operating frequency - and thus, dynamic power - without affecting performance to a large extent. Experimental results are presented, making use of the OpenSPARC T1 and Alpha AXP 21064 processor caches.

The power consumption of the integrated circuits have become increasingly a central topic of today’s research. The need for low power has caused a major paradigm shift where power dissipation has become as important as performance and area. In this paper the original direct mapped cache of Alpha AXP 21064 processor is modified into set associative and phased set associative caches. The experimental results show that phased set associative cache is more power efficient than set associative cache. These three designs namely direct mapped, set associative and phased set associative caches are modeled using Verilog HDL, simulated in Modelsim and synthesized in Xilinx ISE 10.1. The power estimation and analysis is done using Xilinx XPower Analyser.

Natural variability and limited number of library instances influence the matching performance and robustness of automatic pattern analysis methods. A data representation method that utilizes the local structures from the original data with a focus to effectively use the full resolution of data vector is presented. Using plant and face database, the issue of resolution, limitations in the number of library instances, and variability were addressed. Interestingly, the method shows an automatic matching improvement of over 22% under noisy and difficult matching condition.

Security is a vital part of an integrated grid application in which heterogeneous services and resources belonging to multiple domains are distributed dynamically. Authentication and authorization are the major security concerns in grid environment. Most of the grid security mechanisms stress on authentication, and not on authorization. This paper proposes to integrate an authorization protocol with the effective trigon-based authentication technique based on the user’s role. This integrated trigon-based authentication – authorization protocol provides effective grid security in an efficient manner.

Routing protocols for mobile ad hoc networks (MANETs) have been explored extensively in recent years. Much of this work is targeted at finding a feasible route from a source to a destination without considering current network traffic or application requirements. Therefore, the network may easily become overloaded with too much traffic and the application has no way to improve its performance under a given network traffic condition. While this may be acceptable for data transfer, many real-time applications require quality-of-service (QoS) support from the network. We believe that such QoS support can be achieved by either finding a route to satisfy the application requirements or offering network feedback to the application when the requirements cannot be met. The novel part of this QoS-aware routing is the use of the approximate bandwidth estimation to react to network traffic.

The authentication based on biometric is more reliable and secure because of using the unique physical feature of human. Initially, mono biometric system was used for authentication but it has some error rate and hence multimodal biometric system was introduced to reduce the error. The constraint of using these systems is to maintain more information. Without reducing the error rate and maintain the above constraint a new algorithm has been developed which is based on the invariant moment information of fingerprint and face which is fused using variation. In this algorithm the fingerprint and face is segmented and the invariant moment information is extracted. The invariants are fused into a single identification value by using coefficient variance. This single value is authenticated by calculating the difference, evaluated using the threshold value which is set as 90% for fingerprint and 70% for face, provides low error rate of FAR and FRR. The algorithm is tested under cooperative and non cooperative condition and obtained less complexity, storage, execution time, high reliability and secure authentication system.

Digital radiography is the latest advancement in dental imaging. It is more comfortable in terms of technique and interpretation. Dynamic appearance of digital radiograph is supportive for image analysis and enhancements like image sharpening, coloring, contrast and density adjustments, depending on the diagnostic task. Histogram equalization is useful in images with backgrounds and foregrounds that are both bright or both dark. Equalization can lead to better views of bone structure in radiographic images, and to show details in over or under-exposed photographs. The objective of the paper is to study use of histogram equalization to enhance the digital radiographs for classifying various problems in dental care.

The problem of content-based retrieval of remotely sensed images presents a major challenge not only because of the surprisingly increasing volume of images acquired from a wide range of sensors but also because of the complexity of images themselves. In this paper, a software system for content-based retrieval of remote sensing images, using spatiograms is introduced. In addition, we also compare our results with histogram based content retrieval. Finally we illustrate the effect and relation of quantization bins on the retrieval efficiency of histogram & spatiogram based content retrieval system. Bhattacharyya coefficient is obtained in order to make comparisons between histogram & spatiogram of two images. Experimental results show that the integration of spatial information in histogram improves the image analysis of remote sensing data and the proposed method is simple, accurate and costs much less time than the traditional ones.

Segmenting mammographic images into homogeneous texture regions representing disparate tissue types is often a useful preprocessing step in the computer-assisted detection of breast cancer. Hence new algorithm to detect cancer in mammogram breast cancer images is proposed. In this paper we proposed segmentation using vector quantization technique. Here Linde Buzo Gray (LBG) for segmentation of mammographic images is used. Initially a codebook (CB) of size 128 was generated for mammographic images. These code vectors were further clustered in 8 clusters using same algorithm. These 8 images were displayed as a result. The codebook of size 128 clustered to 16 code vectors, codebook of size 128 clustered to 8 code-vectors using LBG algorithm is compared with watershed algorithm. The proposed approach does not lead to over segmentation or under segmentation with less complexity with more accuracy.

Selective encryption exploits the relationship between encryption and compression to reduce the encryption requirements, saving in complexity and facilitating new system functionality. Selective encryption of MPEG video stream have been proposed in a number of variations, yet has seen little application to date. Similarly chaos is another area which has not been focused much for video. In this paper, a video encryption scheme based on the widely used substitution–diffusion architecture which utilizes the chaotic 2D standard map and 1D logistic map is proposed. Hence, the advantages of both, selective encryption and chaos has been combined in this work with no impact on compression efficiency, and a cryptanalytic approach is performed for validating the security.

There are various approaches to achieve time synchronization in case of wireless sensor networks. Amongst them “sender to receiver” and “receiver to receiver” are the frequently used approaches for synchronizing time. Both the methodology has some drawbacks with respect to number of message exchanged for synchronization. To overcome those drawbacks Hybrid approach was introduced. Hybrid approach is efficient with respect to number of message exchanged compared to both methodology. In this paper Hybrid Approach is improved, to reduce the message communication that is required to synchronize time between the nodes in sensor network.

Adhocnetworks are dynamic infrastructure-less network system in which nodes can communicate with each other freely. It is very different from normal network and thus prone to different kinds of attack. This makes security concerns very important. This paper proposes security improvements over the existing AODV protocol for attack detection and building up proposed Tracking based credence computation (TCV) to improve network security. When a malicious node is judged as an attacker by the credence mechanism, the improved security routing protocol will implement re-routing to isolate the attacker from the network. This algorithm includes the prompt alarm about the behavior of a malicious node to help in taking quick action against them.

Web usage mining focuses on discovering the potential knowledge from the browsing patterns of users and to find the correlation between the pages on analysis. With exponential growth of web log, the conventional data mining techniques were proved to be inefficient, as they need to be re-executed every time. As web log is incremental in nature, it is necessary for web miners to use incremental mining techniques to extract the usage patterns and study the visiting characteristics of user. The data on the web log is heterogeneous and non scalable, hence we require an improved algorithm which reduces the computing cost significantly.

This paper discusses an algorithm to suit for continuously growing web log, based on association rule mining with incremental technique. The algorithm is proved to be more efficient as it avoids the generation of candidates, reduces the number of scans and allows interactive mining with different supports. To validate the efficiency of proposed algorithm, several experiments were conducted and results proven this are claimed.

Routing protocols in wireless ad-hoc networks are not well suited for Wireless Sensor Networks as they have huge number of nodes, densely deployed and limited power processing and storage. Energy consumption of sensor nodes and their lifetime has become the major issues of Wireless Sensor Networks. This paper aims at building up of hybrid routing protocol based on PROUD and LEACH in Wireless Sensor Networks. For randomly generated nodes with different energy levels, cluster heads are chosen. Every other common node chooses its own cluster heads based on the available cluster choices and thus forming clusters. Cluster heads get sensed data from the common nodes and they send their aggregated data to the Base station for monitoring. So, node to node communication happens through cluster heads. Only cluster heads spend their energy for long range data transmission and thus avoiding energy consumption of other nodes. This procedure of head selection and cluster formation distributes the energy consumption among the nodes thus maximizing the lifetime of Wireless Sensor Networks by extending the life of the nodes. The proposed approach has been justified with results.

Present day advancements in the Internet technologies, especially the increase of bandwidth are definitely encouraging environment for new developments like conferencing, interactive gaming etc. Maintaining security is a critical issue in these group oriented applications. The entry and eviction of the members are the main criteria to change the group key, known as re-keying. Since re-keying is the frequently performed activity during a communication, the group key updating needs to be done in a scalable and efficient manner. This paper proposes two novel ideas: i) Group communication using public key broadcast ring and ii) Region based group communication, for efficient and scalable rekeying. These techniques show their performance in terms of no single point of failure, no need of secure channel establishment, minimum key maintenance at each member, effective bandwidth utilization and minimum computation overhead.

For research experiments, simulators can be used to get easier access to fine grained results than corresponding real world experiments. One problem with simulators is that it is hard to show that a simulation experiment corresponds well with a similar real world experiment. The objective of this contribution is to investigate the effectiveness of simulation results for Wireless Sensor Networks (WSNs). For such purpose, a detail survey on simulators has been made and it has been found that there are 44 different simulators or simulation frameworks in existence, they are either adjusted or developed specifically for wireless sensor networks. Secondly, with the help of experimental results it is to highlighted, that there is an impact of operating system architectures on simulation results of routing mechanism used in WSNs. And finally our focus is on some factors that influences simulation results for WSNs.

Mobile adhoc network is a set of mobie devices that can communicate with each other without infrastructure. The reactive protocols use a flood-based discovery mechanism to find routes when required. Since each route discovery incurs high overhead and latency, the frequency of route discoveries must be kept low for on-demand protocols to be effective. Multipath on-demand routing protocols can achieve better performance and scalability because in the single route discovery process it will find out the several routes. This paper proposed a novel multipath routing scheme which is used to reduce the routing overhead by using derived paths. The multipath routing scheme calculates fail-safe multiple routes and gives all the in between nodes of the prime path with several paths to target node. Simulations show that the performance of proposed approach is better than the conventional AODV.

A mobile ad hoc network (MANETs) consists of a group of mobile nodes which are connected by wireless links. The peculiar characteristics of MANET like open medium, high dynamic nature of the network lead to various attacks which partition or destroy entire network. A black hole attack can be working in opposition to routing in mobile adhoc networks. A black hole node is a malicious node which sends the fake reply for route requests and drops the packets. In this paper, a novel approach is proposed to detect blackhole nodes in the MANET. Our solutions find out the safe route between sending node and receiving node. The simulations show that the proposed approach is efficient than normal AODV when the black hole attack is present with high packet delivery and less packet drop.

A load balancing scheme comprises of three phases: information collection, decision making based on information and data migration. In distributed database, it is important to take data locality into account, since they have big impact on the communication requirements. Several techniques are proposed for balancing the load in homogeneous applications but still some improvement in terms of efficiency is required. In this paper, we present a load balancing architecture that can deal with homogeneous applications in distributed database [3] more efficiently. In our proposed architecture, memory utilization based priority method is used and data locality is also taken into consideration along with process waiting time and data transmission time. We have developed a load balancing algorithm which balances the load on different nodes working in homogeneous environment in a fragmented distributed database.

Internet connectivity can offer enormous advantages, however security needs to be a major consideration when planning an Internet connection. There are significant security risks associated with the Internet that often are not obvious to new (and existing) users. In particular, intruder activities as well as vulnerabilities that could assist intruder activity are widespread. Intruder activity is difficult to predict and at times can be difficult to discover and correct. Many organizations already have lost productive time and money in dealing with intruder activity; some organizations have had their reputations suffer as a result of intruder activity at their sites being publicized. This paper proposes a secure method of e-shopping using Pocket PCs through voice ordering.

In this paper we have analyzed the performance of an all-optical WDM network for different parameters, such as number of channels, number of wavelengths associated, number of hops between source to destination etc. To establish a light path between two nodes wavelength continuity is a big constraint and to avoid this problem either wavelength converter or optical delay line or both may be used. Wavelength converter will convert the wavelength of the incoming signal into a desired wavelength at the output and the optical delay line will hold the incoming signal for a certain time. In this paper we considered that the network is equipped with wavelength converter and the traffic through the network is Erlang-C type. A mathematical model for the same has been devised and its performance has been analyzed with an investigation on collective impacts of various traffic parameters on transmission.

In this paper, a new architectural framework called CSMDM (Con current Synchronization Integrated Synchronization Model) for concurrency control and multimedia synchronization has been proposed and implemented that enables mapping active synchronization requirements to active multimedia databases. The main advantage of this work is the integration of concurrency control protocol with intelligent synchronization requirements and hence it is capable of achieving a high performance during transaction processing. A new locking protocol named Concurrent Secure two phase locking protocol has been proposed in this paper in order to enable better concurrency control during online transactions.

Mobile ad hoc networks (MANETS) are self-created and self organized by a collection of mobile nodes, interconnected by multi-hop wireless paths in a strictly peer to peer fashion. In MANETS the link bandwidth is limited and to provide Quality of Service (QoS) in term of bandwidth, security for soft real time processing services is very difficult. In this paper, we propose a secure QoS enabled on-demand link-state multipath routing mechanism that reactively collect link-state information from source to destination in order to dynamically construct a flow network, then the QoS enabled multipath routes between source & destination are detected by destination node under the CDMA-over-TDMA channel model of MAC layer, which collectively satisfy required bandwidth and security services during route discovery process ( node authentication, secure route establishment, secure data communication). Our mechanism uses symmetric key cryptography and a one-way HMAC based key chain for broadcast node authentication (i.e.TESLA), so that any altering of route discovery packet (i.e. Qo.S route request (QRREQ) packet and QoS route reply (QRREP) is immediately detected).The proposed mechanism has better call acceptance rate in ad hoc wireless networks, where finding a single path satisfying all the QoS requirements is very difficult.

Trust management systems are the robust architectural frameworks for allowing authorization to resources of a distributed computing environment that could be cluster and grid based extendible to peer to peer paradigm. A policy driven methodology is adopted in cluster based architecture in order to provide control to remotely accessible resources. The interaction between nodes and resource allocation with trustworthiness dimensions is a central challenge in building a trustworthy distributed system. By imposing authentication procedure in a cluster, nodes can grant access to their critical resources to each other thus forming a trusted relationship. This work addresses the crucial issue of forming a trusted cluster of distributed entities in order to facilitate resource sharing and load balancing. Experimental results show that the communication cost of establishing trust among entities in terms of number of message exchange by our approach is reduced by 11–18% with comparable memory consumption.

The objective of this paper is to effectively improve the existing Huffman lossless compression algorithm and to evaluate its performance on various types of medical imaging data like CT, MRI, Ultrasound, and X-ray images. Huffman Algorithm is a statistical coding technique. It is technically simple to implement for both the purposes of encoding and decoding .In this paper, a pattern finder component is proposed, which determines the best component and the most frequent occurring pattern in the image to be transmitted via the telemedicine network. The best pattern will be an input to the encoder and the output of the encoder would be the compressed image and the footer information. The footer information comprises of the data which were compressed and needs to be inserted at the decoder component. The proposed pattern replacement greatly enhances the performance in terms of improved compression ratios over the existing system. It is aptly applicable for data transfer where bandwidth should be at an optimal level. The present work yields 4-5% improved compression ratio, thereby permitting reduced traffic on the telemedicine network.

A Cellular Automata (CA) is a computing model of complex System using simple rule. In this paper the problem space is divided into number of cell and each cell can be one or several final state. Cells are affected by neighbor’s with the application of simple rule. This paper deals with the Cellular Automata in cryptography for a class of Block Ciphers through a new block encryption algorithm based on programmable cellular automata.The proposed algorithm belongs to the class of symmetric key systems.

WMNs are dynamically self-organizing; self-configuring and self-healing in nature to maintain the communication with neighbors in the network. Routing protocols in WMN protocols requires different metrics as compared to ad-hoc network. A performance analysis is done on reactive routing protocols to verify the suitability of reactive routing protocols over WMN under IEEE 802.11s. The suitability of Ad Hoc On-Demand Distance Vector (AODV) and Dynamic MANET On-demand (DYMO) routing protocol are compared with OSPF (Open shortest path first) is explored.

Wireless Sensor networks are non-infrastructure networks which consist of mobile sensor nodes. Since the mobile nodes have limited battery power, it is very important to use energy efficiently in sensor networks. In order to maximize the lifetime of sensor networks, traffic should be sent via a route that can avoid nodes with low energy thereby minimizing the total transmission power. In addition, considering that the nodes of sensor networks are mobile, on-demand routing protocols are preferred for sensor networks. In this paper, we propose a novel on-demand power aware routing algorithm supporting quality of service called QDPRA. QDPRA prolongs its network lifetime by compromising between minimum energy consumption and fair energy consumption without additional control packets. QDPRA also improves its data packet delivery ratio, minimizes delay and maximizes throughput of the network.

IP spoofing has often been exploited by Distributed Denial of Service (DDoS) attacks to: 1) conceal flooding sources and dilute localities in flooding traffic, and 2) coax legitimate hosts into becoming reflectors, redirecting and amplifying flooding traffic. Thus, the ability to filter spoofed IP packets near victim servers is essential to their own protection and prevention of becoming involuntary DoS reflectors. Our scheme is based on a firewall that can distinguish the attack packets (containing spoofed source addresses) from the packets sent by legitimate users, and thus filters out most of the attack packets before they reach the victim. We estimate that an implementation of this scheme would require the cooperation of only about 20% of the Internet routers in the marking process. The scheme allows the firewall system to configure itself based on the normal traffic of a Web server, so that the occurrence of an attack can be quickly and precisely detected. By this cryptographic approach, we aim at combining both the existing approaches namely, Victim Based and Router Based approaches against IP spoofing thereby enhancing the speed of detection and prevention of IP spoofed packed.

Grid environment is used for performing high-end computations with a large number of systems. The proposed work is to monitor the grid network with the help of mobile agents and tune the network metrics on performance degradation of the grid network. The grid network is monitored using the cost function to analyze the network performance in grid. Any degradation in the network performance is reflected by the cost function. The network parameter that has caused the degradation will then be identified through analyzing of each network metrics by the tuning manager. Then the network performance is tuned by tuning the degraded network metrics, which has high impact over it. Tuning is done based on changing the sending and receiving TCP socket buffer size of the compute nodes. It is also shown that the network monitoring is equally important as the resource metrics at the time of job submission in the grid network.

The aim has been to detect discriminative sub-graphs which are highly distinguishable between program failing and passing execution graphs resulted from different runs. In this paper, a novel approach to mine weighted-edge graphs is proposed. We also apply our efficient objective function to find most discriminative patterns between failing and passing graphs. To find bug relevant sub-graphs, a decision tree classifier is used to classify program failing and passing runs based on their discriminative sub-graphs. The experimental results on Siemens test suite reveal the effectiveness of the proposed approach specifically in finding multiple bugs. It also gives the debugger an infection path related to the discovered bug(s).

The Border Gateway Protocol (BGP) is the default routing protocol for the routing between autonomous systems in the Internet. BGP’s convergence time is mainly dependent on the Minimum Route Advertisement Interval (MRAI) value, But the influence of this MRAI value on the router’s resources is not yet understood well enough to improve the existing protocol implementation in terms of the specific aspects like CPU utilization, Memory requirement, Bandwidth utilization and convergence time. Therefore it has been analyzed to understand the relationship between the setting of Minimum route advertisement (MRAI) value and the resource requirement of BGP. This paper analyse the convergence times and number of exchanged updates to the different MRAI settings of BGP. In particular, the influence of the MRAI timer in the router CPU utilization, Bandwidth and Memory requirement, number of updates and convergence time is investigated. Designed an algorithm to enhance the convergence time of BGP by considering the minimum route advertisement interval time and reduce routing update overhead. And it shows enhancement of 17% of CPU utilization, 10% of Bandwidth, 10% of memory requirement and 14% of convergence time when compared with the existing system.

In order to challenge the security threats for e-commerce and e-business transactions, robust and trustworthy security systems are required. Public Key Infrastructure (PKI) is a frame work on which the security services are established. Most of the business corporations deploy Hierarchical PKI as their security infrastructure, in which, certificate path is unidirectional, so certificate path development and validation is simple and straight forward. In this paper, we propose a novel method for certificate path verification in Hierarchical Public Key Infrastructures and compare the experimental results with the existing certificate Path verification methods.

Iris recognition is one of important biometric recognition approach in a human identification is becoming very active topic in research and practical application. In this paper, Gaussian pyramid compression technique is used to compress the eye image and this compressed eye is used for the localization of the inner and outer boundaries of the iris region. Located iris is extracted from the compressed eye image and after normalization and enhancement it is represented by a data set. With Gaussian pyramid compression improved matching performance is observed down to 0.25 bits/pixel (bpp), attributed to noise reduction without a significant loss of texture. To ensure that, the iris-matching algorithms are not degraded by image compression. The proposed method is evaluated using CASIA iris image database version 1.0 [7] and achieved high accuracy of 96%. Experimental results demonstrate that the proposed method can be used for human identification in an efficient manner.

Wireless indoor positioning systems have become very popular and attractive in recent years. With the increasing use of mobile computing devices such as PDAs, laptops and an expansion of Wireless Local Area Networks, there is growing interest in optimizing the WLAN infrastructure, so as to increase productivity and efficiency in various colleges and office campuses with carrying out a cost effective infrastructure model. This paper describes an indoor propagation model, which can be used to predict the signal strength taking into consideration propagation path losses. In this paper we describe a mathematical model developed to find the optimal number of APs and their locations. To solve the problem, we use the Particle Swarm optimization.

Multicast communication in mobile adhoc networks is challenging due to its inherent characteristics of infrastructure-less architecture with lack of central authority, limited resources such as bandwidth, time, energy and power. Many emerging commercial and military applications require secure multicast communication in adhoc environments. Moreover, mobile nodes are often power constrained so that energy conservation is also an important issue on multicast key distribution. This paper evaluates the energy conservation of a new approach of multicast key distribution called cluster based multicast tree algorithm with multicast destination sequenced distance vector routing protocol to provide reliable and efficient energy conservation of multicast key distribution. Simulation results in NS

2

accurately predict the performance of proposed scheme in terms of energy consumption and end to end delay rate under varying network conditions.

Trust has been an essential quality factor in grid computing that has its influence in various other parameters like response time, throughput and resource utilization. This paper considers a method in which the factor “trust” is used in scheduling and resource allocation. Trust is calculated for both Service Provider and Client. In order to guarantee efficiency in resource allocation, a scheduling technique, which schedules the jobs according to the trust index of the Clients, is proposed. This optimal resource allocation scheme is implemented in a cross domain environment, that is, domains having different security mechanisms. The authentication is done using the signing of X.509 certificates. A common administrator is used between cross domains to provide interoperability. Both identity-based and reputation-based trusts are calculated for each entity. This ensures best service to customers. To overcome single point of failure, additional systems are provided that act as the administrator. A dynamic fault tolerance technique is proposed to guarantee successful execution of jobs in the event of resource failures.

Distributed Denial of Service attacks has emerged as a prevalent way to take down servers imposing huge financial losses to companies. Only a few responses have been designed to actively respond to the attack traffic while the majority have been designed to trace or log attack traffic. The DDoS defence mechanism presented here is effective for the detection and mitigation of fast-changing attacks at the earliest. The system architecture usually consists of many routers attached with victim and the edge routers are having the hosts attached with them. This is the basic system architecture seen in the proposed simulation. Based on the packet loss statistical analysis the proposed system finds the router with the highest packet loss. The monitoring system then invokes the trace back approach and black hole filtering system. The edge router then finds the suspected hosts and traces the attacker meanwhile the victim is protected from any other attacks.

Language transliteration is one of the important area in natural language processing. Machine Transliteration is the conversion of a character or word from one language to another without losing its phonological characteristics. It is an orthographical and phonetic converting process. Therefore, both grapheme and phoneme information should be considered. Accurate transliteration of named entities plays an important role in the performance of machine translation and cross-language information retrieval processes. The transliteration model must be design in such a way that the phonetic structure of words should be preserve as closely as possible. This paper address the problem of transliterating English to Kannada language using a publically available translation tool called Statistical Machine Translation (SMT).This transliteration technique was demonstrated for English to Kannada Transliteration and achieved exact Kannada transliterations for 89.27% of English names. The result of proposed model is compared with the SVM based transliteration system as well as Google Indic transliteration system.

Floods have always been a major cause of destruction from the past itself. In the manual river flow control system there is always a situation of the increasing or decreasing of the discharge available depending on the precipitation of the catchment region. In this article, with a blend of mobile agents (MAs), wireless sensor networks (WSNs) and intelligent systems we intend to formulate a new application to manage the water flow of a river by continuously monitoring the precipitation and correspondingly changing the position of the diversion head regulators (HR) of a barrage. Finally a global model of RIFMAS is also presented and it will be simulated in near future for its feasibility.

The problem of heat migration through skin layers in human bodies are complex due to various physiological parameters. Such types of problems arise in the study of heat generation and migration through skin and sub- dermal tissue of human body. Structure and the function of the skin and blood circulation system in human body are described as

body core temperature is 37

0

C

. Thermo-genesis and Thermolysis are explained by

Stefan’s law and cooling law

. The mathematical modeling of physiological heat transfer process in human body and analytical and discrete methods to solve the heat flow problem. The problem of temperature distribution in spherical tissue layers solve by the

finite element method

. Through the techniques

Variational finite element method, Galerkin method, Least square method

.

Indian film industry is one of the biggest in the world. A considerable number of movies out of the all movies released in a year are considered as hit movies. In a cinema hall k tickets are available and for a hit movie more than k people give demand for a ticket to watch the movie. To earn more profit in that environment, in this paper an auction based truthful mechanism is proposed for selling all the tickets of the cinema hall and it is shown that our auction based scheme is significantly better than the existing scheme in terms of the total income earned per annum. Our scheme could be applied on any film industry.

Cotton is the world’s most important natural fibre used in Textile manufacturing. Cotton fiber is processed into yarn and fabric. Yarn strength depends extremely on the quality of cotton. The physical characteristics such as fiber length, length distribution, trash value, color grade, strength, shape, tenacity, density, moisture absorption, dimensional stability, resistance, thermal reaction, count, etc., contributes to the quality of cotton. Hence determining the quality of cotton accurately is an essential task to make better raw material choices in textile industry which in turn will support better buying and selling decisions. In this work, cotton quality prediction is modeled as classification task and implemented using supervised learning algorithms namely Multilayer Perceptron, Naive Bayes, J48 Decision tree, k-nearest neighbor in WEKA environment on the cotton quality assessment dataset. The classification models have been trained using the data collected from a spinning mill. The prediction accuracy of the classifiers is evaluated using 10-fold cross validation and the results are compared. It is observed that the model based on decision tree classifier produces high predictive accuracy compared to other models.

In this paper a novel hybrid Harmony Clustering with Tabu Search (TS) has been proposed to achieve better document retrieval. Experimental results on TREC dataset reveal that the proposed algorithm can find better results. Finally Relevance Feedback mechanisms such as Term Feedback, Cluster Feedback and Term Cluster Feedback are used to further improve the performance of the retrieved results.

The scanned image of the text is not of any use for user, because that image is not editable. One can not make any change if required to the scanned document. This provides a food for thought for the theory of optical character recognition (OCR). OCR is nothing but character recognition of a segmented part of the scanned image. Therefore the segmented part of the image would be such that it should provide a close relation to the character to be recognised. Hence segmentation plays an important role in the OCR process. There are problems in segmentation process, but the degree of the problems varies from script to script, that is, the problem set for segmentation of the text written in a particular script may differ than the problem set for the text written in other scripts. The characteristics of the script, plays a significant role in deciding the segmentation points. The present study is an effort to find these problems especially for the segmentation of text in Gurmukhi scripts – typed and handwritten.

A Voice over Internet Protocol (VoIP) is a protocol for transporting voice conversations across a data network. It is an emergent trend on Information and Communication Technology (ICT). This paper consist of connectivity, equipment, provider, cost factors, voice quality and phone book are the exploring contrasts among VoIP phone services that assist people to prefer VoIP phone services.

This paper aims to compare performance of some routing protocols for Mobile Ad-Hoc networks (MANET’s). A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any centralized access point, infrastructure, or centralized administration. To establish a data transmission between two nodes, typically multiple hops are required due to the limited transmission range. Mobility of the different nodes makes the situation even more complicated. Multiple routing protocols especially for these conditions have been developed during the last years, to find optimized routes from a source to some destination. This paper presents performance evaluation of three different routing protocols i.e. LANMAR, LAR1 and Fisheye in variable pause times. Performance evaluation of these three protocols is based on Average end to end delay, TTL based hop count and Packet delivery ratio.

With a firm belief that technology-enabled learning can truly nullify social and economic boundaries, the concept of E-Learning has helped many students to achieve their dreams. These diverse operations are testament to the firm focus and dedication towards spreading quality Education. The use of audio visual technology is increasing with exponential rates in major Indian cities. In this paper, we have proposed Impact factor to calculate the academic performance of the students, of those schools where E–Learning technology has already been introduced. Experiments have been performed on past three years academic data to show the overall impact of E – Learning in Secondary Education.

Indian Tribal Medicinal Documents date back to around 1920’s and has not been explored much before. This paper attempts to structure these documents by extracting their ontology semi automatically and help in their annotations with the ontological concepts. It outlines our work in finding specific medical or tribal terms in such documents. It describes a two way annotation system through which experts can annotate the documents with the ontology concepts and also expand and refine the ontology with the new concepts. The results show that the system has high performance across documents with different concept densities.

A wide variety of biometrics based tools are under development to meet the challenges in security in the existing complex scenario. Among these, iris pattern based identification is the most promising for its stability, reliability, uniqueness, noninvasiveness and immunity from duplication. Hence the iris identification technique has become hot research point in the past several years. This paper compares recognition rates, speed and other efficiency parameters resulting from three iris feature extraction algorithms that use statistical measures, lifting wavelet transform (LWT), and Gray-Level Co-occurrence Matrix (GLCM) respectively. Experimental results show that while LWT provides higher recognition rate, GLCM approach offers reduction in computation time with a small compromise in recognition rate. It also demonstrates that statistical measures is the most economical when recognition requirement is crucial.

The amount of data associated with visual information is so large that its storage would require enormous capacity. Implementation of any picture archiving and communication system (PACS) requires a discussion of how to deal with the large quantities of data that must be transmitted and stored. Even before PACS, we engineers have made an attempt in developing encoding schemes that reduced the apparent size of images to reduce the demands placed on transmission and storage devices. In this work, image compression is achieved by taking the Medial axis transform of the binary image.

Though Internet has huge contribution to Society’s development; In recent time Internet has been used by Criminals, Terrorists, and Hackers for mal-activities. Open environments for Internet access such as publicly used Internet café’s and university/school laboratories are becoming a platform for Criminals and newbie Crackers. The major reason behind this is lack of proper authentication, insufficient logging & usage monitoring system in these environments. We propose Internet Usage Monitoring for Crime Detection (IUMCD) system for detection and prevention of criminal activities and intrusion attempts happening from such open environments. The IUMCD is a proactive system which monitors all User activities when User is accessing Internet from an open environment. We observed that IUMCD system is able to detect and report many different types of Criminal activities and Intrusion attempts while maintaining User’s private information inaccessible to others.

This paper discusses the design and implementation of a spectral fluctuation analysis based lossy audio coding scheme. We present a simple lossy audio codec, composed of an adaptive wavelet decomposition filter, a modified psycho-acoustic model, an intra-channel de-correlation block followed by quantization and coding block. The intra-channel de-correlation block does the spectral fluctuation analysis to find the successive frames found to be similar and de-correlates it and codes. A Modified psychoacoustic model with simplified masking model was designed to fit this system. The evaluation of the system was done by using European Broadcasting Union – Sound Quality Assessment Material (EBU-SQAM) stereo wave files. Experimental results show the compression ratios achieved and subjective quality evaluation report.

OLSR is one of the efficient routing protocols for MANETs, which is identified by IETF and assumes that all nodes are trusted. However, the OLSR is known to be vulnerable to various kinds of malicious attacks in hostile environment. In this paper, we propose a new security enhancement mechanism by adding security features to the existing the OLSR protocol. The security features included are based on authentication checks of information injected into the network, mutual authentication between two nodes as well as more advanced techniques such as authentic route confirmation ticket which regulates the behavior of nodes to prevent from internal attacks i.e. node misbehavior attack. The main contribution of our approach is to allow only legitimate nodes to participate to establish secure route rather than trying to detect adversary nodes after their involvement in the routing protocol.

With the advent of the ”Age of Genomics”, generation, accumulation and analysis of gene expression datasets that contain expression levels of thousands of genes across different experimental conditions is emerging. Analysis of gene expression data is used in many areas including drug discovery and clinical applications. This proposed biclustering algorithm extracts maximum similarity bicluster using multiple node deletion method after applying feature selection. Experimental results show the effectiveness of the proposed algorithm.

At present, there are two ways of vote casting: either through Paper-Ballot system or through Electronic Voting Machine (EVM). Both these methods do not ensure integrity, secrecy, accuracy, authentication and flexibility. We proposed a network efficient, cost effective multilayer peer to peer distributed model for E-Polling System which resolves the above mentioned problems in an effective way.

In this paper we propose an image processing based solution to automate the task of incorporating suggested corrections into reviewed documents. The proposed method extracts the symbols put in by a reviewer on a hard copy and then recognizes the symbols to understand their meanings. The recognition is achieved by the use of centroidal profile features. A software package is developed to incorporate the corrections into the soft copy by identifying the positions of symbols (in the hard copy). Several experiments have been conducted to demonstrate the feasibility of the proposed methodology. Experimental results have demonstrated that the proposed method can withstand minor deformation and orientation and in addition, it is capable of handling joined symbols.

Mobile Ad-hoc Network (MANET) is a dynamic network of self controlled mobile nodes without any centralized coordinator or wired infrastructure. The physical measures adopted in wired networks are less efficient for wireless networks. The leading challenges of wireless networks are battery power, bandwidth and mobility. The best way of overcoming these challenges in wireless networks is through efficient routing protocols. Multicast is transferring data from a single source to a group of destinations identified by a single address. This paper compares three multicast routing protocol and finding the optimal one which will perform in a better way against the major challenges.

In Multi-protocol Label Switching (MPLS) networks, selecting LSP pair i.e. both upward and downward LSP is practically beneficial, but before that we should assure that the selection does not contribute to network congestion and packet losses and at the same time it should increase the efficiency of network. In this paper we propose a new algorithm for an optimum LSP pair selection from multiple parallel LSP pairs. It minimizes the probability of network congestion, packet loss and request loss by selecting the LSP which is lightly loaded and possess upward and downward bandwidth proportional to the service request.

Security issues in MANETs (Mobile Ad-hoc Networks) cannot be solved by conventional intrusion detection techniques since they have relied on monitoring traffic at switches, gateways, and routers. Due to the mobility of nodes and the higher rate of interaction of nodes, MANETs needs to have an intrusion detection system which allows the node to react according to the context. A monitor placing algorithm is considered which will try to reduce the overhead of using more memory and at the same time maximize the detection of any threat in the system. The monitoring policy repository building is done by a probability based Bayesian approach which helps the intrusion detection system (IDS) to adapt to the context.

Wireless Sensor Networks (WSN) is a collection of numerous tiny sensor nodes which are randomly deployed in distributed environment. The reliability of WSN is affected by faults that may occur due to various reasons. The Fault Tolerance is the key factor for distributed sensor application. The main objective of this paper is to create an algorithm for fault tolerance. According to the network environment changes, this algorithm guarantees reliability. Our paper also gives out a framework which can be a solution for various faults occurring in WSN environment.

An image index model has been proposed that will help in the retrieval of images based on query by example. It is based on Vector Quantization (VQ). VQ represents the similarity of the images based on the codebook that is used for compression. An index is constructed based on the encoding distortion (ED) values using the Terrier Direct Index. It is found that some image transformations do not have any impact on the ED values and the retrieval accuracy is higher, efficient and faster. It can be combined with the cube index model for text documents to give a single structure for facilitating both image and text retrieval.

This paper analyses the cooperative black hole attack which is one of the new and possible attack in adhoc networks. A black hole is a type of attack that can be easily employed against routing in mobile adhoc networks. In this attack a malicious node advertises itself as having the shortest path to the node whose packets it wants to intercept. To reduce the probability it is proposed to wait and check the replies from all the neighboring nodes to find a safe route. If these malicious nodes work together as a group then the damage will be very serious. This type of attack is called cooperative black hole attack. Our solution discovers the secure route between source and destination by identifying and isolating cooperative black hole nodes. In this paper, via simulation, we evaluate the proposed solution and compare it with other existing solutions in terms of throughput, Packet delivery ratio and latency. We have conducted extensive experiments using the network simulator-2 to validate our research.

An EFSM (Extended Finite State Machine) model-based regression test suite (RTS) reduction method based on dynamic dependence analysis is proposed. Our approach automatically identifies the difference between the original model and the modified model as a set of elementary model modifications. This proposed method reduces the size of a given RTS by examining the various interaction patterns covered by each test case in the given RTS.

To become independent of backbone networks leading to cheap deployments, the traditional single-hop approach needs to be replaced by Wireless Mesh Networks (WMNs). Wireless Mesh Networks is cost-effective alternative to wireless local area networks. Due to multi hop networking, WMN requires multi hop routing protocol. Mostly the nature of data is from client to gateway and vice versa. So, according to IEEE 802.11s Draft 3.0, HWMP routing protocol is adopted. In this paper, we analyzed the throughput of HWMP protocol with increase in number of nodes and increase in size of packets using simulation model.

In a multi-lingual country like India, a document may contain more than one script forms. For such a document, it is necessary to separate different script forms before feeding them to OCRs of respective scripts. In the work presented in this paper, a successful attempt has been made to identify the script at the word level in a bilingual document containing Roman and Gurmukhi scripts. The technique presented here can separate English and Punjabi words present in a single document. In this approach English and Punjabi words are separated using certain features of Gurmukhi and Roman script. Words with various font styles and sizes have been used for the testing of the proposed algorithms and the results are quite encouraging. The system has an overall accuracy of 98.78% of identification

.

In many applications strong security and high speed performance is required. For this purpose, DES and AES techniques are usually chosen, but these results in the lowering of security strength and less throughput. This paper presents the design FPGA implementation of AES processor in Counter Mode for 256 bits. In this work, the encryption rate is 52.6124 G bits /sec and memory efficiency is 1.565 with the key length of 256 bits. HDL simulations, verifications and implementations are done on Spartran 3, vertex 2 and vertex E devices.

Plagiarism aims at identifying the amount of information that is copied or reproduced in modified representation of original documents. This is quiet common among students, researchers and academicians that leads to a kind of unrecognizing. Though there exits some commercial tools to detect plagiarism, still plagiarism is tricky and quiet challenging task due to abundant information available online. Commercially existing softwares adopt methods like paraphrasing, sentence matching or keyword matching. This paper focuses its attention on identifying some key parameters that would help to identify plagiarism in a better manner and to report plagiarism in an effective way. The result seems to be promising and have further scope in detecting the plagiarism.

Data transmission is a vital issue for modern communication systems and for this security is highly required. Cryptography changes the message such that even if it is overheard by a third party, it would be unintelligible. Steganography, on the other hand, involves hiding message in such a way that the casual observer should not be able to detect the hidden information. Seemingly meaningless data can contain complex details, maps, or text. Steganography is often combined with cryptography to provide an additional layer of security.

Knowledge discovery from Web Usage Data has become very critical in order to understand and better serve the needs of Web based applications. Web usage mining consists of three phases, namely prepro cessing, pattern discovery and pattern analysis. A survey of Web Usage Preprocessing techniques is presented in this paper.

In context-aware system, components are dynamically adapted without requiring system to restart, in response to all possible changes in the execution environment. Existing approaches to make such a system more vigorous and safe, are both brittle and time intense. A approach has been devised for dynamic adaptation, to automate the component integration process at runtime by accessing the equivalent component from a set of diversified components. The .NET technology allows developers to adapt run-time component by specifying assertions on the component’s services and also allows performing comparison of these assertions. These assertions will help us to compute metadata for each component in the repository. This metadata-driven component selection is an efficient and promising mechanism. In this paper, we describe the mechanism for component adaptation using .NET approach, by considering a system in dynamic context having proxy switcher and network switcher components.

This paper presents a novel, principled approach to resolve the remained problems of substitution technique of audio watermarking. Using the proposed genetic algorithm, message bits are embedded into multiple, vague and higher LSB layers, resulting in increased robustness. Substitution techniques have naturally high capacity, but two major problems, having low robustness and transparency, negate the advantage. The robustness specially would be increased against those intentional attacks which try to reveal the hidden message and also some unintentional attacks like noise addition as well.

In many trivial or complex situation augmentation of a data structure would required. To solve real world complex problem augmentation of data structure is must by creating entirely new data structure using existing data structure by adding some additional information like Minimum, Maximum, Successor, and Predecessor in it. Augmentation of data structure is not that much straightforward. This approach is developed with respect to existing data structure of BST (Binary Search Tree) and some additional information. So, in this attempt we presented BST as underlying data structure for interval tree, which leads to easy implementation, reduced searching complexity and less memory requirement.

Earthquake Impact Assessment using Genetic Algorithm’ aims atestimating the damage caused by an Earthquake. When the epicenter is specified, the application estimates the casualties and the type of infrastructure damaged. For Tsunami, the application calculates the tsunami arrival time and lists the tsunami characteristics. There is no system yet that predicts Earthquake damage based on Genetic algorithm. However there are several systems that use the ground vibrations and seismic data to predict the earthquake which has proven inadequate in more occasions than one. Although predicting an earthquake might be out of scope for us, but in this endeavor we can make software, which estimates the damages the earthquake causes and help the authorities concerned to take the appropriate mitigation measures.

With growing emphasis on human identification, iris recognition has recently received increasing attention. Iris feature extraction is the crucial stage of the whole iris recognition process. Through analyzing iris feature extraction and matching method, iris features are not consistent because most feature extraction techniques are sensitive to the variations of captured image data. In this paper we use the Scale Invariant Feature Transformation (SIFT) for recognition using iris images which is invariant to image scaling and rotation. We extract the characteristic SIFT feature points which shows the higher feasibility in the iris feature extraction and matching process.

On demand set up, fault tolerance and unconstrained connectivity are a couple of advantages that why mobile computing continues to enjoy rapid growth. The original motive behind vehicular communication was safety on roads, because million of lives were lost and much more injuries have been incurred due to car crashes. Safety messages which are of highest priority need to be delivered to the destination node on time to prevent from accidents. To guide priority scheduling we use meta data. This meta data is in fact priority data which is updated dynamically. Its advantage involve providing more flexibility to the system design and empowering decision makers at the operational level.

The development of efficient compression software to compress text is a challenging task. This paper presents how LZW Data Compression technique can be used to compress & decompress the text. The main goal of the system is to make use of LZW data compression technique to compress & decompress the text file on an Embedded Processor such as ARM. We present a way by which we can implement data compression algorithm on an embedded system. Given the set of text program to be compressed, the algorithms runs on Embedded processor and analyzes the code, gathers other relevant information and performs text compression or decompression . Implementation of LZW on embedded processor gives better result as compare to Huffman Compression.

Privacy preserving data mining (PPDM) is a novel research area to preserve privacy for sensitive knowledge from disclosure. Many of the researchers in this area have recently made effort to preserve privacy for sensitive knowledge in statistical database. In this paper, we present a detailed overview and classification of approaches which have been applied to knowledge hiding in context of association rule mining. We describe some evaluation metrics which are used to evaluate the performance of presented hiding algorithms.

Candes and Donoho introduced a new system of multiresolution analysis called the curvelet transform. Curvelets take the form of basis elements, which exhibit a very high directional sensitivity and are highly anisotropic. In this paper, we applied the curvelet transform, to generate Tamil OCR, to detect melanoma from microscopic images and to develop a stego system. Curvelet transform is a threat to the security of web applications where Image CAPTCHAs are used to dintinguish man from bots.

This paper proposes a solution for applying security to high performance computing systems (HPCS). Providing security in high performance computing is a challenging task. Internet, operating systems and distributed environments currently suffer from poor security support and cannot resist common attacks. The paper aims to apply various technologies at different levels of security on HPCS. HPCS[2] aims for receiving help to do complex and large computations in an environment where work is performed by many communicating computers on a single task which leads to an increased rank of security. The paper intends to achieve three major tasks. First, it divides the security in levels, second it covers how to define these levels on architectures and third it proposes the existing technologies of TCP/IP on the levels defined here.

A mobile ad hoc network is a kind of wireless communication network that does not rely on a fixed infrastructure and is lack of any centralized control. The wireless and distributed nature of Manet poses greater challenges of the system and networks for fruitful working are scalability, mobility, security, reliability and other attributes of trust worthy system. We propose an architecture for mobile ad hoc networks that provides holistic approach that considers challenges of the system and networks and focus on the collaborative mechanism providing architecture called Trust Worthy Architecture for Mobile Ad Hoc Networks. We characterize open distributed-system network-oriented architectures capable of fulfilling critical security, mobility, reliability, scalability, and performance requirements, while being readily adaptable to widely differing applications, different hardware and software providers, and changing technologies.

Wireless sensor network (WSN) is a collection of sensor nodes which are randomly deployed in distributed environment. Fault detection and management is major criteria in wireless sensor networks. Cross layer approach is used to implement Fault management plane in wireless sensor networks. Cross-layer approach (XLA) is developed, which replaces the traditional layered approach (TLA) that has been used in Wireless sensor networks. The design principle of XLA is both the data and the functional operations of traditional communication layers are melted in a single protocol. The objective of this paper is creating a cross layer approach (XLA) algorithm for fault management and it is verified using high level language.

One of the latest computer-related problems to arise is phishing, which is the criminally fraudulent process in which e-mails lure unsuspecting victims into giving up user names, passwords, Social Security numbers, and account information after linking to counterfeit bank, credit card, and e-commerce Web sites. Phishers are mainly targeting the customers of banks and online payment services. It is so pervasive that even corporate and government sites are actively informing the users on this issue. This paper presents a solution, which aims to protect users against email phishing attacks. Main key words which are used are a user ID and password, and the other is an authenticating question. An e-mail that a bank sends to user contains some image and preselected question which the phisher couldn’t have, that the user chose when setting up the account. This proves to the user that the e-mail came from the bank or business, not a phisher, and that it is safe to use the provided link. The user is asked to provide his ID and the bank checks if the ID is valid or not. If the ID is valid, the user is asked to load the image which has been mailed and answer his preselected question along with a request for their logon password. After receiving the correct password, user is allowed to access the Web site.

Over the last decade, many clone detection tools have been proposed with good results. However, these tools are still unsatisfactory and either incomplete or inefficient. In particular, the recall and precision on the average remain unresolved. We introduce,

CloneManager

, a tool specifically proposed for the detection of functional Code Clones and to evaluate the precision and recall in C source code. It relies on the formulated metrics and those values are utilized during the detection process. Our tool is also compared with the two other existing techniques for the open source project Weltab.

Document image analysis refers to algorithms and techniques that are applied to images of documents to obtain a computer-readable description from pixel data. This paper presents a Top-down approach for document image segmentation based on recursively finding rectangular blocks in the image. The proposed algorithm recursively finds the rectangular regions in the image document using vertical and horizontal profiles and each identified block is further analyzed to identify its type whether it is text, picture or table. The method used is not language specific. Documents of different languages have been tested and satisfactory results have been obtained. In this paper we have also briefly described the existing algorithms and the methods that are used for document segmentation.

In an OFDM system, various modulation methods can be used in order to encode the binary information. If a differential phase modulation scheme is chosen, data can be encoded in the relative phase of consecutive symbols in each subchannel or in the relative phase of symbols in the adjacent subchannels. The two methods exhibit two essentially different behaviors in fading conditions. In this paper, we shall analyze the BER performances of both modulation types. The performance will be analyzed by considering a multipath fading channel, as in mobile communication systems.

Mobile Payment services have become an essential for every human being at the personal level and professional level. To create global and open standard solutions for mobile payments, there are number of consortia that have taken the initiatives. However, none of the consortia is widely accepted due to lack of security and many companies participate in more than one consortium. The current status of the consortia is at infancy stage. A study reveals that there is no specific and global mobile payment consortium for educational institutions to collect the fees as well as for student community to pay the fees. To overcome, an innovative model has been proposed namely, Mobile Payment Consortia System which provides an end-to-end security among the mobile user, institution, MPCS server and the institution bank using Public Key Infrastructure (PKI). This paper mainly focuses on secure communication between the mobile user and the payment gateway namely, MPCS Server.

In this paper a framework called Team Automata (TA) has been introduced for capturing notions like co-ordination, collaboration and cooperation in distributed systems. It consists of component automata, combined in a coordinated way such that they can perform shared actions. Moreover, we consider a Spatio -Temporal Role Based Access Control Model (STRBAC) in the context of the team automata model, it describes the usage of the model and utility for capturing information security structures as well as critical coordination between these structures on the basis of Spatio -Temporal metaphor. In this work, Known access control strategies are given a formal description in terms of synchronization in TA.

To achieve excellence in education and produce quality students which can be absorbed by the organizations, feedback of students is collected to identify holes in the current teaching methodology and other services by institutions. A large amount of data is generated every semester and it is worthless to collect these data unless it is utilized for knowledge discovery. Visual data mining is most appropriate for representation when data size grows to Terabytes.

Proposed solution is divided into various stages: Data collection, Data preprocessing, Data representation and Data mining. An online feedback system is developed in-house for data collection. Preprocessing stage retrieves relevant fields of the data base for representation. Preprocessed data is visually represented using pixel oriented technique which generates an image of entire data. In data mining state, the knowledge patterns are discovered from generated image.

The High leakage current in deep sub-micrometer region is becoming a significant contributor to power dissipation in CMOS circuits as threshold voltage, channel length, and the gate oxide thickness are reduced. As the standby current in memories is critical in low-power design. By lowering the supply voltage (VDD) to its standby limit, the data retention voltage (DRV), SRAM leakage power can be reduced substantially. The DRV increases with transistor mismatches. In this paper, we demonstrated the drowsy cache technique which shows a decrease in the leakage current dissipation in deep sub-micron designs of memory cells and embedded memories. The focus of this work is to simulate an effective scheme for SRAM leakage suppression in battery-powered mobile applications.

A Mobile Ad-hoc Network (MANET) is a system of wireless mobile nodes dynamically self-organizing in arbitrary and temporary network topologies. People and vehicles can thus be inter-networked in areas without a pre-existing communication infrastructure. The design of network protocols for MANETs is a complex issue. Dynamic Source Routing (DSR) and Ad-hoc On demand Distance Vector (AODV) protocol are two well-known on-demand routing protocols. A major disadvantage of these two protocols is, the problem associated with routing of packets through flooding, resulting in congestion. Path accumulation feature of DSR can be used in AODV and then an efficient path for the routing can be discovered using Minimum Route Spanning Tree Protocol.

Money Transaction has become common, frequent and a necessity in the current living and carrying cash always with a person is not a practical solution. The current trend of carrying the credit cards have become a crucial part of life and carrying of multiple cards is common nowadays. There is a risk involved when a credit card is stolen. Every one carries mobile phone. Our solution approach is to develop a system in which functions of the credit card is incorporated in mobile phone. The mobile phone is then used as a credit card and it replaces the function of swapping of the credit card each time we shop. Our system will have credit card application stored on mobile phone. This application will have all the information related to credit card operation, stored in encrypted form in the mobile phone. Further, this information is protected by a password. When a person desires to make any transaction through the mobile phone, the credit card data is passed from the mobile to the vendor machine through a Bluetooth communication interface. The vendor machine validates the credit card data with the corresponding bank in standard fashion and issue the receipt. Thus this eliminates the need for carrying credit card physically. This will require modification on mobile software for safe storage of credit card information and few hardware modifications (add-on) to the vendor terminal for communication using Bluetooth. This paper focuses on various design issues of this application where mobile phone will act as a credit card.

Three-party authenticated key exchange protocol is an important cryptographic technique in the secure communication areas, by which two clients, each shares a human-memorable password with a trusted server, can agree a secure session key. Recently, Lu and Cao proposed a simple three party password-based key exchange protocol (STPKE protocol). They claimed that their protocol is secure, efficient and practical. Unlike their claims, Kim & Choi proved that the STPKE protocol is vulnerable to Undetectable on-line password guessing attacks, and suggested an enhanced protocol (STPKE’ protocol). In this paper, an Unknown key share attack on STPKE’ protocol is demonstrated.The attack is implemented using a comprehensive set of experiments and reported. Additionally, the countermeasures to resist the above attack are discussed.

Service Oriented Architecture is an architectural paradigm and discipline that may be used to build infrastructures enabling those with needs (consumers) and those with capabilities (providers) to interact via services across disparate domains of technology and ownership. Services act as the core facilitator of electronic data interchanges yet require additional mechanisms in order to function. Services comprise intrinsically unassociated, loosely coupled units of functionality that have no calls to each other embedded in them. Instead of services embedding calls to each other in their source code, they use defined protocols that describe how one or more services can "talk" to each other.. SOA may be used for business applications, or in government and the military.

This paper presents a interprocedural dynamic slicing for handling pointers in programs. The use of pointers presents serious problems for software productivity tools for software understanding, restructuring, and testing. Pointers enable indirect memory accesses through pointer dereferences, as well as indirect procedure calls (e.g., through function pointers in C). Such indirect accesses and calls can be disambiguated with pointer analysis. In addition to a conservative analysis, we propose an optimistic algorithm that reflects common program’s slicing. This paper uses the proposed pointer alias analyses to infer the types of variables in C programs and shows that most C variables are used in a manner consistent with their declared types. The proposed concepts for interprocedural dynamic slicing we have proposed here is more efficient then the existing concepts as it gives a detailed idea about the slices that can be obtained for one dimensional pointers, two dimensional pointer, pointer to arrays, dynamic memory allocation.

Image steganography is a covert communication method that uses an image as the cover to hide the truth from potential attackers that some secret message hidden in the image is being transported. In other words, steganography is a collection of cryptographic techniques that provide protection to the secret message by offering it the appearance of an image. In this paper, a specific image based steganography technique for communicating information more securely between two locations is proposed. The author incorporated the idea of secret key and password security features for authentication at both ends in order to achieve high level of security. As a further improvement of security level, the information has been permuted, encoded and then finally embedded on an image to form the stego image. Besides this segmented objects extraction and reassembly of the stego image through normalized cut method has been carried out at the sender side and receiver side respectively in order to prevent distortion of the Stego image during transmission.

The goal of this paper is to present an

ant

system

e

mbedded with

l

ocal

s

earch named as ANTELS for quadratic assignment problem (QAP) which is a widely accepted mathematical formulation for facility layout problem (FLP). The performance of the proposed ANTELS is compared to other well known heuristics/ Meta-heuristics of FLP as well as other existing ant system. The computational results show that the proposed ANTELS provides promising result.

Enterprise Resource Planning (ERP) systems are presently offering some attractive features to incorporate some sorts of decision support capabilities. Still ERP system itself cannot make decisions but it keeps the data and records of organizational transactions in a very systematic and logical manner. The operational level managers and middle level managers for regular organizational transactions and analysis and reporting mainly use ERP systems. We argue that automated decision supports and strategic initiatives can be made with the present ERP system environment. This paper proposes a conceptual model of Automated Decision Support System with ERP (ADSSERP) system environment. The model can encompass some major decision making problems and strategic initiatives having mid term and long term decisional scopes based on a present ERP system for an enterprise without affecting the architecture of existing ERP system.

Many manufacturers want to improve their product design. However, most manufacturers cannot readily produce a good design, even though they recognize the importance of design. The case of IKEA was considered as an example of how the design bureau in a company should be managed to bring about a good design. It can be summarized as a) concept (a policy is advocated, and a concept is produced), b) Environment (an environment that brings about concept innovation is supplied), c) Risk-Taking (decisions are made that involve risk).

This research focuses on the effects of mannequins on consumer’s perception and shopping attitude in the context of retail clothing sales. Mannequins impact customers by giving them a look to aspire to. Mannequins are great for showing just how certain garments can be worn. A research was conducted based upon the mannequin displays in the retail stores. According to the results, consumers seem to have a more positive perception of color display, design, appearance. Consumers perceiving the displays positively and feels that it is creating a new sense and life style by providing complete visualization.

Research studies the transfer of knowledge with a very technical perspective while studies also establish various dimensions that make a teacher liked by students or that render a teacher effective (for e.g. Barnett, 2003; Bettinger and Long, 2005) but whether or not do such dimensions affect the knowledge receptivity of students is highly debatable. This study is an attempt to address this contentious issue. The study has revealed that there are many instructor characteristics that may lead to an instructor’s overall effectiveness, students’ liking for the instructor and their positive evaluation of the instructor but they may not necessarily impact the knowledge receptivity of students.

Some researchers have not used the ‘strong’ formulations for single and multistage warehouse location problems despite it being well known earlier. In this paper we give ‘strong’ and ‘weak’ formulations of the single stage uncapacitated warehouse location problem (SSUWLP) by borrowing from the literature on capacitated version of the problem. The constraints borrowed are ‘weak’ constraints, demand side ‘strong’ constraints and the supply side ‘strong’ constraints. We give four different formulations of the SSUWLP and also empirical results for the relative strengths of their linear programming (LP) relaxations.

CRM has redefined the relationship between customers and the companies that serve them. It is premised on a simple logic of creating, maintaining and retaining customers for profitable long term association and maximizing the value through customer relationships. Even the pharma sector has also shown its confidence towards this upcoming expensive and technology intensive system. This article describes the concepts and mechanism of CRM for the pharma sector, illustrates its need for pharma sector and throws light on the benefits and pitfalls of CRM for pharma sector.

HR for long has been viewed as being purely a process driven function. In today’s competitive environment where everyone is being asked about contribution in terms of value addition, HR is no exception. HR’s true strategic opportunity lies in its ability to evolve from focusing primarily on tactical administrative transactions to becoming an outcome driven function, where it is seen as a function that adds value. Adding value calls for integrating the people strategies with business strategies in a way that advances bottom line. The paper analyses how HR functions in organizations that are Best Employers in India have demonstrated the role of strategic business partner.

The Indian Technical &management education sector is undergoing drastic changes in the past. The focus is shifted from public sector to private sector up in technical education. The Govt. has come with a number of regulations and targeted the private sector investment in education. The Govt. is all set to introduce a law for regulation of foreign university entry in the country. The Govt. is also starting to focus on primary and secondary education sectors by providing same plans and policies for these sectors. This paper mainly focus on development in education sector in post independence period and recent trend in technical education; an Indian perspective.