Learn More
Multiplayer online games form complex semiotic ecologies that include game-generated texts, player-to-player communication and collaboration, and associated websites that support in-game play. This article describes an exploratory study of the massively multiplayer online game (MMO) World of Warcraft (WoW), with specific attention to its qualities as a(More)
A new visual design technique for distributed object systems based on graph transformation is presented. It includes the graphical description of remote object interaction, object migration and replication, communication and synchronization as well as dynamic reconnguration of distributed systems. The notation is built up on UML providing these concepts as(More)
In this paper we present the novel graph mining algorithm Edgar which is based on the well-known gSpan algorithm. The need for another subgraph miner results from procedural abstraction (an important technique to reduce code size in embedded systems). Assembler code is represented as a data flow graph and subgraph mining on this graph returns frequent code(More)
Two hundred and eighty patients with stigmata of recent or active bleeding from a peptic ulcer were followed up after endoscopic or conservative medical treatment. Of the patients 53% had no history of dyspeptic symptoms, but 17% and 10% had a history of uncomplicated ulcer or bleeding ulcer, respectively, before the index admission. After 8 years of(More)
 The use of leukocyte-depleted blood components has become the standard therapy for multiply transfused patients during the past few years, as a measure to reduce the frequency of alloimmunization and refractoriness. We assessed frequency and causes of refractoriness, defined as a repeated 24-h post-transfusion platelet count below 20 000/μl, in 145(More)
Several new miners for frequent subgraphs have been published recently. Whereas new approaches are presented in detail, the quantitative evaluations are often of limited value: only the performance on a small set of graph databases is discussed and the new algorithm is often only compared to a single competitor based on an executable. It remains unclear,(More)
SUMMARY Searches for variable motifs such as protein-binding sites or promoter regions are more complex than the search for casual motifs. For example, in amino acid sequences comparing motifs alone mostly proves to be insufficient to detect regions that represent proteins with a special function, because the function depends on biochemical properties of(More)
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecular fragments in a database of molecules represented as two-dimensional graphs. However, the search process in arbitrary graph structures includes costly graph and subgraph(More)