An easy, eclectic, precise high-Performance Liquid Chromatographic (HPLC) procedure was evolved and validated to estimate of Piroxicam and Codeine phosphate. Chromatographic demarcation was accomplished on a C₁₈ column [Use BDS Hypersil C₁₈, 5μ, 150 x 4.6 mm] using a mobile phase of methanol: phosphate buffer (60:40, v/v, pH=2.3), the flow rate was 1.1 mL/min, UV detection was at 214 nm. System Suitability tests (SSTs) are typically performed to assess the suitability and effectiveness of the entire chromatography system. The retention time for Piroxicam was found to be 3.95 minutes and 1.46 minutes for Codeine phosphate. The evolved method has been validated through precision, limit of quantitation, specificity,

This study presents a rapid, sensitive, and straightforward approach to measure chlorpheniramine maleate (CPM) by using turbidity CFIA. The method involves CPM reacting with sodium nitroprusside (Nitropress) to produce a pale white precipitate. The NAG-SSP-5S1D analyzer was used to measure turbidity at 0°–180° angle to detect the attenuation of incident light as a result of collision on the surfaces of the precipitate particles. The linear range of CPM measurements was between 0.008 and 11 m.mol/L, with correlation coefficient of 0.9983 and R2% = 99.65. The limit of detection was determined to be 0.0328 µg/sample from the lowest concentration in the calibration curve, and the repeatability of the method (RSD%) was less than 0.4% (n = 6

Urea formaldehyde resin was prepared by using basic media by yield 95%. The Remaining of ureaplasts resin were prepared in acetic acid media by high yield. Alkyde resins were prepared by condensation polymerization by react Succinic, Maleic, Phthalic anhydrides with Ethylene glycol or Glycerol. Select samples of the prepared alkyde resins were mixed with Azo dyes in special ratio. The mixtures were used as coatings for wood, and compaised with pure dyes. The Coating that some alkyde resins showed better adhesion from using dyes alone. Preparation of wood coating by mixing ureaplast resins and alkyde resins with Azo dyes in special ratios. The coating showed better adhesion, brighter colors and better resistance to heat from Preceding coat

الصيغة العامة للمعقدات الجديدة [M2(BDS)Cl4] الناتجة من تفاعل الليكاند الجديد] ن1,ن4-ثنائي(1أ –بنزو]د[ اميدازول-2-يل)-ن1,ن4-ثنائي(4-ثنائي مثيل امينو) بنزيل) سكسنمايد[ (BDS) مع الايونات الفلزية الكادميوم, الكوبلت, الزئبق, النحاس والنيكل. تم اشتقاق هذا الليكاند من تفاعل المواد الثلاث 4-(ثنائي ميثيل أمينو) بنزالدهيد، 2-أمينو بنزيميدازول، وكلوريد السكسينيل. تم تشخيص المركبات باستخدام مطيافية طيف الاشعة تحت الحمراء وطيف الرن

In this work lactone (1) was prepared from the reaction of p-nitro phenyl hydrazine with ethylacetoacetate, which upon treatment with benzoyl chloride afforded the lactame (2). The reaction of (2) with 2-amino phenol produced a new Schiff base (L) in good yield. Complexes of V(IV), Zr(IV), Rh(III), Pd(II), Cd(II) and Hg(II) with the new Schiff base (L) have been prepared. The compounds (1, 2) were characterized by FT-IR and UV spectroscopy, as well as characterizing ligand (L) by the same techniques with elemental analysis (C.H.N) and (1H-NMR). The prepared complexes were identified and their structural geometries were suggested by using elemental analysis (C.H.N), flame atomic absorption technique, FT-IR and UV-Vis spectroscopy, in additio

The optimum conditions for production of fibrinolytic protease from an edible mushroom Pleurotus ostreatus grown on the solid medium , Sus medium, composed of Sus wastes (produced from extracted medicinal plant Glycyrrhiza glabra) were determined. Addition of 5% of Soya bean seeds meal in Sus medium recorded a maximum fibrinolytic protease activity resulting in 7.7 units / ml. The optimum moisture content of Sus medium supplemented with 5% Soya bean seeds meal was 60% resulting in 7.2 units / ml.Pleurotus ostreatus produced a maximum fibrinolytic protease activity when the spawn rate,pH of medium and incubation temperature were 2,6 and 30°C, respectively. The maximum fibrinolytic protease activity was 7.6 units / ml when incubat

Face recognition is a crucial biometric technology used in various security and identification applications. Ensuring accuracy and reliability in facial recognition systems requires robust feature extraction and secure processing methods. This study presents an accurate facial recognition model using a feature extraction approach within a cloud environment. First, the facial images undergo preprocessing, including grayscale conversion, histogram equalization, Viola-Jones face detection, and resizing. Then, features are extracted using a hybrid approach that combines Linear Discriminant Analysis (LDA) and Gray-Level Co-occurrence Matrix (GLCM). The extracted features are encrypted using the Data Encryption Standard (DES) for security

In this paper , an efficient new procedure is proposed to modify third –order iterative method obtained by Rostom and Fuad [Saeed. R. K. and Khthr. F.W. New third –order iterative method for solving nonlinear equations. J. Appl. Sci .7(2011): 916-921] , using three steps based on Newton equation , finite difference method and linear interpolation. Analysis of convergence is given to show the efficiency and the performance of the new method for solving nonlinear equations. The efficiency of the new method is demonstrated by numerical examples.

This paper presents a new algorithm in an important research field which is the semantic word similarity estimation. A new feature-based algorithm is proposed for measuring the word semantic similarity for the Arabic language. It is a highly systematic language where its words exhibit elegant and rigorous logic. The score of sematic similarity between two Arabic words is calculated as a function of their common and total taxonomical features. An Arabic knowledge source is employed for extracting the taxonomical features as a set of all concepts that subsumed the concepts containing the compared words. The previously developed Arabic word benchmark datasets are used for optimizing and evaluating the proposed algorithm. In this paper,