–
April 12, 2018
| MMonday | TTuesday | WWednesday | TThursday | FFriday | SSaturday | SSunday |
|---|---|---|---|---|---|---|
26March 26, 2018
|
27March 27, 2018
|
Parallel Space-Time Kernel Density Estimation By Erik Saule (U. Caroline du Nord) – The exponential growth of available data has increased the need for We focus in this paper on events that are localized among three Bâtiment IMAG (442) |
Polyhedral Optimization at Runtime, by Manuel Selva. – The polyhedral model has proven to be very useful to optimize and parallelize a particular class of compute intensive application kernels. A polyhedral optimizer needs to have affine functions defining loop bounds, memory accesses and branching conditions. Unfortunately, this information is not always available at compile time. To broaden the scope of polyhedral optimization opportunities, runtime information can be considered. This talk will highlight the challenges of integrating polyhedral optimization in runtime systems: - When and how to detect opportunities for polyhedral optimization? These challenges will be illustrated in the context of both the APOLLO framework targeting C and C++ applications and of the JavaScript engine from Apple. Bâtiment IMAG (442) |
30March 30, 2018
|
31March 31, 2018
|
April1April 1, 2018 |
2April 2, 2018
|
3April 3, 2018
|
4April 4, 2018
|
5April 5, 2018
|
6April 6, 2018
|
7April 7, 2018
|
8April 8, 2018
|
9April 9, 2018
|
10April 10, 2018
|
11April 11, 2018
|
presentation of the Argo project by Swann Perarnau (Argonne National Laboratory) – |
13April 13, 2018
|
14April 14, 2018
|
15April 15, 2018
|
16April 16, 2018
|
17April 17, 2018
|
18April 18, 2018
|
19April 19, 2018
|
20April 20, 2018
|
21April 21, 2018
|
22April 22, 2018
|
23April 23, 2018
|
24April 24, 2018
|
25April 25, 2018
|
Approximate equilibria of Colonel Blotto games, by Quan Vu (Polaris and Nokia) – Resource allocation games are commonly used to model problems in many domains ranging from security to advertising. One of the most important resource allocation games is the Colonel Blotto game: Two players distribute a fixed budget of resources over multiple battlefields to maximize the aggregate value of battlefields they win, each battlefield being won by the player who allocates more resources to it. Despite its long-standing history and importance, the continuous version of the game---where players can choose any fractional allocation---still lacks a complete Nash equilibrium solution in its general form with asymmetric players' budgets and heterogeneous battlefield values. In this work, we propose an approximate equilibrium for this general case. We construct a simple strategy (the independently uniform strategy) and prove that it is an epsilon-equilibrium. We give a theoretical bound on the approximation error in terms of the number of battlefields and players’ budgets which identifies precisely the parameters regime for which our strategy is a good approximation. We also investigate an extension to the discrete version (where players can only have integer allocations), for which we proposed an algorithm to compute very efficiently an approximate equilibrium. We perform numerical experiments that guarantee that we can "safely" use this strategy in practice. Our work extends the scope of application of Colonel Blotto games in several practical cases, especially with large games' parameters (e.g. in advertisements, voting, security, etc.,) Bâtiment IMAG Saint-Martin-d'Hères, 38400 France |
27April 27, 2018
|
28April 28, 2018
|
29April 29, 2018
|
30April 30, 2018
|
May1May 1, 2018 |
2May 2, 2018
|
3May 3, 2018
|
A data structure for analyzing spatio-temporal correlations of alarms, by Anne Bouillard (Nokia) – In this talk, I will present a data structure for the analysis of correlations of alarms, for root-cause analysis or prediction purposes. This is a joint work with Marc-Olivier Buob and Maxime Raynal (intern). A sequence of alarms is modeled by a directed acyclic graph. The nodes of the graph are the alarms, that are represented by a symbol and an interval of time. An arc of the graph is interpreted as a potential causality between two alarms. I will first show how to build a "compact" structure storing all the potential causal sequences of alarms and then how to weight this structure so that the actual correlations can be detected. The efficiency of the approach will be demonstrated on toy examples. Bâtiment IMAG (442) |
5May 5, 2018
|
6May 6, 2018
|
7May 7, 2018
|
8May 8, 2018
|
9May 9, 2018
|
10May 10, 2018
|
11May 11, 2018
|
12May 12, 2018
|
13May 13, 2018
|
14May 14, 2018
|
15May 15, 2018
|
16May 16, 2018
|
17May 17, 2018
|
18May 18, 2018
|
19May 19, 2018
|
20May 20, 2018
|
21May 21, 2018
|
22May 22, 2018
|
23May 23, 2018
|
24May 24, 2018
|
25May 25, 2018
|
26May 26, 2018
|
27May 27, 2018
|
28May 28, 2018
|
29May 29, 2018
|
30May 30, 2018
|
Analytical Modeling for Flow-level Performance of Randomly Placed Wireless Networks by George Arvanitakis (postdoc, Polaris) – The recent evolution of mobile communications and the widespread use of ``smart'' mobile devices have radically changed the behavior and the needs of the mobile user. In the developed world, people that use their mobile devices just to place some calls and to text some SMS can be characterized as endangered species. Ubiquitous access to Internet, videos/songs streaming and upload/download data flows on the fly are some of the modern demands of the mobile user. It would not be an exaggeration to say that modern users have almost the same demands regardless if they are connected through wire to the network from their personal computers or if they have established a wireless connection through their cellular devices. On the one hand the overall network load increases on the other hand base stations have limited resources due to the fact that are able to operate only to a limited part of the electromagnetic spectrum. Some (temporal) solutions for the aforementioned problem are the expansion of frequency operational bands (mm wave) or the use of more antennas (massive MIMO) or the denser deployment of small cells. In this talk, we are interested in the promising case of denser small cells that will be tighter integrated with the macro cell. Unfortunately to deploy optimally a small cell network is not trivial. A small cell network is usually deployed in an ad-hoc style and not all at once, so a part of the network exists already and cannot be planned. Additionally, there are natural obstacles and physical limitations that do not allow to deploy base stations wherever we want. So, the small cell network's topology is quite different from the traditional (macro cell) well-structure one. From our point of view, the future of mobile communications will approach the following: A mass of users - will cause a nondescript data traffic - that will be served from an irregular planed and heterogeneous network. This chaotic picture however makes the problem of network modeling and performance analysis extremely challenging. To this end, the our primary focus is to build up an analytical framework in order to analyze the performance of a randomly placed network, which serves randomly placed users. To achieve this, we based our analysis on two main tools: (a) stochastic geometry, to understand the impact of topological randomness and coverage maps and (b) queueing theory, to model the competition between concurrent flows within the same BS. The second goal is to propose, based on this analysis, some general design guidelines and insights about specific communication scenarios that mainly involve LTE and WiFi networks. Bat. IMAG, 206 |
June1June 1, 2018 |
2June 2, 2018
|
3June 3, 2018
|
This website uses cookies so that we can provide you with the best user experience possible. Cookie information is stored in your browser and performs functions such as recognising you when you return to our website and helping our team to understand which sections of the website you find most interesting and useful.
Strictly Necessary Cookie should be enabled at all times so that we can save your preferences for cookie settings.
If you disable this cookie, we will not be able to save your preferences. This means that every time you visit this website you will need to enable or disable cookies again.
