PART 1: The application level. The point of view of the applications. Network service QoS. Design of scalable architectures for Web services. Internet data center architectures. Content delivery networks. Peer-to-peer networks and distributed hash tables.
PART 2: The relationship between transport and application layers. The socket library and its use.
PART 3: Congestion control and the transport layer. Transport techniques. TCP and congestion control. Focus: TCP exercises and examples.
PART 4: Routing metodologies and technologies. Routing algorithm for the network infrastructure. Link-State-Packet algorithms. Routing protocols and the Internet network. Software Defined Networks. Spanning tree computation for switched networks.
PART 5: Interdomain routing. Border Gateway Protocol. Scalability of BGP. Internet architecture. Internet data analysis. Design of a transit AS. Stability of BGP protocol.
PART 6: Virtual networks. Virtual local networks (VLAN). Evolution of the Spanning Tree Protocol. MPLS-based Virtual Private Networks.
PART 7: IPv6. NAT and IPv4 exhaustion. Basics of IPv6 protocol and address space. ICMPv6. Source address selection and multihoming. IPv4-IPv6 transition mechanisms.

Slides provided by the teacher.

Introduction to Python and/or Julia programming

1. Python or Julia? Getting started
2. Language syntax by examples

Polyhedral geometry

3. Linear and affine spaces
4. Convex sets, affine and convex coordinates
5. Simplicial, cuboidal and cellular complexes

Basic computer graphics

6. Affine transformations
7. hierarchical structures and scene graphs

Introduction to Geometric Computing

8. Parametric representation
9. Curves, surfaces, solids
10. Rational and polynomial maps
11. tensor product patches
12. Solid modeling. Motion modeling

A. Paoluzzi, Geometric Programming for Computer-Aided Design, Wiley, 2003. (free download from uniroma3.it domain)
https://github.com/cvdlab-courses/ggpl
https://github.com/plasm-language/pyplasm
https://github.com/cvdlab/lar-cc

Database technology: physical structures, transaction management, distributed architectures. Data bases for decision support, data warehousing. Seminars on recent topics in database management.

P. Atzeni et al. Basi di dati 4/Ed. McGraw-Hill, 2014 (in alternative, any major database textbook, contact the instructor for advice)
Additional material available on the course site:
http://www.dia.uniroma3.it/~atzeni/didattica/BD/BDIIindex.html

1. Introduction:

- Intelligent Agents.
- AI as representation and search.

2. Solving problems by Searching:

-Blind search (Breadth-first search, Uniform cost search, Depth-first search, Iterative deepening search).
- Heuristic search (Best First, A*, IDA*, Heuristic Functions).
- Approximate Algoritms (Hill Climbing, Simulated Annealing, etc.)
- Two-Person games (MiniMax, Alfa-Beta Pruning).

3. Knowledge Representation and Automated reasoning:

- Frames, Semantic Networks, Production Systems.
- Case-Based Reasoning.
- Knowledge Based Systems.

4. Machine Learning:

- Symbol-Based (Inductive Learning, Decision trees).
- Connectionist (Artificial Neural Networks).

5. Communicating, Perceiving and Acting:

- Natural language Processing and Information retrieval.
- Computer Vision.

S.J.Russel, P.Norvig "Artificial Intelligence: A Modern Approach", 3/Ed (2010). Pearson Education.

Predicate logic (syntax and semantics). Automated deduction: the resolution method. Logic Programming and Prolog. The situation calculus and the language Golog. Linear temporal logic and the tableau method for LTL. Omega-automata. Formal methods for the verification of software systems.

M. Cialdea Mayer. Logica (lecture notes).
Any introductory text on Prolog.
SWI-Prolog User Manual.
M. Cialdea Mayer. Il Calcolo delle Situazioni e il linguaggio Golog (lecture notes).
M. Cialdea Mayer. Logica temporale e verifica di proprietà dei programmi (lecture notes).

Software architecture concepts.
Viewpoints and views.
The architecture definition process.
Designing for software qualities.
Evaluating the architecture.
POSA architectural patterns.
Architecture of distributed systems.
Software deployment.
Middleware.

Concurrent Programming Fundamentals
• Sequential and Parallel Process
• Finite Progress Assumption, Fairness and Deadlock
• Bernstein conditions, and interference
• Dijkstra Semaphores
• Conditional Critical Regions
• Monitors
• Classic Problems

UNIX: Threads and Processes
• Process creation: fork() & exec()
• IPC: signals, pipes, shared memory, semaphores
• POSIX Threads: pthread_create()
• thread synchronization: mutex, condition variable, semaphores
• thread specific data (TSD)
• Unix Client/Server Programming
• socket API , TCP vs UDP
• Competition problems server side

