Proceedings of the 9th Annual ACM India Conference最新文献

筛选
英文 中文
A Methodology to Detect and Track Breaking News on Twitter 一种在Twitter上检测和跟踪突发新闻的方法
Proceedings of the 9th Annual ACM India Conference Pub Date : 2016-10-21 DOI: 10.1145/2998476.2998491
Anmol Shukla, Dhruv Aggarwal, R. Keskar
{"title":"A Methodology to Detect and Track Breaking News on Twitter","authors":"Anmol Shukla, Dhruv Aggarwal, R. Keskar","doi":"10.1145/2998476.2998491","DOIUrl":"https://doi.org/10.1145/2998476.2998491","url":null,"abstract":"Twitter is an interesting platform for the dissemination of news. The real-time nature and brevity of the tweets are conducive to sharing of information related to important events as they unfold. But, one of the greatest challenges is to find the tweets that we can characterize as news in the ocean of tweets. In this paper, we propose a novel method for detecting and tracking breaking news from Twitter in real-time. We filter the stream of incoming tweets to remove junk tweets using a text classification algorithm. We also compare the performance of different supervised text classification algorithms for this task. We then cluster similar tweets, so that, tweets in the same cluster relate to the same real-life event and can be termed as a breaking news. Finally, we rank the news using a dynamic scoring system which also allows us to track the news over a period of time.","PeriodicalId":171399,"journal":{"name":"Proceedings of the 9th Annual ACM India Conference","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114969983","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Centrality Approach for Community Detection in Large Scale Network 大规模网络中社区检测的中心性方法
Proceedings of the 9th Annual ACM India Conference Pub Date : 2016-10-21 DOI: 10.1145/2998476.2998489
R. Behera, Debadatta Naik, Bibhudatta Sahoo, S. K. Rath
{"title":"Centrality Approach for Community Detection in Large Scale Network","authors":"R. Behera, Debadatta Naik, Bibhudatta Sahoo, S. K. Rath","doi":"10.1145/2998476.2998489","DOIUrl":"https://doi.org/10.1145/2998476.2998489","url":null,"abstract":"Identifying communities in social network plays an important role in predicting behavior of the complex network. Real world systems in social network can be modeled as a graph structure, where nodes represents the social entities and edges represents the relationships among the entities. Usually nodes inside a community are having similar kinds of properties and most of them are influence by one or more central nodes in the network. Hence centrality principle can be adapted for efficiently discovery of communities. In this paper, an attempt has been made for community detection using central nodes of the network. Discovering central nodes in large scale network is a challenging task due to its huge complex structure. Central nodes have been been identified using map reduce paradigm in order to carry out the computation in distributed manner. The process of discovering communities is then carried out using the identified central nodes. Experimental evaluation shows that the proposed method for community detection provides better performance in term of both accuracy and time complexity.","PeriodicalId":171399,"journal":{"name":"Proceedings of the 9th Annual ACM India Conference","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125542776","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
An Automated Approach for Cross-Browser Inconsistency (XBI) Detection 跨浏览器不一致(XBI)检测的自动化方法
Proceedings of the 9th Annual ACM India Conference Pub Date : 2016-10-21 DOI: 10.1145/2998476.2998496
C. P. Patidar, Meena Sharma
{"title":"An Automated Approach for Cross-Browser Inconsistency (XBI) Detection","authors":"C. P. Patidar, Meena Sharma","doi":"10.1145/2998476.2998496","DOIUrl":"https://doi.org/10.1145/2998476.2998496","url":null,"abstract":"Due to the spread of the internet and the ever increasing number of web applications, the issue of compatibility across browsers has become very important. This compatibility issue is also referred as Cross Browser Inconsistency (XBI) wherein same website looks or behaves differently in different web browsers. In this paper our aim is to address this issue of compatibility and propose an automated approach of detecting XBIs. Cross Browser Inconsistencies can either be in the content, structure or behavior of the webpage. In order to get a grasp of the above mentioned types of inconsistencies, we surveyed some random websites and analyzed them in different browsers. We also studied the basic working of browser, in order to establish its connection with the occurrences of XBIs. Each browser has its own rendering mechanisms, which sometimes differs from standards. Hence, the execution of these websites is different in different browsers. Finally we have proposed an automated approach for XBI detection.","PeriodicalId":171399,"journal":{"name":"Proceedings of the 9th Annual ACM India Conference","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125109857","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Workload Aware Hybrid Partitioning 负载感知混合分区
Proceedings of the 9th Annual ACM India Conference Pub Date : 2016-10-21 DOI: 10.1145/2998476.2998479
Trupti Padiya, Jai Jai Kanwar, Minal Bhise
{"title":"Workload Aware Hybrid Partitioning","authors":"Trupti Padiya, Jai Jai Kanwar, Minal Bhise","doi":"10.1145/2998476.2998479","DOIUrl":"https://doi.org/10.1145/2998476.2998479","url":null,"abstract":"Real life databases exhibit highly skewed access patterns. These skewed access patterns can be exploited to partition the data considering the query workload. The presented work proposes Workload Aware Hybrid Partitioning (WAHP). WAHP identifies clusters of attributes which are queried together. It identifies workload aware clusters for the actual query workload using a hybrid combination of horizontal and vertical partitioning. The paper demonstrates WAHP experiment using TPC-C benchmark, where 9% of the actual TPC-C data in workload aware clusters, is able to answer 73% of hottest query-workload with an average execution time gain of 37% against original database.","PeriodicalId":171399,"journal":{"name":"Proceedings of the 9th Annual ACM India Conference","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122424530","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Selection of Image Blocks using Genetic Algorithm and Effective Embedding with DCT for Steganography 基于遗传算法的图像块选择与DCT有效嵌入的隐写
Proceedings of the 9th Annual ACM India Conference Pub Date : 2016-10-21 DOI: 10.1145/2998476.2998495
Shweta Joshi, Kavita Sonawane
{"title":"Selection of Image Blocks using Genetic Algorithm and Effective Embedding with DCT for Steganography","authors":"Shweta Joshi, Kavita Sonawane","doi":"10.1145/2998476.2998495","DOIUrl":"https://doi.org/10.1145/2998476.2998495","url":null,"abstract":"In today's digital world that we live in, security of information is crucial in various communication applications that are widely developed. Steganography is one of the highly secure information hiding techniques. It provides invisible communication and hides the existence of information. This paper focuses on 'before embedding technique' of hiding in image steganography by trying to find suitable places in cover image to embed the secret image. Genetic algorithm (GA) is applied to identify appropriate places in cover image where embedding of secret image will cause minimum distortion. After obtaining these places, embedding is performed using transform domain technique Discrete Cosine Transform (DCT). The secret image is first normalized and then embedded in the lower energy DCT blocks of the selected cover image regions. The experimental results show that the stego images obtained from the proposed method have less visual distortion with satisfactory values in parameters like MSE, PSNR and Correlation used for performance evaluation.","PeriodicalId":171399,"journal":{"name":"Proceedings of the 9th Annual ACM India Conference","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131235534","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Concept Preserving Visual Summarization of Social Image Search Results 社会图像搜索结果的概念保留视觉摘要
Proceedings of the 9th Annual ACM India Conference Pub Date : 2016-10-21 DOI: 10.1145/2998476.2998477
S. Takale, P. Kulkarni
{"title":"Concept Preserving Visual Summarization of Social Image Search Results","authors":"S. Takale, P. Kulkarni","doi":"10.1145/2998476.2998477","DOIUrl":"https://doi.org/10.1145/2998476.2998477","url":null,"abstract":"Existing tag based social media search engines present search results as a ranked list of images. But, they fail to identify visual, textual and geographical concepts present in query results. In this paper, we present an approach for automatic generation of visual, textual and geographical concept preserving summary of social image search results. For user specified query, search results are collected from popular content-sharing websites such as Flickr. Aim of the algorithm is, to generate representative but diverse summary having a set of images, information about locations-of-interest (LOI) associated with the query, and a set of tags, describing the context of images. The proposed scheme exploits multiple modalities in order to understand context and content of geotagged social images. We formulate the problem as a graph clustering problem, where nodes are images and edge weight is computed as geo-graphical distance, tag-based similarity between images and visual similarity between images. In order to reduce the computational overhead, we implement late fusion of three different edge weight parameters. An innovative Graph based clustering algorithm using Haversine distance formula is proposed for geo-clustering of images. Performance evaluation is based on intrinsic and extrinsic methods. We also present an evaluation protocol having no human intervention for evaluating coverage of geographical spread of images in the final result and cluster coherence. Through empirical study, we demonstrate the effectiveness of our algorithm against state-of-the-art image search result summarization methods.","PeriodicalId":171399,"journal":{"name":"Proceedings of the 9th Annual ACM India Conference","volume":"165 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121802921","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Quantitative Estimation of Cost Drivers for Intermediate COCOMO towards Traditional and Cloud Based Software Development 面向传统软件开发和基于云的软件开发的中间COCOMO成本驱动因素的定量估算
Proceedings of the 9th Annual ACM India Conference Pub Date : 2016-10-21 DOI: 10.1145/2998476.2998488
Amit Agrawal, Vaibhav Jain, Mohsin Sheikh
{"title":"Quantitative Estimation of Cost Drivers for Intermediate COCOMO towards Traditional and Cloud Based Software Development","authors":"Amit Agrawal, Vaibhav Jain, Mohsin Sheikh","doi":"10.1145/2998476.2998488","DOIUrl":"https://doi.org/10.1145/2998476.2998488","url":null,"abstract":"Software project estimation is the process of analyzing the resource requirements for the given time duration of product development. Cost estimation models are used for calculating the associated amount required for developing the stakeholder's requirement within the defined time boundaries. Among several models available for the cost estimation of software projects, COCOMO is one of the well-known models which serve the field most. Resources applied for the given time will generate the rough estimates, but for more accurate values, various factors are analyzed. These factors are termed as cost drivers. Software estimation using COCOMO is performed by selecting values of cost drivers on a predefined scale. This approach solely depends on experience of a software analyst. However, there is a lack of a systematic approach available for the selection of values of these cost drivers. Our work suggests the quantification of cost drivers for intermediate COCOMO. Quantification will implicitly fetch the values from the system and its environment which reduces the manual selection of ranges of scaling factors. Hence the systems cost will be generated directly without analyst and selector logic. Finally, if the selection of correct scaling is performed, then the calculation of cost will definitely get improved. An experimental analysis is performed between the above suggested model and the Intermediate COCOMO. The results show that the \"COCOMOUP\" is performing well under the known conditions and in uncertain requirements conditions, the system is getting better predictions.","PeriodicalId":171399,"journal":{"name":"Proceedings of the 9th Annual ACM India Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132530209","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Comparative Evaluation of Various Indexing Techniques of Geospatial Vector Data for Processing in Distributed Computing Environment 分布式计算环境下各种地理空间矢量数据索引处理技术的比较评价
Proceedings of the 9th Annual ACM India Conference Pub Date : 2016-10-21 DOI: 10.1145/2998476.2998493
Abdul Jhummarwala, Mazin Alkathiri, Miren Karamta, M. Potdar
{"title":"Comparative Evaluation of Various Indexing Techniques of Geospatial Vector Data for Processing in Distributed Computing Environment","authors":"Abdul Jhummarwala, Mazin Alkathiri, Miren Karamta, M. Potdar","doi":"10.1145/2998476.2998493","DOIUrl":"https://doi.org/10.1145/2998476.2998493","url":null,"abstract":"The explosion of ever increasing geospatial data is today met with the challenge of maintaining it in spatial databases and utilization of traditional methods of spatial data processing. The sheer volume and complexity of spatial databases makes them an ideal candidate for use with parallel and distributed processing architectures. There is a lot of enthusiasm toward using MapReduce paradigm and distributed computing for processing of large volumes of vector data. As spatial data cannot be indexed using traditional B-tree structures used by R/DBMS, several libraries such as JSI (Java Spatial Index), libspatialindex and SpatiaLite depend upon advanced data structures such as R/R*-tree, Quad-tree and their variants for spatial indexing. These indexing mechanisms have also been natively incorporated in frameworks such as Spatial Hadoop, Hadoop GIS SATO and GeoSpark. Additionally, most widely used open source RDBMS such as MySQL, Postgres and SQLite incorporate spatial indexing using extensions/add-ons. In this paper, we benchmark and compare the performance of various spatial indexing mechanisms in addition to evaluating the performance of distributed frameworks for planet sized datasets. We conclude by highlighting the characteristics of spatial tools and frameworks for better selection and implementation of R-tree indexing in a big geo-spatial processing system.","PeriodicalId":171399,"journal":{"name":"Proceedings of the 9th Annual ACM India Conference","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128513195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Hierarchical Tree-based Optimized Communication for Real Time Event Driven Internet of Things 基于层次树的实时事件驱动物联网优化通信
Proceedings of the 9th Annual ACM India Conference Pub Date : 2016-10-21 DOI: 10.1145/2998476.2998481
Saurabh K. Pandey, M. Zaveri
{"title":"Hierarchical Tree-based Optimized Communication for Real Time Event Driven Internet of Things","authors":"Saurabh K. Pandey, M. Zaveri","doi":"10.1145/2998476.2998481","DOIUrl":"https://doi.org/10.1145/2998476.2998481","url":null,"abstract":"Internet of Things envisions to support real time application processing and operations in a heterogeneous environment. It acts as an umbrella framework where smart objects perform communication, computation and coordination activities. To detect, gather and report such activities occurring in a distributed environment, an event driven system is needed. These activities are affected by energy consumption and average delay in the network. In this context, an optimized communication hierarchy is needed for effective reporting of events. Moreover, among many approaches proposed to optimize the energy consumption, reducing the number of transmissions and effective routing strategy are considered as an accomplishment. In this view, this paper proposes a tree-based optimized communication method for event driven Internet of Things. It focuses on balancing the workload of the devices in the IoT environment. The proposed algorithm is evaluated for efficacy on IoT based platform.","PeriodicalId":171399,"journal":{"name":"Proceedings of the 9th Annual ACM India Conference","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127132535","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Three Steps Secure Login: A systematic approach 三步安全登录:一个系统的方法
Proceedings of the 9th Annual ACM India Conference Pub Date : 2016-10-21 DOI: 10.1145/2998476.2998484
A. Ranjan, B. Kumar
{"title":"Three Steps Secure Login: A systematic approach","authors":"A. Ranjan, B. Kumar","doi":"10.1145/2998476.2998484","DOIUrl":"https://doi.org/10.1145/2998476.2998484","url":null,"abstract":"Generally, user authentication performs through user's Id and password. In this process, user id remains visible and password remains secret. But through shoulder surfing and other attacks, the password can also be traced due to exact password characters are typed or marked by users during login. To counter this vulnerability of tracing password, we propose a novel login method that does not reveal the user-id/password even if keylogging traces the typed keyboard's characters. We also do a security analysis to show that proposed mechanism is able to withstand a number of attacks and also mitigates some of the attacks. We also do a usability survey to show its feasibility among real-time users without compromising any security features.","PeriodicalId":171399,"journal":{"name":"Proceedings of the 9th Annual ACM India Conference","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126309158","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信