Results 1  10
of
1,902
The Ferric Reducing Ability of Plasma (FRAP) as a measure of antioxidant power: The FRAP assay.
 Anal. Biochem.,
, 1996
"... destroy potential oxidants, and to scavenge ROS. Thus, A simple, automated test measuring the ferric reducoxidative stressinduced tissue damage is minimized. ing ability of plasma, the FRAP assay, is presented as However, an absolute or relative deficiency of antioxia novel method for assessing & ..."
Abstract

Cited by 436 (0 self)
 Add to MetaCart
destroy potential oxidants, and to scavenge ROS. Thus, A simple, automated test measuring the ferric reducoxidative stressinduced tissue damage is minimized. ing ability of plasma, the FRAP assay, is presented as However, an absolute or relative deficiency of antioxia novel method for assessing
Cycles and Stability (full version)
, 2006
"... We prove a number of Turán and Ramsey type stability results for cycles, in particular, the following one: Let n 4, 0 < 1=2 1=2n, and the edges of Kb(2 )nc be 2colored so that no mononchromatic Cn exists. Then, for some q 2 ((1 )n 1; n) ; we may drop a vertex v so that in Kb(2 )nc v one o ..."
Abstract
 Add to MetaCart
of the colors induces Kq;b(2 )ncq1; while the other one induces Kq [Kb(2 )ncq1: We also derive the following Ramsey type result. If n is su ¢ ciently large and G is a graph of order 2n 1; with minimum degree (G) 2 106n; then for every 2coloring of E (G) one of the colors contains cycles Ct for all t 2 [3
Behavioral theories and the neurophysiology of reward,
 Annu. Rev. Psychol.
, 2006
"... ■ Abstract The functions of rewards are based primarily on their effects on behavior and are less directly governed by the physics and chemistry of input events as in sensory systems. Therefore, the investigation of neural mechanisms underlying reward functions requires behavioral theories that can ..."
Abstract

Cited by 187 (0 self)
 Add to MetaCart
. We know that the same animal will salivate also when it hears a bell that has repeatedly sounded a few seconds before the sausage appears, as if the bell induced the wellknown, pleasant anticipation of the desired sausage. Changing slightly the scenery, imagine you are in Cambridge, walk down Mill
Efficient Testing of Large Graphs
 Combinatorica
"... Let P be a property of graphs. An test for P is a randomized algorithm which, given the ability to make queries whether a desired pair of vertices of an input graph G with n vertices are adjacent or not, distinguishes, with high probability, between the case of G satisfying P and the case that it h ..."
Abstract

Cited by 176 (47 self)
 Add to MetaCart
properties admit an test. In this paper we make a first step towards a logical characterization of all testable graph properties, and show that properties describable by a very general type of coloring problem are testable. We use this theorem to prove that first order graph properties not containing a
COLOR*
, 1977
"... Abstract: We discuss how multiparticle jets which originate from quarks, multiquarks, hadrons, or gluons can be distinguished by their (a) quantum number retention, (b) leading particle distributions, and (c) hadronic multiplicity. The possible quantitative connection between initial color separatio ..."
Abstract
 Add to MetaCart
Abstract: We discuss how multiparticle jets which originate from quarks, multiquarks, hadrons, or gluons can be distinguished by their (a) quantum number retention, (b) leading particle distributions, and (c) hadronic multiplicity. The possible quantitative connection between initial color
Testing KColorability
 SIAM J. Discrete Math
, 1999
"... Let G be a graph on n vertices and suppose that at least n edges have to be deleted from it to make it kcolorable. It is shown that in this case most induced subgraphs of G on ck ln k= vertices are not kcolorable, where c > 0 is an absolute constant. If G is as above for k = 2, then most ..."
Abstract

Cited by 50 (12 self)
 Add to MetaCart
Let G be a graph on n vertices and suppose that at least n edges have to be deleted from it to make it kcolorable. It is shown that in this case most induced subgraphs of G on ck ln k= vertices are not kcolorable, where c > 0 is an absolute constant. If G is as above for k = 2, then most
Anoxiainduced activation of ATPsensitive Kq channels in guinea pig ventricular cells and its modulation by glycolysis
, 1996
"... q.Objective: Exposure to anoxia has been reported to activate ATPsensitive potassium K channels in isolated ventricularATP myocytes. We aimed to investigate the mechanisms underlying the anoxiainduced activation of Kq channels. Methods: Guinea pigATP ventricular myocytes were isolated using colla ..."
Abstract
 Add to MetaCart
q.Objective: Exposure to anoxia has been reported to activate ATPsensitive potassium K channels in isolated ventricularATP myocytes. We aimed to investigate the mechanisms underlying the anoxiainduced activation of Kq channels. Methods: Guinea pigATP ventricular myocytes were isolated using
Modifications of myocardial Naq,KqATPase isoforms and NaqrCa2q exchanger in aldosteronersaltinduced hypertension in guinea pigs
, 1997
"... Objective: The aim of this study was to determine whether changes in cardiac Naq,KqATPase subunits and NaqrCa2q exchanger .expression are regulated in aldosteronesalt hypertensive guinea pigs. Methods: Guinea pigs GP were unilaterally nephrectomized and .randomized into three groups aldosteronesa ..."
Abstract
 Add to MetaCart
Objective: The aim of this study was to determine whether changes in cardiac Naq,KqATPase subunits and NaqrCa2q exchanger .expression are regulated in aldosteronesalt hypertensive guinea pigs. Methods: Guinea pigs GP were unilaterally nephrectomized and .randomized into three groups aldosterone
Star coloring of graphs,
 J. Graph Theory
, 2004
"... a b s t r a c t For graphs of bounded maximum degree, we consider acyclic timproper colourings, that is, colourings in which each bipartite subgraph consisting of the edges between two colour classes is acyclic, and each colour class induces a graph with maximum degree at most t. We consider the s ..."
Abstract

Cited by 41 (1 self)
 Add to MetaCart
a b s t r a c t For graphs of bounded maximum degree, we consider acyclic timproper colourings, that is, colourings in which each bipartite subgraph consisting of the edges between two colour classes is acyclic, and each colour class induces a graph with maximum degree at most t. We consider
A characterization of the (natural) graph properties testable with onesided error
 Proc. of FOCS 2005
, 2005
"... The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of propertytesting. Our main result in this paper is a solution of an important special case of this general problem; Call a property tester oblivious if its decis ..."
Abstract

Cited by 107 (18 self)
 Add to MetaCart
] of the graphpartitioning problems that are testable with onesided error, the induced vertex colorability properties of [3], the induced edge colorability properties of [14], a transformation from twosided to onesided error testing [21], as well as a recent result about testing monotone graph properties [10
Results 1  10
of
1,902