Search

Automatic opinion mining of web 2.0 texts is critical for understanding people's viewpoints and assisting them in making informed decisions. Trained machines perform well in the same domain to predict the sentiment polarity but performance decreases drastically when the same machine is applied directly to other domains. Creating a labeled data for every field is an expensive and inefficient procedure. We introduce a framework to determine the domain-independent words in both domains by employing feature extraction techniques to bridge the gap across the domains. To train a classifier and analyze the sentiment polarity of the target domain, we employed these features. The experimental results are compared with different existing state-of-art approaches and evaluate the execution and effectiveness of the suggested framework.

The Internet of Things (IoT) has great potential to change the fundamental way of interacting with technology in daily life, and for ease, it also observes and records user preferences that challenge privacy in another way. IoT devices are suspended to extensive usage even more than mobile phones and attain more access to private and secured data. With the growth of connected devices, mobile security is already a challenge, so perspective challenges for IoT connected devices must be much greater than considered at present and can be primarily categorized into safety, security and privacy. Rigorous development of security techniques should be an essential process toward the foundation of strong IoT systems to achieve and retain user trust. The survey in this paper reviewed and analyzed security principles, attacks and countermeasures at different layers of IoT-layered architecture, considering the bottlenecks of IoT systems.

Mobile Ad Hoc Network requires various types of applications’ communication. One of the important is multimedia communication. Such flows demand stringent requirements for Quality of Service. Multimedia or real flows need to book resources such as bandwidth. But in some scenario bandwidth may be occupied by some other resources. In some situation high priority real flows has to wait for resource allocation on a shorter path or may be supplied with another longer path. To overcome such a situation we have provided hop to hop preemption on the basis of number of preemption required on a hop and also by calculating threshold priority difference. In this article, we have proposed Dynamic Flow Preemption (DFP) which will preempt the low priority flow (using some constraints), by another high priority flow. We have evaluated DFP with AdHoc QoS On Demand Routing AQOR. AQOR is considered as it maintains multiple paths like DFP. NS2 simulator is used to compare both the protocols. Result from different par...

Sensor Node (SN) is a vital component in any automated system. It is an electro-chemical or electro-mechanical device designed to observe the specific changes occurring in its vicinity. Wireless Sensor Network (WSN) is a system formed by the group of wirelessly connected SNs which are deployed at distinct geographical locations within a candidate region. Performance of any WSN in terms of connectivity, coverage and life mainly depends on the distribution of SNs. In this paper, we propose a Neighbor Assisted Deployment Scheme (NADS) to uniformly distribute the randomly spread Mobile Sensor Nodes (MSNs) within a candidate region. Entire candidate region is divided into Square Sub-Regions (SSRs) which are further divided into regular hexagons and center of these hexagons forms the Desired Locations (DLs) for placement of MSNs. NADS uses 3-phase incremental approach for optimal placement of MSNs. Resultant of each phase forms the infrastructure to assist the placement of remaining unplaced MSNs. In each phase MSNs communicate locally with each other to elect the most appropriate one among them to relocate to the nearest DL. Factors such as dropping height, wind speed, parachute size, battery size and MSN weight are considered to determine the area approachable by any dropped MSN. This limits the number of computations performed at each MSN, regardless of the size of the candidate region. The scheme is simulated and a comparative study is made with some existing systems. It is observed that NADS is realistic, scalable and yields better performance in terms of coverage, connectivity, setup-time and energy-efficiency with minimum number of MSNs as compared to existing schemes.

UNLABELLED HgsDb, a database is developed to organize the data under a single platform to facilitate easy access for researcher to get information on migration and molecular risk assessment. In past, human beings migrate from one place to other over the globe in search of food and better habitat, where they got adapted. These adaptations are visible in the form of change in color, facial pattern, average height, eye shape, hair texture, etc. This leads to origin of different race of human being. The adaptations are remarkable when move from equator to either poles. There are hundreds of different haplogroups reported on both maternal and paternal sites. This database provides overview of seventy-six major Haplogroup of mt-DNA and Y-DNA with their sub classes supplemented with structural information of individual Haplogroup responsible for various factor such molecular risk assessment, migration and origin. They help genealogist to gain deep insight information about their maternal and paternal patterns. , we had collected data from open source such as National Center for Biotechnology (NCBI), to develop this database for providing information, which Will helps the medical biology, molecular biology, genealogy and for designing personalized medicine. AVAILABILITY www.gbpec.ac.in/research/HgsDb/.

