iversity of Bordeaux

Talence, France

iversity of Bordeaux

Talence, France
Time filter
Source Type

Gomez R.C.,University of Neuchatel | Gonzalez-Herrera I.,iversity of Bordeaux | Bromberg Y.-D.,University of Rennes 1 | Reveillere L.,iversity of Bordeaux | Riviere E.,University of Neuchatel
Proceedings - International Conference on Distributed Computing Systems | Year: 2017

Broadcast is a fundamental operation in Mobile Ad-Hoc Networks (MANETs). A large variety of broadcast algorithms have been proposed. They differ in the way message forwarding between nodes is controlled, and in the level of information about the topology that this control requires. Deployment scenarios for MANETs vary widely, in particular in terms of nodes density and mobility. The choice of an algorithm depends on its expected coverage and energy cost, which are both impacted by the deployment context. In this work, we are interested in the comprehensive comparison of the costs and effectiveness of broadcast algorithms for MANETs depending on target environmental conditions. We describe the results of an experimental study of five algorithms, representative of the main design alternatives. Our study reveals that the best algorithm for a given situation, such as a high density and a stable network, is not necessarily the most appropriate for a different situation such as a sparse and mobile network. We identify the algorithms characteristics that are correlated with these differences and discuss the pros and cons of each design. © 2017 IEEE.

Bromberg Y.-D.,iversity of Bordeaux | Morandat F.,iversity of Bordeaux | Reveillere L.,iversity of Bordeaux | Thomas G.,University Pierre and Marie Curie
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2013

Over the past decade, we have witnessed the emergence of a bulk set of devices, from very different application domains interconnected via Internet to form what is commonly named Internet of Things (IoT). The IoT vision is grounded in the belief that all devices are able to interact seamlessly with each other anytime, anyplace, anywhere. However, devices communicate via a multitude of incompatible protocols, and consequently drastically slow down the IoT vision adoption. Gateways, that are able to translate one protocol to another, appear to be a key enabler of the future of IoT but present a cumbersome challenge for many developers. In this paper, we are providing a framework called EZ that enables to generate gateways for either C or Java platform without requiring from developers any substantial understanding of either relevant protocols or low-level network programming. © 2013 IFIP International Federation for Information Processing.

Gavoille C.,iversity of Bordeaux | Glacet C.,French Institute for Research in Computer Science and Automation | Hanusse N.,French National Center for Scientific Research | Ilcinkas D.,French National Center for Scientific Research
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2013

We present a distributed asynchronous algorithm that, for every undirected weighted n-node graph G, constructs name-independent routing tables for G. The size of each table is Õ(√n), whereas the length of any route is stretched by a factor of at most 7 w.r.t. the shortest path. At any step, the memory space of each node is Õ(√n). The algorithm terminates in time O (D), where D is the hop-diameter of G. In synchronous scenarios and with uniform weights, it consumes Õ(m √n + n3/2 min {D, √n}) messages, where m is the number of edges of G. In the realistic case of sparse networks of poly-logarithmic diameter, the communication complexity of our scheme, that is Õ(n3/2), improves by a factor of √n the communication complexity of any shortest-path routing scheme on the same family of networks. This factor is provable thanks to a new lower bound of independent interest. © Springer-Verlag 2013.

Bhandari S.,Malaviya National Institute of Technology, Jaipur | Gupta R.,Malaviya National Institute of Technology, Jaipur | Laxmi V.,Malaviya National Institute of Technology, Jaipur | Gaur M.S.,Malaviya National Institute of Technology, Jaipur | And 2 more authors.
ACM International Conference Proceeding Series | Year: 2015

Android being the most popular open source mobile operating system, attracts a plethora of app developers. Millions of applications are developed for Android platform with a great extent of behavioral diversities and are available on Play Store as well as on many third party app stores. Due to its open nature, in the past Android Platform has been targeted by many malware writers. The conventional way of signature-based detection methods for detecting malware on a device are no longer promising due to an exponential in-crease in the number of variants of the same application with different signatures. Moreover, they lack in dynamic analysis too. In this paper, we propose DRACO, which employs a two-phase detection technique that blends the synergy of both static and dynamic analysis. It has two modules, client module that is in the form an Android app and gets installed on mobile devices and a server module that runs on a server. DRACO also explains user about the features contributing to the maliciousness of analyzed app and generates scoring for that maliciousness. It does not require any root or super-user privileges. In an evaluation of 18,000 benign applications and 10,000 malware samples, DRACO performs better than several related existing approaches and detects 98.4% of the malware with few false alerts. On ten popular smartphones, the method requires an average of 6 seconds for on device analysis and 90 seconds on server analysis. © 2015 ACM.

Jallageas J.,AST Innovations | Cherif M.,iversity of Bordeaux | K'nevez J.-Y.,iversity of Bordeaux | Cahuc O.,iversity of Bordeaux
SAE International Journal of Materials and Manufacturing | Year: 2013

To reduce the weight of aero structures, composite materials are combined with metallic parts. These multilayer materials are one-shot drilled during the assembly process. During drilling, interactions appear between the different layers creating new quality issues. To improve machining efficiency, the portable semi-automated drilling units commonly used for such operations need to be upgraded. For this purpose, vibration systems have been recently introduced into drilling units. This article first considers the effect of the reciprocating axial movement on the quality of the machined surface, then focuses on the effect of the oscillation parameters (frequency, magnitude) on the cutting process (cutting forces, thermal load, etc.). Experimental and numerical results are used to find the method that produces the optimal vibration setting. This method is then applied to the case of drilling composite-metallic stack. We conclude that specific vibration parameters need to be set up according to the type of material drilled (composite, metallic). A new vibration system concept has therefore been specifically developed to adapt the oscillation magnitudes to each kind of material. The entire mechanism of the system is shown and analytically modeled. In conclusion, the article describes briefly the auto-adaptive drilling technique for an understanding of the benefit of the new vibration system when associated with this technique. © 2013 SAE International.

