Vol 3 Issue 2 April 2015-June 2015

Abstract: This paper presents a new scheduling approach to focus on providing a solution for online scheduling problem of real-time tasks using “Infrastructure as a Service” model offered by cloud computing. The real time tasks are scheduled pre-emptively with the intent of maximizing the total utility and efficiency. In traditional approach, the task is scheduled non- pre-emptively with two different types of Time Utility Functions (TUFs) – a profit time utility function and a penalty time utility function. The task with highest expected gain is executed. When a new task arrives with highest priority then it cannot be taken for execution until it completes the currently running task. Therefore the higher priority task is waiting for a longer time. This scheduling method sensibly aborts the task when it misses its deadline. Note that, before a task is aborted, it consumes system resources including network bandwidth, storage space and processing power. This leads to affect the overall system performance and response time of a task. In our approach, a preemptive online scheduling with task migration algorithm for cloud computing environment is proposed in order to minimize the response time and to improve the efficiency of the tasks. Whenever a task misses its deadline, it will be migrated the task to another virtual machine. This improves the overall system performance and maximizes the total utility. Our simulation results outperform the traditional scheduling algorithms such as the Earliest Deadline First (EDF) and an earlier scheduling approach based on the similar model.

Keywords:  non-preemptive, preemptive, priority, deadline, migrate, virtual machine, Time Utility Function.

Title: Efficient Scheduling Of On-line Services in Cloud Computing Based on Task Migration

Author: Harish H G, Dr. R Girisha

International Journal of Computer Science and Information Technology Research

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

Research Publish Journals

Abstract: Cloud computing has emerging as a pattern for data outsourcing and it provide high-quality of data services. It concerns of very sensitive information on cloud and it causes potentially the privacy problems. Encryption protects data security to some level, but at the cost of compromised efficiency. Searchable symmetric encryption going allows retrieval of encrypted data above cloud. Here focus on addressing data privacy problems using. For the first time, formulate the privacy issue from the characteristic of similarity relevance and scheme robustness. Here observe that server-side position based on order preserving encryption inevitably disclosures data privacy. To eliminate the leakage, I propose a two-round searchable encryption scheme that supports multikeyword top-key retrieval in the cloud. In TRSE, Employ a vector model and holomorphic encryption. The vector space model helps to provide sufficient search correctness, and the holomorphic encryption it enables users to involve in the ranking while the major of computing work is done on the server side by operations only on cipher text .As a result, the information leakage here focus on addressing data privacy problems using . For the first time, formulate the privacy issue from the characteristic of similarity relevance and scheme robustness. Here observe that server-side position based on order preserving encryption (OPE) inevitably disclosures data privacy Addressing data privacy problems using Searchable Symmetric Encryption in Cloud Data and its Relative services with concern to leakage avoidance for efficient query solution retrieval. 

Keywords: cloud, data privacy, holomorphic encryption, preserving encryption.

Title: SURVEY ON: CLOUD DATA RETRIEVAL FOR MULTIKEYWORD BASED ON DATA MINING TECHNOLOGY

Author: Kavya G, K.S. Rajesh

International Journal of Computer Science and Information Technology Research

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

Research Publish Journals

Abstract: Lack of planning is one cause of small business failure according to Business know-how. When releasing a new product, a company is particularly vulnerable to failure if it doesn’t follow a well-designed and thought-out plan. Before a product is manufactured, it is important to conduct due diligence to investigate whether this is a smart business decision. Demand prediction is an iterative process and is a critical part of the supply chain that links supply to demand so that consumers and service providers have products available when and where they need them.

A web enabled generic application is developed which help the business to predict the demand of new products prior to their manufacturing. This prediction is based on a data mining technique called as classification rules. The input data for a classification task is a collection of company’s previous similar products sales data on which naïve bayesian classifier algorithm is applied.

Keywords: Demand forecasting, Data mining, Naïve bayesian classifier.

Title: Naïve Bayesian Classifier for Product Demand Forecasting

Author: Latanjali Shinde, Nagarathna

International Journal of Computer Science and Information Technology Research

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

Research Publish Journals

Abstract: Traditional applications had a common platform that captured business transactions. The emerging class of applications requires new functionality that closes the loop between incoming transactions and the analytics that drive action on those transactions. Adopting a longer term and more abstract perspective, it is likely that new database management technologies and application areas will continue to emerge. As with any sufficiently fashionable technology, users should expect data management marketplace to yield solutions that are increasingly application/environment specific.  

Keywords: Emerging Database, Multimedia, Temporal, Technology, Big Data, GIS.

Title: Technologies Used In Trending Database Model

Author: ABHIJIT D. NAGVENKAR, ROSHAN S. DUMBRE

International Journal of Computer Science and Information Technology Research

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

Research Publish Journals

