The presented work shows a preliminary analytic method for estimation of load and pressure distributions on low speed wings with flow separation and wake rollup phenomena’s. A higher order vortex panel method is coupled with the numerical lifting line theory by means of iterative procedure including models of separation and wake rollup. The computer programs are written in FORTRAN which are stable and efficient.

      The capability of the present method is investigated through a number of test cases with different types of wing sections (NACA 0012 and GA(W)-1) for different aspect ratios and angles of attack, the results include the lift and drag curves, lift and pressure distributions along the wing s

This study includes six species related to the genus Echinops L. (composite) grown in Iraq which are listed below: E.armatus Boiss. & Hausskn., E. bicolor Nabelek, E. cephalotes DC., E.haussknechtii Boiss., E. moulensis Rech., E. nitens Bornm., the geographical distribution and ecological preferences' were documented.
It has been also observed that this genus was distributed near waterfalls, vallies, road side, dry limestone, clay soil and hard rocky soil in Different heights. The most separated species was E.armatus and the least separated one was E.haussknechtii, the species was listed in diagram and distributed on a map.

In this paper, Bayes estimators of Poisson distribution have been derived by using two loss functions: the squared error loss function and the proposed exponential loss function in this study, based on different priors classified as the two different informative prior distributions represented by erlang and inverse levy prior distributions and non-informative prior for the shape parameter of Poisson distribution. The maximum likelihood estimator (MLE) of the Poisson distribution has also been derived. A simulation study has been fulfilled to compare the accuracy of the Bayes estimates with the corresponding maximum likelihood estimate (MLE) of the Poisson distribution based on the root mean squared error (RMSE) for different cases of the

In this research work, a simulator with time-domain visualizers and configurable parameters using a continuous time simulation approach with Matlab R2019a is presented for modeling and investigating the performance of optical fiber and free-space quantum channels as a part of a generic quantum key distribution system simulator. The modeled optical fiber quantum channel is characterized with a maximum allowable distance of 150 km with 0.2 dB/km at =1550nm. While, at =900nm and =830nm the attenuation values are 2 dB/km and 3 dB/km respectively. The modeled free space quantum channel is characterized at 0.1 dB/km at =860 nm with maximum allowable distance of 150 km also. The simulator was investigated in terms of the execution of the BB84 p

     In 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

     Fuzzy C-means (FCM) is a clustering method used for collecting similar data elements within the group according to specific measurements. Tabu is a heuristic algorithm. In this paper, Probabilistic Tabu Search for FCM implemented to find a global clustering based on the minimum value of the Fuzzy objective function. The experiments designed for different networks, and cluster’s number the results show the best performance based on the comparison that is done between the values of the objective function in the case of using standard FCM and Tabu-FCM, for the average of ten runs.

beef and chicken meat were used to get Sarcoplasim, the chicken Sarcoplasim were used to prepare antibody for it after injected in rabbit, the antiserums activity were 1/32 by determined with Immune double diffusion test, the self test refer to abele for some antiserums to detected with beef sarcoplasim, which it mean found same proteins be between beef and chicken meat, which it refer to difficult depended on this immune method to detect for cheat of chicken meat with beef, so the antibody for beef sarcoplasim were removed from serum by immune absorption step to produce specific serum against chicken sarcoplasim that it used in Immune double diffusion test to qualitative detect for cheat beef with 5% chicken meat or more at least, and the

Nonlinear differential equation stability is a very important feature of applied mathematics, as it has a wide variety of applications in both practical and physical life problems. The major object of the manuscript is to discuss and apply several techniques using modify the Krasovskii's method and the modify variable gradient method which are used to check the stability for some kinds of linear or nonlinear differential equations. Lyapunov function is constructed using the variable gradient method and Krasovskii’s method to estimate the stability of nonlinear systems. If the function of Lyapunov is positive, it implies that the nonlinear system is asymptotically stable. For the nonlinear systems, stability is still difficult even though

This paper investigates some exact and local search methods to solve the traveling salesman problem. The Branch and Bound technique (BABT) is proposed, as an exact method, with two models. In addition, the classical Genetic Algorithm (GA) and Simulated Annealing (SA) are discussed and applied as local search methods. To improve the performance of GA we propose two kinds of improvements for GA; the first is called improved GA (IGA) and the second is Hybrid GA (HGA).

The IGA gives best results than GA and SA, while the HGA is the best local search method for all within a reasonable time for 5 ≤ n ≤ 2000, where n is the number of visited cities. An effective method of reducing the size of the TSP matrix was proposed with