Eventi

BOOST Summer School 2024

Bologna, 19-30 august 2024

Outstanding second- and third-year undergraduates and first-year Masters students in Informatics and other STEM disciplines are invited to learn about cutting-edge research in computer science. Leading researchers will engage with attendees in their areas of expertise through short courses, seminars, discussions, and informal interactions.

Scientific Coordination

Lorenzo Alvisi, Cornell University

Ozalp Babaoglu, Università di Bologna

Gianfranco Bilardi, Università di Padova

Alessandro Panconesi, La Sapienza

Organization

Andrea Bandini, Centro Residenziale Universitario di Bertinoro

Lorenzo Alvisi, Cornell University

Program

Monday, august 19, 2024

Tuesday, august 20, 2024

Wednesday, august 21, 2024

Thursday, august 22, 2024

Friday, august 23, 2024

Saturday, august 24, 2024

Sunday, august 25, 2024

No classes

Monday, august 26, 2024

Tuesday, august 27, 2024

Wednesday, august 28, 2024

Thursday, august 29, 2024

Friday, august 30, 2024

How to apply

Attendance is by invitation only.   Required application materials include information about your undergraduate/graduate academic record, and a concise description of your key accomplishments to date. 

You can apply by filling this form. 

There is no registration fee to attend, and BOOST will cover food and lodging for all attendees. 

Faq

Who should apply?

Outstanding second- and third-year undergraduate and first year Masters students in Informatics and other STEM disciplines.

What is the deadline for applications? When will I hear back?

Applicants submitting their applications by July 6 will receive notification of their status by July 13.  Submissions received after July 6 will be evaluated on a rolling basis until all positions are filled.

What if I am available for a subset of the days of the school? Can I attend partially?

Unfortunately, no. Students are expected to commit for the entire duration of the school.

Where are classes held?

In Oropa, classes will be held in the Sala Convegni of the Sanctuary. 

What kind of accommodations will there be?

Students will be hosted in the Monte Mucrone rooms within the Sanctuary’s hospitality facilities. Typical accommodations consists of a double room, with private bath and wi-fi.

What is the earliest arrival and latest departure date?

Check-in  at the Sanctuary’s  hospitality facilities  will be available from 2:00 pm  to 7:00 pm on July 20.. Checkout will be after lunch on July 25

Do I need to bring a laptop?

Yes. Courses may include coding exercises.

Which language is spoken at the school?

All instruction will be in English.

How many students will be attending?

Approximately 70

If the above does not address your question, you can contact the organizers.

The lecturers

Ozalp Babaoglu

Ozalp Babaoglu, Università di Bologna

Ozalp is Professor of Computer Science at the University of Bologna. Previously, he was an Associate Professor in the Computer Science Department at Cornell University. He earned his PhD in Computer Science in 1981 from the University of California, Berkeley. His extensions of virtual memory for AT&T’s Unix system, developed during his doctoral studies at Berkeley, became the foundation for a long series of “BSD Unix” distributions. He received the Sakrison Memorial Award in 1982 (along with Bill Joy), the UNIX International Recognition Award in 1989, and the USENIX Association Lifetime Achievement Award in 1993. In 2002, he was named an ACM Fellow. In 2007, he co-founded the IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO). He has served on the editorial boards of ACM Transactions on Computer SystemsACM Transactions on Autonomous and Adaptive Systems, and Springer Distributed Computing.

He is the President of ELICSIR and the Chair of the Board of the Orthogonal School.

Gianfranco Bilardi

Gianfranco Bilardi, Università di Padova

Gianfranco is a Full Professor in the Department of Information Engineering at the University of Padua and an Academic Visitor at the IBM T.J. Watson Research Center. Previously, he served as an Assistant Professor of Computer Science at Cornell University. In 1985, he earned his PhD in Electrical Engineering from the University of Illinois Urbana-Champaign. At the University of Padua, he has been a member of the CdA and Vice-Rector for IT infrastructure. His research interests include algorithms and parallel architectures, high-performance computing, theory of computation, formal languages, VLSI, and signal processing.

He is a member of the ELICSIR Foundation’s Board of Directors and the Board of the Orthogonal School.

Paolo Boldi

