Results 261 to 270 of about 116,703 (295)
Comparison between Legiolert and real time PCR in the detection of Legionella pneumophila from environmental water samples. [PDF]
PLoS OneArrigo I +12 more
europepmc +1 more source
On the Use of Elbow Plot Method for Class Enumeration in Factor Mixture Models. [PDF]
Appl Psychol MeasSen S, Cohen AS.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
American Journal of Clinical Pathology, 1978
A correlation of the enumeration of platelets in peripheral smears with platelet counts performed by a direct method is presented. A ratio of 1 platelet per oil-immersion field for every 21,000 platelets of the chamber count indicates the normal average range of platelets to be approximately 7--21 per oil-immersion field.
A P, Abbey, R R, Belliveau
openaire +2 more sources
A correlation of the enumeration of platelets in peripheral smears with platelet counts performed by a direct method is presented. A ratio of 1 platelet per oil-immersion field for every 21,000 platelets of the chamber count indicates the normal average range of platelets to be approximately 7--21 per oil-immersion field.
A P, Abbey, R R, Belliveau
openaire +2 more sources
Enumeration Degrees and Enumerability of Familes
Journal of Logic and Computation, 2009We study the enumerability of families relative to the enumeration degrees. It is shown that if a family of finite sets is e-reducible to every non-zero e-degree, then the family is computably enumerable (c.e). On the another hand, we will find a non-c.e. family which is e-reducible to all non-zero e-degree.
openaire +3 more sources
Strong Reducibilities of Enumerations and Partial Enumerated Algebras
Mathematical Logic Quarterly, 1988Let \(\nu_ 1\) and \(\nu_ 2\) be two enumerations of a set S and consider the total (respectively, partial) functions from S to S. If all such \(\nu_ 1\)-computable functions are \(\nu_ 2\)-computable and if there is a recursive function that maps each \(\nu_ 1\)-index of a \(\nu_ 1\)- computable function to a \(\nu_ 2\)-index of that function, then \(\
openaire +2 more sources
1997
Abstract In this chapter we present the basic problem of graphical enumeration-the enumeration of unlabelled graphs. In particular, we look at Pólya‘s Enumeration Theorem and some problems to which it can be applied. We then consider the enumeration of some other kinds of graphs.
openaire +1 more source
Abstract In this chapter we present the basic problem of graphical enumeration-the enumeration of unlabelled graphs. In particular, we look at Pólya‘s Enumeration Theorem and some problems to which it can be applied. We then consider the enumeration of some other kinds of graphs.
openaire +1 more source