检索结果-内蒙古大学图书馆

27th IEEE international conference on parallel and Distributed Systems, ICPADS 2021

作者： Zhao, Lirui Zhang, Jipeng Huang, Junhao Liu, Zhe Hancke, Gerhard Nanjing University of Aeronautics and Astronautics Jiangsu China Beijing Normal University-Hong Kong Baptist University United International College Guangdong China State Key Laboratory of Cryptology Beijing100878 China City University of Hong Kong Hong Kong Hong Kong

ISBN: (纸本)9781665408783

Kyber, an IND-CCA-secure key encapsulation mechanism (KEM) based on the MLWE problem, has been shortlisted for the third round evaluation of the NIST Post-Quantum Cryptography Standardization. In this paper, we explored the optimizations of Kyber in high-performance processors from the ARM Cortex-A series, which are widely used in mainstream mobile phones. To improve the performance of Kyber, we utilized the powerful SIMD instruction set NEON in an ARMv8-A to parallelize the core modules of Kyber, i.e., modular reduction and NTT. Specifically, we specially designed the optimized implementation based on the characteristic of the NEON instruction set for the Barrett and Montgomery reduction algorithms. To make full use of the computing power of NEON instructions, we proposed a novel strategy for computing the 16-bit Barrett reduction without handling the 32-bit intermediate result. Our Barrett and Montgomery reduction showed 8.52 and 8.89 times faster than the reference implementation. As for NTT/INTT, we adopted the 2+5 layer merging strategy on an ARMv8-A to implement NTT/INTT after carefully analyzing the register occupancy of various layer merging techniques. thanks to the selected layer merging strategy, our NTT and INTT achieved 11.89 and 13.45 times speedups compared with the reference implementation. Our optimized software achieved 1.77×, 1.85×, and 2.16× speedups for key generation, encapsulation, and decapsulation compared with Kyber's reference implementation. © 2021 IEEE.

关键词： Neon

来源：评论

学校读者我要写书评

暂无评论

Controlled Asynchronous GVT: Accelerating parallel Discrete Event Simulation on Many-Core Clusters 19

Controlled Asynchronous GVT: Accelerating Parallel Discrete ...

引用

48th international conference on parallel processing (ICPP)

作者： Eker, Ali Williams, Barry Chiu, Kenneth Ponomarev, Dmitry Binghamton Univ Binghamton NY 13902 USA

ISBN: (纸本)9781450362955

In this paper, we investigate the performance of parallel Discrete Event Simulation ( PDES) on a cluster of many-core Intel KNL processors. Specifically, we analyze the impact of different Global Virtual Time (GVT) algorithms in this environment and contribute three significant results. First, we show that it is essential to isolate the thread performing MPI communications from the task of processing simulation events, otherwise the simulation is significantly imbalanced and performs poorly. this applies to both synchronous and asynchronous GVT algorithms. Second, we demonstrate that synchronous GVT algorithm based on barrier synchronization is a better choice for communication-dominated models, while asynchronous GVT based on Mattern's algorithm performs better for computation-dominated scenarios. third, we propose Controlled Asynchronous GVT (CA-GVT) algorithm that selectively adds synchronization to Mattern-style GVT based on simulation conditions. We demonstrate that CA-GVT outperforms both barrier and Mattern's GVT and achieves about 8% performance improvement on mixed computation-communication models. this is a reasonable improvement for a simple modification to a GVT algorithm.

关键词： parallel Discrete Event Simulation Intel Xeon Phi Knights Landing Manycore architectures Performance Global Virtual Time

来源：评论

学校读者我要写书评

暂无评论

G-match: A fast GPU-friendly data compression algorithm 21

G-match: A fast GPU-friendly data compression algorithm

引用

21st IEEE international conference on High Performance Computing and Communications, 17th IEEE international conference on Smart City and 5th IEEE international conference on Data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Lu, Li Hua, Bei School of Computer Science and Technology University of Science and Technology of China Hefei Anhui China

ISBN: (纸本)9781728120584