Java thread
• thread creation
• java monitor
• java cooperation: wait() & notify()
• programming techniques for thread-safeness
• java.util.concurrent API

Advanced Topics
• non-blocking algorithms
• concurrent programs testing
• modello ad attori
• reactive streams

BRIAN GOETZ. JAVA CONCURRENCY IN PRACTICE - ADDISON WESLEY
DOUG LEA. CONCURRENT PROGRAMMING IN JAVA - Second ED. - ADDISON WESLEY
MAURICE HERLIHY, NIR SHAVIT. THE ART OF MULTIPROCESSOR PROGRAMMING - MORGAN KAUFMANN

• INTRODUZIONE AL CORSO
• INTRODUZIONE ALLA SICUREZZA INFORMATICA E TERMINOLOGIA
• VULNERABILITÀ E MINACCE
• VULNERABILITÀ DEL SOFTWARE INPUT FIDATO E NON FIDATO, VALIDAZIONE DELL'INPUT. VULNERABILITÀ DI APPLICAZIONI SCRITTE IN LINGUAGGI INTERPRETATI, CODE INJECTION.
• ESEMPIO DI SITO VULNERABILE A SQL INJECTION
• ATTACCHI DI TIPO BUFFER OVERFLOW. EXPLOITATION: PRIVILEGE EXCALATION, INTRUSIONI VIA RETE TRAMITE SERVIZI APERTI, INTRUSIONE VIA DOCUMENTI NON FIDATI (VIA EMAIL, VIA WEB O ALTRO).
• ESEMPIO DI CODICE VULNERABILE A BUFFER OVERFLOW E RELATIVO EXPLOIT
• SECURE PROGRAMMING.
• MALAWARE E SCOCIAL ENGINEERING: VIRUS, WORM, TROJAN, ROOTKIT, BACKDORS, SNIFFER, SPYWARE, ADWARE, ECC. SCRIPT KIDDIES. PHISHING E CROSS-SITE SCRIPTING.
• VULNERABILITÀ DELLE RETI: SNIFFING, MAC FLOOD, ARP POISONING, VULNERABILITÀ DEL DNS. TCP SESSION HIJECKING, ATTACCHI MITM, DOS E DISTRIBUTED DOS, ROUTE HIJECKING.
• ESERCIZI SU VULNERABILITÀ
• CONTROMISURE
• PRINCIPI DI PROGETTAZIONE DI POLITICHE E MECCANISMI
• MODELLI: AAA, CONFINAMENTO, DAC, MAC, ACCESS CONTROL MATRIX,
• SICUREZZA DEI SISTEMI:
• PRINCIPI GENERALI (PASSWORDS E VULNERABILITÀ, METODOLIGA DI HARDENING, ASSESSMENT E AUDITING)
• UNIX (CONTROLLO DI ACCESSO DISCREZIONARIO, SICUREZZA NEL FILESYSTEM, AUTENTICAZIONE, PAM, HARDENING, SYSLOG)
• CONFINAMENTO IN SISTEMI DAC (JAILING E VIRTUALIZZAZIONE), SELINUX
• WINDOWS: NTFS
• SICUREZZA DEI SISTEMI RFID
• ESERCIZI SU ACCESS CONTROL E SICUREZZA DI SISTEMA.
• SICUREZZA DELLE RETI:
• SICUREZZA A LIVELLO 1 E 2, FIREWALL STATELESS E STATEFULL, LINUX NETFILTER ED ESEMPI DI CONFIGURAZIONI, PROXY E LORO VULNERABILITÀ. SUDDIVISIONI DI CARICO E FULL HIGH-AVAILABILITY. INTRUSION DETECTION SYSTEMS DI RETE.
• ESERCIZI SULLA SICUREZZA DELLE RETI.
• TECNICHE CRITTOGRAFICHE:
• RICHIAMI DI CRITTOGRAFIA (HASH, SIMMETRICA, ASIMMETRICA, MAC, FIRMA DIGITALE), ATTACCHI BIRTHDAY, RAINBOW, QUALITÀ DELLE CHIAVI, GENERAZIONE DI NUMERI PESUDO-CASUALI.
• PROTOCOLLI DI AUTENTICAZIONE E DI SCAMBIO DI CHIAVI. ATTACCHI REPLAY E REFLECTION. NONCES.
• ESERCIZI SU PROTOCOLLI DI AUTENTICAZIONE E SCAMBIO DI CHIAVI.
• CERTIFICATI, CERTIFICATION AUTHORITY, PUBLIC KEY INFRASTRUCTURE E LORO VULNERABILITÀ. APPLICAZIONI: POROTOCOLLI SSL, TLS, SSH, VIRTUAL PRIVATE NETWORK, IPSEC, PPTP. PROTOCOLLI DI AUTENTICAZIONE PUNTO-PUNTO PAP, CHAP, MS-CHAP, EAP. AUTENTICAZIONE DEGLI UTENTI IN RETE LOCALE 802.1X, RADIUS E VULNERABILITÀ.
• ASPETTI GESTIONALI: PIANIFICAZIONE, PROGETTAZIONE E NORMATIVA.
• STANDARD E CERTIFICAZIONE: TCSEC, ITSEC, COMMON CRITERIA, ISO17799, ISO27001
• PIANIFICAZIONE DELLA SICUREZZA: OBBLIGHI NORMATIVI RELATIVI AL DLGS 196/2003 E IL DPS, IL PIANO DI SICUREZZA AZIENDALE (CONTENUTI, VANTAGGI ORGANIZZATIVI, POLICY, STATO ATTUALE, ANALISI DEI RISCHI, REQUISITI, CONTROMISURE, RISPOSTA AGLI INCIDENTI, BUSSINES CONTINUITY, DISASTER RECOVERY).
• ESERCIZI SU PIANIFICAZIONE, PROGETTO E NORMATIVA (SOLUZIONI).
• ARGOMENTI SOLO PER GLI STUDENTI DELL'ORDINAMENTO DM270.
• STRUTTURE DATI AUTENTICATE
• SICUREZZA DI SISTEMA - WINDOWS

