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

筛选
英文 中文
New List Skeletons for the Python Skeleton Library Python骨架库的新列表骨架
F. Loulergue, Jolan Philippe
{"title":"New List Skeletons for the Python Skeleton Library","authors":"F. Loulergue, Jolan Philippe","doi":"10.1109/PDCAT46702.2019.00077","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00077","url":null,"abstract":"Algorithmic skeletons are patterns of parallel computations. Skeletal parallel programming eases parallel programming: a program is merely a composition of such patterns. Data-parallel skeletons operate on parallel data-structures that have often sequential counterparts. In algorithmic skeleton approaches that offer a global view of programs, a parallel program has therefore a structure similar to a sequential program but operates on parallel data-structures. PySke is such an algorithmic skeleton library for Python to program shared or distributed memory parallel architectures in a simple way. This paper presents an extension to PySke: new algorithmic skeletons on parallel lists. This extension is evaluated on an application.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"44 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":"122502375","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 Modified Community-Level Diffusion Extraction in Social Network 社会网络中改进的社区级扩散提取
Huajian Chang, Hong Shen
{"title":"A Modified Community-Level Diffusion Extraction in Social Network","authors":"Huajian Chang, Hong Shen","doi":"10.1109/PDCAT46702.2019.00101","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00101","url":null,"abstract":"Equipped with more convenient facilities and features, online social networks have become the most popular platform for people's communication. It is increasingly important to model information propagation in such networks. Most of the state-of-the-art algorithms of information diffusion model focus on individual-level diffusion and does not consider the impact of social relations on user's expression, making them either unable to uncover diffusion patterns accurately or unable to capture dynamically changing topics of text stream in social networks. To address these issues, we proposed a dynamic community-level diffusion model (DCDM) in this paper to capture diffusion patterns based on coordinated dynamic semantic analysis by multiple topic-word distribution and structure analysis. Comparative experiments are conducted on the real dataset from Tweet. Experimental results show our diffusion model outperforms the state-of-the-art methods.","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":"132602316","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
A Temporal Caching-Aware Dummy Selection Location Algorithm 一种感知时间缓存的虚拟选择定位算法
Xuejiao Mu, Hong Shen, Zhigang Lu
{"title":"A Temporal Caching-Aware Dummy Selection Location Algorithm","authors":"Xuejiao Mu, Hong Shen, Zhigang Lu","doi":"10.1109/PDCAT46702.2019.00099","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00099","url":null,"abstract":"Along with the increased convenience of our daily life thanks to the proliferation of location-based service (LBS), such as finding restaurants and booking taxi, concerns on privacy disclosure risks in sharing our locations with LBS have also increased and become a major bottleneck that obstacles the widespread of adoption of LBS [1]. To preserve privacy in LBS, k-anonymity was applied to conceal people's sensitive information against re-identification attacks [2]. Unfortunately, the k-anonymity technique relies on predefined background knowledge of an adversary. Once the adversary has different auxiliary information, we cannot guarantee any privacy preservation against such an adversary. To address the privacy leakage problem of the naive k-anonymity, a combination of k-anonymity and location's query frequency algorithm, the Caching-aware Dummy Selection Algorithm (CaDSA), were proposed [3]. CaDSA anonymises locations in a given area by grouping them with similar query frequency during a fixed time period, say one day. However, considering in the real-life situation location's query frequency often varies in different time slots even in a single day, privacy will clearly lose if we roughly group locations according to a fixed time period as CaDSA. Consequently, in this paper, we propose a Temporal Caching-aware Dummy Location Selection Algorithm (T-CaDLSA) that considers the differences among location's query frequencies over different time slots within a given time period (day). Both mathematical and experimental evaluations show that to achieve the same data utility, our method outperforms the existing work in privacy guarantee.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"71 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":"129703948","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
Event Causality Detection in Tweets by Context Word Extension and Neural Networks 基于上下文词扩展和神经网络的推文事件因果关系检测
Humayun Kayesh, Md. Saiful Islam, Junhu Wang
{"title":"Event Causality Detection in Tweets by Context Word Extension and Neural Networks","authors":"Humayun Kayesh, Md. Saiful Islam, Junhu Wang","doi":"10.1109/PDCAT46702.2019.00070","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00070","url":null,"abstract":"Twitter has become a great source of user-generated information about events. Very often people report causal relationships between events in their tweets. Automatic detection of causality information in these events might play an important role in prescriptive event analytics. Existing approaches include both rule-based and data-driven supervised methods. However, it is challenging to identify event causality accurately using linguistic rules due to the unstructured nature and grammatical incorrectness of social media short text such as tweets. Also, it is difficult to develop a data-driven supervised method for event causality detection in tweets due to insufficient contextual information. This paper proposes a novel event context word extension technique based on background knowledge. To demonstrate the effectiveness of our event context word extension technique, we develop a feed-forward neural network based approach to detect event causality from tweets. Extensive experiments demonstrate the superiority of our approach.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"66 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":"129797478","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
SMT Solvers as Efficient Tools for Automatic Time Properties Verification of Security Protocols SMT求解器作为安全协议时间属性自动验证的有效工具
A. Zbrzezny, Olga Siedlecka-Lamch, Sabina Szymoniak, M. Kurkowski
{"title":"SMT Solvers as Efficient Tools for Automatic Time Properties Verification of Security Protocols","authors":"A. Zbrzezny, Olga Siedlecka-Lamch, Sabina Szymoniak, M. Kurkowski","doi":"10.1109/PDCAT46702.2019.00065","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00065","url":null,"abstract":"This paper presents our next research related to the use of SMT techniques for the analysis of security protocols. The behaviours of users and their changing knowledge during an investigated protocol executions are modelled as networks of communicating timed automata. The time properties are defined as the reachability properties of some, properly indicated states in the product automaton. We can do it using specially described time conditions, that can express dependencies between defined as a reachability property of some, chosen states in automata network, the possibility of performing some desired protocol steps and filling time constraints that use generation time of timestamps and lifetimes or/and networks delays. For our experiments we use boolean and SMT encodings that are the basis for respectively, SAT-and SMT-based bounded model checking. For SMT, the runs in product automaton are translated into the quantifier-free first-order formula. So far, we have implemented a well known bounded model checking algorithm and evaluated it for Needham-Schroeder Public Key, Needham Schroeder Symmetric Key, Woo Lam Pi and Wide Mouth Frog protocols. Now we show the tests carried out for the group of four known from the literature security protocols. We also compared our new SMT-based approach with a previous, only SAT-based, technique. For experiments, we used Minisat SAT solver, Z3, Yices2, CVC4 and MathSAT SMT solvers.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"41 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":"125373634","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
[Title page i] [标题页i]
{"title":"[Title page i]","authors":"","doi":"10.1109/pdcat46702.2019.00001","DOIUrl":"https://doi.org/10.1109/pdcat46702.2019.00001","url":null,"abstract":"","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":"127148177","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
Development of Filled Circle Drawing in High-Level Synthesis Oriented Game Programming Library 面向高级综合的游戏程序库中填充圆绘图的开发
Y. Yamagata, A. Yamawaki
{"title":"Development of Filled Circle Drawing in High-Level Synthesis Oriented Game Programming Library","authors":"Y. Yamagata, A. Yamawaki","doi":"10.1109/PDCAT46702.2019.00058","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00058","url":null,"abstract":"We are developing a high-level synthesizable software game library to realize high performance and low power mobile terminals executing game applications. High-level synthesis, HLS, is a technology that automatically converts software into hardware. Games developed by HLS oriented game software library are executed by high-speed and low-power hardware reconfigured on reconfigurable devices in mobile terminals. This paper develops a circle drawing processing as one of functions in HLS oriented game software library. We employ Michener's algorithm which is suitable for hardware implementation as a circle drawing algorithm because it just consists of simple integer operations. We also show the program description method so that HLS tool can convert the circle drawing processing based on Michener's algorithm to a good hardware module. The experiments evaluate the execution time and the amount of hardware of the hardware module HLS generated.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"228 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":"115015338","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
Research on Case Preprocessing Based on Bert -CNN-LSTM Model 基于Bert -CNN-LSTM模型的案例预处理研究
Chuyue Zhang, Manchun Cai, Xiaofan Zhao
{"title":"Research on Case Preprocessing Based on Bert -CNN-LSTM Model","authors":"Chuyue Zhang, Manchun Cai, Xiaofan Zhao","doi":"10.1109/PDCAT46702.2019.00054","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00054","url":null,"abstract":"In this paper, we apply the deep learning algorithm to preprocess the criminal case information. By extracting the characteristics of the brief case field, the missing content of other required field is plugged through model training. The experimental results show that the precision rate of CNN-LSTM model is 3% higher than that of LSTM-CNN model in text classification. After the Bert model is integrated, the precision rate, recall rate, and F value are all improved by 10%. To the best of our knowledge, this is the first time to use Bert model in preprocessing criminal case information.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"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":"115051633","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
Logistics Scheduling for UAV Based on Tabu Search Algorithm 基于禁忌搜索算法的无人机物流调度
K. Zhao, Shoubao Su, Haiping Huang, Jie Zhu
{"title":"Logistics Scheduling for UAV Based on Tabu Search Algorithm","authors":"K. Zhao, Shoubao Su, Haiping Huang, Jie Zhu","doi":"10.1109/PDCAT46702.2019.00089","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00089","url":null,"abstract":"To improve the flexibility and efficiency of the logistics distribution system, a new type of logistics distribution mode, namely the Unmanned Aerial Vehicle and Shared Reception Box (UAV-SRB) logistics distribution mode, is studied. In this paper, we consider logistics scheduling problem of using multiple homogeneous UAVs to transport a batch of packages from one logistics center to multiple SRBs. The optimizing objective of this problem is to minimize the average mission execution time of UAVs. In addition, considering the capacity constraints of UAVs, a corresponding single-objective mathematical model is established. Combined with the actual logistics situation, we propose an Adaptive Tabu Search Algorithm (ATSA) to solve this problem. In order to improve the optimization performance, the algorithm designs adaptive tabu length and divides neighborhood space into several subsets according to different destinations. By comparing with other two heuristic algorithms (LSA and SA), the proposed algorithm is proved to be robust and effective for the research problem.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"20 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":"121933359","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
CAAVI-RICS Model for Analyzing the Security of Fog Computing Systems: Authentication 雾计算系统安全性分析的CAAVI-RICS模型:认证
Saša Pesic, Miloš Radovanović, M. Ivanović, C. Bǎdicǎ, M. Tosic, Ognjen Ikovic, D. Boskovic
{"title":"CAAVI-RICS Model for Analyzing the Security of Fog Computing Systems: Authentication","authors":"Saša Pesic, Miloš Radovanović, M. Ivanović, C. Bǎdicǎ, M. Tosic, Ognjen Ikovic, D. Boskovic","doi":"10.1109/PDCAT46702.2019.00050","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00050","url":null,"abstract":"The overarching connectivity of \"things\" in the Internet of Things presents an appealing environment for innovation and business ventures, but also brings a certain set of security challenges. Engineering secure Internet of Things systems requires addressing the peculiar circumstances under which they operate: constraints due to limited resources, high node churn, decentralized decision making, direct interfacing with end users etc. Thus, techniques and methodologies for building secure and robust Internet of Things systems should support these conditions. In this paper, we are presenting a description of the CAAVI-RICS framework, a novel security review methodology tightly coupled with distributed, Internet of Things and fog computing systems. With CAAVI-RICS we are exploring credibility, authentication, authorization, verification, and integrity (CAAVI) through explaining the rationale, influence, concerns and security solutions (RICS) that accompany them. Our contribution is a thorough systematic categorization and rationalization of security issues, covering the security landscape of Internet of Things/fog computing systems, as well as contributing to the discussion on the aspects of fog computing security and state-of-the-art solutions. Specifically, in this paper we explore the Authentication in Internet of Things systems through the RICS review methodology.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124487669","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
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学术官方微信