P165 - I2CS: 10th International Conference on Innovative Internet Community Systems - Jubilee Edition 2010 -
Auflistung P165 - I2CS: 10th International Conference on Innovative Internet Community Systems - Jubilee Edition 2010 - nach Erscheinungsdatum
1 - 10 von 50
Treffer pro Seite
Sortieroptionen
- KonferenzbeitragSome remarks on Andrew secure RPC(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Boonkrong, SirapatWe review the Andrew secure RPC protocol and reveal some unsoundness of it. Some modifications are made to the protocol. The changes made include the encryption in the first message, the expansion of the second and third messages as well as the elimination of the fourth message. Our GNY analysis shows that even though changes have been made, the outcomes of the protocol do not change. That is, both client and server hold the same new secret key shared between themselves.
- KonferenzbeitragOptimizing mobile networks connectivity and routing using percolation theory(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Amor, Soufian Ben; Bui, Marc; Lavallée, IvanMobile Ad-hoc NETworks (MANETs) are complex systems presenting a phase transition phenomenon : an abrupt change in the behavior of the network around a critical value of a certain key parameter. The reliability and connectivity of MANETs depend on their size and on the efficiency of the routing protocol. In this paper we propose a new approach in MANETs modeling, combining percolation theory and epidemic algorithms. Using percolation theory we show the existence of a connectivity threshold (in a square lattice) needed to guarantee the communications in the network, in particular when the number of direct links are limited. Epidemic algorithms are used to provide a good propagation of information in the network wile minimizing the resources cost (energy, number of messages...).
- KonferenzbeitragStemming strategies for European languages(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Savoy, JacquesIn this paper, we describe and evaluate different general stemming approaches for the French, Portuguese (Brazilian), German and Hungarian languages. Based on the CLEF test-collections, we demonstrate that light stemming approaches are quite effective for the French, Portuguese and Hungarian languages, and perform reasonably well for the German language. Variations in mean average precision among the different stemmers are also evaluated and are sometimes found to be statistically significant.
- 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.
- KonferenzbeitragGeneralizing of a high performance parallel Strassen implementation on distributed memory MIMD architectures(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Nguyen, Duc Kien; Lavallee, Ivan; Bui, MarcStrassen's algorithm to multiply two n x n matrices reduces the asymptotic operation count from O(n3) of the traditional algorithm to O(n2.81), thus designing efficient parallelizing for this algorithm becomes essential. In this paper, we present our generalizing of a parallel Strassen implementation which obtained a very nice performance on an Intel Paragon: faster 20% for n ≈ 1000 and more than 100% for n ≈ 5000 in comparison to the parallel traditional algorithms (as Fox, Cannon). Our method can be applied to all the matrix multiplication algorithms on distributed memory computers that use Strassen's algorithm at the system level, hence it gives us compatibility to find better parallel implementations of Strassen's algorithm.
- KonferenzbeitragA multi agent system application to support communities of practice: preliminary analysis(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Sato, Gilson Yukio; Barthès, Jean-PaulThis paper presents a preliminary analysis for applying Multi Agent Systems to Communities of Practice. In this paper, we present some basic issues on Communities of Practice including a definition and some concepts, namely those of identity, trajectory and multi-membership. We analyze the adequacy of the Multi-Agent Systems technology to support Communities of Practice. We show how some characteristics of Communities of Practice can suggest different applications of Multi-Agent Systems, exploring one of the identified possibilities, more specifically the one related with a member's trajectory into and inside a community.
- KonferenzbeitragUse of algorithms for a user specific reduction of amounts of interesting association rules(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Wenke, BirgitThe huge amounts of stored digital data, which are nowadays available in many domains contain lots of previously unknown coherences. For the user it is often difficult or unfeasible to find those coherences he is interested in without any technical support. One kind of these coherences are association rules. This paper presents an iterative procedure which supports the user in finding these association rules he is interested in, by considering his interests without the explicit formulation of these interests by the user in advance. The procedure presents iteratively association rules to the user, who has to value each of them as interesting or uninteresting. With the help of a genetic algorithm the procedure learns interactively the interests of the user and formulates classification rules, which are used to classify the not yet presented association rules in the classes interesting and uninteresting so that only interesting classified association rules are presented to the user in the following. The procedure was evaluated on a standard dataset and a dataset of the web2.0 application flick. The evaluation results show, that the developed procedure is useful for both standard database applications and innovative web2.0 applications. Different genetic methods and scenarios of interests were evaluated. The most interesting evaluation results will be presented in this paper.
- KonferenzbeitragImproving ASR for continuous thai words using ANN/HMM(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Sodanil, Maleerat; Nitsuwat, Supot; Haruechaiyasak, ChoochartThe baseline system of an automatic speech recognition normally uses Mel- Frequency Cepstral Coefficients (MFCC) as feature vectors. However, for tonal language like Thai, tone information is one of the important features which can be used to improve the accuracy of recognition. This paper proposes a method for building an acoustic model for Thai-ASR using a combination of MFCC and tone information as an input feature vector. In addition, we apply Artificial Neural Network (ANN) multilayer perceptrons to estimate the posterior probabilities of a class model given a sequence of observation input. The performance of the ANN approach is compared with the Gaussian Mixture Model (GMM) used in the Hidden Markov Model Toolkit (HTK). The experiments were carried out with 2-grams and 3-grams of language model. The training and test data sets were prepared from reading speech of ten Aesop's stories from 5 male and 5 female speakers. The results showed that the proposed method can be used to improve the performance of Thai-ASR in term of reducing word error rate.
- 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%.
- KonferenzbeitragPerformance evaluation of two self-adaptive routing algorithms in mesh networks(10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 –, 2010) Rojas González, Miguel AngelFollowing the seminal work of Unger et al. based on building mesh-like structures on top of a P2P network, we introduced an improved version of Compass - a routing and load balancing algorithm based on direction-scopes for message delivery in such kind of networks. In this paper we evaluate and compare the performance of this scope-based Compass against the self-balanced and self-adaptive routing algorithm named ColorANT. Moreover, we compare the Compass performance against two routing algorithms: Flooding and a constrained version of Hotpotato.