A quadrature rule of Lobatto-Gaussian for numerical integration of analytic functions

<p style='text-indent:20px;'>A novel quadrature rule is formed combining Lobatto six point transformed rule and Gauss-Legendre five point transformed rule each having precision nine. The mixed rule so formed is of precision eleven. Through asymptotic error estimation the novelty of the quadrature rule is justified. Some test integrals have been evaluated using the mixed rule and its constituents both in non-adaptive and adaptive modes. The results are found to be quite encouraging for the mixed rule which is in conformation with the theoretical prediction.</p>

On optimal stochastic jumps in multi server queue with impatient customers via stochastic control

<p style='text-indent:20px;'>In this paper, a queuing system as multi server queue, in which customers have a deadline and they request service from a random number of identical severs, is considered. Indeed there are stochastic jumps, in which the time intervals between successive jumps are independent and exponentially distributed. These jumps will be occurred due to a new arrival or situation change of servers. Therefore the queuing system can be controlled by restricting arrivals as well as rate of service for obtaining optimal stochastic jumps. Our model consists of a single queue with infinity capacity and multi server for a Poisson arrival process. This processes contains deterministic rate <inline-formula><tex-math id="M1">\begin{document}$ \lambda(t) $\end{document}</tex-math></inline-formula> and exponential service processes with <inline-formula><tex-math id="M2">\begin{document}$ \mu $\end{document}</tex-math></inline-formula> rate. In this case relevant customers have exponential deadlines until beginning of their service. Our contribution is to extend the Ittimakin and Kao's results to queueing system with impatient customers. We also formulate the aforementioned problem with complete information as a stochastic optimal control. This optimal control law is found through dynamic programming.</p>