作者：
Divvela Srinivasa RaoV. SucharitaSr. Asst
Professor Department of Computer Science & Engineering Lakireddy Bali Reddy College of Enginnering Mylavaram Krishna District Andhra Pradesh -521230 India Assoc. Professor
Department of Computer Science & EngineeringK.L.UniversityGreen FieldsVaddeswaram Guntur District Andhra Pradesh-522502 India
The issue of high utility mining is finding the majority of the high utility item sets in a value-based database. Most calculations discover high utility item sets in two stages. The initial step distinguishes the gre...
详细信息
The issue of high utility mining is finding the majority of the high utility item sets in a value-based database. Most calculations discover high utility item sets in two stages. The initial step distinguishes the greater part of the potential item sets. The second step then decides the high utility item sets from the arrangement of potential item sets. The extensive number of potential item sets in the initial step is for the most part the mining bottleneck. In the event that we can diminish the quantity of potential item sets, the mining execution can be enhanced essentially. In this paper we propose a novel structure, named GUIDE (Generation of maximal high Utility Item sets from Data streams), to discover maximal high utility item sets from information streams with distinctive models, i.e., historic point, sliding window and time blurring models. The proposed structure, named MUI-Tree (Maximal high Utility Item set Tree), keeps up vital data for the mining procedures and the proposed techniques further encourages the execution of GUIDE. Fundamental commitments of this paper are as per the following: 1) To the best of our insight, this is the first work on mining the minimized type of high utility examples from information streams; 2) GUIDE is a successful one-pass system which meets the prerequisites of information stream mining; 3) GUIDE produces novel examples which are high utility as well as maximal, which give smaller and canny concealed data in the information streams. Trial results demonstrate that our methodology beats the best in class calculations under different conditions in information stream situations on diverse models
作者：
R. VidyaBanuN. NagaveniC.M. AnanthAsst. Professor
Computer Applications Sri Krishna college of Engineering and TechnologyKuniyamuthur Coimbatore- 641008 India Associate Professor
MathematicsCoimbatore Institute of Technology Coimbatore- 641014 MSc SE
Sri Krishna college of Engineering and Technology Kuniyamuthur Coimbatore- 641008 India
With the increased digitization of the society, more and more information about the physical world and citizens is collected and stored in databases. The collection of information by governments and corporations has c...
With the increased digitization of the society, more and more information about the physical world and citizens is collected and stored in databases. The collection of information by governments and corporations has created massive opportunities for knowledge-based decision making. Unfortunately, collecting huge volume of data and applying analytics also implicate privacy violations. This study is to solve the problem of security on highly confidential message passing using Soft Enigma. The main implementation of soft enigma is that by combining the concept of enigma with time variant random number. The results arrived were significant and this technique ensures highly secured message passing. This technique can be used for giving the confidential data to third party for mining purposes.
This abstract frames the research conducted on the existing version of a 3-D gesture-recognition based animation game, MathMazing with the purpose of overcoming the drawbacks of this system. In addition to this, we ha...
详细信息
This abstract frames the research conducted on the existing version of a 3-D gesture-recognition based animation game, MathMazing with the purpose of overcoming the drawbacks of this system. In addition to this, we have summarized our approach to the proposed system. MathMazing was implemented by our alumni [Sahasrabudhe et al., 2009] [1] for teaching basic arithmetic to primary school. Our objective is to improve upon it. We have made a thorough study of its drawbacks and will be combating the same within the course of our project implementation. This endeavor not only requires the application of Logic and Kinesthetic skills but it also addresses spatial skills. This paper highlights the study of the existing system and puts forth a proposed solution that overcomes the limitations of the existing system.
With the massive proliferation of online applications and cloud resources, there is a tremendous hike in usage of social networking platforms. Right from entrepreneur, players, politicians, students, or anyone are hig...
详细信息
With the massive proliferation of online applications and cloud resources, there is a tremendous hike in usage of social networking platforms. Right from entrepreneur, players, politicians, students, or anyone are highly depending on social networking sites, which generates loads of massive data that are not only challenging but also highly impossible to understand. The prime reason behind this is Big data is massive in size and they are highly unstructured. Because of this fact, the proposed system attempts to understand the possibility of performing knowledge discovery process from Big Data using conventional data mining algorithms. Designed in Java considering massive number of online educational data from social networking sites, the proposed system evaluates the effectiveness of performing data clustering and datamining for Big data.
Major online platforms such as Face book, Google, and Twitter allow third-party applications such as games, and Productivity applications access to user online private data. Such accesses must be authorized by users a...
详细信息
ISBN:
(纸本)9781467357869
Major online platforms such as Face book, Google, and Twitter allow third-party applications such as games, and Productivity applications access to user online private data. Such accesses must be authorized by users at installation time. The Open Authorization protocol (OAuth) was introduced as a secure and efficient method for authorizing third-party applications without releasing a user's access credentials. However, OAuth implementations don't provide the necessary fine-grained access control, nor any recommendations. We propose a multicriteria recommendation model that utilizes application-based, user-based, and category-based collaborative filtering mechanisms. Our collaborative filtering mechanisms are based on previous user decisions, and application permission requests to enhance the privacy of the overall site's user population
作者：
M. RajendiranS.K. SrivatsaPh. D. Research scholar
Department of Computer Science and Engineering Sathyabama University Chennai-600119.India Associate Professor
Department of Master of Computer Applications Panimalar Engineering College Chennai -600123 India Senior Professor
Department of Computer Science and Engineering St. Josephs College of Engineering Chennai-600119 India
Mobile ad hoc networks (MANET) are provisionally connected networks with no permanent infrastructure. A mobile ad hoc network is a self-organized and energetically reconfigurable wireless network without wired infrast...
详细信息
Mobile ad hoc networks (MANET) are provisionally connected networks with no permanent infrastructure. A mobile ad hoc network is a self-organized and energetically reconfigurable wireless network without wired infrastructure and central administration. Nodes in the mobile ad hoc network can immediately create a communication structure while each node moves in a random way. Multicasting is capable of performing required services for ad hoc applications. The dynamic nature of the network topology and limited resources, maintaining and finding the path for multicasting data is still further challenging. Several protocols have been designed for multicasting in mobile ad hoc networks. On demand multicast routing protocol is one such protocol. ODMRP is mesh based and on-demand protocol that uses forwarding group to communicate a mesh for each multicasting group. The aim of the proposed algorithm is to find the stable path selection in ODMRP for forwarding packets. The basic on demand multicast routing protocol path selection uses minimum delay principle. The proposed algorithm considers node energy in path selection from source to destination. This article discusses the studies on output parameters such as control overhead and end to end delay by varying the input parameters viz., multicast groups size and mobility in the developed algorithm. Experimental results confirm that this approach can improve stability of path due to node energy consumption.
Do In this paper presents recent advances in technology have made low‐cost, low‐power wireless sensors with efficient energy consumption. A network of such nodes can coordinate among themselves for distributed sensi...
Do In this paper presents recent advances in technology have made low‐cost, low‐power wireless sensors with efficient energy consumption. A network of such nodes can coordinate among themselves for distributed sensing and processing of certain data. For which, we propose an architecture to provide a stateless solution in sensor networks for efficient routing in wireless sensor networks. This type of architecture is known as Tree Cast. We propose a unique method of address allocation, building up multiple disjoint trees which are geographically inter‐twined and rooted at the data sink. Using these trees, routing messages to and from the sink node without maintaining any routing state in the sensor nodes is possible. In this paper, we introduce the wormhole attack, a severe attack in ad hoc networks that is particularly challenging to defend against. The wormhole attack is possible even if the attacker has not compromised any hosts and even if all communication provides authenticity and confidentiality. In the wormhole attack, an attacker records packets (or bits) at one location in the network, tunnels them to another location, and retransmits them there into the network. The wormhole attack can form a serious threat in wireless networks, especially against many sensor network routing protocols and location‐based wireless security systems. For example, most existing ad hoc network routing protocols, without some mechanism to defend against the wormhole attack, would be unable to find routes longer than one or two hops, severely disrupting communication. We present a new, general mechanism, called packet leashes, for detecting and thus defending against wormhole attacks, and we present a specific protocol, called TIK, that implements leashes.
In general the images used for compression are of different types like dark image, high intensity image etc. When these images are compressed using self-organizing feature maps it takes longer time to converge. The re...
详细信息
In general the images used for compression are of different types like dark image, high intensity image etc. When these images are compressed using self-organizing feature maps it takes longer time to converge. The reason for this is that the given image may contain a number of distinct gray levels with narrow difference with their neighbourhood pixels. If the gray levels of the pixels in an image and their neighbours are mapped in such a way that the difference in the gray levels of the neighbours with the pixel is minimum, then compression ratio as well as the convergence of the network can be improved. To achieve this, a cumulative distribution function is estimated for the image and it is used to map the image pixels. When the mapped image pixels are used, the self-organizing feature map network yields high compression ratio as well as it converges quickly.
暂无评论