background: routinely collected data from tuberculosis surveillance system can be used to investigate and monitor the irregularities and abrupt changes of the disease incidence. we aimed at using a hidden markov model in order to detect the abnormal states of pulmonary tuberculosis in iran. methods: data for this study were the weekly number of newly diagnosed cases with sputum smear-positive p...

‎in this paper‎, ‎we propose two iterative methods for finding a common solution of a finite family of equilibrium problems ‎for pseudomonotone bifunctions‎. ‎the first is a parallel hybrid extragradient-cutting algorithm which is extended from the‎ ‎previously known one for variational inequalities to equilibrium problems‎. ‎the second is a new cyclic hybrid‎ ‎extragradient-cutting algorithm‎....

in a large scale cyclic storage system ,as the number of rule parameters and/or number of operating period increase, general purpose gradient-based nlp solvers and/or genetic algorithms may loose their merits in finding optimally feasible solution to the problem. in these cases hybrid ga which decomposes the main problem into two manageable sub-problems with an iterative scheme between ga and l...

‎In this paper‎, ‎we propose two iterative methods for finding a common solution of a finite family of equilibrium problems ‎for pseudomonotone bifunctions‎. ‎The first is a parallel hybrid extragradient-cutting algorithm which is extended from the‎ ‎previously known one for variational inequalities to equilibrium problems‎. ‎The second is a new cyclic hybrid‎ ‎extragradient-cutting algorithm‎....

In this paper, we classify the skew cyclic codes over Fp + vF_p + v^2F_p, where p is a prime number and v^3 = v. Each skew cyclic code is a F_p+vF_p+v^2F_p-submodule of the (F_p+vF_p+v^2F_p)[x;alpha], where v^3 = v and alpha(v) = -v. Also, we give an explicit forms for the generator of these codes. Moreover, an algorithm of encoding and decoding for these codes is presented.

In this paper, we first introduce a generalized version of open shop scheduling (OSS), called generalized cyclic open shop scheduling (GCOSS) and then develop a hybrid method of metaheuristic to solve this problem. Open shop scheduling is concerned with processing n jobs on m machines, where each job has exactly m operations and operation i of each job has to be processed on machine i . However...

We introduce a scheme to perform the cooling algorithm, first presented by Oscar Boykin et al. in 2002 [1], for an arbitrary number of times on the same set of qbits. We achieve this goal by adding an additional SWAP-gate and a bath contact to the algorithm. This way one qbit may repeatedly be cooled without adding additional qbits to the system. By using a product Liouville space to model the ...

In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...