2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)最新文献

筛选
英文 中文
Cost Effective Algorithms for Participant Selection Problem in Mobile Crowd Sensing Environment 移动人群感知环境下参与者选择问题的成本有效算法
Sanjoy Mondal, Saurav Ghosh, Sunirmal Khatua, R. Das, U. Biswas
{"title":"Cost Effective Algorithms for Participant Selection Problem in Mobile Crowd Sensing Environment","authors":"Sanjoy Mondal, Saurav Ghosh, Sunirmal Khatua, R. Das, U. Biswas","doi":"10.1109/PDGC.2018.8745988","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745988","url":null,"abstract":"Recent developments in the areas of smart phones and wearable devices have paved the way to many emerging applications in Mobile Crowd Sensing (MCS) domain. There has been a phenomenal increase in the number of people using these devices. In this work we consider an MCS application to cover a set of points of interest (targets) with the objective of selecting a minimum set of participants among the mobile devices. This problem, coined as Participant Selection Problem (PSP) to provide desired coverage can be solved optimally using an Integer Linear Programming (ILP). But for large problem size, solving the ILP becomes impractical from the point of execution time as well as the requirement of having the necessary information about all the participants in one place. In this paper, we have proposed a distributed participants selection algorithm (DPSA) to be run at each participants where, the participants after exchanging messages with its neighbors, decides to remain active or idle. We have shown that, those participants which selects themselves as active suffice to cover all the desired targets. We have run a series of experiments to measure the performance of the proposed algorithm where we measure along with number of participants selected also the total energy consumption. Simulation results reveals the close proximity of DPSA compared to the optimal one providing the same coverage.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125425035","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 proficient proof of identity of duplicate and near-duplicate images and image distances using high-disguisable image fragment 使用高伪装图像片段熟练证明重复和接近重复图像和图像距离的框架
V. Narayana, Sreevani Gaddameedhi, V. K. Koppula, K. S. Raju
{"title":"Framework for proficient proof of identity of duplicate and near-duplicate images and image distances using high-disguisable image fragment","authors":"V. Narayana, Sreevani Gaddameedhi, V. K. Koppula, K. S. Raju","doi":"10.1109/PDGC.2018.8745792","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745792","url":null,"abstract":"A framework for discovery of duplicate or near-duplicate images or image spam's within an image group by using high-disguisable image fragments. Idiosyncratic topographies of the images or image distances are recognized. Each duo of images or image spans with at least one idiosyncratic topography in common, the idiosyncratic topographies of each image or image span is linked to regulate whether the duo is duplicates or near-duplicates.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126393385","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
Stage-wise Development of a Remote Controlled Robotic Arm 遥控机械臂的阶段性发展
Shivam Sharma, Shashwat Sahai, Jaisal Joshi, N. Hema
{"title":"Stage-wise Development of a Remote Controlled Robotic Arm","authors":"Shivam Sharma, Shashwat Sahai, Jaisal Joshi, N. Hema","doi":"10.1109/PDGC.2018.8745871","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745871","url":null,"abstract":"This paper represents the stage-wise development of trainable remotely controlled robotic arm based on servo motors. The robot is expected to perform primary pick and place operations and repeat the recorded actions with error corrections. The arm has four degrees of freedom. The robotic arm is mounted on a base that allows it to traverse between different coordinates. Arduino Mega 2560 is used for controlling functionalities of the robot. The robot was developed in four stages. In the first stage, the robot was controlled with the help of potentiometer. In the second stage of development, remote functionality was added. This functionality was achieved using Bluetooth module. The third stage of development included usage of the real-time remote control over the internet. The robot was controlled using an android application for the stages mentioned above. In the fourth stage, a Unity-3D model was integrated to realize the real-time visual simulation of the robot.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128727169","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
An Aggregated Similarity Based Hierarchical Clustering Technique for Relational DDBS Design 关系型DDBS设计中基于聚合相似度的分层聚类技术
A. Amer, M. Mohamed, A. Sewisy, Khaled Al Asri
{"title":"An Aggregated Similarity Based Hierarchical Clustering Technique for Relational DDBS Design","authors":"A. Amer, M. Mohamed, A. Sewisy, Khaled Al Asri","doi":"10.1109/PDGC.2018.8745981","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745981","url":null,"abstract":"In this work, as part of our continuous effort, an optimized heuristic technique is proposed. The basic aim of this technique to fragment data vertically in Distributed Database System (DDBS). Drive by the queries along with using hierarchical clustering algorithm, the proposed technique seeks to propose an aggregated similarity measure to properly perform the clustering-based vertical data fragmentation. Data replication and allocation are also investigated to produce a comprehensive solution. As a matter of fact, the key concern is to find an effective best-fitting solution for improving DDBS throughput through developing an aggregated similarity based data fragmentation process, drawing a site clustering algorithm, and presenting a greedy-based transmission costs-reducing data allocation algorithm. Moreover, data replication is carefully considered in such a way that cost is to be essentially minimized.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"22 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120929211","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
Performance Evaluation of Classification Algorithm in Weka using Parallel Performance Profiling and Computing Technique 基于并行性能分析和计算技术的Weka分类算法性能评价
N. Upadhyay, Ravi Shankar Singh
{"title":"Performance Evaluation of Classification Algorithm in Weka using Parallel Performance Profiling and Computing Technique","authors":"N. Upadhyay, Ravi Shankar Singh","doi":"10.1109/PDGC.2018.8745940","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745940","url":null,"abstract":"At present, the size of the data is growing rapidly. In such a situation, it is necessary to keep an eye on the speed of the data without undermining it. It is also important to note that while processing the data, its quality remains intact. This is the reason that data mining technology has become very important in the field of predictions in the scientific mining area, commercial and environment sectors. In this case, the need for parallel processing becomes important. Therefore, the aim of this paper is to analyze and perform computation times of different classification algorithms on many datasets using parallel profiling and computing techniques. Performance analysis is based on many factors, such as the unique nature of the dataset, the size, and type of the class, the diversity of the data in the data set, and so on. Many researchers are working on the optimization of classification algorithms which are not showing accurate results according to the processor (core) capacity. So, in this paper, we have displayed some simulation results which discuss the processor's size, efficiency, and workload as well as the complexity of input instructions in the group; Which will help researchers to optimize the code for maximum use of the core. At the end of the paper, we have given a comparative study of the optimized algorithm based on a parallel approach and tuned algorithm based on parallel performance.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126358303","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
Probabilistic Neural Network Approach for Classifying Ventricular Tachyarrhythmias 分类室性心动过速的概率神经网络方法
Shipra Saraswat, Prasiddhi Shahi
{"title":"Probabilistic Neural Network Approach for Classifying Ventricular Tachyarrhythmias","authors":"Shipra Saraswat, Prasiddhi Shahi","doi":"10.1109/PDGC.2018.8745882","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745882","url":null,"abstract":"Accurate observation of cardiac dysrhythmias are extremely important for clinical applications. Arrhythmias are one of the leading causes of cardiovascular mortality, direct evidences of clinical records has been lacking. Authors of this paper presents a unified approach for classifying ventricular tachyarrhythmias. The methodology adopted by the authors of this work are discrete wavelet transform (DWT) for extracting the features from ECG signals, cross recurrence quantification analysis (CRQA) for calculating the recurrent rate values using the cross recurrence plot (CRP) toolbox of Matlab and probabilistic neural network (PNN) concept for classification of ECG signals.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"412 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124407138","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
Analysis of cardiovascular diseases using artificial neural network 应用人工神经网络分析心血管疾病
Jyotismita Talukdar, B. Dewangan
{"title":"Analysis of cardiovascular diseases using artificial neural network","authors":"Jyotismita Talukdar, B. Dewangan","doi":"10.1109/PDGC.2018.8745900","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745900","url":null,"abstract":"In this paper, a study has been made on the possibility and accuracy of early prediction of several Heart Disease using Artificial Neural Network. (ANN). The study has been made in both noise free and noisy environment. The data collected for this analysis are from five Hospitals. Around 1500 heart patient's data has been collected and studied. The data is analysed and the results have been compared with the Doctor's diagnosis. It is found that, in noise free environment, the accuracy varies from 74% to 92%.and in noisy environment (2dB), the results of accuracy varies from 62% to 82%. In the present study, four basic attributes considered are Blood Pressure (BP), Fasting Blood Sugar (FBS), Thalach (THAL) and Cholesterol (CHOL.). sIt has been found that highest accuracy(93%), has been achieved in case of PPI(Post-Permanent-Pacemaker Implementation), around 79% in case of CAD(Coronary Artery disease), 87% in DCM(Dilated Cardiomyopathy), 89% in case of RHD&MS(Rheumatic heart disease with Mitral Stenosis), 75% in case of RBBB +LAFB (Right Bundle Branch Block + Left Anterior Fascicular Block), 72% for CHB(Complete Heart Block) etc. The lowest accuracy has been obtained in case of ICMP(Ischemic Cardiomyopathy), about 38% and AF(Atrial Fibrillation), about 60 to 62%.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133566303","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
Diagnosis of Breast Cancer and Diabetes using Hybrid Feature Selection Method 应用混合特征选择方法诊断乳腺癌和糖尿病
Divya Jain, V. Singh
{"title":"Diagnosis of Breast Cancer and Diabetes using Hybrid Feature Selection Method","authors":"Divya Jain, V. Singh","doi":"10.1109/PDGC.2018.8745830","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745830","url":null,"abstract":"Diagnosis of diseases at an early stage is a crucial task in the medical field. A hybrid machine learning framework is presented for the diagnosis of breast cancer and diabetes using efficient feature selection and classification technique. This research identifies significant risk factors related to both chronic disease datasets by applying different feature selection techniques and hybridization of ReliefF Feature Ranking with Principal Component Analysis (PCA) method. To evaluate the effectiveness of the presented feature selection method, k-nearest neighbor method for classification is used. The hybridization enhances the accuracy of the classifier with the proposed feature selection technique for both chronic disease datasets. The performance of the presented hybrid framework is found to be best in comparison to five other techniques - Correlation Based feature Selection (CBS), Fast Correlation Based Feature Selection (FCBF), Mutual Information Based Feature Selection (MIFS), MODTree Filtering Approach and ReliefF Feature Selection. Moreover, the proposed ReliefF-PCA method eliminates 25% and 33.3% of irrelevant features for diabetes and breast cancer dataset respectively.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128404002","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}
引用次数: 15
Classification of Indian Herbal Plants based on powder microscopic images using Transfer Learning 基于粉末显微图像的印度草本植物的迁移学习分类
Rohan Marwaha, B. Fataniya
{"title":"Classification of Indian Herbal Plants based on powder microscopic images using Transfer Learning","authors":"Rohan Marwaha, B. Fataniya","doi":"10.1109/PDGC.2018.8745922","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745922","url":null,"abstract":"The objective of this paper is to proficiently classify the microscopic images of powder of Indian Herbal plants. Since they hold great importance in medicine industry and their identification is only done by experts for the powdered form, we have eluded the need for an expert by automating the process, yielding decent results. Although, attempts have been made to perform this task but the methodologies used do not provide the results with high accuracy. Inspired from the state-of-the-art deep learning techniques we have performed the classification by fine-tuning 4 pre-trained models provided by the Keras library which have provided with great results on ImageNet dataset. Out of the 4 models used, VGG16 provides the highest accuracy, Precision, Recall and F1 score but is the slowest to train. MobileNet is fastest but is mediocre in other parameters while Xception is 2nd fastest but with lowest accuracy and InceptionV3 with mediocre results.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114062954","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
Emotion Model for Artificial Intelligence and their Applications 面向人工智能的情感模型及其应用
Advait Gopal Ranade, Maitri Patel, Archana Magare
{"title":"Emotion Model for Artificial Intelligence and their Applications","authors":"Advait Gopal Ranade, Maitri Patel, Archana Magare","doi":"10.1109/PDGC.2018.8745840","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745840","url":null,"abstract":"Humans interact with AI systems, to get better results AI systems should have emotional intelligence for refined decision making. Emotional AI has many real life applications. This paper presents decision-making based on emotion model using a computational approach and how it's going to be implemented on an AI chatbot called Cakechat. This paper also demonstrates how AI system who can understand human emotions can be beneficial for the society.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122631252","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
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学术官方微信