Département d'informatique et de recherche opérationnelle
COLLOQUES du DIRO
hiver 2007
Salle 6214, Pavillon André-Aisenstadt,
Université de Montréal
Nos colloques sont normalement le jeudi à 15h30, mais exceptionnellement
certaines présentations ont lieu à des jours et salles différentes. Pour avoir
plus de détails sur chaque présentation,
appuyez sur le bouton rouge. Si vous appuyez sur le nom du
conférencier, vous obtiendrez soit sa page web personnelle, soit celle du
responsable de son invitation.
Page principale des colloques
Prochain colloque
-
Le vendredi 26 janvier 2007 : 10h30
-- Attention au jour, au local et à l'heure inhabituels: Pavillon Claire-McNicoll,
Salle Z-330,
Grande Conférence DIRO-CRM-rcm2
-
Ralph E.
Gomory: Thoughts About Integer Programming
-

- Le jeudi 8 février 2007 : 15h30
Martin Robillard,
Université de McGill
: Recherche Topologique pour l'Exploration du Logiciel (Topology-Based
Searches for Software Investigation)
-
Le jeudi 22 février 2007 : 15h30
-- Attention au local inhabituel: 5340 du CRM
-
Gregor von Bochmann,
Université d'Ottawa
: From Workflow and Use Case Scenarios to Protocols for Distributed
Applications
-
Le jeudi 1 mars 2007 : 15h30
-
Stuart M. Shieber, Harvard
University
: Resurrecting the Turing Test
-
Le jeudi 5 avril 2007 : 15h30
-- Attention au local inhabituel: 5340 du CRM
-
Jonathan
Schaeffer, University of Alberta
: Raising the Stakes

Thoughts About Integer Programming
Le vendredi 26 janvier 2007 : 10h30, Z-330 Pavillon
Claire-McNicoll
-- Attention au jour, au local et à l'heure inhabituels -- un lunch suivra
Cette grande conférence souligne le 40ème anniversaire du Département
d’informatique et de recherche opérationnelle (DIRO) et conclut le semestre
thématique en optimisation combinatoire, organisé par le Centre de recherches
mathématiques (CRM). S’associe également à l’événement le Réseau de Calcul et de
Modélisation Mathématique (rcm2), auquel sont affiliés deux centres de
réputation internationale en recherche opérationnelle, le Centre
interuniversitaire de recherche sur les réseaux d’entreprise, la logistique et
le transport (CIRRELT) et le Groupe d’études et de recherche en analyse des
décisions (GERAD). Immédiatement avant la conférence, le prix Harold Larnder
2006 de la Société canadienne de recherche opérationnelle (SCRO) sera présenté
au Dr. Gomory. Ce prix est décerné annuellement par la SCRO à une personne qui
s’est distinguée à l'échelle internationale pour ses réalisations dans le
domaine de la recherche opérationnelle.
Prière de vous inscrire

Recherche Topologique
pour l'Exploration du Logiciel
(Topology-Based Searches for Software Investigation )
Le jeudi 8 février 2007 : 15h30
Before performing a modification task, a developer usually has to investigate
the source code of a system to understand how to carry out the task. Discovering
the code relevant to a change task is costly because it is an inherently human
activity whose success depends on a large number of unpredictable factors, such
as intuition and luck. Although studies have shown that effective developers
tend to explore a program by following structural dependencies, no methodology
is available to guide their navigation through the typically hundreds of
dependency paths found in a non-trivial program. In this talk, I will describe a
technique to automatically propose and rank program elements that are
potentially interesting to a developer investigating source code. Our technique
is based on an analysis of the topology of structural dependencies in a program.
It takes as input a set of program elements of interest to a developer and
produces a fuzzy set describing other elements of potential interest. Empirical
evaluation of our technique indicates that it can help developers quickly select
program elements worthy of investigation while avoiding less interesting ones.
Plus de détails sur Martin Robillard

From Workflow and Use
Case Scenarios to Protocols for Distributed Applications
Le jeudi 22 février 2007 : 15h30
-- Attention au local inhabituel: 5340 du CRM
UML Use Case Diagrams are a first step towards the definition of system
requirements, however, they do not provide enough information for many purposes.
UML Activity Diagrams (AD) and Use Case Maps (UCM) provide such information in a
quite comprehensive manner. The first part of my talk deals with a "Core
Scenario Model" (CSM) which was developed to capture the common semantics of AD
and UCM, as well as performance-related information. The CSM can be easily
translated into Petri nets, and it is also related to the BPEL notation of Web
Services, which could be taken as an implementation environment. In the second
part of my talk, I will discuss how one can derive an application protocol from
system requirements given in the form of such notations together with a
distributed system architecture that identifies a certain number of system
components. The resulting protocol will define the behavior of all the system
components in such a manner as to ensure the given requirements. This problem is
relatively easy to solve if each choice between alternative actions in the
requirements can be performed by one of the components alone, however, it
becomes quite complex if information from several components must be considered
for doing such choices. We also discuss how the concept of (distributed)
transactions, in the sense of databases, can be integrated into the description
of requirements.
Plus de détails sur Gregor von
Bochmann

Resurrecting the
Turing Test
Le jeudi 1 mars 2007 : 15h30
In 1950, Alan Turing proposed his eponymous test of
machines — based on verbal indistinguishability from humans — which he intended
as a replacement for the question "Can machines think ?" Since then, the primary
philosophical question concerning the Turing Test has been whether or not it is
well-founded as a sufficient condition for intelligence.
In this talk, we present the background for the debate, and
apply ideas from theoretical computer science and physics in novel ways in order
to cut this Gordian knot. The talk should be accessible by the general public.
Plus de détails sur Stuart M.
Shieber

Raising the Stakes
Le jeudi 5 avril 2007 : 15h30-- Attention au local inhabituel: 5340 du CRM
Poker is a challenging problem for Artificial Intelligence
research: multiple agents (up to 10), stochastic element (cards being dealt),
imperfect information (don't know the opponent's cards), user modelling
(identifying player patterns), and risk management (betting decisions).
For over 10 years the University of Alberta Computer Poker Group has been been
working on building a high-performance poker program. This work has led us
through knowledge-based systems, simulations, game theory, and machine learning.
The prospects of a program successfully challenging the best human players in
the near future is excellent. In this talk we will motivate the research,
compare the different program designs, and discuss future directions.
Plus de détails
sur Jonathan Schaeffer