This paper studies the interaction of prefix iteration with the silent step in the setting of branching bisimulation. We present a finite equational axiomatization for Basic Process Algebra with deadlock, empty process and the silent step, extended with prefix iteration, and prove that this axiomatization is complete with respect to rooted branching bisimulation equivalence.

This paper deals with computational algorithms for obtaining the optimal stationary policy and the minimum cost of a discounted semi-Markov decision process. Van Nunen [23) has proposed a modified policy iteration algorithm with a suboptimality test of MacQueen type, where the modified policy iteration algorithm is policy iteration method with the policy evaluation routine by a finite number of...

If iteration is the rule in modern software development practices, this is more the case in game development. While the secret recipe for fun in games remains hidden, game development will remain a highly iterative trial-and-error design process. In this paper we present a semi-automatic process that, through FCA, can assist in the software design of modern videogames. Through FCA we can identi...

Investigating the Effect of Traditional Education and E-Learning on Community Health Workers in Noor City Regarding Waste Management Based Kirk Patrick Model

Maryam Zare1,2, Mehdi Moghanibashi1,3 and Ferdous Rastgar Jazii1,4 1Department of Biochemistry, National Institute of Genetic Engineering & Biotechnology (NIGEB), Tehran, 2Department of Biology, Payam-Noor University, Tehran, 3Islamic Azad University, Kazerun Branch, School of Medicine, Kazerun, Shiraz, 4Department of Molecular Structure and Function, Research Institute, Hospital for Sick Child...

Librarian in Charge of Library, Faculty of Dentistry, Tabriz University of Medical Sciences, Tabriz, Iran Master Student, Department of Library and Information Sciences, Faculty of Human Sciences, Islamic Azad University of Hamedan, Hamedan, Iran Assistant Professor, Department of Library Science and Information, Qom Payame Noor University, Qom, Iran *Corresponding Author; E-mail: simaesmaeilza...

In this paper, the equivalence of the convergence among Mann-Ishikawa and Noor iterations is obtained for uniformly L-Lipschitzian mappings in real Banach spaces. Our results extend and improve the corresponding results in Chang [3] and Ofoedu [4]. Mathematics subject classification (2010): 47H10, 47H09, 46B20..

We consider the relaxed and contraction-proximal point algorithms in Hilbert spaces. Some conditions on the parameters for guaranteeing the convergence of the algorithm are relaxed or removed. As a result, we extend some recent results of Ceng-Wu-Yao and Noor-Yao.

In this paper, we study strong convergence as well as stability results for a pair of nonself mappings using Jungck-SP iterative scheme and a certain contractive condition. Moreover, with the help of computer programs in C++, we show that Jungck-SP iterative scheme converges faster than Jungck-Noor, Jungck-Ishikawa and Jungck-Mann iterative schemes through example. General Terms Computational M...

1Noor Ophthalmology Research Center, Noor Eye Hospital, Tehran, IR Iran 2Department of Epidemiology and Biostatistics, School of Public Health, International Campus, Tehran University of Medical Sciences, Tehran, IR Iran 3Department of Optometry, Mashhad University of Medical Sciences, Mashhad, IR Iran 4Department of Epidemiology, Faculty of Public Health, Shahid Beheshti University of Medical ...