Seminários PESC 2023
Os Seminários PESC tem como objetivo trazer palestras acessíveis a um público mais amplo ministradas por pesquisadores e professores mais experientes (tanto do PESC como externos). Ao longo do ano teremos temas e foco variados podendo ser mais específicos ou mais abrangentes.
A apresentação e discussão de ideias novas e antigas de diferentes temas contribui de maneira fundamental para a formação e pesquisa desenvolvida por alunos e professores, sendo muitas vezes de interesse de um público mais amplo.
Os Seminários que são on line ou híbridos ficam gravados no Canal do PESC no Youtube que apresenta muitas outras gravações importantes sobre o que acontece no PESC.
Veja a seguir os próximos Seminários programados.
On Edge Domination of Graphs
Jayme Luiz Szwarcfiter
 |
On Edge Domination of Graphs
Jayme Luiz Szwarcfiter
Dia 17/05 (quarta-feira), 10 horas, Sala H-324B.
|
Abstract:
Denote by G, an undirected simple graph, with vertex set V , and edge set E. An edge e ∈ E dominates itself and every edge adjacent to e. A set E′ ⊆ E is an (edge) dominating set of G, if each edge of E is dominated by some edge of E' . The domination is called efficient if each edge is dominated exactly once, and is called proper if each edge of E \ E′ is dominated exactly once. In this talk, we survey and describe complexity results on these three types of edge domination. In particular, we consider the class of graphs, where each edge is contained in some triangle. We mention hardness and polynomial time cases on subclasses of this class, for edge domination problems.
Short Bio:
Jayme Luiz Szwarcfiter é Professor Emérito da UFRJ atuando no Programa de Engenharia de Sistemas e Computação da COPPE, no Instituto de Matemática e no Núcleo de Computação Eletrônica. Atualmente é Pesquisador Visitante do Instituto de Matemática e Estatística da UERJ. Atua nas áreas de Algoritmos, Teoria da Computação e Matemática Discreta. Publicou diversos livros-textos influentes nessas áreas, além da formação de dezenas de mestres e doutores. É Pesquisador 1-A do CNPq, Membro Titular da Academia Brasileira de Ciências, Grã-Cruz da Ordem Nacional do Mérito Científico, e recebeu inúmeros prêmios de destaque nacional e internacional por suas contribuições acadêmicas e científicas.
A Perfect Path from Computational Biology to Quantum Computing
Celina Miraglia Herrera de Figueiredo
 |
A Perfect Path from Computational Biology to Quantum Computing
Celina Miraglia Herrera de Figueiredo
Moderador Prof. Valmir Carneiro Barbosa Dia 14/06 (quarta-feira), 10 horas, Sala H-324B.
Transmissão ao vivo no Canal do PESC no YouTube.
|
Abstract:
I'll revisit my contributions to the P versus NP millennium problem and the computational complexity of combinatorial problems, especially those arising in Computational Biology and Quantum Computing, through 20 PhD theses, mine and of my students. I'll explain how the dichotomy NP-complete versus polynomial-time of long-standing problems together with their multivariate analysis is settled. Yet, intriguing questions remain.
Short Bio:
Celina chegou na UFRJ em 1987 quando iniciou o seu doutorado no PESC sob a orientação do professor Jayme Szwarcfiter. Ela começou em 1989 sua carreira docente como professora assistente no Instituto de Matemática e é professora titular da COPPE desde 2011. Foi eleita para a Academia Brasileira de Ciências em 2022.
Accelerating Visual Analytics Across the Memory and Storage Stack
Vijaykrishnan Narayanan
 |