Micro-blogging web services such as Twitter, the user is often bombarded with tons of information and raw data, with user unable to classify it into right category. The solution to overcome this problem can be derived from automatic text classification process. Social networking websites often limit their users to put up a short text message of length 140 characters only. Hence classifying this raw data continuously on these microblogging websites is a tedious task, as one has to deal with short text. Short text messages are difficult to classify as they have lack of semantic information and they have high risk of getting misclassified. In this research paper, a methodology has been developed that incorporates preparation of semantic database and then employ it to extract the necessary classification features from the database. This prepared database is then used for binary feature extraction from the set of user tweeted database hence the process of extracting features from the available database based on the semantic database approach has been presented. The basic of this paper is mainly focused on extracting nine features and then reducing the features to seven features using logical operations. The process of reducing the features not only reduces the complexity of the written code but also saves the database memory required to save the extracted feature for master training database. The features so extracted are easier to use and operation has less complexity of generation than compared to features generated by other available algorithms like Bag-of-Words.

Mobile Ad hoc Networks are vulnerable to various attacks due to its nature, as it is a multihop process between sender and receiver. One of these attacks is black hole attack, which will simply delete any packet instead of forwarding it. Sometimes these kinds of malicious nodes may behave as true node giving impression that it is not malicious, while rest of the time they are dropping all packets, so affecting the QoS. Discovering such kind of malicious nodes are very difficult as isolating them is not easy because their malicious behavior is in on and off fashion. In our paper, we had inspected such nodes which are behaving like a black hole for variable time intervals on different parameters. Further for deeper study, we have considered different number of such malicious nodes to give more insight on comparisons.

mobile ad hoc network (MANET), the mobility of the ad hoc nodes can cause route failures and necessitates the new route discovery. Also the mobility can result in delay and overhead. In this paper, we propose a multi-criteria gateway selection and multipath routing protocol for hybrid MANET that considers mobility metric as one of the criterion for the selecting the gateway. For gateway selection, a combined weight value is determined based on the metrics mobility, inter and intra MANET traffic load and residual energy using simple additive weighing (SAW) technique. Among the selected path from the multiple paths, the gateway with maximum weight is selected. If such a gateway does not exist, alternate path is selected from the multi path set. By simulation results, we show that our proposed protocol is more efficient technique for gateway selection.

Wireless mobile adhoc network (MANET) is a dynamic network. Nodes in a MANET have high degree of mobility from one domain to another in a particular time interval. In such a dynamic network, security is a major concern. In this paper, the authors propose an inter domain agent based secure authorization and communication for mobile clients/nodes (MCs) in MANET. Mobile agents (MAs) are software programs that support the mobility of clients in different domain and provide necessary resources to the clients for safe execution. It also shares the key with MCs in different domains. An algorithm for secure authorization and communication between MCs having mobility in different domains is proposed. The scheme is evaluated on ns-2 w.r.t. metrics such as overall cost in terms of overhead generated, admission and traceability cost, and itinerary chosen by MAs w.r.t. mobility of MCs.

Mining biological data is an emergent area at the intersection between bioinformatics and data mining (DM). The intelligent agent based model is a popular approach in constructing Distributed Data Mining (DDM) systems to address scalable mining over large scale distributed data. The nature of associations between different amino acids in proteins has also been a subject of great anxiety. There is a strong need to develop new models and exploit and analyze the available distributed biological data sources. In this study, we have designed and implemented a multi-agent system (MAS) called Agent enriched Quantitative Association Rules Mining for Amino Acids in distributed Protein Data Banks (AeQARM-AAPDB). Such globally strong association rules enhance understanding of protein composition and are desirable for synthesis of artificial proteins. A real protein data bank is used to validate the system.

Cluster computing harnesses the combined computing power of multiple processors in a parallel configuration. Cluster Computing environments built from commodity hardware have provided a cost-effective solution for many scientific and high-performance applications. In this paper we have presented design and implementation of a cluster based framework using mobile code. The cluster implementation involves the designing of a server named MCLUSTER which manages the configuring, resetting of cluster. It allows a user to provide necessary information regarding the application to be executed via a graphical user interface (GUI). Framework handles- the generation of application mobile code and its distribution to appropriate client nodes, efficient handling of results so generated and communicated by a number of client nodes and recording of execution time of application. The client node receives and executes the mobile code that defines the distributed job submitted by MCLUSTER server and replies the results back. We have also the analyzed the performance of the developed system emphasizing the tradeoff between communication and computation overhead.

