Results 81 to 90 of about 243,099 (282)
On the Security of Group Ring Learning with Errors
We propose a dimension-reducing transformation on Group Ring Learning with Errors (GRLWE) samples. We exhibit an efficiently computable isomorphism which takes samples defined over the group rings used in the construction of GRLWE to twice as many samples defined over matrix rings, in half the dimension.
Andrew Mendelsohn +2 more
openaire +1 more source
Nonparametric Detection of Geometric Structures over Networks
Nonparametric detection of existence of an anomalous structure over a network is investigated. Nodes corresponding to the anomalous structure (if one exists) receive samples generated by a distribution q, which is different from a distribution p ...
Liang, Yingbin +2 more
core +1 more source
What Do Large Language Models Know About Materials?
If large language models (LLMs) are to be used inside the material discovery and engineering process, they must be benchmarked for the accurateness of intrinsic material knowledge. The current work introduces 1) a reasoning process through the processing–structure–property–performance chain and 2) a tool for benchmarking knowledge of LLMs concerning ...
Adrian Ehrenhofer +2 more
wiley +1 more source
Multi-Key Fully Homomorphic Encryption (MKFHE) offers a powerful solution for secure multi-party computations, where data encrypted under different keys can be jointly computed without decryption.
Liang Zhou, Ruwei Huang, Bingbing Wang
doaj +1 more source
A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions
This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice +2 more
wiley +1 more source
Assessing the feasibility of quantum learning algorithms for noisy linear problems
Quantum algorithms for solving noisy linear problems are reexamined, under the same assumptions taken from the existing literature. The findings of this work include on the one hand extended applicability of the quantum Fourier transform to the ring ...
Minkyu Kim, Panjin Kim
doaj +1 more source
Dynamic Group Key Exchange Protocol With Lattice Trapdoor and Re-Encryption Mechanisms
Post-quantum group key exchange protocols have become an increasingly critical area of research due to the potential threat quantum computers pose to classical cryptographic schemes. Traditional group key exchange protocols, often based on Diffie-Hellman
Narn-Yih Lee, Yuan-Ting Tsai
doaj +1 more source
Herein, environmental scanning electron microscopy (ESEM) is discussed as a powerful extension of conventional SEM for life sciences. By combining high‐resolution imaging with variable pressure and humidity, ESEM allows the analysis of untreated biological materials, supports in situ monitoring of hydration‐driven changes, and advances the functional ...
Jendrian Riedel +6 more
wiley +1 more source
Training a perceptron by a bit sequence: Storage capacity
A perceptron is trained by a random bit sequence. In comparison to the corresponding classification problem, the storage capacity decreases to alpha_c=1.70\pm 0.02 due to correlations between input and output bits.
I. Kanter +5 more
core +2 more sources
Microstructure Evolution of a VMnFeCoNi High‐Entropy Alloy After Synthesis, Swaging, and Annealing
The synthesis and processing (rotary swaging and annealing) of the novel VMnFeCoNi alloy is investigated, alongside the estimation of the grain size effect on hardness. Analysis of a wide grain size range of recrystallized microstructures (12–210 µm) reveals a low annealing twin density.
Aditya Srinivasan Tirunilai +6 more
wiley +1 more source

