Vol 3 Issue 2 April 2015-June 2015

Abstract: The frequent itemset mining (FIM) is one of the most important techniques to extract knowledge from data in many real-world application. The total data that we have today (on internet) is increasing day by day. But with this increase in data, we are also facing a big problem of extracting information from those data. Now an important thing is to extract information from that huge amount of data. This process of extracting information from the given data is also called as data mining. Though there were a number of methods (including parallel programming) to do so. But when they are applied to Big Data, they couldn’t do too good. Apart these methods had their own counter effects such as 1) Balanced data distribution, and 2) Inter-communication costs. In this project, we investigate the applicability of FIM techniques on the MapReduce platform. Here in this project we are introducing two new methods for mining large datasets 1) FIC Algorithm (Fastest itemset calculating) (it focuses on speed) 2) Ec-Apriori Algorithm (It is optimized to run on really large datasets).

Keywords:  bigdata, mapreduce, hadoop, frequent itemset.

Title: Finding Frequently Occuring Itemset Pair on Big Data

Author: Raju K Gupta, Maheshwari R Tegampure, Purushottam K Singh, Shivani, Akshay Kumar, Prof. Prajakta Ugale

International Journal of Computer Science and Information Technology Research

ISSN 2348-1196 (print), ISSN 2348-120X (online)

Research Publish Journals

Abstract: Cloud computing is an internet based new age computer technology which can store one’s applications and databases from distance through network and various devices in one location and provide authorised customers with on demand accessibility. Parallel dataflow programs generate enormous amounts of distributed data that are short lived, yet are critical for completion of job and for good run time performance. Preserving secrecy of these datasets has become risky as adversaries may recover confidential information by analyzing such multiple resultant datasets. In cloud storage service users upload their datasets together with authentication information to cloud storage server. Highly scalable computing resources are supplied as an outer service through Internet on pay for what you use basis. Encryption works well for preserving the privacy of resultant datasets, but encrypting all the datasets in cloud is widely adopted in existing approaches which is time consuming and cost in-effective. We propose a novel upper-bound privacy leakage constraint based approach that identifies all functionally encrypt able sensitive data, so that privacy preserving cost can be saved while simultaneously satisfying privacy requirements of data owners. Evaluation results demonstrate that this upper-bound approach is better than existing ones where all datasets are encrypted.

Keywords: sensitive-data leakage, resultant datasets, upper-limit constraint, privacy saving cost.

Title: Efficiently Preserving Of Sensitive Resultant Cloud Datasets

Author: Smt. Sandhya, Prof S.M Joshi

International Journal of Computer Science and Information Technology Research

ISSN 2348-1196 (print), ISSN 2348-120X (online)

Research Publish Journals

Abstract: Now days, more number of users are using internet because of media streaming application. With the arrival of these applications, it is financially incapable to give promising bandwidth. Cloud computing gives an stretchable infrastructure so that it must reach the customers demand. Media content providers will assign some charges for reserved resource in the cloud. Some providers using a pricing scheme resources reserved in the cloud basis of non-linear time discount rate(Eg: Amazon EC2). Such a pricing model gives discount is on non-linear method for reserved resources in the cloud. In this case, an open challenge is to choose the right quantity to reserve the resource in the cloud and the time to reserve the resource in order to reduce the financial cost. We investigate a simple algorithm for reserving resource that increases the discounted rates in the price, while guaranteed that in cloud we are reserving enough resources. Based on the prediction, we are designing algorithms that decrease the risk of producing wrong decisions for reserving resource. Our algorithm minimizes the monetary cost for allocating resources in the cloud as compared to other ordinary schemes and we can see that in our simulations and numerical evaluations.

Keywords: Cloud Computing, Streaming, Non-linear Scheme, Network economics.

Title: Content Distribution Scheme for Efficient and Interactive Video Streaming Using Cloud

Author: Pramod kumar H N

International Journal of Computer Science and Information Technology Research

ISSN 2348-1196 (print), ISSN 2348-120X (online)

Research Publish Journals

Abstract: Packet dropping and modification are common attacks that can be launched by an adversary to disrupt communication in wireless multihop sensor networks. Many schemes have been proposed to mitigate or tolerate such attacks, but very few can effectively and efficiently identify the intruders. To address this problem, we propose a simple yet effective scheme, which can identify misbehaving forwarders that drop or modify packets. Extensive analysis and simulations have been conducted to verify the effectiveness and efficiency of the scheme.

