Results 101 to 110 of about 103,237 (307)
We develop a data‐driven method to derive the mathematical expressions of the Flory–Huggins interaction parameter χ for the swelling behavior of temperature–responsive hydrogels. Starting from initial assumptions of χ, our workflow combines Bayesian optimization, Flory–Rehner theory, and symbolic regression to generate candidate χ expressions.
Yawen Wang +2 more
wiley +1 more source
Optimal binary linear codes of length ⩽30
For n⩽30, we determine when an [n,k,d] (binary linear) code exists, and we classify optimal [n,k,d] codes, where by optimal we mean that no [n−1,k,d],[n+1,k+1,d], or [n+1,k,d+1] code exists.
Jaffe, David B., David B. Jaffe
core +1 more source
Fatigue Crack Initiation and Growth in Nanocrystalline Ni at Multiple Length‐Scales
Overview of miniaturized in situ SEM fatigue setup and resultant fatigue crack growth data for nanocrystalline Ni. The presented study focuses on the analysis of fatigue crack growth rate (FCGR) in focused ion beam‐notched microcantilevers prepared from nanocrystalline (NC) Ni as a model material.
Igor Moravcik +7 more
wiley +1 more source
On perturbation of binary linear codes
We present new codes by perturbation of rows of the generating matrix of a given linear code. Some properties of the perturbed linear codes are given.
Das, P. K., Vashisht, L. K.
openaire +2 more sources
Tailoring Functional Properties of Ti–Ni–Cu Shape Memory Alloy Thin Films for MEMS Actuators
A comprehensive study of critical parameters required to develop well‐performing Ti–Ni–Cu thin film shape memory alloy microactuators is provided. Materials science and device integration aspects are integrated by addressing structural and physical relationships using complementary characterization techniques as well as a practical fabrication solution
Elaheh Akbarnejad +6 more
wiley +1 more source
Huffman Tree and Binary Conversion for Efficient and Secure Data Encryption and Decryption
This study proposes the Huffman Tree and Binary Conversion (HTB) which is a preprocessing algorithm to transform the Huffman tree into binary representation before the encryption process.
Suchart Khummanee +4 more
doaj +1 more source
Improved SM3 Algorithm Based on Error-correcting Code
Cryptanalysts now can effectively find the collisions of MD5, SHA1 and other international hash algorithms in a short time. Increasing entropy to enhance the randomness of hash value is an effective way to improve the anti-collision performance of hash ...
Minghui ZHENG +3 more
doaj
PASTA‐ELN: Simplifying Research Data Management for Experimental Materials Science
Research data management faces ongoing hurdles as many ELNs remain complex and restrictive. PASTA‐ELN offers an open‐source, cross‐platform solution that prioritizes simplicity, offline access, and user control. Its in tuitive folder structure, modular Python add‐ons, and open formats enable seamless documentation, FAIR data practices, and easy ...
S. Brinckmann, G. Winkens, R. Schwaiger
wiley +1 more source
Polyhedral parallelization of binary code
International audienceMany automatic software parallelization systems have been proposed in the past decades, but most of them are dedicated to source-to-source transformations. This paper shows that parallelizing executable programs is feasible, even if
Pradelle, Benoit +2 more
core +1 more source
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