Paolo Boldi, Università Statale di Milano

Paolo is a Full Professor of Computer Science at the Università Statale di Milano, where he has coordinated both the PhD program and the undergraduate program in Computer Science. His research focuses on algorithms for the web and social networks, with notable achievements such as the experimental confirmation of the six degrees of separation theory on Facebook and advanced algorithms for web graph compression. He has developed widely-used software within the international academic community and has served as chair for leading international conferences, including WWW, WSDM, and ACM Web Science. He has received three Yahoo! Faculty Awards and a Google Focused Award.

At ELICSIR, he is a mentor for the Orthogonal School.

Valeria Cardellini

Valeria Cardellini, Università di Roma Tor Vergata

Valeria Cardellini is a Full Professor of Computer Engineering at the University of Rome Tor Vergata. Her research interests include distributed software systems, particularly in the areas of Cloud and Edge computing. She is the co-author of over 100 publications in international journals and conferences and serves on the editorial boards of IEEE Transactions on Parallel and Distributed Systems and Elsevier Journal of Parallel and Distributed Computing.

At ELICSIR, she is a mentor for the Orthogonal School.

Nicolò Cesa-Bianchi

Nicolò Cesa-Bianchi, Università degli Studi di Milano

Nicolò Cesa-Bianchi is Professor of Computer Science at Università degli Studi di Milano and holds a joint appointment at Politecnico di Milano. His main research interests are the design and analysis of machine learning algorithms for online learning, sequential decision-making, and graph analytics. He is co-author of the monographs “Prediction, Learning, and Games” and “Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems”. He served as President of the Association for Computational Learning and co-chaired the program committees of some of the most important machine learning conferences, including NeurIPS, COLT, and ALT. He is the recipient of a Google Research Award, a Xerox Foundation Award, a Criteo Faculty Award, a Google Focused Award, and an IBM Research Award. He is ELLIS fellow, member of the ELLIS board, and co-director of the ELLIS program on Interactive Learning and Interventional Representations. He is a corresponding member of the Italian Academy of Sciences.

Michele Colajanni

Michele Colajanni, Università di Bologna

Michele Colajanni is a Full Professor at the Department of Computer Science and Engineering of the University of Bologna. He is also affiliated with the Bologna Business School and the Johns Hopkins University, SAIS Europe. He graduated in Pisa, and he was with the University of Rome and the University of Modena. His research interests include cybersecurity, scalable architectures for big data management and AI analytics. He founded the Research Center on Security and Safety and the Cyber Academy for ethical hackers. He has directed courses and masters for universities, ministries, and companies. His scientific production includes more than 250 peer-reviewed articles, direction of national and international projects, and several presentations in workshops, conferences, and invited lectures.

Abe Davis

Abe Davis, Cornell University

Abe Davis is an Assistant Professor in the Computer Science Department at Cornell University, where his research group works at the intersections of computer graphics, vision, and human-computer interaction. Abe earned his Ph.D. in EECS from MIT CSAIL, and his thesis won the MIT Sprowls Award for Outstanding PhD Dissertation in Computer Science as well as honorable mention for the ACM SIGGRAPH Outstanding Doctoral Dissertation Award. Abe was also named one of Forbes Magazine’s “30 under 30”, Business Insider’s “50 Scientists Who are Changing the World” and “8 Innovative Scientists in Tech and Engineering”, he has won the “Most Practical SHM Solution for Civil Infrastructures” Award at IWSHM, and is a recipient of the NSF CAREER award in 2024.

Barbara Di Camillo

Barbara Di Camillo, Università di Padova

Barbara is a Full Professor of Computer Science at the Department of Information Engineering at the University of Padua. Her research focuses on the application of data mining and machine learning for the analysis of biological data for applications in bioinformatics and medicine. In particular, in the study of regulatory metagenomic and transcriptomics, as well as the modeling of disease dynamics. At the University of Padua, she leads the SysBioBig (Systems Biology and Bioinformatics Group) research group.

At ELICSIR, she is a mentor for the Orthogonal School.

Matteo Frigo

Matteo Frigo, Google

