Agglutination of H. periussis Using Concavity Slides

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Agglutination of H. pertussis using concavity slides.

The agglutination reaction is the easiest to perform and is probably the most widely used of the serological tests for the detection of H. pertussis antibodies. Two methods have been used, a slide test and a tube test. A comparison of these techniques has been made by a number of workers (Evans and Maitland, 1939; Mishulow, 1942; Powell and Jamieson, 1942; Powell, 1944; and DeGara and Mayer, 19...

متن کامل

h-Vectors of matroids and logarithmic concavity

Article history: Received 11 November 2012 Accepted 4 November 2014 Available online 13 November 2014 Communicated by Ezra Miller MSC: 05B35 52C35

متن کامل

Shape Representation Using Concavity Graphs

In this paper, a new graph data structure for 2-D shape representation is proposed. The new structure is called a concavity graph, and is an evolution from the already known “concavity tree”. Even though a concavity graph bears a fundamental resemblance to a concavity tree, the former is able to describe the shape of multiple objects in an image and their spatial configuration, and is hence inh...

متن کامل

Compressing 2-D Shapes Using Concavity Trees

Concavity trees have been known for quite some time as structural descriptors of 2-D shape; however, they haven’t been explored further until recently. This paper shows how 2-D shapes can be concisely, but reversibly, represented during concavity tree extraction. The representation can be exact, or approximate to a pre-set degree. This is equivalent to a lossless, or lossy compression of the im...

متن کامل

Fast approximate convex decomposition using relative concavity

Approximate convex decomposition (ACD) is a technique that partitions an input object into approximately convex components. Decomposition into approximately convex pieces is both more efficient to compute than exact convex decomposition and can also generate a more manageable number of components. It can be used as a basis of divide-and-conquer algorithms for applications such as collision dete...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Clinical Pathology

سال: 1951

ISSN: 0021-9746

DOI: 10.1136/jcp.4.4.487