Results 221 to 230 of about 198,228 (265)
Some of the next articles are maybe not open access.

Related searches:

LOVE a Pairing

2021
The problem of securely outsourcing the computation of a bilinear pairing has been widely investigated in the literature. Designing an efficient protocol with the desired functionality has, however, been an open challenge for a long time. Recently, Di Crescenzo et al.
Diego F. Aranha   +2 more
openaire   +2 more sources

To pair or not to pair: chromosome pairing and evolution

Current Opinion in Plant Biology, 1998
Chromosome pairing in wild-type wheat closely resembles the process in both yeast and Drosophila. The recent characterisation of a mutant Ph1 wheat and the observation that chromosome pairing in the absence of Ph1 more closely resembles that of mammals and maize has shed light on the evolution of chromosome pairing in the cereals.
openaire   +2 more sources

Pair clustering and giant pairing resonances

Physical Review C, 1985
Giant pairing resonances, i.e., collective two-particle excitations built upon high-lying single-particle states, are studied in the lead region. Two-particle 0/sup +/ states (T = 1) outside the /sup 208/Pb core are found to be clustered in the nuclear surface.
, Herzog, , Liotta, , Sibanda
openaire   +2 more sources

A Pair of “ACEs”

Journal of Dental Research, 2021
The emergence of the COVID-19 viral pandemic has generated a renewed interest in pharmacologic agents that target the renin angiotensin system (RAS). Angiotensin-converting enzyme 1 (ACE1) inhibitors decrease the synthesis of angiotensin II (Ang II) from its precursor angiotensin I and inhibit the breakdown of bradykinin, while Ang II receptor blockers
E.V. Hersh   +4 more
openaire   +2 more sources

Optimal Pairings

IEEE Transactions on Information Theory, 2010
In this paper, we introduce the concept of an optimal pairing, which by definition can be computed using only log 2 r/?(k) basic Miller iterations, with r the order of the groups involved and k the embedding degree. We describe an algorithm to construct optimal ate pairings on all parametrized families of pairing friendly elliptic curves.
openaire   +2 more sources

STABLE PAIRS

International Journal of Algebra and Computation, 2010
For a finite semigroup S and pseudovariety V, (Y, T) is a V-stable pair of S iff Y ⊆ S, T ≤ S and for any relational morphism R : S ⇝ V with V ∈ V there exists a v ∈ V such that Y ⊆ R-1(v) and T ≤ R-1( Stab (v)). X ≤ S is stable if it is generated by an [Formula: see text]-chain {ai} with aiaj = ai for j < i. Given a relation R : S ⇝ A ∈ A (where A
openaire   +1 more source

On Pairs and Tuples

Mathematical Logic Quarterly, 1991
The paper investigates definitions of k-tuples (k\(\geq 2)\) which are of the following form: \(=\{\{x_ 1\}\cup C_ 1,...,\{x_ k\}\cup C_ k\}\). A (rather artificial) definition adequate for any \(k\geq 2\) is given. However, if some natural constraints are satisfied then \(k=2\) and only the classical definitions of pairs by Hausdorff (1914), Wiener ...
openaire   +2 more sources

On Kalimullin pairs

Computability, 2016
We study Kalimullin pairs, a definable class (of pairs) of enumeration degrees that has been used to give first-order definitions of other important classes and relations, including the enumeration jump and the total enumeration degrees. We show that the global definition of Kalimullin pairs is also valid in the local structure of the enumeration ...
Mingzhong Cai   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy