Results 111 to 120 of about 17,450 (322)
The Multiplicative Complexity of Boolean Functions on Four and Five Variables [PDF]
. A generic way to design lightweight cryptographic primitives is to construct simple rounds using small nonlinear components such as 4x4 S-boxes and use these iteratively (e.g., PRESENT [1] and SPONGENT [2]).
Rene ́ Peralta +2 more
core
Do not let thermal drift and instrument artifacts deceive high‐temperature nanoindentation results. We compare classical Oliver–Pharr and automatic image recognition analyses across steels and a Ni alloy to quantify these effects. Accounting for artifacts reveals systematic softening with temperature, while Cr and Ni additions boost resistance ...
Velislava Yonkova +2 more
wiley +1 more source
The article is devoted to the problem of generating a cryptosystem RSA key decryption on the known open parameters - system module and the encryption key.
Andrey Alekseevich Kolyada +1 more
doaj
The complexity of multiple wordlength assignment
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Constantinides, G.A., Woeginger, G.J.
openaire +2 more sources
Optimization of the Production of Rubber Compounds Using Mathematical Models
Rubber compounds were mixed in a batch internal mixer, and symbolic regression was used to derive mathematical models linking recipe and process parameters to ram path, torque, and mixing quality (incorporation, dispersion, distribution). Subsequent optimization with evolutionary algorithms identified operating conditions that reduce specific energy ...
Anke Bardehle +7 more
wiley +1 more source
Coarse‐grained (left) and atomistic (right) models of the shape memory polymer ESTANE ETE 75DT3 are shown schematically. The two representations bridge molecular detail and mesoscopic description. Both models capture shape memory behavior, linking segmental mobility and conformational relaxation of anisotropic chains to macroscopic recovery, and ...
Fathollah Varnik
wiley +1 more source
Owing to its simplicity radix-2 is a popular algorithm to implement fast fourier transform. Radix-2 p algorithms have the same order of computational complexity as higher radices algorithms, but still retain the simplicity of radix-2.
Rassoul Amirfattahi
doaj
This paper proposes a novel lightweight non-negative variant of Parallel Factor Analysis 2 (PARAFAC2), coined as LNN-PARAFAC2, that simultaneously enforces non-negativity and reduces computational complexity.
Ioannis Tsingalis +2 more
doaj +1 more source
This study shows that superalloys used in aircraft engine disks become much more prone to deformation at high temperatures if they have been strained during manufacturing. This effect increases with the level of prior strain but eventually reaches a limit.
Fabio Machado Alves da Fonseca +9 more
wiley +1 more source
Efficient qualitative analysis of classes of recursive markov decision processes and simple stochastic games [PDF]
. Recursive Markov Decision Processes (RMDPs) and Recursive Simple Stochastic Games (RSSGs) are natural models for recursive systems involving both probabilistic and non-probabilistic actions.
Mihalis Yannakakis +3 more
core +1 more source