Abstract: Cloud computing is a model for enabling convenient, on-demand network access to a shared pool of configurable computing resources (e.g., networks, servers, storage, applications, and services) that can be rapidly provisioned and released with minimal management effort or service provider interaction. But for protecting data privacy, sensitive data has to be encrypted before outsourcing, which obsoletes traditional data utilization based on plaintext keyword search. Thus, enabling an encrypted cloud data search service is of paramount importance. Considering the large number of data users and documents in the cloud, it is necessary to allow multiple keywords in the search request and return documents in the order of their relevance to these keywords. Related works on searchable encryption focus on single keyword search or Boolean keyword search, and rarely sort the search results. In this paper, for the first time, we define and solve the challenging problem of securing conjunctive keyword ranked search over encrypted cloud data.

Keywords: Encryption, Keyword ranked search, Pallier Cryptography, Cosine similarity.

Title: Secure Conjunctive Keyword Ranked Search over Encrypted Cloud Data

Author: Shruthishree M. K, R. S. Prasanna Kumar

International Journal of Computer Science and Information Technology Research

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

Research Publish Journals

Abstract: A wireless ad-hoc network is a decentralized type of wireless network. It does not rely on a pre-existing infrastructure, such as routers or access points. For communication, nodes of the ad-hoc network use a routing protocol, which just tells about the best possible route too be taken. But just having an optimal route is not enough, the nodes need to co-operate for the successful communication. So ,Co-operative communication is important because it harness the broadcast nature of wireless channel  and  enhance Throughput capacity and also reduce Retransmission latency . But the nodes have some limiting constraints like limited battery life and limited storage area. These constraints raise some doubt, to co-operate or not to co-operate with the neighboring nodes. When they co-operate completely, then the nodes expend energy relaying traffic for others, unfortunately decreasing their lifetime. And if they do not   co-operate then the share of service each user should get drops. Many c-operative algorithms have been developed which use schemes like credit based also called incentive based schemes, and remuneration schemes to stimulate co-operation between the nodes. An acceptance algorithm called GTFT (Generous Tit For Tat) has been developed already. This distributed and scalable acceptance algorithm is used by the nodes to decide whether to accept or reject a relay request. This acceptance and rejection is based on a ratio called the Normalized Acceptance rate (NAR).It is the ratio of number of relay request made by the node that has been accepted to the number of relay request made by the node. This algorithm is a Tit for Tat method taking some generosity into account. But it does not consider an important notion of priority of the message. So, we can extend the GTFT algorithm so that it can handle the priority of messages.

Keywords: Wireless adhoc-network, Communication, Nodes, Algorithm, Message.

Title: Design and Implementation of an Algorithm for Finding Frequent Sequential Traversal Pattern from Web Logs Based On WEI

Author: Mrs. Karuna Nidhi Pandagre, Ms. Apoorva Joshi, Ms. Megha Jain

International Journal of Computer Science and Information Technology Research

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

Research Publish Journals

Abstract: TLP's goal is to reduce tail latency of short transactions. It achieves this by converting retransmission timeouts (RTOs) occurring due to tail losses (losses at end of transactions) into fast recovery. TLP transmits one packet in two round-trips when a connection is in Open state and isn't receiving any ACKs. The transmitted packet, aka loss probe, can be either new or a retransmission. When there is tail loss, the ACK from a loss probe triggers FACK/early-retransmit based fast recovery, thus avoiding a costly RTO. In the absence of loss, there is no change in the connection state. Basic of this paper Identity based digital Signature and Identity based online offline algorithm for the cluster based wireless sensor networks is used. Identity based digital signature computes the digital signature signing process. Identity based online offline algorithm reduces the complexity of computational overhead in cluster head. This project effectively avoids long timeouts and thereby improves TCP performance. The method for efficient data transmission using Identity based digital signature is also implemented for minimizing end-to-end delay using network simulator.

Keywords: TLP Algorithm, Cluster based WSNs, ID based online offline digital signature, secure data trans- mission, TCP performance.

Title: TLP ALGORITHM USED EFFECTIVELY IMPROVES TCP PERFORMANCE IN DATA TRANSMISSION AND RECOVERY FOR CLUSTER BASED WSN’S

Author: S.GAJALAKSHMI, R.ROOPA, J.SUBASH CHANDRA BOSE

International Journal of Computer Science and Information Technology Research

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

Research Publish Journals

Abstract: Shopping at big malls is becoming daily activity in metro cities. We can see huge rush at these malls on holidays and weekends. People purchase different products and put them in the cart. After completion of purchases, one needs to go to billing counter for payments. At billing counter the cashier prepare the bill using bar code reader which is very time consuming process and results in long queue at billing counter. This paper describes how to build an automated and time saving system for the world of retail which will make shopping experience impetuous, customer friendly and secure. In this paper, smart cart is proposed that will be capable of generating a bill from the cart itself. The main objective of proposed system is to provide a tlow-cost, easily scalable, and rugged system for assisting shopping in person.

