Photo citation request in examples   Of ascetic poetry in the first Abbasid era

A new spectrophotometric method for individual and simultaneous determination of cefixime and cephalexin depending on the first and second derivative mode techniques. The first and second derivative spectra of these compounds permitted individual and simultaneous determination of cefixime and cephalexin in concentration interval of (4– 24μg.ml-1 ) by measuring the amplitude of peak-to-base line, pea to peak at certain wavelengths and the area under peak at selected spectrum intervals. The methods showed reasonable precision and accuracy and have been applied to determine cefixime and cephalexin in two different pharmaceutical preparations.

Oscillation criteria are obtained for all solutions of the first-order linear delay differential equations with positive and negative coefficients where we established some sufficient conditions so that every solution of (1.1) oscillate. This paper generalized the results in [11]. Some examples are considered to illustrate our main results.

Recently Genetic Algorithms (GAs) have frequently been used for optimizing the solution of estimation problems. One of the main advantages of using these techniques is that they require no knowledge or gradient information about the response surface. The poor behavior of genetic algorithms in some problems, sometimes attributed to design operators, has led to the development of other types of algorithms. One such class of these algorithms is compact Genetic Algorithm (cGA), it dramatically reduces the number of bits reqyuired to store the poulation and has a faster convergence speed. In this paper compact Genetic Algorithm is used to optimize the maximum likelihood estimator of the first order moving avergae model MA(1). Simulation results

Isolation of fungi was performed from February to July, 2019. One hundred clinical specimens were collected from King Abdullah Hospital (KAH) Bisha, Saudi Arabia. Samples were collected from twenty patients of different ages (30 - 70 years old) ten males and ten females. The samples were collected from patients with the two types of diabetics. Specimens included blood, hair, nail, oral swabs and skin.  Specimens were inoculated on Sabourauds Dextrose agar containing chloramphenicol. Thirteen fungal species were isolated and identified. The isolated species were: Aspergillus flavus, A. niger, A. terrus, A. nidulans, A. fumigatus, Candida albicans, C. krusei, C. parapsilosis, C. Tropicalis, Curvularia lunata, Fusarium solani, Penicill

The increasing Global Competitive and the continuous improvement in information technology has led the way to the development of the modern systems and using modern techniques. One of these techniques is benchmarking style and Total Quality Management all of them are used to improve the production process and target rid from the losts on the other side.

The Benchmarking style has become a very important for all the industrial systems and the serving systems as well. And an instrument to improve their performance specially those which are suffering from the highness of the costs or waste in time on the other side.

This study aims to depend on virtual Benchmarking style in the eval

تحتل أدوات السياسة المالية (الإنفاقية والإيرادية) مكانة مهمة بين أدوات السياسات الاقتصادية الأخرى لما تتمتع به من تأثيرات اقتصادية واجتماعية على مجمل النشاط الاقتصادي .

     وفي بحثنا هذا سنركز على الآثار الاجتماعية لأدوات السياسة المالية (الإنفاق العام والإيراد العام) لما للتنمية الاجتماعية من أهمية متزايدة في عالمنا اليوم خاصة فيما يتعلق بمقوماتها غير المادية المتمثلة في خدما

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith