This paper includes the application of Queuing theory with of Particle swarm algorithm or is called (Intelligence swarm) to solve the problem of The queues and developed for General commission for taxes /branch Karkh center in the service stage of the Department of calculators composed of six  employees , and it was chosen queuing model is a single-service channel  M / M / 1 according to the nature of the circuit work mentioned above and it will be divided according to the letters system for each employee, and  it was composed of data collection times (arrival time , service time, departure time)

Abstract:          

                Interest in the topic of prediction has increased in recent years and appeared modern methods such as Artificial Neural Networks models, if these methods are able to learn and adapt self with any model, and does not require assumptions on the nature of the time series. On the other hand, the methods currently used to predict the classic method such as Box-Jenkins may be difficult to diagnose chain and modeling because they assume strict conditions.

The purpose of this paper is to find the best multiplier approximation of unbounded functions in    –space by using some discrete linear positive operators. Also we will estimate the degree of the best multiplier approximation in term of modulus of continuity and the averaged modulus.

The integral transformations is a complicated function from a function space into a simple function in transformed space. Where the function being characterized easily and manipulated through integration in transformed function space. The two parametric form of SEE transformation and its basic characteristics have been demonstrated in this study. The transformed function of a few fundamental functions along with its time derivative rule is shown. It has been demonstrated how two parametric SEE transformations can be used to solve linear differential equations. This research provides a solution to population growth rate equation. One can contrast these outcomes with different Laplace type transformations

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).

     The General Company for Iraqi Cement is regarded as one of the companies that contribute to support the Iraqi economy. It contributes to provide the material of cement which fulfils the consumer and investment need in the markets in competitive prices and not to resort to the importing of the cement from abroad. That would save a great share of the purchase parity of the poor sectors of society. The estimation  of production function will contribute to putting the company.

The application functions of  the standard production of  benefit critical to clarify the actual relationship between production & its components, & allow to clarify the i

In this paper, a new procedure is introduced to estimate the solution for the three-point boundary value problem which is instituted on the use of Morgan-Voyce polynomial. In the beginning, Morgan-Voyce polynomial along with their important properties is introduced. Next, this polynomial with aid of the collocation method utilized to modify the differential equation with boundary conditions to the algebraic system. Finally, the examples approve the validity and accuracy of the proposed method.