In this paper, the bi-criteria machine scheduling problems (BMSP) are solved, where the discussed problem is represented by the sum of completion and the sum of late work times simultaneously. In order to solve the suggested BMSP, some metaheurisitc methods are suggested which produce good results. The suggested local search methods are simulated annulling and bees algorithm. The results of the new metaheurisitc methods are compared with the complete enumeration method, which is considered an exact method, then compared results of the heuristics with each other to obtain the most efficient method.
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.
Several methods have been developed for routing problem in MANETs wireless network, because it considered very important problem in this network ,we suggested proposed method based on modified radial basis function networks RBFN and Kmean++ algorithm. The modification in RBFN for routing operation in order to find the optimal path between source and destination in MANETs clusters. Modified Radial Based Neural Network is very simple, adaptable and efficient method to increase the life time of nodes, packet delivery ratio and the throughput of the network will increase and connection become more useful because the optimal path has the best parameters from other paths including the best bitrate and best life link with minimum delays. The re
... Show MoreIn an earlier paper, the basic analytical formula for particle-hole nuclear state densities was derived for non-Equidistant Spacing Model (non-ESM) approach. In this paper, an extension of the former equation was made to include pairing. Also a suggestion was made to derive the exact formula for the particle-hole state densities that depends exactly on Fermi energy and nuclear binding energies. The results indicated that the effects of pairing reduce the state density values, with similar dependence in the ESM system but with less strength. The results of the suggested exact formula indicated some modification from earlier non-ESM approximate treatment, on the cost of more calculation time
This study aimed to investigate the effect of total suspended solids (TSS) on the performance of a continuously operated dual-chamber microbial fuel cell (MFC) proceeded by primary clarifier to treat actual potato chips processing wastewater. The system was also tested in the absence of the primary clarifier and the results demonstrated a significant effect of TSS on the polarization curve of the MFC which was obtained by operating the graphite anodic electrode against Ag/AgCl reference electrode. The maximum observed power and current densities were decreased form 102.42 mW/m2 and 447.26 mA/m2 to 80.16 mW/m2 and 299.10 mA/m2, respectively due to the adverse effect of TSS. Also
... Show MoreA new method for determination of allopurinol in microgram level depending on its ability to reduce the yellow absorption spectrum of (I-3) at maximum wavelength ( ?max 350nm) . The optimum conditions such as "concentration of reactant materials , time of sitting and order of addition were studied to get a high sensitivity ( ? = 27229 l.mole-1.cm-1) sandal sensitivity : 0.0053 µg cm-2 ,with wide range of calibration curve ( 1 – 9 µg.ml-1 ) good stability (more then24 hr.) and repeatability ( RSD % : 2.1 -2.6 % ) , the Recovery % : ( 98.17 – 100.5 % ) , the Erel % ( 0.50 -1.83 % ) and the interference's of Xanthine , Cystein , Creatinine , Urea and the Glucose in 20 , 40 , 60 fold of analyate were also studied .
Real life scheduling problems require the decision maker to consider a number of criteria before arriving at any decision. In this paper, we consider the multi-criteria scheduling problem of n jobs on single machine to minimize a function of five criteria denoted by total completion times (∑), total tardiness (∑), total earliness (∑), maximum tardiness () and maximum earliness (). The single machine total tardiness problem and total earliness problem are already NP-hard, so the considered problem is strongly NP-hard.
We apply two local search algorithms (LSAs) descent method (DM) and simulated annealing method (SM) for the 1// (∑∑∑
... Show MoreThe study aims to implement a serial security technology system to organize a comfortable work environment for users of computers in the General Directorate of Education in Baghdad Karkh3. The most important findings of the study are the application of a serial technology system. It is connected with scientific goals that show the scientific structure of computer learning and its applications. It considers global learning systems and take into account the ease and scientific flow of the class of elderly employees. In addition, employees of other categories, are the outputs of the sequential technological system. The aim is to create a purposeful technological system and keep pace with global developments, to gain experience, skills and
... Show MoreA new approach for baud time (or baud rate) estimation of a random binary signal is presented. This approach utilizes the spectrum of the signal after nonlinear processing in a way that the estimation error can be reduced by simply increasing the number of the processed samples instead of increasing the sampling rate. The spectrum of the new signal is shown to give an accurate estimate about the baud time when there is no apriory information or any restricting preassumptions. The performance of the estimator for random binary square waves perturbed by white Gaussian noise and ISI is evaluated and compared with that of the conventional estimator of the zero crossing detector.
An Optimal Algorithm for HTML Page Building Process
In present work the effort has been put in finding the most suitable color model for the application of information hiding in color images. We test the most commonly used color models; RGB, YIQ, YUV, YCbCr1 and YCbCr2. The same procedures of embedding, detection and evaluation were applied to find which color model is most appropriate for information hiding. The new in this work, we take into consideration the value of errors that generated during transformations among color models. The results show YUV and YIQ color models are the best for information hiding in color images.