2016 Ninth International Conference on Contemporary Computing (IC3)最新文献

筛选
英文 中文
Non-repetitive single-hop broadcast model for CAM in IEEE802.11p VANETs IEEE802.11p VANETs中CAM的非重复单跳广播模型
2016 Ninth International Conference on Contemporary Computing (IC3) Pub Date : 2016-08-01 DOI: 10.1109/IC3.2016.7880247
P. Verma, Neeta Singh
{"title":"Non-repetitive single-hop broadcast model for CAM in IEEE802.11p VANETs","authors":"P. Verma, Neeta Singh","doi":"10.1109/IC3.2016.7880247","DOIUrl":"https://doi.org/10.1109/IC3.2016.7880247","url":null,"abstract":"VANETs relies on the repetitive exchange of Cooperative Awareness Messages (CAMs) among vehicle's On­Board Units (OBUs) and vehicles to roadside units (RSUs), thus making CAMs the backbone of the network. This exchange may lead to degradation of network performance caused by the ample amount of data exchange between the vehicles. Therefore, a trade­off between CAM broadcast within the network and optimum utilization of network resources is required. Most of the existing work focuses on retransmission of beacon messages supporting unicast 802.11 models which are not directly suited for the VANET scenario. To deal with this problem, the paper presents a model for non-repetitive single-hop broadcast of CAM within the network, thus supporting IEEE802.11p. For non-repetitive broadcast of CAM, the concept of preemption of messages is introduced in the model. Simulation is carried out using MATLAB 15's Simiilink. The model performance is evaluated by extracting its statistical properties in terms of Channel Utilization, CAM's Average Waiting Time within the queue and Average Queue Length. To validate our model, the simulation is implemented on real world data acquired from wheel speed for all wheels for the duration of a test drive.","PeriodicalId":294210,"journal":{"name":"2016 Ninth International Conference on Contemporary Computing (IC3)","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132907049","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
Effort, duration and cost estimation in agile software development 敏捷软件开发中的工作量、持续时间和成本估算
2016 Ninth International Conference on Contemporary Computing (IC3) Pub Date : 2016-08-01 DOI: 10.1109/IC3.2016.7880216
Mohd. Owais, R. Ramakishore
{"title":"Effort, duration and cost estimation in agile software development","authors":"Mohd. Owais, R. Ramakishore","doi":"10.1109/IC3.2016.7880216","DOIUrl":"https://doi.org/10.1109/IC3.2016.7880216","url":null,"abstract":"Estimation is very important and integral part of software development life cycle. Without estimation of effort, duration and cost, software cannot be developed. It is important to do accurate estimation as much as possible. Today in Information technology Industry Estimation in agile software development is mostly based on heuristic approaches like expert judgment and planning poker. In absence of agile experts, it is very difficult to estimate in agile software development. There is need of a algorithmic method in agile software development which can do accurate estimates. In this paper, we propose a simple algorithmic estimation method for agile software development and compare the results given by proposed method to check the feasibility of algorithmic method in real time.","PeriodicalId":294210,"journal":{"name":"2016 Ninth International Conference on Contemporary Computing (IC3)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134464715","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
Quantum inspired genetic algorithm for multi-hop energy balanced unequal clustering in wireless sensor networks 无线传感器网络中多跳能量平衡不均匀聚类的量子启发遗传算法
2016 Ninth International Conference on Contemporary Computing (IC3) Pub Date : 2016-08-01 DOI: 10.1109/IC3.2016.7880239
Manisha Rathee, Sushil Kumar
{"title":"Quantum inspired genetic algorithm for multi-hop energy balanced unequal clustering in wireless sensor networks","authors":"Manisha Rathee, Sushil Kumar","doi":"10.1109/IC3.2016.7880239","DOIUrl":"https://doi.org/10.1109/IC3.2016.7880239","url":null,"abstract":"Clustering in wireless sensor networks has been one of the most effective mechanisms for addressing the issues of network lifetime, scalability and bandwidth reusability. In this paper, application of a relatively new meta-heuristic called as quantum inspired genetic algorithm has been proposed for dealing with the problem of multi-hop energy balanced unequal clustering and prolonging the network lifetime. Quantum inspired genetic algorithm conflates the concepts of evolutionary computation with the principles of quantum computing. The quantum computing principles impart huge parallel processing capabilities to the genetic algorithm due to which these algorithms provide better quality solutions in lesser amount of time. Quantum inspired algorithms are capable of providing competitive solutions even with a very small population size which results in reduced computational cost as population size is a factor in complexity calculation for evolutionary and swarm algorithms. The effectiveness of proposed approach has been evaluated by comparing it with traditional genetic algorithm based clustering for wireless sensor networks. Simulation results clearly indicate that quantum inspired genetic algorithm is capable of performing clustering in more efficient way and increasing the network lifetime as compared to traditional genetic algorithm.","PeriodicalId":294210,"journal":{"name":"2016 Ninth International Conference on Contemporary Computing (IC3)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116898636","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}
引用次数: 13
Breaking an image encryption scheme based on chaotic synchronization phenomenon 破解一种基于混沌同步现象的图像加密方案
2016 Ninth International Conference on Contemporary Computing (IC3) Pub Date : 2016-08-01 DOI: 10.1109/IC3.2016.7880215
Sushmita Singh, Musheer Ahmad, Dhruv Malik
{"title":"Breaking an image encryption scheme based on chaotic synchronization phenomenon","authors":"Sushmita Singh, Musheer Ahmad, Dhruv Malik","doi":"10.1109/IC3.2016.7880215","DOIUrl":"https://doi.org/10.1109/IC3.2016.7880215","url":null,"abstract":"In recent past, Volos et al proposed an image encryption scheme based on true random bits generator in [Signal Processing 93, 1328–1340, 2013]. The TRBG uses two mutually coupled double scroll chaotic systems that are synchronized via complete chaotic synchronization and inverse π-lag synchronization techniques. The numerical simulations demonstrated the effectiveness of chaotic true random bits generator through FIPS-140-2 randomness test suite. The proposed generator is applied with an aim to secure the digital images by framing an image encryption process based on the effective TRBG. The statistical analyses conform to the required encryption standards and quality. But, Volos et al image encryption scheme inherently holds a number of vulnerabilities that make it possible to break the encryption scheme. This paper proposes the break of the Volos et al image encryption scheme by exploiting these vulnerabilities to evidence that their scheme lacks security. It is practically shown by applying the chosen-plaintext and known-plaintext attacks which successfully recovers the plaintext-image from the encrypted image without knowing the secret key. The idea is to show the ineligibility of the encryption scheme for use in practical image security applications.","PeriodicalId":294210,"journal":{"name":"2016 Ninth International Conference on Contemporary Computing (IC3)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116907701","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
Unmasking non-simultaneous sybils in mobile opportunistic networks 揭示移动机会网络中的非同步符号
2016 Ninth International Conference on Contemporary Computing (IC3) Pub Date : 2016-08-01 DOI: 10.1109/IC3.2016.7880235
Parmeet Kaur, S. Mittal
{"title":"Unmasking non-simultaneous sybils in mobile opportunistic networks","authors":"Parmeet Kaur, S. Mittal","doi":"10.1109/IC3.2016.7880235","DOIUrl":"https://doi.org/10.1109/IC3.2016.7880235","url":null,"abstract":"Mobile opportunistic networks allow nodes to freely join and leave the network; hence they are highly susceptible to security threats. The paper proposes a method for detection and avoidance of a non-simultaneous Sybil attack in mobile opportunistic networks. In this attack, a malicious node assumes multiple, fake identities (i.e. Sybils) over a period of time to remain active in the network even after it has been detected as malicious. These Sybils may deplete the network resources or bias recommendation and voting systems. The proposed Sybil detection and avoidance methodology has been simulated using the opportunistic network simulator, ONE. The simulation results show that the proposed technique achieves a higher probability of packet delivery and reduces the average latency, overhead and the number of aborted message transmissions in networks with varying number of malicious nodes as compared to the case when no Sybil detection method is used.","PeriodicalId":294210,"journal":{"name":"2016 Ninth International Conference on Contemporary Computing (IC3)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122133133","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
Chaotic Kbest gravitational search algorithm (CKGSA) 混沌Kbest引力搜索算法(CKGSA)
2016 Ninth International Conference on Contemporary Computing (IC3) Pub Date : 2016-08-01 DOI: 10.1109/IC3.2016.7880252
H. Mittal, Raju Pal, Ankur Kulhari, M. Saraswat
{"title":"Chaotic Kbest gravitational search algorithm (CKGSA)","authors":"H. Mittal, Raju Pal, Ankur Kulhari, M. Saraswat","doi":"10.1109/IC3.2016.7880252","DOIUrl":"https://doi.org/10.1109/IC3.2016.7880252","url":null,"abstract":"Gravitational search algorithm is a popular adaptive search algorithm among nature-inspired algorithms and has been successfully used for optimizing many real-world problems. Gravitational search algorithm uses the law of Newton gravity for finding the optimal solution. The performance of gravitational search algorithm is controlled by exploration and exploitation capabilities and Kbest is one of its parameters that controls this trade-off. In this paper, a novel chaotic Kbest gravitational search algorithm has been proposed that uses the chaotic model in Kbest to balance the exploration and exploitation non-linearly. The proposed algorithm shows better convergence rate at later iterations with high precision and does not trap into local optima. The experimental results validate that the proposed algorithm outperforms.","PeriodicalId":294210,"journal":{"name":"2016 Ninth International Conference on Contemporary Computing (IC3)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129950014","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}
引用次数: 55
Impact of genetic algorithm on time series data 遗传算法对时间序列数据的影响
2016 Ninth International Conference on Contemporary Computing (IC3) Pub Date : 2016-08-01 DOI: 10.1109/IC3.2016.7880236
Garima Sharma, S. Srivastava
{"title":"Impact of genetic algorithm on time series data","authors":"Garima Sharma, S. Srivastava","doi":"10.1109/IC3.2016.7880236","DOIUrl":"https://doi.org/10.1109/IC3.2016.7880236","url":null,"abstract":"Efficient planning of hospital resources and services are the prime concern of any hospital administration in terms of patient care. Predicting Average Length of Stay of patient may help in strategic decision making and effective planning of hospital resources. If the length of stay is decided corresponding to disease treatment patient can plan their hospital days priorly in an efficient manner. In this research work, we have taken Alabama University historical hospital data set of the year 2008 and 2009 month-wise for the forecasting analysis using genetic crossover method. We have evaluated results in terms of Average Forecasting Error Rate (AFER) and Mean Square Error (MSE) values. Aim of this research is to forecast values using genetic approach. The calculated AFER value is compared with existing soft computing models which are evaluated over same data set.","PeriodicalId":294210,"journal":{"name":"2016 Ninth International Conference on Contemporary Computing (IC3)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128950369","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
A bark recognition algorithm for plant classification using a least square support vector machine 基于最小二乘支持向量机的树皮识别算法
2016 Ninth International Conference on Contemporary Computing (IC3) Pub Date : 2016-08-01 DOI: 10.1109/IC3.2016.7880233
Luis J. Blaanco, C. Travieso-González, José M. Quinteiro, P. V. Hernández, M. Dutta, Anushikha Singh
{"title":"A bark recognition algorithm for plant classification using a least square support vector machine","authors":"Luis J. Blaanco, C. Travieso-González, José M. Quinteiro, P. V. Hernández, M. Dutta, Anushikha Singh","doi":"10.1109/IC3.2016.7880233","DOIUrl":"https://doi.org/10.1109/IC3.2016.7880233","url":null,"abstract":"In this paper, a bark recognition algorithm for plant classification is presented. A Least-Square Support Vector Machine (LSSVM) with image and data processing techniques is used to implement a general purpose automated classifier. Using a data base of 40 sections of photographs taken of each of the 23 species, we applied an algorithm to homogenize the illumination of the images. After applying it, we obtained a 256-elements array from the Local Binary Pattern (LBP) histogram. Each element of the array was introduced in the LSSVM for classification. The success rate of the resultant recognizer is 82.38%.","PeriodicalId":294210,"journal":{"name":"2016 Ninth International Conference on Contemporary Computing (IC3)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130708842","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
JIIT-edu: An android application for college faculty JIIT-edu:大学教师的安卓应用程序
2016 Ninth International Conference on Contemporary Computing (IC3) Pub Date : 2016-08-01 DOI: 10.1109/IC3.2016.7880266
Upanya Singh, Nandini Srivastava, Adarsh Kumar
{"title":"JIIT-edu: An android application for college faculty","authors":"Upanya Singh, Nandini Srivastava, Adarsh Kumar","doi":"10.1109/IC3.2016.7880266","DOIUrl":"https://doi.org/10.1109/IC3.2016.7880266","url":null,"abstract":"In the age of scientific development, people are becoming more and more dependent on mobile phones. The proposed mobile application is designed to reduce the manual work and ease out teaching and learning in academics. This method has been proposed in view of needs of both the faculty as well as the students of any college. Firstly, this application automatically mark the student attendance, stores in the mobile database and authentic official from college can view the attendance whenever required. Secondly, a posting portal system eases the availability of study material and faculty. Further, it is observed in the experimental study that the proposed mobile application significantly reduces proxies and time of marking the attendance compared to state-of-art methods.","PeriodicalId":294210,"journal":{"name":"2016 Ninth International Conference on Contemporary Computing (IC3)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114222735","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
Using dependency graphs to support collaboration over GitHub: The Neo4j graph database approach 使用依赖图来支持GitHub上的协作:Neo4j图数据库方法
2016 Ninth International Conference on Contemporary Computing (IC3) Pub Date : 2016-08-01 DOI: 10.1109/IC3.2016.7880234
R. Arora, S. Goel, R. Mittal
{"title":"Using dependency graphs to support collaboration over GitHub: The Neo4j graph database approach","authors":"R. Arora, S. Goel, R. Mittal","doi":"10.1109/IC3.2016.7880234","DOIUrl":"https://doi.org/10.1109/IC3.2016.7880234","url":null,"abstract":"Software Configuration Management Systems capture direct conflicts which arise due to concurrent editing of same shared artifact. However, indirect conflicts, arising due to concurrent editing of related artifacts by collaborative developers, might eventually evade the build process employed by the underlying SCM. Additional collaborative software development tools have been developed, that supplement existing SCM systems, by providing change awareness information about potential indirect conflicts. In this paper, we propose the tool named Collaboration Over GitHub (COG), that provides support for collaborative software development over GitHub and also captures indirect conflicts at finer levels of granularity. For this, COG converts project repositories into dependency graphs which are stored as Neo4j Graph Databases. These graphs store structural and dependency information obtained from codebases and are used for identifying conflicts and affected artifacts.","PeriodicalId":294210,"journal":{"name":"2016 Ninth International Conference on Contemporary Computing (IC3)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115981371","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
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学术文献互助群
群 号:481959085
Book学术官方微信