Great Ideas in ICT (2017)

Once every few years the information and communication technology community is shaken by some results that fundamentally impact several core topics. These results often have strong consequence on real systems, and thus, finally, impact our everyday life as well. This course has the goal of introducing the attendees to several breakthroughs, representative of different areas, showing the practical impact they had on ICT as it is today. Lectures will be delivered by professors and researchers from the department of computer science (DI), the department of computer, control, and management engineering Antonio Ruberti (DIAG) and the department of Information, communication and electronic engineering (DIET).

Index:
    Notes
    Schedule
    Lectures
    Rules for the Ph.D. in Engineering in Computer Science
    Rules for the Ph.D. in Automatica and Operations Research
    Rules for the Ph.D. in Computer Science
    Rules for the Ph.D. in Information and Communications Technologies

Notes:

  • NOTE:The lecture of July 6th is moved July 11th 9:30-13:00, room A7, Via Ariosto 25.
  • NOTE:The lecture of July 13th is moved to July 17th at 14:30-18:00.

Schedule:

Lectures:

Ontology-Based Data Access: Definitions, Algorithms and Methodologies
Lecturer: Domenico Lembo
Schedule: 15/6/2017 9:30-13:00 - Room B203, Via Ariosto 25, Roma.
Abstract: This lecture introduces Ontology-based Data Acess (OBDA), a paradigm for data integration that has received an always increasing attention in the last years in the knowledge representation and database communities. OBDA aims at coupling conceptual views of information, commonly expressed as Description Logic (DL) ontologies, with actual and possibly pre-existing data stores. The lecture gives the basics of OBDA, provides an overview of the main reasoning tasks and algorithms for solving them, and illustrates methodologies for developing OBDA applications. More in detail, we gently introduce Description Logics through the use of a graphical model for quick development of OWL 2 ontologies, i.e., ontologies expressed in the W3C standard language. We then survey typical mechanisms to link ontologies with data, and discuss some special reusable patterns for modeling recurrent representation needs.
Slides: pdf

Computing with private data: Data Processing in the Encrypted Domain
Lecturer: Riccardo Lazzeretti
Schedule: 20/6/2017 9:30-13:00 - Room B203, Via Ariosto 25, Roma
Abstract: The processing and encryption of content are generally considered sequential and independent operations. In certain multimedia content processing scenarios, it is, however, desirable to carry out processing directly on encrypted signals. The field of secure signal processing poses significant challenges for both signal processing and cryptography research; only few ready-to-go fully integrated solutions are available. This talk first concisely summarizes some of the cryptographic primitives used in existing solutions to processing of encrypted signals, and discusses implications of the security requirements on these solutions. The talk then continues to describe three domains in which secure signal processing has been taken up as a challenge, namely, analysis of biomedical data, remote biometric attestation and privacy-preserving IoT device coordination. Finally, the talk discusses the challenges and open issues in the field of secure data processing.

3D Indoor positioning and navigation: theory, implementation and applications
Lecturer: Luca De Nardis
Schedule: 27/6/2017 9:30-13:00 - Sala lettura DIET, Palazzina di elettronica, Via Eudossiana 18, Roma
Abstract: Indoor navigation and way finding of people and objects is of tremendous interest nowadays, where the challenge in extending GPS to indoor environments limits service continuity and accuracy, and calls for a cross-disciplinary approach encompassing technologies, data representation, visual design and semiotics. This seminar will present the main solutions to the problem of indoor positioning, focusing to the case of 3D positioning, that poses the hardest challenges in heterogeneous indoor. Recent advances for both positioning and tracking will be presented, and a practical demonstration of an indoor positioning system based on Wi-Fi fingerprinting will be given.

Hierarchical deep learning, from CNN to Non-Parametric Bayes, with applications
Lecturer: Fiora Pirri and Valsamis Ntouskos
Schedule: 11/7/2017 9:30-13:00 - Room A7, DIAG, Via Ariosto 25, Rome
Abstract: TBD

Graphs: a model for (almost) everything
Lecturer: Tiziana Calamoneri
Schedule: 7/7/2017 9:30-13:00 - Aula Seminari, DI, Via Salaria 113, Rome
Abstract: Graphs are mathematical objects that have been defined in the XVIII century and, since then, they have been extensively used to model a huge number of problems.
During this lecture we will focus on a number of real life problems mainly from the fields of computer networking and biology, we will highlight their modelization as graph problems and their possible solution exploiting classical graph algorithms, so showing that graphs -although old aged- remain among the most powerful tools to solve problems.