Data compression plays an important role in the era of big data;however, such compression is typically one of the bottlenecks of a massive data processing system due to intensive computing and memory access. In this paper, we propose a high-speed GPU-friendly data compression algorithm called G-match that takes full advantage of the GPU parallel computing power to speed up the compression process. the greatest challenge here is to solve the contradiction between the high data dependency inherent in the compression algorithm and the GPU single-instruction multiple-thread operating model. G-match achieves a high parallel degree by eliminating fine-grained data dependency and all path divergences in the algorithm. Compared with other, similar work on GPUs, G-match is the first thoroughly parallelized data compression algorithm. Experiments comparing other GPU compression algorithms show that G-match achieves approximately 33% speedup over the current fastest implementation and the highest compression ratio. © 2019 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

parallel Fully Vectorized Marsa-LFIB4: Algorithmic and Language-Based Optimization of Recursive Computations 13th

Parallel Fully Vectorized Marsa-LFIB4: Algorithmic and Langu...

引用

13th international conference on parallel processing and Applied Mathematics, PPAM 2019

作者： Stpiczyński, Przemyslaw Institute of Computer Science Maria Curie–Sklodowska University Akademicka 9/519 Lublin20-033 Poland

ISBN: (纸本)9783030432218

the aim of this paper is to present a new high-performance implementation of Marsa-LFIB4 which is an example of high-quality multiple recursive pseudorandom number generators. We propose a new algorithmic approach that combines language-based vectorization techniques together with a new divide-and-conquer method that exploits a special sparse structure of the matrix obtained from the recursive formula that defines the generator. We also show how the use of intrinsics for Intel AVX2 and AVX512 vector extensions can improve the performance. Our new implementation achieves good performance on several multicore architectures and it is much more energy-efficient than simple SIMD-optimized implementations. © 2020, Springer Nature Switzerland AG.

关键词： Number theory

来源：评论

学校读者我要写书评

暂无评论

An Efficient Spatio-Textual Skyline Query processing Algorithm Based on Spark 15th

An Efficient Spatio-Textual Skyline Query Processing Algorit...

引用

15th international conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, ICNC-FSKD 2019, co-located with the 5th international conference on Harmony Search, Soft Computing and Applications, ICHSA 2019

作者： Qiao, Baiyou Zhang, Jingru Qiao, Xiyu Hu, Bing Zheng, Yujie Wu, Gang School of Computer Science and Engineering Northeastern University Shenyang China Department of Platform and Architecture *** Inc. Beijing China

ISBN: (纸本)9783030325909

Aiming at the problem of spatio-textual skyline query processing in cloud computing systems, we propose a Spark-based spatio-textual skyline query processing algorithm. In which, the spatial objects irrelevant to query points are filtered out according to the text relevance, and an integration function is used to compute the spatio-textual distances between spatial objects and query points. then the data space consisting of dynamic spatio-textual distances is divided into same-sized cells by using a grid partitioning method, and the cell dominant relation is used to filter out the cells and related spatial objects, thus reducing the computation cost. A local spatial skyline algorithm is used to compute local skyline results for each cell in parallel, in which, spatial objects having strong dominant capacity are selected as the initial dominating set to further reduce the computing cost and speed up the execution of the algorithm. Experimental results show that the proposed algorithm has good performance and scalability. © 2020, Springer Nature Switzerland AG.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

Position error prediction using hybrid recurrent neural network algorithm for improvement of pose accuracy of cable driven parallel robots

引用

MICROSYSTEM TECHNOLOGIES-MICRO-AND NANOSYSTEMS-INFORMATION STORAGE AND processing SYSTEMS 2020年第1期26卷 209-218页

作者： Kang, Jung-Min Choi, Sung-Hyun Park, Jung-wan Park, Kyoung-Su Gachon Univ Dept Mech Engn 1342 Seongnamdaero Seongnam Si 461701 Gyeonggi Do South Korea Hyundai Motor 150 Hyundaiyeonguso Ro Hwaseong Si Gyeonggido South Korea