Keywords: Packet dropping, packet modification, intrusion detection, wireless sensor networks.

Title: Detecting Packet Droppers and Modifiers in Wireless Sensor Networks

Author: Ms. Shruthi N M, Mrs. Veena M

International Journal of Computer Science and Information Technology Research

ISSN 2348-1196 (print), ISSN 2348-120X (online)

Research Publish Journals

Abstract:  Online video service is common in Internet services. Users usually waste lot of time to obtain their interested videos in browsing and watching those videos. Therefore, various recommendation systems have been proposed. Most of those proposed systems like content based recommendation system, collaborative filtering recommendation system and context aware recommendation system deploy a large number of context collectors at terminals and access networks. However, the context collecting and exchanging result in heavy network overhead, and the context processing and content matching consumes huge computation. Therefore here we are introducing a recommendation system based on user behavior for videos in cloud, which can reduce network overhead and speed up the recommendation process. The users are recommended with videos based on their behavior information.

Keywords: Video service, Recommendation system, User behavior, Tag.

Title: Recommendation System for Videos in Cloud Based on User Behavior.

Author: Ramya. S, Mrs. Anitha. M.L

International Journal of Computer Science and Information Technology Research

ISSN 2348-1196 (print), ISSN 2348-120X (online)

Research Publish Journals

Abstract: Data deduplication is a data storage saving method which has been used in cloud servers for deleting duplicate data files. It stores only one copy of the identical data file on the cloud server instead of storing number of similar data files and offers their users infinite storage space. On cloud servers, most of times users save the same data files, so same data files take huge space. Repetitious copies of data files prevented by deduplication and retain one copy of the data files. It works with encryption technique to provide security to data files before uploading to cloud server. The Cost of storing and transferring data can be greatly reduced by data deduplication. The intention of this paper is to address the problem of authorized data duplicate check and analyse security of stored sensitive data using hybrid cloud architecture which made up of public cloud and private cloud. Data confidentiality is strengthened by this hybrid cloud arrangement .Thus users protect the sensitive data and outsourced to the cloud storage securely.

Keyword: Cloud computing, deduplication, authorized duplicate check, Data Confidentiality, Differential Authori-zation, hybrid cloud.

Title: A Secure Backups in Cloud Servers with Authorized Deduplication by Hybrid Cloud

Author: Bharati Choudhary, S.M Joshi

International Journal of Computer Science and Information Technology Research

ISSN 2348-1196 (print), ISSN 2348-120X (online)

Research Publish Journals

Abstract:  The number of internet users around the world is growing day by day thus people got opportunity to set up market at the place where they spend maximum time and which is convenient for customers this is how ecommerce rose. Now days many ecommerce web sites entered in market and competing with each other to provide better services which includes product quality to dispatch time of product. This process has lots of challenges in terms of shipping, segmentation, customer service, taxation, licence, website attractiveness, currency challenges, technical issue etc., In this paper, we present and discuss technical  challenges , and identify solutions that will be required for broader acceptance and diffusion of e-commerce websites to enhance this development.

Keywords: Ecommerce, Ecommerce Apps, SEO performance, URL, Websites.

Title: Issues and Challenges in Ecommerce Websites and Their Solutions

Author: Aditya Salunke, Ishita Sathaye

International Journal of Computer Science and Information Technology Research

ISSN 2348-1196 (print), ISSN 2348-120X (online)

Research Publish Journals

Abstract: Cloud computing confers strong economic advantages, but many clients are reluctant to implicitly trust a third-party cloud provider. To address these security concerns, data may be transmitted and stored in encrypted form. Major challenges exist concerning the aspects of the generation, distribution, and usage of encryption keys in cloud systems, such as the safe location of keys, and serving the recent trend of users that tend to connect to contemporary cloud applications using resource-constrained mobile devices in extremely large numbers simultaneously; these characteristics lead to difficulties in achieving efficient and highly scalable key management. In this work, a model for key distribution based on the principle of dynamic data re-encryption is applied to a cloud computing system in a unique way to address the demands of a mobile device environment, including limitations on client wireless data usage, storage capacity, processing power, and battery life. The proposed cloud-based re-encryption model is secure, efficient, and highly scalable in a cloud computing context, as keys are managed by the client for trust reasons, processor-intensive data re-encryption is handled by the cloud provider, and key redistribution is minimized to conserve communication costs on mobile devices. A versioning history mechanism effectively manages keys for a continuously changing user population. Finally, an implementation on commercial mobile and cloud platforms is used to validate the performance of the model.

