Results 1  10
of
489
Conjunction search revisited
 Journal of Experimental Psychology: Human Perception and Performance
, 1990
"... Search for conjunctions of highly discriminable features can be rapid or even parallel. This article explores, three possible accounts based on (a) perceptual segregation, (b) conjunction detectors, and (c) inhibition controlled separately by two or more distractor features. Search rates for conjunc ..."
Abstract

Cited by 229 (3 self)
 Add to MetaCart
Search for conjunctions of highly discriminable features can be rapid or even parallel. This article explores, three possible accounts based on (a) perceptual segregation, (b) conjunction detectors, and (c) inhibition controlled separately by two or more distractor features. Search rates
Polly Cracker, Revisited
, 2011
"... In this work, we initiate the formal treatment of cryptographic constructions (“Polly Cracker”) based on the hardness of computing remainders modulo an ideal. We start by formalising and studying the relation between the ideal remainder problem and the problem of computing a Gröbner basis. We show b ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In this work, we initiate the formal treatment of cryptographic constructions (“Polly Cracker”) based on the hardness of computing remainders modulo an ideal. We start by formalising and studying the relation between the ideal remainder problem and the problem of computing a Gröbner basis. We show
Minimum energy mobile wireless networks revisited
 In IEEE International Conference on Communications (ICC
, 2001
"... Energy conservation is a critical issue in designing wireless ad hoc networks, as the nodes are powered by batteries only. Given a set of wireless network nodes, the directed weighted transmission graph Gt has an edge uv if and only if node v is in the transmission range of node u and the weight of ..."
Abstract

Cited by 170 (6 self)
 Add to MetaCart
of uv is typically defined as II,,vll + c for a constant 2 <_ t ~ < 5 and c> O. The minimum power topology Gm is the smallest subgraph of Gt that contains the shortest paths between all pairs of nodes, i.e., the union of all shortest paths. In this paper, we described a distributed position
1 Noncommutative Polly Cracker and preliminaries
, 2008
"... from noncommutative algebra The noncommutative Polly Cracker cryptosystems were developed by T.Rai in his Ph.D. dissertation ([1]), and rely on the fact that there are ideals of noncommutative algebras over finite fields that have infinite reduced Groebner bases. First let us briefly present notatio ..."
Abstract
 Add to MetaCart
from noncommutative algebra The noncommutative Polly Cracker cryptosystems were developed by T.Rai in his Ph.D. dissertation ([1]), and rely on the fact that there are ideals of noncommutative algebras over finite fields that have infinite reduced Groebner bases. First let us briefly present
Microsoft Word  Polly Chow.doc
"... Ligation experiments were conducted to examine the ligation efficiencies of HindIIIdigested pUC19 and NdeI digested pUC19 vectors by T4 DNA ligase. HindIIIdigested pUC19 was shown to ligate more efficiently than NdeIdigested pUC19. Upon close examination, HindIIIdigested pUC19 could also ligate ..."
Abstract
 Add to MetaCart
(Invitrogen), and autoclaved, dH 2 O. The samples were incubated at 37ºC for 1.5 hours and then deactivated at 65ºC for 20 minutes. pUC19 DNA was also digested in the same manner. Vector Dephosphorylation. pUC19 was dephosphorylated to reduce the chances of self religation. BamHI/pUC19 was incubated with 2
Countering ChosenCiphertext Attacks Against Noncommutative Polly CrackerType Cryptosystems
, 2005
"... In [2], Stanislav Bulygin presents a chosenciphertext attack against certain instances of noncommutative polly crackertype cryptosystems which were proposed in [7] and [9]. In this article, we present generalized versions of this attack, which can be used against virtually all polly crackertyp ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In [2], Stanislav Bulygin presents a chosenciphertext attack against certain instances of noncommutative polly crackertype cryptosystems which were proposed in [7] and [9]. In this article, we present generalized versions of this attack, which can be used against virtually all polly cracker
revisited
"... Restoration of a normal calcium concentration in the perfusate oj isolated hearts after a short period of calciumfree perjusion may result in irreversible cell damage (calcium paradox). We have compared the calcium paradox in rat and frog hearts Perfusion with zero calcium for 8 mm at 37"C pre ..."
Abstract
 Add to MetaCart
Restoration of a normal calcium concentration in the perfusate oj isolated hearts after a short period of calciumfree perjusion may result in irreversible cell damage (calcium paradox). We have compared the calcium paradox in rat and frog hearts Perfusion with zero calcium for 8 mm at 37"C
revisited
"... Neurogenic inflammation: mechanisms and species differences The term ‘neurogenic inflammation ’ refers to a series of proinflammatory responses produced by the stimulation of peripheral terminals of a subset of primary sensory neurons and the subsequent release of the neuropeptides, calcitonin gen ..."
Abstract
 Add to MetaCart
citonin generelated peptide (CGRP) and the tachykinins, substance P (SP) and neurokinin A (NKA) [1]. The neurons that produce inflammation comprise a heterogeneous cell population with Adelta and C fibres, defined as polymodal nociceptors because they sense thermal, chemical and highthreshold mechanical
Defective coloring revisited
 Journal of Graph Theory
, 1997
"... A graph is (k; d)colorable if one can color the vertices with k colors such that no vertex is adjacent to more than d vertices of its same color. In this paper we investigate the existence of such colorings in surfaces and the complexity of coloring problems. It is shown that a toroidal graph is (3 ..."
Abstract

Cited by 31 (0 self)
 Add to MetaCart
is (3, 2) and (5, 1)colorable, and that a graph of genus γ is (γ=(d + 1) + 4; d)colorable, where γ is the maximum chromatic number of a graph embeddable on the surface of genus γ. It is shown that the (2; k)coloring, for k 1; and the (3, 1)coloring problems are NPcomplete even for planar graphs
PYTHAGORAS REVISITED
"... A Pythagorean triplet consists of three numbers (a, b, c) in which a 2 + b 2 = c 2. Such triplets are generated by m and n where m 2 n 2 = a, 2mn = b, and m 2 + n 2 = c. What are the conditions that in such triplets a + b = L 2, as in (9, 40, ..."
Abstract
 Add to MetaCart
A Pythagorean triplet consists of three numbers (a, b, c) in which a 2 + b 2 = c 2. Such triplets are generated by m and n where m 2 n 2 = a, 2mn = b, and m 2 + n 2 = c. What are the conditions that in such triplets a + b = L 2, as in (9, 40,
Results 1  10
of
489