Discriminant analysis is a technique used to distinguish and classification an individual to a group among a number of  groups based on a linear combination of a set of relevant variables know discriminant function. In this research  discriminant analysis used to analysis data from repeated measurements design. We  will  deal  with the problem of  discrimination  and  classification in the case of  two  groups by assuming the Compound Symmetry covariance structure  under  the  assumption  of  normality for  univariate  repeated measures data.

The effect of different antibiotics on growth pigment and plasmid curing of Serratia marcescens were studied, S. marcescens was cultured in media containing(16_500)µg/ml of antibiotics, curing mutants unable to produce prodigiosin and lost one plasmid band were obtained of of ampicillin, amoxillin, antibiotics concentrations (64 500) µg/ml metheprim, ultracloxam, azithromycin, cephalexin and erythromycin treated with (350 500) µg/ml of The mutant cells rose- light color and and refampicin revealed S.marcescens inhibited ciprodar and tetracyclin, lincomycin did not lost the plasmid band chlaforan

     Many authors investigated the problem of the early visibility of the new crescent moon after the conjunction and proposed many criteria addressing this issue in the literature. This article presented a proposed criterion for early crescent moon sighting based on a deep-learned pattern recognizer artificial neural network (ANN) performance. Moon sight datasets were collected from various sources and used to learn the ANN. The new criterion relied on the crescent width and the arc of vision from the edge of the crescent bright limb. The result of that criterion was a control value indicating the moon's visibility condition, which separated the datasets into four regions: invisible, telescope only, probably visible, and certai

Maximum likelihood estimation method, uniformly minimum variance unbiased estimation method and minimum mean square error estimation, as classical estimation procedures, are frequently used for parameter estimation in statistics, which assuming the parameter is constant , while Bayes method assuming the parameter is random variable and hence the Bayes estimator is an estimator which minimize the Bayes risk for each value the random observable and for square error lose function the Bayes estimator is the posterior mean. It is well known that the Bayesian estimation is hardly used as a parameter estimation technique due to some difficulties to finding a prior distribution.

The interest of this paper is that

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith

    This research includes the use of an artificial intelligence algorithm, which is one of the algorithms of biological systems which is the algorithm of genetic regulatory networks (GRNs), which is a dynamic system for a group of variables representing space within time. To construct this biological system, we use (ODEs) and to analyze the stationarity of the model we use Euler's method. And through the factors that affect the process of gene expression in terms of inhibition and activation of the transcription process on DNA, we will use TF transcription factors. The current research aims to use the latest methods of the artificial intelligence algorithm. To apply Gene Regulation Networks (GRNs), we used a progr

Objective of this work is the mixing between human biometric characteristics and unique attributes of the computer in order to protect computer networks and resources environments through the development of authentication and authorization techniques. In human biometric side has been studying the best methods and algorithms used, and the conclusion is that the fingerprint is the best, but it has some flaws. Fingerprint algorithm has been improved so that their performance can be adapted to enhance the clarity of the edge of the gully structures of pictures fingerprint, taking into account the evaluation of the direction of the nearby edges and repeat. In the side of the computer features, computer and its components like human have uniqu