Course
|
Credits
|
Scientific Disciplinary Sector Code
|
Contact Hours
|
Exercise Hours
|
Laboratory Hours
|
Personal Study Hours
|
Type of Activity
|
Language
|
20801728 -
THEORETICAL INFORMATICS
(objectives)
Introduce the students to the theory of languages and, at the same time, to the theory of automata. introduce computability and complexity paradigms. At the end of the course students should know new formal methodologies, should be able to critically review, from the perspective of their expressive potential, already known methodologies and should be able to classify problems from the point of view of the resources required for their solution.
|
|
20801728-1 -
INFORMATICA TEORICA MODULO I
(objectives)
Introduce the students to the theory of languages and, at the same time, to the theory of automata. introduce computability and complexity paradigms. At the end of the course students should know new formal methodologies, should be able to critically review, from the perspective of their expressive potential, already known methodologies and should be able to classify problems from the point of view of the resources required for their solution.
-
PATRIGNANI MAURIZIO
( syllabus)
Basic language properties: Operations with languages, Kleene's operator, regular expressions, languages and cardinalities Grammars: Chomsky's grammars, productions, language generation and recognition. Regular Languages: Finite State Automata, relationship between automata and regular languages, pumping lemma, closure of regular languages, regular expressions and regular languages, regular languages and decidable properties, Myhill-Nerode theorem.
( reference books)
G. Ausiello, F. d'Amore, G. Gambosi, "Linguaggi Modelli Complessità", FrancoAngeli.
|
6
|
ING-INF/05
|
54
|
-
|
-
|
-
|
Core compulsory activities
|
ITA |
20801728-2 -
INFORMATICA TEORICA MODULO II
(objectives)
Introduce the students to the theory of languages and, at the same time, to the theory of automata. introduce computability and complexity paradigms. At the end of the course students should know new formal methodologies, should be able to critically review, from the perspective of their expressive potential, already known methodologies and should be able to classify problems from the point of view of the resources required for their solution.
-
PATRIGNANI MAURIZIO
( syllabus)
Introduce the students to the theory of languages and, at the same time, to the theory of automata. introduce computability and complexity paradigms. At the end of the course students should know new formal methodologies, should be able to critically review, from the perspective of their expressive potential, already known methodologies and should be able to classify problems from the point of view of the resources required for their solution.
( reference books)
Michael Sipser, "Introduction to the Theory of Computation", Second Edition, Thompson.
|
6
|
ING-INF/05
|
54
|
-
|
-
|
-
|
Core compulsory activities
|
ITA |
20801732 -
OPERATIONAL RESEARCH II
(objectives)
The course aims at providing basic methodological and operative knowledge to represent and cope with decision processes and quantitative models.
-
NICOSIA GAIA
( syllabus)
Introduction to Integer Linear Programming (ILP): relation between ILP and LP, equivalent formulations, relaxations, totally unimodular matrices, standard techniques for ILP modelling. Typical ILP formulations: plant location, investment problem, sequencing problems, network optimization, transportation problems, set covering, set partitioning, set packing, crew scheduling. Exact algorithms: Branch and Bound, Cutting Planes, dynamic programming. Exact algorithms for binary and integer knapsack problems. Optimization on graphs: matching, vertex cover, max flow, independent set, Eulerian graphs and bipartite graphs. Use of an ILP commercial solver.
( reference books)
[1] M. FISCHETTI, "LEZIONI DI RICERCA OPERATIVA", EDIZIONI LIBRERIA PROGETTO PADOVA, ITALIA, 1995. (CHAP. 2, 5, part of 6 and 7). [2] R. AHUJA, T. MAGNANTI, J. ORLIN, "NETWORK FLOWS", PRENTICE HALL, 1993. (PG. 189-191, 473-475, 494-496) [3] Lecture notes.
|
6
|
MAT/09
|
54
|
-
|
-
|
-
|
Related or supplementary learning activities
|
ITA |
20801733 -
WIRELESS TELECOMMUNICATIONS
(objectives)
To acquire a general framework on mobile systems, including access and core networks architectures, multiple access techniques, mobility and security, internetworking of different standards and integration with IP network, main tools and procedures for implementation of applications and services.
-
GIUNTA GAETANO
( syllabus)
The mobile wireless networks. Network services. Mobility management. Security. Network and equipments management. Architecture and resource access in 2G and 3G networks. Architecture and resource access in 4G network. Evolution towards 5G. Further details on the site: http://host.uniroma3.it/laboratori/sp4te/teaching/tw/program.html
( reference books)
G. Giunta, Lucidi del corso di Telecomunicazioni Wireless. 2017. G. COLUMPSI, M. LEONARDI, A. RICCI: “UMTS: TECNICHE E ARCHITETTURE PER LE RETI DI COMUNICAZIONI MOBILI MULTIMEDIALI”, SECONDA EDIZIONE; HOEPLI INFORMATICA; NOVEMBRE 2005. Stefania Sesia, Issam Toufik, Matthew Baker: “LTE - The UMTS Long Term Evolution: From Theory to Practice, 2nd Edition”, Wiley publ.; July 2011. Mansoor Shafi, Andreas F. Molisch, Peter J. Smith, Thomas Haustein, Peiying Zhu, PrasanDeSilva, Fredrik Tufvesson, Anass Benjebbour, and Gerhard Wunder: “5G: A Tutorial Overview of Standards, Trials, Challenges, Deployment, and Practice. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 35, NO. 6, JUNE 2017. Mamta Agiwal, Abhishek Roy, and Navrati Saxena: “Next Generation 5G Wireless Networks: A Comprehensive Survey. IEEE COMMUNICATIONS SURVEYS & TUTORIALS, VOL. 18, NO. 3, THIRD QUARTER 2016.
|
6
|
ING-INF/03
|
54
|
-
|
-
|
-
|
Related or supplementary learning activities
|
ITA |
Optional group:
comune Orientamento unico QUATTRO A SCELTA - (show)
|
36
|
|
|
|
|
|
|
|
20801729 -
INFRASTRUCTURES OF CALCULATOR NETWORKS
(objectives)
The purpose is to provide advanced knowledge on computer networks, with methodological and technical contents. Special attention is devoted to scalability issues. At the end of the course the student is supposed to get the following concepts: inter-domain and intra-domain routing, congestion control, architectures for scalable systems. The student is also supposed to get advanced technicalities on widely adopted protocols. Finally, the student is supposed to understand the main economic and technical drivers of the internet evolution.
-
DI BATTISTA GIUSEPPE
( syllabus)
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.
( reference books)
Slides provided by the teacher.
|
9
|
ING-INF/05
|
81
|
-
|
-
|
-
|
Core compulsory activities
|
ITA |
|