The seminars are usually held on Thursdays or Fridays between 12:30 and 1:30PM, Campus de la Plaine.

You can receive seminar announcements by subscribing to the 'computerscience' mailing list. Help on ULB/VUB mailing lists can be found here. For more information, please contact Stefan Langerman (slanger at ulb dot ac dot be).

Link to 2006 seminars. Link to 2005 seminars. Link to 2004 seminars.

**Thursday September 25, 2014, 12:30PM, room: 2NO7.08**

**Nonlinear forecasting of macroeconomic variables using three automated model selection techniques
Timo Terasvirta
(Aarhus University)**

Abstract: In this paper, the focus is on the forecasting performance of a well-defined class of flexible models, the so-called single hidden-layer feedforward neural network models. A major aim of our study is to find out whether they, due to their flexibility, are as useful tools in economic forecasting as some previous studies have indicated. A central problem with these models is how to specify their structure and estimate the parameters. Recently, White (2006) presented a solution that amounts to converting the specification and nonlinear estimation problem into a linear model selection and estimation problem. This leads to a situation that is somewhat atypical, at least in time series econometrics, in which the number of variables may vastly exceed the number of observations. We compare three methods of model selection capable of handling this problem. One is White's QuickNet, and the other two are the Marginal Bridge Estimator (MBE), well known to statisticians and microeconometricians, and Autometrics, popular among time series econometricians. We consider multiperiod forecasts. There are two main ways of generating them. One is to specify and estimate a single model and generate the forecasts recursively from it. It is also possible to build a separate model for each forecast horizon and use it for obtaining the forecasts directly for the horizon in question. We compare the performance of these alternatives, when the set of available models consists of linear autoregressive, neural network and nonparametric ones.

The speaker is hosted by Gianluca Bontempi.

**Monday September 8, 2014, 12:30PM, room: 2NO7.08**

**Gas network operation and optimization under uncertainty
Jonas Schweiger
(Zuse Institute Berlin, Germany)**

Abstract: With the deregulations in the gas markets, the requirements on the network change rapidly and demand more flexibility from the network operators. Gas network operators therefore have to invest into their network infrastructure. As these investments are very cost-intensive and long-living, network extensions should not only focus on one bottleneck scenario, but should increase the flexibility to fulfill different demand scenarios. First, we formulate a model for network extension, that is we search cost-optimal network extensions such that an infeasible demand scenarios can be realized in the extended network. Nonlinear gas physics and discrete operation decisions make already this deterministic planning model a challenging mixed-integer non-convex optimization problem. Second, we extend this model to several scenarios and propose a decomposition. A Branch&Bound-algorithm which uses the single-scenario problem as subproblem is proposed to solve the problem. Since the single-scenario problems itself are challenging problems, we solve them to global optimality only in the leaf nodes of our Branch&Bound-Tree, but still use valid bounds and solutions in every node of the tree. Furthermore, we present conditions under which previously found solutions for the scenario problems can be reused to avoid recomputations.

The speaker is hosted by GOM.

**Thursday June 12, 2014, 12:30PM, room: 2NO6.07**

**Service start time optimization in elementary shortest path problems with resource constraints
Yasemin Arda
(Université de Liège)**

Abstract: Besides their real-life applications, elementary shortest path problems with resource constraints are faced as the pricing sub-problem when more complex problems are solved through column generation and branch-and-price. We consider an elementary shortest path problem with resource constraints, where there is a capacitated single vehicle at the depot for serving a set of customers by respecting their associated time windows. The vehicle can start serving the customers at any desired time and can be used for a fixed amount of time. The total transportation cost is defined as a function of the total distance traveled and the total amount of time that the vehicle spends by performing the assigned trip. Every time the vehicle visits a customer, it delivers the required load and collects a revenue in return for the delivery. The objective is to determine the trip to be performed and the service start time from the depot so as to minimize the total loss, which is calculated as the total transportation cost minus the collected revenues. In this study, we develop two exact dynamic programming algorithms which can deal with an infinite number of Pareto-optimal states arising from the fact that the vehicle can depart from the depot at any point in time and charges depending on the amount of time it spends for serving customers. Apart from reporting computational results for our elementary shortest path problem, we also embed it into a column generation framework for the corresponding capacitated vehicle routing problem with time windows. Recent results for the developed branch-and-price algorithm are also reported.

The speaker is hosted by GOM.

**Thursday June 5, 2014, 12:30PM, room: 2NO7.07**

**Approaches to bilevel programs with interval coefficients
Carmen Galé
(Universidad de Zaragoza)**

Abstract: Bilevel problems have been proposed for dealing with hierarchical processes involving two levels of decision making. Bilevel programs involve two optimization problems where the constraint region of one of the problems is implicitly determined by the other. In this talk, linear bilevel programs whose both objective functions coefficients are interval numbers are addressed. Interval coefficients have been used in the literature to deal with decision problems which coefficients are only approximately known. First, we focus on the optimal value range problem which consists of computing the best and worst optimal objective function values and determining the settings of the interval coefficients which provide these values. In a published paper with H.I. Calvete, we prove by examples that, in general, there is no precise way of systematizing the specific values of the interval coefficients that can be used to compute the best and worst possible optimal solutions. Taking into account the properties of linear bilevel problems, we prove that these two optimal solutions occur at extreme points of the polyhedron defined by the common constraints. Moreover, we develop two algorithms based on ranking extreme points that allow us to compute them as well as determining settings of the interval coefficients which provide the optimal value range. In a recent work, the focus is on the order relations between interval numbers that represent the decision makers' preference. Taking into account them, we show that the bilevel problem with interval coefficients can be solved by transforming it into a bicriteria bilevel problem properly defined. We are currently working on some algorithms for solving this problem.

The speaker is hosted by Martine Labbé.

**Thursday June 5, 2014, 11:15AM, room: TBA**

**A model for the BitCoin block chain that takes
propagation delays into account.
Peter Taylor
(U. Melbourne)**

Abstract: Unlike cash transactions, most electronic transactions require the presence of a trusted authority to verify that the payer has sufficient funding to be able to make the transaction and to adjust the account balances of the payer and payee. In recent years 'BitCoin' has been proposed as an 'electronic equivalent of cash'. The general idea is that transactions are verified in a coded form in a 'block chain', which is maintained by the community of participants. Problems can arise when the block chain splits: that is different participants have different versions of the block chain, something which can happen only when there are propagation delays, at least if all participants are behaving according to the protocol. In this talk I shall present a preliminary model for the splitting behaviour of the block chain I shall then go on to perform a similar analysis for a situation where a group of participants has adopted a recently-proposed strategy for gaining a greater advantage from BitCoin processing than its combined computer power should be able to control.

The speaker is hosted by Guy Latouche.

**Thursday May 15, 2014, 12:30PM, room: 2NO6.07**

The seminar of **Alfredo Marin
(University of Murcia, Spain)** has been canceled.

**Thursday March 27, 2014, 12:30PM, room: 2NO6.07**

**Nurse rostering models and algorithms
Greet Vanden Berghe
(KUL)**

