Results 281 to 290 of about 872,020 (326)
Some of the next articles are maybe not open access.
Effects of polymer hardness on the abrasive wear resistance of thick organic offshore coatings
Progress in Organic Coatings, 2020For the first time, effects of polymer hardness on the abrasive wear resistance of organic coatings, designed for the corrosion protection of offshore wind power structures, are investigated at varying normal forces.
A W Momber, M Irmer
exaly +2 more sources
Generic Error SDP and Generic Error CVE [PDF]
IACR Cryptology ePrint Archive, 2023 This paper introduces a new family of CVE schemes built from generic errors (GE-CVE) and identifies a vulnerability therein. To introduce the problem, we generalize the concept of error sets beyond those defined by a metric, and use the set-theoretic ...
Felice Manganiello, Freeman Slaughter
semanticscholar +2 more sources
Generic Models for Group Actions [PDF]
IACR Cryptology ePrint Archive, 2023 We define the Generic Group Action Model (GGAM), an adaptation of the Generic Group Model to the setting of group actions (such as CSIDH). Compared to a previously proposed definition by Montgomery and Zhandry (ASIACRYPT\u2722), our GGAM more accurately ...
Julien Duman +5 more
semanticscholar +2 more sources
The physical properties of generic latanoprost ophthalmic solutions are not identical
Acta Ophthalmologica, 2017 PURPOSE: To compare various characteristics of Xalatan® and five generic latanoprost ophthalmic solutions.METHODS: Drop size, volume, pH values, buffer capacity, viscosity, hardness of bottles and costs were determined.
Miriam Kolko
exaly +2 more sources
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems [PDF]
Lecture Notes in Computer Science, 2008 The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography.
Andy Rupp +2 more
exaly +1 more source
On the Analysis of Cryptographic Assumptions in the Generic Ring Model [PDF]
Journal of Cryptology, 2012 The generic ring model considers algorithms that operate on elements of an algebraic ring by performing only the ring operations and without exploiting properties of a given representation of ring elements.
Jörg Schwenk +2 more
exaly +1 more source
Note on the hardness of generalized connectivity
Journal of Combinatorial Optimization, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shasha Li, Xueliang Li 0001
openaire +2 more sources
PCPs and the Hardness of Generating Synthetic Data
Journal of Cryptology, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jonathan R. Ullman, Salil P. Vadhan
openaire +2 more sources
Generating Hard Instances for MaxSAT
2009 39th International Symposium on Multiple-Valued Logic, 2009MaxSAT solvers have made tremendous progress in terms of performance in recent years. However, there has not been parallel progress in the generation of challenging benchmarks for studying the scaling behavior of solvers, and comparing their performance.
Ramón Béjar +3 more
openaire +1 more source
Hard Problem Generation for MKP
Sixth Mexican International Conference on Computer Science (ENC'05), 2006We developed generators that produce challenging MKP instances. Our approaches uses independently exponential distributions over a wide range to generate the constraint coefficients, and the corresponding average for each variable is used to calculate directly correlated coefficients in the objective function.
Maria A. Osorio, German Cuaya-Simbro
openaire +1 more source