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

筛选
英文 中文
Early Detection of Distributed Denial of Service Attack in Era of Software-Defined Network 软件定义网络时代分布式拒绝服务攻击的早期检测
2018 Eleventh International Conference on Contemporary Computing (IC3) Pub Date : 2018-08-01 DOI: 10.1109/IC3.2018.8530546
B. Joshi, Nitin Joshi, M. Joshi
{"title":"Early Detection of Distributed Denial of Service Attack in Era of Software-Defined Network","authors":"B. Joshi, Nitin Joshi, M. Joshi","doi":"10.1109/IC3.2018.8530546","DOIUrl":"https://doi.org/10.1109/IC3.2018.8530546","url":null,"abstract":"A Distributed Denial of Service (DDoS) attack try to make services or resources unavailable to legitimate customers of that service or resource. These attacks are relatively easy to perform and extremely hard to detect in early stages. Different types of detection techniques were proposed by researcher to detect DDoS in its early stages but due to closed nature of networking devices, no promising results were produced. However, with the advents of Software-Defined Network (SDN), situation has changed. SDN is a cutting edge technology, which separates control plane from data plane. Its features, like programmability and centralized view of network, can be used to overcome the difficulties faced by researches. In this paper, we discussed different detection techniques of DDoS and how these techniques can be made more effective by leveraging the unique features of SDN.","PeriodicalId":118388,"journal":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","volume":"29 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":"127479166","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
Empirical Evidence of Heuristic and Cost Based Query Optimizations in Relational Databases 关系型数据库中启发式和基于成本的查询优化的经验证据
2018 Eleventh International Conference on Contemporary Computing (IC3) Pub Date : 2018-08-01 DOI: 10.1109/IC3.2018.8530467
S. Mehta, Parmeet Kaur, P. Lodhi, O. Mishra
{"title":"Empirical Evidence of Heuristic and Cost Based Query Optimizations in Relational Databases","authors":"S. Mehta, Parmeet Kaur, P. Lodhi, O. Mishra","doi":"10.1109/IC3.2018.8530467","DOIUrl":"https://doi.org/10.1109/IC3.2018.8530467","url":null,"abstract":"A SQL query may be expressed in different forms with varying execution costs; hence, it is essential to choose the best when performance is considered. There are many factors that affect the cost and performance of a query. For instance, a query on a relation without proper indexes can cause full relation scans, which in turn causes either performance or locking problems. Query asking for a relation held by another query can cause dead locks and an improperly formed query can also lead to greater complexity. In this context, the paper presents an empirical analysis of the heuristic and cost-based query optimization techniques. The execution cost of a number of queries was calculated and compared with execution plans obtained after optimization. In particular, we have experimentally checked the impact of query rewriting; the ordering of SQL joins and Select statements and replacement of joins with semi-joins. The experiments have yielded a clear insight into the effect of the mentioned optimizations.","PeriodicalId":118388,"journal":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","volume":"6 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":"129033024","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
An Intelligent Task Scheduling Approach for Cloud Using IPSO and A* Search Algorithm 基于IPSO和A*搜索算法的云智能任务调度方法
2018 Eleventh International Conference on Contemporary Computing (IC3) Pub Date : 2018-08-01 DOI: 10.1109/IC3.2018.8530545
B. P. Kavin, S. Ganapathy, A. Kannan
{"title":"An Intelligent Task Scheduling Approach for Cloud Using IPSO and A* Search Algorithm","authors":"B. P. Kavin, S. Ganapathy, A. Kannan","doi":"10.1109/IC3.2018.8530545","DOIUrl":"https://doi.org/10.1109/IC3.2018.8530545","url":null,"abstract":"Cloud computing technology is playing a vital role in this fast internet era for transferring, storing and accessing the large volume of confidential data which are official, medical and military. Efficient techniques for searching and processing the cloud data are essential for providing better service to the cloud users. For the fast processing and searching the data, many techniques were proposed by various researchers in the past. However, those techniques are not working in better results in cloud services. In a heterogeneous environment, achieving higher efficiency is an important issue in task scheduling. To solve this problem, many evolutionary algorithms have been adopted in the past. Even though it is a Nondeterministic Polynomial-hard problem, the local search algorithms are integrated for increasing convergence speed in population-based algorithms. In this paper, we propose a new task scheduling approach which combines an incremental particle swarm optimization and A * search algorithm for effective task scheduling. Moreover, the current particle swarm optimization algorithms and the heuristic algorithms gained in results on random and scientific Directed Acyclic Graph. The experiments show that the performance of the proposed approach is better when it is compared with the existing task scheduling approaches.","PeriodicalId":118388,"journal":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","volume":"3 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":"131074134","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
Requirement Risk Prioritization Using Analytic Hierarchy Process: A Gateway to Identify Risky Requirements 用层次分析法确定需求风险优先级:识别风险需求的一种途径
2018 Eleventh International Conference on Contemporary Computing (IC3) Pub Date : 2018-08-01 DOI: 10.1109/IC3.2018.8530569
Priyanka Chandani, Chetna Gupta
{"title":"Requirement Risk Prioritization Using Analytic Hierarchy Process: A Gateway to Identify Risky Requirements","authors":"Priyanka Chandani, Chetna Gupta","doi":"10.1109/IC3.2018.8530569","DOIUrl":"https://doi.org/10.1109/IC3.2018.8530569","url":null,"abstract":"The hazardous risks in software requirements quite often present key challenges to organizations. Requirement risks are among the most significant risks in projects and have to be managed for the success of the project. Risk prioritization plays a major role in risk management practices particularly with respect to risk assessment and planning. This study has demonstrated a novel method that uses Analytic Hierarchy Process (AHP) [1] to prioritize requirement risk and find which requirement is jeopardous/perilous. Using this model, it is possible to analyze prominent risk in the requirements, which can be communicated to stakeholders well on time. The study is motivated by wide application of AHP as a prioritization technique in various complex problems. This model certainly helps in obtaining risk free requirements at the end of requirement engineering phase to make a consistent quality product that has minimum rework later.","PeriodicalId":118388,"journal":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","volume":"111 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":"132001162","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
Machine Learning Based Framework to Predict Performance Evaluation of On-Chip Networks 基于机器学习的片上网络性能预测框架
2018 Eleventh International Conference on Contemporary Computing (IC3) Pub Date : 2018-08-01 DOI: 10.1109/IC3.2018.8530505
Anil Kumar, B. Talawar
{"title":"Machine Learning Based Framework to Predict Performance Evaluation of On-Chip Networks","authors":"Anil Kumar, B. Talawar","doi":"10.1109/IC3.2018.8530505","DOIUrl":"https://doi.org/10.1109/IC3.2018.8530505","url":null,"abstract":"Chip Multiprocessors(CMPs) and Multiprocessor System-on-Chips(MPSoCs) are meeting the ever increasing demand for high performance in processing large scale data and applications. There is a corresponding increase in the volume and frequency of traffic in the Network-on-Chip(NoC) architectures like CMPs and SoCs. NoC performance parameters like network latency, flit latency and hop count are critical measures which directly influence the overall performance of the architecture and execution time of the application. Unfortunately, cycle-accurate software simulators become slow for interactive use with an increase in architectural size of NoC. In order to provide the chip designer with an efficient framework for accurate measurements of NoC performance parameters, we propose a Machine Learning(ML) framework. Which is designed using different ML regression algorithms like Support Vector Regression(SVR) with different kernels and Artificial Neural Networks(ANN) with different activation functions. The proposed learning framework can be used to analyze the performance parameters of Mesh and Torus based NoC architectures. Results obtained are compared against the widely used cycle-accurate Booksim simulator. Experiments were conducted by variables like topology size from $2times 2$ to $30times 30$ with different virtual channels, traffic patterns and injection rates. The framework showed an approximate prediction error of 5% to 8% and overall minimum speedup of $1500times$ to $2000times$.","PeriodicalId":118388,"journal":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","volume":"52 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":"133430976","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
Audio Acoustic Features Based Tagging and Comparative Analysis of its Classifications 基于声学特征的标记及其分类比较分析
2018 Eleventh International Conference on Contemporary Computing (IC3) Pub Date : 2018-08-01 DOI: 10.1109/IC3.2018.8530512
Somya Goel, Raghav Pangasa, Suma Dawn, Anuja Arora
{"title":"Audio Acoustic Features Based Tagging and Comparative Analysis of its Classifications","authors":"Somya Goel, Raghav Pangasa, Suma Dawn, Anuja Arora","doi":"10.1109/IC3.2018.8530512","DOIUrl":"https://doi.org/10.1109/IC3.2018.8530512","url":null,"abstract":"Musical genres can be used to distribute and manage music datasets to increase the ease in finding a music piece a person wants to listen to. This paper presents a research for creating a suitable model for genre recognition in audio files using machine learning classifiers on the IRMAS11 https://www.upf.edu/web/mtg/irmas dataset. Python language library pyAudinAnalysls22 https://github.com/tyiannak/pyAudioAnalysis for extracting features from audio files is used. Further, three base classifiers, namely Support Vector Machines (SVM), Decision Tree and Random Forest are also depicted. IRMAS [10] genre dataset provides 6705 audio files of four genres classical, country folk, jazz and pop-rock. Also explored is an ensemble classification model by creating a stack of classifiers for the genre recognition task. Genre classification using SMOTE has been characterized in the confusion matrix. Maximum accuracy of 81.56% using the ensemble classifier is achieved using the proposed methodology.","PeriodicalId":118388,"journal":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","volume":"96 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":"116676217","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
An Overview of Pixel Value Differencing Based Data Hiding Techniques 基于像素值差异的数据隐藏技术综述
2018 Eleventh International Conference on Contemporary Computing (IC3) Pub Date : 2018-08-01 DOI: 10.1109/IC3.2018.8530673
Akanksha Singh, Mukesh Rawat, A. Shukla, Amod Kumar, Balvinder Singh
{"title":"An Overview of Pixel Value Differencing Based Data Hiding Techniques","authors":"Akanksha Singh, Mukesh Rawat, A. Shukla, Amod Kumar, Balvinder Singh","doi":"10.1109/IC3.2018.8530673","DOIUrl":"https://doi.org/10.1109/IC3.2018.8530673","url":null,"abstract":"Steganography is the science of invisible communication with its widespread applications in the area of secret exchange of information. Steganography research has seen tremendous growth in the recent past with its focus on image based steganography. Image based steganography research can be classified as spatial and transform domain. Methods developed in both of these domains fulfill different requirements of invisible communication. Imperceptibility, hiding capacity, and security are key parameters to assess steganography methods. Pixel value differencing (PVD) based methods are the most promising and most researched methods today. This paper presents an overview of progression of PVD based image steganography methods. Attempts in different successive methods have been done towards resolving issues associated with previous methods and to improve different quality parameters.","PeriodicalId":118388,"journal":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","volume":"7 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":"114930702","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
Determination of Optimal Thread Pool for Cloud Based Concurrent Enhanced No-Escape Search 基于云的并发增强无escape搜索的最优线程池确定
2018 Eleventh International Conference on Contemporary Computing (IC3) Pub Date : 2018-08-01 DOI: 10.1109/IC3.2018.8530645
Harshit Gujral, Abhinav Sharma, S. Mittal
{"title":"Determination of Optimal Thread Pool for Cloud Based Concurrent Enhanced No-Escape Search","authors":"Harshit Gujral, Abhinav Sharma, S. Mittal","doi":"10.1109/IC3.2018.8530645","DOIUrl":"https://doi.org/10.1109/IC3.2018.8530645","url":null,"abstract":"In this era of high demand for cloud-computing, concurrent and high-performance processing is the viable option to enhance performance and use available resources efficiently. Thread pool architecture is widely implemented in order to improve resource utilization and enhance performance. Studies in this field suggest that Thread pool size is mostly determined by heuristics, trials, or practical experience. This process lacks precision and theoretical justification. In this paper, a novel Hyperbola-based Thread-Pool Analysis (HTA) technique for determining optimal Thread Pool size by considering available bandwidth (upload/download speed) and workload (file-size) has been proposed for any cloud-based concurrent process. Here, HTA has been developed in the context of No-Escape Search (NES), a cloud-based content indexing and search system, proposed by authors in an earlier work. Results of HTA indicate an accuracy of 97.63% in estimation of optimal thread pool size. Incorporating HTA with No-Escape Search resulted a significant decrease in insertion time by 2236 folds and retrieval time by 1747 folds. Additionally, this paper also presents design of enhanced NES with features like pictorial representation of files for the visual summary, more efficient deletion algorithm using lazy delete and duplicate files detection in order to ensure efficient indexing.","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":"127006741","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
Framework for Freight Truck Return-Trip Assignment System 货车回程分配系统框架
2018 Eleventh International Conference on Contemporary Computing (IC3) Pub Date : 2018-08-01 DOI: 10.1109/IC3.2018.8530500
Sumit Mishra, Vishal Singh, D. Bhattacharya
{"title":"Framework for Freight Truck Return-Trip Assignment System","authors":"Sumit Mishra, Vishal Singh, D. Bhattacharya","doi":"10.1109/IC3.2018.8530500","DOIUrl":"https://doi.org/10.1109/IC3.2018.8530500","url":null,"abstract":"Optimization of freight logistics is crucial for economic development. Technology intrusion in logistics sector leads it to a new height. However, the major problem persists with freight trucks, either business-to-business (B2B) or owner-driver, is running back empty after they deliver their primary freight to destination. For enhancing earning, freight driver or managing company can leverage the use of an information system for finding out the customer in the return trip as well. Hence, in this paper, we first examine different aspects related to state of art and practice, for return trip truck appointment system. Further, we provided a modular framework for the system. The model of the system is so adapted that freight truck and customer, both behave as a resource to each other, equally likely so that ethics of trip-deal remain protected. The notification is generated according to involve intricacies like internet data connection fluctuation and driver illiteracy.","PeriodicalId":118388,"journal":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","volume":"61 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":"127776230","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
Modeling Recommendation System for Real Time Analysis of Social Media Dynamics 面向社交媒体动态实时分析的建模推荐系统
2018 Eleventh International Conference on Contemporary Computing (IC3) Pub Date : 2018-08-01 DOI: 10.1109/IC3.2018.8530458
Shipra Goel, Muskan Banthia, Adwitiya Sinha
{"title":"Modeling Recommendation System for Real Time Analysis of Social Media Dynamics","authors":"Shipra Goel, Muskan Banthia, Adwitiya Sinha","doi":"10.1109/IC3.2018.8530458","DOIUrl":"https://doi.org/10.1109/IC3.2018.8530458","url":null,"abstract":"With the increasing popularity of twitter, Sentiment analysis of data from twitter has become a research trend. With the help of Twitter API, large number of tweets can be retrieved in real time related to our interest for the analysis. Millions of tweets are posted daily which contain opinions of users around the world. The aim of this project is to develop a desktop application which present users with tweets they may have an interest in. This model analyzes the most used keyword and most mentioned username from the user timeline and henceforth recommend recent tweets with the same keyword from that user. The proposed model assists user in finding relevant tweets related to a particular keyword or hashtag which are categorized into positive and negative using sentimental analysis. The model also deals with different visualization techniques to illustrate the analysis of the most used keyword and mentioned username with the help of various R packages.","PeriodicalId":118388,"journal":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","volume":"23 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":"121659983","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
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学术官方微信