Background: Many Red Blood Cell (RBC) indices have been developed based on mathematical formulae to discriminate beta-thalassemia trait (βTT) from iron deficiency anemia (IDA). The latter two conditions represent the most common causes of microcytic hypochromic anemia in Egypt. This study aimed To evaluate the diagnostic reliability of 24 published discriminant indices for differentiating βTT f...

The concept of decision-aiding ranges were introduced to improve diagnostic efficiency. The clinical uncertainty in distinguishing borderline cases of hyperthyroidism and hypothyroidism among 1559 consecutive requests for thyroid function tests was 47%. This was reduced to 22% by using the free thyroxine index and to under 2% by using specific tests determined by the decision-aiding ranges.

We study the phase space dynamics of multi–dimensional symplectic maps, using the method of the Generalized Alignment Index (GALI). In particular, we investigate the behavior of the GALI for a system of N = 3 coupled standard maps and show that it provides an efficient criterion for rapidly distinguishing between regular and chaotic motion.

Automatic analysis of tongue movement in large existing cineradiographic databases can provide valuable information to understood speech production. We describe here a method for semi-automatic extraction of articulatory information from video observation in order to derive quasi-automatically a geometrical parameterization of the vocal tract movements. The algorithm starts with a limited manua...

BACKGROUND Infantile hepatic hemangioendothelioma (IHH) and hepatoblastoma (HBL) are respectively the most common benign and malignant liver tumors in children. OBJECTIVES To study the clinical manifestations and the ultrasound features of the pediatric patients for distinguishing IHH from HBL. PATIENTS AND METHODS Between 2002 and 2012, thirteen children with IHH and 38 children with HBL u...

This paper analyses the stream cipher SSC2 [ZCC00]. We describe some weaknesses and attacks exploiting these weaknesses. The strongest attack needs about 2 words of known key stream and has a time complexity of about 2.

Rabbit stream cipher is one of the finalists of eSTREAM project which uses 128-bit secret keys. Prior to us, the attacks on Rabbit has been all focused on the bias analysis and the best result showed the distinguishing attack with complexity 2. Our analysis in this paper, is based on chosen IV analysis on reduced N-S round of Rabbit though using multi cube tester. For this purpose we show for a...

A graph G is said to be d-distinguishable if there is a d-coloring of G which no non-trivial automorphism preserves. That is, 9χ : G !f1; : : : ;dg; 8φ 2 Aut(G)nfidg;9v;χ(v) 6= χ(φ(v)): It was conjectured that if jGj> jAut(G)j and the Aut(G) action on G has no singleton orbits, then G is 2-distinguishable. We give an example where this fails. We partially repair the conjecture by showing that w...

We give interpretations of some known key agreement protocols in the framework of category theory and in this way we give a method of constructing of many new key agreement protocols.

In this paper we will provide two linear approximating for the stream cipher Salsa20, the both are probable to form distinguishing attack with about 64 2 blocks of keystream.