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 Erscheinungsdatum

Zu einem Punkt im Index springen:
1 - 10 von 26
  • 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
    Simulating individual and cooperation node behavior within a ring network
    (11th International Conference on Innovative Internet Community Systems (I2CS 2011), 2011) Akinalp, Coskun; Unger, Herwig
    The performance of networks is usually linked to network-related aspects such as bandwidth and protocols. However, behind every network element there are users who may organize their relations to others. But which organizational structures are successful for individuals and groups and how can the data traffic be optimized for network infrastructure? By means of a network creation game, this paper examines the results of different network structures and compares individual decisions to grouping behaviours. The experiments were simulated in the form of a ring network which enables individual nodes to create long links (direct connections between nodes) to other nodes based on their account values. For one group within the network, an extended approach was tested, i.e. there was the option of having the behaviours of decentralized”democracy” or centralized-hierarchical”kingdom” organizations? manage the long links within the group. The results of the simulations for different power law distributions of messages show that cooperation within the structures, compared to the individual node, differ in terms of routing steps, account values and the stable management of long links. We find that the hierarchical approach represents successful network transactions for different grouping sizes.
  • Konferenzbeitrag
    An MTM based watchdog for malware famishment in smartphones
    (11th International Conference on Innovative Internet Community Systems (I2CS 2011), 2011) Ugus, Osman; Westhoff, Dirk
    Due to their various wireless interfaces, a continuously increasing number of fishy Apps, and due to their raising popularity, smartphones are becoming a promising target for attackers. Independently of the point of entrance, malwares are typically attached to an App to perform their malicious activities. However, malware can only do harm on a smartphone if it is executed. We thus propose a malware prevention architecture for smartphones that exploits App signatures, process authentication during their creation, and process verification during their execution and scheduling. The proposed security mechanism will allow a smartphone to run only those Apps which are classified as trusted (i.e., signed Apps) and which are not modified after their installation. The trust derived from the App signatures and a Mobile Trusted Module (MTM) is propagated through the processes until their execution via process authentication. The MTM serves as a trust anchor for our malware famishment in smartphones. This work presents our solution conceptually. We will soon start with a proof of concept implementation and a performance study using a software based MTM emulator.
  • Konferenzbeitrag
    On using a distributed approach for help in medical diagnosis with wireless sensor networks
    (11th International Conference on Innovative Internet Community Systems (I2CS 2011), 2011) Dessart, Nathalie; Fouchal, Hacène; Hunel, Philippe; Vidot, Nicolas
    In this paper, we focus on providing new tools to help doctors in their diagnosis. We study the feasibility of using a distributed approach over Wireless Sensor Networks (WSN). We define a Wireless Body Area Network (WBAN) as a set of wireless sensors which equipped a patient. Each sensor senses a health parameter, for example, temperature or heart pulse. Our aim is to understand how a distributed approach can be a fair alternative to the common centralized paradigm. We study a distributed approach based on the token paradigm. Then, we compare this approach to the centralized one, throw simulations and experimentations over real sensors.
  • 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.
  • Konferenzbeitrag
    Moving geo databases to smart phones - an approach for offline location-based applications
    (11th International Conference on Innovative Internet Community Systems (I2CS 2011), 2011) Roth, Jörg
    Mobile location-based services usually access large geo databases via a wireless network. Sometimes it is useful to store a certain amount of geo objects on the mobile device. In this paper we present an approach to store geo data in an embedded SQL database on smart phones. Besides the storage of geometries in SQL tables we have to provide an efficient geometric indexing mechanism. We used the Extended Split Index that successfully was used for large server geo databases. Due to the special characteristics of embedded smart phone databases we have to introduce an extension, the In-Memory Index. Our paper concludes with performance considerations.
  • 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
    Significance of low frequent terms in patent classification using IPC hierarchy
    (11th International Conference on Innovative Internet Community Systems (I2CS 2011), 2011) Khattak, Akmal Saeed; Heyer, Gerhard
    International Patent Classification (IPC) is a standard taxonomy or hierarchy maintained by WIPO (World Intellectual Property Organization). Using this standard hierarchy, patents are classified using machine learning techniques. The first sets of experiments investigate the effect on classification performance at different levels (section, class, subclass and main group level) of IPC hierarchy. Experiments show that there is a decrease in performance going deep down the hierarchy and at the higher level of detail, the accuracy is very low. This might be due to inclusion of more general terms than specific terms. The deeper level (higher level of details) of hierarchy is more specific. The internal nodes of a hierarchy are more general than the leaf nodes and the leaf nodes are more specific than the internal nodes. Classification at different levels of hierarchy considering low frequent terms were investigated. Low frequent terms can refer to specific terms and it cannot be ignored as noise. The second set of experiments focuses on what field of patents optimize the classification accuracy at different levels of detail. The third set of experiments focuses on the significance of low frequent terms across the IPC hierarchy. Experiments show that by including low frequent terms, the accuracy at higher level of details can be improved significantly. The low frequent terms set outperforms full terms set in achieving better performance in terms of accuracy and it also reduces the dimension of text substantially.
  • Konferenzbeitrag
    Performance comparison of some message transport protocol implementations for agent community communication
    (11th International Conference on Innovative Internet Community Systems (I2CS 2011), 2011) Nguyen, Phuong T.; Schau, Volkmar; Rossak, Wilhelm
    Like in any distributed community systems, communication in Multi-Agent System (MAS) plays an important role. Communication helps agents share knowledge and cooperate. Agent communication may present at various forms; it can be the exchange of comprehensible messages, a request to perform an action, or cooperation negotiation. Agent communication has common properties like in any other distributed community systems, but it is the use of Agent Communication Language (ACL) that differentiates agent communication from that in other distributed community systems. In this paper, we present an evaluation of some typical Message Transport Protocol (MTP) implementations for agent communication. In order to analyze performance and stability of these MTPs, the tests have been conducted in conjunction with three existing ACL message encoding schemes.
  • Konferenzbeitrag
    Latent semantic social graph model for expert discovery in Facebook
    (11th International Conference on Innovative Internet Community Systems (I2CS 2011), 2011) Al-Kouz, Akram; Luca, Ernesto William de; Albayrak, Sahin
    Expert finding systems employ social networks analysis and natural language processing to identify candidate experts in organization or enterprise datasets based on a user's profile, her documents, and her interaction with other users. Expert discovery in public social networks such as Facebook faces the challenges of matching users to a wide range of expertise areas, because of the diverse human interests. In this paper we analyze the social graph and the user's interactions in the form of posts and group memberships to model user interests and fields of expertise. The proposed model reflects expertise and interests of users based on experimental analysis of the explicit and implicit social data in Online Social Networks (OSNs). It employs social networks analysis, text mining, text classification, and semantic text similarity techniques to analyze and discover the latent semantic social graph model that can express user's expertise. The proposed model also considers the semantic similarity between user's posts and his groups, Influence of friendship on group's membership, and Influence of friendship on user's posts. Experiments on the Facebook data show significant validity of the proposed model.