......

..

IJCTA-Volume 7 Issue 5 / September-October 2016
S.No
Title/Author Name
Page No
1
Formal Specification of Web Services Composition Using LOTOS
-N.Adadi,M.Berrada,D. Chenouni
Abstract
The composition of Web services, that is the combination of several services to obtain new features, becomes more and more popular and present a necessary stage for the realization of the collaboration inter-companies (B2B). To implement this collaboration a developer has to elaborate a specification which allows the modeling of the global behavior of the system, to verify formally this model to assure the quality of the system then pass to the implementation of the composed service. In this paper we present a summary of our proposed approach of web services composition which is separated into three tasks: specification using BPMN notation, implementation using BPEL language and formal verification, then we focus on the task of verification and we propose an approach of translating the BPMN specification of services composition to a formal specification LOTOS which allows, using verification tool like CADP, to apply the behavioral properties and validate the system of Web services composition.
636-642
PDF
2
Advanced Semantic Web Information Retrieval Technique using Ontological Data
-
P.Nandhakumar,M.Hemalatha,R.Sridhar
Abstract
Semantic web is a kind of webs that is able to describe things to be understood by computers. Automatically answering any query without human interactions is one of the key challenges in computer science area. Semantics can help in answering such queries. Consequently, extracting information from unstructured documents and transforming them into semantic web form is an important trend. Semantic web mining is a combination of two trends; semantic web and web mining. This paper concentrates on extracting data from the web page tables which are mostly unstructured and converted into ontological format. Ontology construction and structuring system is proposed initially to know the semantic markups being used and depth first search is done using those semantic markups. The user given query is analyzed and keywords are extracted by parsing and the generated keywords are search by automatically building the SPARQL query. The use of exact semantic markup and efficient search algorithms helps to retrieve more exact links. The extracted links are ranked to find out the most appropriate link to the given query. Experimental results show that the data of interest can be located easily and most accurately.
643-648
PDF
3
Face Recognition using Improved Local Binary Pattern Technique
-
Mandeep Kaur,Dr.Dinesh Kumar
Abstract
Face recognition is a task so common to humans, that the individual does not even notice the extensive number of times it is performed every day. Many face analysis and face modeling techniques have progressed significantly in the last decade. However, the reliability of face recognition schemes still poses a great challenge to the scientific community. Falsification of identity cards or intrusion of physical and virtual areas by cracking alphanumerical passwords appear frequently in the media. Proposed system performs the function of face recognition within the image dataset using Extended LBP Technique. The proposed system is tested on various inputs consist of different faces and results are very effective and accurate. We have tested the system on 50 different faces. The accuracy of the proposed system is comes out to be 94%.
Keywords—Image Processing, Face Recognition; Face Detection; Extended LBP
649-652
PDF
4
A Comparative study of CARM and BBT Algorithm for Generation of Association Rules
-
Rashmi V.Mane,V.R.Ghorpade
Abstract
Association rule mining is the technique of data mining to discover user interesting knowledge and forming co-relations among the items. Apriori based, pattern-growth, Fp-tree based are proposed earlier to find the frequent itemsets which are needed for forming associations. Recently two algorithms are proposed for generation of association rules, one of them is CARM and other uses binary technique called BBT algorithm. In this paper we have theoretically analyzed both of these algorithms and comparative study of these algorithms is carried out. Experimental analysis shows that CARM is more time efficient than BBT but it requires large space.
653-657
PDF
5
Distributed Purposive Sampling based Approach for Association Rule Mining
-
M.Rajeshwari,Dr.V.Umarani
Abstract
In recent years, many organizations in the mainstream of business, industry, and the public sector store vast amounts of data containing their transaction information online and offline. Such data may contain hidden information that can be used by an organization’s decision makers to improve the overall profit. Association Rule Mining (ARM) is one of the data mining techniques used to extract hidden information from datasets that can be used by organization’s decision makers to improve overall profit. However, performing ARM requires repeated passes over the entire database. A popular solution to improve the speed of ARM is to apply the mining algorithm on a sample instead of the entire database. The databases are partition into two processors using Data distribution algorithm for parallel process. Purposive sampling approach is proposed in this research work for selecting sample from large database. This approach starts with the process of selection of initial sample based on the size of the database. The frequent itemsets and negative border are generated from the initial sample using Apriori algorithm. The generated negative border is then sorted based on the support level of itemsets. The next step is to find midpoint itemset from the sorted Negative border. Support midpoint itemset is less than the specified support, then the selected sample is optimal else, the sample size is incremented until an optimal size is achieved. The results are experimented using the time, memory and accuracy.
658-667
PDF
6
Knowledge Oriented Approach for Content Based Image Retrieval
-
Muddasani Shravani,P.Sudheer,K.Venkateswara Reddy
Abstract
With exponential growth of images over WWW and in enterprise of real world, it became essential to have sophisticated mechanisms to process images for making well informed decisions. In many applications such as criminal tracking image processing is essential. For efficient image retrieval there are many existing solutions that are based on content based image retrieval. However, there is scope for further improvements in the area of image retrieval. In this paper we proposed a framework known as Knowledge Oriented Approach for Content Based Image Retrieval (KOCBIR) which exploits the knowhow gained by the framework from time to time. Thus the proposed system is an attempt to improve the quality of image retrieval. It also has mechanism for clustering in order to reduce the query search space and improve efficiency of the system. We built a prototype application using MATLAB to demonstrate the proof of concept. The empirical results revealed that the proposed system is useful in real time applications.
Index Terms – Query by example, content based image retrieval, clustering, knowledge base
668-672
PDF
7
A Framework for Flexible Configurations for Protecting Privacy in Location Based Services
-
Piska.Maheshvikram,K.Abdul Basith,K.Venkateswara Reddy
Abstract
Location Based Services (LBS) play vital role in the real world. They need their users to disclose the location of query. Such location information reaches untrusted servers. This can lead to privacy issues. The existing LBS applications have limitations with no or limited privacy protection techniques. In this paper a dynamic architecture is proposed to have holistic system that ensures privacy in LBS applications. The proposed system provides privacy preserving continuous location based services. A grid based system is devised with multiple modules involved. The mobile users are provided web interface to make location based queries. The queries are submitted to query server which is responsible to mediate query processing. The queries are then submitted to service provider where the query gets processed ultimately. The users are given back the required services and Google Maps is used to present results intuitively besides providing textual results in browser. We built a web based prototype that demonstrates the proof of concept. The empirical results reveal that the proposed system is flexible and provides configurations for protecting privacy in location based services.
Index Terms – Location based services, grid based system, points of interest, query server
673-677
PDF
8
A Data Ownership Privacy Provider Framework in Cloud Computing
-
T.Arunambika,P.Sudha
Abstract
Cloud computing has recently emerged as a new paradigm for hosting and delivering services over the Internet. Anonymous Cloud which decentralizes trust by decoupling charging data from submitted occupations. We concern the issue of security saving calculation. AnonymousCloud covers information provenance from cloud hubs that process over the information, and covers beneficiary characters as IP locations and possession names. Anonymization is accomplished through the instantiation of a Tor anonymizing circuit inside the cloud, through which private information and employments are namelessly supplied by and came back to clients. Circuit length is a tunable parameter k, bearing an adaptable exchange off between the level of secrecy and the computational overhead of the circuit. AnonymousCloud thusly executes an open key cryptography based unknown validation that disassociates information proprietorship metadata from the private information it names.
Keywords: AnonymousCloud,Cloud Providers,Authentication Protocol Algorithm.
678-687
PDF
9
Study and Analysis of Sickle Cell Disease of South Gujarat region with the use of Data Mining Classification Techniques
-
Ashokkumar Vijaysinh Solanki
Abstract
Data mining applications play major role in the field of healthcare sector. Data mining techniques assist to take high level decision for medical sector and it is necessary because healthcare sector have large volume of information and we have to filter out unnecessary information. This paper is towards the field of Data mining techniques to study and analysis about the sickle cell disease highly affected in tribal zone of South Gujarat. Through classification techniques, we can generate mining model. With the help of producing mining model I have done detail classification of Blood group, Sub caste and Area wise. This research work focused on how prevention steps can be taken in the way to minimize the percentages of disease.
Keywords – Classification, Data mining, Decision Tree, Sickle Cell
688-692
PDF
10
A Survey on Software Fault Injection
-
Divya Khurana,Bali Shankar Khurana
Abstract
Fault injection is a usually utilized procedure to test the resistance of a product framework systematically. All the constant frameworks have a tendency to have faults which spills through testing cycles. Keeping in mind the end goal to have very solid frameworks it is basic to have faults under as far as possible. The objective of the testing cycles, for example, mix, framework and acknowledgment testing exercises are to expel mistakes and their effects from the computational framework before a disappointment happens in the field. Fault injection is being drilled for quite a while utilizing different strategies. This audit plans to give an outline about some of these basic systems honed, apparatuses created and look into studies did with regards to blame injection strategies utilized in the course of the most recent couple of years.
Keywords: fault injection, swfi, software fault, fault tolerance, fault injection methods, fault injection tools.
693-700
PDF
11
Effectively Preserving Location for Achieving Confidentiality
-
Ashwini Dasharth Gangurde,Komal Kishor Nadage,Shubhangi Subhash Deore,Vrushali Rajendra Bathe
Abstract
The aim of safe tourister application to outsource the location based service (LBS) data from the LBS provider to the cloud and from the cloud to the LBS provider which protects the privacy related issues of the LBS data. Initially LBS user query for a place to the LBS provider, LBS provider in turn upload the details to the cloud but in the form of encrypted text to prevent the cloud from stealing the data. LBS users in turn decrypt the details by the personal password send by the LBS provider to the LBS user. When the query of the LBS user matches the details in the cloud the LBS user will retrieve the details and make use of it. In this application it is shown with the demo of a tourist requesting for tourist places tourist is the LBS user and admin is the LBS provider .With the pervasiveness of smart phones, location based services have received considerable attention and become more popular and vital recently. However, the use of LBS also has a potential threat to user’s location privacy. In this paper, aiming at spatial range query, popular LBS providing information About Points of Interest, we present an effective and privacy-preserving LBS solution, called EPLQ. To reduce query latency, we further design a privacy-preserving tree index structure in EPLQ. Detailed security analysis confirms the security properties of EPLQ. In additional, extensive experiments are conducted, and the results demonstrate that EPLQ is very effective in privacy preserving spatial range query over outsourced encrypted data. In particular, for a mobile LBS user using an Android phone device, around 1 second is needed to generate a query; and it also only requires a workstation, which plays the role of the cloud in our experiments, a few seconds to search POIs.
Keyword: Location-based services (LBS), spatial range query, outsourced encrypted data, privacy-enhancing technology, Query Point, Effective and Privacy Preserving Location-Based query (EPLQ).
701-704
PDF
12
A Custom Simulator for Prevention of Packet Dropping Attacks with Privacy in Ad Hoc Networks
-
Sailaja Vungarala,Dr.C.Balarengadurai
Abstract
Mobile Ad Hoc Networks are the networks where nodes are self configured. They support multi-hop communication between sender and receiver. Every node in the network has the ability to act as router to forward the packets sent by source to destination node. In the process there is packet loss for two important reasons. There is link failure due to which packets are lost. The other reason is that the intermediate node which is supposed to forward packets is compromised and intentionally causing packet drop. This kind of packet drop is known as malicious packet dropping. Many existing solutions treated packet drop as the malicious packet dropping. However, there may be packet drop due to link failure. Differentiating the root cause is essential. In this paper we differentiated between packet loss due to like failure and packet loss due to malicious attack. We proposed architecture for simulating the environment and attack model. We used auditing concept known as Homomorphic Linear Authenticator (HLA) which allows truthful detection of packet dropping attacks. We implemented the custom simulator using Java platform which demonstrates the proof of concept.
Index Terms – Wireless Ad Hoc Network, packet dropping, auditing
705-709
PDF
13
Design and Construction of a Frequent-Pattern Tree
-
P Siva,D Geetha
Abstract
Information from transaction databases is essential for mining frequent patterns. Therefore, if we can extract the concise information for frequent pattern mining and store it into a compact structure, then it may facilitate frequent pattern mining. Motivated by this thinking, in this section, we develop a compact data structure, called FP-tree, to store complete but no redundant information for frequent pattern mining.
Keywords: Pattern growth, FP Tree, Apriori approach, Frequent Pattern Mining.
710-719
PDF
14
A Review of Privacy Preservation for Big Data in Cloud Computing
-
Shubha Pachouri,Surendra Bilouhan
Abstract
The verity and velocity of data processing is big issue in cloud computing environment. For the processing of large amount of data used the concept of big data. The process of big data depends on the functioning of map reduce structure. The map reduce structure map the data and reduces the size of processing data. The diversity and applicability of cloud computing are used in different field such as scientific computational, social website functioning such as face book, yahoo and many more. The processing of traffic creates serious issue in big data. The fundamental issue of traffic is velocity of retrieval and submission of data. In this paper present the review of traffic processing issue in big data.
Keywords: - Big Data, Hadoop, Cloud Computing, Map Reduce.
720-725
PDF
15
Unsupervised Learning for Outlier Detection from High-Dimensional Datasets
-
G. Asha Bhavani,Dr.K.Venkateswara Reddy
Abstract
Outlier detection is one of the approaches to have business intelligence in data mining domain. It has its utility in the real world applications for making strategic decisions. In this paper we proposed a methodology that makes use of reverse nearest neighbour approach and anti-hub computation. We used Euclidean measure for unsupervised and distance based outlier detection process. We proposed an algorithm as part of our methodology to have outliers extracted from high dimensional data. We used UCI machine learning repository datasets to study the outlier detection process. The methodology includes pre-processing which is for improving quality of data prior to outlier detection process. We built a prototype application to demonstrate the proof of concept. The empirical results reveal that the proposed methodology is useful in finding outliers from high-dimensional data and overcomes the issue of curse of dimensionality.
Index Terms – Data mining, outlier detection, distance based measure, high-dimensional data
726-730
PDF
16
PMU-The Next Generation Tools for Smart Grid
-
Arindam Chowdhury,Shimi S.L,Prashant Kumar,Ashutosh Dixit
Abstract
Phasor Measurement Unit (PMU) was firstintroduced in 1980’s by J.S. Thorp and A.G. Phadke at Virginia Tech. First commercial PMU was manufactured by Macrodyne in 1990s and since then many utilities such as New York Power Authority (NYPA), Bonnevilla Power Administration (BPA), Southern California Edison (SCE), as well as universities such as Virginia Polytechnic Institute have been conducting R&D for exploring and advancement of PMU. These R&D efforts have shown that the synchrophasor technology has promised to enhance monitoring, analysis and control of Smart Power System Network. This paper provides a brief description of smart grid and its importance and why it is lacking over its advantages. This also provides a brief description of synchrophasor technology and reviews the potential of synchrophasor technology application that can provide towards the development of smarter power system network.
Index term – Phasor Measurement Unit (PMU), Smart Grid, Synchrophasor Technology, SCADA, State Estimation (SE), Wide Area Monitoring and Control
731-737
PDF
17
Performance Comparison of On-Demand Routing Protocols in Mobile Ad Hoc Networks
-
Kande Srinivas,Dr.M B Raju
Abstract
Routing protocols play a vital role in Mobile Ad Hoc Networks (MANETs). The protocols are broadly of two types. They are known as proactive and reactive routing protocols. The reactive protocols are known as on-demand protocols that find routes on demand while the proactive protocols discover routes periodically and update routing tables. The technical knowledge on such routing protocols can help computing community to have well-informed decisions. In this paper we compare two routing protocols known as AntHocNet and Ad-hoc On Demand Distance Vector (AODV). Comparative study is made through NS2 simulations. The performance of the two protocols is evaluated using measures such as packet delivery ratio, normalized routing load, average end to end delay, average throughput, average jitter, and routing overhead. The results of simulations revealed that AODV outperformed AntHocNet in all aspects when network size is relatively low. AntHocNet showed better performance then AODV when higher network size is used. These insights about the performance difference between the two routing protocols can help users to use them appropriately.
Index Terms – Mobile Ad Hoc Network, proactive and reacting routing protocols, AntHocNet, AODV
738-747
PDF
     
IJCTA © Copyrights 2015| All Rights Reserved.

This work is licensed under a Creative Commons Attribution 2.5 India License.