Estão abertas até o dia 31 de maio de 2014 as inscrições para Mestrado e Doutorado Acadêmico no DI. Consulte a página de inscrições para conhecer os requisitos e documentos necessários, além de outras informações para candidatos.
Autor: Diego Galindo Pecin
Orientador: Marcus Vinicius Soledade Poggi de Aragão
Data: 25/04/2014 Hora: 09:00 h Sala: RDC511
For the past few decades, combinatorial optimization techniques have shown to be powerful tools for formulating, analyzing and solving problems arising from practical decision situations. In particular, the polyhedral approach has been successfully applied for many well known NP-hard problems. The equivalence between separation and optimization has been behind a big development of this method. The so-called « Branch and Cut » method, which is inspired from this equivalence, is now widely used for obtaining optimal and near-optimal solutions for hard combinatorial optimization problems. In this talk we present these methods, and discuss some applications to survivable network design models.
Short bio
A. Ridha Mahjoub is Professeur Classe Exceptionnelle of Operations Research and Combinatorial Optimization at Université Paris-Dauphine, Paris, France. He is also member of the LAMSADE laboratory, CNRS. Previous positions include full professor at the University of Brest, France, from 1991 to 1998 and the University of Clermont-Ferrand, France, from 1998 to 2007. Professor Mahjoub holds an undergraduate degree in Mathematics from University of Tunis, Tunisia and a Ph.D. and a Doctorat d’Etat in Operations Research and Combinatorial Optimization from the University of Grenoble, France. His research areas include the theory and applications of polyhedral approaches for modelling, analysing and solving large NP-hard combinatorial optimization problems, mixed integer programming as well as complexity and graph theory. A part of his research has recently focused on the design of cutting plane algorithms for network design problems. Professor Mahjoub is author and co-author of several papers that have appeared in leading journals such as Mathematical Programming, Mathematics of Operations Research, SIAM Journal on Discrete Mathematics, Discrete Mathematics, Discrete Applied Mathematics and Networks. He served as co-director of the Mathematics and Computer Science Department at Université Paris-Dauphine between 2008 and 2013. Dr Mahjoub edited and co-edited books and several special issues of journals. He currently serves as Editor-in-Chief of the international journal RAIRO-Operations Research.
Autor: Eduardo Pimentel de Alvarenga
Orientador: Ruy Luiz Milidiu
Data: 14/04/2014 Hora: 17:00 h sala: RDC511
Data: quinta-feira, 10/04, às 16:00
Local: sala 511 RDC
Título: How Developers Reason about Module Cohesion?
Palestrante: Cláudio Nogueira Sant’Anna (UFBA)
Abstract:
Several cohesion metrics have been proposed to support development and maintenance activities. The most traditional ones are the structural cohesion metrics, which rely on structural information in the source code. For instance, many of these metrics quantify cohesion based how methods and attributes are related to each other within a given module. Recently, conceptual cohesion metrics have been proposed for computing cohesion based on the responsibilities a given module realizes. Besides different flavors of cohesion, there is a lack of empirical evidence about how developers actually perceive cohesion and what kind of cohesion measurement aligns with developers’ perception. In this paper we fill this gap by empirically investigating developers opinion through a web-based survey, which involved 80 participants from 9 countries with different levels of programming experience. We found that: most of the developers are familiar with cohesion; and they perceive cohesion based on class responsibilities, thus associating more with conceptual cohesion measurement. These results support the claim that conceptual cohesion seems to be more intuitive and closer to the human-oriented view of software cohesion. Moreover, the results showed that conceptual cohesion measurement captures the developers’ notion of cohesion better than traditional structural cohesion measurement.
Short bio:
Cláudio Nogueira Sant’Anna é professor adjunto do Departamento de Ciência da Computação da Universidade Federal da Bahia (UFBA). Ele obteve seu Doutorado em Informática pela Pontifícia Universidade Católica do Rio de Janeiro (2008), tendo realizado doutorado “sanduíche” na Universidade de Lancaster, Reino Unido. Seus interesses de pesquisa incluem: design de software, modularidade de software, métricas de software, arquitetura de software, engenharia de software experimental, compreensão de software e visualização de software.
Autor: Marcelle Pereira Mota
Orientador: Clarisse Sieckenius de Souza
Data: 14/04/2014 Hora: 09:30 h Local: FPLF 13º andar
Autor: Marcelo de Mello Camanho
Orientador: Bruno Feijó
Data: 11/04/2014 hora: 11:00 h sala: RDC510
Autora: Manuele dos Reis Ferreira
Orientador: Alessandro Fabrício Garcia
Data: 11/04/2014 Hora: 10:00 Local: FPLF 13º andar
Antonio L. Furtado, Professor do Departamento de Informática da PUC-Rio, é o ganhador do Peter Chen Award 2014 pelas suas contribuições para a área de modelagem conceitual de banco de dados, que cobrem um período de quase 4 décadas. O Prof. Furtado desempenhou ainda um papel fundamental na criação e desenvolvimento da área no País, projetando-a no cenário internacional. Publicou livros pioneiros em estruturas de dados e organização de bancos de dados, este último um marco importante para o ensino de computação no Brasil.
Autor: André Luiz de Castro Leal
Orientador: Julio Cesar Sampaio do Prado Leite
Data: 10/04/2014 Hora: 10:30 h Sala: FPLF 13º andar
Autora: Carolina Valadares
Orientador: Carlos José Pereira de Lucena
Data: 09/04/2014 Hora: 10:00 h sala: FPLF 13º andar
