Allopurinol derivative were prepared by reacting the (1-chloroacetyl)-2-Hydropyrazolo{3,4-d}pyrimidine-4-oneiwith 5- methoxy- 2-aminoibenzothiazoleiunder certain conditions to obtain new compound ( N- (2-aminoacetyl (5-methoxy) benzothiazole -2yl) (A4), Reaction of 5-(P-dimethyl amine benzene)-2-amino-1,3,4- oxadiazole in the presence of potassium carbonate anhydrous to yield new compound (N-(2- aminoacetyl-5-(P-dimethyl amine benzene )-1,3,4-oxadiazoles-2-yl)(A30) and Azo compound (N-(5-(Azo-2-hydroxy-5-amino benzene)-1,3-Diazol-2yl)Allopurinol(A46). The structure of prepared compounds were confirmed by (FT-IR) technique and their physical properties. The synthesized compounds were tested for cytotoxicity, Xanthine oxidase inhibiti

Background: Vitamin D improves innate immunity by enhancing the expression of antimicrobial peptides. The antimicrobial action of cathelicidin is widespread and effective against cariogenic bacteria. This research aimed to investigate the effect of vitamin D deficiency on the level of salivary cathelicidin concerning dental caries experience.

Subjects and Methods: A case-control study was carried out, and the sample was composed of 80 females; the study group involved 40 females with a serum vitamin D concentration of less than 10 ng/ml. In addition to the control group involving 40 females wh

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process

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.

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