Accelerating Visual Analytics Across the Memory and Storage Stack
Vijaykrishnan Narayanan
Moderador Prof. Diego Leonel Cadette Dutra Dia 26/06 (segunda-feira), 10 horas, Sala H-324B.
Transmissão ao vivo no Canal do PESC no YouTube.
|
Abstract:
Data analytics involves the discovery of patterns and com plex relations in data to assist with effective decision-making. Such analytics are applied on a variety of data forms such as video streams, financial data, social media messages, and sensor information from smart homes and personal health monitoring devices. However, data analytics is becoming exceedingly challenging as the generated volume of data is increasing exponentially. Co-design across the stack from materials to architectures will be vital to addressing cross cutting challenges posed by the enormity of data that needs to be processed. This talk will showcase such optimization targeted at visual analytic applications such as Deep Neural networks, graph analytics and query support.
First, I will present a Look-Up Table (LUT) based Processing-In-Memory (PIM) technique with the potential for running Neural Network inference tasks. The proposed LUT-based PIM methodology exploits substantial parallelism using look-up tables that preserve the bit-cell and peripherals of the existing SRAM monolithic arrays in processor caches. Next, I will present GaaS-X, a graph analytics accelerator that inherently supports sparse graph data representations using in-situ compute-enabled crossbar memory architectures. The proposed design alleviates the overheads of redundant writes, sparse to dense conversions, and redundant computations on the invalid edges that are present in other state-of-the-art crossbar-based PIM accelerators. Finally, I will present an in-SSD key-value database that uses the embedded CPU core, and DRAM memory on the SSD to support various queries with predicates and reduce the data movement between SSD and host processor significantly.
Short Bio:
Vijaykrishnan Narayanan is the Associate Dean for Innovation in Engineering and A. Robert Noll Chair Professor of Computer Science & Engineering and Electrical Engineering at the Pennsylvania State University. Vijay received his Bachelors in Computer Science & Engineering from University of Madras, India in 1993 and his Ph.D. in Computer Science & Engineering from the University of South Florida, USA, in 1998. He is a Fellow of the National Academy of Inventors, IEEE and ACM. He served as Editor-in-Chief of IEEE TCAD and ACM Journal of Emerging Technologies in Computing Systems. He currently serves as Associate Editor-in-Chief of IEEE Micro.
Conectando os Pontos - A Contribuição de Robert Metcalfe Para a Computação
Claudio Miceli de Farias
 |
Conectando os Pontos - A Contribuição de Robert Metcalfe Para a Computação
Claudio Miceli de Farias
Moderador Prof. Edmundo Albuquerque de Souza e Silva Dia 12/07 (quarta-feira), 10 horas, Sala H-324B.
Transmissão ao vivo no Canal do PESC no YouTube.
|
Abstract:
Nessa palestra homenagearemos a contribuição do vencedor do prêmio turing de 2022 - Robert Metcalfe. Falaremos sobre o protocolo Ethernet e como é uma das pedras fundamentais que permite o funcionamento não somente da internet mas de diversos sistemas distribuídos.
Short Bio:
O professor Claudio Miceli de Farias fez graduação em Ciência da Computação (2008), mestrado (2010) e Doutorado (2014) em Informática pela Universidade Federal do Rio de Janeiro. Atualmente, atua no Programa de Pós-Graduação em Engenharia de Sistemas e Computação (PESC-COPPE-UFRJ) e no Instituto Tércio Pacitti de Pesquisas e Aplicações Computacionais da UFRJ. Os principais temas de interesse do professor são cidades inteligentes, Internet das Coisas, Fusão de dados e Segurança.
Em breve as datas dos próximos seminários.
Seminários já realizados no ano:
(Re)Use of Research Results … why should we?
Maria Teresa Baldassarre (University of Bari)
 |