Fully Homomorphic Encryption
Lecturer: Daniele Venturi
Schedule: 10/7/2017 11:30-13:00 14:00-15:30 - Aula Seminari, DI, Via Salaria 113, Rome
Abstract: This tutorial surveys constructions and applications of Fully Homomorphic Encryption (FHE). FHE is a special type of encryption that allows to transform an encryption of a value x into an encryption of f(x), using only public information, and for arbitrary (efficient) functions f on the plaintext domain. Such an encryption scheme has many powerful applications, e.g., to secure outsourcing of computation, two-party computation, private information retrieval, and zero-knowledge.
The construction of FHE has been an open problem for nearly 30 years, until a breakthrough result by Gentry (STOC '09) showed the first candidate construction based on the hardness of some computational problem over ideal lattices. Since then, many other scheme were proposed following Gentry's blueprint, with significant improvements both in terms of assumptions and efficiency.

How to win games with deep reinforcement learning
Lecturer: Roberto Capobianco and Luca Iocchi
Schedule: 17/7/2017 14:30-18:00 - Room B203, DIAG, Via Ariosto 25, Rome
Abstract: In the last year, news-breaking successes of machine learning applications increased the hype around AI. Atari, Go, and Poker competitions have been the arenas where software defeated humans, thorough the use of deep reinforcement learning. In this presentation, we will discuss the main ideas, challenges, algorithms and open problems related to deep reinforcement learning. Specifically, we will focus on real examples and we will provide practical hints and solutions to implement the same ideas on multiple problems, ranging from videogames to robot control.

Process Mining. Analytics applied to Workflow
Lecturer: Andrea Marrella
Schedule: 18/7/2017 9:30-13:00 - Room B203, DIAG, Via Ariosto 25, Rome
Abstract: Process mining is a recent research discipline that sits between computational intelligence and data mining on the one hand,
and process modeling and analysis on the other hand. The idea of process mining is to gain concrete and actionable process
insights from event data available in today's information systems. Process mining is of tremendous interest nowadays,
as it can be applied in a variety of application domains (including hospitals, insurance companies, etc.) where there is the
need to improve the workflows performance (e.g., reducing costs and production time) and compliance (e.g., avoiding deviations or reducing risks).

This lecture will provide an introduction to the key analysis techniques in process mining that allow users to automatically
learn process models from raw event logs (process discovery) and to check if reality, as recorded in the event logs, conforms
to the models and vice versa (conformance checking). Recent advances that are currently investigated in the process mining community
will be presented as well. During the lecture, an academic software prototype (ProM) will be used to test all the discussed process mining techniques
against real-life and synthetic data sets.

New trends in Deep Learning
Lecturer: Michele Scarpiniti
Schedule: 20/7/2017 10:00-13:00 - Sala lettura DIET, Palazzina di elettronica, Via Eudossiana 18, Roma
Abstract: Theoretical results found in many branches of applied fields of science, suggest that in order to learn the kind of complicated functions that can represent high-level abstractions (like in vision, language and other Artificial Intelligence tasks), one may need deep architectures. A deep architecture is composed of multiple levels of nonlinear operations, such as in neural networks with many hidden layers or in complicated probabilistic networks. In order to find a solution, a suitable learning algorithm should be derived by exploiting some optimization techniques. However, searching the parameter space of deep architectures is a very difficult task. Fortunately, several learning algorithms have recently been proposed to tackle this problem with notable success, beating the state-of-the-art in certain areas.
This seminar discusses the motivations and principles regarding learning algorithms for deep architectures, in particular those exploiting Deep Neural Networks (DNNs) with supervised, unsupervised and hybrid learning algorithms. Finally, are presented some deep learning solutions that represent the current state-of-the-art in areas of strategic interest such as: text, language model and natural language processing; information retrieval; visual object recognition and computer vision; speech recognition and audio processing; multimodal and multi-task learning ( text-image, speech-image).

Rules for the Ph.D. in Engineering in Computer Science:

This course can be considered as a B-type course (2.5 CFUs or 3 CFUs for students belonging to cycle 30 or later) as long as both the following requirements are satisfied:

  • the student attends at least six lectures among the ones listed above; students must download this attendance sheet and fill it in to have their attendance recognized;
  • the student completes an assignment for one of the listed lectures. The assignment must be agreed with the corresponding lecturer.

Assignments will be discussed through seminar-like presentations to be scheduled with lecturers.

Rules for the PhD in Automatica, Bioengineering and Operations Research:

This course can be considered as a B-type course (2.5 CFUs) as long as both the following requirements are satisfied:

  • the student attends at least five lectures among the ones listed above; students must download this attendance sheet and fill it in to have their attendance recognized;
  • the student completes an assignment for one of the listed lectures. The assignment must be agreed with the corresponding lecturer.

Assignments will be discussed through seminar-like presentations to be scheduled with lecturers.

Rules for the Ph.D. in Computer Science:

This course can be considered as a B-type course (2.5 CFUs or 3 CFUs for students belonging to cycle 30 or later) as long as both the following requirements are satisfied:

  • the student attends at least six lectures among the ones listed above; students must download this attendance sheet and fill it in to have their attendance recognized;
  • the student completes an assignment for one of the listed lectures. The assignment must be agreed with the corresponding lecturer.

Assignments will be discussed through seminar-like presentations to be scheduled with lecturers.

Students will be granted 1.5 CFUs by attending at least 3 lectures and complete an assignment for one of the listed lectures. A mandatory minimum of at least 3 lectures is required for each student in the first or second year of the PhD.

Rules for the Ph.D. in Information and Communications Technologies:

Students will be granted 1.5 CFUs by attending at least 3 lectures. The CFUs can be doubled (for a total of 3) by completing the assignments for at least three lectures. Students must download this attendance sheet and fill it in to have their attendance recognized.