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

Implementing the Matrix Multiplication with DFC on Kunlun Small Scale Computer 用DFC在昆仑小型计算机上实现矩阵乘法

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

Zheng Du, Jing Zhang, Shihao Sha, Qiuming Luo

引用次数: 0

Blockchain Consensus Algorithm Design Based on Consistent Hash Algorithm 基于一致性哈希算法的区块链共识算法设计

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

Jian Yang, Hong Shen

{"title":"Blockchain Consensus Algorithm Design Based on Consistent Hash Algorithm","authors":"Jian Yang, Hong Shen","doi":"10.1109/PDCAT46702.2019.00090","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00090","url":null,"abstract":"Blockchain, the concept from Bitcoin created by Satoshi Nakamoto, has the potential to decentralise traditionally centralised systems. Blockchain is a distributed ledger for recording information, stored by many nodes without a central organization through distributed systems and cryptography. The consensus algorithm is a protocol that guarantees the consistency of all data in a blockchain system. It is a key for building a blockchain system and an important part that affects the performance of the blockchain system. In this paper, we firstly compare the usage scenarios of different consensus algorithms, their advantages and disadvantages. After that, we present a new consensus algorithm in permissioned blockchain based on consistent hashing. For blockchain system construction, we propose a new design of the hash ring. The pseudo-randomness of the hash operation is used to ensure the randomness of the electoral leadership node in the blockchain system. It avoids the security risk of the fixed leadership node model. Our algorithm is applicable to blockchain systems containing Byzantine nodes and has a high throughput, low delay and many other advantages. Its communication complexity is O(n), significantly better than that of the practical Byzantine fault tolerance algorithm whose communication complexity is O(n2).","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"10 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":"126778254","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

A Parallel Uncertain Frequent Itemset Mining Algorithm with Spark 基于Spark的并行不确定频繁项集挖掘算法

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

Jiaman Ding, Haibin Li, Yuanyuan Wang, Lianyin Jia, Jinguo You, Yang Yang

{"title":"A Parallel Uncertain Frequent Itemset Mining Algorithm with Spark","authors":"Jiaman Ding, Haibin Li, Yuanyuan Wang, Lianyin Jia, Jinguo You, Yang Yang","doi":"10.1109/PDCAT46702.2019.00092","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00092","url":null,"abstract":"Frequent Itemset Mining (FIM) from large-scale databases has emerged as an important problem in the data mining and knowledge discovery research community. However, FIM suffers from three important limitations with the rapidly expanding of big data in all domains. First, it assumes that all items have the same importance. Second, it ignores the fact that data collected in a real-life environment is often inaccurate. Third, it is also a data-intensive and computation-intensive process which makes the FIM algorithm very time-consuming over large datasets. To address these issues, we propose a Parallel uncertain frequent itemset mining algorithm with spark (Pufim). Pufim firstly expresses item uncertainty by considering both the probability and weight, and calculates the maximum probability weight value of 1-items. Next, a distributed Pufim-tree structure is designed inspiring by FP-Tree for reducing the times of scanning the databases. Each node of Pufim-tree stores an item and its maximum probability weight value. Finally, experiments on publicly available UCI datasets demonstrate that Pufim achieves more prominent results than other related approaches across various metrics. In addition, the empirical study also shows Pufim has a good scalability","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"25 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":"117097212","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

Improving Recommender Systems Accuracy in Social Networks Using Popularity 利用人气提高社交网络中推荐系统的准确性

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

Kasra Majbouri Yazdi, Adel Majbouri Yazdi, Saeid Khodayi, Jingyu Hou, Wanlei Zhou, Saeid Saedy, M. Rostami

{"title":"Improving Recommender Systems Accuracy in Social Networks Using Popularity","authors":"Kasra Majbouri Yazdi, Adel Majbouri Yazdi, Saeid Khodayi, Jingyu Hou, Wanlei Zhou, Saeid Saedy, M. Rostami","doi":"10.1109/PDCAT46702.2019.00062","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00062","url":null,"abstract":"With the rapid advancement of World Wide Web, people can share their knowledge and information via online tools such as sharing systems and ecommerce applications. Many approaches have been proposed to process and organize information. Recommender systems are good successful examples of such tools in providing personalized suggestions. The main purpose of a recommender system is to identify and introduce desired items of a user among many other options (e.g. music, movies, books, news and etc). The goal of our proposed method is to provide a recommender system based on information diffusion and popularity in social networks. By adding popularity, similarity and users' trusts a more efficient system is proposed. This approach makes an improvement in tackling the issues and defects of the previous methods such as prediction accuracy and coverage. The evaluation of the simulated proposed method on MovieLens and Epinions datasets shows that it provides more accurate recommendations in comparison to other approaches.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"43 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":"128670344","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

Adaptive Clustering Strategy Based on Capacity Weight 基于容量权重的自适应聚类策略

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

Xingchun Liu, Zhipeng Feng, Jingjing Yu, Ying Tao, Shubo Ren

{"title":"Adaptive Clustering Strategy Based on Capacity Weight","authors":"Xingchun Liu, Zhipeng Feng, Jingjing Yu, Ying Tao, Shubo Ren","doi":"10.1109/PDCAT46702.2019.00030","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00030","url":null,"abstract":"With the rapid development of Internet of Things (IoT) technology, the number of nodes in wireless sensor networks (WSNs) is explosively increasing, and the scale of network is increased gradually. Traditional single-layer non-clustering network is no longer suitable for current WSNs, which results in high maintenance cost and fast deterioration of network performance. By analyzing the impact of existing static and dynamic clustering schemes on network performance, it is concluded that additional factors need to be considered to improve the overall performance of the network, such as residual energy of nodes, number of neighbor nodes and load balancing. Therefore, an adaptive multi-layer clustering networking strategy based on capability weights is proposed. Based on the real-time changes of each cluster density, node load and residual energy, the node capacity weights are updated dynamically according to the actual network performance, then the cluster heads are renewed adaptively. By comparing the performance metrics in the experiments, proposed strategy can effectively reduce the load of key nodes such as cluster head, and improves the network performance metrics such as average transmission delay, average transmission hops and load balancing.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"77 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":"114779985","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

An Improved Online Multidimensional Bin Packing Algorithm 一种改进的在线多维装箱算法

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

Vincent Portella, Hong Shen

引用次数: 2

A Hybrid Trust Management Model for Secure and Resource Efficient Vehicular Ad hoc Networks 一种安全高效的车辆自组织网络混合信任管理模型

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

A. Mahmood, S. A. Siddiqui, W. Zhang, Quan Z. Sheng

{"title":"A Hybrid Trust Management Model for Secure and Resource Efficient Vehicular Ad hoc Networks","authors":"A. Mahmood, S. A. Siddiqui, W. Zhang, Quan Z. Sheng","doi":"10.1109/PDCAT46702.2019.00038","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00038","url":null,"abstract":"Considerable innovative advancements in vehicular communication have led to the emerging yet promising paradigm of Internet-of-Vehicles, wherein vehicles exchange safety-critical information with minimal delay for ensuring road safety as well as efficacious traffic flows. It is, therefore, indispensable that these safety messages are authentic and reliable, and have originated from a legitimate vehicle. This demands establishing trust among vehicles such that the malicious and dishonest vehicles (and their malicious content) could be flagged and subsequently eliminated from the network. The risk manifolds if a malicious vehicle gets elected as the cluster head of other vehicles thereby compromising the safety of vehicular passengers and pedestrians on the road. Hence, intelligent algorithms should be in place to opt for the trusted and resource efficient cluster heads which could enhance the overall security and efficiency of their respective clusters. To this end, in this paper, we have proposed a scalable hybrid trust model which takes into account a composite metric encompassing the weighted trust score and available resources of each vehicle for identification of multiple malicious vehicles in real-time, and for meeting the stringent performance requirements of vehicular safety applications. Moreover, an optimal role assignment scheme based on the Hungarian algorithm has been proposed for electing the optimal cluster head, proxy cluster head, and followers among the members of a vehicular cluster so as to maximize its overall efficiency. Preliminary simulations have been carried out and are also presented in this paper.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"9 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":"125622543","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

Dark Web Along With The Dark Web Marketing And Surveillance 暗网与暗网营销和监控

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

Kithmini Godawatte, M. Raza, Mohsin Murtaza, A. Saeed

引用次数: 11

Coordinated and Hindsight Resources Allocation in Distributed Computing 分布式计算中的协调和后见之明资源分配

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

V. Toporkov, D. Yemelyanov

引用次数: 2

Scalability of Parareal for Large Power Grid Simulations 大电网模拟的拟面可扩展性

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

F. Joseph, G. Gurrala

引用次数: 0