Oligomeric Coiled-Coil Adhesin YadA Is a Double-Edged Sword

Yersinia adhesin A (YadA) is an essential virulence factor for the food-borne pathogens Yersinia enterocolitica and Yersinia pseudotuberculosis. Suprisingly, it is a pseudogene in Yersinia pestis. Even more intriguing, the introduction of a functional yadA gene in Y. pestis EV76 was shown to correlate with a decrease in virulence in a mouse model. Here, we report that wild type (wt) Y. enterocolitica E40, as well as YadA-deprived E40 induced the synthesis of neutrophil extracellular traps (NETs) upon contact with neutrophils, but only YadA-expressing Y. enterocolitica adhered to NETs and were killed. As binding seemed to be a prerequisite for killing, we searched for YadA-binding substrates and detected the presence of collagen within NETs. E40 bacteria expressing V98D,N99A mutant YadA with a severely reduced ability to bind collagen were found to be more resistant to killing, suggesting that collagen binding contributes significantly to sensitivity to NETs. Wt Y. pestis EV76 were resistant to killing by NETs, while recombinant EV76 expressing YadA from either Y. pseudotuberculosis or Y. enterocolitica were sensitive to killing by NETs, outlining the importance of YadA for susceptibility to NET-dependent killing. Recombinant EV76 endowed with YadA from Y. enterocolitica were also less virulent for the mouse than wt EV76, as shown before. In addition, EV76 carrying wt YadA were less virulent for the mouse than EV76 expressing YadAV98D,N99A. The observation that YadA makes Yersinia sensitive to NETs provides an explanation as for why evolution selected for the inactivation of yadA in the flea-borne Y. pestis and clarifies an old enigma. Since YadA imposes the same cost to the food-borne Yersinia but was nevertheless conserved by evolution, this observation also illustrates the duality of some virulence functions

A Simple Parallel Implementation of Interaction Nets in Haskell

Due to their "inherent parallelism", interaction nets have since their introduction been considered as an attractive implementation mechanism for functional programming. We show that a simple highly-concurrent implementation in Haskell can achieve promising speed-ups on multiple cores

Super-KMS functionals for graded-local conformal nets

Motivated by a few preceding papers and a question of R. Longo, we introduce super-KMS functionals for graded translation-covariant nets over R with superderivations, roughly speaking as a certain supersymmetric modification of classical KMS states on translation-covariant nets over R, fundamental objects in chiral algebraic quantum field theory. Although we are able to make a few statements concerning their general structure, most properties will be studied in the setting of specific graded-local (super-) conformal models. In particular, we provide a constructive existence and partial uniqueness proof of super-KMS functionals for the supersymmetric free field, for certain subnets, and for the super-Virasoro net with central charge c>= 3/2. Moreover, as a separate result, we classify bounded super-KMS functionals for graded-local conformal nets over S^1 with respect to rotations.Comment: 30 pages, revised version (to appear in Ann. H. Poincare

Dependability Analysis of Control Systems using SystemC and Statistical Model Checking

Stochastic Petri nets are commonly used for modeling distributed systems in order to study their performance and dependability. This paper proposes a realization of stochastic Petri nets in SystemC for modeling large embedded control systems. Then statistical model checking is used to analyze the dependability of the constructed model. Our verification framework allows users to express a wide range of useful properties to be verified which is illustrated through a case study

A design model for Open Distributed Processing systems

This paper proposes design concepts that allow the conception, understanding and development of complex technical structures for open distributed systems. The proposed concepts are related to, and partially motivated by, the present work on Open Distributed Processing (ODP). As opposed to the current ODP approach, the concepts are aimed at supporting a design trajectory with several, related abstraction levels. Simple examples are used to illustrate the proposed concepts