Advancing technology in wireless communication offers users anytime, anywhere access to information and network resources without restricting them to the fixed network infrastructure. Mobile computing represents a shift in the distributed systems paradigm. The potential of decoupled and disconnected operation, location-dependent computation and communication and powerful portable computing devices gives rise to opportunities for new patterns of distributed computation that require a revised view of distributed systems. Mobile environment brings different challenges to users and service providers when compared to fixed, wired networks. Mobility brings uncertainties, as well as opportunities to provide new services and supplementary information to users in the locations where they find themselves. A mobile user is one who, on occasion, disconnects from his/her home network to change location and then reconnects, possibly using a different access technology. A necessary feature of mobility management is the ability to continue to provide system and network services to mobile users seamlessly, regardless of their location and the form of their connection. In general, most application software, operating systems and network infrastructures are intended for more conventional environments and so the mobile user has great difficulty in exploiting the computational infrastructure as fully as he/she might. The Internet Roaming solution for corporate wireless data users integrates mobile networking across private wireless local area networks (WLANs), public WLANs and cellular data networks. In this study we have developed an infrastructure using mobile agent for integrating the Wireless LAN and cellular data called Internet Roaming System (IRS). It is implemented on PMADE mobile agent system developed at IIT Roorkee.

In order to disperse the load on a Web server, generally the server cluster is configured to distribute access requests, or mirror servers are distributed geographically on different networks. Use of the Internet and the World-Wide-Web (WWW) has become widespread in recent years and mobile agent technology has proliferated at an equally rapid rate to evenly distribute the requests to web servers through load balancing. There are various loads balancing policies came into picture. Primitive one is Message Passing Interface (MPI). Its wide availability and portability make it an attractive choice, however the communication requirements are sometimes inconventior and inefficient when implementing the primitives provided by MPI. Mobile agent (MA) based approach have the merits of high flexibility, efficiency, low network traffic, less communication latency as well as highly asynchronous. In this study we present dynamic load balancing using mobile agent technology in which when a node is overloaded, task migrates to less utilized nodes so as to share the workload. However, the decision of which nodes receive migrating task is made in real-time by design and implementation of a framework called Platform for Load balancing (PLB). It is implemented on PMADE (A Platform for Mobile Agent Distribution and Execution). PLB integrated web servers can dispatch MAs to retrieve load information and accomplish load redistribution on all servers. The performance evaluation demonstrates that the PLB framework provides a foundation to develop efficient load balancing schemes on wide range of web server systems from cluster to open network and the results of a comparison of PLB, with some existing ones, is also reported.

Mobile Ad hoc Networks (MANETs) always bring challenges to the designers in terms of its security deployment due to its dynamic and infrastructure less nature. In the past few years different researchers have proposed different solutions for providing security to MANETs. In most of the cases however, the solution is targeting a particular attack or multiple attacks but fails to find the root cause of it. In this paper we use system level security for deploying the overall security in MANETs. The system level security is the security at node level as we believe that if nodes behave properly and in a coordinated fashion, the insecurity level will go drastically down. Our simulation results gives the advantage of using this approach

The art of translation is as old as written literature. Developments since the Industrial Revolution have influenced the practice of translation, nurturing schools, professional associations, and standard. In this paper, we propose a method of translation of typed Kannada text (taken as an image) into its equivalent English text. The National Instruments (NI) Vision Assistant (version 8.5) has been used for Optical character Recognition (OCR). We developed a new way of transliteration (which we call NIV transliteration) to simplify the training of characters. Also, we build a special type of dictionary for the purpose of translation.

WebOS (Web based operating system) is a new form of Operating Systems. You can use your desktop as a virtual desktop on the web, accessible via a browser, with multiple integrated built‐in applications that allow the user to easily manage and organize her data from any location. Desktop on web can be named as WEBtop. This paper starts with a introduction of WebOS and its benefits. For this paper, We have reviewed some most interesting WebOS available nowadays and tried to provide a detailed description of their features. We have identified some parameters as comparison criteria among them. A technical review is given with research design and future goals to design better web based operating systems is a part of this study. Findings of the study conclude this paper.