Matteo earned his PhD from the Massachusetts Institute of Technology in 1999. His research interests include the theory and practice of parallel algorithms, multi-threaded systems, cache-oblivious algorithms, signal processing, and, more recently, zero-knowledge proofs. He has worked for over a decade in the cloud industry, designing storage and networking systems for some of the leading cloud platforms. His research has earned significant recognition, including the Wilkinson Prize for Numerical Software in 1999, the ACM Most Influential PLDI Paper Award in 2008 and 2009, the SPAA Best Paper Award in 2009, and the IEEE FOCS Test of Time Award in 2019.

At ELICSIR, he is a mentor for the Orthogonal School.

Vittorio Maniezzo

Vittorio Maniezzo, Università di Bologna

Vittorio is a Full Professor of Computer Science at the Department of Computer Science of the University of Bologna. He is the author of over 100 international publications with nearly 40,000 citations on Google Scholar. He serves on the editorial boards of journals such as OR Spectrum, Swarm Intelligence, Operational Research – An International Journal, Algorithms, and Int. J. of Applied Metaheuristic Computing. His research focuses on heuristic algorithms for combinatorial optimization, a field he has been involved with since his PhD in Computer Science, obtained at the Politecnico di Milano in 1993. He was one of the designers of the Ant System algorithm, which later evolved into Ant Colony Optimization (ACO), and more recently, he has been a leading figure in the metaheuristics community (2006 to present).

At ELICSIR, he is a mentor for the Orthogonal School.

Lorenzo Orecchia

Lorenzo Orecchia, Università di Chicago

Lorenzo is an Associate Professor in the Department of Computer Science at the University of Chicago. His research focuses on the design of algorithms to address fundamental computational challenges in machine learning and combinatorial optimization, combining ideas from both continuous and discrete optimization into a unified framework. He earned his PhD in Computer Science from UC Berkeley in 2011 and taught applied mathematics at MIT until 2015. He has received prestigious awards, including the SODA Best Paper Award in 2014 and the NSF CAREER Award in 2020. He has also been invited to serve on the program committee of major conferences such as FOCS, SODA, and NeurIPS.

At ELICSIR, he is a mentor for the Orthogonal School.

Alessandro Panconesi

Alessandro Panconesi, La Sapienza

Alessandro is a Full Professor of Computer Science at the University of Sapienza in Rome. He earned his PhD in Computer Science from Cornell University. His research interests cover all aspects of algorithms, with a particular focus on randomized and distributed algorithms, and more recently, machine learning. He is the President of BICI, the Bertinoro International Center for Informatics. He has received international recognition for his research, including the ACM Danny Lewin Best Student Paper Award, the Dijkstra Prize, and faculty awards from IBM, Yahoo!, and Google, as well as two Google Focused Awards. He has served on the program committees of major conferences such as SODA, PODC, ICALP, WWW, and KDD, also taking on leadership roles. He is an associate editor of JCSS.

He is a member of the Board of Directors of ELICSIR and the Board of the Orthogonal School.

Keshav Pingali

Keshav Pingali, University of Texas

Keshav Pingali is the W.A.”Tex” Moncrief Chair of Grid and Distributed Computing in the Department of Computer Science at the University of Texas at Austin, and a member of the Oden Institute for Computational Engineering and Sciences (ICES) at UT Austin. He has a PhD from MIT, and a B.Tech. from the Indian Institute of Technology, Kanpur, where he was awarded the President’s Gold Medal and the Lalit Narain Das Memorial Gold Medal. Pingali has made deep and wide-ranging contributions to many areas of parallel computing including programming languages, compilers, and runtime systems for multicore, manycore and distributed computers. His current research is focused on programming models and tools for high-performance graph computing.

Pingali is a Fellow of the IEEE, ACM, and AAAS, and a foreign member of the Academia Europeana. He received the IIT Kanpur Distinguished Alumnus Award in 2013, the 2023 IEEE CS Charles Babbage Award, the 2023 ACM/IEEE CS Ken Kennedy Award, and the 2024 ACM SIGPLAN Programming Languages Achievement Award. Between 2008 and 2011, he was the co-Editor-in-chief of the ACM Transactions on Programming Languages and Systems. He has served on many international committees including the NSF CISE Advisory Committee (2009-2012) and the Board of Directors of CoLab, a joint research initiative between the government of Portugal and UT Austin (2007-2017).

