Results 11 to 20 of about 1,058,969 (248)
Heteroatom-Mediated Covalent Organic Framework Membranes With Nitrogen-Enriched Nanochannels for Efficient Desalination. [PDF]
Adv Sci (Weinh)Heteroatom precursor engineering serves as a molecular‐level strategy to tailor hydrazide monomer reactivity and diffusion kinetics, enabling controlled assembly of highly crystalline COF membranes with ultramicroporous channels. The nitrogen‐enriched nanochannels deliver high water/ion selectivity via simultaneous water transport acceleration and ion ...
Hu G +8 more
europepmc +2 more sources
Design of a Universal Sieving Machine [PDF]
, 2023 The design of a universal sieving machine was explored to meet the diverse needs of sieving applications across various industries. The machine incorporates various mechanisms to enable it to handle different types of materials (e.g., cassava flakes ...
S. E., Abonyi +3 more
core
Effects of Dry and Wet Sieving of Soil on Identification and Interpretation of Microbial Community Composition [PDF]
, 2016 Soil aggregates are microhabitats for microorganisms, and directly influence microorganisms that live within and are influenced by microorganisms in return.
Van der Zaan, B +17 more
core +1 more source
Does quantum lattice sieving require quantum RAM? [PDF]
In this paper, we study the requirement for quantum random access memory (QRAM) in quantum lattice sieving, a fundamental algorithm for lattice-based cryptanalysis.
Jeonghoon Lee +4 more
core +5 more sources
Simultaneous Sieve Inference for Time-Inhomogeneous Nonlinear Time Series Regression
, 2021 In this paper, we consider the time-inhomogeneous nonlinear time series regression for a general class of locally stationary time series. On one hand, we propose sieve nonparametric estimators for the time-varying regression functions which can achieve the min-max optimal rate.
Ding, Xiucai, Zhou, Zhou
openaire +2 more sources
Evolutionary Techniques in Lattice Sieving Algorithms [PDF]
, 2019 \u3cp\u3eLattice-based cryptography has recently emerged as a prominent candidate for secure communication in the quantum age. Its security relies on the hardness of certain lattice problems, and the inability of known lattice algorithms, such as lattice
Thijs Laarhoven, Laarhoven, Thijs
core +1 more source
Quantum sieving for code-based cryptanalysis and its limitations for ISD [PDF]
Sieving using near-neighbor search techniques is a well-known method in lattice-based cryptanalysis, yielding the current best runtime for the shortest vector problem in both the classical and quantum setting.
Engelberts, L. (Lynn) +2 more
core +7 more sources
On Nonlinear Polynomial Selection and Geometric Progression (mod N) for Number Field Sieve [PDF]
, 2011 The general number field sieve (GNFS) is asymptotically the fastest known factoring algorithm. One of the most important steps of GNFS is to select a good polynomial pair.
Soonhak Kwon, Gooc Hwa Jo, Namhun Koo
core +1 more source
Advanced Materials Technologies, EarlyView.High‐aspect‐ratio low‐melting‐point alloy inclusions are embedded within multilayer silicone laminates to create thermally programmable stiffness. Sequential activation of alloy‐rich layers produces four distinct mechanical states and reconfigures tendon‐driven actuator trajectories under the same load.
Palpolage Don Shehan Hiroshan Gunawardane +4 more
wiley +1 more source
Progressive Lattice Sieving [PDF]
, 2018 Most algorithms for hard lattice problems are based on the principle of rank reduction: to solve a problem in a d-dimensional lattice, one first solves one or more problem instances in a sublattice of rank d–1, and then uses this information to find a ...
Thijs Laarhoven +3 more
core +3 more sources