Book Series
2009 EN
Ahmad Sardouk · Rana Rahim-Amoud · Leïla MerghemBoulahia
+1 more
The multi-agent approach has been proposed in the literature as a solution for data gathering, and routing in Wireless Sensor Networks (WSNs). In these propositions, the knowledge of an agent is generally limited to a single parameter such as the energy of the sensor node and/or to the address of its next hop in a routing protocol proposition. In this paper, we propose a strategy for the agent to make a more appropriate decision to cooperate or not in a data gathering session. This strategy uses, in addition to the energy of the node, several parameters from the local view of the agent as the position of the node within the network, the network density, and the information importance degree. Through successive simulations, this strategy has proved its ability to manage cleverly the power consumption of the sensor nodes and hence to extend the WSN life time.
Springer Science+Business Media
Book Series
2009 EN
Marie-Pierre Béal · Dominique Perrin
International audienceČerný’s conjecture asserts the existence of a synchronizing word of length at most (n-1)² for any synchronized n-state deterministic automaton. We prove a quadratic upper bound on the length of a synchronizing word for any synchronized n-state deterministic automaton satisfying the following additional property: there is a letter a such that for any pair of states p, q, one has p·a^r=q·a^s for some integers r, s (for a state p and a word w, we denote by p·w the state reached from p by the path labeled w). As a consequence, we show that for any finite synchronized prefix code with an n-state decoder, there is a synchronizing word of length O(n²). This applies in particular to Huffman codes
Springer Science+Business Media
Book Series
2009 EN
Freddy Cliquet · Guillaume Fertin · Irena Rusu
+1 more
We introduce a new algorithm for the mass spectrometric identification of proteins. Experimental spectra obtained by tandem MS/MS are directly compared to theoretical spectra generated from proteins of evolutionarily closely related organisms. This work is motivated by the need of a method that allows the identification of proteins of unsequenced species against a database containing proteins of related organisms. The idea is that matching spectra of unknown peptides to very similar MS/MS spectra generated from this database of annotated proteins can lead to annotate unknown proteins. This process is similar to ortholog annotation in protein sequence databases. The difficulty with such an approach is that two similar peptides, even with just one modification (i.e. insertion, deletion or substitution of one or several amino acid(s)) between them, usually generate very dissimilar spectra. In this paper, we present a new dynamic programming based algorithm: PacketSpectralAlignment. Our algorithm is tolerant to modifications and fully exploits two important properties that are usually not considered: the notion of inner symmetry, a relation linking pairs of spectrum peaks, and the notion of packet inside each spectrum to keep related peaks together. Our algorithm, PacketSpectralAlignment is then compared to SpectralAlignment [1] on a dataset of simulated spectra. Our tests show that PacketSpectralAlignment behaves better, in terms of results and execution time.
Springer Science+Business Media
Book Series
2009 EN
Thomas Gaudy · Stéphane Natkin · Dominique Archambault
In games, we can discern two approaches to learn how interactivity works: the instructions for use and the interactivity itself. The number of spoken languages is evaluated at more than six thousand eight hundred: for this reason, instructions for use can't make games understandable for all potential users, which is especially true for audio games accessible to visually impaired players, since those games can not count on visual support and have small budgets. Such games don't provide translation, perhaps because of a lack of cost effectiveness. So, if the purpose of a game is to learn in a friendly but challenging way how interactivity can become complex, why not start this process from the very beginning, without the need of textual instructions? Some musical toys have their sighted users accomplish very simple actions in a funny way, without the need of instructions for use. Moreover, video games show us that it is possible to separate the learning process of a complex task in small steps easy to master. We have made a game according to those principles and realized an experiment to test it. All the players managed to progress in the game but not all understood all the principles of the game. For this kind of game, we assume that players do not have to understand the game during the first contact but they have to be encouraged to continue interaction. At last, the increase of the difficulty level has to be very progressive.
Springer Science+Business Media
Book Series
2009 EN
Felix von Reischach · Florian Michahelles · Dominique Guinard
+3 more
Among others, consumer products can be purchased in the Internet and in traditional stores. Each of the two has dedicated advantages. An online survey conducted within the frames of this work investigates these advantages. It motivates the transition of the advantages of online shopping, such as access to recommendations of other consumers, to the sales floor. Recent trends in mobile phone technology, for example the emergence of the mobile Internet, enable exactly this transition, potentially enriching the shopping experience in the real world. A key challenge though is a fast and convenient identification of products. This work compares five product identification modalities for mobile phones in a comparative study. The dependent variables evaluated are `task completion time' and `perceived ease of use'. Our study is the first that quantifies the advantage of automatic identification. The results indicate that automatically identifying a product scanning a tag can be up to eight times faster than entering a product name in a text field. Surprisingly, barcode recognition using a camera phone can be conducted almost as fast and convenient as scanning an RFID tag. Our work provides a benchmark for developers having to choose appropriate identification technology for their mobile application.
Springer Science+Business Media
Book Series
2009 EN
Marco Winckler · Monique NoirhommeFraiture · Dominique L. Scapin
+2 more
The main goal of this workshop is to bring researchers and practitioners together to explore the issues and challenges related to the development of usable and accessible user interfaces for e-Government applications using innovative Information and Communication Technology (ICT). This workshop is the second in a series of workshops organized at IFIP TC 13 Interact conference focused on User Interfaces for e-Government applications. The present edition addresses the emergence of ubiquitous platforms and the multiple access points to e-Government applications. In particular, we are concerned by case studies, theories, applications, and design and evaluation methods for ubiquitous e-Government applications that are committed with the universal access for citizens. DEGAS 2009 is officially supported by the IFIP WG 13.3 on HCI and disability and the IFIP WG 13.2 on Methodologies for User-Centered Systems Design.
Springer Science+Business Media
Book Series
2009 EN
Ahmad Sardouk · Rana Rahim-Amoud · Leïla MerghemBoulahia
+1 more
Gathering information in an energy-efficient and scalable manner from a wireless sensor network is always a basic need. In this work, we use the multi-agent approach in order to build an Information-Importance Based Communication for large scale wireless sensor network data processing. The principal goal of our proposition is to tackle the problem of network density and scalability in an energy efficient manner. Simulation results are provided to illustrate the efficiency of our proposition.
Springer Science+Business Media
Book Series
2009 EN
Pierre Peterlongo · Jacques Nicolas · Dominique Lavenier
+2 more
International audienceDiscovery of molecular markers for efficient identification of living organisms remains a challenge of high interest. The diversity of species can now be observed in details with low cost genomic sequences produced by new generation of sequencers. A method, called c-GAMMA, is proposed. It formalizes the design of new markers for such data. It is based on a series of filters on forbidden pairs of words, followed by an optimization step on the discriminative power of candidate markers. First results are presented on a set of microbial genomes. The importance of further devel- opments are stressed to face the huge amounts of data that will soon become available in all kingdoms of life
Springer Science+Business Media
Book Series
2009 EN
Luz-María Priego-Roche · Dominique Rieu · Agnès Front
Nowadays, organizations aiming to be successful in an increasingly competitive market tend to group together into virtual organizations. Designing the information system (IS) of such virtual organizations on the basis of the IS of those participating is a real challenge. The IS of a virtual organization plays an important role in the collaboration and cooperation of the participants organizations and in reaching the common goal. This article proposes criteria allowing virtual organizations to be identified and classified at an intentional level, as well as the information necessary for designing the organizations’ IS. Instantiation of criteria for a specific virtual organization and its participants, will allow simple graphical models to be generated in a modelling tool. The models will be used as bases for the IS design at organizational and operational levels. The approach is illustrated by the example of the virtual organization UGRT (a regional stockbreeders union in Tabasco, Mexico).
Springer Science+Business Media
Book Series
2009 EN
Marc A. Fournier · JeanMichel Dischler · Dominique Bechmann
In this paper we propose a new polygonization method based on the classic Marching Triangle algorithm. It is an improved and efficient version of the basic algorithm which produces a complete mesh without any cracks. Our method is useful in the surface reconstruction process of scanned objects. It works over the scalar field distance transform of the object to produce the resulting triangle mesh. First we improve the original algorithm in finding new potential vertices in the mesh growing process. Second we modify the Delaunay sphere test on the new triangles. Third we consider new triangles configuration to obtain a more complete mesh. Finally we introduce an edge processing sequence to improve the overall Marching Triangle algorithm. We use a relevant error metric tool to compare results and show our new method is more accurate than Marching Cube which is the most widely used triangulation algorithm in the surface reconstruction process of scanned objects.
Springer Science+Business Media