Because cable-driven parallel robots (CDPRs) have lightweight moving parts, CDPRs have been used in various industrial applications requiring high speeds and accelerations. Especially, CDPRs with polymer cables can achieve higher accelerations and speeds compared to those with steel cables. However, they also have some disadvantages, such as a nonlinear creep, a hysteresis, and a short- and long-term recovery. Because these nonlinear characteristics, the accuracy of CDPRs gets worse and worse. In this study, we proposed a hybrid recurrent neural network (H-RNN) to predict nonlinear characteristics of the cable elongation and to solve the problems associated with CDPRs and apply the real-time control. In the algorithm, the long short-term memory (LSTM) algorithm was used to learn the characteristics of the low-frequency data, and the basic RNN learned the features of the high-frequency data. We also confirmed that the cut-off frequency was determined based on the non-operating frequency related to rest time. Also, it yielded more accurate results because the LSTM has a wider effective frequency range. Finally, the learning process was completed by combining these two algorithms. these results made it possible to predict position errors of CDPRs with high accuracy, in which error varies under both while operating and no operation conditions. the H-RNN had a lower root mean square error than both the optimal RNN and the optimal LSTM, so it was effective for controlling systems that have errors across a range of frequencies.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

A Method for Automatic Tracking of Cell Nuclei with Weakly-Supervised Mitosis Detection in 2D Microscopy Image Sequences 20

A Method for Automatic Tracking of Cell Nuclei with Weakly-S...

引用

5th international conference on Biomedical Signal and Image processing, ICBIP 2020

作者： Kondratiev, Alexandr Yu. Yaginuma, Hideyuki Okada, Yasushi Krylov, Andrey S. Sorokin, Dmitry V. Laboratory of Mathematical Methods of Image Processing Faculty of Computational Mathematics and Cybernetics Lomonosov Moscow State University Moscow Russia RIKEN Osaka Japan Department of Physics and Universal Biology Institute Graduate School of Science University of Tokyo Tokyo Japan

ISBN: (纸本)9781450387767

Due to a high interest in microscopic cell migration analysis for biological research, numerous cell segmentation and tracking algorithms has emerged. the main tasks of cell tracking methods are to segment each cell and establish individual cell lineages over time, accounting for possible cell disappearance and division events. In some datasets, cells can drastically change their appearance during the mitosis stage, thus making division detection a challenging problem. the most prominent methods exploit different neural network architectures for at least one of these tasks. We propose a method that uses a single UNet topology network to solve both tasks of cell nuclei instance segmentation and detection of mitotic events. For instance segmentation, the network is learned to segment primary masks and object centroids that are used by watershed transform to obtain individual nuclei regions. For mitotic events detection, we first manually mark cells entering and finishing mitosis. then, previously trained network is used to generate weak nuclei segmentation labels for all data images in sequences with marked mitotic events. We add an additional output to the trained network for segmentation of mitotic events. the training is resumed for both tasks on initial ground truth segmentation, generated weak labels, and crude mitotic events markers. For tracking, we use generalized nearest neighbour method that can greedily search the best 1-to-1 and 1-to-2 instance connections over multiple frames. Segmentation of the mitotic events produced by the trained model is incorporated into the tracking algorithm to improve cell division detection. We evaluate the results of the proposed method and compare it with the previously developed algorithm, achieving better performance on our dataset. We assume it is possible to upgrade other existing segmentation frameworks to also learn the task of segmenting mitotic events and enhance division detection using the proposed pipeline. © 2020

关键词： Cell proliferation

来源：评论

学校读者我要写书评

暂无评论

11th Workshop on Business and IT Alignment, BITA 2020, 3rd Workshop on Blockchain and Smart Contract Technologies, BSCT 2020, 2nd international Workshop on transforming the Digital Customer Experience, DigEX 2020, 5th international Workshop on Intelligent Data Analysis in Integrated Social CRM, iCRM 2020 and 3rd Workshop on Quality of Open Data, QOD 2020 held at 23rd international conference on Business Information Systems, BIS 2020

11th Workshop on Business and IT Alignment, BITA 2020, 3rd W...

引用

11th Workshop on Business and IT Alignment, BITA 2020, 3rd Workshop on Blockchain and Smart Contract Technologies, BSCT 2020, 2nd international Workshop on transforming the Digital Customer Experience, DigEX 2020, 5th international Workshop on Intelligent Data Analysis in Integrated Social CRM, iCRM 2020 and 3rd Workshop on Quality of Open Data, QOD 2020 held at 23rd international conference on Business Information Systems, BIS 2020

ISBN: (纸本)9783030611453

