发布求助
文献互助 智能选刊 最新文献

2018 Second International Conference on Computing Methodologies and Communication (ICCMC)最新文献

筛选
英文 中文
Arduino Based Home Automation Control Powered by Photovoltaic Cells 基于Arduino的光伏电池供电家庭自动化控制
2018 Second International Conference on Computing Methodologies and Communication (ICCMC) Pub Date : 2018-02-01 DOI: 10.1109/ICCMC.2018.8488144
Apurva Singh, Harshil Mehta, Anuj Nawal, O. V. Gnana Swathika
{"title":"Arduino Based Home Automation Control Powered by Photovoltaic Cells","authors":"Apurva Singh, Harshil Mehta, Anuj Nawal, O. V. Gnana Swathika","doi":"10.1109/ICCMC.2018.8488144","DOIUrl":"https://doi.org/10.1109/ICCMC.2018.8488144","url":null,"abstract":"Home Automation is one of the most sought after area of development in the electronics sector. It has the advantage of no interaction of humans with the devices, and it usually requires another power source to power itself. In standard scenarios, a DC battery is used to power the microcontroller which is used for automation. With constant inclusion of smart energy systems to automate home appliances, this paper proposes a home automation system which is capable of powering the circuits on its own by means of photovoltaic cells and energizing the required set of loads wirelessly. Contrary to conventional methods, the proposed system employs a cascaded photovoltaic cell to energize an Arduino board which aids in automating the system. The Arduino upon wireless input feeds the relays which would activate or deactivate the required load. A hardware prototype of the proposed system is realized and validated successfully.","PeriodicalId":6604,"journal":{"name":"2018 Second International Conference on Computing Methodologies and Communication (ICCMC)","volume":"29 1","pages":"729-732"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79867489","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
AN EFFICIENT APPROACH OF IMAGE RESTORATION USING MEAN INTENSITY CORRELATION OF NEIGHBORING PIXELS 一种利用相邻像素的平均强度相关进行图像恢复的有效方法
2018 Second International Conference on Computing Methodologies and Communication (ICCMC) Pub Date : 2018-02-01 DOI: 10.1109/ICCMC.2018.8487889
Nazia Hossain, Nazifa Anis, Amdadul Haque, N. Chauhan
{"title":"AN EFFICIENT APPROACH OF IMAGE RESTORATION USING MEAN INTENSITY CORRELATION OF NEIGHBORING PIXELS","authors":"Nazia Hossain, Nazifa Anis, Amdadul Haque, N. Chauhan","doi":"10.1109/ICCMC.2018.8487889","DOIUrl":"https://doi.org/10.1109/ICCMC.2018.8487889","url":null,"abstract":"Digital images are susceptible to the various types of noise. Noise in the image generally gets added due to the errors in the image acquisition process. These errors result in change in the intensity value of the pixel from the actual scene. Besides, this there are many other ways by which the noise can be introduced to an image. If an image is directly scanned from a photograph, then the grain noise is added into the image. Sometimes, noise gets added due to damage in the film. Motion of image capturing device introduces motion noise into an image. Moreover, electronic transmission of image data over a network can also introduce the noise to the image. There is various type of denoising methods available in the field of image restoration. However, most of these methods are computationally expensive and extensively complex to understand. Therefore, we have devised a very simple and efficient approach of image restoration using mean intensity correlation of neighboring pixel. Under this experiment, successful efforts have been made to restore a corrupted image with 85 percent reduction in the level of noise from the corrupt image.","PeriodicalId":6604,"journal":{"name":"2018 Second International Conference on Computing Methodologies and Communication (ICCMC)","volume":"8 1","pages":"225-230"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82572337","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
Security in Cache Memory: Review 高速缓存中的安全性:回顾
2018 Second International Conference on Computing Methodologies and Communication (ICCMC) Pub Date : 2018-02-01 DOI: 10.1109/ICCMC.2018.8487674
Nishtha, Meenu
{"title":"Security in Cache Memory: Review","authors":"Nishtha, Meenu","doi":"10.1109/ICCMC.2018.8487674","DOIUrl":"https://doi.org/10.1109/ICCMC.2018.8487674","url":null,"abstract":"Security of cache memory is of concern in applications related to memory software. The purpose of our paper is to examine number of attacks relating to cache memory and suggest precautions towards such threats and guarantee memory cache security. Analysis: Data stored in cached memory could be easily retrieved. This has concern of being accessed by the unauthorized users. Output shows that side channel, duration and ability based attacks are major challenge in cached security. Findings: discussing of about arrangements included in the secured cryptographic based calculation so outlined, secure mindful store low power and mapping reserve configuration by utilizing procedures, for example, XOR operations settled, code convertors, broadened Hamming codes and multi-bit bunched ECC. Application or Enhancement: enhancing and confirming security of cache memory will bring about various applications including brilliant applications with mystery of information with extraordinary significance.","PeriodicalId":6604,"journal":{"name":"2018 Second International Conference on Computing Methodologies and Communication (ICCMC)","volume":"71 1","pages":"659-662"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89521959","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
Encountering SQL Injection in Web Applications 在Web应用中遇到SQL注入
2018 Second International Conference on Computing Methodologies and Communication (ICCMC) Pub Date : 2018-02-01 DOI: 10.1109/ICCMC.2018.8487999
Padma N Joshi, N. Ravishankar, M. B. Raju, N. Ravi
{"title":"Encountering SQL Injection in Web Applications","authors":"Padma N Joshi, N. Ravishankar, M. B. Raju, N. Ravi","doi":"10.1109/ICCMC.2018.8487999","DOIUrl":"https://doi.org/10.1109/ICCMC.2018.8487999","url":null,"abstract":"Web has seen an exponential increase in number of applications over past decade. Current day web applications provide a lot more services than simple content delivery. web-based model of computing has been subject several attacks such as cross-site scripting & SQL injection. SQL Injection Attacks are comparatively recent threat to privacy, integrity & accessibility of all online requests & their technical infrastructure, secretarial for practically fourth of internet vulnerabilities. This research paper has represented types of attacks & classification of SQL injection attack. Next survey based on research done represented in tabular form. After that discussed about pattern locked proposed model & conclusion then future scope, suggested way for researchers for preventing SQL injection attacks.","PeriodicalId":6604,"journal":{"name":"2018 Second International Conference on Computing Methodologies and Communication (ICCMC)","volume":"44 1","pages":"257-261"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76226942","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
Capacity Comparison of SISO, SIMO, MISO & MIMO Systems SISO、SIMO、MISO和MIMO系统的容量比较
2018 Second International Conference on Computing Methodologies and Communication (ICCMC) Pub Date : 2018-02-01 DOI: 10.1109/ICCMC.2018.8488147
A. Sarangi, A. Datta
{"title":"Capacity Comparison of SISO, SIMO, MISO & MIMO Systems","authors":"A. Sarangi, A. Datta","doi":"10.1109/ICCMC.2018.8488147","DOIUrl":"https://doi.org/10.1109/ICCMC.2018.8488147","url":null,"abstract":"Everyone in the world always wants to use a better wireless network which provide high capacity and high data rates. High data rates and capacity can be produce by Multiple Input Multiple Output(MIMO) systems. This paper mainly focused on MIMO systems because the MIMO systems have multiple number of antennas in transmitting and receiving end which can produce more data rates and capacity compared to SISO, SIMO, MISO systems. The multiple antennas allow MIMO systems to produce multiplexing gain and diversity gain. The capacity of MIMO systems will be increased by increased the number of antennas in transmitter and receiver end.","PeriodicalId":6604,"journal":{"name":"2018 Second International Conference on Computing Methodologies and Communication (ICCMC)","volume":"29 1","pages":"798-801"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73706684","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}
引用次数: 16
A Comparative Study of Breast Cancer Diagnosis Using Supervised Machine Learning Techniques 使用监督机器学习技术进行乳腺癌诊断的比较研究
2018 Second International Conference on Computing Methodologies and Communication (ICCMC) Pub Date : 2018-02-01 DOI: 10.1109/ICCMC.2018.8487537
Madhuri Gupta, B. Gupta
{"title":"A Comparative Study of Breast Cancer Diagnosis Using Supervised Machine Learning Techniques","authors":"Madhuri Gupta, B. Gupta","doi":"10.1109/ICCMC.2018.8487537","DOIUrl":"https://doi.org/10.1109/ICCMC.2018.8487537","url":null,"abstract":"Cancer is a class of diseases, which is driven by change in cells of the body and increase beyond normal growth and control. Breast cancer is one of the frequent types of cancer. Prognosis of breast cancer recurrence is highly required to raise the survival rate of patient suffering from breast cancer. With the advancement of technology and machine learning techniques, the cancer diagnosis and detection accuracy has improved. Machine learning (ML) techniques offer various probabilistic and statistical methods that allow intelligent systems to learn from reoccurring past experiences to detect and identify patterns from a dataset. The research work presented an overview of evolve the machine learning techniques in cancer disease by applying learning algorithms on breast cancer Wisconsin data –Linear regression, Random Forest, Multi-layer Perceptron and Decision Trees (DT). The result outcome shows that Multilayer perceptron performs better than other techniques.","PeriodicalId":6604,"journal":{"name":"2018 Second International Conference on Computing Methodologies and Communication (ICCMC)","volume":"274 1","pages":"997-1002"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73488228","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}
引用次数: 35
A Strategic Genetic Algorithm for Resource Allocation in LTE Uplink Netwoks LTE上行网络资源分配的策略遗传算法
2018 Second International Conference on Computing Methodologies and Communication (ICCMC) Pub Date : 2018-02-01 DOI: 10.1109/ICCMC.2018.8488024
Leeban Moses, S. Karthikeyan
{"title":"A Strategic Genetic Algorithm for Resource Allocation in LTE Uplink Netwoks","authors":"Leeban Moses, S. Karthikeyan","doi":"10.1109/ICCMC.2018.8488024","DOIUrl":"https://doi.org/10.1109/ICCMC.2018.8488024","url":null,"abstract":"Long-term evolution (LTE), also known as 4G, is a rapidly growing global technology that continuously offers unprecedented data rates with higher capacity and new levels of user experience. The scheduling algorithm in LTE plays a vital role in determining the effectiveness of the system in terms of bandwidth efficiency and providing quality of service support to the users. In this paper we discuss about the complex optimization problem in resource allocation LTE uplink. We propose a new strategic genetic algorithm based approach as a solution to solve the problem. The proposed algorithm is evaluated in NS-3 simulator with a video sequence. Various LTE uplink resource allocation algorithms found in literature are discussed and their performance are evaluated and compared with our proposed algorithm. The results show that our proposed algorithm outperforms the existing algorithms in various scenarios.","PeriodicalId":6604,"journal":{"name":"2018 Second International Conference on Computing Methodologies and Communication (ICCMC)","volume":"13 1","pages":"436-441"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82036190","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
Analysis of Heart Rate Variability in Biometric Identification 生物识别中心率变异性的分析
2018 Second International Conference on Computing Methodologies and Communication (ICCMC) Pub Date : 2018-02-01 DOI: 10.1109/ICCMC.2018.8487233
V. Jadhav, Nagsen S. Bansod, K. Kale
{"title":"Analysis of Heart Rate Variability in Biometric Identification","authors":"V. Jadhav, Nagsen S. Bansod, K. Kale","doi":"10.1109/ICCMC.2018.8487233","DOIUrl":"https://doi.org/10.1109/ICCMC.2018.8487233","url":null,"abstract":"Biometric recognition provides excellent security by identifying an individual based on the physiological and/or behavioral characteristics. This paper presents a systematic analysis for human identification from HRV data. The objective of this paper is to state usefulness of Heart Rate Variability in biometric identification also how ECG data can be used as identification trait in human recognition. HRV is the variant flow in the interval of time between the different two continuous heart beats. HRV is calculated by the variation in two heart beats. The electrocardiogram trace expresses cardiac features that are unique to an each individual which helps to identify/recognize the individual.","PeriodicalId":6604,"journal":{"name":"2018 Second International Conference on Computing Methodologies and Communication (ICCMC)","volume":"14 1","pages":"229-304"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86353160","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 comparative approach of PSO and ABC algorithm for optimal positioning and capacity sizing of DG and Shunt Capacitor in a Distribution network using DLF algorithm 基于DLF算法的配电网DG和并联电容器最优定位和容量大小的PSO和ABC算法比较研究
2018 Second International Conference on Computing Methodologies and Communication (ICCMC) Pub Date : 2018-02-01 DOI: 10.1109/ICCMC.2018.8487996
Ayan Kumar Tudu, Amrita Bhaumik
{"title":"A comparative approach of PSO and ABC algorithm for optimal positioning and capacity sizing of DG and Shunt Capacitor in a Distribution network using DLF algorithm","authors":"Ayan Kumar Tudu, Amrita Bhaumik","doi":"10.1109/ICCMC.2018.8487996","DOIUrl":"https://doi.org/10.1109/ICCMC.2018.8487996","url":null,"abstract":"Placement and size optimization of Distributed Generation (DG) and shunt capacitors in a radial distribution networkhelps in minimizing system power loss and maintain appropriate system voltage .Of the numerous optimization methods available in the literature Particle Swarm Optimization (PSO) and Artificial Bee Colony (ABC) algorithms are quite popular. An attempt has been made in this paper to compare the effectiveness of these two methods with the help of DLF algorithm to optimally place and size the DG and shunt capacitors in a radial distribution network. The required system data has been taken from the standard IEEE 69 bus radial distribution system. All computations were performed in MATLAB package.","PeriodicalId":6604,"journal":{"name":"2018 Second International Conference on Computing Methodologies and Communication (ICCMC)","volume":"32 1","pages":"276-280"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84257241","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
Resource Allocation and Scheduling Methods in Cloud- A Survey 云中的资源分配和调度方法- A调查
2018 Second International Conference on Computing Methodologies and Communication (ICCMC) Pub Date : 2018-02-01 DOI: 10.1109/ICCMC.2018.8487967
Aicy Ealiyas, S. P. Jeno Lovesum
{"title":"Resource Allocation and Scheduling Methods in Cloud- A Survey","authors":"Aicy Ealiyas, S. P. Jeno Lovesum","doi":"10.1109/ICCMC.2018.8487967","DOIUrl":"https://doi.org/10.1109/ICCMC.2018.8487967","url":null,"abstract":"Cloud computing is an information technology paradigm, which provide services and resources through on-demand services over the internet. As there are many applications deployed in the cloud by users, proper scheduling is needed as various resources are consumed. If the application is not scheduled properly, it will cause load imbalance in the cloud data centers. In this paper, there will be proper utilization of the resources and a survey is done on the various scheduling and allocation methods for applications in cloud.","PeriodicalId":6604,"journal":{"name":"2018 Second International Conference on Computing Methodologies and Communication (ICCMC)","volume":"32 1","pages":"601-604"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87259621","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
首页 上一页 下一页 尾页
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学术官方微信