We have designed a security system using MATLAB. The system uses the optimum components and is very useful in tracking visitors to our homes, offices and other meeting places. The system works in two modes: Automatic Mode & Manual Mode. In the Automatic Mode, the snapshot of the person standing outside is taken with the help of a webcam and it is then compared with the set of predefined pictures in the database and if matched, the door is opened automatically. In the Manual Mode, the live preview is sent to the laptop screen and is recorded according to user's commands. The door is opened, and then date, time and recording is saved in the database.

Cloud computing is the growing field in IT industry since 2007 proposed by IBM. Another company like Google, Amazon, and Microsoft provides further products to cloud computing. The cloud computing is the internet based computing that shared recourses, information on demand. It provides the services like SaaS, IaaS and PaaS. The services and recourses are shared by virtualization that run multiple operation applications on cloud computing. This discussion gives the survey on the challenges on security issues during cloud computing and describes some standards and protocols that presents how security can be managed.

Mining Educational data is an emerging interdisciplinary research area that mainly deals with the development of methods to explore the data stored in educational institutions. The educational data is referred as Edu‐DATA. Queries related to Edu‐DATA are of practical interest as SQL approach is insufficient and needs to be focused in a different way. The paper aims at developing a technique called Edu‐MINING which converts raw data coming from educational institutions using data mining techniques into useful information. The discovered knowledge will have a great impact on the educational research and practices. Edu‐MINING explores Edu‐DATA, discovers new knowledge and suggests useful methods to improve the quality of education with regard to teaching‐learning process. This is illustrated through a case study.

A unique approach has been developed to study patterns in ragas of Carnatic Classical music based on artificial neural networks. Ragas in Carnatic music which have found their roots in the Vedic period, have grown on a Scientific foundation over thousands of years. However owing to its vastness and complexities it has always been a challenge for scientists and musicologists to give an all encompassing perspective both qualitatively and quantitatively. Cognition, comprehension and perception of ragas in Indian classical music have always been the subject of intensive research, highly intriguing and many facets of these are hitherto not unravelled. This paper is an attempt to view the melakartha ragas with a cognitive perspective using artificial neural network based approach which has given raise to very interesting results. The 72 ragas of the melakartha system were defined through the combination of frequencies occurring in each of them. The data sets were trained using several neural networks. 100% accurate pattern recognition and classification was obtained using linear regression, TLRN, MLP and RBF networks. Performance of the different network topologies, by varying various network parameters, were compared. Linear regression was found to be the best performing network.

Today, many process control problems can be adequately and routinely solved by conventional PID control strategies. The overriding reason that the PID controller is so widely accepted is its simple structure which has proved to be very robust with regard to many commonly met process control problems as for instance disturbances and nonlinearities. Relay feedback methods have been widely used in tuning proportional‐integral‐derivative controllers due to its closed loop nature. In this work, Relay based PID controller is designed and successfully implemented on TRMS (Twin Rotor MIMO System) in SISO and MIMO configurations. The performance of a Relay based PID controller for control of TRMS is investigated and performed satisfactorily. The system shares some features with a helicopter, such as important interactions between the vertical and horizontal motions. The RTWT toolbox in the MATLAB environment is used to perform real‐time experiments.

Security is now‐a‐days one of the major problems because of many reasons. Security is now‐a‐days one of the major problems because of many reasons. The main cause is that software can't withstand security attacks because of vulnerabilities in it which are caused by defective specifications design and implementation. We have conducted a survey asking software developers, project managers and other people in software development about their security awareness and implementation in Software Development Life Cycle (SDLC). The survey was open to participation for three weeks and this paper explains the survey results.

This article presents a common solution to Peer‐to‐Peer (P2P) network problems and distributed computing with the help of “Neighbor Assisted Distributed and Scalable Environment” (NADSE). NADSE supports both device and code mobility. In this article mainly we focus on the NADSE based resource management technique. How information dissemination and searching is speedup when using the NADSE service provider node in large network. Results show that performance of the NADSE network is better in comparison to Gnutella, and Freenet.

