Praise be to God, who started his book with the praise of himself and prayers and peace be upon those who do not have a prophet after him and his family and companions and those who followed them with charity until the Day of Judgment. Either:
      The research examines the meanings of the formulas of the increased verbs that were mentioned in Surat Al-Baqara, at the imam of the imams of the Islamic nation, namely, Al-Fakhri Al-Razi (d. 606 AH), may God Almighty have mercy on him. With the imams of Quranic scholars.

Artificial pancreas is simulated to handle Type I diabetic patients under intensive care by automatically controlling the insulin infusion rate. A Backstepping technique is used to apply the effect of PID controller to blood glucose level since there is no direct relation between insulin infusion (the manipulated variable) and glucose level in Bergman’s system model subjected to an oral glucose tolerance test by applying a meal translated into a disturbance. Backstepping technique is usually recommended to stabilize and control the states of Bergman's class of nonlinear systems. The results showed a very satisfactory behavior of glucose deviation to a sudden rise represented by the meal that increase the blood glucose

This research aims to investigate and evaluate a reactive powder concrete (RPC) cast using economical materials. Its mechanical properties were investigated and evaluated by studying the effects of using different cement and silica fume contents and locally steel fibers aspect ratios as reinforcement for this concrete. A compressive strength of about 155.2MPa, indirect tensile strength of 16.0MPa, modulus of elasticity of 48.7GPa, flexural strength of 43.5MPa, impact energy of 3294.4kN.m and abrasion loss 0.59%  have been achieved for reinforced RPC contains  910 kg/m³ cement content, silica fume content 185 kg/m³ of cement weight and fiber volume fraction 2%. The water absorption values w

Therapeutic contact lenses TCLs is an approach used to enhance corneal residence time and reduce frequent instillation, which is a problem with eye drops.  The problem with CLs is loading of hydrophobic drugs. In this research the CLs were prepared with molecular imprinting MI to enhance the loading of itraconazole, which is used as antifungal drug for fungal keratitis. CLs using different  concentration of hydroxyethyl methacrylate HEMA and methacrylic acid MAA were prepared with and without MI using PEGDA (25 μL) and AIBN (37 mg) as crosslinker and initiator respectively. All the prepared CLs were clear and have good folding endurance. MICLs had significantly higher drug loading compared to conventional CLs. The release of i

PVC/Kaolinite composites were prepared by the melt intercalation method. Mechanical properties, thermal properties, flammability and water absorption percentage of prepared samples were tested. Mechanical characteristic such as tensile strength, elongation at break; hardness and impact strength (charpy type) were measured for all samples. It was found that the tensile strength and elongation at break of PVC composites decreased with increasing kaolinite loading. Also, the hardness of the composites increases with increase in filler content .The impact strength of the composites at the beginning increases at lower kaolinite loadings is due to the lack of kaolin adhesion to the matrix. However, at higher kaolin loadings. This severe agglom

In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise closure topological spaces, fibrewise wake topological spaces, fibrewise strong topological spaces over B. Also, we introduce the concepts of fibrewise w-closed (resp., w-coclosed, w-biclosed) and w-open (resp., w-coopen, w-biopen) topological spaces over B; Furthermore we state and prove several Propositions concerning with these concepts.

Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if  for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph K_n, Complete bipartite graph K_m,n and Complete tripartite graph K_l,m,n. It has also been studied how the lucky number changes whi