(Re)Use of Research Results … why should we?
Maria Teresa Baldassarre (University of Bari), Associate Professor
Dia 22/03 (quarta-feira), 11 horas, Sala H-324B.
Transmissão ao vivo no Canal do PESC no YouTube.
|
Abstract:
According to Popper, the ideas we can most trust are those that have been most tried and most tested. For that reason, many of us are involved in the process called “Science” that produces trusted knowledge by sharing one’s ideas, and trying out and testing others’ ideas (i.e. reusing and replicating). Science and scientists form communities where people do each other the courtesy of curating, clarifying, critiquing and improving a large pool of ideas. According to this definition, one measure of the health of a scientific community is how much it reuses results. Registered Reports are scientific publications which begin the publication process by first having the detailed research protocol, including key research questions, reviewed and approved by peers. Subsequent analysis and results are published with minimal additional review, even if there was no clear support for the underlying hypothesis, as long as the approved protocol is followed. Registered reports can prevent several questionable research practices and give early feedback on research designs. This talk will explain the motivation for registered reports, outline the way they have been implemented in software engineering, and outline some ongoing challenges for addressing high quality software engineering research through the importance of artifact evaluation and the role of reusing research results.
Short Bio:
Maria Teresa Baldassarre is Associate Professor, PhD, at the Department of Informatics of the University of Bari, Italy and member of the Software Engineering Research Laboratory (SERLab) where she coordinates the Process&Product Quality area. Her research interests are mainly focused on empirical software engineering, human factors in software engineering, software measurement and quality assurance. She is involved in several research projects and carries out controlled and in field experimentation within small and medium enterprises, and international academic partners. She is a partner of the SER&Practices spin off company of the University of Bari. Currently she is the representative for the University of Bari in the International Software Engineering Research Network (ISERN) and is PC member of several relevant software engineering and empirical software engineering international conferences. She is Associate Editor of Decision Support Systems Journal. Part of the Editorial Board of Empirical Software Engineering Journal, and co-chair of Registered Reports. She has covered several roles in the organization of software engineering related conferences.
Maculan 80 Anos: Uma Homenagem ao Prof. Nelson Maculan
 |
Uma manhã de homenagem aos 80 anos do Prof. Nelson Maculan.
Quarta-feira, 29 Março 2023, a partir das 8:30 horas.
Local: Auditório da COPPE no CT2.
Realização conjunta PESC/COPPE e Inst. de Matemática (IM/UFRJ). Programação:
08:30 hs - Recepção e Café
09:30 hs - Homenagem
11:30 hs - Coquetel
|
Resumo:
No seminário PESC de março, o Instituto de Matemática e a COPPE fazem uma homenagem conjunta ao nosso professor duplamente Professor Emérito pelos seus 80 anos que tanto inspiram o CCMN e o CT.
Palestrantes:
Como palestrantes teremos orientados no PESC pelo homenageado: o professor Carlile Lavor, da UNICAMP, co-autor mais frequente do homenageado; o professor Marcone Souza, ex-reitor da UFOP, onde o homenageado se graduou; a professora Lorena Pradenas, da Universidade de Concepción no Chile; os professores Victor Giraldo e Gregório Malajovich, do Instituto de Matemática da UFRJ; e o professor Luidi Gelabert Simonetti do PESC/COPPE/UFRJ.
List matrix partition problems on chordal graphs parameterized by leafage
Flavia Bonomo (Universidad de Buenos Aires)
 |
List matrix partition problems on chordal graphs parameterized by leafage
Flavia Bonomo (Universidad de Buenos Aires), Professora Associada
Moderador: Prof. Jayme Luiz Szwarcfiter
Dia 12/04 (quarta-feira), 10 horas, Sala H-324B.
|
Abstract:
Graph k-coloring and k-clique cover are examples of partition problems in graphs, in the first case into k independent sets, in the second case into k cliques. Moreover, maximum clique and maximum independent set are examples of partition problems into two sets, one arbitrary and the other one required to be a clique (resp. independent set), with the addition of a linear objective function to maximize. These are examples of matrix partition problems. For each symmetric matrix M over {0,1,*}, the M-partition problem seeks a partition of the input graph into independent sets, cliques, or arbitrary sets, with certain pairs of sets being required to have no edges joining them, or to have all edges joining them, as encoded in the matrix. Moreover, the vertices of the input graph can be equipped with lists, restricting the parts to which a vertex can be placed. Even if the first four problems (k-coloring, k-clique cover, maximum clique and maximum independent set) are polynomially solvable on chordal graphs, Feder, Hell, Klein, Nogueira and Protti in 2005 proved that there are M-partition problems (without lists) that remain NP-complete for chordal graphs. In this talk, making use of a graph width parameter called "thinness", we will show that all list matrix partition problems with linear objective functions are XP on chordal graphs, parameterized by the leafage of the chordal graph. (The leafage of a chordal graph is the minimum number of leaves in a tree such that the graph can be realized as an intersection graph of subtrees of that tree.)
These results are from joint works with Diego De Estrada and with Nick Brettell, Andrea Munaro and Daniël Paulusma.
Short Bio:
Flavia Bonomo é licenciada em Ciências Matemáticas e doutora em Ciências da Computação pela Universidade de Buenos Aires. Atualmente atua como Professora Associada com dedicação exclusiva no Departamento de Computação da FCEN-UBA e Pesquisadora do ICC-CONICET (Argentina). Sua principal área de pesquisa é a Teoria dos Grafos, embora também tenha artigos publicados sobre tópicos de Pesquisa Operacional, e mantém estreita colaboração nesses temas desde 2002 com pesquisadores da COPPE, UFRJ. No campo da Teoria dos Grafos seus principais tópicos de interesse cobrem as caracterizações estruturais de classes de grafos, o estudo de diferentes parâmetros de largura em grafos, e a delimitação de fronteiras em termos de complexidade computacional e classes de grafos para vários problemas de otimização combinatória.
Comemorando os 130 Anos do LAND
 |
