2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)最新文献

筛选
英文 中文
An Economical and High-Quality Encryption Scheme for Cloud Servers with GPUs 一种经济、高质量的gpu云服务器加密方案
Xiongwei Fei, Kenli Li, Shui Yu, Kuan-Ching Li
{"title":"An Economical and High-Quality Encryption Scheme for Cloud Servers with GPUs","authors":"Xiongwei Fei, Kenli Li, Shui Yu, Kuan-Ching Li","doi":"10.1109/PDCAT46702.2019.00048","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00048","url":null,"abstract":"Motivated by cloud servers undertaking heavy encryption of outsourced data for diverse devices, an Economical and High-Quality Encryption Scheme is proposed to alleviate the burden of energy consumption of the servers meanwhile to keep high-quality services. The objective of the scheme is to minimize the cost that combines economy and service quality. For achieving this objective, a two-phase scoring mechanism is proposed. And then based on the above methods and the scoring mechanism, an algorithm achieving the scheme is designed. To evaluate the scheme, some experiments are performed on a heterogeneous platform. The experimental results show that the encryption algorithm can save energy consumption by 47.8% and slightly improve delay rate by 0.93/10000 on average compared with the original one.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133864389","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
Right Ventricle Segmentation of Cine MRI Using Residual U-net Convolutinal Networks 残差u网卷积网络在MRI右心室分割中的应用
Zexiong Liu, Yuhong Feng, Xuan S. Yang
{"title":"Right Ventricle Segmentation of Cine MRI Using Residual U-net Convolutinal Networks","authors":"Zexiong Liu, Yuhong Feng, Xuan S. Yang","doi":"10.1109/PDCAT46702.2019.00072","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00072","url":null,"abstract":"Right ventricle (RV) segmentation is difficult due to the variable shape and ill-defined borders of the RV. In this paper, we propose a method to segment RV using a residual U-net convolutional network. A U-net shaped network structure is employed in our method to extract RV features in the encoding layers and make end-to-end decisions in the decoding layers. In the encoding layers, several residual blocks are cascaded extract RV features. In the decoding layers, convolutional layers are employed to make the RV predication. Our network is light with less parameters compared with state-of-art networks. Experiments on public datasets demonstrate that our network outperforms most existed automated segmentation method in respect of several commonly used evaluation measures.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134026435","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
Hybrid Model Featuring CNN and LSTM Architecture for Human Activity Recognition on Smartphone Sensor Data 基于CNN和LSTM结构的智能手机传感器人体活动识别混合模型
S. Deep, Xi Zheng
{"title":"Hybrid Model Featuring CNN and LSTM Architecture for Human Activity Recognition on Smartphone Sensor Data","authors":"S. Deep, Xi Zheng","doi":"10.1109/PDCAT46702.2019.00055","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00055","url":null,"abstract":"The traditional methods of recognizing human activities involve typical machine learning (ML) algorithms which uses heuristic engineered features. Human activities are dynamic in nature and are encoded with a sequence of actions. ML methods are able to perform activity recognition tasks but may not exploit the temporal correlations of the input data. Therefore, in this paper, we proposed and showed the effectiveness of employing a new combination of deep learning (DL) methods for human activity recognition (HAR). DL methods are capable of extracting discriminative features automatically from the raw sensor data. Specifically, in this paper, we proposed a hybrid architecture which features a combination of Convolutional neural networks (CNN) and Long short-term Memory (LSTM) networks for HAR task. The model is tested on UCI HAR dataset which is a benchmark dataset and comprises of accelerometer and gyroscope data obtained from a smartphone. Our experimental results showed that our proposed method outperformed the recent results which used pure LSTM and bidirectional LSTM networks on the same dataset.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"237 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132702839","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}
引用次数: 22
A Map-Reduce-Based Relation Inference Algorithm for Autonomous System 基于映射约简的自治系统关系推理算法
Ting Lv, Donghong Qin, Lina Ge, Song Wen
{"title":"A Map-Reduce-Based Relation Inference Algorithm for Autonomous System","authors":"Ting Lv, Donghong Qin, Lina Ge, Song Wen","doi":"10.1109/PDCAT46702.2019.00091","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00091","url":null,"abstract":"The business relationships between Autonomous systems (ASs) are crucial to understanding the internet structure, performance, evolution, and so on. However, the business relationships between ASs are often confidential and can only be captured by inference algorithms. This paper proposes a new algorithm to infer the ASs relationship based on the transmission capacity. A new metric for ASs node transmission capability based on path behavior is defined. Meanwhile, a big data processing technique based on Map-Reduce to deduce the ASs relationship. Besides, to analyze the accuracy of the algorithm, we compare its accuracy performance with those of existing algorithms. Through simulation experimental, the proposed scheme achieves substantial performance improvements in term of consistency and effectiveness. Also, the complexity of the proposed scheme is found to be reasonably low.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131259585","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
Faithful Multi-Hop Qubit Transmission Based on GHZ States 基于GHZ态的忠实多跳量子比特传输
Na Chen, B. Yan, Shuangshuang Shuai, Changxing Pei
{"title":"Faithful Multi-Hop Qubit Transmission Based on GHZ States","authors":"Na Chen, B. Yan, Shuangshuang Shuai, Changxing Pei","doi":"10.1109/PDCAT46702.2019.00042","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00042","url":null,"abstract":"Quantum teleportation faithfully transfers quantum bits (qubits) between distant nodes, which enables global quantum communication network. In this paper, a scheme for faithful multi-hop qubit transmission is proposed employing parallel quantum measurements. In terms of communication delay, the proposed scheme transports a qubit in time almost the same as the one-hop quantum teleportation does regardless of the number of hops between the source and destination.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114851811","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
D2D-Assisted Computation Offloading for Mobile Edge Computing Systems with Energy Harvesting 基于能量收集的移动边缘计算系统的d2d辅助计算卸载
Molin Li, Tong Chen, Jiaxin Zeng, Xiaobo Zhou, Keqiu Li, Heng Qi
{"title":"D2D-Assisted Computation Offloading for Mobile Edge Computing Systems with Energy Harvesting","authors":"Molin Li, Tong Chen, Jiaxin Zeng, Xiaobo Zhou, Keqiu Li, Heng Qi","doi":"10.1109/PDCAT46702.2019.00028","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00028","url":null,"abstract":"In mobile edge computing (MEC) systems with energy harvesting, the mobile devices are empowered with the energy that harvested from renewable energy sources. On the other hand, mobile devices can offload their computation-intensive tasks to the MEC server to further save energy and reduce the task execution latency. However, the energy harvested is unstable and the mobile devices have to make sure that the energy should not be run out. Moreover, the wireless channel condition between the mobile device and the MEC server is dynamically changing, leading to unstable communication delay. Considering the energy constraints and unstable communication delay, the benefit of computation offloading is limited. In this paper, we investigate D2D-assisted computation offloading for mobile edge computing systems with energy harvesting. In our method, the mobile device is allowed to offload its tasks to the MEC server with the help of its neighbor node. More Specifically, the neighbor node acts as a relay to help the mobile device to communicate with the MEC server. Our goal is to minimize the average task execution time by selecting an optimal execution strategy for each task, i.e., whether to execute the task locally, or offload it to the MEC server directly, or offload it to the MEC server with the help of the most suitable neighbor node, or just to drop it. We propose a low-complexity online algorithm, which stem from Lyapunov Optimization-based Dynamic Computation Offloading (LODCO) algorithm, to solve this problem. Extensive simulations verified the effectiveness of the proposed algorithm, where the average task execution time is reduced around 50% as compared to that of the original LODCO algorithm.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132216490","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
Modeling Power Consumption of The Code Execution Using Performance Counters Statistics 使用性能计数器统计对代码执行的功耗进行建模
Guang Wei, D. Qian, Hailong Yang, Zhongzhi Luan
{"title":"Modeling Power Consumption of The Code Execution Using Performance Counters Statistics","authors":"Guang Wei, D. Qian, Hailong Yang, Zhongzhi Luan","doi":"10.1109/PDCAT46702.2019.00075","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00075","url":null,"abstract":"This paper presents an empirical model to classify the programs according to their power consumption by using the performance counter statistics. The programs with similar power consumption are put into the same group. The difference in power data between two adjacent groups is 5 watts. A power model is generated based on the performance data that the program generated. Discriminant analysis is adopted to generate the power consumption model upon the data from the performance counter statistics. We use discriminant analysis to determine the power category (i.e., the number of the group) that is derived from the independent variable. By using the performance counter variables as the input to the power model, we can predict the level of power consumption of the code, that is, the group that this code belongs to. The experiment results in modeling and validation show that this power model can predict power group membership of a code with an accuracy of more than 96.5%, with the difference of original and predicted group numbers being smaller than 2.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128438438","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
Imbalanced Data Classification Using Improved Clustering Algorithm and Under-Sampling Method 基于改进聚类算法和欠采样方法的不平衡数据分类
Lu Cao, Hong Shen
{"title":"Imbalanced Data Classification Using Improved Clustering Algorithm and Under-Sampling Method","authors":"Lu Cao, Hong Shen","doi":"10.1109/PDCAT46702.2019.00071","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00071","url":null,"abstract":"Imbalanced classification problem is a hot issue in data mining and machine learning. Traditional classification algorithms are proposed based on some form of symmetry hypothesis of class distribution, whose main purpose is to improve the overall classification performance. It is difficult to obtain ideal classification result when handling imbalanced datasets. In order to improve the classification performance of imbalanced datasets, this paper proposes a cluster-based under-sampling algorithm (CUS) according to the important characteristic of support vector machines (SVM) classification relying on support vector. Firstly, majority class is divided into different clusters using improved clustering by fast search and find of density peaks (CFSFDP) algorithm. The improved clustering algorithm can realize automatic selection of clustering centers, which overcomes the limitation of the original algorithm. Then the minority class and each cluster of the majority class are used to construct training set to get the support vector of each cluster by support vector machine. Retaining support vectors for each cluster and deleting non-support vectors are to construct a new majority class sample points to obtain relatively balanced datasets. Finally, the new datasets are classified by support vector machines and the performance is evaluated by cross validation sets. The experimental results show that CUS algorithm is effective.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126121333","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}
引用次数: 9
A CloudSim-Extension for Simulating Distributed Functions-as-a-Service 模拟分布式功能即服务的cloudsim扩展
H. Jeon, Chunglae Cho, Seungjae Shin, Seunghyun Yoon
{"title":"A CloudSim-Extension for Simulating Distributed Functions-as-a-Service","authors":"H. Jeon, Chunglae Cho, Seungjae Shin, Seunghyun Yoon","doi":"10.1109/PDCAT46702.2019.00076","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00076","url":null,"abstract":"The performance of Functions-as-a-Service (FaaS) would be significantly improved by organizing cloud servers into a hierarchical distributed architecture, resulting in low-latency access and faster response when compared to centralized cloud. However, the distributed organization introduces a new type of decision making problem for placing and executing functions to a specific cloud server. In order to handle the problem, we extended a well-known cloud computing simulator, CloudSim. The extended CloudSim enables users to define FaaS functions with various characteristics and service level objectives (SLOs), place them across geo-distributed cloud servers, and evaluate per-function performance. Proof-of-Concept (PoC) evaluation results show the potential of our CloudSim extension in terms of execution efficiency and simulation reality.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125487876","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
A Model Driven-Based Approach for Managing Unanticipated Runtime Adaptation of RTE Systems 基于模型驱动的RTE系统非预期运行时适应性管理方法
Nissaf Fredj, Y. H. Kacem, M. Abid
{"title":"A Model Driven-Based Approach for Managing Unanticipated Runtime Adaptation of RTE Systems","authors":"Nissaf Fredj, Y. H. Kacem, M. Abid","doi":"10.1109/PDCAT46702.2019.00064","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00064","url":null,"abstract":"Nowadays, Real-Time Embedded Systems (RTES) and particularly adaptive ones are gaining more use in several domains. They must be always consistent and available to preserve their usefulness and feasibility, as a response to environmental conditions, resources limitations and user requirements. For this reason, they are subject to anticipated and unanticipated runtime reconfigurations. The design of such systems requires an abstract representation of the execution context independently from low-level details, with lower complexity. In this context, designers adopt runtime models which need to be checked and validated at early stages of development. Besides, these models must be updated according to unpredictable execution changes. In the present paper, we propose an MDE-based approach that allows managing runtime adaptive RTES. Our proposal starts by specifying the behavior and structure of runtime adaptive systems. Then Model-to-Text (M2T) transformations allows us to generate configuration files to simulate adaptive systems behavior and evaluate their real-time constraints. An additional feature offered by our approach consists to monitor the execution context and update runtime models according to unanticipated reconfigurations.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124584686","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学术文献互助群
群 号:481959085
Book学术官方微信