Results 91 to 100 of about 5,503 (263)
Frequent sweetened beverage consumption is associated with accelerated biological aging in a large Chinese population. Five gut microbial genera are consistently enriched in both frequent sweetened beverage consumers and individuals with accelerated aging and show significant mediating effects, suggesting a potential microbiota‐related pathway linking ...
Yuwei Shi +14 more
wiley +1 more source
Efficient and Low-Cost Modular Polynomial Multiplier for WSN Security
Wireless Sensor Network (WSN) technology has constrained computing resources that require efficient and low-cost cryptographic hardware to provide security services, particularly when dealing with large modular polynomial multiplication in cryptography ...
Fariha Haroon, Hua Li
doaj +1 more source
Algorithms and Data Structures for Sparse Polynomial Arithmetic
We provide a comprehensive presentation of algorithms, data structures, and implementation techniques for high-performance sparse multivariate polynomial arithmetic over the integers and rational numbers as implemented in the freely available Basic ...
Mohammadali Asadi +3 more
doaj +1 more source
Real‐Time Investigation of Interfacial Evolution in Electrochemical Energy Storage Systems via EQCM
Understanding the electrode/electrolyte interface (EEI) is crucial for supercapacitors and batteries. EQCM, by enabling real‐time monitoring of mass changes during charge–discharge cycles, has evolved into a vital method for analysis of EEI. It provides important insights into charge‐storage mechanisms, electrode structural evolution, ion‐transfer ...
Zixuan Wang, Situo Cheng, Guang Feng
wiley +1 more source
FPGA multi-unit parallel optimization and implementation of post-quantum cryptography CRYSTALS-Kyber
In lattice-based post-quantum cryptography, polynomial multiplication is complicated and time-consuming.In order to improve the computational efficiency of lattice cryptography in practical applications, an FPGA multi-unit parallel optimization and ...
Bin LI +3 more
doaj
Practical fast polynomial multiplication [PDF]
The “fast” polynomial multiplication algorithms for dense univariate polynomials are those which are asymptotically faster than the classical O(N2) method. These “fast” algorithms suffer from a common defect that the size of the problem at which they start to be better than the classical method is quite large; so large, in fact that it is impractical ...
openaire +1 more source
To accelerate the inverse design of heterostructured metal matrix composites, a closed‐loop scientific machine learning framework integrates continual learning prediction with NSGA‐II‐PMCP optimization. The framework maps microstructural descriptors to strength, toughness, and modulus, expands high‐quality Pareto solutions, and guides experimentally ...
Zhiyan Zhong +11 more
wiley +1 more source
Automation and Active Learning for the Multi‐Objective Optimization of Antibody Formulations
Successful antibody formulation necessitates balancing factors such as thermal stability, colloidal stability, and viscosity across a vast excipient design space. This work integrates robotic liquid handling, high‐throughput biophysical characterization, and multi‐objective Bayesian optimization in an iterative closed‐loop Design‐Build‐Test‐Learn cycle.
D. Christopher Radford +3 more
wiley +1 more source
Number Theoretic Transform (NTT) enables speeding up polynomial multiplications, thereby accelerating the implementation of lattice-based post-quantum cryptography (PQC) algorithms.
Duc-Thuan Dam +5 more
doaj +1 more source
A Unifying Thermodynamic Model for Phase Separation and Aging of Biopolymers
Phase separation and aging of intrinsically disordered proteins are placed in a unifying framework. A thermodynamically consistent time‐dependent version of associating‐polymer theory shows how the processes are intricately coupled. Assuming aging to occur through interacting sites resulting from reversible conformational transitions, the model ...
Jasper J. Michels +2 more
wiley +1 more source

