A Hybrid Approach for Replica Placement-Replacement (Harp-R Algo) Algorithm In Data-Grid

Vol. 3  Issue 2
Year: 2015
Issue:Jun-Aug
Title:A Hybrid Approach for Replica Placement-Replacement (Harp-R Algo) Algorithm In Data-Grid
Author Name:Ashish Kumar Singh and Udai Shanker
Synopsis:
Distributed database system is a network in which multiple clients are connected logically, but physically they are distributed and each client has their own database. Replication process in such a environment plays a vital role for reducing response time. The process of creating exact copy of file is known as replication. Replication process can be executed in two ways, one is static replication and another is dynamic replication. In a static replication, created replica exist in the system till user deletes it manually or it’s time expired. In dynamic replication, it will behave with change in user behavior and it will automatically create new replicas or delete replicas to improve performance. Data replication, as one of the popular services in a distributed database system, is used to increase the data availability and scalability. In this paper, the authors have proposed a data replication protocol in which they replicate those file which are popular in all, and replication process for those file whose success rate is high. In this paper proposed system uses the advantages of both static and dynamic replication.

Android App for ATM Location and Service Tracking

Vol. 3  Issue 2
Year: 2015
Issue:Jun-Aug
Title:Android App for ATM Location and Service Tracking
Author Name:B. Soundhariya Lakshmi, K. Ramya and D. Jagadeesan
Synopsis:
ATM (Automated Teller Machine) is important in our day-today lives for withdrawing money from our bank accounts. Android application for ATM finder is used to find ATMs around the user’s place, and it will reduce the time of searching the ATM. This application is a advanced and simple application in which ATM locator helps to find not only ATM's around us but also their service availability such as its working condition. This quick click series app is built for speed and ease of use. Types of ATM locations are preloaded to assist us with the optional name search, and it can also be done with the use of GPS. The ATM will periodically update its current status to the Bank, and in the proposed system the updated information from the Bank is obtained and utilized in the app to track the ATMs current service (Active or De-active). This will reduce the user's valuable time by making available the current working status of the ATM.

Dynamic Coalition Pattern for Distributed Coordination Of Multi-Agent Networks

Vol. 3  Issue 2
Year: 2015
Issue:Jun-Aug
Title:Dynamic Coalition Pattern for Distributed Coordination Of Multi-Agent Networks
Author Name:K. Ankitha Priyadarshini and B. Lalitha
Synopsis:
Self-organization presents a suitable model for building complex distributed systems which are self-managed. Here, the self-organizing behavior in multi-agent system is one of the most interesting aspect, where, an integrative selforganization mechanism is employed which associates the three principles of self-organization such as cloning, resource exchange and relation adaptation. Estimating the performance of this technique, it defeats when examined with three distinct assessments here and the scenario pretends to be agents with identical capacity. In this research paper the authors have considered agents with distinct capacities and the authors have aimed to design a paradigm to associate dynamic coalition pattern formation technique with self-organization, in an agent network which is well structured. Depending on self-organization rules, coalition formation is incorporated and it facilitates agents to dynamically adjust their degrees of entanglement in distinct coalitions and to unite new coalitions at any time if necessary. To attain the self-adaptation concept, a covenant protocol is employed.

UNIFI: A Protocol for Association Rule Mining In Vertically Distributed Databases

Vol. 3  Issue 2
Year: 2015
Issue:Jun-Aug
Title:UNIFI: A Protocol for Association Rule Mining In Vertically Distributed Databases
Author Name:M. Suresh Babu and K. F. Bharati 
Synopsis:
Data warehouses or databases may store large amount of data. In such databases, much processing power is needed for mining association rules. Therefore the solution used is a distributed system. In data mining, association rules are useful for analyzing and predicting customer behavior. They play an important part in shopping basket data analysis, product clustering, catalogue design and store layout. In this paper, the authors have used a protocol Unifying Lists of Locally Frequent Item sets (UNIFI) [1] for mining association rules in vertically partitioned data. In this Proposed system, the authors have aimed to implement the UNIFI protocol for Association Rule Mining in vertically distributed database. This protocol depends on the Fast Distributed Mining (FDM) algorithm like UNIFI-KC (Kantarcioglu and Clifton) in [6]. FDM is an unsecured version of the apriori algorithm.

