ان الغرض من هذا البحث هو المزج بين القيود الضبابية والاحتمالية. كما يهدف الى مناقشة اكثر حالات مشكلات البرمجة الضبابية شيوعا وهي عندما تكون المشكلة الضبابية تتبع دالة الانتماء مرة دالة الاتنماء المثلثية مرة اخرى، من خلال التطبيق العملي والتجريبي. فضلا عن توظيف البرمجة الخطية الضبابية في معالجة مشكلات تخطيط وجدولة الإنتاج لشركة العراق لصناعة الأثاث، وكذلك تم استخدام الطرائق الكمية للتنبؤ بالطلب واعتماده

Leucine amino peptidases (LAP; EC 3.4.11.1) constitute a diverse set of exopeptidases that catalyze the hydrolysis of leucine residues from the amino-terminal of protein or peptide substrates, (LAP) are present in animals, plants, and microbes. In this study, leucine amino peptidase was purified partial from Arachis hypogaea seeds by using gel filtration chromatography Sephadex G-100. The enzyme was purified 3.965 fold with a recovery of 29.4%. Its pH and temperature optimum were(8.7) and (37oC), respectively. The results show novel properties of LAP from Arachis hypogaea L. or peanut. The Km value for LAP (77 mM), with V max (1538 m mole min-1). We recommend a separate isoenzymeof the enzyme (LAP) from Arachis hypogaea on L. peanut seeds a

This study focuses on studying an oscillation of a second-order delay differential equation. Start work, the equation is introduced here with adequate provisions. All the previous is braced by theorems and examplesthat interpret the applicability and the firmness of the acquired provisions

Iron oxide(Fe3O4) nanoparticles of different sizes and shapes were synthesized by solve-hydrothermal reaction assisted by microwave irradiation using ferrous ammonium sulfate as a metal precursor, oleic acid as dispersing agent, ethanol as reducing agent and NaOH as precipitating agent at pH=12. The synthesized Fe3O4 nano particles were characterized by X-ray diffraction (XRD), FTIR and thermal analysis TG-DTG. Sizes and shapes of Fe3O4 nanoparticles were characterized by Scanning Electron Microscopy (SEM), and atomic force microscopy (AFM).

The university course timetable problem (UCTP) is typically a combinatorial optimization problem. Manually achieving a useful timetable requires many days of effort, and the results are still unsatisfactory. unsatisfactory. Various states of art methods (heuristic, meta-heuristic) are used to satisfactorily solve UCTP. However, these approaches typically represent the instance-specific solutions. The hyper-heuristic framework adequately addresses this complex problem. This research proposed Particle Swarm Optimizer-based Hyper Heuristic (HH PSO) to solve UCTP efficiently. PSO is used as a higher-level method that selects low-level heuristics (LLH) sequence which further generates an optimal solution. The proposed a