Keywords: Distributed systems, mobile computing and security.

Title: Secure and Scalable Data Management in Cloud

Author: Shaik Shakeel Ahmed, Afroze Ansari

International Journal of Computer Science and Information Technology Research

ISSN 2348-1196 (print), ISSN 2348-120X (online)

Research Publish Journals

Abstract: secure data transmission difficult matter for wireless sensor network. Clustering is a practical method to improve the system performance. Cluster can be formed dynamically. we propose two protocol for cluster based wireless sensor network, called IBS and IBOOS and these protocol using two scheme called Identity Based digital signature schema and identity based online-offline signature scheme, respectively. We can provide security for various attacks. The results show that these two protocol give better performance than the existing protocol.

Keywords:  Cluster based WSNs, ID based digital signature, ID based online-offline digital signature, CH, CH selection base station.

Title: Secure Data Transmission by Using IBS and IBOOS Protocols

Author: GEETHANJALI .S.G, Dr. B. R. PRASAD BABU

International Journal of Computer Science and Information Technology Research

ISSN 2348-1196 (print), ISSN 2348-120X (online)

Research Publish Journals

Abstract: Movable wireless gadgets play significant roles in our regular life, e.g., customers regularly use such gadgets to take imageries and segment with peoples via cunning peer-to-peer links, which however are lopsided in nature, and hence require the store and onward feature projected in Visit Open-minded Webs to provide expedient facts sharing chances. Moreover, mobile gadgets may not be eager to handover data substances to other devices due to the delimited possessions. Hence, effective data delivery schemes need to be deliberate to boost nodes to cooperate share data. We suggest a Multi-Receiver Incentive-Based Distribution (MuRIS) design that allows nodes to cooperatively deliver data of interest to one another via selected paths exploiting few spreads. Our scheme exploits local past paths and customers’ attentions’ data conserved by each node. In control, the load and pleasing functions combined within our scheme rouse assistance among nodes such that the nodes have no motivation to launch edge addition attacks. Furthermore, our custody and satisfying functions are intentional such that the selected handover paths impressionist efficient multicast trees those penalties in scarcer distribution hops. Extensive imitation studies using real humanoid contact-based movement suggestions show that our scheme outdoes existing methods in relations of transport ratio and show productivity.

Keywords:  Drive mechanism, producer/subscriber, suspension easy going networks, data allotment, and movable links.

Title: Aware Disseminations of Data Sharing With Multiple Receivers in Delay Tolerant Mobile Network

Author: Shilpa Vantakar, Dr. B. R. Prasad Babu, Jaykumar. B. L

International Journal of Computer Science and Information Technology Research

ISSN 2348-1196 (print), ISSN 2348-120X (online)

Research Publish Journals

Abstract: The increase in the use of computing resources has resulted in the electronic data generation at highest rate. The cloud storage is an easy and cost effective solution for the users running out of storage space at their end. The cloud service provider (CSP) stores user data on to a storage server placed in a data center at remote location. This availability, confidentiality and integrity of the data must be maintained by CSP in order to increase revenue. So the Disaster Recovery as a service (DRaaS) is becoming one of the major areas of interest. The data redundancy is maintained by using geographically dispersed data centers so that data lost from one location can be recovered from another. The data integrity can be achieved by using the cryptographic solutions. In this paper we compare the existing cryptographic algorithms like ECC, RSA with the new Seedblock algorithm and analyse the result.

Keywords: Cloud Service Provider, Disaster Recovery as a Service, Remote Backup Server, Seedblock, main server.

Title: Performance Analysis of Cryptographic Algorithms: An Overview

Author: Ms.Anvitha N, Mr.Guruprasad

International Journal of Computer Science and Information Technology Research

ISSN 2348-1196 (print), ISSN 2348-120X (online)

Research Publish Journals

