IJEECM Journal of Computer Science (IJEECM-JCS)

An Advanced Sales Forecasting System using XGBoost Algorithm

Authors: Rashmi Priyanka Saradhi V S, Naresh Nelaturi

Abstract: In this paper we have performed deals gauging for stores utilizing diverse data mining methods. The paper included anticipating the deals on some random day at any store. Keeping in mind the end goal to acclimate ourselves with the paper we have examined past work in the space including Time Series Algorithm and also a spatial methodology. A great deal of investigation was performed on the data to recognize examples and anomalies which would supporter obstruct the forecast calculation. The highlights utilized ran from store data to client data also relate land data. Data mining techniques like Linear Regression, Random Forest Regression and XGBoost were executed and the outcomes analyzed. XGBoost which is an enhanced angle boosting calculation was seen to play out the best at expectation. With effectiveness being the route forward in many enterprises today, we mean to extend our answer for help stores enhance efficiency and increment income by exploiting Data Analysis.Applied just three calculations i.e Time Series algo, irregular backwoods and XGBoost. So there is degree for applying more calculations like time arrangement straight models, KNN Regression, Unobserved Component Model, and Principle Component Regression. By taking the relapse of the considerable number of models for every one of the business data may anticipate the business better. For our situation weighted normal of Random Forest yield and XGBoost gives preferable outcome over individual calculations.

Keywords: Sales Prediction, Linear Regression, XGBoost, Time Series, Gradient Boosting.

A Optimized Analysis for detection of Malicious Mobile App

Authors: B V V Durga, V Sita Rama Prasad, Dr. C P V N J MohanRao

Abstract: Positioning misrepresentation in the portable Application business shows to false or dubious activities, which are motivated behind, thumping up the Applications in the popularity list. To be sure, it ends up being more endless for Application architects to adventure shady means, for instance, developing their Applications' business or posting fraud Application assessments, to ponder situating deception. While the ramification of abstaining from positioning misrepresentation has been largely maintained, there is constrained comprehension and examination here. This paper gives an all-inclusive viewpoint of situating deception and proposes a Positioning misrepresentation distinguishing proof structure for versatile Applications. In particular, it is proposed to precisely discover the mining in order to posture blackmail the dynamic periods, to be particular driving sessions, of compact Applications. Such driving sessions can be used for recognizing the area irregularity as opposed to an overall anomaly of Application rankings. In addition, three sorts of verification s are investigated, i.e., situating based affirmations, displaying to rate based confirmations and study based evidences, Applications' situating, rating and review rehearses through genuine speculations tests. In the request, this paper gets the skill of the proposed system, and shows the distinguishing proof's flexibility estimation furthermore some consistency of situating deception works out.

Keywords: Mobile Apps, ranking fraud detection, historical ranking records, evidence aggregation, review, ranking and rating

Secure Relay Data communication in untrusted cooperative Networks

Authors: M Vikas, N V Ashok kumar

Abstract: This project studies the problem of secure transmission in dual-hop cooperative networks with untrusted relays, where each relay acts as both a potential helper and an eavesdropper. A security-aware relaying scheme is proposed, which employs the alternate jamming and secrecy-enhanced relay selection to prevent the confidential message from being eavesdropped by the untrusted relays. To evaluate the performance of the proposed strategies, we derive the lower bound of the achievable ergodic secrecy rate (ESR), and conduct the asymptotic analysis to examine how the ESR scales as the number of relays increases.

Keywords: Secure routing; Manets; Graph; QoS; Attacks.

A Secure and Efficient Lifetime Routing Optimization for End-to-End Communication in WSN

Authors: MD Raziya, Dr G Satyanarayana

Abstract: Lifetime optimization and security are two conflicting design issues for multi-hop wireless sensor networks (WSNs) with non-replenish able energy resources. In this paper, we first propose a novel secure and efficient end-to-end routing protocol to address these two conflicting issues through two adjustable parameters: energy balance control (EBC) and probabilistic based random walking. We then discover that the energy consumption is severely disproportional to the uniform energy deployment for the given network topology, which greatly reduces the lifetime of the sensor networks. To solve this problem, we propose an efficient non-uniform energy deployment strategy to optimize the lifetime and message delivery ratio under the same energy resource and security requirement. We also provide a quantitative security analysis on the proposed routing protocol. Our theoretical analysis demonstrate that the proposed end to end routing protocol can provide an excellent tradeoff between routing efficiency and energy balance, and can significantly extend the lifetime of the sensor networks in all scenarios. For the non-uniform energy deployment, we also demonstrate that the proposed end-to-end routing protocol can achieve a high message delivery ratio while preventing routing attacks. We adopt a novel approach of group key communication scheme in our design, such that there is a unique group key, called as path key, to protect data transmitted in the entire routing path. Rather than using multiple shared keys to repeat to perform encryption and decryption over every link, we implement end-to-end path keys to reduce the overheads of key generation. Therefore, we can see that by implementing these concepts we can improve efficiency of network and provide more security of transferred message.

Keywords: Security, Wireless Sensor Networks, Frequency hopping, Dijkstra's Algorithm, Encryption and Decryption

Reconfiguration Delay based Network Scheduling for Time Varying Channels

Authors: Vanjangi Jyotsna Devi, Jhansi Rani Singothu

