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

A Gird-Based Joint Routing and Energy Replenish Scheme for Rechargeable Wireless Sensor Networks 一种基于网格的可充电无线传感器网络联合路由和能量补充方案

2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT) Pub Date : 2019-12-01 DOI: 10.1109/PDCAT46702.2019.00097

Zhansheng Chen, Hong Shen

引用次数: 1

Privacy Preservation for Network Traffic Classification 网络流分类中的隐私保护

2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT) Pub Date : 2019-12-01 DOI: 10.1109/PDCAT46702.2019.00027

Yue Lu, Hui Tian, Jingjing Yu

引用次数: 0

Parallel Tracking and Reconstruction of States in Heuristic Optimization Systems on GPUs 基于gpu的启发式优化系统状态并行跟踪与重构

2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT) Pub Date : 2019-12-01 DOI: 10.1109/PDCAT46702.2019.00016

M. Köster, J. Groß, A. Krüger

{"title":"Parallel Tracking and Reconstruction of States in Heuristic Optimization Systems on GPUs","authors":"M. Köster, J. Groß, A. Krüger","doi":"10.1109/PDCAT46702.2019.00016","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00016","url":null,"abstract":"Modern heuristic optimization systems leverage the parallel processing power of Graphics Processing Units (GPUs). Many states are maintained and evaluated in parallel to improve runtime by orders of magnitudes in comparison to purely CPUbased approaches. A well known example is the parallel Monte Carlo tree search, which is often used in combination with more advanced machine-learning methods these days. However, all approaches require different optimization states in memory to update or manipulate variables and observe their behavior over time. Large real-world problems often require a large number of states that are typically limited by the amount of available memory. This is particularly challenging in cases in which older states (that are not currently being evaluated) are still required for backtracking purposes. In this paper, we propose a new general high-level approach to track and reconstruct states in the scope of heuristic optimization systems on GPUs. Our method has a considerably lower memory consumption compared to traditional approaches and scales well with the complexity of the optimization problem.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"45 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":"127270307","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

Acceleration of Genetic Algorithm on GPU CUDA Platform 遗传算法在GPU CUDA平台上的加速

2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT) Pub Date : 2019-12-01 DOI: 10.1109/PDCAT46702.2019.00047

D. Janssen, Alan Wee-Chung Liew

引用次数: 2

A Virtual Machine Placement Algorithm Combining NSGA-II and Bin-Packing Heuristic 一种结合NSGA-II和装箱启发式的虚拟机布局算法

2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT) Pub Date : 2019-12-01 DOI: 10.1109/PDCAT46702.2019.00044

Wenting Wei, Kun Wang, Kexin Wang, Shengjun Guo, Huaxi Gu

引用次数: 2

Outlier Removal for the Reliable Condition Monitoring of Telecommunication Services 电信业务可靠状态监测的离群值去除

2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT) Pub Date : 2019-12-01 DOI: 10.1109/PDCAT46702.2019.00052

Günter Fahrnberger

{"title":"Outlier Removal for the Reliable Condition Monitoring of Telecommunication Services","authors":"Günter Fahrnberger","doi":"10.1109/PDCAT46702.2019.00052","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00052","url":null,"abstract":"Customer contentment plays an essential (if not the most important) role for the continuation and development of business relations. In this context, the functioning of goods and services acts as the crucial influencing factor. In the case of services, their providers willingly deploy CMSs (Condition Monitoring Systems) for the continuous CM (Condition Monitoring) of the service availability by means of various KPIs (Key Performance Indicators). A CMS must red-flag an abnormal condition. This happens if the recent value(s) of a KPI exceed(s) a predetermined threshold for a certain period. The pertinent literature contains a multiplicity of ways for automatic threshold computation, including a particular one for telecommunication services with time-varying load characteristic. Regrettably, the latter lacks in (distribution-independent) outlier extinction. Thus, this scholarly piece bridges this gap by applying an outlier detection algorithm based upon Walsh's nonparametric tests to a KPI history, removing the identified outliers, and comparing Pukelsheim's three sigma rule and the minimum or maximum value of the outlier-free array for threshold evaluation. The result of a corresponding field test assesses the reliability of the suggested methodology.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"14 5 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":"129264693","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 Data Transmission in Mobile Ad-hoc Networks for Characterizing Black-Hole Attacks 基于黑洞攻击特征的移动自组网数据传输建模

2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT) Pub Date : 2019-12-01 DOI: 10.1109/PDCAT46702.2019.00026

