Opyt primeneniya preparata Orsoten (orlistat)u bol'nykh ozhireniem

نویسندگان
چکیده

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

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

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

منابع مشابه

On the Preparata-like codes

A class of Preparata-like group codes is considered. It was suggested by Baker, van Lint and Wilson and re-stated in a different form by Ericson. We show that all such codes are inside the Hamming code providing its partition into the cosets of the Preparata-like codes. This partition induces 2-resolvable Steiner quadruple systems.

متن کامل

Franco P . Preparata N ° 3747

The minimum zone cylinder of a set of points in three dimensions is the cylindric crown deened by a pair of coaxial cylinders with minimal radial separation (width). In the context of tolerancing metrology, the set of points is nominally cylindrical, i.e., the points are known to lie in close proximity of a known reference cylinder. Using approximations which are valid only in the neighborhood ...

متن کامل

On Components of Preparata Codes

The paper considers the interrelation between i-components of an arbitrary Preparata-like code P and i-components of a perfect code C containing P . It is shown that each i-component of P can uniquely be completed to an i-component of C by adding a certain number of special codewords of C. It is shown that the set of vertices of P in a characteristic graph of an arbitrary i-component of C forms...

متن کامل

On weak isometries of Preparata codes

Let C1 and C2 be codes with code distance d. Codes C1 and C2 are called weakly isometric, if there exists a mapping J : C1 → C2, such that for any x, y from C1 the equality d(x, y) = d holds if and only if d(J(x), J(y)) = d. Obviously two codes are weakly isometric if and only if the minimal distance graphs of these codes are isomorphic. In this paper we prove that Preparata code of length n ≥ ...

متن کامل

On the inequivalence of generalized Preparata codes

mum weight 8. By Theorem 3 there are only two possibiliPI ties which we must consider. The first of these is X = 0, ]Y] > 6. In this case Y corresponds to a codeword in q, [31 so ]Y ] > 8 by Lemma 4. The second possibility is 1x1 = 2, ]Y] > 4. The automorphisms a) and c) of Theorem 2 show 141 that we may assume without loss of generality that X = 151 (0, l}. From Definition 2 c) and d) we find ...

متن کامل

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


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

ژورنال

عنوان ژورنال: Obesity and metabolism

سال: 2010

ISSN: 2306-5524,2071-8713

DOI: 10.14341/2071-8713-5278