Karaman S.,iversity of Bordeaux | Benois-Pineau J.,iversity of Bordeaux | Dovgalecs V.,University of Bordeaux | Megret R.,University of Bordeaux | And 4 more authors.
Multimedia Tools and Applications | Year: 2014

This paper presents a method for indexing activities of daily living in videos acquired from wearable cameras. It addresses the problematic of analyzing the complex multimedia data acquired from wearable devices, which has been recently a growing concern due to the increasing amount of this kind of multimedia data. In the context of dementia diagnosis by doctors, patient activities are recorded in the environment of their home using a lightweight wearable device, to be later visualized by the medical practitioners. The recording mode poses great challenges since the video data consists in a single sequence shot where strong motion and sharp lighting changes often appear. Because of the length of the recordings, tools for an efficient navigation in terms of activities of interest are crucial. Our work introduces a video structuring approach that combines automatic motion based segmentation of the video and activity recognition by a hierarchical two-level Hidden Markov Model. We define a multi-modal description space over visual and audio features, including mid-level features such as motion, location, speech and noise detections. We show their complementarities globally as well as for specific activities. Experiments on real data obtained from the recording of several patients at home show the difficulty of the task and the promising results of the proposed approach. © 2012 Springer Science+Business Media, LLC.

Karaman S.,iversity of Bordeaux | Benois-Pineau J.,iversity of Bordeaux | Megret R.,University of Bordeaux | Bugeau A.,iversity of Bordeaux
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2012

In this paper, we propose a new multi-layer structural approach for the task of object based image retrieval. In our work we tackle the problem of structural organization of local features. The structural features we propose are nested multi-layered local graphs built upon sets of SURF feature points with Delaunay triangulation. A Bag-of-Visual-Words (BoVW) framework is applied on these graphs, giving birth to a Bag-of-Graph-Words representation. The multi-layer nature of the descriptors consists in scaling from trivial Delaunay graphs - isolated feature points - by increasing the number of nodes layer by layer up to graphs with maximal number of nodes. For each layer of graphs its own visual dictionary is built. The experiments conducted on the SIVAL and Caltech-101 data sets reveal that the graph features at different layers exhibit complementary performances on the same content. The combination of all layers, yields significant improvement of the object recognition performance. © 2012 Springer-Verlag.

Beaumont O.,French Institute for Research in Computer Science and Automation | Beaumont O.,iversity of Bordeaux | Beaumont O.,French National Center for Scientific Research | Bonichon N.,French Institute for Research in Computer Science and Automation | And 6 more authors.
Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium, IPDPS 2012 | Year: 2012

Malleable tasks are jobs that can be scheduled with preemptions on a varying number of resources. We focus on the special case of work-preserving malleable tasks, for which the area of the allocated resources does not depend on the allocation and is equal to the sequential processing time. Moreover, we assume that the number of resources allocated to each task at each time instant is limited. We consider both the clairvoyant and non-clairvoyant cases, and we focus on minimizing the weighted sum of completion times. In the weighted non-clairvoyant case, we propose an approximation algorithm whose ratio (2) is the same as in the unweighted non-clairvoyant case. In the clairvoyant case, we provide a normal form for the schedule of such malleable tasks, and prove that any valid schedule can be turned into this normal form, based only on the completion times of the tasks. We show that in these normal form schedules, the number of preemptions per task is bounded by 3 on average. At last, we analyze the performance of list schedules, and prove that optimal schedules are list schedules for a special case of homogeneous instances. We conjecture that there exists an optimal list schedule for all instances, which would greatly simplify the study of this problem. Finally, we explore the complexity of the problem restricted to homogeneous instances, which is still open despite its very simple expression. © 2012 IEEE.

Bissyande T.F.,University of Luxembourg | Reveillere L.,iversity of Bordeaux | Lawall J.L.,French Institute for Research in Computer Science and Automation | Bromberg Y.-D.,iversity of Bordeaux | Muller G.,French Institute for Research in Computer Science and Automation
Software - Practice and Experience | Year: 2015

Domain-specific languages (DSLs) are well-recognized to ease programming and improve robustness for a specific domain, by providing high-level domain-specific notations and checks of domain-specific properties. The compiler of a DSL, however, is often difficult to develop and maintain, because of the need to define a specific treatment for a large and potentially increasing number of language constructs. To address this issue, we propose an approach for specifying a DSL compiler using control-flow sensitive concrete-syntax based matching rules. These rules either collect information about the source code to carry out checks or perform transformations to carry out compilation. Because rules only mention the relevant constructs, using their concrete syntax, and hide the complexity of control-flow graph traversal, it is easy to understand the purpose of each rule. Furthermore, new compilation steps can be added using only a small number of lines of code. We explore this approach in the context of the z2z DSL for network gateway development and show that it is beneficial to implement the core of its compiler in this manner. Copyright © 2013 John Wiley & Sons, Ltd.

PubMed | CNRS Laboratory of Condensed Matter Chemistry, Bordeaux, iversity Of Bordeaux, French Institute of Health and Medical Research and University of Rennes 1
Type: | Journal: Nanotoxicology | Year: 2017

Although titanium dioxide nanoparticles (TiO

Loading iversity of Bordeaux collaborators
Loading iversity of Bordeaux collaborators