Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).
This study discussed a biased estimator of the Negative Binomial Regression model known as (Liu Estimator), This estimate was used to reduce variance and overcome the problem Multicollinearity between explanatory variables, Some estimates were used such as Ridge Regression and Maximum Likelihood Estimators, This research aims at the theoretical comparisons between the new estimator (Liu Estimator) and the estimators
In this research, the focus was placed on estimating the parameters of the Hypoexponential distribution function using the maximum likelihood method and genetic algorithm. More than one standard, including MSE, has been adopted for comparison by Using the simulation method
Isolated Bacteria from the roots of barley were studied; two stages of processes Isolated and screening were applied in order to nd the best bacteria to remove kerosene from soil. The acve bacteria are isolated for kerosene degradaon process. It has been found that Klebsiella pneumoniae sp. have the highest kerosene degradaon which is 88.5%. The opmum condions of kerosene degradaon by Klebsiella pneumonia sp. are pH5, 48hr incubaon period, 35°C temperature and 10000ppm the best kerosene concentraon. The results 10000ppm showed that the maximum kerosene degradaon can reach 99.58% aer 48 h of incubaon. Higher Kerosene degradaon which was 99.83% was obtained at pH5. Kerosene degradaon was found
... Show MoreIsolated Bacteria from the roots of barley were studied; two stages of processes Isolated and screening were applied in order to find the best bacteria to remove kerosene from soil. The active bacteria are isolated for kerosene degradation process. It has been found that Klebsiella pneumoniae sp. have the highest kerosene degradation which is 88.5%. The optimum conditions of kerosene degradation by Klebsiella pneumonia sp. are pH5, 48hr incubation period, 35°C temperature and 10000ppm the best kerosene concentration. The results 10000ppm showed that the maximum kerosene degradation can reach 99.58% after 48 h of incubation. Higher Kerosene degradation which was 99.83% was obtained at pH5. Kerosene degradation was found to be maximum at 3
... Show MoreAbstract: Microfluidic devices present unique advantages for the development of efficient drug assay and screening. The microfluidic platforms might offer a more rapid and cost-effective alternative. Fluids are confined in devices that have a significant dimension on the micrometer scale. Due to this extreme confinement, the volumes used for drug assays are tiny (milliliters to femtoliters).
In this research, a microfluidic chip consists of micro-channels carved on substrate materials built by using Acrylic (Polymethyl Methacrylate, PMMA) chip was designed using a Carbon Dioxide (CO2) laser machine. The CO2 parameters have influence on the width, depth, roughness of the chip. In order to have regular
... Show MoreThere are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com
... Show MoreAbstract
This research presents a on-line cognitive tuning control algorithm for the nonlinear controller of path-tracking for dynamic wheeled mobile robot to stabilize and follow a continuous reference path with minimum tracking pose error. The goal of the proposed structure of a hybrid (Bees-PSO) algorithm is to find and tune the values of the control gains of the nonlinear (neural and back-stepping method) controllers as a simple on-line with fast tuning techniques in order to obtain the best torques actions of the wheels for the cart mobile robot from the proposed two controllers. Simulation results (Matlab Package 2012a) show that the nonlinear neural controller with hybrid Bees-PSO cognitive algorithm is m
... Show MoreFor the duration of the last few many years many improvement in computer technology, software program programming and application production had been followed with the aid of diverse engineering disciplines. Those trends are on the whole focusing on synthetic intelligence strategies. Therefore, a number of definitions are supplied, which recognition at the concept of artificial intelligence from exclusive viewpoints. This paper shows current applications of artificial intelligence (AI) that facilitate cost management in civil engineering tasks. An evaluation of the artificial intelligence in its precise partial branches is supplied. These branches or strategies contributed to the creation of a sizable group of fashions s
... Show More