1 Vehicles as Big Data Carriers: Road Map Space Reduction and Efficient Data Assignment Benjamin Baron, Prométhée Spathis, Hervé Rivano, Marcelo Dias de Amorim To cite this version: Benjamin Baron, Prométhée Spathis, Hervé Rivano, Marcelo Dias de Amorim. Vehicles as Big Data Carriers: Road Map Space Reduction and Efficient Data Assignment. VTC2014-Fall - IEEE 80th Vehicular Technology Conference, Sep 2014, Vancouver, Canada <hal > HAL Id: hal Submitted on 22 May 2014 HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
2 Vehicles as big data carriers: Road map space reduction and efficient data assignment Benjamin Baron, Prométhée Spathis, Hervé Rivano, and Marcelo Dias de Amorim, UPMC Sorbonne Universités Inria, U. de Lyon, INSA-Lyon CITI CNRS Abstract We advocate the use of a data shuttle service model to offload bulk transfers of delay-tolerant data from the Internet onto standard vehicles equipped with data storage capabilities. We first propose an embedding algorithm that computes an offloading overlay on top of the road infrastructure. The goal is to simplify the representation of the road infrastructure as raw maps are too complex to handle. In this overlay, each logical link maps multiple stretches of road from the underlying road infrastructure. We formulate then the data transfer assignment problem as a novel linear programming model that determines the most appropriate logical paths in the offloading overlay for a data transfer request. We evaluate our proposal using actual road traffic counts in France. Numerical results show that we can satisfy weekly aggregate requests in the petabyte range while achieving cumulative bandwidth above 10 Gbps with a market share of 20% and only one terabyte of storage per vehicle. I. INTRODUCTION We propose a disruptive offloading service model to handle the growth of demand for bandwidth-intensive background services that have strained the Internet infrastructure to its limits (such as maintenance activities, data migration, and online backups) . Our service exploits the delay-tolerant nature of the background Internet traffic to deliver massive amount of data over the conventional road infrastructure, relieving the Internet from this traffic while providing a reliable and robust transfer. The idea is to take advantage of the increasing number of journeys involving vehicles, which remain by far the most commonly used mode of transport. We argue in favor of equipping standard electric vehicles with data storage capability as part of the recent development in the automotive sector. Vehicles so equipped act as data shuttles delivering data in large quantities from the producer repositories to the destination points. We consider the model in which electric vehicles charge or replace their depleted batteries at charging or swapping stations, respectively. In our model, we propose that these stations serve as offloading spots where vehicles can load/deliver data (making all the process totally transparent to the driver). Thus, vehicles take turns carrying the data to its destination by loading and unloading it at offloading spots. Related proposals suggest offloading Internet data onto other transmission media such as planes , postal services , or even birds . These approaches allow saving some bandwidth from the Internet and even reducing the costs compared to other solutions such as renting a dedicated line. Nevertheless, they fail to achieve massive offloading and can be used only in very specific situations. As we will show later in this paper, our solution is more ambitious and can achieve rates of several gigabytes per second for a global amount of data reaching a petabyte per week. A major challenge toward our vision is how to assign a data transfer request onto the road infrastructure. We provide a mathematical optimization formulation of this problem. We first propose a mapping algorithm that creates an offloading overlay network on top of the road infrastructure. Nodes in the overlay network are connected through virtual links, which correspond to logical paths connected by multiple stretches of road in the underlying road infrastructure. Each virtual link is characterized by a set of attributes such as delay, capacity, and data losses. The offloading overlay network provides an abstract view of the resources that may be allocated to a particular data transfer. Second, we formulate the data transfer assignment problem as a novel linear programming model that determines the optimal logical paths consisting of a set of offloading spots connected together by logical links in the offloading overlay. We provide numerical results using actual road traffic counts in France. The offloading spots are determined to ensure full coverage of all data transfer requests. The search space is further reduced by restricting the physical paths that satisfy the delay requirements. In summary, our main contributions in this paper are: Space reduction. We design a mapping algorithm that creates the offloading overlay that mitigates the complexity of the road infrastructure and gives a coherent representation of the underlying resources. Data transfers. We formulate the data transfer assignment problem as a novel linear programing model. The model provides the optimal logical paths on the offloading overlay for a given data transfer request. System capacity. We evaluate the offloading service model for the data transfer assignment problem using actual road traffic counts of the main roads of France. The results show impressive numbers, with potential transfers in the order of a petabyte during a one-week time window. II. PRINCIPLES We consider a bimodal data transportation service that combines the legacy Internet with flows of vehicles traveling roads. Our offloading service aims at overcoming the limitations of the Internet in terms of capacity when it comes to transfer large amounts of delay-tolerant data. We assume that vehicles are equipped with some storage capacity and a network of offloading spots provides the locations where vehicles can
3 2 load/deliver data. Offloading spots could be battery charging and swapping stations as the ones Tesla is currently rolling out both in Europe and North America . At offloading spots, data can be either transferred onto the storage devices of the vehicles or the latter can be exchanged for preloaded storage devices that match the destination of the vehicle. 1 This offloading service allows to relieve the Internet of the background traffic by transferring it on the road infrastructure using vehicles that will take turns to carry the data to its destination. Hence, the background traffic will not hinder both the elastic and interactive traffic, which are under stricter constraints (in terms of delay and throughput) . The service further provides a robust transfer of high volumes of data, as the transfer is spread over multiple independent vehicles going in different directions. Finally, we assume the on-board storage cannot be accessed by the drivers and the data is encrypted, preventing anyone from reading the content. III. OFFLOADING SERVICE MODEL AND NOTATIONS The problem we introduce is twofold: (1) to propose a mapping algorithm to create the offloading overlay network on top of the road infrastructure and (2) to model the data transfer assignment problem with a linear programing model that aims at maximizing the revenue on the offloading overlay. A. Offloading overlay The road infrastructure is represented as a directed graph G R = (N R, L R ) where N R and L R refer to the set of nodes (junctions and stations where vehicles can charge/replace their depleted batteries) and links (stretches of road), respectively. The road infrastructure has many characteristics to be taken into account, such as the flow of vehicles from an origin to a destination, the capacity, the free-flow speed, and the travel time of the stretches of road. We introduce an offloading overlay to aggregate these properties in a simplified representation of the road infrastructure. The offloading overlay is a bijection from the stations of the road infrastructure to offloading spots and a mapping from physical paths between pairs of stations to logical links connecting pairs of offloading spots. We denote the offloading overlay by a directed graph G O = (N O, L O ), where N O and L O refer to the set of nodes (offloading spots mapping the stations) and links (logical links between the offloading spots), respectively. The logical links are characterized a logical by the weighted travel time t(i, j), aggregated capacity c(i, j), and data leakage L(i, j), that is the proportion of data lost on logical link (i, j) L O. In Fig. 1, we show an example of a possible realization of an overlay on top of the French road infrastructure. B. Data transfer assignment problem We consider data transfer requests, denoted R st, where data has to be delivered from a source offloading spot s N O to a target offloading spot t N O, within a maximal delay T st, and with a leakage tolerance L st. We denote by R the matrix 1 The authors are conscious that there are some privacy issues involved in this process, but they are out of the scope of this paper. Fig. 1: France main roads infrastructure (the darker and bolder the stretches of road, the higher the AADT) and the offloading overlay above. The AADT (Annual Average Daily Traffic) is the volume of traffic over a year divided by the number of days in the year. of all requests indexed by all sources and destinations. The leakage tolerance 0<L st 1 refers to the proportion of data that can be lost during the transfer. Finally, we denote by B st the total amount of data (including redundant data) transferred between s and t. We assume that all offloading spots replicate data on multiple outgoing vehicles. For a given request R st, each offloading spot i replicates the data ρ st (i, j) times when allocated on logical link (i, j) L O (i.e., the same data is loaded onto ρ st (i, j) vehicles). Such replication is needed to mitigate the logical link leakage L(i, j) and satisfy the leakage tolerance L st of the request. Given a request R st, our offloading service is subject to a gain factor γ st and an operational cost α i. γ st is the gain factor in terms of cost to send data from s to t using our offloading service over the legacy Internet (e.g., a dedicated connection between s and t). Without loss of generality, we assume that γ st is linear with the volume of data transferred (i.e., for one bit we transfer using our offloading service, we save γ st compared to the legacy Internet). α i is the operational cost at offloading spot i to handle the storage of data that is unloaded from incoming vehicles. In the following, we state our data delivery problem as a linear optimization problem. We define the revenue as the difference between the gain we generate using the offloading service to transfer B st data within duration T st and the cost of handling the data at the offloading spots. This problem aims at maximizing the revenue, which is constrained by the delay tolerance T st and the capacity c(i, j) of the logical links. IV. MAPPING OF THE OFFLOADING OVERLAY A logical link (i, j) L O (see Section III-A) is characterized by a travel time t(i, j), an aggregated capacity c(i, j), and a data leakage L(i, j). In the following, we consider O-D flows between two stations, i.e., flows that go from station i N S to station j N S. Let r be the number of reasonable paths between i and j, i.e., paths that do not backtrack. 2 The value r depends on the traffic assignment 2 A path that does not backtrack is a path that takes a traveler away from origin and closer to destination.
4 3 strategy that we consider (e.g., All-or-Nothing, Wardrop s equilibrium, or Dial s stochastic assignments) , . A. Travel time of logical links For stretch of road (a, b) L R, let v ab be its nominal volume of vehicles (vehicles per unit of time), c ab be its capacity (vehicles per unit of time), and t ab (0) be its corresponding travel time at free-flow speed (i.e., when v ab = 0). The travel time of (a, b) is given by the BPR (Bureau of Public Roads) function defined as : [ ) ] β t ab (v ab ) = t ab (0) 1+α ( vab c ab, (1) where α and β are BPR parameters that depend on the road profile (α = 0.15 minutes andβ = 4.0 are typically used) . We can deduce from Eq. (1) the travel time of physical path p, denoted t p, which is the sum of all travel times of the stretches of road the path consists of (we do not consider any turning delays at junctions): t p = (a, b) p t ab (v ab ). (2) From Equation (2), we deduce an expression of the average travel time t(i, j) experienced on the r physical paths between nodes i and j, weighted by the road traffic flow v p on each path p: p P t(i, j) = t pv ij p r p P v, (3) ij p where P ij is the set of all simple physical paths between i and j (i.e., with no cycles in the path). B. Capacity at logical links The capacity c(i, j) of the overlay link (i, j) L O depends on the sum of the traffic flows v p of the simple paths between offloading spots i and j (i.e., the number of vehicles per unit of time going from i to j on path p). It also depends on the market share M of the vehicles participating in the offloading service and the storage size S on each vehicle: C. Leakage of logical links c(i, j) = M S p P ij v p. (4) The leakage L(i, j) (comprised between 0 and 1) of logical link (i, j) L O represents the proportion of data that is lost on logical link (i, j). The leakage increases as more vehicles carrying data prematurely exit the road (e.g., the vehicles may exit the highway before reaching the offloading spot or an accident may have occurred). V. OFFLOADING SERVICE REVENUE MAXIMIZATION We denote by p a logical simple path (i.e., without any cycles) defined as a set of offloading spots connected by logical links. We denote by P st the set of all logical simple paths between s and t. We define the travel time t(p) experienced on logical path p P as the sum of the travel times t(i, j) on the logical links that compose path p and the waiting time t i at each intermediate offloading spot on the path: t(p) = (i, j) p ( t(i, j)+ti ). (5) We denote by f(p) the resulting flow (bandwidth) on logical path p P st for a given request R st. For the same request, the transfer of an amount of data B st is constrained by the delay tolerance T st and does not depend on replication of data. Hence, the delay constraint is the same for both models. The delay to transfer B st between s and t is expressed as the sum of the duration to transfer this quantity over all logical paths between s and t and the average travel time experienced on these paths, weighted by the flow on each path. The delay constraint is expressed as: p Pst f(p)t(p) B st p P f(p) + p P f(p) T st. (6) st st Eq. (6) is not a linear expression, which can lead to some difficulties to solve the linear optimization problem. But it can be rewritten as the following linear expression: ( f(p) T st t(p) ) B st. (7) p P st In the model we consider, offloading spots store and replicate data. Consider a given request R st with leakage tolerance L st and p P st a path between s and t. If ρ st (i, j)f(p) data is transmitted on overlay link (i, j) p, f(p) data is received at destination offloading spot j. Here, the replication factor ρ st (i, j) is calculated by each offloading spot i that sends data to remote offloading spot j on logical link (i, j) L O as a function of L st and L(i, j) as follows: L(i, j) ρst (i,j) L st = ρ st (i, j) log(lst ) log(l(i, j)) (8) The flow on logical link (i, j) L O is expressed as the sum of all flows sent by offloading spot i to offloading spot j on logical link (i, j) for data transfer request R st. The flow is constrained by the capacity of the logical link c(i, j): s,t R p P st p (i, j) ρ st (i, j)f(p) c(i, j) (9) The revenue is expressed as the gain of our offloading service compared to an Internet technique (using the gain factor γ st ) minus the operational cost (costs α i at each offloading spot i). Our objective is to maximize the total revenue, expressed as:
5 4 s,t R B st γ st i N O α i f(p). (10) We note that if Eq. (10) is optimal (i.e., maximized), then Eq. (7) becomes an equality since the quantities B st are constrained only in this equation and γ st > 0. Now, if we consider an equality instead of an inequality for the delay constraint Eq. (7), when replacing B st with its expression, the total revenue objective can be rewritten as: [ f(p) γ st ( T st t(p) ) α(p) ], (11) s,t Rp P st where α(p) = i p α i. In Eq. (11), if γ st( T st t(p) ) α(p) is negative, then f(p) is null (objective function decreases otherwise). Hence, from Eq. (11), we have: p i t(p)+ α(p) γ st T st = f(p) = 0. (12) Since Eq. (12) is a weight on the logical paths (resulting from the weights of the arcs) that depends only on the overlay graph, it allows narrowing the search space of the paths that do not satisfy Eq. (12). Finally, the formulation can be reduced to the total revenue maximization objective that is subjected to the capacity constraint on each logical link (i, j) L O : Maximize Subject to s,t R p P st p (i, j) s,t R p P st f(p)ψ st (p) ρ st (i, j)f(p) c(i, j) (i, j) L O where ψ st (p) = γ st( T st t(p) ) α(p) can be considered as a weight on logical path p P st. The amount of data transferred B st within the delay tolerance imposed by request R st is deduced from Eq. (7): B st = ( f(p) T st t(p) ) (13) p P st We can finally obtain from Eq. (13) the average bandwidth of request R st by dividing the amount of data B st by the duration of the transfer T st. VI. EVALUATION We evaluate our offloading service model with real traffic datasets measured in France s road infrastructure. A. Dataset and planning of the network of stations We use road traffic data collected in 2011 on the major stretches of road in France . The dataset shows AADT (Annual Average Daily Traffic), i.e., the total volume of traffic measured on both directions of the stretches of road for a year divided by the number of days in the year. The graph is composed of 3,310 edges covering over 20,000 km of roads. Chosen Stations Candidate Stations Demands Roads km (a) Allocation of stations over the French road infrastructure. Capacity (Gbps) Offloading spots Roads km (b) Offloading overlay with the average capacity of overlay links. Fig. 2: Facility-allocation result and offloading overlay. The big dots are the chosen stations. We consider a network of stations equivalent to the one Tesla is currently rolling out in North America . Since there is no such a network in France for the time being, we plan a simple yet realistic network of stations over the road infrastructure of France. We consider a facility-allocation problem that minimizes the number of facilities to allocate, a problem we adapted from the maximal covering location problem . The problem takes demand points and candidate locations as inputs: (i) the demand points are the 9,555 cities of France with a population greater than 1,000, and (ii) the candidate locations are the 1,024 gas stations of Total, a major oil company in France. The facility-allocation algorithm chooses the stations such that maximum demand points are allocated to the stations within a range of 150 km, while minimizing the number of chosen stations. The resulting allocation gives 38 stations scattered on the French road infrastructure as shown in Fig. 2a. B. Mapping of the offloading overlay To compute the overlay depicted in Fig. 2b, we consider the All-or-Nothing traffic assignment strategy that assigns all the traffic between a source and a destination to the shortest path, here defined as the path with the shortest travel time , . The traffic flow on this path is set to the minimum AADT of the stretches of road composing it. Then, we use the results of the most recent French travel household survey made in 2008 (ENTD), which distinguishes two kinds of travel : local travel is less than 80 km from home, while long-distance travel is greater than 80 km from home. The latter one accounts for 2.8% of the total amount of recorded travel. We consider a market share M of 20% (which is the case for Renault in France) and a per-node storage unit S of one TB (assumed to be the same for each electric vehicle). Since the AADT is measured on both directions of a stretch of road, we divide the measured values by two. To compute the bandwidth of the logical link, we multiply the resulting flow by S. We use the BPR (Eq. (1)) to calculate the travel time on each stretch of road with: α = 0.15 minutes, β = 4.0, the practical capacity given by the dataset, and the AADT for the assigned volume. We use then Eq. (3) to deduce the travel time of the logical links using the shortest physical road paths. Fig. 3 shows the benefits of using the offloading overlay
6 5 Number of simple paths (log scale) Road infrastructure Offloading overlay Travel time cutoff (minute) Fig. 3: Total number of simple paths in the road infrastructure and logical simple paths in the offloading overlay as a function of the travel time cutoff (y-axis is in a logarithmic scale). compared to the road infrastructure. We note that the number of simple paths grows exponentially with the travel time cutoff and is much larger on the road infrastructure. Also, the difference in the number of paths grows exponentially. C. Data transfer assignment problem We interface our offloading overlay with IBM ILOG CPLEX using the linear optimization models we presented in Section V. We consider a scenario with the following three different requests (distances are Euclidean): Request R1: from Paris to Lyon (384 km). Request R2: from Paris to Bordeaux (492 km). Request R3: from Paris to Marseille (646 km). It is important to note that requests R1 and R3 will compete for the flows since they share some common subpaths. We use a breadth-first search algorithm to generate all the simple paths for each request. The cutoffs of the simple paths are given by Eq. (12). However, the generation of the simple overlay paths between a source and a destination is exponential, as seen in Fig. 3. To solve this issue, we reduce our search space by applying a default cutoff of 12 hours on the travel time of the simple logical paths we generate for our experiments. We express the gain factor γ st as an exponential function of the Euclidean distance (in km) between s and t: γ st = [ dist(s, t) ] β, where β R. In our analyses, we investigate the impact of the delay tolerance T st. By default, for all requests, we set leakage tolerance L st to 10 2 and link leakage L(i, j) to 0.05 for each logical link (i, j) L O. The operational cost α i is weighted by the demands allocated to offloading spot i, resulting from the facility-allocation problem. Since we want a fair flow allocation in our offloading service, we choose β such that the standard deviation of the bandwidth of all flows is minimized. Finally, for each offloading spot i, we consider a waiting time t i = 20 minutes, which corresponds to the duration of a charge that provides a 300-km range to the vehicles . Fig. 4 shows the average bandwidth of each request as a function of the delay tolerance T st. We notice that the bandwidth stabilizes as the duration of the transfer increases. Also, requests with longer distances are favored (request R2 and R3) over requests with shorter distances (request R1) since the total revenue is increased. Throughput (Gbps) Request R1 1 Request R2 Request R Delay tolerance (hours) Fig. 4: Bandwidth as a function of delay tolerance T st VII. CONCLUSION We proposed a bulk-data transfer service to offload delaytolerant Internet traffic onto the road infrastructure network connecting geographically distant offloading spots. We evaluated our system using real traffic numbers in France. Our offloading service allows data transfers in the petabyte range per week while achieving cumulative bandwidth exceeding 10 Gbps with a market share of 20% and only one terabyte of storage per vehicle. These results confirm the offloading potential of our service which can help operators handle big data, especially during busy periods. As future work, we plan to replicate the data partially at some offloading spots or at the source offloading spot. We also intend to address security and privacy concerns, as well as the adaptation of our models so as to capture diurnal and seasonal variations of the road traffic. ACKNOWLEDGMENT Benjamin Baron, Promthe Spathis, and Marcelo Dias de Amorim carried out part of the work at LINCS ( REFERENCES  Cisco Visual Networking Index, The zettabyte era trends and analysis, Cisco white paper,  A. Keränen and J. Ott, DTN over aerial carriers, in ACM Mobicom workshop on challenged networks (CHANTS), Beijing, China, Sep  B. Cho and I. Indranil, Budget-constrained bulk data transfer via internet and shipping networks, in ACM International Conference on Autonomic Computing, Karlsruhe, Germany, Jun  D. Waitzman, A standard for the transmission of ip datagrams on avian carriers, Internet Requests for Comments, RFC Editor, RFC 1149, April [Online]. Available:  Tesla Motors, Inc, Supercharger, supercharger.  C.-Y. Hong, S. Kandula, R. Mahajan, M. Zhang, V. Gill, M. Nanduri, and R. Wattenhofer, Achieving high utilization with software-driven wan, in ACM Sigcomm, Hong Kong, China, Aug  J. de Dios Ortúzar and L. Willumsen, Modelling transport. Wiley Chichester, 2011, vol. 7.  Y. Sheffi, Urban transportation networks: equilibrium analysis with mathematical programming methods. Prentice Hall,  United States. Bureau of Public Roads, Traffic assignment manual for application with a large, high speed computer,  National Research Council (U.S.). Transportation Research Board, Highway Capacity Manual,  DGITM/DIT SETRA IGN, Recensement de la circulation sur le réseau routier national en 2011,  R. Church and C. R. VELLE, The maximal covering location problem, Papers in regional science,  MEDDE, Mobilité déplacement,
Mobility management and vertical handover decision making in heterogeneous wireless networks Mariem Zekri To cite this version: Mariem Zekri. Mobility management and vertical handover decision making in
Online vehicle routing and scheduling with continuous vehicle tracking Jean Respen, Nicolas Zufferey, Jean-Yves Potvin To cite this version: Jean Respen, Nicolas Zufferey, Jean-Yves Potvin. Online vehicle
Virginia Woolf, Comment devrait-on lire un livre? ou le théoricien du commun François-Ronan Dubois To cite this version: François-Ronan Dubois. Virginia Woolf, Comment devrait-on lire un livre? ou le théoricien
ibalance-abf: a Smartphone-Based Audio-Biofeedback Balance System Céline Franco, Anthony Fleury, Pierre-Yves Guméry, Bruno Diot, Jacques Demongeot, Nicolas Vuillerme To cite this version: Céline Franco,
Analyse échographique de la cicatrisation tendineuse après réparation arthroscopique de la coiffe des rotateurs Martin Schramm To cite this version: Martin Schramm. Analyse échographique de la cicatrisation
Performativity and Information Technologies: An inter-organizational perspective François-Xavier De Vaujany, Sabine Carton, Carine Dominguez-Perry, Emmanuelle Vaast To cite this version: François-Xavier
Vehicular Carriers for Big Data Transfers (Poster) Raul Adrian Gorcitz, Yesid Jarma, Prométhée Spathis, Marcelo Dias de Amorim, Ryuji Wakikawa, John Whitbeck, Vania Conan, Serge Fdida To cite this version:
La mort du narrateur et l interprétation du roman. L exemple de Pedro Páramo de Juan Rulfo Sylvie Patron To cite this version: Sylvie Patron. La mort du narrateur et l interprétation du roman. L exemple
FP-Hadoop: Efficient Execution of Parallel Jobs Over Skewed Data Miguel Liroz-Gistau, Reza Akbarinia, Patrick Valduriez To cite this version: Miguel Liroz-Gistau, Reza Akbarinia, Patrick Valduriez. FP-Hadoop:
A usage coverage based approach for assessing product family design Jiliang Wang To cite this version: Jiliang Wang. A usage coverage based approach for assessing product family design. Other. Ecole Centrale
Discussion on the paper Hypotheses testing by convex optimization by A. Goldenschluger, A. Juditsky and A. Nemirovski. Fabienne Comte, Celine Duval, Valentine Genon-Catalot To cite this version: Fabienne
QASM: a Q&A Social Media System Based on Social Semantics Zide Meng, Fabien Gandon, Catherine Faron-Zucker To cite this version: Zide Meng, Fabien Gandon, Catherine Faron-Zucker. QASM: a Q&A Social Media
A graph based framework for the definition of tools dealing with sparse and irregular distributed data-structures Serge Chaumette, Jean-Michel Lepine, Franck Rubi To cite this version: Serge Chaumette,
Expanding Renewable Energy by Implementing Demand Response Stéphanie Bouckaert, Vincent Mazauric, Nadia Maïzi To cite this version: Stéphanie Bouckaert, Vincent Mazauric, Nadia Maïzi. Expanding Renewable
Managing Risks at Runtime in VoIP Networks and Services Oussema Dabbebi, Remi Badonnel, Olivier Festor To cite this version: Oussema Dabbebi, Remi Badonnel, Olivier Festor. Managing Risks at Runtime in
Text-to-pinyin conversion based on contextual knowledge and D-tree for Mandarin Sen Zhang, Yves Laprie To cite this version: Sen Zhang, Yves Laprie. Text-to-pinyin conversion based on contextual knowledge
Minkowski Sum of Polytopes Defined by Their Vertices Vincent Delos, Denis Teissandier To cite this version: Vincent Delos, Denis Teissandier. Minkowski Sum of Polytopes Defined by Their Vertices. Journal
Auto-Scaling, Load Balancing and Monitoring in Commercial and Open-Source Clouds Eddy Caron, Luis Rodero-Merino, Frédéric Desprez, Adrian Muresan To cite this version: Eddy Caron, Luis Rodero-Merino, Frédéric
Knowledge based tool for modeling dynamic systems in education Krassen Stefanov, Galina Dimitrova To cite this version: Krassen Stefanov, Galina Dimitrova. Knowledge based tool for modeling dynamic systems
Study on Cloud Service Mode of Agricultural Information Institutions Xiaorong Yang, Nengfu Xie, Dan Wang, Lihua Jiang To cite this version: Xiaorong Yang, Nengfu Xie, Dan Wang, Lihua Jiang. Study on Cloud
Faut-il des cyberarchivistes, et quel doit être leur profil professionnel? Jean-Daniel Zeller To cite this version: Jean-Daniel Zeller. Faut-il des cyberarchivistes, et quel doit être leur profil professionnel?.
VR4D: An Immersive and Collaborative Experience to Improve the Interior Design Process Amine Chellali, Frederic Jourdan, Cédric Dumas To cite this version: Amine Chellali, Frederic Jourdan, Cédric Dumas.
Additional mechanisms for rewriting on-the-fly SPARQL queries proxy Arthur Vaisse-Lesteven, Bruno Grilhères To cite this version: Arthur Vaisse-Lesteven, Bruno Grilhères. Additional mechanisms for rewriting
An aggregator for distributed energy storage units under multiple constraints in the nice grid demonstrator Andrea Michiorri, Georges Kariniotakis, Fiona Foucault To cite this version: Andrea Michiorri,
Experimental validation for software DIALUX: application in CIE test Cases for building daylighting simulation Ali Hamada Fakra, Harry Boyer, Fawaz Maamari To cite this version: Ali Hamada Fakra, Harry
Les identités féminines dans le conte traditionnel occidental et ses réécritures : une perception actualisée des élèves Sarah Brasseur To cite this version: Sarah Brasseur. Les identités féminines dans
Aligning subjective tests using a low cost common set Yohann Pitrey, Ulrich Engelke, Marcus Barkowsky, Romuald Pépion, Patrick Le Callet To cite this version: Yohann Pitrey, Ulrich Engelke, Marcus Barkowsky,
ANIMATED PHASE PORTRAITS OF NONLINEAR AND CHAOTIC DYNAMICAL SYSTEMS Jean-Marc Ginoux To cite this version: Jean-Marc Ginoux. ANIMATED PHASE PORTRAITS OF NONLINEAR AND CHAOTIC DYNAMICAL SYSTEMS. A.H. Siddiqi,
Performance analysis of clouds with phase-type arrivals Farah Ait Salaht, Hind Castel-Taleb To cite this version: Farah Ait Salaht, Hind Castel-Taleb. Performance analysis of clouds with phase-type arrivals.
Application-Aware Protection in DWDM Optical Networks Hamza Drid, Bernard Cousin, Nasir Ghani To cite this version: Hamza Drid, Bernard Cousin, Nasir Ghani. Application-Aware Protection in DWDM Optical
A modeling approach for locating logistics platforms for fast parcels delivery in urban areas Olivier Guyon, Nabil Absi, Dominique Feillet, Thierry Garaix To cite this version: Olivier Guyon, Nabil Absi,
Mobile Augmented Note-taking to Support Operating Physical Devices Can Liu, Jonathan Diehl, Stéphane Huot, Jan Borchers To cite this version: Can Liu, Jonathan Diehl, Stéphane Huot, Jan Borchers. Mobile
Global Identity Management of Virtual Machines Based on Remote Secure Elements Hassane Aissaoui, P. Urien, Guy Pujolle To cite this version: Hassane Aissaoui, P. Urien, Guy Pujolle. Global Identity Management
Information Technology Education in the Sri Lankan School System: Challenges and Perspectives Chandima H. De Silva To cite this version: Chandima H. De Silva. Information Technology Education in the Sri
Overview of model-building strategies in population PK/PD analyses: 2002-2004 literature survey. Céline Dartois, Karl Brendel, Emmanuelle Comets, Céline Laffont, Christian Laveille, Brigitte Tranchand,
Use of tabletop exercise in industrial training disaster. Alexis Descatha, Thomas Loeb, François Dolveck, Nathalie-Sybille Goddet, Valerie Poirier, Michel Baer To cite this version: Alexis Descatha, Thomas
What Development for Bioenergy in Asia: A Long-term Analysis of the Effects of Policy Instruments using TIAM-FR model Seungwoo Kang, Sandrine Selosse, Nadia Maïzi To cite this version: Seungwoo Kang, Sandrine
The CHI 2013 Interactive Schedule Arvind Satyanarayan, Daniel Strazzulla, Clemens Klokmose, Michel Beaudouin-Lafon, Wendy E. Mackay To cite this version: Arvind Satyanarayan, Daniel Strazzulla, Clemens
Estimating the stock of postwar Dutch postal stamps Philip Hans Franses To cite this version: Philip Hans Franses. Estimating the stock of postwar Dutch postal stamps. Applied Economics, Taylor & Francis
Characteristics and energy balance of a plasma column sustained by a surface wave M. Chaker, P. Nghiem, E. Bloyet, Ph. Leprince, J. Marec To cite this version: M. Chaker, P. Nghiem, E. Bloyet, Ph. Leprince,
TrafficGen: A Flexible Tool For Informing Agent-Based Traffic Simulations With Open Data Alexandre Bonhomme, Philippe Mathieu, Sébastien Picault To cite this version: Alexandre Bonhomme, Philippe Mathieu,
Territorial Intelligence and Innovation for the Socio-Ecological Transition Jean-Jacques Girardot, Evelyne Brunau To cite this version: Jean-Jacques Girardot, Evelyne Brunau. Territorial Intelligence and
Refutation of the theorie of gases greenhouse Marc Mallet To cite this version: Marc Mallet. Refutation of the theorie of gases greenhouse. The explanation of global warming by the IPCC accumulation of
Cyclic production in regular robotic cells: A counterexample to the 1-cycle conjecture Florence Thiard, Nicolas Catusse, Nadia Brauner To cite this version: Florence Thiard, Nicolas Catusse, Nadia Brauner.
A Laboratory TOOL for the strings instrument makers Samad F. Pakzad, Thierry Jeandroz To cite this version: Samad F. Pakzad, Thierry Jeandroz. A Laboratory TOOL for the strings instrument makers. Société
Heterogeneous PLC-RF networking for LLNs Cedric Chauvenet, Bernard Tourancheau To cite this version: Cedric Chauvenet, Bernard Tourancheau. Heterogeneous PLC-RF networking for LLNs. CFIP 2011 - Colloque
SELECTIVELY ABSORBING COATINGS J. Vuletin, P. Kuli ik, M. Bosanac To cite this version: J. Vuletin, P. Kuli ik, M. Bosanac. SELECTIVELY ABSORBING COATINGS. Journal de Physique Colloques, 1981, 42 (C1),
Interlibrary loan and document supply in France the Montpellier meeting Joachim Schöpfel To cite this version: Joachim Schöpfel. Interlibrary loan and document supply in France the Montpellier meeting.
QUALITY OF SERVICE METRICS FOR DATA TRANSMISSION IN MESH TOPOLOGIES SWATHI NANDURI * ZAHOOR-UL-HUQ * Master of Technology, Associate Professor, G. Pulla Reddy Engineering College, G. Pulla Reddy Engineering
Environmental Impact of PV Systems: Effects of Energy Sources Used in Production of Solar Panels Didier Beloin-Saint-Pierre, Isabelle Blanc, Jérôme Payet, Philippe Jacquin, Nadine Adra, Didier Mayer To
Dictionary Building with the Jibiki Platform: Software Demonstration Mathieu Mangeot To cite this version: Mathieu Mangeot. Dictionary Building with the Jibiki Platform: Software Demonstration. EURALEX
From Microsoft Word 2003 to Microsoft Word 2007: Design Heuristics, Design Flaws and Lessons Learnt Yin-Leng Theng, Eng Kiat Ting, Xuehong Tao To cite this version: Yin-Leng Theng, Eng Kiat Ting, Xuehong
New implementions of predictive alternate analog/rf test with augmented model redundancy Haithem Ayari, Florence Azais, Serge Bernard, Mariane Comte, Vincent Kerzerho, Michel Renovell To cite this version:
Running an HCI Experiment in Multiple Parallel Universes,, To cite this version:,,. Running an HCI Experiment in Multiple Parallel Universes. CHI 14 Extended Abstracts on Human Factors in Computing Systems.
Avoidance of Multicast Incapable Branching Nodes for Multicast Routing in WDM Networks Fen Zhou, Miklos Molnar, Bernard Cousin To cite this version: Fen Zhou, Miklos Molnar, Bernard Cousin. Avoidance of
The Rolling Stock Recovery Problem Julie Jespersen Groth *α, Jesper Larsen β and Jens Clausen *γ DTU Management Engineering, The Technical University of Denmark, Produktionstorvet, DTU Building 424, 2800
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 52 (2015 ) 902 907 The 4th International Workshop on Agent-based Mobility, Traffic and Transportation Models, Methodologies
An update on acoustics designs for HVAC (Engineering) Ken MARRIOTT To cite this version: Ken MARRIOTT. An update on acoustics designs for HVAC (Engineering). Société Française d Acoustique. Acoustics 2012,
THE ATOMIC STRUCTURE OF SILICON AND METAL SURFACES T. Tsong, Hong Liu, Q. Gao, D. Feng To cite this version: T. Tsong, Hong Liu, Q. Gao, D. Feng. THE ATOMIC STRUCTURE OF SILICON AND METAL SURFACES. Journal
GDS Resource Record: Generalization of the Delegation Signer Model Gilles Guette, Bernard Cousin, David Fort To cite this version: Gilles Guette, Bernard Cousin, David Fort. GDS Resource Record: Generalization
The truck scheduling problem at cross-docking terminals Lotte Berghman,, Roel Leus, Pierre Lopez To cite this version: Lotte Berghman,, Roel Leus, Pierre Lopez. The truck scheduling problem at cross-docking
Experimental determination of flash points of flammable liquid aqueous solutions Agnès Janes, Jacques Chaineaux To cite this version: Agnès Janes, Jacques Chaineaux. Experimental determination of flash
Latency Based Dynamic Grouping Aware Cloud Scheduling Sheheryar Malik, Fabrice Huet, Denis Caromel To cite this version: Sheheryar Malik, Fabrice Huet, Denis Caromel. Latency Based Dynamic Grouping Aware
Effets du monoxyde d azote inhalé sur le cerveau en développement chez le raton Gauthier Loron To cite this version: Gauthier Loron. Effets du monoxyde d azote inhalé sur le cerveau en développement chez
Pricing access to the Internet with partial information Ilaria Brunetti, Eitan Altman, Majed Haddad To cite this version: Ilaria Brunetti, Eitan Altman, Majed Haddad. Pricing access to the Internet with
Modeling the impact of node speed on the ranging estimation with UWB body area networks Arturo Guizar, Claire Goursaud, Jean-Marie Gorce To cite this version: Arturo Guizar, Claire Goursaud, Jean-Marie
ANALYSIS OF SNOEK-KOSTER (H) RELAXATION IN IRON J. San Juan, G. Fantozzi, M. No, C. Esnouf, F. Vanoni To cite this version: J. San Juan, G. Fantozzi, M. No, C. Esnouf, F. Vanoni. ANALYSIS OF SNOEK-KOSTER
On the Interaction and Competition among Internet Service Providers Sam C.M. Lee John C.S. Lui + Abstract The current Internet architecture comprises of different privately owned Internet service providers
DEM modeling of penetration test in static and dynamic conditions Quoc Anh Tran, Bastien Chevalier, Pierre Breul To cite this version: Quoc Anh Tran, Bastien Chevalier, Pierre Breul. DEM modeling of penetration
L exercice du théâtre à l école Mathilde Patteyn To cite this version: Mathilde Patteyn. L exercice du théâtre à l école. Éducation. 2013. HAL Id: dumas-00861849 http://dumas.ccsd.cnrs.fr/dumas-00861849
Cobi: Communitysourcing Large-Scale Conference Scheduling Haoqi Zhang, Paul André, Lydia Chilton, Juho Kim, Steven Dow, Robert Miller, Wendy E. Mackay, Michel Beaudouin-Lafon To cite this version: Haoqi
Virtual plants in high school informatics L-systems Janka Majherov To cite this version: Janka Majherov. Virtual plants in high school informatics L-systems. Michael E. Auer. Conference ICL2007, September
Modeling and control of pedestrian behaviors: An environment optimization approach Emiliano Cristiani, Fabio S. Priuli, Andrea Tosin To cite this version: Emiliano Cristiani, Fabio S. Priuli, Andrea Tosin.
Understanding Big Data Spectral Clustering Romain Couillet, Florent Benaych-Georges To cite this version: Romain Couillet, Florent Benaych-Georges Understanding Big Data Spectral Clustering 205 IEEE 6th
Assessment of acoustic pressure holograms from membrane velocity measurements Antonio Pereira, Q. Leclere To cite this version: Antonio Pereira, Q. Leclere. Assessment of acoustic pressure holograms from
A Game-Based Self-Organizing Uplink Tree for VoIP Services in IEEE 802.16j Networks Walid Saad, Han Zhu, Merouane Debbah, Are Hjorungnes, Tamer Basar To cite this version: Walid Saad, Han Zhu, Merouane
Proposal for the configuration of multi-domain network monitoring architecture Aymen Belghith, Bernard Cousin, Samer Lahoud, Siwar Ben Adj Said To cite this version: Aymen Belghith, Bernard Cousin, Samer
IN-PLACE DETERMINATION OF TOPSOIL SHEAR PROPERTIES FOR OFF-ROAD VEHICLE TRAFFIC Philippe Gotteland, Olivier Ple, Olivier Benoit To cite this version: Philippe Gotteland, Olivier Ple, Olivier Benoit. IN-PLACE
Measuring aspects of player experience : A systematic review of human-computer interaction journals Loïc Caroux, Katherine Isbister To cite this version: Loïc Caroux, Katherine Isbister. Measuring aspects
An Automatic Reversible Transformation from Composite to Visitor in Java Akram To cite this version: Akram. An Automatic Reversible Transformation from Composite to Visitor in Java. CIEL 2012, P. Collet,
Introducing Effects in an Image: A MATLAB Approach Vinay Kumar, Saurabh Sood, Shruti Mishra To cite this version: Vinay Kumar, Saurabh Sood, Shruti Mishra. Introducing Effects in an Image: A MATLAB Approach.
Good Practices as a Quality-Oriented Modeling Assistant Vincent Le Gloahec, Régis Fleurquin, Salah Sadou To cite this version: Vincent Le Gloahec, Régis Fleurquin, Salah Sadou. Good Practices as a Quality-Oriented
Template Based MDE Matthieu Allon, Gilles Vanwormhoudt, Bernard Carré, Olivier Caron To cite this version: Matthieu Allon, Gilles Vanwormhoudt, Bernard Carré, Olivier Caron. Template Based MDE. 4ème Conférence
Swap Fairness for Thrashing Mitigation François Goichon, Guillaume Salagnac, Stéphane Frénot To cite this version: François Goichon, Guillaume Salagnac, Stéphane Frénot. Swap Fairness for Thrashing Mitigation.