Results 61 to 70 of about 165,252 (290)
AI‐Assisted Workflow for (Scanning) Transmission Electron Microscopy: From Data Analysis Automation to Materials Knowledge Unveiling. Abstract (Scanning) transmission electron microscopy ((S)TEM) has significantly advanced materials science but faces challenges in correlating precise atomic structure information with the functional properties of ...
Marc Botifoll +19 more
wiley +1 more source
A Flexible Hardware Accelerator for Booth Polynomial Multiplier
This article presents a parameterized/flexible hardware accelerator design tailored for the Booth polynomial multiplication method. The flexibility is achieved by allowing users to compute multiplication operations across various operand lengths ...
Omar S. Sonbul
doaj +1 more source
A New Secret Sharing Scheme Based on Polynomials over Finite Fields
In this paper, we examine a secret sharing scheme based on polynomials over finite fields. In the presented scheme, the shares can be used for the reconstruction of the secret using polynomial multiplication. This scheme is both ideal and perfect.
Selda Çalkavur +2 more
doaj +1 more source
Multiple orthogonal polynomials
This is a review of the advances in the theory of simultaneous Padé approximants for the past five years. It covers new results in the classification of what appear to be the semiclassical multiple orthogonal polynomials, new applications to number theory, connections with the spectral theory of non-symmetric operators and orthogonal polynomials with ...
openaire +1 more source
Chiral Acoustic Phonon and Conservation of Pseudoangular Momentum in α‐Quartz
Chiral acoustic phonons in α‐quartz are probed via Brillouin light scattering, exploiting the photon's helicity and the crystal's handedness. The interaction obeys a selection rule arising from pseudoangular momentum conservation, enabling direct optical access to phonon chirality in nonsymmorphic crystals.
Changsoo Kim +8 more
wiley +1 more source
On semiring complexity of Schur polynomials
Semiring complexity is the version of arithmetic circuit complexity that allows only two operations: addition and multiplication. We show that semiring complexity of a Schur polynomial {s_\lambda(x_1,\dots,x_k)} labeled by a partition {\lambda=(\lambda_1\
Fomin, S. +3 more
core +2 more sources
Tight polynomial worst-case bounds for loop programs [PDF]
In 2008, Ben-Amram, Jones and Kristiansen showed that for a simple programming language - representing non-deterministic imperative programs with bounded loops, and arithmetics limited to addition and multiplication - it is possible to decide precisely ...
Ben-Amram, Amir M., Hamilton, Geoff
core
Asymmetry of the Ferroelectric Phase Transition in BaTiO3
Phase transitions are typically assumed to behave identically in forward and reverse. This work shows that in the ferroelectric material barium titanate this is not true: heating drives an abrupt, first‐order jump, while cooling gives a smooth, continuous change.
Asaf Hershkovitz +14 more
wiley +1 more source
A Bootstrapping-Capable Configurable NTT Architecture for Fully Homomorphic Encryption
Fully homomorphic encryption (FHE) provides a solution to privacy-preserving applications because of its ability to perform computations on encrypted data without exposing raw data.
Rella Mareta +3 more
doaj +1 more source
Multiple Wilson and Jacobi–Piñeiro polynomials
22 pages, 2 ...
Beckermann, B. +2 more
openaire +3 more sources