Samantha Riesenfeld

Samantha Riesenfeld

Samantha Riesenfeld is Assistant Professor in the University of Chicago Pritzker School of Molecular Engineering, with additional affiliations in the Department of Medicine, the Institute for Biophysical Dynamics, the Data Science Institute, the Comprehensive Cancer Center, and the Committee on Immunology. She is also a Chan-Zuckerberg Biohub Investigator and a faculty member of the NSF-Simons National Institute for Theory and Mathematics in Biology. She leads a highly interdisciplinary research group that develops and applies machine learning methods to investigate complex biological systems using genomic, transcriptomic, and multimodal data. Areas of focus include inflammatory immune responses and solid tumor cancers. Dr. Riesenfeld has a BA in mathematics and computer science from Harvard University and a PhD in theoretical computer science from UC Berkeley. She did postdoctoral training at the interface of machine learning, systems biology, and immunology at the Broad Institute of MIT and Harvard, Brigham and Women’s Hospital, and the Gladstone Institutes at UCSF. Her honors include an NIH F32 NRSA postdoctoral fellowship, a BroadIgnite postdoctoral award, and a Cancer Research Foundation Young Investigator Award.

Lectures

Ozalp Babaoglu, Università di Bologna

The Impact of BSD Unix on Modern Computing and the Internet: Origins of the Open Software Movement

In this talk, I will discuss the historical significance of Unix, which may be considered the “grandfather of all modern operating systems”. Since its creation at Bell Laboratories in the 1970s, Unix has blossomed into a wide family tree with many branches, one of which has come to be known as “BSD Unix”.  Berkeley Software Distribution (BSD) Unix was a fork from the original Bell Laboratories Research Unix and was developed and distributed by the Computer Systems Research Group (CSRG) at the University of California, Berkeley from the late 1970s throughout the 80s.  During my PhD work at UC Berkeley, I was one of the architects of BSD Unix which was a major factor in the rapid growth of the Internet through its built-in TCP/IP stack and has influenced numerous other modern operating systems including FreeBSD, NetBSD, OpenBSD, SunOS, Solaris, Mac OS/X and iOS.  During the 1980s and 90s, the Berkeley version of UNIX became the standard in education and research, garnering development support from the Defense Advanced Research Projects Agency (DARPA) and was notable for introducing virtual memory and inter-networking.  BSD Unix was widely distributed in source form so that others could learn from it and improve it; this style of software distribution has led to the open source movement, of which BSD Unix is now recognized to be one of the earliest examples.

Gianfranco Bilardi, Università di Padova

Chatting about Transformers: an Introduction to Large Language Models

Proposed in 2017, the Transformer has revolutionized the field of Large Language Models (LLMs), leading to applications that have fascinated the public worldwide, as well as raising intriguing scientific and philosophical questions, on the nature of language and knowledge. The basic function of the transformer consists in evaluating the probability distribution of the “next word” in a text, given the sequence of the preceding words. This function can then be extended to language generation, in response to a given “prompt”. 

The seminars will present the key ideas of Machine Learning (ML) that have been successfully combined in the transformer, such as tokenization, word and positional embedding, query-key-value attention, feedforward neural networks, back propagation, and gradient descent. The algorithmic and architectural computing requirements will be considered. The wider implications of LLMs will be briefly discussed.

Paolo Boldi, Università Statale di Milano

When Graphs are Large

Graphs are powerful and versatile tools that find countless applications, from social networks to communication systems of various kinds. Handling large graphs poses a number of new challenges: even storing such graphs in main memory cannot be usually attained in naive ways, and calls for more sophisticated approaches.

In this talk, I will touch on some of the techniques that have been proposed to compress and use very large graphs. Besides compression, I will discuss diffusion-based algorithms using probabilistic counters, with two applications: Milgram-like experiments on very large social networks and the computation of distance-based centrality indices.

Valeria Cardellini, Università di Roma Tor Vergata

Elastic Computing: from Cloud to Edge and Beyond

