Results 101 to 110 of about 1,720,417 (290)
On the Capacity and Straggler-Robustness of Distributed Secure Matrix Multiplication
Computationally efficient matrix multiplication is a fundamental requirement in various fields, including and particularly in data analytics. To do so, the computation task of large-scale matrix multiplication is typically outsourced to multiple servers.
Jaber Kakar +2 more
doaj +1 more source
A combined experimental–computational framework identifies energy‐dependent laser absorptivity for NiTi in laser powder‐bed fusion, applicable to conduction and transition modes. Single‐track experiments and thermofluid smoothed particle hydrodynamics simulations are coupled through inverse analysis of melt pool geometry.
Mohamadreza Afrasiabi +3 more
wiley +1 more source
Parallelizing Strassen's Method for Matrix Multiplication on Distributed-Memory MIMD Architectures
[[abstract]]We present a parallel method for matrix multiplication on distributed-memory MIMD architectures based on Strassen's method. Our timing tests, performed on a 56-node Intel Paragon, demonstrate the realization of the potential of the Strassen's
Chou, Chung-Chiang; Deng, Y. ; Li, G. ; Wang, Y.
core
Паралельна реалізація матричного множення за допомогою Block Matrix з використанням технології CUDA [PDF]
У дослідженні розглянуто розробку паралельного алгоритму матричного множення за допомогою Block Matrix. Розглянуто питання аналізу матричного множення за допомогою Block Matrix, обгрунтовано засоби розробки програмного модуля, розроблено діаграми ...
Denysiuk, V. O. +2 more
core +1 more source
Experiments and thermophysical simulations were conducted to investigate the electron beam powder bed fusion electron beam (PBF‐EB/M) process for the γ′‐strengthened nickel‐based superalloy Inconel 738LC. The results demonstrate the impact of process‐induced microstructural variations on high‐temperature mechanical behavior, providing a basis for ...
Jan Niklas Petenati +11 more
wiley +1 more source
Finding a Heaviest Triangle is not Harder than
We show that for any # > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n is the exponent of fastest matrix multiplication algorithm.
Artur Czumaj +2 more
core
Idempotent 2x2 matrices over linearly ordered abelian groups [PDF]
In this paper we study multiplicative semigroups of $2\times 2$ matrices over a linearly ordered abelian group with an externally added bottom element. The multiplication of such a semigroup is defined by replacing addition and multiplication by join and
Valdis Laan, Marilyn Kutti
doaj +1 more source
Discovering faster matrix multiplication algorithms with reinforcement learning. [PDF]
Fawzi A +12 more
europepmc +1 more source
Manufacturing problems such as heat treatment‐induced cracking hinder the widespread application of the laser powder bed fusion (LPBF) process to superalloys. In this study, cracks in the LPBF components of Inconel 738LC superalloy are characterized after heat treatment at various temperature ranges, revealing two distinct cracking behaviors.
Kosuke Kuwabara +4 more
wiley +1 more source
Sparse matrix multiplication in a record-low power self-rectifying memristor array for scientific computing. [PDF]
Li J +11 more
europepmc +1 more source