Uma manhã comemorativa (60 + 70) do LAND.
Pessoal do LAND contando histórias do mesmo. Quarta-feira, 3 Maio 2023, a partir das 10 horas.
|
Resumo:
O Laboratório de Modelagem, Análise e Desenvolvimento de Redes e Sistemas de Computação (LAND) é um pilar do Programa de Engenharia de Sistemas e Computação.
A oportunidade de uma dupla comemoração 60 + 70 é irresistível para os pesquisadores que receberam no LAND os primeiros passos decisivos na sua formação.
Ouviremos testemunhos nostálgicos e inspiradores, pois o laboratório tem inúmeras histórias a contar sobre o seu impacto na pesquisa nas suas várias áreas de atuação (tais como modelagem e análise, redes de computadores e aprendizado de máquina), além de sua contribuição na formação de pesquisadores.
Data Science and Innovation
Patrick Valduriez (Inria)
 |
Data Science and Innovation
Patrick Valduriez (Inria France), Emeritus Senior Scientist
Scientific Director of the Inria-Brasil International Lab
Dia 04/05 (quinta-feira), 14 horas, Sala H-324B.
Transmissão ao vivo no Canal do PESC no YouTube.
|
Abstract:
Data science and innovation have become overloaded terms, leading to some confusion. To be successful, the innovation process involves not only inventions (e.g., new methods) but also context, e.g., user behavior, and timing, e.g., market readiness. In this talk, I discuss the potential impact of data science on innovation, using selected success stories. I also discuss innovation within the Inria-Brasil strategic partnership.
Short Bio:
Patrick Valduriez is an emeritus senior scientist at Inria, France, the scientific director of the Inria-Brasil international lab. and the Chief Scientist Officer of the LeanXcale company (that delivers a news generation NewSQL database). He has been consulting for major companies in USA (HP Labs, Lucent Bell Labs, NERA, LECG, Microsoft), Europe (ESA, Eurocontrol, Ask, Shell) and France (Bull, Capgemini, Matra, Murex, Orsys, Schlumberger, Sodifrance, Teamlog).
He is currently a member of the Zenith team (between Inria and University of Montpellier at the LIRMM lab.) that focuses on data science, in particular data management in large-scale distributed and parallel systems and scientific data management. He has authored and co-authored more than 200 technical papers and several textbooks, among which “Principles of Distributed Database Systems” (with Professor Tamer Özsu, University of Waterloo). He currently serves as associate editor of the Distributed and Parallel Databases journal. He has served as PC chair of major conferences such as SIGMOD and VLDB. He was the general chair of SIGMOD 2004, EDBT 2008 and VLDB 2009.
He received several best paper awards, including VLDB 2000. He was the recipient of the 1993 IBM scientific prize in Computer Science in France and the 2014 Innovation Award from Inria and the French Academy of Science. He is an ACM Fellow.