Abstract: Health care is under high pressure to improve efficiency, given increasing requirements and decreasing resources. Among the activities to optimise, nurse rostering is one of the most relevant to address. The problem is computationally complex and has potential for improvement through automated decision support. Personnel rosters also have a considerable socio-economic impact. This optimisation problem has yielded ample practice-oriented operational research approaches. Despite the vast amount of academic research results, it remains hard for novice developers to profit from general insights or re-usable approaches. This `cold start’ issue can be partially explained by complicated regulations typical for personnel environments with 24/7 duties and different in almost every organisation. The very same issue also persists due to the lack of a theoretical framework for nurse rostering. From an academic point of view, interesting models have been developed for varying nurse rostering problems. The approaches range from self-rostering and manual problem decompositions to different levels of automated decision support. The seminar will focus on the relevance of academic results and on the interplay between practical and theoretical nurse rostering contributions.

The speaker is hosted by GOM.

**Thursday March 13, 2014, 3:00PM, room: 2NO8.08**

**Refinement heuristics for capacitated
extended-ring network design
Alessandro Hill
(Universiteit Antwerpen)**

Abstract: We present two heuristic approaches to solve capacitated network design problems based on re finement techniques. The main idea is to improve a given solution iteratively by solving subproblems defined on structural neighbourhoods to optimality. In our generic approaches we use the exact solution techniques in the most efficient way. This means that we build subproblems of largest possible size for complexity that still can be solved with low computational e ffort in our framework. Especially for networks with capacity constraints and extended topologies these approaches turn out to be quite powerful. Although we focus on the minimization of the total edge costs in our work, related problem features such as prize collecting or locational installation costs could be integrated. We first consider the multi-depot ring star problem (MDRSP) which generalizes the ring star problem and therefore the classical travelling salesman problem. Several depots may serve a restricted number of rings by optional usage of Steiner vertices. Customers are either directly connected by such rings or assigned to them leading to ring stars. Each ring star obeys a depot-dependent customer limit. Various structural local neighbourhoods are introduced and explored as subproblems of type MDRSP themselves. We propose a branch & cut method for the MDRSP which is used to carry out the re finements. For the optimization on a global level, multiple contraction techniques are proposed leading to known vehicle routing problem variants that we solved exactly, too. The effi ciency is shown by computational results improving known upper bounds for instance classes from the literature containing up to 1000 vertices. 91% of the known best objective values are improved up to 13% in competitive computational time. Secondly, we address the capacitated ring tree problem (CRTP), a recent capacitated single-depot network design model that combines the ring topology from classical capacitated vehicle routing problems with the tree structure considered in Steiner tree problem variants. In contrast to the ring star problems a prespecifi ed subset of customers is allowed to be assigned to rings by tree structures instead of simple links. Again, we use an exact branch & cut algorithm to carry out refi nements. To increase the spectrum of neighbourhoods that can be modelled we refi ne in a local branching fashion: for several structural neighbourhood ideas, a suitable set of restricting inequalities is provided to a master model representing the overall problem. This corresponds to a strategy for the partial exploration of multiple branch & bound trees on an integer programming formulation. Preliminary results are presented and compared to bounds obtained by the exact method and a local search based heuristic approach.

The speaker is hosted by GOM.

**Thursday February 20, 2014, 12:30PM, room: 2NO6.07**

**Automated clustering of real-time tasks
Julien Forget
(Université Lille 1)**

Abstract: Usually, real-time system developers first design a system as a set of "functionalities" (blocks of code) with real-time constraints and then implement these functionalities as a set of concurrent real-time tasks (threads). Complex systems, such as the flight control system of an aircraft for instance, are typically made up of several hundreds or thousands of functionalities. Thus, several functionalities must be clustered into the same task, to reduce context switches, memory consumption, ... Our work aims at automatizing this "task clustering" process. In this talk, we will first quickly present the context of our work: the language Prelude, a high-level language for programming real-time embedded control systems. We will then emphasize how task clustering fits inside the compilation of such a language and detail our first results, which consider clustering from a real-time scheduling point-of-view.

The speaker is hosted by Joël Goossens.

**Thursday December 12, 2013, 12:30PM, room: 2NO7.07**

**The making of the HIPPEROS RTOS at the PARTS Research Unit
Ben Rodriguez
(PARTS, ULB, Belgique)**

Abstract: This talk is not the usual research talk. Our goal is to show how we bridged the gap from research to valorization by starting with real-time scheduling theory and OS design principles, then went on to create a sound RTOS implementation that meets realistic constraints and models, and finally obtained industrial and economic support to create a valorization structure. This process is far from complete. We show that there are several areas where our group could benefit from synergies with other research units, e.g. security, formal proofs, software engineering, compilers, etc.

**Thursday November 28, 2013, 12:30PM, room: 2NO7.07**

**Identifying codes on classes of graphs closed by induced subgraphs
Aline Parreau
(Université de Liège, Belgique)**

Abstract: An identifying code is a subset of vertices of a graph such that each vertex is uniquely determined by its closed neighborhood within the identifying code. Since determining the minimum size of an identifying code is a NP-complete problem, we restrict our study to classes of graphs closed by induced subgraphs. We will present precise results for specific classes of graphs like interval and line graphs and give more general results using the Vapnik-Chervonenkis dimension.

The speaker is hosted by Eglantine Camby.

**Thursday November 21, 2013, 12:30PM, room: 2NO7.07**

**Global Liner Shipping Network Design
Shahin Gelareh
(University of Artois, France)**

Abstract: All shipping liner companies divide their service regions into several rotations (strings) in order to operate their container vessels. A string is the ordered set of ports at which a container vessel will call. Each port is usually called at no more than twice along one string, although a single port may be called at several times on different strings. The size of string dictates the number of vessels required to offer a given frequency of service. In order to better use their shipping capacity, groups of Liner Service Providers sometimes make a short term agreement to merge some of their service routes (in a certain region) into one main ocean going rotation and p feeder rotations. In order to minimize the weighted sum of transit time, and fixed deployment costs, we develop a mixed integer linear programming model of the network design, and an allocation of proper capacity size and frequency setting for every rotation. Given that none of the existing general-purpose MIP solvers is able to solve even very small problem instances in a reasonable time, we apply a Lagrangian decomposition approach which uses a heuristic procedure and is capable of obtaining practical and high quality solutions in reasonable times. The model has been applied on a real example, and we shall present some of the results obtained by our model which show how it facilitates a better use of assets and a significant reduction in the use of fuel, therefore allowing a more environmentally friendly service.

The speaker is hosted by Bernard Fortz.

**Thursday November 14, 2013, 12:30PM, room: 2NO7.07**

**Some Math Programming and Game Theoretic approaches for the design of Robust Railway Networks
Justo Puerto
(University of Seville, Spain)**

Abstract: This talk discusses and extends competitive aspects of some games proposed in the literature, where a robust railway network design problem is formulated as a non-cooperative zero-sum game in normal form between a designer/operator and an attacker. Due to the importance of the order of play and the information available to the players at the moment of their decisions, we here extend those previous models by proposing formulations of this situation as dynamic games. Besides, we propose a new mathematical programming model that optimizes both the network design and the allocation of security resources over the network. This approach also proposes a model to distribute security resources over an already existing railway network in order to minimize the negative effects of an intentional attack. The models will be illustrated with examples.

The speaker is hosted by Martine Labbé.

**Thursday November 7, 2013, 12:30PM, room: 2NO7.07**

**Large-Scale Reformulations of Combinatorial Problems: Not All Master Problems are Created Equal
Antonio Frangioni
(Università di Pisa, Italy)**

Abstract: Development of a "good" mixed-integer formulation is most often a fundamental step for being able to solve hard combinatorial problems. Unfortunately, "good quality" formulations, i.e., those with low continuous relaxation gaps, are most often exceedingly large. This requires techniques for incrementally generating them, like polyhedral methods (row generation), Lagrangian relaxations (column generation), and their combinations. We will review some recently proposed ideas to improve the performances of incremental generation techniques, based on different ways to modify and reformulate the standard "model" (master problem). In particular we will concentrate on stabilization techniques, describing some ways, different but related, in which specific structures of the problem can be algorithmically exploited. Computational results will be shown to demonstrate the potential benefits of these approaches, and for pointing out the issues that still limit the widespread applicability of these techniques.

The speaker is hosted by Martine Labbé.

**Thursday October 31, 2013, 12:30PM, room: 2NO7.07**

**Exact algorithms for Weak Roman Domination
Mathieu Chapelle
(Algorithmique, ULB, Belgium)**

Abstract: We consider the Weak Roman Domination problem. Considering the Great Roman Empire, the aim is to put "legions" on some cities of the Empire in order to defend all of them in case of a ennemy attack. More formally, the goal is to find a weak roman domination function (wrd-function) of minimum cost, i.e. a function which associates to each vertex either 0, 1 or 2 legions, such that (1) each vertex is defended, that is it has at least one legion in its closed neighborhood (which includes itself), and (2) if one vertex without legion is attacked, a neighboring legion can move onto this vertex to protect it, and still all vertices of the graph are defended. In this talk, I will present two exact algorithms to solve this problem in time better than the trivial enumeration algorithm: I will first present an algorithm in O^*(2^n) time needing exponential space, and then describe an O^*(2.2279^n) algorithm using polynomial space. Our results rely on structural properties of a wrd-function, as well as on the best polynomial space algorithm for the Red-Blue Dominating Set problem.

**Thursday October 24, 2013, 12:30PM, room: 2NO9.06**

**Integer programming models for open stack problems
Luigi De Giovanni
(University of Padova, Italy)**

Abstract: In many applications, a suitable permutation of patterns (product orders, cutting patterns, electronic circuit nodes etc.) has to be found in order to optimize over some given objective function (minimization of the work-in-process, of the open stacks, of the circuit area etc.), so giving rise to the so-called Open Stack problems. Literature presents different Integer Programming models based on different representations, among which interval graphs and binary matrices. We will focus on a formulation that exploits the structural properties of consecutive ones matrices, presenting different families of valid inequalities derived from the facets of the Consecutive Ones polytope, and discussing the related separation procedures. The model is solved by a branch-and-cut method, initialized by a heuristic solution provided by a genetic algorithm. The procedure has been applied to literature benchmarks, as well as to real instances from the industry of Very Large Scale Integrated (VLSI) circuits, showing improvements with respect to previous approaches.

The speaker is hosted by Martine Labbé.

**Tuesday June 11, 2013, 12:30PM, room: Forum H**

**On algebraic methods in incidence geometry
Abdul Basit
(Rutgers University, NJ, USA)**

Abstract: Incidence Geometry deals with the number of possible incidences between a finite number of geometric objects such as points, lines, and circles. Recently, a number of breakthroughs in the subject (e.g. Dvir's solution of the finite field Kakeya conjecture, or Guth and Katz's near optimal solution of the Erdos Distinct Distances problem) have been obtained by applying the polynomial method. One of the main ingredients of their proof is partitioning space using a polynomial constructed via the polynomial ham-sandwich theorem and then using tools from algebraic geometry to understand the objects being studied. In this talk, we give an introduction to these methods. Specifically, we will prove the classical Szemeredi-Trotter theorem. We will then talk about incidences between points and spheres in three dimensions.

This is a joint *Algebra & Combinatorics*, and
*Computer Science* seminar. The speaker is hosted by Stefan Langerman.

**Thursday June 6, 2013, 12:30PM, room: Forum H**

**Column generation approachs for two combinatorial problems of a telecommunication company
Murat Firat
(France Telecom, Sophia Antipolis. Orange Labs.)**

Abstract: Problems that are encountered in a telecommunication company are highly complex problems, hence most of them are NP-hard. In this talk two of these problems will be mentioned: the two-level FTTH network design problem and the stable workforce assignment problem. Compact formulations of both problems that are convenient for the Column Generation (CG) method will be presented. In the formulation of the former problem, the complexity of two pricing problems are analyzed. It turns out that both pricing problems are NP-hard to approximate. The pricing problem of the latter problem is finding a team of technicians for a job that is NP-Hard as well. Our CG method is embedded into the Branch-and-Bound search for real-life instances, and we find the optimal solutions in reasonable times compared to solution times by using an LP-solver like CPLEX.

The speaker is hosted by Bernard Fortz.

**Thursday May 16, 2013, 12:30PM, room: Forum H**

**Advances on Matroid Secretary Problems: Free Order Model and Laminar Case.
Jose A. Soto
(TU-Berlin and University of Chile)**

Abstract: In the standard matroid secretary problem we are given a matroid M in which every element has a hidden nonnegative weight. Our task is to incrementally construct an independent set of large weight in M in the setting where the weights are revealed in random order, and we must add elements to our solution as soon as they are revealed. There are constant-factor approximation algorithms for this problem on several classes of matroids. A well-known open problem is to determine if every matroid admits such an algorithm. In this talk, I will discuss this problem and present a simple constant factor approximation for the non-trivial class of laminar matroids. I will also present the first constant-factor approximation for a relaxed version of the matroid secretary problem in which we are allowed to adaptively choose the order in which elements reveal their weights. This is based on joint work with Patrick Jaillet (MIT) and Rico Zenklusen (Johns Hopkins University).

The speaker is hosted by Samuel Fiorini.

**Wednesday May 15, 2013, 12:30PM, room: Rotule NO8**

**Tensors, colours, octahedra.
Imre Bárány
(Alfréd Rényi Mathematical Institute)**

Abstract: Several classical results in convexity, like the theorems of Caratheodory, Helly, and Tverberg, have colourful versions. In this talk I plan to explain how two methods, the octahedral construction and Sarkaria's tensor trick, can be used to prove further extensions and generalizations of such colourful theorems.

The speaker is hosted by Stefan Langerman.

**Thursday March 28, 2013, 12:30PM, room: NO5, Solvay Room**

**A gradient boosting approach to the Kaggle load forecasting competition.
Souhaib Ben Taieb
(U.L.B, Machine Learning Group)**

Abstract: We describe and analyze the approach used by Team TinTin (Souhaib Ben Taieb and Rob J. Hyndman) in the Load Forecasting track of the Kaggle Global Energy Forecasting Competition 2012. The competition involved a hierarchical load forecasting problem for a US utility with 20 geographical zones. Eight in-sample and one out-of-sample weeks for 21 separate time series need to be backcast and forecast, respectively. The electricity demand for the next day is forecasted using a separate model for each hourly period. We use component-wise gradient boosting to estimate each hourly model with univariate penalized regression splines as base learners. The models allow for the electricity demand to change with time-of-year, day-of-week, time-of-day, and on public holidays with the main predictors being current and past temperatures as well as past demand. Our model ranked fifth out of 105 participating teams.

**Thursday February 28, 2013, 12:30PM, room: 2NO.506**

**Differentiating Defaulters in Credit Scoring using Data Mining and Game Theory.
Richard Weber
(U. de Chile)**

Abstract: In Credit Scoring we usually try to differentiate between defaulters and non-defaulters. In this work, we present a methodology for improving credit scoring models by differentiating between two forms of rational behaviour of the defaulters of loans. According to practitioners' knowledge there are two types of defaulters, those who do not pay because of cash flow problems ("Can’t Pay"), and those that do not pay because of lack of willingness to pay ("Won't Pay"). Within our approach the results of several supervised models are benchmarked, where the models deliver the probability of belonging to one of these three new classes (good payers, "Can't Pays", and "Won't Pays"). The process brings significant improvement in classification accuracy, delivers strong insights about the nature of defaulters, and could lead to improved credit scoring systems.

The speaker is hosted by Martine Labbé.

**Wednesday January 9, 2013, 12:30PM, room: Rotule NO.8**

**Response Time bounds for Static-Priority Tasks and Arbitrary Relative Deadlines with Resource Augmentation.
Pascal Richard
(LIAS/Université de Poitiers)**

Abstract: We propose a parametric approximation algorithm (Fully Polynomial Time Approximation Scheme - {\FPTAS}) that defines a compromise on the precision of computed worst-case response time upper bounds and the amount of extra processor speed required to achieve exact worst-case response times. Such a result fills the remaining gap between our previously published work and also extends them to tasks with arbitrary relative deadlines. Numerical results monitoring speedup factors will also be presented.

The speaker is hosted by Joël Goossens.

**Thursday November 29, 2012, 12:30PM, room: NO7.07**

**Triangle-free intersection graphs of line segments with large chromatic number.
Piotr Micek
(Jagiellonian University)**

Abstract: In the 1970s Erdős asked whether the chromatic number of intersection graphs of line segments in the plane is bounded by a function of their clique number. We show the answer is no. Specifically, for each positive integer $k$ we construct a triangle-free family of line segments in the plane with chromatic number greater than $k$. Our construction disproves a conjecture of Scott that graphs excluding induced subdivisions of any fixed graph have chromatic number bounded by a function of their clique number.

The speaker is hosted by Jean Cardinal.

**Thursday June 14, 2012, 12:30PM, room: 2NO7.07**

**Perfect matchings in cubic graphs.
Louis Esperet
(CNRS, G-SCOP, Grenoble)**

Abstract: A cubic graph is a graph in which every vertex has exactly three neighbors, and a perfect matching is a set of edges covering each vertex exactly once. We prove that 2-edge-connected cubic graphs have an exponential number of perfect matchings. This was conjectured by Lovasz and Plummer in the 70s. (joint work with F. Kardos, A. King, D. Kral, and S. Norine)

The speaker is hosted by Gwenaël Joret.

**Thursday May 3, 2012, 12:30PM, room: 2NO7.07**

**Search Tree Mysteries.
Robert E. Tarjan
(Princeton U. and HP Labs)**

Abstract: The search tree is a classical and ubiquitous data structure, fundamental to databases and many other computer applications. The AVL tree, a type of balanced binary tree, was invented fifty years ago; since then, many different kinds of search trees have been described, analyzed, and used. Yet the design space is vast, and mysteries remain. This talk will describe recent work by the speaker and his colleagues that has produced a new framework for defining and analyzing balanced search trees, a new kind of balanced tree with especially nice properties, and a way to maintain balance by rebalancing only on insertion, not on deletion.

Short Biography: Robert E. Tarjan is the James S. McDonnell Distinguished University Professor of Computer Science at Princeton University and a Senior Fellow at HP labs. His main research areas are the design and analysis of data structures and graph and network algorithms. He has also done work in computational complexity and security. He has held positions at Cornell University, U. C. Berkeley, Stanford University, NYU, Bell Laboratories, NEC, and InterTrust Technologies. He is a member of the National Academy of Sciences, the National Academy of Engineering, the American Philosophical Society, and the American Academy of Arts and Sciences. He was awarded the Nevanlinna Prize in Informatics in 1982 and the Turing Award in 1986.

The speaker is hosted by Stefan Langerman.

**Friday March 30, 2012, 12:30PM, room: NO5, Salle Solvay**

**Cooperative decision-making in cell regulation.
Kim van Roey
(European Molecular Biology Laboratory, EMBL Heidelberg)**

Abstract: Cells must continuously monitor and integrate the variety of signals they perceive in order to generate appropriate responses. This requires reliable and robust signal transduction, which is mediated by an intricate and interlinked network of pathways and processes that are tightly regulated. Assembly of the dynamic macromolecular complexes that modulate these pathways often depends on multiple transient, low-affinity interactions that are context-dependent, highly cooperative and easily tuneable. Such interactions provide the dynamic plasticity that is required for proper cell signalling and underlie the ability of proteins to act as switchable regulatory modules. This raises the question, how do proteins integrate available information to correctly make decisions? This talk addresses the role of intrinsically disordered protein regions, and more specifically short linear motifs, in cooperative decision-making and briefly introduces our current efforts to computationally describe cooperative interactions.

The speaker is hosted by Tom Lenaerts.

**Thursday March 29, 2012, 12:30PM, room: 2NO7.08**

**Dynamic programming in sparse graphs.
Ignasi Sau
(CNRS, LIRMM, Montpellier)**

Abstract: A fundamental parameter in the design and analysis of graph algorithms is the branchwidth of a graph, which can be seen as a measure of the topological resemblance of a graph to a tree (similar to treewidth). Its algorithmic importance is justified by Courcelle's theorem, stating that graph problems expressible in Monadic Second Order Logic can be solved in f(bw)n steps (here bw is the branchwidth and n is the number of vertices of the input graph). As the bounds for f(bw) provided by Courcelle's theorem are huge, it is of great interest the design algorithms so that f(bw) is a relatively simple function.

In this talk we overview a general framework for the design and analysis of dynamic programming algorithms for graphs embedded in arbitrary surfaces where f(bw)=2^{O(bw)}. Our approach combines tools from topological graph theory and analytic combinatorics. In particular, we introduce a new type of branch decomposition called "surface cut decomposition", which generalizes "sphere cut decompositions" introduced by Seymour and Thomas for planar graphs. That way, we unify and improve all previous results in this direction.

If time permits, we will also outline the main ideas in order to extend
our framework to deal with families of graphs excluding a fixed
graph as a minor.

This is joint work with Juanjo Rué and Dimitrios M. Thilikos.

The speaker is hosted by Gwenaël Joret.

**Wednesday March 14, 2012, 12:30PM, room: 2NO5.06**

**Abelian returns in infinite words.
Pavel Salimov
(ULg)**

Abstract: Finite words

The speaker is hosted by Émilie Charlier.

**Wednesday February 29, 2012, 12:00, room: NO, Salle Solvay (5th floor)**

**Weighted Timed Automata.
Karin Quaas
(University of Leipzig)**

Abstract: We present a general model of weighted timed automata that allows for the modelling of continuous resource consumption of real-time systems. A timed automaton is a finite automaton extended with finitely many real-valued clocks that measure the time. We additionally equip the transitions of a timed automaton with weights coming from a semiring. Also, the states are assigned a weight function determining the weight that arises while being in a state. A weighted timed automaton recognizes a timed series, i.e., a function that maps each timed word to a coefficient in the semiring, namely its weight. We present closure properties of recognizable timed series and investigate weighted extensions of classical decision problems like the emptiness or equivalence problem. Also we provide characterizations of recognizable timed series in terms of logic and generalizations of the well-known regular expressions.

The speaker is hosted by Jean-François Raskin.

**Wednesday February 22, 2012, 16:00, room: NO, Salle Solvay (5th floor)**

**Structure, Unstructure and Alternative Splicing.
Philip Kim
(University of Toronto)**

Abstract: Many protein interactions, in particular those in signaling networks, are mediated by peptide recognition domains. These recognize short, linear amino acid stretches on the surface of their cognate partners with high specificity. Residues in these stretches are usually assumed to contribute independently to binding, which has led to a simplified understanding of protein interactions. Conversely, in large binding peptide data sets different residue positions display highly significant correlations for many domains in three distinct families (PDZ, SH3 and WW). These correlation patterns reveal a widespread occurrence of multiple binding specificities and give novel structural insights into protein interactions. For example, a new binding mode of PDZ domains can be predicted and structurally rationalized for DLG1 PDZ1. While protein structure is very important for peptide binding domains, the regions they bind are usually unstructured (intrinsically disordered). These regions are widespread, especially in proteomes of higher eukaryotes, and have been associated with a plethora of different cellular functions. Aside from general importance for signaling networks, they are also important for such diverse processes as protein folding or DNA binding. Leveraging knowledge from systems biology can help to structure the phenomenon. Strikingly, disorder can be partitioned into three biologically distinct phenomena: regions where disorder is conserved but with quickly evolving amino acid sequences (“flexible disorder”), regions of conserved disorder with also highly conserved amino acid sequence (“constrained disorder”) and, lastly, non-conserved disorder. I will also introduce new efforts to map protein interactions affected by alternative splicing.

The speaker is hosted by Tom Lenaerts.

**Thursday February 16, 2012, 12:30PM, room: 2NO7.08**

**Obtaining a bipartite graph by contracting few edges.
Pim van 't Hof
(University of of Bergen, Norway)**

Abstract: We initiate the study of the Bipartite Contraction problem from the perspective of parameterized complexity. In this problem we are given a graph $G$ on $n$ vertices and an integer $k$, and the task is to determine whether we can obtain a bipartite graph from $G$ by a sequence of at most $k$ edge contractions. We show that the Bipartite Contraction problem is fixed-parameter tractable when parameterized by $k$, i.e., the problem can be solved in time $f(k) n^{O(1)}$ for some function $f$ that does not depend on $n$. Our algorithm is based on a novel combination of the irrelevant vertex technique, introduced by Robertson and Seymour, and the concept of important separators. Both techniques have previously been used as key components of algorithms for fundamental problems in parameterized complexity. However, to the best of our knowledge, this is the first time the two techniques are applied in unison.

(joint work with Pinar Heggernes, Daniel Lokshtanov and Christophe Paul)

The speaker is hosted by Marcin Kaminski.

**Wednesday January 18, 2012, 12:30PM, room: 2NO7.07**

**Ensemble learning for real-world classification.
Nima Hatami
(University of Cagliari)**

Abstract: Most real-world classification problems are too complicated to be tackled by a single expert. An alternative approach is to use ensem- ble of experts inspired by Divide-and-conquer principle which has proven to be efficient in many of these cases. A complex problem is first divided into some simpler sub-problems, each of them assigned to an expert. The final solution of the problem obtained by consensus of experts, is proven to be more effective and efficient. This talk will cover the application of different multiple-classifier systems to some real-world classification problems e.g. gene expression cancer classification, face recognition and text categorization.

The speaker is hosted by Gianluca Bontempi.

**Thursday December 22, 2011, 12:30PM, room: NO6.07**

The seminar of
Kim Van Roey
(
EMBL)
has been canceled.

**Wednesday December 21, 2011, 12:30PM, room: 2NO7.07**

**Title: Matheuristics for combinatorial optimization problems
Fabio Salassa
(D.A.I. Politecnico di Torino, Italy)**

Abstract: The solution techniques for solving combinatorial optimization problems are traditionally split into exact (mostly based on the optimal solution of the integer programming formulation of the problem) and heuristic algorithms. Recently a new wave has rapidly grown in the community of researchers, the hybridization of these two approaches, the so called Matheuristics which rely on the idea of exploiting the best of the two. While for the combination of heuristic procedures there exists a wide literature, matheuristics are still in development. Several different examples and results of such matheuristics on a variety of test instances will be presented and some conclusions from the performed experiments and trajectories for future research will be drawn.

The speaker is hosted by Martine Labbé.

**Monday December 12, 2011, 2PM, room NO8.08**

**Title: On Minimal Representation of Rational Arrival Processes
Miklos Telek
(Budapest University of Technology and Economics)**

Abstract: Rational Arrival Processes (RAPs) form a general class of stochastic processes which include Markovian Arrival Processes (MAPs) as a subclass. We study RAPs and their representations of different size. We show transformation methods between different representations and we present conditions to evaluate the size of the minimal representation. By showing some analogies to linear system theory. A minimization approach is defined which allows one to transform a RAP into one of its minimal representation (a representation of minimal size). An algorithm for computing a minimal representation is also given. Furthermore, we extend the approach to RAPs with batches or multiple entity types that are denoted as BRAPs or MRAPs.

The speaker is hosted by Guy Latouche.

**Friday December 9, 2011, 12:30PM, room 2NO7.08**

**RUN: Optimal Multiprocessor Real-Time Scheduling via Reduction to
Uniprocessor
Paul Regnier
(Federal University of Bahia Brazil)**

Abstract: Optimal multiprocessor real-time schedulers incur significant overhead for preemptions and migrations. We present RUN, an efficient scheduler that reduces the multiprocessor problem to a series of uniprocessor problems. RUN significantly outperforms existing optimal algorithms with an upper bound of O(\log m) average preemptions per job on m processors (less than 3 per job in all of our simulated task sets) and reduces to Partitioned EDF whenever a proper partitioning is found.

The speaker is hosted by Joël Goossens.

**Thursday November 24, 2011, 12:30PM, room 2NO6.07**

The seminar of
Takeshi Tokuyama
(Tohoku University)
has been canceled.

**Thursday November 17, 2011, 12:30PM, room 2NO6.07**

**Range majority and Ortoganal Range Counting using Techniques from Succinct Data Structures
Ian Munro
(U. of Waterloo)**

Abstract: Algorithms and data structures developed for one application domain and set of constraints are often applied to other situations. Succinct data structures were developed, to a large extent, for extremely space efficient string indexing. We now seem to be in an era in which such methods are being used for applications in which space requirements are not as severe and indeed for applications outside stringology, such as geometric problems. We give a couple of examples of this trend through recent results on reporting range majority and dynamic orthogonal range counting. This is joint work with Meng He et al.

The speaker is hosted by Jean Cardinal.

**Thursday November 10, 2011, 12:30PM, room 2NO6.07**

**Boundary properties of the satisfiability problems
Vadim V. Lozin
(University of Warwick)**

Abstract: The satisfiability problem is known to be NP-complete in general and for many restricted instances, such as formulas with at most 3 variables per clause and at most 3 occurrences per variable, or planar formulas. The latter example refers to graphs representing satisfiability instances. These are bipartite graphs with vertices representing clauses and variables, and edges connecting variables to the clauses containing them. Many authors point up the importance of finding the strongest possible restrictions under which a problem remains NP-complete. First, this can make it easier to establish the NP-completeness of new problems by allowing easier transformations. Second, this can help clarify the boundary between tractability and intractability. In this paper, I address the second issue and reveal the first boundary property of graphs representing satisfiability instances.

The speaker is hosted by Marcin Kaminski.

**Tuesday November 8, 2011, 12:30PM, room 2NO7.07**

**Re-optimization problems
M.Grazia Speranza
(University of Brescia)**

Abstract: In most optimization models one of the basic underlying assumptions is that all the information needed is available at the time the model is solved and that the optimal solution found is implemented. A common situation is that a problem instance has been optimally solved and then an event takes place that slightly modifies the instance before the solution is implemented. In general, we say that we face a re-optimization problem whenever an optimal solution of a problem instance has been found, a (minor) change takes place in the problem instance, and a new (slightly different) instance has to be solved. Re-optimizing means taking into account the work done on the previous instance and taking advantage of the knowledge of the previously optimal solution. Often the time available to find a solution to a re-optimization problem is limited. In the case of a polynomially solvable problem, a re-optimization problem may be solved exactly taking advantage of the computational work done on the original instance. In the case of an NP-hard problem, an approximation algorithm for a re-optimization problem may take advantage of the optimal solution of the original instance by finding a solution of better quality or a solution of the same quality in a smaller computational time. We present approximation algorithms for the re-optimization of the Traveling Salesman Problem, of the Knapsack Problem and of the Rural Postman Problem. We also present simple procedures for the re-optimization of two basic polynomially solvable problems, the minimum spanning tree and the maximum flow problem.

The speaker is hosted by Martine Labbé.

**Tuesday October 18, 2011, 1PM, rotule 2NO8**

**Switching on and off the full capacity of an M/M/∞ queue
Eugene Feinberg
(State University of New York at Stony Brook)**

Abstract: This paper studies optimal switching on and off the capacity of an M/M/∞ queue with holding, running and switching costs. The goal is to minimize average costs per unit time. The main result is that an optimal policy either always runs the system or is defined by two thresholds M and N, such that the system is switched on upon an arrival epoch when the number of customers in the system accumulates to N and it is switched off upon a departure epoch when the number of customers in the system decreases to M.

The speaker is hosted by Giang Nguyen.

**Friday October 7, 2011, 12:30PM, room 2NO7.08**

**Lightpath Topology Design of Wavelength-Routed Networks to Serve
Shortest Path-based IP Networks and impact on virtualization
Deep Medhi
(University of Missouri)**

Abstract: In this talk, we address the problem of designing lightpath topologies for wavelength-routed networks to serve shortest path-based IP networks. The objective is to design a lightpath topology that remains connected in the event of any single physical link failure while providing the IP network with unique shortest paths for all node-pairs. We present an optimization model and a heuristic to solve this problem. We consider a number of different performance measures to evaluate our solution approach and to discuss impact on survivable topology design, especially in terms of the number of transreceivers deployed. Our approach encompasses the three cross-layers of IP, lightpaths, and the physical topology in an integrated design framework. We will then discuss impact on network virtualization.

The speaker is hosted by Bernard Fortz.

**Thursday September 29, 2011, 12:30PM, room 2NO6.07**

**Algorithmic Graph Minors: Theorems and Techniques
Dimitrios M. Thilikos
(University of Athens)**

Abstract: The main mathematical achievement of the Graph Minors Theory (GMT), developed by Robertson and Seymour, was the proof of Wagner's conjecture, now known as the {\sl Robertson \& Seymour Theorem}, stating that graphs are well quasi ordered under the minor containment relation. Besides its purely theoretical importance, GMT induced a series of powerful algorithmic results and techniques that had a deep influence in theoretical computer science. GMT offered the theoretical base for the understanding and the resolution of some of the most prominent graph-algorithmic problems in parameterized complexity. In this talk we give a brief presentation of the main results and techniques to this direction.

The speaker is hosted by Samuel Fiorini and Marcin Kaminski.

**Wednesday September 21, 2011, 12:30PM, room 2NO7.07**

**On the Hazmat Transport Network Design Problem
Maurizio Bruglieri
(Politecnico di Milano)**

Abstract: We consider the problem of designing a network for hazardous material transportation where the government can decide which roads have to be forbidden to hazmats and the carriers choose the routes on the network. We assume that the government is interested in minimizing the overall risk of the shipments whereas the carriers minimize the route costs. In spite of the rich literature on hazmat transportation and of the relevance of this network design problem, it has received little attention and only quite recently. In this work we prove that the version of the hazmat transport network design problem where a subset of arcs can be forbidden is NP-hard even when a single commodity has to be shipped. We propose a bilevel integer programming formulation that guarantees solution stability and we derive a (single-level) mixed integer linear programming formulation that can be solved in reasonable time with a state-of-the-art solver.

The speaker is hosted by Bernard Fortz.

**Friday September 2, 2011, 14:00PM, room: NO7.07**

**Predicting structured-output from protein sequence.
Andrea Passerini
(
Università degli Studi di Trento)**

Abstract: Recent advances in high-throughput sequencing techniques are drastically increasing the amount of biological sequences available for further study. On the other hand, experimentally determining their three-dimensional structure is an expensive and time-consuming process. In this scenario, automatic approaches to sequence analysis are crucial in order to fill this gap and devise information on their biological function. I will present machine learning techniques for predicting protein structural features from sequence. The talk will focus on challenging problems where the desired output is a discrete structure, e.g. a graph connecting certain residues in the sequence. I will first discuss the prediction of disulphide bridges, i.e. covalent bonds between pairs of cysteines, which help stabilizing protein 3D structure and have a relevant structural and functional role. This task can be effectively addressed with a nearest-neighbour approach in the space of candidate configurations. I will then introduce the problem of metal binding site prediction, whose characteristics prevent the application of this method. I will present a search-based structured-output technique relying on an online strategy learning to discriminate between correct and incorrect moves. The advantages and drawbacks of these algorithms will be discussed together to their applicability to other structured-output problems.

The speaker is hosted by Gianluca Bontempi and Tom Lenaerts.

**Thursday August 25, 2011, 12:30PM, room: NO7.07**

**Modeling and optimizing of drinking water supply networks.
Derek Verleye
(Universiteit Gent)**

Abstract: The mathematical formulation of an operational planning model for daily operations at a water supply network results in a non-convex MINLP. In this model, which is based on the existing network of VMW (Vlaamse Maatschappij voor Watervoorziening), there is a large variety of complex hydraulic constraints. Nonsmooth functions are needed to describe friction losses in pipes, whereas the relation between pressure and flow in pumps lead to a non-convex power term. We add binary variables to describe the possibility of free inflow or re-injection of water at reservoirs. We develop and test different formulations and propose convexifications or smooth functions where applicable. Since optimization is done over several periods, the computation time is very large. The MINLP solver Bonmin is used to generate a locally optimal solution. Decomposition techniques from the literature, such as Feasibility Pump, are tested on the model and results are discussed.

The speaker is hosted by Michael Poss.

**Thursday June 23, 2011, 12:30PM, room: NO7.08**

**The construction of multiscale kernel smoothing decompositions.
Maarten Jansen
(ULB)**

Abstract: Continuation of the seminar of April 28.

**Wednesday June 22, 2011, 3:00PM, room: Forum G**

**Integrating Database Systems and Data Mining Algorithms.
Carlos Ordonez
(University of Houston)**

Abstract: Data mining remains an important research area in database systems and a major challenge in computer science. We present a review of processing alternatives, storage mechanisms, algorithms, data structures and optimizations that enable data mining on large data sets. We focus on the computation of well-known multidimensional statistical and machine learning models. We pay particular attention to SQL (together with UDFs) and MapReduce as two competing technologies for large scale processing, especially with parallel computing. We conclude with a summary of solved major problems and open research issues.

bio: Carlos Ordonez received a degree in applied mathematics and an M.S. degree in computer science, from UNAM University, Mexico, in 1992 and 1996, respectively. He got a Ph.D. degree in Computer Science from the Georgia Institute of Technology, in 2000. Dr Ordonez worked six years extending the Teradata DBMS with data mining algorithms. Carlos had the opportunity to collaborate in more than 20 data mining projects from many companies with large data warehouses. He is currently is an Assistant Professor at the University of Houston. His research is centered on the integration of statistical and data mining techniques into database systems and their application to scientific problems.

The speaker is hosted by Esteban Zimanyi.

**Thursday June 16, 2011, 12:30PM, room: NO7.08**

**Cooperation, Reputation & Gossiping.
Vincent Traag
(Université Catholique de Louvain, Belgium)**

Abstract: Explaining how cooperation can emerge, and persist over time in various species is a prime challenge for both biologists and social scientists. Whereas cooperation in non-human species might be explained through mechanisms such as kinship selection or reciprocity, this is usually regarded as insufficient to explain the extent of cooperation observed in humans. It has been theorized that indirect reciprocity---I help you, and someone else later helps me---could explain the breadth of human cooperation. Reputation is central to this idea, since it conveys important information to third parties whether to cooperate or not with a focal player. In this talk I analyze a model for reputation dynamics through gossiping, and pay specific attention to the possible cooperation networks that may arise. We show that gossiping agents can organize into cooperative clusters, i.e. cooperate within clusters, and defect between them, which can be regarded as socially balanced. Surprisingly then, more social influence can lead to a more fragmented network of cooperation. We also investigate the infinite population dynamics, and show that individualistic prejudiced agents do particularly well in a "friendly" environment, whereas social trusting agent do well in "though" environments.

The speaker is hosted by Tom Lenaerts.

**Thursday June 9, 2011, 12:30PM, room: NO7.08**

**Approximating Petri Net Reachability Along Context-free Traces.
Pierre Ganty
(IMDEA Software Institute, Madrid, Spain)**

Abstract: We investigate the issue of determining whether the intersection of a context-free language (CFL) and a Petri net language (PNL) is empty. Our contribution to solve this long-standing problem which relates, for instance, to the reachability analysis of recursive programs over unbounded data domain, is to identify a class of CFLs called the finite-index CFLs for which the problem is decidable. The k-index approximation of a CFL can be obtained by discarding all the words that cannot be derived within a budget k on the number of non-terminal symbols. A finite-index CFL is thus a CFL which coincides with its k-index approximation for some k. We decide whether the intersection of a finite index CFL and a PNL is empty by reducing it to the reachability problem of a Petri nets with ordered inhibitor arcs, a class of systems with infinitely many states for which reachability is known to be decidable. Conversely, we show that the reachability problem for a Petri net with ordered inhibitor arcs reduces to the emptiness problem of a finite-index CFL intersected with a PNL.

This is a joint work with Mohamed-Faouzi Atig.

The speaker is hosted by Jean-François Raskin.

**Thursday May 19, 2011, 12:30PM, room: NO7.08**

**Applications of Machine Learning in Side Channel Analysis.
Benedikt
Gierlichs and
Gabriel Hospodar
(Katholieke Universiteit Leuven,
ESAT-SCD-COSIC
& IBBT, Belgium)**

Abstract: We discuss the application of supervised machine learning techniques in side channel analysis, with a focus on power analysis. We first recap the necessary basics of power analysis with a view towards machine learning. Then we explain two state-of-the art attacks that are based on Bayesian classification. In the second part of the talk we present our work on attacks that use (LS-)SVMs as classifiers and report some preliminary results.

The speakers are hosted by Gianluca Bontempi and Olivier Markowitch.

**Wednesday May 4, 2011, 12:30PM, room: 2NO7.07**

**Triangulating the Square and Squaring the Triangle.
Wolfgang Mulzer
(Freie Universität Berlin, Germany)**

Abstract: We show that Delaunay triangulations and compressed quadtrees are equivalent structures. More precisely, we give two algorithms: the first computes a compressed quadtree for a planar point set, given the Delaunay triangulation; the second finds the Delaunay triangulation, given a compressed quadtree. Both algorithms run in deterministic linear time on a pointer machine. Our work builds on and extends previous results by Krznaric and Levcopolous and by Buchin and Mulzer.

As a corollary, we obtain deterministic versions of many previous algorithms related to Delaunay triangulations, such as splitting planar Delaunay triangulations, preprocessing imprecise points for faster Delaunay computation, and transdichotomous Delaunay triangulations.

Joint work with Maarten Löffler.

The speaker is hosted by Stefan Langerman.

**Thursday April 28, 2011, 12:30PM, room: NO7.08**

**Constructing and processing multiscale sparse data representations.
Maarten Jansen
(ULB)**

Abstract: In this talk, I discuss the two main topics of my research, which concentrate on the construction of multiscale sparse data decompositions, and on the usage of these sparse data representations in statistical signal processing. In the introduction, I explain that sparsity leads to non-linear processing and that non-linearity is especially useful for intermittent data, i.e., data with non-stationary behavior. Second, the construction of multiscale sparsity part focuses on the so-called lifting scheme for the construction of wavelets and similar decompositions on data with arbitrary configurations, including nonequidistant time series, 2d scattered data, but also data on large molecules or networks. Current research is about multiscale kernel smoothing within this lifting scheme. The third part is about sparse data processing, with focus on elements of variable selection under sparsity and structured sparsity. I discuss the minimization of information criteria for the selection of significant components in high-dimensional data. The proposed procedure is compared to other methods that are based on type-I-error control (false discovery rate). This comparison is situated in the perspective of structured variable selection, which is subject of future research.

**Wednesday March 23, 2011, 12:30PM, room: NO6.07**

**Small cases of Scott's Conjecture.
Nicolas Trotignon
(CNRS, Université Denis Diderot - Paris 7, LIAFA, France)**

Abstract: It is an old and well known result that there exist triangle-free graphs of arbitrarily large chromatic number. So, it is impossible in general to bound the chromatic number of graphs from above with a function of the size of their largest cliques (a clique is a set of pairwise adjacent vertices). However, obviously, this can be done for some classes of graphs (trees, bipartite graphs, perfect graphs, ...). When H is a graph, we denote by Forb*(H) the class of all graphs that do not contain any subdivision of H as an induced subgraph. Let chi(G) denotes the chromatic number of G, and omega(G) denotes the size of a largest clique in G. Alex Scott conjectures that for every graph H, there exists a function f, depending on H, such that all graphs G from Forb*(H) satisfy chi(G) <= f(omega(H)).

In this talk, I will survey the proof of Scott's Conjecture for several small graphs. In particular, we will show that the conjecture holds when:

- H is the diamond (that is the complete graph on 4 vertices with one edge deleted), obtained jointly with Kristina Vuskovic;
- H is the complete graph on 4 vertices, (Scott observed that this follows easily from a theorem due to Kuhn and Osthus);
- H is the bull (that is a triangle with two pending non-adjacent edges), obtained jointly with Maria Chudnovsky, Irena Penev and Alex Scott.

The speaker is hosted by Marcin Kaminski.

**Thursday March 10, 2011, 12:30PM, room: NO7.08**

**Disjoint-Path Facility Location: Theory and Practice
Howard Karloff
(AT&T Labs, NJ, USA)**

Abstract: Internet service providers hope to provide their customers with superior Internet connectivity, but do they always do so? How can an ISP even know what quality of service it's providing to its customers? To this end, researchers recently proposed a new scheme an ISP could use in order to estimate the packet loss rates experienced by its customers.

To implement the new scheme, one has to approximately solve an interesting NP-Hard optimization problem on the ISP's network. Specifically, one must choose a small set of network nodes such that from each customer node there are arc-disjoint paths to *two* of the selected nodes. I will discuss recent work, mostly at ATT, attacking this problem and its surprisingly good results, in light of the problem's provable inapproximability in the worst case.

This is joint work with many people.

The speaker is hosted by Samuel Fiorini.

**Friday February 25, 2011, 14:00PM, room: A2.122**

**Beyond Space For Spatial Networks
Renaud Lambiotte
(Imperial College, London, UK)**

Abstract: Many complex systems are organized in the form of a network embedded in space. Important examples include the physical Internet infrastucture, road networks, flight connections, brain functional networks and social networks. The effect of space on network topology has recently come under the spotlight because of the emergence of pervasive technologies based on geo-localization, which constantly fill databases with people's movements and thus reveal their trajectories and spatial behaviour. Extracting patterns and regularities from the resulting massive amount of human mobility data requires the development of appropriate tools for uncovering information in spatially-embedded networks. In contrast with most works that tend to apply standard network metrics to any type of network, we argue in this paper for a careful treatment of the constraints imposed by space on network topology. In particular, we focus on the problem of community detection and propose a modularity function adapted to spatial networks. We show that it is possible to factor out the effect of space in order to reveal more clearly hidden structural similarities between the nodes. Methods are tested on a large mobile phone network and computer-generated benchmarks where the effect of space has been incorporated.

The speaker is hosted by Tom Lenaerts.

**Thursday February 24, 2011, 12:30PM, room: NO7.08**

**Coloring graphs without a fixed induced linear forest
Daniël Paulusma
(Durham University, UK)**

Abstract: The k-Coloring problem is the problem to decide whether a graph can be colored with at most k colors. The Vertex Coloring problem is the problem to determine the chromatic number of a graph. Kral, Kratochvil, Tuza, and Woeginger completely characterized the complexity of Vertex Coloring for graphs with one forbidden induced subgraph H in their WG 2001 paper. A similar computational complexity classification of the k-Coloring problem is still open. We discuss partial results that extend current work. In particular, we consider the case when H is a fixed linear forest (disjoint union of a collection of paths).

The speaker is hosted by Marcin Kaminski.

**Thursday January 27, 2011, 12:30PM, room: NO7.08**

**Predictive Network Inference in Colon Cancer
Catharina Olsen
(Machine Learning Group, ULB)**

Abstract: In bioinformatics, the key question concerns the understanding of how genes interact with each other in a given context, i.e. which genes take part in the regulation of a target gene. Given the characteristics of data generated in this field, usually containing a very high number of genes while at the same time only a low number of samples, network inference algorithms have in the past helped to build models explaining these gene-gene relationships. In our work, we tackled two problems: 1) not knowing the underlying true interaction network makes the assessment of the inferred networks difficult 2) how can results from the research community be integrated into the model building processs. As to the first problem we used the network's predictive ability to obtain a measure of the network's similarity to the underlying truth, i.e. the higher the prediction accuracy the better the network. Regarding the second problem, we present a network inference approach based on information theory and regression modeling. Using publicly available microarray data we show experimentally that using prior knowledge helps to identify better networks.

**Thursday November 18, 2010, 12:30PM, room: NO7.08**

**Satellite communications for disaster management
Laurent Franck
(Télécom Bretagne, France)**

Abstract: Every year, we are reminded about the challenges of disaster management when a catastrophe strikes and makes hundreds of casualties. Every year, we are experiencing the frustrating feeling that coping effectively with disaster management is a never-ending story and that everything has still to be done.

This is obviously inaccurate but it reflects the complexity of the topic. Among the various factors that make disaster management so challenging and each situation unique, let us highlight a few of them:

- Disasters strike anywhere, anytime but call for a fast response;
- The transport, power and telecommunication infrastructures are often impaired if not destroyed;
- Disaster management implies the co-operation of various organisations and authorities from different countries;
- The sovereignty and laws of country where the disaster takes place must not be infringed despite the gravity of the situation.

The presentation will start with an overview of disaster management and how telecommunications may help to mitigate the death toll. We will then go through the existing and possible roles of satellite communications. The presentation will be concluded with an highlight on current research activities on satellite communications for disaster management.

Note: this talk is made to be open to everyone, even those with almost no telecommunications background. We will also to show how disaster management is peculiar and must not be adressed through the traditional engineering & business practices.

The speaker is hosted by Olivier Markowitch.

**Friday October 22, 2010, 14:00PM, room: NO8 Rotule**

**Statistical issues in the development of clinically useful biomarkers in oncology from microarrays
Stefan Michiels
(Bordet, ULB)**

Abstract: The recent revolution in genomics and the advent of molecularly targeted therapies have increased the interest in biomarker-based prediction models for the outcome of cancer patients. Multigene classifiers, also known as "gene signatures", can be developed from microarray-based expression profiling or other high-dimensional arrays as potentially useful prognostic tools. This talk focuses on developing biomarkers that modify the prognosis of patients, biomarkers that indicate how patients will respond to specific treatments, and to a lesser extent surrogate endpoints for drug development. I will illustrate the statistical techniques, criteria and study designs appropriate for the identification and validation of these various types of biomarkers, and their use in clinical trials. For gene signatures, the role of gene or feature selection, multiple testing, sample size, classification methods, as well as the need for internal and external validation will be discussed. Using previous work on mainly breast cancer as an example, I shall review some of the problems in interpreting the results, and discuss the validity and the clinical usefulness of the findings.

Biosketch Stefan Michiels: Stefan Michiels is since May 2010 at the Breast Cancer Translational Research Laboratory (Faculté de Médecine, Université libre de Bruxelles, ULB290) of the Institut Jules Bordet. His areas of expertise are statistical analysis of biomarker and genomic array data, development and validation of prognostic models, clinical trials and meta-analyses in oncology. Stefan holds a PhD in Biostatistics from the School of Public Health at the Paris XI University and Master Degrees in Statistics and in Applied Mathematics from the University of Leuven. His previous positions included the Institut Gustave Roussy (France), the National Cancer Institute (France) and the University of Leuven. He has authored about 50 peer-reviewed publications in journals such as Lancet, JAMA, Lancet Oncology, Journal of Clinical Oncology, Journal of Clinical Epidemiology, Statistics in Medicine, Bioinformatics and Statistical Methods in Medical Research. He is member of the editorial board of Biometrics and Cancer Prevention Research.

The speaker is hosted by Gianluca Bontempi.

**Friday Sept 10, 2010, 12:30PM, room NO7.07**

**Title: Higher order asymptotics from multivariate generating functions
Mark C. Wilson, University of Auckland
**

Abstract: For the past decade I have been working on a project with Robin Pemantle to systematize coefficient extraction from multivariate generating functions. I will give a sketchy overview of results so far and then concentrate on recent work on higher order terms. Emphasis is placed on concrete computation and interesting examples. There are many unsolved problems!

The speaker is hosted by Jean Cardinal.

**Thursday June 24, 2010, 12:30PM, room NO7.08**

**Title: Approximability of Precedence Constraint and Robust Scheduling Problems
Nikolaus Mutsanas
(IDSIA, Switzerland)**

Abstract: We study the approximability of a classical single machine scheduling problem in different contexts. First, we consider the problem of scheduling precedence constraint jobs with the objective to minimise the sum of weighted completion times. This problem was known to be NP-hard already in the seventies. Several 2-approximation algorithms for the general case exist, as well as some better than 2-approximations -- up to exact algorithms -- for special classes of precedence constraints. We present a framework that unifies and in some cases improves on the best known algorithms for all previously considered special classes of precedence constraints. This framework is based on recent advancements on this problem which established it to be a special case of the vertex cover problem. The resulting graph turns out to be well known to combinatorialists, which allows us to tap the rich dimension theory of partial orders in order to devise better than 2-approximation algorithms whenever the so-called fractional dimension of the partial order is bounded. We then study the above scheduling problems in the presence of uncertainty. We show that this problem cannot be approximated within a better than logarithmic factor whenever the number of different scenarios, i.e. different configurations of the numerical parameters is unbounded, even in the absense of precedence constraints. This result contrasts the difficulty in proving inapproximability results for the classical, non-robust problem and hints at the increase in complexity caused by the uncertain environment. We find it therefore surprising that we were able to develop a polynomial time 2-approximation algorithm for the case when only one of the two parameters is affected by uncertainty. The fact that our result holds in the presence of precedence constraints implies that it cannot be improved without improving upon the 2-approximation algorithm for the classical precedence constrained scheduling problem, a long standing open problem in scheduling theory. We further prove inapproximability results for the unweighted case and give a polynomial time algorithm for the case when both the number of scenarios and processing times / weights are bounded by some constant.

The speaker is hosted by Samuel Fiorini.

**Thursday June 3, 2010, 12:30PM, room NO7.08**

**Titre: Formulations for the Center Facility Location Network Design
Problem with Budget Constraint
Elena Fernández
(Universitat Politècnica de Catalunya, Spain)**

Abstract: The "Center Facility Location Network Design Problem with Budget Constraint" is presented. It is a new model for integrated facility location and network design, which simultaneously considers the location of service facilities and the design of its underlying transportation network. The problem includes a budget constraint on the overall cost for the location of facilities plus the construction of the network. The objective is to minimize the maximum distance between any demand point and its allocated service facility. The evaluation of the objective is involved as the paths connecting the nodes and their allocated facilities must be identified. Indeed, such paths relate the selected arcs, the selected hubs and the allocation of non-hubs to hubs. The complexity of the problem is established and two alternative integer programming formulations are presented and compared. A multicommodity-based formulation is clearly outperformed by a smaller formulation that exploits the structure of the problem. This smaller formulation is taken as basis for further improvements and is successively strengthened by introducing further classes of valid inequalities. The effect of employing tight upper bounds to reinforce some constraints of the formulation and to derive simple reduction tests is discussed. Numerical results of a series of computational experiments for instances on up to 100 nodes are presented and analyzed.

The speaker is hosted by Martine Labbé.

**Thursday May 6, 2010, 12:30PM, room NO7.08**

**Title: Research on Stochastic Local Search Algorithms at IRIDIA
Thomas Stuetzle
(IRIDIA, ULB)**

Abstract: Stochastic local search (SLS) algorithms are among the most powerful techniques for solving computationally hard problems in many areas of computer science, operations research and engineering. SLS techniques range from rather simple constructive and iterative improvement algorithms to general-purpose SLS methods (usually called metaheuristics) such as ant colony optimization, iterated local search, memetic algorithms or tabu search. In this talk, we first give a concise introduction into SLS and argue that the development of effective SLS algorithms requires a sound algorithm engineering methodology. Next, we give an overview of the research directions in SLS that are currently followed at the IRIDIA laboratory. In the remainder of the talk, we review developments and results in three areas:

- the development and application of tools for the automatic configuration of SLS algorithms;
- the design and implementation of new state-of-the-art algorithms for the probabilistic traveling salesman problem;
- the design and implementation of new state-of-the-art algorithms for a number of bi-objective flow shop scheduling problems.

The speaker is hosted by Bernard Fortz.

**Thursday April 22, 2010, 12:30PM, room NO7.08**

**Title: Introduction to Constraint Programming using Comet
Pierre Schaus
(Dynadec)**

Abstract: After introducing basic concepts of Constraint Programming (CP) we will cover:

- satisfaction and optimization problems
- global constraints and filtering algorithms
- search and heuristics
- large neighborhood search
- visualization
- scheduling
- hybridization methods using CP

The speaker is hosted by Bernard Fortz.

**Thursday April 1, 2010, 12:30PM, room NO7.08**

**Title: Counting on Graphs (and playing with pebbles)
Rudi Penne
(Karel de Grote-Hogeschool and University of Antwerp)**

Abstract: How many measurements do we need for a configuration of points to be determined in the plane or in space?

These measurements can be distances, angles, collinearity tests, etc... Most often we do not require the determination in the strict sense (the exact position of the points), but up to congruency or up to similarity or up to a more general geometric transformation. Applications can be found in CAD (defining a complicated design by a partial set of point specifications), Structural Mechanics (deciding what joint pairs must be linked by bars to ensure rigidity), Chemistry (determination of the molecular structure by measuring atomic distances), Sensor Networks (localization of nodes by direction, bearing or distance information between "agents"), etc...

In all these different applications, the main questions are universal:

- realizability: can a given subset of data (distances, measurements,...) be represented by a geometric configuration?
- uniqueness: is the given set of data sufficient to determine the configuration, and is this determination global or local?
- independence: are all given measurements independent from each other, or do we have redundant data?

The speaker is hosted by Perouz Taslakian.

**Thursday March 25, 2010, 12:30PM, room: NO9**

**Title: Stochastic Dominance Relations in Stochastic Integer Programming
Ruediger Schultz
(Universität Duisburg, Germany)**

Abstract: Stochastic dominance is a proven tool in decision theory. Recently it has made its way into stochastic programming, offering modeling alternatives for risk aversion. In the talk we review this development with emphasis on two-stage stochastic integer programs. We study basic structural properties, discuss algorithmic possibilities involving decomposition, and provide illustrations at decision problems from power production and trading.

The speaker is hosted by Martine Labbé.

**Thursday March 18, 2010, 12:30PM, room NO7.08**

**Title: The MCF-Separator -- Detecting and Exploiting Multi-Commodity Flow
Structures in MIPs
Christian Raack
(ZIB, Berlin)**

Abstract: In this talk the new separator "MCF" that recently has been added to the mixed integer programming (MIP) solvers CPLEX and SCIP will be introduced. This is joint work with Tobias Achterberg from IBM.

Given a MIP, we automatically detect block structures in the constraint matrix together with the coupling by capacity constraints arising from multi-commodity flow (MCF) formulations. We identify the underlying graph and generate cutting planes based on cuts in the detected network. We make use of the complemented mixed integer rounding framework (c-MIR) but provide a special purpose aggregation heuristic that exploits the identified network structure.

We show that the proposed separation scheme speeds-up the computation for a large set of network design problems by a factor of two on average. On the other hand, in roughly 10% of general MIP instances we found consistent embedded networks. For these instances the computation time is decreased by 18% on average. There is almost no degradation for the remaining (non-network) instances.

The speaker is hosted by Michael Poss.

**Friday March 5, 2010, 12:30PM, room: OF2070**

**Title: Reasoning about Collections with Cardinality Constraints
Ruzika Piskac
(EPFL, Switzerland)**

Abstract: Applications in software verification and interactive theorem proving often involve reasoning about sets of objects. Cardinality constraints on such collections also arise in these scenarios. Multisets arise for analogous reasons as sets: abstracting the content of linked data structure with duplicate elements leads to multisets. Interactive theorem provers such as Isabelle specify theories of multisets and prove a number of theorems about them to enable their use in interactive verification. However, the decidability and complexity of constraints on multisets is much less understood than for constraints on sets.

In this talk we will show that the satisfiability problem for a logic of sets, multisets (bags), and cardinality constraints is decidable. We will also show that the optimal complexity results. It relies on an extension of integer linear arithmetic with a "star" operator, which takes closure under vector addition of the solution set of a linear arithmetic formula. We show that the satisfiability problem for this extended language remains in NP (and therefore NP-complete). Our proof uses semilinear set characterization of solutions of integer linear arithmetic formulas, as well as a generalization of a recent result on sparse solutions of integer linear programming problems.

We also mention several extensions of these results: function image operators, collections with fractional multiplicity, and a result on combination of non-disjoint theories which share set symbols and operations. In addition to verification, we also report on the use of these decision procedures in synthesis.

The speaker is hosted by Gilles Geeraerts.

**Thursday March 4, 2010, 12:30PM, room: NO7.08**

**Solving Non-Convex Lasso Type Problems With DC Programming
Romain Herault
(INSA de Rouen, France)**

Abstract: We propose a novel algorithm for addressing variable selection (or sparsity recovering) problem using non-convex penalties. A generic framework based on a DC programming is presented and yields to an iterative weighted lasso-type problem. We have then showed that many existing approaches for solving such a non-convex problem are particular cases of our algorithm. We also provide some empirical evidence that our algorithm outperforms existing ones.

Based on the article:

G. Gasso, A. Rakotomamonjy, S. Canu, Recovering sparse signals with non-convex penalties and DC programming, IEEE Trans. Signal Processing, Vol 57, no.12, pp 4686-4698, 2009.

The speaker is hosted by Gianluca Bontempi.

**Friday February 26, 2010, 12:30PM, room: NO9, DATE CHANGED**

**Title: Exact cost of preemption in monoprocessor real-time scheduling with multiple constraints
Patrick Meumeu Yomsi
(ULB)**

Abstract: We are interested in the scheduling problem of periodic tasks in critical (hard) real-time systems. In the literature, the approximation of the preemption cost, which is the variable part of the Operating System (OS) cost, in the WCET of tasks leads us to a compromise between waste and safety of the schedulability, that is not satisfactory. Some works have been proposed to solve this problem but the results led to taking into account either a minimum or a maximum number of preemptions. In this talk, we introduce a new model to solve the general scheduling problem of hard real-time systems with many constraints such as precedence, strict periodicity, latency and jitter, while taking into account the exact cost of preemption for all scenarios of first activation for all tasks (simultaneous or not simultaneous). We have developed a software called SAS (Simulation Analysis of Scheduling) to make them available to users the results we have achieved. The main contribution of SAS, compared to other commercial and academic tools of the same type, is that it takes into account the exact cost of preemption during the schedulability analysis.

The speaker is hosted by Joël Goossens.

**Thursday February 4, 2010, 12:30PM, room NO7.08**

**Title: Cryptographic hash functions, sponge functions and the SHA-3 contest
Gilles Van Assche
(STmicroelectronics)**

Abstract: A cryptographic hash function takes as input a message of any length and produces a digest, usually a few dozen bytes long. Such functions are used ubiquitously in cryptographic applications, e.g., in digital signatures or secret-key derivation. Recently, many popular and standard hash functions (e.g., MD4, MD5, SHA-1) have been broken, hence triggering a new interest for research in this field. While a short-term migration to SHA-2 is taking place, long-term solutions are needed. The SHA family, standardized by NIST, is designed in the same line of thought as the MD4 and MD5 family. Fresh new ideas are thus welcome in this field, hence currently making it a live and exciting research area.

To encourage fresh new ideas, the NIST has organized a competition to define the future standard hash function, called SHA-3. In October 2008, 64 entries were received by NIST, 51 of which were valid and were analyzed (and sometimes broken) by the community during almost a year. In July 2009, NIST selected 14 candidates for the second round of the process. After further cryptanalysis and short-listing, a winner is expected to be announced in 2012.

In the meantime, sponge functions are a specific construction useful for hashing. Among the SHA-3 candidates, some are actually sponge functions and many borrow at least some ideas from it. Sponge functions provide a particular way to generalize hash functions to more general functions whose output length is arbitrary. Based on the sponge construction, they model in a very simple way the finite memory any concrete construction has access to. We have shown that sponge functions can be used as an alternative to the random oracle model for expressing security claims, and that the sponge construction can lead to a concrete design method, e.g., for our candidate Keccak, providing many interesting properties of sponge functions.

The speaker is hosted by Olivier Markowitch.

**Thursday January 21, 2010, 12:30PM, room NO7.08**

**Title: Approximate Bayesian inference and model selection in systems biology
Tina Toni
(Imperial College London)**

Abstract: Mathematical modelling has become an important tool in the biological sciences. Due to the overwhelming complexity of biological systems, it is not straightforward to determine the structure of realistic and predictive computer models. Moreover, the majority of parameter values are unknown and despite technological advances, these parameters are often difficult to measure experimentally. Therefore, statistical and computational techniques are needed to distinguish the good models from the unsuitable ones and to estimate unknown parameters. In this talk we present a novel algorithm for elucidating computational models for dynamical systems, which can be applied for both parameter estimation and model selection. The algorithm belongs to the class of Approximate Bayesian computation methods, which can infer posterior distributions without having to calculate likelihoods, and is based on a Sequential Monte Carlo framework. The algorithm is applied to a variety of stochastic and deterministic biological models. We employ stochastic Petri net modelling techniques to study the phage-shock-protein stress response in bacteria, and demonstrate how we can employ Petri net models for qualitative and semi-quantitative inferences in light of available steady state data. We also apply the model selection algorithm to study differential equation models of MAP kinase phosphorylation dynamics and the JAK-STAT signalling pathway.

The speaker is hosted by Guy Latouche.

**Thursday December 3, 2009, 12:30PM**

**Titre: Probabilistic constraints in combinatorial optimization
Olivier Klopfenstein
(France Télécom)**

Abstract: When facing uncertainties on input data, it is natural to look for solutions with controllable feasibility. Hence, given a targeted risk probability ε>0, we aim at finding the best solution feasible with probability at least 1-ε. Such model is known as "chance-constrained programming". The first part of the presentation will be devoted to probabilistic constraints on 0-1 linear programs. Some theoretical analysis of the model will be presented, and a solution process will be described, together with numerical tests.

The second part will focus on an application: the routing of stochastic flows in a network. Traffic stochasticity is a central feature of telecommunication networks. We look for the "best" routing, with the goal to ensure that network link capacities are satisfied with controlled probability. Hence, we are led to chance-constrained programs. A specific interest will be devoted to single-path routing, because of its practical importance in network management.

The speaker is hosted by Martine Labbé.

**Thursday November 26, 2009, 12:30PM**

**Titre: Exponential-time approximation of hardest NP-complete problems
Łukasz Kowalik
(University of Warsaw)**

Abstract: We study optimization problems that are neither approximable in polynomial time (at least with a constant factor) nor fixed parameter tractable, under widely believed complexity assumptions, like Maximum Independent Set, Vertex Coloring, Set Cover, and Bandwidth. In recent years, many researchers design exact exponential-time algorithms for these and other hard problems. The goal is getting the time complexity still of order

We study two natural approaches. The first approach uses general transformations from exponential-time exact algorithms to approximations that are faster but still exponential-time. For example, we show that for any reduction rate

This is a joint work with Marek Cygan, Marcin Pilipczuk and Mateusz Wykurz.

The speaker is hosted by Marcin Kaminski.

**Friday November 13, 2009, EXCEPTIONALLY ON FRIDAY
AT 2:30PM, ROTULE NO8**

**Biomarker selection from microarray data: a transfer learning approach
Pierre Dupont
(UCL, Belgium)**

Abstract: Classification of microarray data is a challenging problem as it typically relies on a few tens of samples but several thousand dimensions (genes). Feature selection techniques are commonly used in this context, both to increase the interpretability of the predictive model and possibly to reduce its cost. Feature selection aims at finding a small subset of the original covariates that best predicts the outcome. In the case of clinical studies, the selected genes are considered to be biomarkers forming a signature of a patient status or his expected response to a treatment. A good signature is also ideally stable with respect to sampling variation, under the assumption that the biological process modelled is (mostly) common across patients. We focus here on embedded methods for which a multivariate feature selection is performed jointly with the classifier estimation. We study in particular regularized (or penalized) linear models, such as extensions to linear support vector machines (SVM) or variants of the LASSO, since they offer state of the art predictive performances for high dimensional and sparse data. In this context, we describe two original contributions. Firstly, some prior knowledge may be available to bias the selection towards some genes a priori assumed to be more relevant. We present a novel optimization algorithm to make use of such a partial supervision as a soft constraint. A practical approximation of this technique reduces to standard SVM learning with iterative rescaling of the inputs. The scaling factors depend on the prior knowledge but the final selection may depart from it if necessary to optimize the classification objective. Secondly, we show how to adapt the above algorithm in a transfer learning setting: a preliminary selection is performed on one or several source dataset(s) and is subsequently used to bias the selection on a target dataset. This is particularly relevant for microarray data for which each individual dataset is typically very small but a fastly growing collection of related datasets are produced and made publicly available. Experimental results illustrate that both approaches improve the stability and classification performances of the resulting models. We conclude this talk by sketching some open issues, both from a theoretical and a practical viewpoint.

The speaker is hosted by Gianluca Bontempi.

**Thursday November 5, 2009, 12:30PM**

**Network Inference based on Information Theory Applied to Microarray Data
Patrick E. Meyer
(ULB, Machine Learning Group)**

Abstract: An important issue in computational biology is the extent to which it is possible to learn transcriptional interactions from measured expression data. The reverse engineering of transcriptional regulatory networks from expression data alone is challenging because of the combinatorial nature of the problem and of the limited amount of (noisy) samples available in expression datasets. This talk will focus on information-theoretic ap- proaches of network inference which typically rely on the estimation of mutual information and/or conditional mutual information from data in order to measure the statistical dependence between genes expressions. The adoption of mutual information in network inference can be traced back to Chow and Liu's tree algorithm. Nowadays, two main categories of information-theoretic network inference methods hold the attention of the bioinformatics community: i) methods based on pairwise mutual in- formation that infer undirected networks up to thousands of genes thanks to their low algorithmic complexity and ii) methods based on conditional mutual information that are able to infer a larger set of relationships be- tween genes but at the price of a higher algorithmic complexity. The strengths and weaknesses of these information-theoretic methods for in- ferring transcriptional networks will be detailed in this talk.

**Thursday October 29, 2009, 12:30PM**

**The Replacement Paths Problem for Planar Graphs
Christian Wulff-Nilsen
(University of Copenhagen, Denmark)**

Abstract: Communication networks are in general not static but may change due to link failures. In such cases, alternative lines of communication need to be established and it may be of interest to determine the "quality" of such lines. This motivates the replacement paths problem: given two vertices

The speaker is hosted by Stefan Langerman.

**Thursday October 22, 2009, 12:30PM**

**A New Optimal Scheduling Algorithm for Multiprocessors
Shelby Funk (U. Georgia, USA)**

Abstract: Online scheduling on multiprocessors has proven to be a particularly challenging problem. Algorithms that perform well on uniprocessors, such as Earliest Deadline First (EDF), do not perform as well on multiprocessors. Optimal online scheduling algorithms, such as Pfair and LLREF, have high scheduling overhead and incur many preemptions and migrations. This talk will introduce the NQ-fair scheduling policy, a general scheduling scheme that can be used to design online multiprocessor scheduling algorithms of periodic and sporadic tasks with unconstrained deadlines. Any algorithm adhering to the NQ-fair policy can schedule any task set on m identical processors provided the task set's total density is at most m and maximum density is at most 1. Thus, all NQ-fair algorithms are optimal for tasks with deadlines equal to periods. We then present a new NQ-fair scheduling algorithm, NQ-Wrap, which is significantly more efficient than other optimal online multiprocessor scheduling algorithms. Finally, we extend NQ-Wrap in two ways: First, we reduce the number of preemptions when periods and execution times are all integers; Then, we show how to implement NQ-Wrap on uniform multiprocessors.

The speaker is hosted by Joël Goossens.

**October 15, 2009**

**Executing Code in the Past: Efficient In-Memory Object Graph Versioning
Frédéric Pluquet (ULB)**

Abstract: Object versioning refers to how an application can have access to previous states of its objects. Implementing this mechanism is hard because it needs to be efficient in space and time, and well integrated with the programming language. We present HistOOry, an object versioning system that uses an efficient data structure to store and retrieve past states. It needs only three primitives, and existing code does not need to be modified to be versioned. It provides fine-grained control over what parts of objects are versioned and when. It stores all states, past and present, in memory. Code can be executed in the past of the system and will see the complete system at that point in time. We have implemented our model in Smalltalk and used it for three applications that need versioning: checked postconditions, stateful execution tracing and a planar point location implementation.

**June 25, 2009**

**Arc-time formulations and algorithms for Scheduling Problems
Marcus Poggi (PUC-Rio, Brazil)**

Abstract: This talk presents formulations and algorithms for single or parallel identical machine scheduling problems. While the overall algorithm can be viewed as a branch-cut-and-price over a very large extended formulation, a number of auxiliary techniques are necessary to make the column generation effective. Those techniques include a powerful fixing by reduced costs and a dual stabilization method. We tested the algorithms on instances of the classical weighted tardiness problem. All the 375 single machine instances from the OR-Library, with up to 100 jobs, are solved to optimality in reasonable times and with minimal branching, since the duality gaps are almost always reduced to zero in the root node. Many multi-machine instances with 40 and 50 jobs are also solved to optimality for the first time. The proposed algorithms and techniques are quite generic and can be used on several related scheduling problems.

**June 4, 2009**

**Dynamic Observers for the Synthesis of Opaque Systems
Hervé Marchand (IRISA, Rennes)**

Abstract: In this presentation, we address the problem of synthesizing opaque systems. A secret predicate S over the runs of a system G is opaque to an external user having partial observability over G, if s/he can never infer from the observation of a run of G that the run belongs to S. We first investigate the case of static partial observability where the set of events the user can observe is fixed a priori. In this context, we show that checking whether a system is opaque is PSPACE-complete, which implies that computing an optimal static observer ensuring opacity is also a PSPACE-complete problem. Next, we introduce dynamic partial observability where the set of events the user can observe changes over time. We show how to check that a system is opaque wrt to a dynamic observer and also address the corresponding synthesis problem: given a system G and secret states S, compute the set of dynamic observers under which S is opaque. Our main result is that the set of such observers can be finitely represented and can be computed in EXPTIME.

**May 7, 2009**

**Environment Assumptions for Synthesis
Barbara Jobstmann (EPFL)**

Abstract: In synthesis, we aim to construct a finite-state reactive system from a given omega-regular specification. Initial specifications are often unrealizable, which means that there is no system that implements the specification. A common reason for unrealizability is that assumptions on the environment of the system are incomplete. We study the problem of correcting an unrealizable specification G by computing an environment assumption A such that the new specification A -> G is realizable.

In this talk, I will give a short introduction to the synthesis problem and the underlying game theory, discuss desired properties of assumptions, and present a two-step algorithm to compute useful environment assumptions. Our algorithm operates on the game graph that is used to answer the realizability question. First, it computes a safety assumption that removes a minimal set of environment edges from the graph. Second, it computes a liveness assumption that puts fairness conditions on some of the remaining environment edges. We use probabilistic games to compute the liveness assumptions.

This is joint work with Krishnendu Chatterjee and Tom Henzinger.

**April 30, 2009 (EXCEPTIONALLY AT 3:30PM, 2NO800G (rotule))**

**The role of cooperative sensor networks in smart grids
Alfredo Vaccaro (U. Sannio, Italy)**

Abstract: A smart grid delivers electricity from suppliers to consumers using digital technology to save energy, reduce cost and increase reliability. Such a modernized electricity network is being promoted by many governments as a way of addressing energy independence or global warming issues. Modern trends in Smart Grids operation ask for an increasing pervasion of distributed sensing systems. This process is hindered by the low scalability levels characterizing the existing monitoring systems, traditionally based on client server based paradigms. This has stimulated the power systems research community to define new monitoring architectures that move away from the older centralized paradigm to system distributed in the field with an increasing pervasion of smart sensors. According to these considerations, the talk intends to give a contribution toward the definition of a fully decentralized monitoring architecture by proposing the employment of self organizing sensor networks in which the spreading of information occurs as a result of the local coupling between adjacent nodes which act as mutually coupled adaptive oscillators. According to this paradigm each node knows both the performances of the monitored site, computed by acquiring local information, and the global performances of the monitored grid section, computed by local exchanges of information with its neighbors nodes. Thanks to this feature each node could automatically detect local anomalies. Moreover system operator can assess the system performance for each grid section by inquiring any node of the corresponding sensors network without the need of a central fusion center acquiring and processing all the node acquisitions. This makes the overall monitoring architecture highly scalable, self-organizing and distributed.

**January 15, 2009**

**The Disconnected Cut problem
Daniel Paulusma (Durham U., UK)**

Abstract: Let G=(V,E) be a finite connected undirected graph without multiple edges or self-loops. Let G[U] denote the subgraph induced by a subset U of V. Then U is a cut if G[V\U] is disconnected. We call a cut U a disconnected cut if G[U] is disconnected as well. This leads to the problem:

DISCONNECTED CUT

Instance: A graph G

Question: Does G have a disconnected cut?

As far as we know the computational complexity of this problem is open. We pinpoint relationships with other graph-theoretic concepts such as graph homomorphisms and graph contractions, discuss partial results and mention other open (sub)problems.

**December 18, 2008**

**A Betweenness Approach for Solving the Linear Arrangement Problem
Marcus Oswald (Heidelberg, Germany)**

Abstract: In the Linear Arrangement Problem we are looking for a permutation of objects in such a way that a linear function on the differences of positions of the objects is minimized. We present a new approach based on betweeness variables and give computational results showing that the lower bounds that are known in literature so far can be improved significantly.

**December 16, 2008 (EXCEPTIONALLY ON TUESDAY AT 2PM)**

**Exploratory Analysis of Functional Data via Clustering and Segmentation
Fabrice Rossi (Telecom ParisTech)**

Abstract: Functional data arise in numerous practical contexts. Spectrometry is a well known example in which each observation is described by a spectrum: a function that maps wavelengths to absorbance values. A more general example is given by time series data: each object is described by the evolution through time of several quantities, represented by a function that map time to the associated values. Applications of this paradigm range from online monitoring to joint time series prediction.

This talk focuses on the exploratory analysis of a set of functions (or time series). The main idea is to provide the analyst with a summary of the set with a manageable complexity. We propose to combine two well known methods: clustering and segmentation. The first one groups similar functions while the second one approximate prototype functions by more manageable versions, in general piecewise constant functions. We show how the segmentation part can be embedded into prototype based algorithm optimally with respect to two objectives. Firstly, given a homogeneous (sub)set of functions, we follow Bellman's lead and show how several types of optimal representations can be given in term of a user chosen minimal distortion (such as the mean squared error). Secondly, given a partition of a function set, we show how the representation quality of the clusters can be balanced automatically in an optimal way, again via dynamic programming. The proposed algorithm is illustrated on a real world example.

**December 1st, 2008**

**Schémas de signature basés sur les codes correcteurs d'erreurs
Pierre-Louis Cayrel (Université Paris VIII)**

Abstract: Je présenterai dans un premier temps la cryptographie basée sur les codes correcteurs d'erreurs (schéma de McEliece, Niederreiter) puis je détaillerai le schéma d'identification et de signature de Stern présenté à CRYPTO en 1993 et le schéma de signature de Courtois-Finiasz-Sendrier (ASIACRYPT 2001). Je présenterai ensuite 3 travaux récents sur ce sujet :

- une construction sécurisée du schéma de Stern contre les attaques par canaux cachés (DPA)

- un schéma de signature basé sur l'identité, prouvé sûr mêlant le schéma de Stern et le schéma de signature de Courtois-Finiasz-Sendrier.

- un schéma de signature de cercle (de taille n) à seuil (t-out-of-n threshold ring signature scheme) construit comme une généralisation du schéma de Stern et qui donne les meilleurs résultats connus pour ce type de signature.

Cet exposé se base sur une série de trois travaux réalisés avec Philippe Gaborit et Emmanuel Prouff (pour le premier), Philippe Gaborit, David Galindo et Marc Girault (pour le deuxième) et Carlos Aguilar Melchor et Philippe Gaborit (pour le troisième).

**November 27, 2008**

**The communication complexity of non-signaling distributions
Jérémie Roland (NEC, Princeton)**

Abstract: We study a model of communication complexity that encompasses many well-studied problems, including classical and quantum communication complexity, the complexity of simulating distributions arising from bipartite measurements of shared quantum states, and XOR games. In this model, Alice gets an input x, Bob gets an input y, and their goal is to each produce an output a, b distributed according to some pre-specified joint distribution p(a, b|x, y). Our results apply to any non-signaling distribution, that is, those where Alice's marginal distribution does not depend on Bob's input, and vice versa. Our techniques apply to any communication problem that can be reduced to a non-signaling distribution, including non- Boolean functions, most relations, partial (promise) problems, and multipartite settings.

The proofs are surprisingly easy and give very intuitive interpretations of the recent lower bounds of Linial and Shraibman, which is shown to be a special case of our method, for Boolean functions. Our lower bounds can be expressed as linear programs (or SDPs for quantum communication), and the dual formulations have a striking interpretation, since they coincide with maximum violations of Bell and Tsirelson inequalities. The dual expressions are shown to be closely related to the winning probability of XOR games.

Finally, we give an exponential upper bound on quantum and classical communication complexity in the simultaneous messages model, for any non-signaling distribution. One consequence of this is a simple proof that any quantum distribution can be approximated with a constant number of bits of communication.

**October 2, 2008**

**Evaluating monotone Boolean functions and game trees in the priced information model
Martin Milanič (Universität Bielefeld, Germany)**

Abstract: We study the fundamental problem of evaluating a function by sequentially selecting a subset of variables whose values uniquely identify the function's value. This basic problem arises in several domains of computer science, e.g., automatic diagnosis, applied game theory, database query optimization, to mention just a few. We address the variant of the function evaluation problem, introduced by Charikar et al. (2002), where different variables can incur different reading costs and competitive analysis is employed to measure the performance of an evaluation algorithm. Based on a linear programming approach, Cicalese and Laber (2008) developed a framework for the design of algorithms for evaluating functions. We extend this framework to the case where the cost of querying a variable can depend on the variable's value. In this model, we determine the tight extremal competitive ratio for monotone Boolean functions. We also obtain the tight extremal competitive ratio for game trees. For game trees, as well as for certain subclasses of monotone Boolean functions, optimal competitiveness can be achieved by polynomial (or pseudo-polynomial) time algorithms.

The talk is based on joint work with Ferdinando Cicalese.

**September 25, 2008**

**Observe, track, and localize : Matrix problems for autonomous agents detection
Raphaël Jungers (ULB / UCL)**

Abstract: Who has never been in this situation? You're at work, trying to progress in your Ph.D. thesis, and you absolutely have to find your advisor for some technical problem that you do not understand at all. But here is the problem: our advisors are very busy persons, and it is extremely difficult to find them whenever you need them.

In this talk, we will see how graph theory and linear algebra could help you to finish your thesis sooner. We provide efficient ways to localize an agent on a network. We present several concepts such as trackable networks, observable networks, local automata, and we relate them. We present efficient algorithms and/or complexity results for problems arising in practical applications. We put this in relation with some celebrated longstanding open questions such as Czerny's conjecture, and the finiteness conjecture.

This is Joint work with Vincent Blondel (UcL) and Vladimir Protasov (Moscow State University).

**September 18, 2008**

**Parikh-equivalent bounded under-approximations
Pierre Ganty (UCLA)**

Abstract: Many problems in the verification of concurrent software systems reduce to checking the non-emptiness of the intersection of two context-free languages, an undecidable problem. We propose a decidable under-approximation, and a semi-algorithm based on the under-approximation, for this problem through bounded languages, which are context-free subsets of a regular language of the form w_1*w_2*... w_k* for some w_1,...,w_k in Sigma*. Bounded languages have nice structural properties, in particular the non-emptiness of the intersection of a bounded language and a context free language is decidable.

Our main theoretical result is a constructive proof of the following result: for any context free language L, there is a bounded language L' included in L which has the same Parikh image as L. Along the way, we show an iterative construction that associates with each context free language a family of linear languages and linear substitutions that preserve the Parikh image of the context free language. We show two applications of this result: to under-approximate the reachable state space of multi-threaded procedural programs, and to under-approximate the reachable state space of counter automata with context-free constraints.

**September 12, 2008**

**Comparison of string distances for complete genome phylogeny
Alain Guénoche (Institut de Mathématiques de Luminy, CNRS) **

Abstract: We compare three string distances between complete genomes according to their ability to recover correct phylogenies. They are based on common words between the raw genomic sequences and do not require preliminary processing steps such as gene matching or sequence alignment.

The first one is a new distance; it is based on Maximum Significant Matches (Guénoche, Guyon 2007). The second one is the k-word distance computed from the frequencies of all the words of length k (Ji Qi, 2004). The third one, the ACS distance, is based on the average length of maximum common substrings (Ulitsky 2006).

A simulation process of evolution shows that the MSM distance outperforms the KW and the ACS distances which also provides accurate results to study intra-phylum relationships.

**July 17, 2008**

**Distributed Indexing and Querying in Sensor Networks using Statistical Models
Arnab Bhattacharya (IIT Kanpur, India)**

Abstract: As sensors become more inexpensive and are more easily deployed, individual measurements will pave the way to high level semantically rich events, directly mined from the raw and noisy sensor readings. Techniques to summarize, index and query the semantic events will then become an essential part of sensor network applications. The transformation of readings to semantics may take place in a central node; however, that entails huge communication costs. In this talk, I will explore an alternative path: first, transforming the readings into symbolic states locally at each sensor, and then performing an in-network indexing and aggregation of the resulting semantic models. I will use two statistical models to capture the behavior at each sensor: Markov Chains and Hidden Markov Models. I will then describe two algorithms to aggregate individual models into a composite model. Finally, I will show how these composite models can be organised into a distributed index structure to answer semantic queries on the network with low communication overheads.

**June 19, 2008**

**Model checking memoryful logics over one-counter automata
Arnaud Sangnier (ENS Cachan)**

Abstract: We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter automata (mainly deterministic vs. nondeterministic) and several syntactic fragments (restriction on the number of registers and on the use of propositional variables for control locations). The logic has the ability to store a counter value and to test it later against the current counter value. We show that model checking LTL with registers over deterministic one-counter automata is PSPACE-complete with infinite accepting runs. By constrast, we prove that model checking LTL with registers over nondeterministic one-counter automata is undecidable in the infinitary and finitary cases even if only one register is used and with no propositional variable. This makes a difference with the facts that several verification problems for one-counter automata are known to be decidable with relatively low complexity, and that finitary satisfiability for LTL with a unique register is decidable. Finally, we explain how these results can be adapted to similar problems for its sister logic, first-order logic with data equality test.

This is a joint work with Stéphane Demri and with Ranko Lazic (University of Warwick).

**June 18, 2008**

**Chance Constrained Network Design problem
Fausto Pascali (Università di Pisa)**

Abstract: Given a communication network, to find a minimum cost capacity allocation that supports a set of non simultaneously demand matrices is the so called Robust Network Design problem. Literature results highlight which kind of uncertainty sets lead to tractable robust optimization problems, but it is not clear which sets better describe the real traffic fluctuations. When a probability distribution on traffic matrices is given, it is possible to estimate the probability that a future traffic matrix effectively belong to a chosen uncertainty set, but the task, given a budget, of maximizing the probability that a capacity network allocation supports a future traffic demand turn out to be, in general, a difficult non convex optimization problem belonging to the class of the chance constrained problems. We use recent literature result in order to build uncertainty sets that "well" approximate chance constraints while the computational tractability of the model is preserved and a predefined level of network reliability is achieved.

**June 12, 2008**

**Treillis abstraits et alphabets infinis
Tristan Le Gall (IRISA, Rennes, France)**

Abstract: Cet exposé propose de voir les langages réguliers avec un alphabet fini ou infini comme un treillis. Ce treillis est utilisé, dans le cadre de l'interprétation abstraite, pour vérifier des systèmes avec des files ou des piles non bornées.

Si les langages réguliers avec un alphabet fini sont bien connus, des problèmes de représentation et de manipulations surgissent quand l'alphabet est infini. J'introduirai la notion d'automates de treillis, qui sont semblables aux automates finis mais dont les transitions sont étiquetées par des éléments d'un treillis atomique infini.

Je détaillerai les opérations de déterminisation et de minimisation sur ce type d'automate et j'expliquerai comment on peut définir un opérateur d'élargissement. Je présenterai aussi quelques résultats expérimentaux tant pour l'analyse des systèmes FIFO que pour l'analyse interprocédurale.

**May 8, 2008**

**Search via quantum walk
Jérémie Roland (ULB / UC Berkeley)**

Abstract: By suppressing details, any search problem may be cast as the problem of finding a "marked" element from a set X with n elements. Let M be the set of marked elements. One approach to finding from M, if it is not empty, is to repeatedly sample from X uniformly until a marked element is picked. A more cost-effective approach re-uses resources expended in generating the first sample (time, random bits, black-box queries, etc.) by simulating the steps of a Markov chain with state space X to generate the next sample. This approach often takes advantage of some structure present in the ground set X and the Markov chain, and leads to a more efficient algorithm. In this talk, we study quantum analogues of this randomized scheme. In particular, we propose a new method for designing quantum search algorithms for finding a "marked" element in the state space of a classical Markov chain.

**March 20, 2008**

**Towards Interactive Belief, Knowledge, and Provability: Possible Application to Zero-Knowledge Proofs
Simon Kramer (LIX, Paris)**

Abstract: We argue that modal operators of interactive belief, knowledge, and provability are definable as natural generalisations of their non-interactive counterparts, and that zero-knowledge proofs (from cryptography) have a natural (modal) formulation in terms of interactive individual knowledge, non-interactive propositional knowledge and interactive provability.

Our work is motivated by van Benthem's investigation into rational agency and dialogue and our attempt to redefine modern cryptography in terms of modal logic.

**March 13, 2008**

**Is Lazy Abstraction a Decision Procedure for Broadcast Protocols?
Rayna Dimitrova (Saarland University, Germany)**

Abstract: Lazy abstraction is an interesting verification method based on the scheme coined counterexample-guided abstraction refinement (CEGAR). It builds up an abstract reachability tree by locally refining abstractions in order to eliminate spurious counterexamples in smaller and smaller subtrees. The method has demonstrated its practical usefulness for example for verification of systems code. It is still open whether its practical performance is matched by its theoretical qualities, i.e., whether the method terminates for already known decidable verification problems. In this talk, we answer the question positively for broadcast protocols and other infinite-state models in the class of so-called well-structured systems. This extends an existing result on systems with a finite bisimulation quotient.

**March 6, 2008**

**Multi-triangulations as complexes of star polygons**

**Vincent Pilaud (ENS, Paris)**

Abstract: Let n and k be two integers with n bigger than 2k+1. A k-triangulation
of a convex n-gon is a maximal set of diagonals in it such that no k+1
of them mutually cross. There are several properties that generalize
nicely what is known for triangulations. Among them:

1) all the k-triangulations of a convex n-gon have the same number of
edges, namely k(2n-2k-1).

2) every edge of a k-triangulation (of length at least k+1) can be
flipped in a unique way. The graph of flips is regular and connected.

3) the set of k-triangulations of a convex n-gon is enumerated by the
same Catalan determinant counting families of k mutually non-crossing
Dyck paths.

Although these results have already been proved before (with recursive
arguments), we show how to obtain (1) and (2) directly using the new
concept of stars in multi-triangulations, which generalize triangles in
triangulations. This tool may hopefully make easier the analysis of
further topics and open questions that we will briefly discuss.

(Joint work with Francisco Santos, Universidad de Cantabria, Santander, Espagne)

**February 19, 2008 (TUESDAY)**

**Stackelberg Network Pricing Games**

**Martin Hoefer (RWTH Aachen)**

Abstract: We study a multi-player one-round game in which a leader can set prices for a subset of m pricable edges in a graph. The other edges have a fixed cost. Based on the leader's decision one or more followers optimize a polynomial-time solvable combinatorial minimization problem and choose a minimum cost solution satisfying their requirements. The leader receives as revenue the total amount of prices paid by the followers for pricable edges in their solutions. Our first result is a tight analysis of a single-price algorithm for revenue maximization with a single follower, which provides a (1+eps)log m approximation for any constant eps > 0. This can be extended to a (1+eps)(log k + log m)-approximation for k followers. For the latter we show almost matching hardness results. Our second result is that in case of a single follower in Stackelberg bipartite vertex cover, there is an efficient algorithm to compute optimum pricies using LP-duality techniques. It can be extended to provide constant-factor approximations for any constant number of followers.

**February 14, 2008**

**Accelerated Data-flow Analysis**

**Grégoire Sutre (LABRI, France)**

Abstract: Acceleration in symbolic verification consists in computing the exact effect of some control-flow loops in order to speed up the iterative fix-point computation of reachable states. Even if no termination guarantee is provided in theory, successful results were obtained in practice by different tools implementing this framework. In this talk, we show how to extend the acceleration framework to data-flow analysis. Compared to a classical widening/narrowing-based abstract interpretation, the loss of precision is controlled here by the choice of the abstract domain and does not depend on the way the abstract value is computed. We illustrate our approach on convex polyhedral data-flow analysis, and we provide a cubic-time acceleration-based algorithm for solving interval constraints with full multiplication.

Joint work with Jérôme Leroux.

**December 20, 2007**

**Adaptive Convex Hull of Convex Hulls**

**Jeremy Barbay (U. Waterloo, Canada)**

Abstract: Computing the convex hull of a set of points has applications in
many domains, and in particular in computer vision. It can be
computed efficiently, in time proportional to the size of the
produced result. We consider the particular case where the set of
points is composed of simpler objects from a library, for which the
convex hull has been precomputed. We show that for many instances
an adaptive algorithm is a better choice.

**December 13, 2007**

**Robust capacity assignment in telecommunications networks under demand uncertainty**

**Adam Ouorou (Orange Labs)**

Abstract: In telecommunications network design, one of the key parameter is the set of requirements which in the past, were demands based on historical data and/or demographic predictions. Because of new technologies
development and customers movement due to competitiveness, the requirements present considerable uncertainty. We will discuss some models and methods for the capacity assignment problem taking into account this uncertainty.

**December 6, 2007**

**Randomized shortest-path problems**

**Marco Saerens (IAG - UCL)**

Abstract: This work addresses the problem of designing the transition probabilities of a finite Markov chain (the policy) in order to minimize the expected cost for reaching a destination node from a source node while maintaining a fixed level of entropy spread in the network (the exploration). It is motivated by the following scenario. Suppose you have to route agents through a network in some optimal way; for instance by minimizing the total travel cost. Nothing particular up to now -- you could use a standard shortest-path algorithm. Suppose, however, that you want to avoid pure deterministic routing policies in order, for instance, to allow some continual exploration of the network, to avoid congestion, or to avoid complete predictability of your routing strategy. In other words, you want to introduce some randomness/unpredictability in the routing policy, i.e., the routing policy is randomized. This problem, which will be called the randomized shortest-path problem (RSP), is investigated. The global level of randomness of the routing policy will be quantified by the expected Shannon entropy spread into the network, and is provided a priori by the designer. Then, necessary conditions allowing to compute the optimal randomized policy - minimizing the expected routing cost - are derived. Iterating these necessary conditions, reminiscent of Bellman's value iteration equations, allows to compute the optimal policy, that is, the set of transition probabilities in each node, but no convergence proof is provided. Interestingly and surprisingly enough, the proposed model, while formulated in a totally different framework, is equivalent to Akamatsu's model (Akamatsu 1996), appearing in transportation science, for a special choice of the entropy constraint. We therefore revisit Akamatsu's model by recasting it into a statistical-physics formalism allowing to easily derive all the quantities of interest in an elegant, unified, way. For instance, it is shown that the optimal policy can be obtained by solving a simple linear system of equations. Finally, simulation results obtained on simple, illustrative, examples show that the model behaves as expected.

**November 29, 2007**

**Probabilistic and topological semantics for timed automata**

**Thomas Brihaye (UMH)**

Abstract: Like most models used in model-checking, timed automata are an ideal
mathematical model to represent systems with strong timing requirements. In
such mathematical models, properties can be violated, due to unlikely events.
Following ideas of Varacca and Völzer in their LICS'06 paper, we aim at
defining a notion of ``fair'' correctness for timed systems. For this
purpose, we introduce a probabilistic semantics for timed automata, which
ignores unlikely events, and naturally raises a notion of almost-sure
satisfaction of properties in timed systems. We prove that the almost-sure
satisfaction has a corresponding topological interpretation in terms of
largeness of the set of paths satisfying the property. Moreover, we show
PSPACE-Completeness for the LTL model-checking problem over finite
computations. We will also discuss the more complicate case of infinite
computations.

Joint work with Christel Baier, Nathalie Bertrand, Patricia Bouyer and Marcus
Größer.

**November 22, 2007**

**Modular Development of Hybrid Systems for Verification in Coq**

**Milad Niqui (Nijmegen)**

Abstract: In this talk I will present an account of a modular
formalisation of hybrid automata based on predicate abstraction. We
will give algorithms for building trajectory trees that can be used in
reachability analysis and show a formalisation of the theory of hybrid
automata and its extensions using module types and functors in Coq.
Our approach paves the way for the use of Coq theorem prover -- a
proof assistant based on constructive type theory-- in formalisation
and verification of hybrid systems.

Joint work with Olga Tveretina

**November 8, 2007**

**Hub location problems in public transport planning: New mathematical model and solution approaches**

**Shahin Gelareh (ITWM - Kaiserslautern)**

Abstract: In this talk, we will propose a new mixed integer programming model for
hub location problems arising in public transport. Due to the NP-hardness
of the problem, even small size instances of cannot be solved to
optimality in a reasonable amount of time.
Therefore, some decomposition methods may be used to solve larger
instances of the problem. We will present a Bender's decomposition approach
and a simple neighborhood search approach to solve the problems for
single period and multi-period planning. Computational results on the CAB
and AP instances confirm the superiority of our model to the available
models in literature. In addition, it shows that our Bender's approach always
dominates the available standard solvers.

**October 18, 2007**

**Farey Sequences and Counting Primitive Lattice Points**

**Mihai Patrascu (MIT, USA)**

Abstract: A primitive lattice point is a point (x,y) with x,y integers and
gcd(x,y)=1. "Counting" primitive lattice points inside various planar
shapes has been an active area of mathematics in the past decades. But
by virtue of seeking an elementary formula, the mathematical
definition of "counting" is "approximating asymptotically". We now
present the first results on the informatics view of this problem:
give an efficient algorithm to count primitive lattice points exactly.

The problem is related to another entertaining mathematical problem
that has crossed the border into informatics. The Farey sequence of
order N is the sorted sequence of irreducible fractions a/b, with
a<=b<=N. There are well-known algorithms for generating this sequence
in its entirety. We now describe algorithms for finding just one value
of the sequence (say the K-th value) significantly faster.

Joint work with Jakub Pawlewicz.

**October 11, 2007**

**Wireless Multi-hop Networks: Opportunities and Challenges**

**Tinku Rasheed (Create-Net, Trento, Italy)**

Abstract: Wireless multi-hop networking is gaining practical importance with the continuous proliferation of wireless devices and pervasive communication technologies. In such a network, mobile devices operates not only as host but also as routers, forwarding packets for other mobile nodes in the network that may not be within direct wireless transmission range of each other in a multi-hop fashion. Multi-hopping has important implications on several wireless networking domains, including wireless sensor networks, wireless mesh networks, personal area networks etc. Routing of information is an important challenge in multi-hop wireless networks and has grappled with the twin requirements of connectivity and scalability. In this talk, we discuss the issues and challenges related to scalable routing in wireless networks and introduce an adaptive and scalable routing architecture for multi-hop networking applications. We shall also explore the impact of the scalable routing framework on different wireless network application scenarios.

**October 1, 2007 (ON MONDAY)**

**Colorful colorings of graphs**

**Mario Valencia-Pabon (LIPN, Paris, France)**

Abstract: A proper k-coloring of a simple graph G=(V,E) is a partition
P = {V_1,...,V_k} of the vertex set V such that each V_i
(called a color class) is an independent set of G. A
vertex v is called colorful if it is adjacent to at least one vertex in
each color class V_j, with j not equal to i. A color class V_i is called
colorful if it contains at least one colorful vertex, and a
coloring P is called colorful if every color class is
colorful. The maximum order of a colorful coloring of a graph G is
called the b-chromatic number and such a parameter was
introduced by Irving and Manlove (1999). In this talk, I will survey
the most recent results concerning maximum colorful colorings in
graphs. In particular, I will show that the problem of computing the
b-chromatic number of a graph does not admit a Polynomial-Time
Approximation Scheme.

**September 13, 2007**

**On discretization: an application to location models**

**Luis Gouveia (U. Lisbon, Portugal)**

Abstract: Consider an ILP model with two sets of variables for each "object"
(for instance, an "arc" or "node" if the problem is associated to
network design) of the problem: one binary variable Ui indicating whether
the "object" i is included in the solution and an integer variable indicating
a quantity associated to the object i (flow, for instance). We discuss
alternative models that are obtained from the previous one, by replacing these two
variables by one set of binary variables Ziq indicating whether object i is in the
solution with value "q". We discuss equivalence results between the two classes of models and
focus our talk on location models with modular link costs.

**May 16, 2007 (ON WEDNESDAY - room 2NO800G ("rotule"))**

**On Geometric Spanners**

**Prosenjit bose (Carleton, Canada)**

Abstract: We define a graph whose vertices are points in the plane and edges are segments
weighted by their length to be a geometric graph. A geometric graph G is a
t-spanner (for a constant t>=1) when the weight of the shortest path in G
between every pair of points a,b does not exceed t|ab| where |ab| is the
Euclidean distance between a and b. The smallest constant t having this
property is the spanning ratio or stretch factor of the graph. The goal in
this area is to construct spanners with small stretch factor that possess
additional properties such as linear number of edges, bounded degree, and so
on. In this talk, we will review some of the standard techniques that are used
to construct spanners, highlight some of the difficulties involved in the different
construction techniques and then outline some of our recent results.

**May 14, 2007 (EXCEPTIONALLY ON MONDAY - room 2NO7.08)**

**Issues and Solutions for Stream Data Processing and Management**

**Sharma Chakravarthy (University of Texas at Arlington) **

Abstract: Stream data processing poses many challenges. Two important characteristics of stream data processing - bursty arrival rates and the need for near real-time performance requirement - challenge the allocation of limited resources in the system. Operator/Query modeling, scheduling, and load shedding are major issues that differ from traditional database managements systems (DBMS).

In this presentation, we discuss the above issues and solutions. We elaborate on novel scheduling strategies to minimize tuple latency as well as total memory requirement. We first introduce a path capacity strategy (PCS) with the goal of minimizing tuple latency. We then compare the PCS and the Chain strategy to identify their limitations and propose additional scheduling strategies that improve upon them. Specifically, we introduce a segment strategy (SS) with the goal of minimizing the memory requirement, and its simplified version. In addition, we introduce a hybrid strategy, termed the threshold strategy (TS), to address the combined optimization of both tuple latency and memory requirement. Finally, we present the results of a wide range of experiments conducted to evaluate the efficiency and the effectiveness of the proposed scheduling strategies.

Currently, we are synergistically integrating stream and complex event processing. We will conclude the talk with some results from this effort.

This is joint work with my students: D. Jiang, R. Adaikkalavan, V. Garg.

**May 3, 2007**

**Scheduling messages with offsets in automotive networks - a major performance boost**

**Nicolas Navet and
Mathieu Grenier (LORIA, France)**

Abstract: With the increasing use of electronics, best using the bandwidth is of primary importance in automotive networks. An element of solution is to schedule messages with offsets, which leads to a desynchronization of the streams of messages that is very beneficial in terms of worst-case response times. Two problems, difficult from an algorithmic point of view, are to be solved: choosing the offsets and computing the worst-case response times. The talk will discuss solutions in the case of Controller Area Network, which is by far the most widely used automotive networks. Experiments demonstrate that offsets actually provide a major performance boost in terms of worst-case response time and may lengthen the lifespan of CAN, despite the availability of FlexRay.

**April 24, 2007 (EXCEPTIONALLY ON TUESDAY 14:30 - FORUM F)**

**Conditional Independence for Prediction**

**François Fleuret (EPFL) **

Abstract: In this talk I will present the simple and powerful idea of using
conditional independence for prediction.

Modeling high-dimensional signals explicitly or through learning is
often impossible due to a lack of either training data or
computational power. However, a simple assumption of conditional
independence of the signal components given the true state of interest
or other hidden state variables often leads to a tractable form that
can be handled with adequate algorithmic tricks.

I will first introduce this idea on a toy example, and then illustrate
it with three different problems: face detection with a coarse-to-fine
representation, multi-camera tracking with a probabilistic occupancy
map, and learning from one sample with transfer learning.

In all these problems, I will also show the importance of algorithmic
efficiency and how a tight integration between statistics and
algorithmic design is the key to efficient and usable schemes.

**April 19, 2007**

**A Symbolic Decision Procedure for Robust Safety of Timed systems**

**Mani Swaminathan (Uni. Oldenburg, Germany) **

Abstract: We present a symbolic algorithm for deciding safety (reachability) of timed systems modelled as Timed Automata (TA), under the notion of robustness w.r.t infinitesimal clock-drift. The algorithm uses a "neighbourhood" operator on zones that is efficient to compute. In contrast to other approaches for robustly deciding reachability of TA, which are either region based (Puri, 2000), (DeWulf, Doyen, Markey, and Raskin, 2004), or involve a combination of forward and backward analyses when zone-based (Daws and Kordy, 2006), ours is a zone-based fully forward algorithm that is guaranteed to terminate, and requires no special treatment of cycles in TA.

**March 30, 2007 (EXCEPTIONALLY ON FRIDAY - room 2NO6.07)**

**Computational Intelligence in the Chemical Industry**

**Elsa Jordaan (Core R&D, Engineering & Process Sciences, Dow Benelux B.V.)**

Abstract: Computation Intelligence has revolutionized the way that engineers in the process industry solve highly complex problems. In the past, modeling and optimizing of chemical processes and materials characteristics were done by developing a fundamental model or a statistical model. Fundamental models often required years of research. Furthermore, the calculations of these models were often too time-consuming to be used for online optimization and control. Statistical models, again, required the availability of good data that could be linearised. Many industrial data sets turned out to be too noisy and high-dimensional to be solved with statistical techniques.

The introduction of Neural Networks (NN) as a new tool to quickly model highly nonlinear processes marked a clear turning point in the chemical industry. Since then, computational intelligence methods, like NN, Support Vector Machines (SVM) and Genetic Programming (GP), have been applied to a wide variety of problems in the process industry. These methods have not only become essential in the set of tools available to solve industrial problems, but also generated millions of dollars in profit due to improved process operability.

The list successful applications at the Dow Chemical Company include:

- A NN-application to predict NOx-emissions.

- Outlier detection using SVM.

- A GP-model to predict the biomass concentration in a batch reactor.

- Using GP to help developing new rheological insights.

- Particle Swarm Optimization (PSO) for optimizing properties of polymers.

**March 27, 2007 (EXCEPTIONALLY ON TUESDAY 12:30 in room 2NO7.08)**

**Compact representations of Geometric Data Structures**

**Luca Castelli Aleardi (Polytechnique, Paris)**

Abstract: We consider the problem of designing compact and succint representations
for geometric data structures. As opposed to raw compression issues,
the focus is here on designing data structures that preserve the possibility
of answering local incidence queries in constant time, while using little as
memory resources as possible. One of the main contribution of this work
is to present a general algorithmic framework for designing compact representations
of structures as planar graphs and 3D meshes. As application we
propose some solutions for compactly representing the connectivity (combinatorial
information) of some classes of local planar graphs: in
particular we design the first optimal succinct representations for planar
triangulations and 3-connected planar graphs.

Key-Words : graph encoding, succinct and compact representations, tri-
angulations, geometric data structure, planar graphs

**March 22, 2007**

**Curves in the sand: algorithmic drawing**

**Perouz Taslakian (Mc Gill, Canada)**

Abstract: Sand drawings form a part of many cultural artistic traditions. Depending on the part of the world in which they occur, such drawings have different names such as sona, kolam, and Malekula drawings. Gaussian graphs are mathematical objects studied in the disciplines of graph theory and topology. We uncover a bridge between sand drawings and Gaussian graphs, leading to a variety of new mathematical problems related to sand drawings. In particular, we analyze sand drawings from combinatorial and geometric points of view, and describe algorithms that generate sona drawings under a variety of different models and constraints.

**March 21, 2007 (EXCEPTIONALLY ON WEDNESDAY 11:00 in room 2NO7.07)**

**The cost of punctuality**

**Joël Ouaknine (Oxford, UK)**

Abstract: In an influential paper titled "The Benefits of Relaxing Punctuality" (JACM 1996), Alur, Feder, and Henzinger introduced Metric Interval Temporal Logic (MITL) as a fragment of the real-time logic Metric Temporal Logic (MTL) in which exact or punctual timing constraints are banned. Their main result showed that model checking and satisfiability for MITL are both EXPSPACE-Complete.

Until recently, it was widely believed that admitting even the simplest punctual specifications in any linear-time temporal logic would automatically lead to undecidability. Although this was recently disproved, until now no punctual fragment of MTL was known to have even primitive recursive complexity (with certain decidable fragments having provably non-primitive recursive complexity).

In this talk, we will present a 'co-flat' subset of MTL that is capable of expressing a large class of punctual specifications and for which model checking (although not satisfiability) has no complexity cost over MITL. Our logic is moreover qualitatively different from MITL in that it can express properties that are not timed-regular. Correspondingly, our decision procedures do not involve translating formulas into finite-state automata, but rather into certain kinds of reversal-bounded Turing machines.

This is joint work with Patricia Bouyer, Nicolas Markey, and James Worrell.

**March 8, 2007**

**Modes and Cuts in Metabolic networks: Complexity and Algorithms**

**Leen Stougie (TU Eindhoven and CWI Amsterdam, Netherlands)**

Abstract: Constraint-based approaches recently brought new insight into our
understanding of metabolism. By making very simple assumptions such as
that the system is at steady-state and some reactions are
irreversible, and without requiring kinetic parameters, general
properties of the system can be derived. A central concept in this
methodology is the notion of an elementary mode (EM for short). The
computation of EMs still constitutes a limiting step in metabolic
studies and several algorithms have been proposed to address this
problem leading to increasingly faster methods.

First results regarding network consistency will be presented.
Most consistency problems can be solved in polynomial
time (are easy). Then the complexity of finding and counting elementary
modes is presented, showing in particular that finding one
elementary mode is easy but that this task becomes hard when a
specific EM i.e. an EM containing some specified reactions) is
sought. Also a number of EM related problems will be considered.

Then models and results on a closely related task is presented: the
computation of so-called minimal reaction cut sets. Also this problem
is hard. Two positive results will be presented, which both allow to avoid
computing EMs as a prior to the computation of reaction cuts. The first
one is a polynomial time approximation algorithm for finding a minimum
reaction cut set. The second one is a test for verifying if a set of reactions
constitutes a reaction cut; this test could be readily included in existing
algorithms to improve their performance. Finally, we discuss the complexity
of other cut-related problems.

Joint work with Vincent Lacroix, Alberto Marchetti-Spaccamela,
Marie-France Sagot and Flavio Chierichetti.

**March 1, 2007**

**Expressivité de la logique de séparation**

**Etienne Lozes (LSV, ENS Cachan)**

Abstract: La logique de la séparation a été introduite par Reynolds et O'Hearn pour faciliter l'annotation de programmes à la Hoare-Floyd dans un langage impératif manipulant des pointeurs. Pour cela, on étend la logique classique avec une conjonction séparante et une implication contextuelle, équivalents (lointains) du tenseur de et l'implication linéaire. Après avoir introduit cette logique, je donnerai quelques exemples illustrant son intérêt pour la preuve de programmes, en particulier les calculs de précondition et post-condition associés. Je présenterai plusieurs résultats d'expressivité de divers fragments, de décidabilité et complexité des problèmes de validité et model-checking. Je parlerai enfin des extensions au cadre de la programmation à mémoire partagée.

**February 22, 2007**

**On frequency assignment to cellular antennas, RFID protocols and geometry**

**Shakhar Smorodinsky (Courant Institute for Mathematical Sciences, NY, USA)**

Abstract: The problem of frequency assignment to cellular antennas was
traditionally treated as a graph coloring problem, where the vertices
of the graph are the given set of antennas and the edges are those
pairs of antennas that overlap in their reception range. Thus, if
we color the vertices of the graph such that no two vertices that
are connected by an edge have the same color, we guarantee that
there will be no conflicting antennas. However, this model is
too restrictive. In this model, if a client lies within the
reception range of say, k antennas, then every pair of these
antennas are conflicting and therefore they must be assigned k
distinct colors (i.e., frequencies). However, for that purpose, if one of these
antennas is assigned a color (say 1) that no other antenna is
assigned (even if all other antennas are assigned the same color,
say 2) then we use a total of two colors and this client can
still be served.

We present a new model for frequency assignment where we use
much fewer frequencies such that every possible client is
still served. This model is also related to RFID protocols.
We will survey the recent developments in this area and present
challenges for both theoretical and practical future research.