Data Mining (DM) is the process of automated extraction of interesting data patterns representing knowledge, from the large data sets. Frequent itemsets are the itemsets that appear in a data set frequently. Finding such frequent itemsets plays an essential role in mining associations, correlations, and many other interesting relationships among itemsets in transactional database. In this paper an algorithm, SAR (Strong Association Rule), is designed and implemented to check whether an Association Rule (AR) is strong enough or not. Apriori algorithm is also implemented to generate Frequent k-itemsets. A Binary Transactional Dataset is used for implementing the algorithm in java language.

In the past few years, peer‐to‐peer (P2P) networks have become an extremely popular mechanism for large‐scale content sharing. P2P systems have focused on specific application domains (e.g. music files, video files) or on providing file system like capabilities. P2P is a powerful paradigm, which provides a large‐scale and cost‐effective mechanism for data sharing. P2P system may be used for storing data globally. Can we implement a conventional database on P2P system? But successful implementation of conventional databases on the P2P systems is yet to be reported. In this paper we have presented the mathematical model for the replication of the partitions and presented a hierarchical based data distribution scheme for the P2P networks. We have also analyzed the resource utilization and throughput of the P2P system with respect to the availability, when a conventional database is implemented over the P2P system with variable query rate. Simulation results show that database partitions placed on the peers with higher availability factor perform better. Degradation index, throughput, resource utilization are the parameters evaluated with respect to the availability factor.

Polymorphism means one thing exists in many forms of its own with each form having different implementation of its own. Polymorphism can be compile time or runtime. It is concern of lifetime of object. The lifetime can be determined at compile time or runtime. The compiler has a such knowledge to determine static analysis of source code.

Logarithmic function has been designed on basis of multiplicative normalization and then its testing is been done using tetraMAX. It is observed that 7050 possible faults can be there in the design and tetraMAX ATPG can provide test coverage of 99.29%. Using design compiler .db file is generated which is used for functional verification of the design with respect to RTL design. Compare points are shown by cone views of the design.

Mobile Agents are softwares migrating from one node to another to fulfill the task of its owner. The introduction of mobile agents has reduced network latency, network traffic a lot but at the same time it has increased the vulnerability for attacks by malicious hosts. One such attack is ‘Denial of Service’, once the agent is launched it is free to roam without any control of its owner, this on one hand decreases the cost of agent—owner interaction and on the other hand increases the chances of ‘Denial Of Service’. In Denial Of Service attack the malicious host may deny resources required by the agent and kill the agent, thus the result computed so far is lost and this may happen every time the agent visits any malicious host. In this paper we continued the work done in [10] in which the authors proposed techniques by which owner can detect the malicious host for ‘Denial Of Service’ but they did not covered technique for dynamic routes i.e. where the host or agent initiate migrations to hosts which were not contained in the route composed by the owner. We introduced an algorithm and a model which can be useful for the above purpose.

The security issues of mobile agent systems have embarrassed its widespread implementation. Mobile agents that move around the network are not safe because the remote hosts that accommodate the agents initiates all kinds of attacks. These hosts try to analyze the agent’s decision logic and their accumulated data. So, mobile agent security is the most challenging unsolved problems. The paper analyzes various security measures deeply. Security especially the attacks performed by hosts to the visiting mobile agent (the malicious hosts problem) is a major obstacle that prevents mobile agent technology from being widely adopted. Being the running environment for mobile agent, the host has full control over them and could easily perform many kinds of attacks against them.

With the increasing popularity of social networks like Facebook and MySpace, such sites have lately become the favourite destinations for spammers and attackers. Social networks have experienced complex social engineering attacks, massive spam and aggressive malware distribution in the recent past. This paper presents a practical case study of social engineering, malware distribution and phishing attacks against social networking sites that are identified over last few months. It is explained how private data of the users are exposed to attackers and how easily their privacy is compromised as a result of these attacks and their own careless behaviour.

The World Wide Web suffers from scaling and reliability problems due to overloaded and congested proxy servers. Caching at local proxy servers helps, but cannot satisfy more than a third to half of requests; more requests are still sent to original remote origin servers. In this paper we have developed an algorithm for Distributed Web Cache, which incorporates cooperation among proxy servers of one cluster. This algorithm uses Distributed Web Cache concepts along with static hierarchies with geographical based clusters of level one proxy server with dynamic mechanism of proxy server during the congestion of one cluster. Congestion and scalability problems are being dealt by clustering concept used in our approach. This results in higher hit ratio of caches, with lesser latency delay for requested pages. This algorithm also guarantees data consistency between the original server objects and the proxy cache objects.