MATERIALE FORNITO DAL DOCENTE.
TESTI DI RIFERIMENTO
• M. BISHOP, "COMPUTER SECURITY: ART AND SCIENCE", ADDISON-WESLESY.
• C. KAUFMAN, R. PERLMAN, M. SPECINER, "NETWORK SECURITY: PRIVATE COMUNICATION IN A PUBLIC WORLD (SECOND EDITION)", PRENTICE HALL.
• C. PFLEEGER, S. PFLEEGER, "SICUREZZA IN INFORMATICA", PEARSON - PRENTICE HALL.
• M. E. RUSSINOVICH, D. A. SOLOMON, "MICROSOFT WINDOWS INTERNALS, FOURTH EDITION", MICROSOFT PRESS.

1. Introduzione ai Sistemi Intelligenti per Internet
• Adaptive Web
• Processi di Information Seeking

2. Information Retrieval nella Pratica
• Architettura dei Motori di Ricerca
• Metodi di elaborazione di documenti testuali
• Tecniche di Ranking dei documenti
• Modelli di Retrieval
• Caso di studio: Il motore di ricerca open-source Galago

3. Machine Learning e Information Retrieval
• Classificazione e Categorizzazione
• Support Vector Machines
• Clustering

4. User Modeling e Personalized Search
• Tipologie di Modelli Utente
• Tecniche di Modellazione Utente
• Accesso personalizzato alle informazioni
• Content-based Information Filtering

5. Social Search e Recommender Systems
• User Tags e Manual Indexing
• Searching with Communities
• Collaborative Filtering
• Recommender Systems

6. Metodi di Valutazione Sperimentale
• Metriche per la valutazione sperimentale dei SII
• Metodi statistici di hypothesis testing
• Casi di studio

7. Seminari
• Seminari di approfondimento su temi trattati a lezione

BRUSILOVSKY, KOBSA E NEJDL
"THE ADAPTIVE WEB: METHODS AND STRATEGIES FOR WEB PERSONALIZATION"
SPRINGER, 2007.

DISPENSE INTEGRATIVE A CURA DEL DOCENTE.

1. Regression
The problem of predictive learning
Linear Regression
Assessment and Overfitting
Ridge Regression and Lasso

2. Classification
Logistic Regression for classification
Decision Trees
Algorithm AdaBoost
Support Vector Machine (Large Margin Classification, Kernel I, Kernel II)
Naïve Bayes

3. Clustering and Retrieval
Algorithm K-NN
Algorithm K-Means
Expectation Maximization
Applications to Information Retrieval

4. Dimensionality Reduction
Data compression and visualization
Principal Component Analysis (PCA)
Choice of the number of principal components
Applications to Recommender Systems

5. Deep Learning
Deep Forward Networks
Regularization for Deep Learning
Convolutional Networks
Various applications

6. Case studies and projects
Several case studies will be exposed and projects will be proposed to apply the notions learned on various domains of interest.

Lecture notes by the professor.

