Background: Anemia is a common finding in patients with renal failure disease and it is, primarily, due to reduced production of iron and erythropoietin. Therefore, the aim of current study was to evaluate the relationship between serum level of hepcidin 25, on the one hand, and levels of serum iron, total iron-binding capacity, serum erythropoietin and transferrin saturation% in Iraqi male patients undrgoning haemodialysis.. Methods: Serum from75 males in the end stage of hemodialysis, as group one, and 25 Iraqi healthy malecontrols, as group two, were recruited in this study. Results: Data from current study showed significant increase in hepcidin 25 and significant decrease in serum iron, total iron-binding capacity, transferrin saturati

The state and partial level densities were calculated using the corresponding formulas that are obtained in the frame work of the exciton model with equidistant spacing model (ESM) and non-ESM (NESM). Different corrections have been considered, which are obtained from other nuclear principles or models. These corrections are Pauli Exclusion Principle, surface effect, pairing effect, back shift due to shell effect and bound state effect . They are combined together in a composite formula with the intention to reach the final formula. One-component system at energies less than 100 MeV and mass number range (50-200) is assumed in the present work. It was found that Williams, plus spin formula is the most effective approach to the composite

This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t

Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh

An Optimal Algorithm for HTML Page Building Process

In many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally th

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

In this research a new system identification algorithm is presented for obtaining an optimal set of mathematical models for system with perturbed coefficients, then this algorithm is applied practically by an “On Line System Identification Circuit”, based on real time speed response data of a permanent magnet DC motor. Such set of mathematical models represents the physical plant against all variation which may exist in its parameters, and forms a strong mathematical foundation for stability and performance analysis in control theory problems.