Abstract: We consider the optimal control problem for networks subjected to time-varying channels, reconfiguration delays, and interference constraints. We show that the simultaneous presence of time-varying channels and reconfiguration delays significantly reduces the system stability region and changes the structure of optimal policies. We first consider memory less channel processes and characterize the stability region in closed form. We prove that a frame-based Max-Weight scheduling algorithm that sets frame durations dynamically, as a function of the current queue lengths and average channel gains, is throughput-optimal. Next, we consider arbitrary Markov-modulated channel processes and show that memory in the channel processes can be exploited to improve the stability region. We develop a novel approach to characterizing the stability region of such systems using state-action frequencies, which are stationary solutions to a Markov Decision Process (MDP) formulation. Moreover, we develop a dynamic control policy using the state-action frequencies and variable frames whose lengths are functions of queue sizes and show that it is throughputoptimal. The frame-based dynamic control (FBDC) policy is applicable to a broad class of network control systems, with or without reconfiguration delays, and provides a new framework for developing throughputoptimal network control policies using state-action frequencies. Finally, we propose Myopic policies that are easy to implement and have better delay properties as compared to the FBDC policy.

Keywords: Markov decision process, queueing, reconfiguration delay, scheduling, switching delay, timevarying channels.

A Novel Wireless Networks protection based on self preservation techniques

Authors: Pranuthi Royyala, Jhansi Rani Singothu

Abstract: Because of the widespread use of wireless sensor networks in many applications, and due to the nature of the specifications of these networks (WSN) in terms of wireless communication, the network contract specifications, and published it in difficult environments. All this leads to the network exposure to many types of external attacks. Therefore, the protection of these networks from external attacks is considered the one of the most important researches at this time. In this paper we investigated the security in wireless sensor networks, Limitations of WSN, Characteristic Values for some types of attacks, and have been providing protection mechanism capable of detecting and protecting wireless sensor networks from a wide range of attacks.

Keywords: Wireless Sensor Network (WSN), Attack, protection mechanism, Packet flow, Security, abnormal.

Secure Cloud Storage Auditing with Key Disclosure Resistance

Authors: Shaik Mastan, P Vemana

Abstract: Cloud storage auditing is viewed as an imperative service to corroborate the veracity of the data in public cloud. Existing auditing protocols are all based on the supposition that theClient’s secret key for auditing is completely protected. Such assumption may not always be held, due to the probably weak sense of security and/or low security settings at the client. In most of the current auditing protocols would inevitably become unable to work when a secret key for auditing is exposed. It is investigated on how to reduce the damage of the client’s key revelation in cloud storage auditing, and provide the first handy elucidation for this new problem setting. Formalized the definition and the security model of auditing protocol with key-exposure resilience and propose such a protocol. Utilized and developed a novel authenticator construction to support the forward security and the property of block less verifiability using the current design. The security proof and the performance analysis show that the projected protocol is protected and well-organized.

Keywords: Data storage, cloud storage auditing, cloud computation, key exposure resistance

A Novel K means algorithm based Image Segmentation

Authors: Surendra Yalakala, Jhansi Rani Singothu

Abstract: In this project ,we propose a color based segmentation method that uses the K means clustering technique to track tumor objects in magnetic resonance (MR) brain images. The key concept in this color based segmentation algorithm with k means means to convert a given gray level MR image in to a color space image and then separate the position of tumor objects from other items of an MR image by using K means clustering And histogram clustering .Experiments demonstrates that the method can successfully achieve segmentation for MR brain images to help pathologists distinguish exactly lesion size and region.

Keywords: image analysis; boundary extraction; topological derivative, level set.

QoS Based Source Arrangement in Wireless Mesh Networks

Authors: Boddepalli Alekya ;Majji Venkata Appalanaidu

Abstract:

Many next generation applications (such as video flows) are likely to have associated minimum data rate requirements in order to ensure satisfactory quality as perceived by end-users. In this paper, we develop a framework to address the problem of maximizing the aggregate utility of traffic flows in a multi-hop wireless network, with constraints imposed both due to self-interference and minimum rate requirements. The parameters that are tuned in order to maximize the utility are (i) transmission powers of individual nodes and (ii) the channels assigned to the different communication links.....................

Keywords: Wireless mesh network, QoS, congestion control, resource allocation, admission control.

A Similarity based Friend recommendation system for Social networks

Authors: Ch murali Krishna; T Pratap

Abstract:

In this paper, we have presented a literature review of the modern friend recommendation services. Existing social networking services recommend friends to users based on their social graphs, which may not be the most appropriate to reflect a user’s preferences on friend selection in real life. In this paper, we present Friend book, a novel semantic-based friend recommendation system for social networks, which recommends friends to users based on their life styles instead of social graphs. By taking advantage of sensor rich smart phone, Friend book discovers life styles of users from user-centric sensor data, measures the similarity of life styles between users, and recommends friends to users if their life styles have high similarity. Inspired by text mining, we model a user’s daily life as life documents, from which his/her life styles are extracted by using the Latent Dirichlet Allocation algorithm. We further propose a similarity metric to measure the similarity of life styles between users, and calculate users’ impact in terms of life styles with a friend matching graph. Upon receiving a request, Friend book returns a list of people with highest recommendation scores to the query user. Finally, Friend book integrates a feedback mechanism to further improve the recommendation accuracy.

Keywords: Friendbook, recommendation, social network, lifestyle
If You feel any difficulty in paper submission, Please mail us ijeecm@gmail.com


Copyright © 2015 International Journal of Electrical, Electronics,Computers & Mechanical Engineering. All Rights Reserved.