An approach to overcome the accidental problem happens in the night, while the driver is drunk or feels sleepy. This system controls the speed of the vehicle at steep turns. It is designed, to provide the information to the driver, whether the next turn is right/left, is there any traffic jam or land sliding in the coming way. It also assists during heavy rains and mist conditions. It may be implemented by using computer or by using a dedicated microcontroller. If we have a group of vehicles connected with the system then we can locate them by using the cameras, at different places. Information regarding any vehicle can be transmitted anywhere using Internet provided at the monitoring system, so as to prevent accidents or provide information during any calamity.

Web services providing weather information are not new. The existing web services working on this kind of fields can provide more precised information if the concerned data is collected in a distributed fashion using a sensor network. Longer the lifetime of the sensor network, longer is the service provided without interruption. In this paper we propose a web service for providing weather information with a sensor network as the backbone. We have used a Fermat point based forwarding technique to minimize the energy consumption of the sensor network which eventually helps the web service work in an uninterrupted fashion for a longer duration, as the life time of the network has prolonged.

Torrenting is a highly popular peer to peer file sharing activity that allows participants to send and receive files from other computers. As it is an advantageous technique as compare to traditional client server file sharing in terms of time, cost and speed, some drawbaks are also there. Content unavailability, lack of anonymity, leechers, cheaters and download speed consistency are the major problems to sort out. Efforts are needed to resolve these problems and to make this better application. Legal issues are also one of the measure factors of consideration. BitTorrent metafiles themselves do not store copyrighted data. Whether the publishers of BitTorrent metafiles violate copyrights by linking to copyrighted material is controversial. Various countries have taken legal action against websites that host BitTorrent trackers. Eg. Supernova.org, Torrentspy. Efforts are also needed to make such a useful protocol legal.

The primary goal of data warehouse is to free the information locked up in the operational database so that decision makers and business analyst can make queries, analysis and planning regardless of the data changes in operational database. As the number of queries is large, therefore, in certain cases there is reasonable probability that same query submitted by the one or multiple users at different times. Each time when query is executed, all the data of warehouse is analyzed to generate the result of that query. In this paper we will study how using query cache improves performance of Data Warehouse and try to find the common problems faced. These kinds of problems are faced by Data Warehouse administrators which are minimizes response time and improves the efficiency of query in data warehouse overall, particularly when data warehouse is updated at regular interval.

More than 700 years ago, watermarks were used in Italy to indicate the paper brand and the mill that produced it. By the 18th century watermarks began to be used as anti counterfeiting measures on money and other documents.The term watermark was introduced near the end of the 18th century. It was probably given because the marks resemble the effects of water on paper. The first example of a technology similar to digital watermarking is a patent filed in 1954 by Emil Hembrooke for identifying music works. In 1988, Komatsu and Tominaga appear to be the first to use the term “digital watermarking”. Consider the following hypothetical situations. You go to a shop, buy some goods and at the counter you are given a currency note you have never come across before. How do you verify that it is not counterfeit? Or say you go to a stationery shop and ask for a ream of bond paper. How do you verify that you have actually been given what you asked for? How does a philatelist verify the authenticity of a stamp? In all these cases, the watermark is used to authenticate. Watermarks have been in existence almost from the time paper has been in use. The impression created by the mesh moulds on the slurry of fibre and water remains on the paper. It serves to identify the manufacturer and thus authenticate the product without actually degrading the aesthetics and utility of the stock. It also makes forgery significantly tougher. Even today, important government and legal documents are watermarked. But what is watermarking, when it comes to digital data? Information is no longer present on a physical material but is represented as a series of zeros and ones. Duplication of information is achieved easily by just reproducing that combination of zeros and ones. How then can one protect ownership rights and authenticate data? The digital watermark is the same as that of conventional watermarks.

The anticipated increase in popular use of the Internet has created more opportunity in information dissemination, Ecommerce, and multimedia communication. It has also created more challenges in organizing information and facilitating its efficient retrieval. In response to this, new techniques have evolved which facilitate the creation of such applications. Certainly the most promising among the new paradigms is the use of mobile agents. In this paper, mobile agent and distributed database technologies are applied in the banking system. Many approaches have been proposed to schedule data items for broadcasting in a mobile environment. In this paper, an efficient strategy for accessing multiple data items in mobile environments and the bottleneck of current banking will be proposed.