the proceedings contain 26 papers. the special focus in this conference is on Business and IT Alignment. the topics include: Analysing and Predicting the Adoption of Anonymous Transactions in Cryptocurrencies;volatility and Value at Risk of Crypto Versus Fiat Currencies;how Much Identity Management with Blockchain Would Have Saved Us? A Longitudinal Study of Identity theft;benefits of the Technology 4.0 Used in the Supply Chain - Bibliometric Analysis and Aspects Deferring Digitization;how Do Movie Preferences Correlate with e-Commerce Purchases? An Empirical Study on Amazon;financial Institutions and Use of Social Media: Analysis of the Largest Banks in the U.S. and Europe;Outsourcing of Social CRM Services in German SMEs;Customer-Focused Churn Prevention with Social CRM at Orange Polska SA (Research in Progress);Social CRM: A Literature Review Based on Keywords Network Analysis;digitalization of Small and Medium-Sized Enterprises: An Analysis of the State of Research;Social CRM Tools: A Systematic Mapping Study;Analyzing OpenStreetMap Contributions at Scale: Introducing OSM-Interactions Tilesets;enhancing the Interactive Visualisation of a Data Preparation Tool from in-Memory Fitting to Big Data Sets;materia: A Data Quality Control Embedded Domain Specific Language in Python;models for Arabic Document Quality Assessment;open Data Quality Dimensions and Metrics: State of the Art and Applied Use Cases;synthesizing Quality Open Data Assets from Private Health Research Studies;incremental Modeling Method of Supply Chain for Decision-Making Support;impact of New Mobility Services on Enterprise architectures: Case Study and Problem Definition;sharedWealth: Disincentivizing Mining Pools through Burning and Minting.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Recent Advances in Object Detection and Tracking for High Resolution Video: Overview and State-of-the-Art 5

Recent Advances in Object Detection and Tracking for High Re...

引用

5th international conference on Computing, Communication Control and Automation (ICCUBEA)

作者： Rajjak, Shaikh Shakil Abdul Kureshi, A. K. Matoshri Coll Engn & Res Ctr Dept Elect & Telecommun Nasik India Savitribai Phule Pune Univ Pune Maharashtra India

ISBN: (纸本)9781728140421

Object detection and tracking at real time is important and challenging tasks in many computer vision applications such as video robot navigation, surveillance, vehicle navigation, security applications, military applications, patient monitoring system and traffic monitoring system. Object detection includes detecting the object in sequence of videos. In this paper we reviewed the different methods/algorithms for object detection and tracking at real time for high resolution video. Now day's high resolution imaging sensors/cameras is being used in different areas of applications such as security system, in military applications etc. For object detection and tracking in high resolution, greater frame rate requires more time to process a single frame, so it is an extreme challenges for researchers to detect and track target at real time. this sets a demand for fast computational algorithms for real time processing of high resolution videos. Moving object detection and tracking is one of the decisive active areas of research since last decade. In this paper we address and highlight a brief survey or review of various real time object detection and tracking algorithms for high resolution video available in the literature.

关键词： Motion tracking Moving object detection High Definition (HD) Heterogeneous architectures Occlusions Graphical processing Unit

来源：评论

学校读者我要写书评

暂无评论

parallel processing of Frequent Itemset Based on MapReduce Programming Model 5

Parallel Processing of Frequent Itemset Based on MapReduce P...

引用

5th international conference on Computing, Communication Control and Automation (ICCUBEA)

作者： Deshmukh, Rajshree A. Bharathi, H. N. Tripathy, Amiya K. KJ Somaiya Coll Engn Comp Engn Mumbai Maharashtra India Don Bosco Inst Technol Comp Engn Mumbai Maharashtra India Edith Cowan Univ Sch Sci Perth WA Australia

ISBN: (纸本)9781728140421

Searching frequent itemset in large size diverse database is one of the most important data mining problem and as existing algorithms are insufficient in mechanism that enables automatic parallelization, fault tolerance and data distribution. Solution to this issue we design algorithm using MapReduce programming model. the overarching aim is to enhance the performance of parallel frequent itemset mining on Hadoop. Incorporating ultra-metric tress to improve more efficiency of mining frequent itemset and comparing Apriori algorithm and FP-Growth algorithm based on some parameters. We implement the algorithm with dataset of Market Basket Analytics

关键词： Frequent Itemset Mining Hadoop MapReduce Programming Frequent itemset ultrametric tress (FIU-tree)

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：