2018 Eleventh International Conference on Contemporary Computing (IC3)最新文献

筛选
英文 中文
Modified DBSCAN Using Particle Swarm Optimization for Spatial Hotspot Identification 基于粒子群优化的改进DBSCAN空间热点识别
2018 Eleventh International Conference on Contemporary Computing (IC3) Pub Date : 2018-08-01 DOI: 10.1109/IC3.2018.8530558
Ankita, M. Thakur
{"title":"Modified DBSCAN Using Particle Swarm Optimization for Spatial Hotspot Identification","authors":"Ankita, M. Thakur","doi":"10.1109/IC3.2018.8530558","DOIUrl":"https://doi.org/10.1109/IC3.2018.8530558","url":null,"abstract":"Spatial hotspots of irregular shape occur naturally in fields like epidemiology and earth science. Classical techniques for identifying hotspots are either based on scan statistics or clustering algorithms. These techniques result in hotspots of fixed shapes like circle, ellipse or straight line. Density based spatial clustering of applications with noise (DBSCAN) is one of the often used algorithms for finding non-geometric shaped clusters. It is highly sensitive to the values of its input variables (MinPoints and Epsilon) which are to be provided by the users. In this paper, we propose a Particle Swarm Optimization (PSO) based approach which automatically computes the values of MinPoints and Epsilon for given input data and finds the spatial hotspots. The modified DBSCAN approach is applied to six artificial datasets and purity of the resultant clustering is calculated. Achieved values of the purity function indicate the accuracy of the proposed method. Proposed approach is also applied to find out the hotspots for earthquake zoning.","PeriodicalId":118388,"journal":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115640510","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
Threshold-Based Heuristics for Trust Inference in a Social Network 基于阈值的社交网络信任推断启发式算法
2018 Eleventh International Conference on Contemporary Computing (IC3) Pub Date : 2018-08-01 DOI: 10.1109/IC3.2018.8530496
Bithika Pal, Suman Banerjee, M. Jenamani
{"title":"Threshold-Based Heuristics for Trust Inference in a Social Network","authors":"Bithika Pal, Suman Banerjee, M. Jenamani","doi":"10.1109/IC3.2018.8530496","DOIUrl":"https://doi.org/10.1109/IC3.2018.8530496","url":null,"abstract":"Trust among the users of a social network plays a pivotal role in item recommendation, particularly for the cold start users. Due to the sparse nature of these networks, trust information between any two users may not be always available. To infer the missing trust values, one well-known approach is path based trust estimation, which suggests a user to believe all of its neighbors in the network. In this context, we propose two threshold-based heuristics to overcome the limitation of computation for the path based trust inference. It uses the propagation phenomena of trust and decides a threshold value to select a subset of users for trust propagation. While the first heuristic creates the inferred network considering only the subset of users, the second one is able to preserve the density of the inferred network coming from all users selection. We implement the heuristics and analyze the inferred networks with two real-world datasets. We observe that the proposed threshold based heuristic can recover up to 70 % of the paths with much less time compared to its deterministic counterpart. We also show that the heuristic based inferred trust is capable of preserving the recommendation accuracy.","PeriodicalId":118388,"journal":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114934881","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
Real-Time Driver's Drowsiness Monitoring Based on Dynamically Varying Threshold 基于动态变化阈值的驾驶员睡意实时监测
2018 Eleventh International Conference on Contemporary Computing (IC3) Pub Date : 2018-08-01 DOI: 10.1109/IC3.2018.8530651
Isha Gupta, Novesh Garg, Apoorva Aggarwal, Nitin Nepalia, Bindu Verma
{"title":"Real-Time Driver's Drowsiness Monitoring Based on Dynamically Varying Threshold","authors":"Isha Gupta, Novesh Garg, Apoorva Aggarwal, Nitin Nepalia, Bindu Verma","doi":"10.1109/IC3.2018.8530651","DOIUrl":"https://doi.org/10.1109/IC3.2018.8530651","url":null,"abstract":"One of the most prevailing problems across the globe nowadays is the booming number of road accidents. Improper and inattentive driving is one of the major cause of road accidents. Driver's drowsiness or lack of concentration is considered as a dominant reason for such mishaps. Research in the field of driver drowsiness monitoring may help to reduce the accidents. This paper therefore proposes a non-intrusive approach for implementing a driver's drowsiness alert system which would detect and monitor the yawning and sleepiness of the driver. The system uses Histogram Oriented Gradient (HOG) feature descriptor for face detection and facial points recognition. Then SVM is used to check whether detected object is face or non-face. It further monitors the Eye Aspect Ratio (EAR) and Mouth Aspect Ratio (MAR) of the driver up to a fixed number of frames to check the sleepiness and yawning. Since the drowsiness or tiredness of the driver is also based on the number of hours he or she has been driving, an additional feature of varying the threshold frames for eyes and mouth is included. This makes the system more sensitive towards drowsiness detection. Also, this requires the inclusion of face recognition implementation so that monitoring can be done individually for every driver. Our experimental results shows that our proposed framework perform well.","PeriodicalId":118388,"journal":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123300779","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}
引用次数: 27
Supporting E-Mentoring for Programming Labs in Engineering Education 支持工程教育编程实验室的电子指导
2018 Eleventh International Conference on Contemporary Computing (IC3) Pub Date : 2018-08-01 DOI: 10.1109/IC3.2018.8530476
R. Arora, S. Goel
{"title":"Supporting E-Mentoring for Programming Labs in Engineering Education","authors":"R. Arora, S. Goel","doi":"10.1109/IC3.2018.8530476","DOIUrl":"https://doi.org/10.1109/IC3.2018.8530476","url":null,"abstract":"Mentoring by teachers, lab instructors or peers during programming labs of engineering students, proves highly beneficial in acquiring the required programming competencies. Electronic mentoring (e-mentoring) uses computer-mediated communication in order to facilitate the mentoring process between the mentor and the mentee. Practicing e-mentoring to facilitate the mentoring process can benefit the students, since it is not bound by temporal or geographical differences. Emails, discussion forums, interactive virtual environments, blogs, wikis, etc., are the most common electronic media that have been used for e-mentoring. In this paper, we present a novel framework and design of a tool to support e-mentoring during programming laboratories. Students can share their codes and errors with the mentors, in real-time, and receive corrections/suggestions for the same. The framework also supports an asynchronous mode, which facilitates e-mentoring by alumni and industry experts. The tool interfaces with the Eclipse IDE of individual student and creates a virtual mentoring environment for facilitating e-mentoring of programming assignments.","PeriodicalId":118388,"journal":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125545248","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
Sustainable Waste Management Model 可持续废物管理模式
2018 Eleventh International Conference on Contemporary Computing (IC3) Pub Date : 2018-08-01 DOI: 10.1109/IC3.2018.8530544
Dhruv Batra, Shreya Garg, Tarushi Agrawal, Saurabh Gangal, Indu Chawla, Shikha Jain
{"title":"Sustainable Waste Management Model","authors":"Dhruv Batra, Shreya Garg, Tarushi Agrawal, Saurabh Gangal, Indu Chawla, Shikha Jain","doi":"10.1109/IC3.2018.8530544","DOIUrl":"https://doi.org/10.1109/IC3.2018.8530544","url":null,"abstract":"The problems concerning waste management in the world are rapidly increasing day by day. Improper planning of waste management and lack of technical support are the main reasons of these problems. This greatly affects the health conditions of the citizens. Consequently, it is vital to propose a feasible solution for this problem. This paper represents a sustainable waste management system which can be adopted by any city. It can be served as a guiding tool to the municipal corporation. The system ensures a sequential execution of the procedures following collection, disposal, transportation and processing of waste. The idea is to divide the management system into four modules-division of the city into zones to reduce the problem size, assignment of scrape yards to each zone, optimization of waste collection route and setting an efficient budget for investing in waste processing machines, thereby designing an overall waste management model. This management model helps both ways, environmentally and economically. The proposed model gives precise results for the dataset.","PeriodicalId":118388,"journal":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125086703","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
An Ensemble Model for Breast Cancer Prediction Using Sequential Least Squares Programming Method (SLSQP) 序列最小二乘规划法(SLSQP)预测乳腺癌的集成模型
2018 Eleventh International Conference on Contemporary Computing (IC3) Pub Date : 2018-08-01 DOI: 10.1109/IC3.2018.8530572
Madhuri Gupta, B. Gupta
{"title":"An Ensemble Model for Breast Cancer Prediction Using Sequential Least Squares Programming Method (SLSQP)","authors":"Madhuri Gupta, B. Gupta","doi":"10.1109/IC3.2018.8530572","DOIUrl":"https://doi.org/10.1109/IC3.2018.8530572","url":null,"abstract":"Cancer is a collection of diseases which is obsessed by uncontrolled growth of cells in the body to produce abnormal cells. Breast cancer is the most common cancer among women. In cancer, abnormal cells spread in other body part that is advance stage of cancer; at this stage survival rate is very low. So, Cancer detection at early stage is highly required to reduce the mortality rate. Here, Mortality means death because of cancer. With the improvement of innovation and machine learning techniques, cancer detection has made advances. Machine learning (ML) allows system to learn on the basis of past experiences and take decision using various statistical and probabilistic methods with minimal human intervention. This research work exhibited an ensemble model to predict the breast cancer using four machine learning techniques which are Support Vector Machine, Logistic Regression, Decision Tree and K-Nearest Neighbour. Results shows that proposed ensemble framework is more accurate in contrast of tradition single classification system. In this research work, SLSQP method is used to assign weight to each classification model and prediction of each classifier is combined using soft voting technique.","PeriodicalId":118388,"journal":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126122419","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}
引用次数: 18
Comparative Analysis of Different Keypoint Based Copy-Move Forgery Detection Methods 基于关键点的复制-移动伪造检测方法的比较分析
2018 Eleventh International Conference on Contemporary Computing (IC3) Pub Date : 2018-08-01 DOI: 10.1109/IC3.2018.8530489
Amanpreet Kaur, Savita Walia, Krishan Kumar
{"title":"Comparative Analysis of Different Keypoint Based Copy-Move Forgery Detection Methods","authors":"Amanpreet Kaur, Savita Walia, Krishan Kumar","doi":"10.1109/IC3.2018.8530489","DOIUrl":"https://doi.org/10.1109/IC3.2018.8530489","url":null,"abstract":"Copy-move forgery is the most commonly performed type of forgery. For copy-move forgery detection, block based and keypoint based methods are available. In this paper, keypoint based features are chosen as they are computationally less complex as compared to block based features. Four different keypoint based feature extraction algorithms i.e. SURF, KAZE, Harris corner points and BRISK are analyzed in order to check their efficiency for copy-move forgery detection. The method used involves four basic stages: Image pre-processing, interest point detector, feature vector description and feature matching. The results are compared on the basis of accuracy, fl-score and precision which are calculated using a threshold parameter for matching algorithm. It has been concluded that KAZE features give best results in all performance metrics and Harris corner points turn out to be unsuitable for copy move forgery detection due to the fact that Harris corner points are not scale invariant and detect only corners instead of edges.","PeriodicalId":118388,"journal":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131577151","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
2018 Eleventh International Conference on Contemporary Computing, IC3 2018, Noida, India, August 2-4, 2018 2018第十一届当代计算国际会议,IC3 2018,印度诺伊达,2018年8月2日至4日
2018 Eleventh International Conference on Contemporary Computing (IC3) Pub Date : 2018-08-01 DOI: 10.1109/ic3.2018.8530627
{"title":"2018 Eleventh International Conference on Contemporary Computing, IC3 2018, Noida, India, August 2-4, 2018","authors":"","doi":"10.1109/ic3.2018.8530627","DOIUrl":"https://doi.org/10.1109/ic3.2018.8530627","url":null,"abstract":"","PeriodicalId":118388,"journal":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131038033","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
Collusion Attack Resistant SVD Based Secured Audio Watermarking Scheme with Chaotic Encryption 基于混沌加密的抗合谋攻击SVD安全音频水印方案
2018 Eleventh International Conference on Contemporary Computing (IC3) Pub Date : 2018-08-01 DOI: 10.1109/IC3.2018.8530488
T. K. Tewari, V. Saxena
{"title":"Collusion Attack Resistant SVD Based Secured Audio Watermarking Scheme with Chaotic Encryption","authors":"T. K. Tewari, V. Saxena","doi":"10.1109/IC3.2018.8530488","DOIUrl":"https://doi.org/10.1109/IC3.2018.8530488","url":null,"abstract":"In this paper, a blind, robust, and inaudible audio watermarking algorithm based on Singular Value Decomposition (SVD) is proposed. The algorithm produce multiple copies with different fingerprints/watermarks on the same audio using different SVD values making it robust to collusion attack. The proposed algorithm uses modified mean value and quantization index modulation technique of the singular values for watermark embedding. Instead of using the SVD matrix or the SVD matrix in cascade with the other transform directly for watermark embedding, the proposed schemes uses Baker's Chaotic mapping for encryption of the matrix without the cost of imperceptibility. The proposed method thus produces security as well as collusion attack resistance over all the SVD based methods where the location for the watermark embedding is known as the diagonal elements of the SVD matrix produced from the audio directly. Experimental results presented in this paper demonstrate the effectiveness of the proposed algorithm against signal processing attacks with good imperceptibility.","PeriodicalId":118388,"journal":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115371311","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
Empirical Analysis of Q&A Websites and a Sustainable Solution to Ensure Water-Security 问答网站实证分析与水安全可持续解决方案
2018 Eleventh International Conference on Contemporary Computing (IC3) Pub Date : 2018-08-01 DOI: 10.1109/IC3.2018.8530615
Harshit Gujral, Abhinav Sharma, Sangeeta Lal
{"title":"Empirical Analysis of Q&A Websites and a Sustainable Solution to Ensure Water-Security","authors":"Harshit Gujral, Abhinav Sharma, Sangeeta Lal","doi":"10.1109/IC3.2018.8530615","DOIUrl":"https://doi.org/10.1109/IC3.2018.8530615","url":null,"abstract":"In this paper, we present a novel empirical study of water-related questions from famous environment-related Q&A websites. Additionally, after a comprehensive evaluation, we explore solutions of global freshwater scarcity. Results show that in-spite of approximately constant number of water-related questions-posted from 2014–2017, the views on these questions are significantly decreasing. Prominent locations of water-related discussions are USA, Europe, Australia, and India. Most of the water-related questions discuss oceanography and water-management. Indian-users are observed to discuss solutions of their local water-related problems while no water-related discussion is observed from desalination-pioneers like Saudi-Arabia, Israel etc. Finite annual freshwater inventories are inadequate to meet stringently burgeoning human demand for water. To fathom desalination as a solution to water-scarcity by employing renewable energy, we draw a comparison of India and Saudi-Arabia and suggest desalination of sea-water as the sustainable solution for water-scarcity in regions with proximity to seas and oceans. This work also responds to myths that devoid of desalination and aims to formulate awareness in order to create a global freshwater security.","PeriodicalId":118388,"journal":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","volume":"34 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115496152","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
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学术官方微信