Delayed neurologic deficits, paraplegia and paraparesis, are devastating complications after repair of a descending thoracic and thoracoabdominal aortic aneurysm (TAAA). A treatment protocol has not been established, although strategies such as cerebrospinal fluid (CSF) drainage, maintaining blood pressure and medication have been described. Cerebrospinal drain status /oxygen delivery/patient s...

Non-typhoidal Salmonella (NTS) serovars S. Enteritidis and S. Typhimurium are a major cause of invasive bacterial disease (e.g., bacteremia, meningitis) in infants and young children in sub-Saharan Africa and also occasionally cause invasive disease in highly susceptible hosts (young infants, the elderly, and immunocompromised subjects) in industrialized countries. No licensed vaccines exist ag...

The objective of information system security management is information assurance: to maintain confidentiality (privacy), integrity, and availability of information resources for authorized organizational end users. User authentication is a foundation procedure in the overall pursuit of these objectives, and password procedures have historically been the primary method of user authentication. Th...

In the game of Cops and Robbers, a team of cops attempts to capture a robber on a graph G. All players occupy vertices of G. The game operates in rounds; in each round the cops move to neighboring vertices, after which the robber does the same. The minimum number of cops needed to guarantee capture of a robber on G is the cop number of G, denoted c(G), and the minimum number of rounds needed fo...

Convinced by the important role of CoPs (communities of practice) and the innovative learning modality they offer, the École Polytechnique Fédérale de Lausanne is currently developing a framework to sustain interaction, collaboration, and learning in laboratory-oriented CoPs, namely the eLogBook. This paper describes the services provided by this framework, the 3A model on which it is based, an...

We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the robber is unknown to the cops, each cop can see a certain radius d around his position. For the case d = 1 these games have been studied by Fomin, Kratsch and Müller [7] under the name domination games. We are primarily intere...

The two-player, complete information game of Cops and Robber is played on undirected finite graphs. A number of cops and one robber are positioned on vertices and take turns in sliding along edges. The cops win if, after a move, a cop and the robber are on the same vertex. The minimum number of cops needed to catch the robber on a graph is called the cop number of that graph. Let c(g) be the su...

Introduction. As it approaches the two decade milestone, the concept of Community of Practice (CoP) faces what can be described as a midlife crisis. It has achieved wide diffusion, but users have adapted it to suit their needs, leading to a proliferation of diverging interpretations. Recent critiques lament that the concept is losing its coherence and analytical power. Method. This review uses ...

We consider generalisations of tree width to directed graphs, that attracted much attention in the last fifteen years. About their relative strength with respect to “bounded width in one measure implies bounded width in the other” many problems remain unsolved. Only some results separating directed width measures are known. We give an almost complete picture of this relation. For this, we consi...

We define helicopter cops and robber games with multiple robbers, extending previous research, which considered only the pursuit of a single robber. Our model is defined for robbers that are visible (their position in the graph is known to the cops) and active (they can move at any point in the game) but is easily adapted to other variants of the single-robber game that have been considered in ...