An Optimal Algorithm for HTML Page Building Process

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.

For several applications, it is very important to have an edge detection technique matching human visual contour perception and less sensitive to noise. The edge detection algorithm describes in this paper based on the results obtained by Maximum a posteriori (MAP) and Maximum Entropy (ME) deblurring algorithms. The technique makes a trade-off between sharpening and smoothing the noisy image. One of the advantages of the described algorithm is less sensitive to noise than that given by Marr and Geuen techniques that considered to be the best edge detection algorithms in terms of matching human visual contour perception.

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

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

Background: The genetic polymorphisms of vitamin D receptor (VDR) have an association with thalassemia development, additionally to the environmental elements that elicited the disorder in the genetically predisposed individuals. As well, VDR functions responsible for the regulation of bone metabolism, such its part in immunity. Aim: The sitting study intended to inspect the association between thalassemia disease and the genetic polymorphisms of VDR among the Iraqi population then compared these findings to other findings of thalassemia patients in other different ethnic populations. Materials and methods: The restriction enzymes Bsm-I and Fok-I were applied to determine the genetic polymorphisms frequencies of VDR by a Polymerase Chain Re

Abstract Objective: The underlying molecular basis of ischemic heart diseases (IHDs) has not yet been studied among Iraqi people. This study determined the frequency and types of some cardiovascular genetic risk factors among Iraqi patients with IHDs. Methods: This is a cross-sectional study recruiting 56 patients with acute IHD during a 2-month period excluding patients >50 years and patients with documented hyperlipidemia. Their ages ranged between 18 and 50 years; males were 54 and females were only 2. Peripheral blood samples were aspirated from all patients for troponin I and DNA testing. Molecular analysis to detect 12 common cardiovascular genetic risk factors using CVD StripAssay® (ViennaLab Diagnostics GmbH, Austria) was performed

By optimizing the efficiency of a modular simulation model of the PV module structure by genetic algorithm, under several weather conditions, as a portion of recognizing the ideal plan of a Near Zero Energy Household (NZEH), an ideal life cycle cost can be performed. The optimum design from combinations of NZEH-variable designs, are construction positioning, window-to-wall proportion, and glazing categories, which will help maximize the energy created by photovoltaic panels. Comprehensive simulation technique and modeling are utilized in the solar module I-V and for P-V output power. Both of them are constructed on the famous five-parameter model.  In addition, the efficiency of the PV panel is established by the genetic algorithm