Keywords: PIC Microcontroller, RFID Reader, RFID tag.

Title: RFID Based Supermarket Queue Prevention and Automation System for Physically Challenged People

Author: PARVATHI S J, NAGARATHNA

International Journal of Computer Science and Information Technology Research

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

Research Publish Journals

Abstract: Ant-Based Web Content Clustering based on personalization of users uses Ant-based Clustering algorithm for efficient clustering of web contents and provide the users with the best solution. Query log analysis has emerged as one of the most promising research areas to automatically derive such structures. A biologically inspired model based on Ant Colony Optimization applied to query logs as an adaptive learning process that addresses the problem of deriving query suggestions is explored. A user interacts with the ranking system at pre-computation and query times. During pre-computation, the user-specific personalized Weight Assignment Vector can be computed using (a) It can done by domain experts according to the user’s profile (b) It can be learned automatically by user interaction and exploiting user relevance feedback User interactions with the search engine which is treated as an individual ant’s journey and over time the collective journeys of all ants result in strengthening more popular paths which leads to a corresponding term association graph that is used to provide query modification suggestion which is updated in a continuous learning cycle. Ant Colony based Clustering has been studied extensively as a form of swarm intelligence technique to solve problems in several domains such as Scheduling, Classification and routing problems.

Keywords: personalization, Ant colony, WAV.

Title: Ant Based Web Content Clustering Based On Personalization of Users

Author: Preethi.C, K.Bhuvaneswari, G.Sudhakar

International Journal of Computer Science and Information Technology Research

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

Research Publish Journals

Abstract: We live and work in the Age of Big Data. The amount and mixed bag of information that encompasses us and blasts us every day is dissimilar to anything seen beforehand. Truth be told, for any individual who meets expectations in a calling even tangentially identified with data, its about difficult to stay away from the buildup around enormous information measurements:

•  We make exabytes (or even zettabytes, contingent upon the source) of new information consistently

•   Over a large portion of the information (or a few reports say as high as 90 percent) of information ever made was made inside of the most recent 12 months

•   The rate at which we're making new information copies consistently

Thankfully, most genuine discussion has progressed past the numbers and now concentrates on noting the inquiry, what do we do with the majority of this information? This article is the first of two investigating the thought of moving from enormous information to keen information to get business esteem from this downpour. It concentrates on five key business drivers and specialized difficulties of working with the greater part of this information. The second article in this pair takes a gander even from an optimistic standpoint rehearses for transforming huge information into brilliant information to surmount these difficulties.

Keywords: Big Data, BDA, Data Analysis, Big Data Analytics.

Title: Are All Data Important?

Author: Sneha Jaiswal, Sapna Sinha

International Journal of Computer Science and Information Technology Research

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

Research Publish Journals

Abstract: in current years, there has been quick growth in mobile gadgets such as smartphones, and smartphone market has established with plenty of applications. In particular, there are several applications that are “free” to the user, but depend on advertisement services for their expenses. Such applications include an advertisement module - a reference library provided by the advertisement service - that can assemble a user’s sensitive information and transfer it across the network. Such data is used for some accepted advertisements, and user performance statistics. Users receive this business model, but in most situations the applications do not require the user’s acknowledgment in order to transfer sensitive information. Hence, these applications’ behavior becomes an incursion of privacy. In our investigation of 1,189 Android applications’ network traffic and permissions, 93.01% of the applications we studied connected to multiple destinations whenever we are using the network.

Keywords: Security, Smartphone, Privacy

Title: Detecting and Awarding Sensitive Information: Leakage in Android Application

Author: UJWALA S GANGASHETTI, SANDHYA A, 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: a string similarity measure or similarity function calculation is a main operation in web search engine. The operation of string metric calculation is the main part that can be used to identify similarity between two text strings. For appropriate string similarity calculation, there are various kinds of technologies has been introduced. In recent years, the efficient string similarity measure operations were done with the processing concept of inverted indexes. The filter and refine techniques is the main operation for identifying and verifying similar strings in the given data collection. For large volume of data, the computation cost will be high. A prefix based inverted index has been calculated for relevant query extraction. Based upon the prefix value, the approach of multiple prefix filtering can be used to produce most similar string. In this paper, we propose a Q-gram based edit distance metric for efficient string similarity operation. For approximate string matching, Q-gram distance is a very effective and widely used distance metric. And FP-growth algorithm can be used for user query recommendation which makes effective query processing system.

Keywords: prefix filtering, Q-gram edit distance metric, FP-growth algorithm, information retrieval.