Elasticity is the degree to which a computing system is able to adapt to fluctuating demands by provisioning and de-provisioning resources in an autonomic manner. It represents a distinguishing feature of Cloud systems and services and becomes even more challenging in highly distributed environments such as the Edge. In this talk, I will discuss what elasticity is and how it can be achieved, also considering an architectural point of view. I will also talk about policies to drive elasticity, both from academia and industry.

Nicolò Cesa-Bianchi, Università degli Studi di Milano

The Mathematics of Machine Learning

Machine learning is the main driving force behind the current AI revolution. To provide a solid mathematical foundation to learning systems, we must formally characterize what a machine can learn and what is the minimal amount of training data needed to achieve a desired performance. In this talk, we will show some fundamental results concerning the mathematics of machine learning, stressing their potential and limitations.

Michele Colajanni, Università di Bologna

Digital Innovation through Secure and Resilient Services

Innovation through digitalization represents an inevitable and shared strategy. Equally evident is the fragility of a digital world where all processes, services and supply chains are supported by interconnected digital systems. Hence, we should move from a retrospective in which cybersecurity was perceived as an obstacle to business to an ambitious perspective where we should lead organizations towards digital services that embed cybersecurity and resiliency by design. This route will become even more important as more businesses, industries and services will be driven by digital data and AI. It is important to note that similar perspectives on guarantee of trust and service continuity are also received by the most recent European and US norms.

Abe Davis, Cornell University

Computation for Content Creation

Computers have had a tremendous impact on the ways that we create and consume content. Whether that content is text, digital media (e.g., images, video, and audio), or even tangible manufactured objects, digital tools now play major roles in how we build, capture, or develop most of the things we create. This short course will explore many of those roles. The lectures draw heavily from a course by the same name that I teach for computer science graduate students at Cornell.
The tentative topics include:
Representing content: How do we represent different types of content? How might the representation that we expose to the human user of a computational tool differ from the internal representation? What should we consider when designing a representation?
What are computers good at?: The value of a computational tool hinges on being able to leverage certain advantages of computation. We will discuss what computers are (and are not) especially good at, and how these strengths are leveraged in computational tools.
Representing natural signals: We will talk a bit about how to represent and manipulate visual and auditory signals. In other words, an introductory preview of some foundational concepts in vision, graphics, and audio.

Barbara Di Camillo, Università di Padova

Machine Learning Applications in Medicine: from Theory to Practice and Back

In this seminar, I will briefly introduce machine learning, explaining the unique characteristics of its applications in medicine and biology. Specifically, I will focus on the ability of algorithms to generalize and identify reproducible biomarkers. I will then explore methodological aspects related to feature selection that facilitate the discovery of robust biomarkers. Additionally, I will emphasize the importance of explainability in ensuring that machine learning models are transparent and their decisions are understandable, which is crucial for their acceptance and trust in the medical and biological fields.

Using Multi-Agent Models to Simulate Tumor Microenvironment

Multi-agent models are simulation systems composed of multiple autonomous entities, called agents, that interact with each other within a common environment. These models are used to represent and analyze complex behaviors and dynamics of systems where multiple actors, or agents, act and react reciprocally. In this seminar, I will demonstrate how they can be used to simulate the tumor microenvironment, where different types of cells have unique properties and behaviors. Each cell is represented by an autonomous agent, showcasing how this approach can reveal emergent properties of the system. 

Matteo Frigo, Google

Anatomy of Cloud File Systems

We discuss the architecture and the techniques employed by real-world large-scale storage systems, with an emphasis on file storage.  We first discuss the general organization of such systems.  We then dive deep into certain problems that need to be solved for the system to work: 1) how to replicate data reliably and consistently; 2) how to maintain transactional invariants across different parts of the system; 3) how to build a scalable ordered map; 4) how to map the file abstraction into the ordered map; and 5) erasure-coding techniques for efficient storage utilization.  In addition, we discuss techniques for managing congestion, which is an underappreciated problem at all layers of the system.

Vittorio Maniezzo, Università di Bologna

Forecasting Rhapsody: Algorithmic Models and Hybrids for Time Series Forecasting

