I2CS: International Conference on Innovative Internet Community Systems
Auflistung nach:
Auflistung I2CS: International Conference on Innovative Internet Community Systems nach Titel
1 - 10 von 94
Treffer pro Seite
Sortieroptionen
- Editiertes Buch
- Editiertes Buch
- KonferenzbeitragActors–media–qualities: a generic model for information retrieval in virtual(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Heinrich, GregorThe article presents a model of the structural properties of virtual communities and the information they can access. It argues that a large part of the information – and actually knowledge – present in virtual communities can be identified by a graph structure that consists of three node types – actors, media and qualities – as well as the relations that connect them. Based on these relations, information retrieval and other inference mechanisms can be mapped into the model.
- KonferenzbeitragAd-hoc community composition of rescue forces in action situations(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Schau, Volkmar; Kirchner, Kathrin; Erfurth, Christian; Eichler, GeraldSecure energy and transport networks, Internet and telecommunications, are vital nerves of our highly networked society. Global mobility makes it difficult to combat and natural disasters and technological accidents can cause serious damage in a closer-knit world. In this paper we introduce the challenges in dynamic community composition of heterogeneous rescue forces (culture clash) for rescue and protection tasks and discuss our approach in the context of the "SpeedUp project" how to present a solution for ad-hoc communication, situation-aware representation, tracking and guiding in dynamic inhomogeneous communities.
- KonferenzbeitragAdaptation process for ad hoc routing protocol(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Yawut, Cholatip; Paillassa, Béatrice; Dhaou, RiadhBecause of several constraints in ad hoc networks, an adaptive ad hoc routing protocol is increasingly required. In this paper, we propose a synopsis of an adaptation process for an adaptive ad hoc routing protocol. Next, we put into practice the analysis of the process of adaptation to mobility by realizing an adaptive routing protocol: CSR (Cluster Source Routing) which is an extension of a widely used ad hoc routing protocol: DSR (Dynamic source Routing). Mobility and density metrics are considered to CSR<->DSR mode switching, it moves from a flat architecture working in DSR to a virtual hierarchical architecture. With this mode switching, CSR can enhance the scalability of the DSR routing protocol.
- KonferenzbeitragAn adaptive policy routing with thermal field approach(9th International Conference On Innovative Internet Community Systems I2CS 2022, 2009) Lertsuwanakul, Lada-On; Unger, HerwigThis paper introduces an adaptive routing approach based on buffer status and distance in a mesh overlay network: Thermal Field is used for considering buffer stage and distance is applied to select routing policy. The path selection process considers the Thermal Field as a metaphor for the buffer usage based on probability in order to avoid message loss by overloaded peers or delay because of big queues, otherwise routing by the shortest way. In addition, the probability of Thermal Field consideration relies on leftover distance to the target instead of using a global constant. The experiment results substantiated our approach using the adaptive probability of routing mechanism works effectively.
- KonferenzbeitragAn algorithm for detecting communities in folksonomy hypergraphs(11th International Conference on Innovative Internet Community Systems (I2CS 2011), 2011) Bothorel, Cécile; Bouklit, MohamedIn 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.
- KonferenzbeitragApplication layer scalable video coding for the iphone(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Spielvogel, Christian; Kropf, PeterVideos streamed over the Internet can be received by mobile devices anywhere and anytime. The challenges for Internet streaming include avoiding data loss and playing back the content in the desired quality. A technique for achieving these goals is Scalable Video Coding (H.264-SVC) that adapts the content to network and device characteristics without transcoding. Since there is no player for rendering scalable video content on mobile phones using more than the base layer, we present our prototype implementation that is able to decode multiple layers of scalable content in the temporal, spatial or quality domain. Currently the prototype is available and has been tested on the iPhone 3G.
- KonferenzbeitragAn approach of semantic cache for mobile devices to enhance the performance of applications(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Caetano, Marcos F.; Ribeiro Dantas, Mario AntonioWireless mobile computing has become a differential aspect to a large number of distributed applications. The main research goal related to this subject is to provide to applications a similar level of services found in structured networks. An example of interesting research topic is to improve the data replication scheme that exists in a mobile device. The use of an elaborate method can represent an improved strategy to enhance the performance and availability of applications to wireless users. In this article we present a semantic cache model study, and its implementation, as a differentiate policy for the local management of data replication. The approach assumes that an answer for a query can be satisfied totally by a local semantic segment, considering the gathering action of partial segments or helping the connection to a server and then receiving the answer. We tested the implementation of the model in a real environment, assuming three classes of queries. The first class was characterized by those queries that could be promptly answered locally. The second type of queries was answered after a local gathering operation of semantic segments. In the last situation, queries were answered after a send-receive operation to a server node in a structured network. The empirical results indicate that the approach has improved successfully the performance of the applications, avoiding unnecessary connections to a server when an answer could be reached using one local cache segment, or gathering information from the local semantic segments to compound the answer. In the case of inexistence of any local semantic segment information to reply a query, the implementation works transparently to connect to a server and then answer the wireless user.