Title: Efficient Query Processing System on Web Search Engine

Author: K.Bhuvaneswari, G.Sudhakhar

International Journal of Computer Science and Information Technology Research

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

Research Publish Journals

Abstract: The Wi-Fi has many features for internet access; the most important benefit is that they provide freedom from the web of wires. Wireless fidelity was first launched in the year 1999.IEEE 802.11 is the Wi-Fi code largely accepted all over the world. Wi-Fi has changed the way people use Internet today. According to the on-going IEEE 802.11ac amendment, the wireless network is about to embrace the gigabit-per-second raw data rate. There are many Wi-Fi technologies which are used with the help of router. The latest router is AC router, it is also known as 802.11AC router with many benefits including speed, bandwidth etc. Two best evolving standards are IEEE 802.11ac in wireless-local-area-network (WLAN) products and 3GPP LTE-Advanced in cellular communications. IEEE 802.11ac promises data rates of up to 1.73Gbps between an access point and a wireless client. The IEEE802.11ac is an emerging WLAN standard which operates at 5GHz band. Ac router offers the ultimate performance and excellent bandwidth with antennas compare of N router (802.11N router).It is also upgrade of the previous technology network. In this research paper we will grasp the basics of 802.11ac and the features involved such as: Extended channel binding, Downlink Multi-user MIMO, Beam-forming, High-Definition video streaming data at high speeds, Syncing and Backing Up, Modulation types. Through numerical analysis and simulations, we compare the MAC of 802.11n and 802.11ac, the result is, 802.11ac with a configuration of 80MHz and single (two) spatial streams outperforms 802.11n with a configuration of 40MHz and two spatial streams and its maximum throughput.

Keywords: Extended channel binding, Multi-user MIMO, Beam-forming, Definition video streaming data at high speeds, Syncing and Backing Up.

Title: A SURVEY AND PERFORMANCE ANALYSIS OF IEEE 802.11ac WIFI NETWORKING

Author: Sunit Nitin Kelkar

International Journal of Computer Science and Information Technology Research

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

Research Publish Journals

Abstract: Breast cancer affects many people at the present time. The factors that cause this disease are many and cannot be easily determined. Additionally, the diagnosis process which determines whether the cancer is benign or malignant also requires a great deal of effort from a doctors and physicians. When several tests are involved in the diagnosis of breast cancer, such as clump thickness, uniformity of cell size, uniformity of cell shape,…etc, the ultimate result may be difficult to obtain, even for medical experts. This has given a rise in the last few years to the use of machine learning and Artificial Intelligence in general as diagnostic tools. In this paper, we analyses the performance of Naïve Baysien Classifier and C5.0 algorithm in predicting the survivable rate of breast cancer patients. The data set used for analysing is the University Medical Centre, Institute of Oncology, Ljubljana, Yugoslavia database to evaluate the proposed system performances. These techniques helps the physician to take decisions on prognosis of breast cancer patients. At the end of analysis, C5.0 proves better performance than Naïve Baysien Classifier.

Keywords: Breast cancer, Naïve Baysien, C5.0 algorithm.

Title: Predicting Breast Cancer Survivability Using Naïve Baysien and C5.0 Algorithm

Author: Mr. D R Umesh, Thilak C R

International Journal of Computer Science and Information Technology Research

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

Research Publish Journals

Abstract: In this big data world we can see daily based data which are generated day by day e.g. Google, amazon, Facebook etc. This large amount of data is un-reliable to store, manage and analyze. This large volume of data runs on Commodity hardware, which are parallel arranged. The data that are large in volume takes more time to execute for particular process and causes fail to distributed system because these huge volume data runs on distributed system. To overcome this issue a framework was proposed called HADOOP for big data processing and is being used now days in organizations. It process large amount of data in small amount time rather than large distributed systems. It has automatic fault tolerance capacity to tackle with failed of systems in execution or processing time using Map Reduce programming technique. Here execution time is still an issue for delivering large amount of data and processing it repeatedly for particular oracle.  Existing HADOOP system does not have any feature to reduce time for recompilation. I propose a HADOOP distributed system for large data processing, which has two type of cache memory one is local cache, and other is distributed centralized cache memory. I use these cache memories for reducing the recompilation time.  Distributed cache consisted with least memory space so LRU cache is implemented to allocate memory space simultaneously. The LRU caching scheme is to remove the least recently used frame when the cache is full and a new page is referenced which is not there in cache.

Keywords: big data, distributed, Map Reduce, HADOOP, LRU cache.

Title: DISTRIBUTED DATA CACHE FOR BIGDATA WITH LRU CACHE USING MAPREDUCE TECHNIQUE

Author: R.Saranya, N.Sundaram

International Journal of Computer Science and Information Technology Research

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

Research Publish Journals