Abstract: Visual cryptography is a secret sharing scheme which uses images distributed as shares such that, when the shares are superimposed, a hidden secret image is revealed. In extended visual cryptography, the share images are constructed to contain meaningful cover images, thereby providing opportunities for integrating visual cryptography and biometric security techniques. In this paper, we propose a method for processing halftone images that improves the quality of the share images and the recovered secret image in an extended visual cryptography scheme for which the size of the share images and the recovered image is the same as for the original halftone secret image. The resulting scheme maintains the perfect security of the original extended visual cryptography approach. It is another form of cryptography in which secret communication is done in the form of images. This can be used to protect the biometric templates in which the decryption doesn’t require any complex computations; it is done by human visual system. Using this visual cryptography the biometric data capture from the authorized user. This original image is divided into two shares .Each share stored in two different databases. When both images are simultaneously available then only we can get the original image. The individual share do not reveal any information about the original image.

Keywords: cryptography, image processing, visual cryptography, secret sharing. 

Title: Extended Visual Cryptography for Halftone Images without Pixel Expansion

Author: Prof. Deepali Ahir, Vidya Mahadik, Rani Sangale, Pooja Murame

International Journal of Computer Science and Information Technology Research

ISSN 2348-1196 (print), ISSN 2348-120X (online)

Research Publish Journals

Abstract: The cloud computing is growing rapidly for it offers on-demand computing power and capacity. The power of cloud enables dynamic scalability of applications facing various business requirements. However, challenges arise when considering the large amount of existing applications. In this work we propose to move the traditional FTP service to the cloud. We implement FTP service on Windows Azure Platform along with the auto-scaling cloud feature. Based on this, we implement a benchmark to measure the performance of our Cloud FTP. This case study illustrates the potential benefits and technical issues associated with the migration of the traditional applications to the clouds.

Keywords: Cloud computing, FTP, Traditional application.

Title: Cloud Ftp: A Case Study of Migrating Traditional Applications to the Cloud

Author: Pooja H, S G Maknur

International Journal of Computer Science and Information Technology Research

ISSN 2348-1196 (print), ISSN 2348-120X (online)

Research Publish Journals

Abstract: We most often choose to listen to a song or music which best fits our mood at that instant. In spite of this strong correlation, most of the music software’s presents today are still devoid of providing the facility of mood-aware play-list generation. This increase the time music listeners take in manually choosing a list of songs suiting a particular mood or occasion, which can be avoided by annotating songs with the relevant emotion category they convey.

We contribute by making an effort to build a system for automatic identification of mood underlying the audio songs by mining their spectral, temporal audio features. Our focus is specifically on Indian Popular Hindi songs. We have analyzed various data classification algorithms in order to learn, train and test the model representing the moods of these audio songs and developed an open source framework for the same.

Keywords: Random forest, Bagging, Music, Domain knowledge, Mood identification.

Title: A Novel Approach for Automatic Mood Classification of Indian Popular Music

Author: Shalini Malik

International Journal of Computer Science and Information Technology Research

ISSN 2348-1196 (print), ISSN 2348-120X (online)

Research Publish Journals

Abstract: To increase the productivity of business users Smartphones are very effective tools. In smartphones the end users can perform several tasks and they can always be updated because of their increasing computational power and storage capacity. As there is the increase in productivity of employees the companies are willing to support the employee-owned smartphones. The issues about security concerns such as Data loss, Data Sharing and Data leakage have reduced the usage of smartphones for companies. In this paper, we introduced Moses, which is a policy based framework to enforce the isolation of application by using the software and the data in the android platform. Through MOSES it is possible to show different Security Profiles in a individual smartphone. Every security profiles consists of an policies which controls the accessing of data and applications. Where these profiles are not hardcoded or predefined because of which it can be used at any time. One important role of the MOSES is to dynamically switch between one security profile to another security profile.

Keywords: BYOD, Security profiles, Android, Para-virtualization, Context

Title: MOSES: Supporting and Enforcing Security Profiles on Smartphones

Author: Ramkrishna. G. S, Dr. B R Prasad Babu, Shaik Mohammed Ghouse

International Journal of Computer Science and Information Technology Research

ISSN 2348-1196 (print), ISSN 2348-120X (online)

Research Publish Journals