2017 Tenth International Conference on Contemporary Computing (IC3)最新文献_第6页

A fast GPU algorithm for biconnected components 双连接组件的快速GPU算法

2017 Tenth International Conference on Contemporary Computing (IC3) Pub Date : 2017-08-01 DOI: 10.1109/IC3.2017.8284293

Mihir Wadwekar, Kishore Kothapalli

引用次数: 7

Clickstream & behavioral analysis with context awareness for e-commercial applications 点击流和行为分析与上下文意识的电子商务应用程序

2017 Tenth International Conference on Contemporary Computing (IC3) Pub Date : 2017-08-01 DOI: 10.1109/IC3.2017.8284328

Sakshi Bansal, Chetna Gupta, Adwitiya Sinha

{"title":"Clickstream & behavioral analysis with context awareness for e-commercial applications","authors":"Sakshi Bansal, Chetna Gupta, Adwitiya Sinha","doi":"10.1109/IC3.2017.8284328","DOIUrl":"https://doi.org/10.1109/IC3.2017.8284328","url":null,"abstract":"The widespread eminence of internetworking plays a vital role in revolutionizing the commercial domain. Prior to make purchases, people spend a lot of time on the internet to gather information and feedback, so as to better direct their decisions. Since, customers are not present in person in the stores they can easily shift from one supplier to the other via online portals. From business point of view, this could be harmful for the profit and propaganda of traders. In this research, the prime focus is to overcome such problems confronted by trading industries. Our proposed model analyses ‘Clickstream Events’ of online users along with set of contextual details for providing better recommendations. Recording the behavior of several users can help industries to discover habits and tendencies of user, which can lead to even better and effective decisions to improve business profit and its market coverage. Further, our proposed model aims at discovering the relationship between various items, from the context of user interest. Market Basket Analysis is performed that assists the user with appropriate options while purchasing products along with items already purchased, thereby offering better buying experience.","PeriodicalId":147099,"journal":{"name":"2017 Tenth International Conference on Contemporary Computing (IC3)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114306601","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}

引用次数: 6

A study on the minimum dominating set problem approximation in parallel 最小支配集问题并行逼近的研究

2017 Tenth International Conference on Contemporary Computing (IC3) Pub Date : 2017-08-01 DOI: 10.1109/IC3.2017.8284287

Mahak Gambhir, Kishore Kothapalli

引用次数: 1

Designing energy efficient traveling paths for multiple mobile chargers in wireless rechargeable sensor networks 无线可充电传感器网络中多个移动充电器的节能路径设计

2017 Tenth International Conference on Contemporary Computing (IC3) Pub Date : 2017-08-01 DOI: 10.1109/IC3.2017.8284332

Abhinav Tomar, P. K. Jana

{"title":"Designing energy efficient traveling paths for multiple mobile chargers in wireless rechargeable sensor networks","authors":"Abhinav Tomar, P. K. Jana","doi":"10.1109/IC3.2017.8284332","DOIUrl":"https://doi.org/10.1109/IC3.2017.8284332","url":null,"abstract":"Mobile charging is an important topic for wireless rechargeable sensor networks (WRSNs) which has been studied extensively over the past few years. With the help of wireless energy transfer (WET), it is now possible to extend lifetime of sensor nodes to a longer period. In WET, wireless charging vehicle (WCV) moves on its designed traveling path in the network and charges sensor nodes by halting at some stopping locations. However, large scale WRSNs demand for multiple WCVs to make mobile charging more feasible. It is to be noted that for designing energy efficient traveling paths, it is desirable to minimize the stopping locations of the WCV which improves charging efficiency in the noticeable amount. Moreover, charging multiple nodes at the same time improves charging performance and thus it is recent trend. Inspired by the above facts, in this paper, we serve the objective of designing energy efficient traveling paths for multiple WCVs with multi-node charging. Our proposed scheme works in two phases. In the first phase, we perform clustering to divide the network region into charging subregions according to available number of WCVs. In the second phase, we apply charging radius based nearest neighbor approach (CR-NN) to find anchor points (i.e., stopping locations) for those WCVs to design traveling paths. The simulation results confirm the effectiveness of our scheme and demonstrate performance gains with respect to several metrics such as charging latency, waiting time, node failure rate, and so on.","PeriodicalId":147099,"journal":{"name":"2017 Tenth International Conference on Contemporary Computing (IC3)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133348070","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}

引用次数: 10

A frequent itemset reduction algorithm for global pattern mining on distributed data streams 分布式数据流上全局模式挖掘的频繁项集约简算法

2017 Tenth International Conference on Contemporary Computing (IC3) Pub Date : 2017-08-01 DOI: 10.1109/IC3.2017.8284320

Shalini, Sanjay Kumar Jain

引用次数: 1

Normalized videosnapping: A non-linear video synchronization approach 规范化视频捕捉:非线性视频同步方法

2017 Tenth International Conference on Contemporary Computing (IC3) Pub Date : 2017-08-01 DOI: 10.1109/IC3.2017.8284325

Ankit Tripathi, Benu Changmai, Shrukul Habib, Nagaratna B. Chittaragi, S. Koolagudi

引用次数: 1

CRUISE: A platform for crowdsourcing Requirements Elicitation and evolution CRUISE:众包需求引出和进化的平台

2017 Tenth International Conference on Contemporary Computing (IC3) Pub Date : 2017-08-01 DOI: 10.1109/IC3.2017.8284308

Richa Sharma, A. Sureka

引用次数: 11

Data clustering using enhanced biogeography-based optimization 基于增强生物地理学优化的数据聚类

2017 Tenth International Conference on Contemporary Computing (IC3) Pub Date : 2017-08-01 DOI: 10.1109/IC3.2017.8284305

Raju Pal, M. Saraswat

引用次数: 32

No-escape search: Design and implementation ofcloud based directory content search 无逃逸搜索:基于云的目录内容搜索的设计和实现

2017 Tenth International Conference on Contemporary Computing (IC3) Pub Date : 2017-08-01 DOI: 10.1109/IC3.2017.8284288

Harshit Gujral, Abhinav Sharma, S. Mittal

引用次数: 2

Sarcasm detection of tweets: A comparative study 推文的讽刺检测:一个比较研究

2017 Tenth International Conference on Contemporary Computing (IC3) Pub Date : 2017-08-01 DOI: 10.1109/IC3.2017.8284317

Tanya Jain, Nilesh Agrawal, Garima Goyal, Niyati Aggrawal

{"title":"Sarcasm detection of tweets: A comparative study","authors":"Tanya Jain, Nilesh Agrawal, Garima Goyal, Niyati Aggrawal","doi":"10.1109/IC3.2017.8284317","DOIUrl":"https://doi.org/10.1109/IC3.2017.8284317","url":null,"abstract":"Sarcasm is a nuanced form of communication where the individual states opposite of what is implied. One of the major challenges of sarcasm detection is its ambiguous nature. There is no prescribed definition of sarcasm. Another major challenge is the growing size of the languages. Every day hundreds of new slang words are being created and used on these sites. Hence, the existing corpus of positive and negative sentiments may not prove to be accurate in detecting sarcasm. Also, the recent developments in online social networks allow its users to use varied kind of emoticons with the text. These emoticons may change the polarity of the text and make it sarcastic. Due to these difficulties and the inherently tricky nature of sarcasm it is generally ignored during social network analysis. As a result the results of such analysis are affected adversely. Thus, sarcasm detection poses to be one of the most critical problems which we need to overcome. Detection of sarcastic content is vital to various NLP based systems such as text summarization and sentiment analysis. In this paper we address the problem of sarcasm detection by leveraging the most common expression of sarcasm — “positive sentiment attached to a negative situation”. Our work uses two ensemble based approaches — voted ensemble classifier and random forest classifier. Unlike current approaches to sarcasm detection which rely on existing corpus of positive and negative sentiments for training the classifiers, we use a seeding algorithm to generate training corpus. The proposed model also uses a pragmatic classifier to detect emoticon based sarcasm.","PeriodicalId":147099,"journal":{"name":"2017 Tenth International Conference on Contemporary Computing (IC3)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114415517","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}

引用次数: 20