Terminology and main characteristics
Infrastructure and programming paradigms for Big Data
Hadoop MapReduce
cloud computing
Pig and Hive
Spark and other alternatives to MapReduce
NoSQL systems
Big-Graph database management systems
Big Data analytics
Examples of applications
Business seminars

Martin J. Fowler, PramodkumarJ. Sadalage. "NoSQL Distilled: A Brief Guide to the Emerging World of Polyglot Persistence".
Teacher handouts (available on the Web side of the course)

Data and Visualization: Data overloading. Comparison of Scientific Visualization and Information Visualization. Structured and Unstructured data. Data transformation. Data tables.

Visual Perception: Our vision’s principles and limitations. Peripheral and central view. The perception of color.

Cognitive Issues and User Tasks: Perception abilities. Weber's law. Stevens' power law. Gestalt laws. A two stage model for visual perception. Task taxonomies.

Infovis on the Web - SVG and D3.js: Basic ingredients of Web data visualization. JavaScript crash course. Raster and vector graphics. Overview of JavaScript libraries. Focus on D3.js.

Multivariate Data Representations: Combined views. Icons or glyphs. Alternative coordinate systems.

Visualization in Computer Networks: Visual analysis in the computer network domain. Motivations. Taxonomies. Real-world examples and use cases. Open questions.

Design Methods and Evaluation: Design methodologies and design choices. Design evaluation (goals, difficulties, practices, guidelines).

Visualization of Time Series Data: Definition of time series and temporal data. Visualization of time series (single dependent variable, multiple dependent variables). Case studies.

Interaction: Classification of interaction mechanisms, goals, and timings. Examples of interaction strategies.

Introduction to Graph Drawing: Graph Drawing conventions and aesthetics. The divide an conquer approach for testing planarity of a graph.

Node-link Representations of Trees: Representing trees within the node-link paradigm. Layered drawings of trees. Hv-drawings of trees. Limitations of node-link representations.

Space-Filling Visualizations of Trees: Algorithms and systems for the representation of trees using the space-filling strategy. Treemaps. 3D Space-filling approaches.

Representations of Graphs and Networks with the Force-Directed Approach: The force-directed paradigm. The barycenter method. Spring embedders. Scalability and flexibility of the force-directed paradigm. Fruchterman-Reingold and Barnes–Hut algorithms. Simulating graph theoretic distances. Magnetic fields. Generic energy functions. Handling drawing constraints.

Representations of Hierarchical Data: Algorithms for the representation of layered networks. The Sugiyama approach. Step 1: Cycle removal. Step 2: Level Assignment. Step 3: Crossing Reduction. Step 4: X-Coordinate Assignment

Orthogonal Drawings: Computing orthogonal drawings via Network Flows. The Topology-Shape-Metric approach. Extension to graphs of arbitrary degree. Representations of orthogonal drawings obtained from visibility representations and by incremental approaches.

Visualizing Large Graphs: Strategies for the visualization of massive amount of data providing both overview and details. Alternate between views. Combine different views. Filtering and clustering principles. Three-dimensional and two-dimensional representations of clustered graphs. Hybrid representations.

Tools and Libraries for Drawing Graphs: Tools and Libraries for drawing graphs. Programming languages, input and output formats, and interaction. Some practical example.

Architectures for Scalable Information Visualization: Computational and memory scalabity. Visualization architectures. Strategies for visualizing massive amounts of data.

Slides provided by the teacher.

ARGOMENTI AVANZATI DI GESTIONE DI DATI SU WEB. TECNICHE DI INDICIZZAZIONE, INTERROGAZIONE E ANALISI DI DOCUMENTI WEB. TECNICHE AVANZATE DI ESTRAZIONE DATI, INFERENZA DI WRAPPER, WEB DATA FUSION. TECNICHE AVANZATE DI INFORMATION EXTRACTION: ESTRAZIONE DI ENTITÀ E DI RELAZIONI. CASI D'USO.

- TRASPARENZE E ALTRO MATERIALE FORNITO DAL DOCENTE
- ARTICOLI DI RICERCA ASSEGNATI AGLI STUDENTI

TESTI (OPZIONALI):
- MANNING, RAGHAVAN, SHUTZE: "INTRODUCTION TO INFORMATION RETRIEVAL" - CAMBRIDGE UNIVERSITY PRESS
- JURAFSKY, MARTIN: "SPEECH AND LANGUAGE PROCESSING: AN INTRODUCTION TO NATURAL LANGUAGE PROCESSING, COMPUTATIONAL LINGUISTICS, AND SPEECH RECOGNITION" SECOND EDITION
- Ronen Feldman: Text Mining Handbook - Advanced Approaches in Analyzing Unstructured Data

The program depends upon foreign professors.

The books depend upon foreign professors.