Knowledge of the future has always been a desire of mankind. Ancient approaches were quite diverse, though not very reliable, a diversity that can also be found in current approaches to time series forecasting. The talk will sketch the variety of backgrounds that have led to state-of-the-art forecasting algorithms, ranging from statistics to plain multilayer perceptrons, from nonlinear optimization to transformer-based models. Furthermore, the broad landscape of applications leads to an interest in the design of combined models.

Lorenzo Orecchia, Università di Chicago

Simple and Fast: Algorithm Design via Gradient Descent

In this minicourse, I will explore a recent surprising trend in the field of algorithms: the fastest methods for solving problems on discrete structures, such as graphs, are given by simulating continuous dynamics, e.g., dropping a ball in a potential well and diffusing heat in a conductive medium. Topics will include gradient descent and coordinate descent for linear regression problems, basics of spectral graph theory, combinatorial preconditioning, and variational methods for algorithm design.

Alessandro Panconesi, La Sapienza

Hilbert, Gödel, Turing: Computers 'R' Us

In a landmark 1936 paper, Alan Turing famously introduced the concept now known as the Turing machine, a mathematical abstraction that rigorously defines the intuitive and yet elusive notion of an algorithm. His paper presented several revolutionary ideas that profoundly and enduringly influenced the development of science and technology, serving as true harbingers of the computer revolution. While the technical definition of Turing machines may be familiar to many computer science students, it is only by considering Turing’s ideas within their proper cultural context that we can fully appreciate their elegance and power. In this popular science talk, I will attempt to do just that.

Keshav Pingali, University of Texas

Machine Learning for the Rest of Us

It is likely that machine learning (ML) will transform the  way we do science and engineering as radically as computers did 50  years ago. Therefore, just as Computer Science (CS) students need to  know programming regardless of their area of specialization, they will  soon need to know ML to stay relevant as the CS field is transformed  by ML. However, most ML presentations are geared for researchers  specializing in ML, and it can be difficult for students in other  areas to extract the key intuitions and ideas in this rapidly evolving  field. In this series of lectures, we use pictures and the very  intuitive notion of paths in directed graphs to explicate the key  ideas in deep neural networks, convolutional neural networks,  recurrent neural networks, and reinforcement learning (RL).

Samantha Riesenfeld

Of Mice and Men (and Bytes)

Thanks to recent experimental technologies based on DNA sequencing, genomic data have increased dramatically in size, resolution, and biological scope. Together with bigger and novel types of data come new computational and statistical challenges, as well as more ambitious scientific goals. For example, can we use these noisy, high-dimensional data to demystify the inner workings of the mammalian immune system? Pin down the causes of autoimmune diseases? Improve targeted therapies for different cancers? In this minicourse, I will describe the role of data science in answering these questions, including vignettes from my own research. We will cover some of the unique challenges of extracting insights from these data, current computational strategies, and open problems on the horizon.

Luogo

Oratorio di San Filippo Neri, Bologna

L’Oratorio di San Filippo Neri è un affascinante contenitore culturale di proprietà della Fondazione del Monte. Al suo interno si svolgono le iniziative e i convegni promossi dalla Fondazione che, tra l’altro, ogni anno offre alla città un ricco cartellone di spettacoli, incontri, concerti, tutti a ingresso libero. La Fondazione concede inoltre l’utilizzo dell’Oratorio a enti e organizzazioni che ne facciano richiesta.
Qui le informazioni.
L’Oratorio si trova in pieno centro a Bologna, in via Manzoni 5, ed è visitabile il primo fine settimana di ogni mese dalle 10 alle 19.

Other events

Scuola estiva BOOST 2025 (seconda parte)
Bologna, 31 agosto 2025

BOOST Summer School 2025 (second part)

Scuola estiva BOOST 2025 (prima parte)
Santuario di Oropa, 20 luglio 2025

BOOST Summer School 2025 (first part)

Quarto Weekend Ortogonale 2024/2025
Isola di San Servolo, Venezia, 16 maggio 2025

Fourth Orthogonal Weekend 2024/2025

Terzo Weekend Ortogonale 2024/2025
Bertinoro, 21 marzo 2025

Third Orthogonal Weekend 2024/2025

Supporters

Support Us

  • Donations from private citizens
  • Contributions and partnerships from companies, institutions, and other foundations
  • Your 5×1000, at no cost to you

Donate

Support Us