Acute toxicity is a step to evaluate the toxicity of a substance. Rutin is one of the flavonoid compounds with a variety of pharmacological effects. The aim of the study is to calculate the lethal dose that affect fifty percent of the mice used in the experiment (LD50). Thirty Swiss albino male and 30 non-pregnant female mice have been divided equally and randomly into 5 treated groups and one control group (n=5) Rutin has been administered with concentrations 5, 2.5.1.25,0.625 and 0.312 g/kg administered as a single dose intraperitoneally (IP) while the control group received 1% DMSO (IP). Animals were observed for any morbidity and mortality for 14 days. After 14 days the animal blood collected for biochemical and hematological analysis then all animals are euthanized for histopathological evaluation. The results showed the LD50 was 1.51 g/kg for male mice while for female mice was1.49 g/kg. No significant changes were observed at dose of 1.25glkg (female) and 0.625, 0.312 glkg (both sexes) in body weight measurements and in biochemical or hematological assays. Moreover no significant histopathological changes were reported compared to control.. It can be concluded that Rutin is practically a non-toxic substance.
In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise near topological spaces over B. Also, we introduce the concepts of fibrewise near closed and near open topological spaces over B; Furthermore we state and prove several Propositions concerning with these concepts.
Agriculture improvement is a national economic issue that extremely depends on productivity. The explanation of disease detection in plants plays a significant role in the agriculture field. Accurate prediction of the plant disease can help treat the leaf as early as possible, which controls the economic loss. This paper aims to use the Image processing techniques with Convolutional Neural Network (CNN). It is one of the deep learning techniques to classify and detect plant leaf diseases. A publicly available Plant village dataset was used, which consists of 15 classes, including 12 diseases classes and 3 healthy classes. The data augmentation techniques have been used. In addition to dropout and weight reg
... Show MoreIn this paper, we present a Branch and Bound (B&B) algorithm of scheduling (n) jobs on a single machine to minimize the sum total completion time, total tardiness, total earliness, number of tardy jobs and total late work with unequal release dates. We proposed six heuristic methods for account upper bound. Also to obtain lower bound (LB) to this problem we modified a (LB) select from literature, with (Moore algorithm and Lawler's algorithm). And some dominance rules were suggested. Also, two special cases were derived. Computational experience showed the proposed (B&B) algorithm was effective in solving problems with up to (16) jobs, also the upper bounds and the lower bound were effective in restr
... Show MoreIn this paper, we generalized the principle of Banach contractive to the relative formula and then used this formula to prove that the set valued mapping has a fixed point in a complete partial metric space. We also showed that the set-valued mapping can have a fixed point in a complete partial metric space without satisfying the contraction condition. Additionally, we justified an example for our proof.
The Internet image retrieval is an interesting task that needs efforts from image processing and relationship structure analysis. In this paper, has been proposed compressed method when you need to send more than a photo via the internet based on image retrieval. First, face detection is implemented based on local binary patterns. The background is notice based on matching global self-similarities and compared it with the rest of the image backgrounds. The propose algorithm are link the gap between the present image indexing technology, developed in the pixel domain, and the fact that an increasing number of images stored on the computer are previously compressed by JPEG at the source. The similar images are found and send a few images inst
... Show MoreIn this paper, one of the Machine Scheduling Problems is studied, which is the problem of scheduling a number of products (n-jobs) on one (single) machine with the multi-criteria objective function. These functions are (completion time, the tardiness, the earliness, and the late work) which formulated as . The branch and bound (BAB) method are used as the main method for solving the problem, where four upper bounds and one lower bound are proposed and a number of dominance rules are considered to reduce the number of branches in the search tree. The genetic algorithm (GA) and the particle swarm optimization (PSO) are used to obtain two of the upper bounds. The computational results are calculated by coding (progr
... Show MoreComputer theoretical study has been carried out on the design of five electrode immersion electrostatic lens used in electron gun application. The finite element method (FEM) is used in the solution of the Poisson's equation fro determine axial potential distribution, the electron trajectory under Zero magnification condition . The optical properties : focal length ,spherical and chromatic aberrations are calculated,From studying the properties of the designed electron gun. we have good futures for these electron gun where are abeam current 4*10-4A can be supplied by using cathode tip of radius 100 nm.
Gangyong Lee, S.Tariq Rizvi, and Cosmin S.Roman studied Rickart modules.
The main purpose of this paper is to develop the properties of Rickart modules .
We prove that each injective and prime module is a Rickart module. And we give characterizations of some kind of rings in term of Rickart modules.
In this paper we will investigate some Heuristic methods to solve travelling salesman problem. The discussed methods are Minimizing Distance Method (MDM), Branch and Bound Method (BABM), Tree Type Heuristic Method (TTHM) and Greedy Method (GRM).
The weak points of MDM are manipulated in this paper. The Improved MDM (IMDM) gives better results than classical MDM, and other discussed methods, while the GRM gives best time for 5≤ n ≤500, where n is the number of visited cities.
Let R be a commutative ring with identity and let M be a unitary left R-module. The purpose of this paper is to investigate some new results (up to our knowledge) on the concept of semi-essential submodules which introduced by Ali S. Mijbass and Nada K. Abdullah, and we make simple changes to the definition relate with the zero submodule, so we say that a submodule N of an R-module M is called semi-essential, if whenever N ∩ P = (0), then P = (0) for each prime submodule P of M. Various properties of semi-essential submodules are considered.