Conference Papers
Permanent URI for this collectionhttps://idr.nitk.ac.in/handle/123456789/28506
Browse
5 results
Search Results
Item Discount heuristics and heterogeneous probabilities for optimal influence in social networks(Institute of Electrical and Electronics Engineers Inc., 2014) Sivasailam, K.; Sebastian, V.K.; Jacob, D.M.; Bhattacharya, S.Given a graph 'G', Influence Maximization is the problem of finding a subset of nodes of size 'k' that would maximize the spread of influence in G. This problem has applications in viral marketing studies and spread of information through 'word of mouth'. The problem, as defined by Domingos and Richardson, can be stated as follows: If we can give a product to a small subset of the population such that these people will convince the most number of people to adopt the product in the future, which subset would we choose? Discount heuristics provide great computational speed up in comparison to the traditional greedy algorithm, which runs for hours for networks with tens of thousands of nodes. In this work, we cite a perceived limitation in the degree discount heuristic for Influence maximization, and develop three new discount heuristics, namely Closeness discount, Betweenness discount and PageRank discount for comparison against the degree discount. We show that using degree discount heuristic still leads to the best seed set selection and hence show that the perceived limitation in the degree discount heuristic does not exist. In addition, we also show that PageRank discount beats Degree Discount in terms of Influence Spread when heterogeneous probabilities are used, thus showing that merely considering graph characteristics without taking into account other nodal properties is insufficient. © 2014 IEEE.Item Study and analysis of various task scheduling algorithms in the cloud computing environment(Institute of Electrical and Electronics Engineers Inc., 2014) Mathew, T.; Chandra Sekaran, K.C.; Jose, J.Cloud computing is a novel perspective for large scale distributed computing and parallel processing. It provides computing as a utility service on a pay per use basis. The performance and efficiency of cloud computing services always depends upon the performance of the user tasks submitted to the cloud system. Scheduling of the user tasks plays significant role in improving performance of the cloud services. Task scheduling is one of the main types of scheduling performed. This paper presents a detailed study of various task scheduling methods existing for the cloud environment. A brief analysis of various scheduling parameters considered in these methods is also discussed in this paper. © 2014 IEEE.Item K-distinct strong minimum energy topology problem in wireless sensor networks(Springer Verlag, 2015) Panda, B.S.; Shetty D, D.P.; Pandey, A.Given a set of sensors, the strong minimum energy topology (SMET) problem is to assign transmit power to each sensor such that the resulting topology containing only bidirectional links is strongly connected and the total energy of all the nodes is minimized. The SMET problem is known to be NP-hard. Currently available sensors in the market support a finite set of transmission ranges. So we consider the k- Distinct-SMET problem, where only k transmission power levels are used. We prove that the k-Distinct-SMET problem is NP-complete for k ≥ 3. However, on the positive side, we show that the 2-Distinct- SMET problem can be solved in polynomial time. The energy cost of transmitting a bit is higher than the cost of computation, and hence it may be advantageous to organize the sensors into clusters and form a hierarchical structure. This motivated the study of k-Distinct-rStrong Minimum Energy Hierarchical Topology (k-Distinct-rSMEHT) problem: Given a sensor network consisting of n sensors, and integers k and r, assign transmit powers to all sensors out of the k distinct power levels such that (i) the graph induced using only the bi-directional links is connected, (ii) at most r sensors are connected to two or more sensors by a bidirectional link and (iii) the sum of the transmit powers of all the sensors is minimum. We Propose a(formula presented.) approximation algorithm for the k-Distinct-rSMEHT problem for any fixed r and arbitrary k. © Springer International Publishing Switzerland 2015.Item HiRE – A heuristic approach for user generated record extraction(Springer Verlag service@springer.de, 2016) Chandrakanth, S.; Santhi Thilagam, P.User Generated Content extraction is the extraction of user posts, viz., reviews and comments. Extraction of such content requires the identification of their record structure, so that after the content is extracted, proper filtering mechanisms can be applied to eliminate the noises. Hence, record structure identification is an important prerequisite step for text analytics. Most of the existing record structure identification techniques search for repeating patterns to find the records. In this paper, a heuristic based approach is proposed. This method uses the implicit logical organization present in the records and outputs the record structure. © Springer International Publishing Switzerland 2016.Item Detecting phishing websites using automation of human behavior(Association for Computing Machinery, Inc acmhelp@acm.org, 2017) Rao, R.S.; Pais, A.R.In this paper, we propose a technique to detect phishing attacks based on behavior of human when exposed to fake website. Some online users submit fake credentials to the login page before submitting their actual credentials. He/She observes the login status of the resulting page to check whether the website is fake or legitimate. We automate the same behavior with our application (FeedPhish) which feeds fake values into login page. If the web page logs in successfully, it is classified as phishing otherwise it undergoes further heuristic filtering. If the suspicious site passes through all heuristic filters then the website is classified as a legitimate site. As per the experimentation results, our application has achieved a true positive rate of 97.61%, true negative rate of 94.37% and overall accuracy of 96.38%. Our application neither demands third party services nor prior knowledge like web history, whitelist or blacklist of URLS. It is able to detect not only zero-day phishing attacks but also detects phishing sites which are hosted on compromised domains. © 2017 Copyright held by the owner/author(s).