An Efficient Ticket Based Mutual Authentication Between User And Server For Secure Data Transmission

Vol. 3  Issue 1
Year: 2015
Issue:Mar-May
Title:An Efficient Ticket Based Mutual Authentication Between User And Server For Secure Data Transmission
Author Name:Dr. D. Srujan Chandra Reddy and V. V. Sunil Kumar
Synopsis:
The increased use of the internet today can be attributed to increase in population. Protecting data in many times tougher than securing valueables. Especially, in data transmission between user and centralized server it is difficult to protect data from attackers; to predict attackers, users must cross verify many times, and both user and server must be mutually authenticated. The authors studied the previous research work and they introduced methods for mutual authentication but still the previous method is vulnerable from attacks like denial of service attack, password guessing, masquerade, etc. The authors have done cryptanalysis on previous research work and come to know that still their method is vulnerable and therefore the authors have proposed a new method of ticket based mutual authentication between user and server. Finally, in this paper the authors have done security analysis and explain how this method predicts attacks which are possible in the existing method.

A Computational Intelligence Technique for Effective Medical Diagnosis Using Decision Tree Algorithm

Vol. 3  Issue 1
Year: 2015
Issue:Mar-May
Title:A Computational Intelligence Technique for Effective Medical Diagnosis Using Decision Tree Algorithm
Author Name:Panigrahi Srikanth, Ch.Anusha and Dharmaiah Devarapalli 
Synopsis:
Now-a-days humankind suffer from many health complications. People are affected by progressive diseases (like as Heart, Diabetes, AIDS, Hepatitis and Fibroid) and their complications. Data mining (also known as knowledge discovery) is the process of summarizing the data into useful information by analyzing data from different perspectives. Data Mining is a technology for processing large volume of data that combines traditional data analysis methods with highly developed algorithms. Data mining techniques can be used to support a wide range of security and business applications such as work flow management, customer profiling and fraud detection. It can be also used to predict the outcome of future observations. Data mining techniques can be developed by the Decision Tree Algorithm. According to a recent survey of the World Health Organization (WHO), all diseases and its complications are problematic health hazards of this century. A better and early diagnosis of disease may improve the lives of all people affected and people may lead healthy lives. In this paper, the authors present the Decision Tree Algorithm for better diagnosis of diseases using Association Rule mining. Using this computational intelligence technique the authors tested the performance of the method using disease data sets. The authors presented a better algorithm which is used to calculate sensitivity, specificity, comprehensibility and rule length. This gain and gain ratio achieved has promising accuracy.

Information Extraction with Semantic Clustering

Vol. 3  Issue 1
Year: 2015
Issue:Mar-May
Title:Information Extraction with Semantic Clustering
Author Name:H. Balaji and Dr. A. Govardhan
Synopsis:
Generally, Information Extraction (IE) is concentrated on fulfilling exact, restricted, pre-specified solicitations from homogeneous corpora (e.g., extract the area and time of courses from a set of declarations). Information Extraction (IE) customarily relied with comprehensive individual engagement by means of hand crafted extraction guidelines as well as hand-tagged instruction illustrations. Furthermore, the user is required to clearly pre specify about every relative associated with attention. Data extraction in information control is usually associated with the artificial thinking ability throughout, and the progress associated with methods as well as algorithms for those aspects of words evaluation, as well as their laptop or computer enactment. Moving to another space requires the client to name the target relations and to physically make new extraction tenets or hand-label new preparing cases. This difficult work scales directly with the quantity of target relations. This paper, explains extraction strategy for site data focused around DOM to enhance the seeking proficiency, which is to safeguard the topic data, and to channel out the commotion data that the clients are not inspired by. The experiments are done by taking different data sets. The proposed semantic clustering gives the best way to extract the information from web than existing techniques. The experimental results clearly show that the proposed technique gives better results when compared to existing techniques.