background: thalassemia is one of the most common hereditary disorders and beta-thalassemia major is its severe form. the present study is concerned with the analysis of liver function, thyroid function and estimation of critical serum ions as well as hematological characteristics in beta-thalassemia patients and controls. subjects and methods: the study included 54 patients with beta-thalassem...

In this paper, some results of Singh, Gopalakrishna and Kulkarni (1970s) have been extended to higher order derivatives. It has been shown that, if $sumlimits_{a}Theta(a, f)=2$ holds for a meromorphic function $f(z)$ of finite order, then for any positive integer $k,$ $T(r, f)sim T(r, f^{(k)}), rrightarrowinfty$ if $Theta(infty, f)=1$ and $T(r, f)sim (k+1)T(r, f^{(k)}), rrightarrowinfty$ if $Th...

a‎s we know, developing mathematical models and numerical procedures that would appropriately treat and solve systems of linear equations where some of the system's parameters are proposed as fuzzy numbers is very important in fuzzy set theory. for this reason, many researchers have used various numerical methods to solve fuzzy linear systems. in this paper, we define the concepts of midpoint a...

the square map is one of the functions used in cryptography. for instance, the square map is used in rabin encryption scheme, block cipher rc6 and stream cipher rabbit, in different forms. in this paper, we study statistical properties of the output of the square map as a vectorial boolean function. we obtain the joint probability distribution of arbitrary number of the upper and the lower bits...

pls see pdf.

Constructs concerning reward and threat sensitivity can be organised in several ways (along with other ideas). Which conceptual organisation is used channels interpretations of phenomena ostensibly reflecting the sensitivities. For example, a two-mode organisation in which behavioural inhibition can follow either from threat sensitivity or from effortful control (planful restraint) yields an in...

A famous theorem due to Kleene [25] states that the regular languages admit two equivalent characterizations of entirely different nature, namely as the languages accepted by finite automata on the one hand, and as those described by regular expressions on the other hand. There are a few classical algorithms for converting finite automata into regular expressions. Those algorithms look differen...