Results 241 to 250 of about 962,783 (305)
Interfacial Effects of Nonionic and Anionic Surfactants on the Colloidal Stability of Graphene and Al<sub>2</sub>O<sub>3</sub> Nanoparticles in Jet-A/Sustainable Aviation Fuel Blends. [PDF]
ACS OmegaWadzer Y +3 more
europepmc +1 more source
Surfactant-Mediated Buchwald-Hartwig Coupling of Aliphatic Amines for the Synthesis of DNA-Encoded Libraries. [PDF]
Bioconjug ChemCarton TP, Graham JS, Waring MJ.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Fast Lines: a Span by Span Method
Computer Graphics Forum, 1999Straight line’s scan conversion and drawing is a major field in computer graphics. Algorithm’s time computation is very important. Nowadays, most of research papers suggest improvements of the DDA method that was first presented by J. Bresenham. But other approaches exist as well like combinatory analysis and linguistic methods.
Vincent Boyer 0001, Jean-Jacques Bourdin
openaire +1 more source
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95, 1995
Summary: Topological methods have yielded a variety of lower bounds and impossibility results for distributed computing. In this paper, we introduce a new tool for proving impossibility results, which is based on a core theorem of algebraic topology, the acyclic carrier theorem, and unifies, generalizes and extends earlier results.
Maurice Herlihy, Sergio Rajsbaum
openaire +3 more sources
Summary: Topological methods have yielded a variety of lower bounds and impossibility results for distributed computing. In this paper, we introduce a new tool for proving impossibility results, which is based on a core theorem of algebraic topology, the acyclic carrier theorem, and unifies, generalizes and extends earlier results.
Maurice Herlihy, Sergio Rajsbaum
openaire +3 more sources
[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 2002
A linear algebraic model of computation the span program, is introduced, and several upper and lower bounds on it are proved. These results yield applications in complexity and cryptography. The proof of the main connection, between span programs and counting branching programs, uses a variant of Razborov's general approximation method. >
Mauricio Karchmer, Avi Wigderson
openaire +1 more source
A linear algebraic model of computation the span program, is introduced, and several upper and lower bounds on it are proved. These results yield applications in complexity and cryptography. The proof of the main connection, between span programs and counting branching programs, uses a variant of Razborov's general approximation method. >
Mauricio Karchmer, Avi Wigderson
openaire +1 more source
Journal of the Institute of Actuaries, 1982
1. This paper originated with a sense of irritation at the way in which the graduation of age rates of mortality has become more and more complicated by the apparent determination to assume some underlying law of mortality, a law which could not possibly be deduced from observations in the past or present man-made conditions of dangerous living.
openaire +2 more sources
1. This paper originated with a sense of irritation at the way in which the graduation of age rates of mortality has become more and more complicated by the apparent determination to assume some underlying law of mortality, a law which could not possibly be deduced from observations in the past or present man-made conditions of dangerous living.
openaire +2 more sources
Journal of Graph Theory, 1987
AbstractFor a graph G with distinguished vertices u and v, we give a sufficient condition for the existence of a (u, v)‐trail containing every vertex of G.
openaire +2 more sources
AbstractFor a graph G with distinguished vertices u and v, we give a sufficient condition for the existence of a (u, v)‐trail containing every vertex of G.
openaire +2 more sources
SSRN Electronic Journal
This case report investigates the implementation of an evidence-based phonics program, UFLI Foundations, in San Jose Nuevo Palmar RC School, a rural, linguistically diverse, and resource-constrained primary school in Belize. The study addresses persistent literacy challenges among students who often speak Spanish, Kriol, or Indigenous languages at home,
openaire +1 more source
This case report investigates the implementation of an evidence-based phonics program, UFLI Foundations, in San Jose Nuevo Palmar RC School, a rural, linguistically diverse, and resource-constrained primary school in Belize. The study addresses persistent literacy challenges among students who often speak Spanish, Kriol, or Indigenous languages at home,
openaire +1 more source