Mnar Saeed Alnaghes, Hong Shen

引用次数: 0

Machine Learning Based Performance Analysis and Prediction of Jobs on a HPC Cluster 基于机器学习的高性能计算集群作业性能分析与预测

2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT) Pub Date : 2019-12-01 DOI: 10.1109/PDCAT46702.2019.00053

Zhengxiong Hou, Shuxin Zhao, Chao Yin, Yunlan Wang, Jianhua Gu, Xingshe Zhou

引用次数: 5

Efficient Fault-Tolerant Syndrome Measurement of Quantum Error-Correcting Codes Based on "Flag" 基于“Flag”的量子纠错码高效容错综合征测量

2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT) Pub Date : 2019-12-01 DOI: 10.1109/PDCAT46702.2019.00041

QiFei Wei, Dongxiao Quan, Jing Liu, Changxing Pei

{"title":"Efficient Fault-Tolerant Syndrome Measurement of Quantum Error-Correcting Codes Based on \"Flag\"","authors":"QiFei Wei, Dongxiao Quan, Jing Liu, Changxing Pei","doi":"10.1109/PDCAT46702.2019.00041","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00041","url":null,"abstract":"Fault-tolerant syndrome measurement plays an important role in the process of quantum error correction, and considerable effort had been taken for reducing the physical overhead of syndrome measurement which including the ancilla qubits, the CNOT gates and the time-slots. The two extra qubits syndrome measurement technique, known as \"flag\"-style syndrome measurement, cuts down the number of extra qubits to the utmost. However, it works slowly because it measures only one syndrome at a time. We extend the technique to extract all syndromes of the distance-3 quantum error-correcting code at once. We propose a new method that increases the parallelism of the syndrome measurement circuit and reduces the time overhead by allocating and adjusting the order of CNOT gates for measuring data block reasonably, which we call dynamic time-slot allocation scheme, and which is applicable to both Hamming codes and color codes. For a CSS quantum error-correcting code with the number of stabilizers m and the maximum weight w, we only need 2m extra qubits and 2 × (w+2) time-slots for one-shot measurement of all syndromes.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"7 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":"114423051","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

Plaintext Recovery Attacks and Their Mitigation in an Application-Specific SHE Scheme 特定应用SHE方案中的明文恢复攻击及其缓解

2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT) Pub Date : 2019-12-01 DOI: 10.1109/PDCAT46702.2019.00024

Tikaram Sanyashi, Anasuya Acharya, B. Menezes

{"title":"Plaintext Recovery Attacks and Their Mitigation in an Application-Specific SHE Scheme","authors":"Tikaram Sanyashi, Anasuya Acharya, B. Menezes","doi":"10.1109/PDCAT46702.2019.00024","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00024","url":null,"abstract":"In addition to storage and computing power, cloud providers ensure confidentiality of user data through the use of various encryption technologies. The need to decrypt the data before it can be operated upon exposes a possible security hole which could be exploited by untrustworthy system administrators. Homomorphic encryption allows operations on encrypted data without the need to first decrypt it making it attractive for cloud computing. However, it incurs significant overhead of storage and computation and is therefore infeasible in practice. Somewhat homomorphic schemes have been proposed to handle specific applications - one such scheme, the Zhou Wornell Scheme, operates on vectors of integers. We demonstrate that this scheme is vulnerable to plaintext recovery attacks for a range of vector sizes. We explore the trade-offs between plaintext vector length, public key size and security. Increasing vector length increases security but at the cost of greatly increased public key size. We suggest a way of reducing the size of the public key by up to 90%. Finally, we propose a variant of this scheme which is secure against plaintext recovery attacks.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"33 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":"123612219","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