Communities of Practice (CoPs) have attracted the interest of professionals and researchers as successful environments for enhancing, developing and improving practices through collaboration between their members. More and more, CoPs are choosing virtual environments and services to support their activities. However, recent research has underlined the lack of adequate scaffolding in terms of te...

Plain English summary The involvement of patients in health research has resulted in the development of more effective interventions and policies in healthcare that respond to the needs of healthcare users. This article examines how working with youth and their families as co-researchers in health research communities of practice (CoPs), rather than just as participants, can benefit all involve...

For the lexicographic product G • H of two graphs G and H so that G is connected, we prove that if the copnumber c(G) of G is greater than or equal to 2, then c(G • H) = c(G). Moreover, if c(G) = c(H) = 1, then c(G • H) = 1. If c(G) = 1, G has more than one vertex, and c(H) ≥ 2, then c(G • H) = 2. We also provide the copnumber for general lexicographic sums. The game of cops and robbers on a gr...

in this paper, analysis and simulation of media gateway controller (megaco) based cops (common open policy server) which is a protocol defined in ietf (internet engineering task force) to transport configuration requests and deliver the policies is presented. for this scenario, three queuing models include m/m/1, m/m/c and m/d/c were applied . then, some of the key performance benchmarks look l...

The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify the minimum number of cops sufficient to catch the visible and very fast robber. To catch the robber, at least one of the cops should be within at most r edges from him. We give a constant factor approximation algorithm...

Several variants of the cops and robbers (CR) game have been studied in the past. In this paper we examine a novel variant, which is played between two cops, each one independently trying to catch a " passive robber ". We will call this the Selfish Cops and Passive Robber (SCPR) game. In short, SCPR is a stochastic two-player, zero-sum game where the opponents are the two cop players. We study ...

Aigner and Fromme initiated the systematic study of the cop number of a graph by proving the elegant and sharp result that in every connected planar graph, three cops are sufficient to win a natural pursuit game against a single robber. This game, introduced by Nowakowski and Winkler, is commonly known as Cops and Robbers in the combinatorial literature. We extend this study to directed planar ...

The Cops and Robbers game is played on undirected graphs where a group of cops tries to catch a robber. The game was defined independently by Winkler-Nowakowski and Quilliot in the 1980s and since that time has been studied intensively. Despite of that, its computation complexity is still an open question. In this paper we prove that computing the minimum number of cops that can catch a robber ...