P165 - I2CS: 10th International Conference on Innovative Internet Community Systems - Jubilee Edition 2010 -
Auflistung nach:
Auflistung P165 - I2CS: 10th International Conference on Innovative Internet Community Systems - Jubilee Edition 2010 - nach Titel
1 - 10 von 50
Treffer pro Seite
Sortieroptionen
- 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.
- 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.
- KonferenzbeitragAutomated robustness testing for reactive systems: application to communicating protocols(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Khorchef, Fares Saad; Berrada, Ismail; Rollet, Antoine; Castanet, RichardIn the telecommunications field, protocols have to be seriously validated before their startup. Thus, it is necessary to test the conformance of a protocol, but it is also important to test its robustness in presence of unexpected events. This paper proposes a framework to test the robustness of a system. Firstly, we explain how to increase the nominal specification in order to take into account the hazards. Then, we show how to generate test sequences from the increased specification. Finally, we propose a case study on the SSL protocol, using the TGSE tool.
- KonferenzbeitragCharacterization and generation of synthetic data traces for IP traffic modeling(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Reynaga Turrubiartes, Marco Aurelio; Rincón Ferrera, Orlando Ezequiel; Estrada Vargas, Leopoldo; Torres Román, Deni; Muñoz Rodríguez, David; Angulo Bernal, Marlenne; Rizo Domínguez, LuisfgN and fARIMA (0,d,0) are two of the models frequently employed in Internet traffic. However, there is not a set of data traces available. In this work, a set of 187 fGN data traces each one of 64KPoints were generated with three tools: S- Plus, SelQoS; and a fGN-MatlabScript; and a cumulative analysis with 1144 files was done. From this study, it is concluded that the best algorithms respect to the Minimum Mean Squared Error (MMSE) for Hurst index estimates were Modified Allan Variance in time domain far followed for R/S statistic, while in frequency domain Periodogram presented the MMSE followed very close for Local Whittle. A set of 53 "well-behaved" data traces with different theoretical values HT were obtained and will be publicly available. The fGN data traces generated by our tool SelQoS compared with those generated with S-Plus, fGN, fARIMA (0, d, 0), and fGN-MatlabScript showed the best performance relative to MSE. For all data generation methods, the higher H is, the bigger MSE is.
- KonferenzbeitragClassifying business types from twitter posts using active learning(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Thongsuk, Chanattha; Haruechaiyasak, Choochart; Meesad, PhayungToday, many companies have adopted Twitter as an additional marketing medium to advertise and promote their business activities. One possible solution for organizing a large number of posts is to classify them into a predefined category of business types. Applying normal text categorization technique on Twitter is ineffective due to the short-length (140-character limit) characteristic of each post and a large number of unlabeled data. In this paper, we propose a text categorization approach based on the active learning technique for classifying Twitter posts into three business types, i.e., airline, food and computer & technology. By applying the active learning, we started by constructing an initial text categorization model from a small set of labelled data. Using this text categorization model, we obtain more positive data instances for constructing a new model by selecting the test data which are predicted as positive. As shown from the experimental results, our proposed approach based on active learning helped increase the classification accuracy over the normal text categorization approach.
- KonferenzbeitragA comparative study on feature weight in thai document categorization(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Chirawichitchai, Nivet; Sa-nguansat, Parinya; Meesad, PhayungText Categorization is the process of automatically assigning predefined categories to free text documents. Feature weighting, which calculates feature (term) values in documents, is one of important preprocessing techniques in text categorization. This paper is a comparative study of feature weighting methods in statistical learning of Thai Document Categorization Framework. Six methods were evaluated, including Boolean, tf, tfxidf, tfc, ltc, and entropy weighting. We have evaluated these methods on Thai news article corpus with three supervised learning classifiers: Support Vector Machine (SVM), Decision Tree (DT), and Naïve Bayes (NB). We found that ltc weighting method is most effective in our experiments with SVM and DT algorithms, while entropy and Boolean weighting is more effective than the weighting with NB algorithms. Using ltc weighting with a SVM classifier yielded a very high classification performance with the F1 measure equal to 96%.