A standard algorithm for LMS‐filter simulation, tested with several convergence criteria is presented in this paper. We analyze the steady‐state mean square error (MSE) convergence of the LMS algorithm when random functions are used as reference inputs. In this paper, we make a more precise analysis using the deterministic nature of the reference inputs and their time‐variant correlation matrix. Simulations performed under MATLAB show remarkable differences between convergence criteria with various value of the step size.

Sequential pattern mining is the process of applying data mining techniques to a sequential database, to extract frequent subsequences to discover correlation that exists among the ordered list of events. Web Usage mining (WUM) discovers and extracts interesting knowledge/patterns from Web logs is one of the applications of Sequential Pattern Mining. In this paper, we present a survey of the sequential pattern mining techniques based Web Access Pattern (WAP) tree on Web logs.

Size of the WWW is increasing day by day. Due to the absence of structured data on the Web, it becomes very difficult for information retrieval tools to fully utilize the Web information. As a solution to this problem, XML pages come into play, which provide structural information to the users to some extent. Without efficient indexes, query processing can be quite inefficient due to an exhaustive traversal on XML data. In this paper an improved content‐centric approach of Content‐Aware DataGuide, which is an indexing technique for XML databases, is being proposed that uses frequently used paths from historical query logs to improve query performance. The index can be updated incrementally according to the changes in query workload and thus, the overhead of reconstruction can be minimized. Frequently used paths are extracted using any Sequential Pattern mining algorithm on subsequent queries in the query workload. After this, the data structures are incrementally updated. This indexing technique proves to be efficient as partial matching queries can be executed efficiently and users can now get the more relevant documents in results.

In general, a mobile user travels in a predefined path that depends mostly on the user’s characteristics. Thus, tracking the locations of a mobile user is one of the challenges for location management. In this paper, we introduce a movement pattern learning strategy system to track the user’s movements using adaptive fuzzy logic. Our fuzzy inference system extracts patterns from the historical data record of the cell numbers along with the date and time stamp of the users occupying the cell. Implementation of this strategy has been evaluated with the real time user data which proves the efficiency and accuracy of the model. This mechanism not only reduces user location tracking costs, but also significantly decreases the call‐loss rates and average paging delays.

This document provides an overview of LAN traffic splitter. The tool “Local‐Area based Traffic splitter” is based on subnetting techniques. It is basically used for calculating subnets for sub‐dividing the LAN. Subnetting an IP Network can be done for a variety of reasons, including organization, use of different physical media (such as Ethernet, FDDI, WAN, etc.), preservation of address space, and security. The most common reason is to control network traffic. There are various techniques for calculating subnets that are considered by this tool. This paper will explore the various features of this tool and will also check the effect of subnetting after implementing it on the LAN. These instructions give you basic guidelines for preparing camera‐ready papers for conference proceedings.

Translation is one of the needs of global society for communicating thoughts and ideas of one country with other country. Translation is the process of interpretation of text meaning and subsequent production of equivalent text, also called as communicating same meaning (message) in another language. In this paper we gave detail information on how to convert source language text in to target language text using Transfer Based Approach for machine translation. Here we implemented English to Sanskrit machine translator using transfer based approach. English is global language used for business and communication but large amount of population in India is not using and understand the English. Sanskrit is ancient language of India most of the languages in India are derived from Sanskrit. Sanskrit can be act as an intermediate language for multilingual translation.

The World Wide Web is an interlinked collection of billions of documents. Ironically the huge size of this collection has become an obstacle for information retrieval. To access the information from Internet, search engine is used. Search engine retrieve the pages from indexer. This paper introduce a novel pipelining technique for structuring the core index‐building system that substantially reduces the index construction time and also clustering algorithm that aims at partitioning the set of documents into ordered clusters so that the documents within the same cluster are similar and are being assigned the closer document identifiers. After assigning to the clusters it creates the hierarchy of index so that searching is efficient. It will make the super cluster then mega cluster by itself. The pipeline architecture will create the index in such a way that it will be efficient in space and time saving manner. It will direct the search from higher level to lower level of index or higher level of clusters to lower level of cluster so that the user gets the possible match result in time saving manner. As one cluster is making by taking only two clusters so it search is limited to two clusters for lower level of index and so on. So it is efficient in time saving manner.