This paper examines the possibility of discovering 'hidden' (potential) Communities of Practice (CoPs) inside electronic networks, and then using this knowledge to nurture them into a fully developed Virtual Community of Practice (VCoP). Starting from the standpoint of the need to manage knowledge, it discusses several questions related to this subject: the characteristics of 'hidden' communiti...

In this paper we study the concurrent cops and robber (CCCR) game. CCCR follows the same rules as the classical, turn-based game, except for the fact that the players move simultaneously. The cops' goal is to capture the robber and the concurrent cop number of a graph is defined the minimum number of cops which guarantees capture. For the variant in which it it required to capture the robber in...

This paper puts forwards a new way to view how Communities of Practice (CoPs) form in environments that make heavy use of information systems. It uses a concept from Physics to suggest a new type of CoP that can exist in workplaces. In order to do that, the paper uses a simplified taxonomy for CoPs to outline the 'Quantum-CoPs'. These Communities are discussed regarding their behaviour and char...

In the game of cops and robbers on a graph G = (V,E), k cops try to catch a robber. On the cop turn, each cop may move to a neighboring vertex or remain in place. On the robber’s turn, he moves similarly. The cops win if there is some time at which a cop is at the same vertex as the robber. Otherwise, the robber wins. The minimum number of cops required to catch the robber is called the cop num...

The cops and strong visible robber game, defined in [3], is played according to the following rules: Initially, the cops occupy some set of X ⊆ V vertices, with |X| ≤ k, and the robber is placed on some vertex v ∈ V − X. At any time, some of the cops can reside outside the graph, say, in a helicopter. In each round, the cop player chooses the next location X ′ ⊆ V for the cops. The stationary c...

In veterinary medicine, coagulase-positive staphylococci (CoPS) other than Staphylococcus aureus have frequently been misidentified as being S. aureus strains, as they have several phenotypic traits in common. There has been no reliable method to distinguish among CoPS species in veterinary clinical laboratories. In the present study, we sequenced the thermonuclease (nuc) genes of staphylococca...

Directed path-width was defined by Reed, Thomas and Seymour around 1995. The author and P. Hajnal defined a cops-and-robber game on digraphs in 2000. We prove that the two notions are closely related and for any digraph D, the corresponding graph parameters differ by at most one. The result is achieved using the mixed-search technique developed by Bienstock and Seymour. A search is called monot...

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