Logo des Repositoriums

P186 - I2CS 2011: 11th International Conference on Innovative Internet Community Systems

https://dl.gi.de/handle/20.500.12116/18976
Auflistung nach:

Auflistung P186 - I2CS 2011: 11th International Conference on Innovative Internet Community Systems nach Titel

1 - 10 von 26
  • Editiertes Buch
  • Konferenzbeitrag
    An algorithm for detecting communities in folksonomy hypergraphs
    (11th International Conference on Innovative Internet Community Systems (I2CS 2011), 2011) Bothorel, Cécile; Bouklit, Mohamed
    In this article, we are interested in social resource sharing systems such as Flickr, which use a lightweight knowledge representation called folksonomy. One of the fundamental questions asked by sociologists and actors involved in these online communities is to know whether a coherent tags categorization scheme emerges at global scale from folksonomy, though the users don't share the same vocabulary. In order to satisfy their needs, we propose an algorithm to detect clusters in folksonomies hypergraphs by generalizing the Girvan and Newman's clustering algorithm. We test our algorithm on a sample of an hypergragh of tag co-occurrence extracted from Flickr in September 2006, which gives promising results.
  • Konferenzbeitrag
    An architecture for smart semantic recommender applications
    (11th International Conference on Innovative Internet Community Systems (I2CS 2011), 2011) Lommatzsch, Andreas; Plumbaum, Till; Albayrak, Sahin
    With the growing availability of semantic datasets, the processing of such datasets becomes the focus of interest. In this paper, we introduce a new architecture that supports the aggregation of different types of semantic data and provides components for deriving recommendations and predicting relevant relationships between dataset entities. The developed system supports different types of data sources (e.g. databases, semantic networks) and enables the efficient processing of large semantic datasets with several different semantic relationship types. We discuss the presented architecture and describe an implemented application for the entertainment domain. Our evaluation shows that the architecture provides a powerful and flexible basis for building personalized semantic recommender systems.
  • Konferenzbeitrag
    Automatic web service testing from WSDL descriptions
    (11th International Conference on Innovative Internet Community Systems (I2CS 2011), 2011) Salva, Sébastien; Rollet, Antoine
    Web Services fall under the so-called emerging technologies category and are getting more and more used for Internet applications or business transactions. Currently, there is an important need for validation techniques of web service based architectures. Web services, that are currently proposed into UDDI registries, are not always tested. And for most of them, no specification is provided. So, we propose in this paper, a testing method which can generate test cases only from WSDL descriptions. This method is able to check the following aspects: operation existence, exception management, and session management. We express how to generate test cases and we describe a testing framework, composed of a web service tester, which executes test cases and gives the final test verdict.
  • Konferenzbeitrag
    Challenges in designing technology for reducing the need for synchronous communication in the perioperative environment
    (11th International Conference on Innovative Internet Community Systems (I2CS 2011), 2011) Wienhofen, Leendert W. M.; Toussaint, Pieter J.
    This paper describes health informatics as a field of research and some of the challenges that are faced when designing a complex event processing middleware gathering input from multiple legacy sources in a hospital environment. The goal of the system is to reduce the need for synchronous communication between medical stakeholders by creating a situational awareness and thereby cause fewer interruptions.
  • Konferenzbeitrag
    Challenges in health informatics and their relevance to Internet communities
    (11th International Conference on Innovative Internet Community Systems (I2CS 2011), 2011) Wienhofen, Leendert W. M.
    Making relevant information available to stakeholders is not an easy task, especially not in a distributed working environment such as a hospital. Digital events do or do not (partially) represent actual real life events and the quality of the aggregation of digital events can not always be guaranteed. Capturing, typing, aggregating and distributing events is a challenge. Many of the problems we see in the hospital are also relevant for internet and mobile communities. Also here we see that people are typically at different places when they communicate and that different communication paradigms are used. Questions such as: “Where is person X?”, “Which information to distribute to whom?” and “Are there any restrictions and if yes, how to impose these?” are as relevant here as in the hospital. During this talk, by means of a real example, parallels between the “hospital community” and other communities will be drawn.
  • Konferenzbeitrag
    Code attestation with compressed instruction code
    (11th International Conference on Innovative Internet Community Systems (I2CS 2011), 2011) Vetter, Benjamin; Westhoff, Dirk
    Available purely software based code attestation protocols have recently been shown to be cheatable. In this work we propose to upload compressed instruction code to make the code attestation protocol robust against a so called compresssion attack. The described secure code attestation protocol makes use of proposed microcontroller architectures for reading out compressed instruction code.
  • Konferenzbeitrag
    Consensus and relation networks
    (11th International Conference on Innovative Internet Community Systems (I2CS 2011), 2011) Ahat, Murat; Bennani, Omar; Bui, Marc; Amor, Soufian Ben
    In this paper, we propose an extension to bounded confidence model which is a nonlinear opinion dynamics model. The goal of this new extension is to emphasize the underlying network structure of the model, since in real life network structure plays an important , if not vital, role in opinion dynamics. And with simulation results, we show how networks, such as grid and scale-free, affect the consensus formation in bounded confidence model separately as well as together.
  • Konferenzbeitrag
    Data structures and algorithms for pretopology: the Java based software library PretopoLib
    (11th International Conference on Innovative Internet Community Systems (I2CS 2011), 2011) Levorato, Vincent; Bui, Marc
    PretopoLib (http://pretopolib.complexica.net/) is a library of data types and algorithms based on pretopology theory. Its interest is its data structures representing mathematical relations and neighborhood definitions. The main features of the library are a clear separation of computation and visualization, efficient sets data types, and its ease of use to build model or application prototypes in the complex systems simulation framework.
  • Konferenzbeitrag
    Identifying good connections in an unstructured peer-to-peer network: the case of Gnutella
    (11th International Conference on Innovative Internet Community Systems (I2CS 2011), 2011) Babin, Gilbert; Larocque, Denis; Dine, Abdessamad
    Past studies have shown the unstability of unstructured peer-to-peer networks and in particular Gnutella. Because of this unstability, queries in these networks are inefficient. Furthermore, to keep the network stable, the protocols used require huge bandwidth usage. One approach proposed by Gnutella conceptors is to create two classes of servents: leaf nodes and ultrapeers. The core of the network is preserved by the ultrapeers, while the leaf nodes remain at the periphery. Others suggest to use random walks rather than flooding. We also see suggestions to build communities to reduce traffic. In this paper, we investigate the possibility to use a different, yet complementary approach, where a node would only keep connections that it deems “good”. Based on statistics collected on the Gnutella network, we show that it is possible to rapidly determine whether a connection is good or not. The detection of good connections uses two criteria: the duration of connection establishment time and the number of messages received through the connection.