the fusion of panchromatic and multispectral images is a prerequisite for obtaining multispectral images with high spatial resolution (HRMS). the traditional data processing mode requires that the acquired panchromati...
详细信息
High resolution spaceborne SAR has unique advantages in target recognition and earthquake rescue due to its refined description of target characteristics. the resolution is developing from the meter level to the decim...
详细信息
Multiplication is a fundamental step in many algorithms. If the multiplication of two integers of n words has a complexity of M(n), divisions and squares can be computed in O(M(n)) as well and the greatest common divi...
详细信息
ISBN:
(纸本)9781665469586
Multiplication is a fundamental step in many algorithms. If the multiplication of two integers of n words has a complexity of M(n), divisions and squares can be computed in O(M(n)) as well and the greatest common divisor can be computed in O(M(n) log n). thus being able to have a small value for M(n) is extremely important. To this day, the best known algorithm for reachable values is the Schonhage-Strassen algorithm which is implemented by a few arithmetic libraries. Asymptotically faster algorithms exist, however no computer is able to hold numbers big enough for those algorithms to outrun Schonhage-Strasser. the GNU Multiple Precision (GMP) library has a sequential-only implementation of Schonhage-Strassen. However some algorithms contains a step which is a single big multiplication. thus when trying to parallelize such an algorithm, one requires a parallel algorithm for multiplication. An example of such an algorithm is the batch factorization for Number Field Sieve. thus people trying to implement a parallel version of such algorithms need to find an arithmetic library that implements a parallel integer multiplication. An example of such a library is the Flint (Fast Library for Number theory) library that contains a parallel implementation of Schonhage-Strassen. In this article we present an implementation of Schonhage-Strassen, that reaches a speedup of 20 for the multiplication of two integers of 10(7) words of 64 bits using a Xeon Gold with 32 cores.
Graph Neural Networks (GNNs) can effectively process graph data and have been widely applied in fields such as drug discovery, social networks, and recommendation systems. Withthe continuous increase in datasets and ...
详细信息
We address the problem on uniform parallel batch machines to minimize makespan where each job is restricted to a specific subset of machines, known as its processing set. Batch machines have diverse speeds and capacit...
详细信息
ISBN:
(数字)9798350361445
ISBN:
(纸本)9798350361452
We address the problem on uniform parallel batch machines to minimize makespan where each job is restricted to a specific subset of machines, known as its processing set. Batch machines have diverse speeds and capacities. Each batch machine has the ability to concurrently process multiple jobs as long as the capacity allows. the length of a batch is defined as the largest length of all the jobs contained within it. We present fast approximation algorithms for inclusive processing set.
the national secret SM3 cryptographic hash algorithm is to generate a fixed hash value after iterative compression and expansion of a group of messages, which is mainly suitable for the generation of digital signature...
详细信息
this paper mainly studies the dynamic performance of constant frequency phase-shift controlled full bridge LC-LC series parallel resonant inverter, analyzes its small signal model by phasor domain modeling, and obtain...
详细信息
the proceedings contain 12 papers. the special focus in this conference is on international Embedded Systems. the topics include: Synthetic Data for Machine Learning on Embedded Systems in Precision Agr...
ISBN:
(纸本)9783031342134
the proceedings contain 12 papers. the special focus in this conference is on international Embedded Systems. the topics include: Synthetic Data for Machine Learning on Embedded Systems in Precision Agriculture;using Network Architecture Search for Optimizing Tensor Compression;simulation of Timing Attacks and Challenges for Early Side-Channel Security Analysis;adaptation for Energy Saving in Time-Triggered Systems Using Meta-scheduling with Sample Points;communication Layer Architecture for a Production Line Digital Twin Using Hierarchical Colored Petri Nets;Exploiting Heterogeneity in PIM architectures for Data-Intensive Applications;Demonstrating Scalability of the Checkerboard GPC with SystemC TLM-2.0;MAFAT: Memory-Aware Fusing and Tiling of Neural Networks for Accelerated Edge Inference;Memristor-only LSTM Acceleration with Non-linear Activation Functions;Minimizing Memory Contention in an APNG Encoder Using a Grid of processing Cells.
Aggregation is one of the most common operations in data analytics systems, but complex aggregation query like grouping aggregation on massive data sets is a relatively expensive operation. thus, improving the efficie...
详细信息
the inversion of a matrix, which is computationally intensive and involves numerous operations, is extensively used in various scientific and engineering applications. the block matrix inverse formula for n x n matric...
详细信息
暂无评论