Elements of set theory. Maps between sets: invective, surjective, bijective maps.
Elements of propositional logic, truth tables. Equivalence and order relations.
Combinatorics. Binomial coefficients and binomial theorem. Permutations. The Integers: divisibility, GCD and Euclidean algorithm, Bézout identity, linear congruences.
Baiscs of algebraic structures: permutation groups, abstract groups, polynomials and finite fields.
Elements of graph theory.Lattices and Boolean algebras

Giulia Maria Piacentini Cattaneo
Matematica discreta e applicazioni
Zanichelli 2008

Basics of set theory. Union, intersection, Cartesian product,
difference, complement. Set of parts of a finite whole, and its
cardinality.

Elements of logic: propositional calculus. Negation operations,
conjunction, disjunction, XOR, logical implication, double implication.
Truth tables. Logical equivalence. Tautologies and contradictions. hints
on predicates. Universal and existential quantifier.

Applications between sets. Domain, co-domain, image, counter-image.
Injective, surjective, bijective applications. Reverse application.
Operating product between applications. Identity. The set of applications
between two finite sets and its cardinality. Permutations.

Relations. Reflexive, symmetric, antisymmetric, transitive property:
order and equivalence relation. Examples of relationships. Partially together
ordered. Equivalence relations, equivalence classes, set
quotient.

Integers: divisibility and its properties. Division with the remainder. Maximum
common divider. Euclid's algorithm. Identity of Bézout, algorithm
extended Euclid's. Diophantine equations. Application of the algorithm
Euclid looking for integer solutions for the equation ax + by = c. Numbers
first. Fundamental theorem of arithmetic and Euclid's theorem.

Consistency form no. The set Z/nZ of the remainder classes modulo n. Sum and
multiplication in Z/nZ. Linear congruences. Condition for resolvability.
Description of the solutions of linear congruences. Congruence systems
and the Chinese remainder theorem. Invertible elements in Z/nZ. Euler's φ function.
Fermat's little theorem, Euler-Fermat theorem.

Combinatorics: Arrangements and combinations without repetitions, coefficients
binomials. Properties of binomial coefficients, Development of the binomial.
Arrangements and combinations with repetitions, Tartaglia triangle.

Partially ordered sets, Hasse diagrams. maximum and minimum,
maximal and minimal elements, higher and lower, upper and lower.
lattices. Properties of inf and sup in a lattice. Algebraic lattices. lattices
limited, complementary, distributive. Boolean algebras.

Piacentini Cattaneo, Matematica discreta. Zanichelli.
Delizia-Longobardi-Maj-Nicotera, Matematica Discreta, McGraw Hill.
Procesi-Rota, Elementi di algebra e matematica discreta. Accademica.

1. Linear equations and numbers
Linear equations systems. Matrix associated with a linear system. Equivalent systems. Natural, integer, rational numbers, real numbers and their property. Recall of set theory: inclusion of sets, difference between sets.
2. Matrices and sets
Matrices with real coefficients. Square, triangular, diagonal matrices. Transpose of a matrix and symmetric matrices. Recall of set theory: union and intersection of sets.
3. The vector space of the matrices
Addition between matrices and its properties. Multiplying a scalar for a matrix and its properties.
4. Product between matrices
Product between matrices with compatible dimensions. Properties of the product: associative property and distributive property. Examples showing that product between matrices does not satisfy the commutative property and the simplification property. Matrices and linear systems.
5. Determinants
Definition by induction of the determinant when using the first-row development. Determinant property: development according to any row or column, determinant of the transposed matrix, determinant of a triangular matrix. Binet theorem.
6. Reverse matrix
Unit matrix. Reverse matrix. Inverse property. Cramer's theorem.
7. Rank of a matrix
Definition. Property of the rank. Minors of a matrix. Theorem of Kronecker.
8. Linear equation systems
Definitions. Rouché-Capelli theorem. Rouché-Capelli method for solving a linear system.
9. Gauss method
10. Applications of Gauss method
Basic operations. Calculation of the determinant. Calculation of the rank.
11. Geometric vectors
Plan vectors. Addition between vectors. Product of a vector for a scalar. Space vectors. Lines and planes for the origin. Average point.
12. Linear combinations of geometric vectors
Linear combinations. Linearly dependent and independent vectors. Characterization of linearly independent vectors in V2(O) and V3(O).
13. Vector spaces on the real numbers
Definition of vector spaces. Examples of vector spaces. Basic properties of vector spaces.
14. Vector subspaces
Definition of vector spaces. Subspaces of V2(O) and V3(O).
15. Generators of vector spaces
Linear combinations and generators.
16. Linear dependency and independency
17. Basis of vector spaces
Basis. Dimension. Dimension of the set of solutions of a homogeneous system. Dimension of subspaces. Calculation of dimensions and basis.
18. Intersection and sum of subspaces
Intersection of vector subspaces. Sum of vector subspaces. Grassmann's formula.
19. Affine subspaces
The lines of the plane and of the space. Space planes. Affine subspaces. Set of system solutions.
20. Homomorphisms
Homomorphisms between vector spaces. Matrix associated with a homomorphism. Homomorphism associated with a matrix.
21. Image
Property of the image of a homomorphism. Calculation of the image of a homomorphism. Condition of surjectivity of a homomorphism.
22. Kernel
Property of the kernel of a homomorphism. Calculation of the kernel of a homomorphism. Injectivity condition of a homomorphism.
23. Endomorphisms
Matrix associated with an endomorphism. Change of basis.
24. Eigenvalues ​​and eigenvectors
Definitions and basic properties. Eigenspaces. Characteristic polynomial. Diagonalizable matrices.
25. Diagonalization
Diagonalizability conditions. Diagonalization procedure.

G. Accascina and V. Monti, Geometry*
* This book is available for free at the following link: http://www.dmmm.uniroma1.it/accascinamonti/geogest/Geometria.pdf

1. Linear equations and numbers
Systems of linear equations. Represent linear systems with matrix equations. Equivalent systems. Natural, integers, rational, real numbers and their properties. Pills of Graph Theory: subsets and set subtraction.

2. Matrixes and sets
Matrix with real coefficients. Square, triangular, diagonal matrixes. Transposed and symmetric matrix. Pills of Graph Theory: union and intersection.

3. Vector spaces and matrices
Matrix addition and scalar product and their properties.

4. Matrix product
Matrix product and its mathematical properties: associative and distributive. Example of how matrix product does not satisfy the commutative and simplification properties. Matrices and linear systems

5. Determinants
Formal definition of determinant and its properties. Transposed and triangular matrix determinants. Binet’s theorem.

6. Inverse of a matrix
Identity matrix. Inverse of a matrix and its properties. Cramer’s theorem.

7. Matrix rank
Definition and properties. Minor of a matrix.

8. System of linear equations.
Definition. Rouché-Capelli’s theorem. Rouché-Capelli’s method to solve a linear system.

9. Gaussian elimination and how to apply the Gaussian elimination
Elementary operation. Determinant and rank computations.

10. Geometric vectors
Vectors in 2 dimensions. Sum and scalar product of vectors. Vectors in 3 dimensions. Linear combination. Linear dependence and independence of vectors.

11. Vector spaces and Linear subspaces
Definition, examples and properties.

12. How to generate linear subspaces
Linear combination and generators.

13. Linear dependence and independence

14. Basis of a linear subspace
Basis. Dimensions. Solution set of an homogeneous system and its dimensions.

15. Vector subspaces sum and intersection
Grassmann formula.

16. Affine space
Lines in planes and space. Affine subspace.

17. Homomorphisms
Homomorphism between vector spaces. Represent an homomorphism as a matrix.

18. Image of a matrix
Properties of an homomorphism image and how to compute it. Surjective homomorphism.

19. Kernel of a matrix
Properties of an homomorphism kernel and how to compute it. Injectivity homomorphism.

20. Endomorphisms
Matrix representation of the endomorphisms. Change of basis.

21. Eigenvalues and Eigenvectors
Definition and properties. Eigenspaces. Characteristic polynomial. Diagonalizable matrix.

22. Diagonalizing a matrix
Rules and examples.

G. Accascina e V. Monti,
"Geometria"

1. Linear equations and numbers
Systems of linear equations. Represent linear systems with matrix equations. Equivalent systems. Natural, integers, rational, real numbers and their properties. Pills of Graph Theory: subsets and set subtraction.

2. Matrixes and sets
Matrix with real coefficients. Square, triangular, diagonal matrixes. Transposed and symmetric matrix. Pills of Graph Theory: union and intersection.

3. Vector spaces and matrices
Matrix addition and scalar product and their properties.

4. Matrix product
Matrix product and its mathematical properties: associative and distributive. Example of how matrix product does not satisfy the commutative and simplification properties. Matrices and linear systems

5. Determinants
Formal definition of determinant and its properties. Transposed and triangular matrix determinants. Binet’s theorem.

6. Inverse of a matrix
Identity matrix. Inverse of a matrix and its properties. Cramer’s theorem.

7. Matrix rank
Definition and properties. Minor of a matrix.

8. System of linear equations.
Definition. Rouché-Capelli’s theorem. Rouché-Capelli’s method to solve a linear system.

9. Gaussian elimination and how to apply the Gaussian elimination
Elementary operation. Determinant and rank computations.

10. Geometric vectors
Vectors in 2 dimensions. Sum and scalar product of vectors. Vectors in 3 dimensions. Linear combination. Linear dependence and independence of vectors.

11. Vector spaces and Linear subspaces
Definition, examples and properties.

12. How to generate linear subspaces
Linear combination and generators.

13. Linear dependence and independence

14. Basis of a linear subspace
Basis. Dimensions. Solution set of an homogeneous system and its dimensions.

15. Vector subspaces sum and intersection
Grassmann formula.

16. Affine space
Lines in planes and space. Affine subspace.

17. Homomorphisms
Homomorphism between vector spaces. Represent an homomorphism as a matrix.

18. Image of a matrix
Properties of an homomorphism image and how to compute it. Surjective homomorphism.

19. Kernel of a matrix
Properties of an homomorphism kernel and how to compute it. Injectivity homomorphism.

20. Endomorphisms
Matrix representation of the endomorphisms. Change of basis.

21. Eigenvalues and Eigenvectors
Definition and properties. Eigenspaces. Characteristic polynomial. Diagonalizable matrix.

22. Diagonalizing a matrix
Rules and examples.

G. Accascina e V. Monti,
"Geometria"

Real numbers and functions, set theory, induction principle, infimum and supremum.
Sequences, definition of limit, operations with limits, comparison theorems, infinitives of increasing order.
Limits of function, continuity, link with the limits of sequences, theorems on continuous functions.
Derivatives, geometric meaning, theorems on differentiable functions, relative maximums and minimums, applications to the study of functions. Indefinite integrals, integration by parts and by substitution, definite integrals, fundamental theorem of integral calculus, improper integrals. Numerical series, simple and absolute convergence, convergence criteria.
Complex numbers.
Solution of linear differential equations and separable differential equations.

Bertsch, Dall'Aglio, Giacomelli - Epsilon 1, Primo corso di Analisi Matematica . McGraw Hill

Real numbers and functions, set theory, induction principle, infimum and supremum.
Sequences, definition of limit, operations with limits, comparison theorems, infinitives of increasing order.
Limits of function, continuity, link with the limits of sequences, theorems on continuous functions.
Derivatives, geometric meaning, theorems on differentiable functions, relative maximums and minimums, applications to the study of functions. Indefinite integrals, integration by parts and by substitution, definite integrals, fundamental theorem of integral calculus, improper integrals. Numerical series, simple and absolute convergence, convergence criteria. Complex numbers.

Bertsch, Dall'Aglio, Giacomelli - Epsilon 1, Primo corso di Analisi Matematica . McGraw Hill
Marcellini, Sbordone - Analisi matematica uno
Marcellini, Sbordone - Esercitazioni di matematica Volume 1 Parte 1, 2.

Real numbers and functions, set theory, induction principle, infimum and supremum. Sequences, definition of limit, operations with limits, comparison theorems, infinitives of increasing order. Limits of function, continuity, link with the limits of sequences, theorems on continuous functions. Derivatives, geometric meaning, theorems on differentiable functions, relative maximums and minimums, applications to the study of functions. Indefinite integrals, integration by parts and by substitution, definite integrals, fundamental theorem of integral calculus, improper integrals. Numerical series, simple and absolute convergence, convergence criteria. Complex numbers.

Theory:
Marcellini, Sbordone - Elementi di Analisi matematica 1. Bertsch, Dall'Aglio, Giacomelli - Epsilon 1, Primo corso di Analisi Matematica. McGraw Hill
S. Lang, A First Course in Calculus, Springer Ed.
L.Chierchia, Corso di Analisi - Prima parte, McGraw Hill (2019)

Exercises:
Bertsch, Dall'Aglio, Giacomelli - Epsilon 1, Primo corso di Analisi Matematica. McGraw Hill
Marcellini, Sbordone - Analisi matematica uno Marcellini, Sbordone - Esercitazioni di matematica Volume 1 Parte 1, 2.

COURSE PROGRAM

Computer operations and representation of information
-computer architecture
-operating systems
-binary arithmetic
-compilation and execution of programs

Algorithms
-program specification
-programming quality
-representation and algorithm design

Programming Fundamentals
-programming langauges
-variables
-Instructions
-types data
-Instructions structured
-style programming
-structure of the program
-functions

Software correctness
-testing methods
-debugging

Management of data sets
-arrays
-strings

Pointers and dynamic memory allocation
Data structures, struct, files
Recursion
Sorting and searching algorithms
Computational cost of programs
- Big O, Omega and Theta notations
- best, average, and worst case analysis
Data types: lists

Alessandro Bellini, Andrea Guidi
Linguaggio C - Quinta edizione
ISBN: 9788838668210- Autore: Kernighan, Ritchie
Titolo: Il linguaggio C. Principi di programmazione e manuale di riferimento
Editore: Pearson

COURSE PROGRAM (First part)

Computer operations and representation of information
-computer architecture
-operating systems
-binary arithmetic
-compilation and execution of programs

Algorithms
-program specification
-programming quality
-representation and algorithm design

Programming Fundamentals
-programming langauges
-variables
-Instructions
-types data
-Instructions structured
-style programming
-structure of the program
-functions

Software correctness
-testing methods
-debugging

Management of data sets
-arrays
-strings

COURSE PROGRAM (Second part)

Pointers and dynamic memory allocation
Data structures, struct, files
Recursion
Sorting and searching algorithms
Computational cost of programs
- Big O, Omega and Theta notations
- best, average, and worst case analysis
Abstract data types and related structures
- lists
- queues
- stacks

Author: Bellini, Guidi
Title: Linguaggio C - Una guida alla programmazione con elementi di Objective-C
Edition: 5-th edition
Editor: McGraw-hill
Year: 2013

Two-pole non-linear resistors: the diode. Nonlinear Circuit Linearization Example: Diode Linearization (Small-Signal Model)
Ideal diode and rectifier circuit. Zener diode. Stabilizer circuit with zener. The transistor: cut-off zone, saturation zone. The transient in the active zone: model for large signals. Small-signal model of an active-zone transistor. The transistor as current-driven short-circuit and open-circuit two-poles. Logic gates: NOT,AND, OR FLIP_FLOP SR. The operational amplifier AMP.OP.: Buffer, inverting, non-inverting, comparator, clock, Integrator, Derivator, Adder, Digital - Analog converter.

- Basic Electronics Circuits - K. Vasudevan - Springer Edition

Basics of Electricity and Magnetism. Maxwell's equations. From fields to circuits: limits and validity of circuit representation. Kirkhhoff's laws. Topological characteristics of the circuits. Series and parallel connections, nodes and links. Introduction to graph theory. Fundamental cuts and meshes. Incidence matrices. Conventions for generators and users. Electric power and passivity. Tellegen's theorem. Reciprocity. Bipole, multipole, port and multiport. Linearity, time-invariance, memory. Constitutive laws of passive two-poles R L C and of ideal voltage and current generators. Duality. Controlled generators, Magnetic Circuits, Hopkinson's Law, mutual inductances, gyrator, ideal and null transformer.
Analysis of networks without memory: general methods of nodes and meshes (loops), equivalent topological transformations and Thevenin's theorem. Maximum power transfer theorem. Ideal switches. Laplace transform for solving linear circuits with memory. Impedance, admittance and network functions in the Laplace domain. Methods of antitransformation of fractional rational functions. Extension to the Laplace domain of the methods for solving circuits. Transient and permanent response. Free and forced answer. Stability in circuits. Analysis of permanent regimes. Continuous circuits. Sinusoidal regime. Phasor method. Impedance, admittance and network functions in the frequency domain. Three-phase systems. Active, reactive and complex power. Comparison between Laplace domain and frequency domain. Resonant circuits. Notes on the harmonic regime and Fourier series. Filtering properties of ideal passive and active circuits. Main representations of balanced and unbalanced two-doors. Two-port interconnection.

- BASIC CIRCUIT THEORY BY CHARLES A. DESOER- ERNEST S. KUH

• Continuous and discrete signals and systems
Architecture of a communication system. Continuous and discrete signals: step and Dirac impulse signals, complex exponentials; elementary operations. Energy, power, periodicity of continuous and discrete signals; power of periodic signals. Linear, time-invariant, and causal systems. The impulse response. The Fourier series and its properties. Parseval theorem for periodic signals. The convolution and correlation of continue and discrete signals.

• Signals representation in the frequency domain
Fourier transform of continuous signals and its properties: linearity, time shift, frequency shift (modulation), product, duality, scale change, derivation, integration, convolution and correlation. Spectral energy density. Spectrum of periodic signals. Sampling theorem. Aliasing, energy and power of sampled signals. Reconstruction approaches of sampled signals. Fourier transform of discrete signals and its properties.

• Random signals
Basic concepts. Frequentist and axiomatic description. Continuous and discrete random variables. Cumulative distribution function, probability density (mass) function, characteristic function. Independent random variables. Joint, marginal and conditional probability density functions. Law of total probability. Bayes’ theorem. Gaussian, uniform, binomial, one-sides exponential statistics. Statistical moments of random variables: mean (expected value), variance, root mean square and their relations. Uncorrelated and statistically independent random variables. Functions of random variables and their probability density functions. Probability density function of the sum and the linear combination of independent random variables. Random processes and their statistics. Correlation and covariance. Stationary and ergodic processes. The harmonic process. The additive white Gaussian noise (AWGN). Random process through a system.

• Information theory and source coding
Basics of the information theory, self-information and entropy. Quantization. First Shannon theorem. Huffman coding.

• Baseband digital transmission
Binary and multi-level line encoding. Pulse amplitude modulation (PAM) and pulse coded modulation (PCM). Inter-symbol interference (ISI) and Nyquist theorem, Nyquist pulses. Noise and error probability in binary and multilevel PAM transmission. Matched filter and corresponding error probability.

• Passband digital transmission
Amplitude shift keying (ASK), quadrature amplitude modulation (QAM) and phase shift keying (PSK). Transmitter and receiver scheme. Constellations and distance between symbols. Symbol energy.

• Channel capacity and encoding
Second Shannon theorem. Channel capacity and encoding. Hard decoding and Hamming distance.

Claudio Prati, "Segnali e Sistemi per le Telecomunicazioni", seconda edizione, McGraw-Hill, 2010.

Discrete event simulation, a fundamental methodology for evaluating the performance of complex systems (computational, telecommunications, traffic, etc.)

The topics covered can be grouped into the following three phases:
- Construction of a model of a real system:
- "Execution" of a simulation model
- Analysis of simulation results:

Teacher's material uploaded to the teams

PART 1: Generalities and tools.
Definitions of computational problem, algorithm, data structure.
Random Access Machine and pseudocode.
Asymptotic study of functions (big-O, Omega, and Theta notations).
Asymptotic complexity of algorithms and problems.
Ammortized complexity.
Worst/average/best case analysis.
Recursion and recursion equalities.
Theorems for the analysis of recursion equalities.

PART 2: Abstract data types.
Abstract data types and their representations.
Already known examples: sets, stacks, queues, lists, etc.
Management of dynamic data structures.
Trees: binary trees; arbitrary degree trees; traversals of trees; binary search trees; red-black trees.
Hash tables.
Graphs: representations with adjacency matrix and adjacency lists. DFS and BFS. Graphs and connectivity. Connected components. Minimum-lengths paths.

PART 3: Algorithmic paradigms.
Greedy algorithms (example: selection sort).
Iterative algorithms (example: insertion sort).
Divide et impera algorithms (examples: merge-sort and quick-sort).

PART 4: The course requires (and sometimes recalls) the following notions of C Language.
Imperative programming.
Elementary data types.
Functions.
Arrays and pointers.
Strings.
Memory management: Heap and Stack.
Management of C projects: prototypes and implementations.
Recursion and memory.
Records and pointers.
Dynamic memory management.

Slides provided by the teacher and downloadable day by day from the course website: https://moodle1.ing.uniroma3.it/
In order to download the slides the usual userid-password pair of Roma Tre University is sufficient.

The course is a first level one in automatic control and provides methodological and practical knowledge about:
-Modelling, Simulating and analyze the behavior of physical systems, in particular those that are linear and time invariant;
-Basic concepts on the system dynamics, as stability, transient response and forced one;
-Frequency based design of feedback control systems;
-Digital implementations of linear controllers;
-Use of mainstream software tools to aid in the previous activities.

S. K. Bhattacharya, Control Systems Engineering, Pearson, 2008. [Kindle Edition]

Franklin, Powell, and Enami-Naeini, Feedback Control of Dynamical Systems, 5th Edition, Addison-Wesley, 2006. ISBN: 978-0136019695;

- Introduction to Computer Architecture
- Binary representation of numbers
- The general organization of a computer
- Digital circuits of a computer
- Bus and communication protocols
- The microarchitecture of a computer
- Programming in Assembler

A.S. Tanenbaum, T. Austin. Structured Computer Organization, 6th edition, Prentice Hall
Slides shown in class by the teacher and made available on the Moodle channel of the course

Object Oriented Programming Paradigm
Classes and Objects
Code Quality
Polymorphism
Collections
Generics
Inheritance
Code reuse
Stream
Java Thread

Ken Arnold, James Gosling, David Holmes "Il linguaggio Java: Manuale Ufficiale" - Addison Wesley
Cay Horstmann "Concetti di informatica e fondamenti di Java" - APOGEO
Cay Horstmann, Gary Cornell "Core Java2 Vol I: Fondamenti" - Prentice Hall
Cay Horstmann, Gary Cornell "Core Java2 Vol II: Tecniche avanzate" - Prentice Hall

Introduction to Operations Research:
Formulations, the 5-step method
Preliminaries on Linear Algebra

Formulation of typical optimization problems:
Mixing
Allocating resources
Inventory management
Optimal cut
Assignment
Task planning
Other formulations

Solving Linear Programming problems:
Linear programming geometry
Simplex algorithm
Fourier–Motzkin algorithm
Geometric interpretation of the simplex

Duality theory:
Construction of the dual problem
Fundamental PL theorem
Conditions of complementarity
Economic interpretation of the dual
Sensitivity analysis

Graph optimization:
Maximum flow
Shortest path
Minimum spanning tree

Caramia, Giordani, Guerriero, Musmanno, Pacciarelli, "Ricerca Operativa", Isedi, Italia, 2014.

Introduction to Operations Research:
Formulations, the 5-step method
Preliminaries on Linear Algebra

Formulation of typical optimization problems:
Mixing
Allocating resources
Inventory management
Optimal cut
Assignment
Task planning
Other formulations

Solving Linear Programming problems:
Linear programming geometry
Simplex algorithm
Fourier–Motzkin algorithm
Geometric interpretation of the simplex

Duality theory:
Construction of the dual problem
Fundamental PL theorem
Conditions of complementarity
Economic interpretation of the dual
Sensitivity analysis

Graph optimization:
Maximum flow
Shortest path
Minimum spanning tree

Caramia, Giordani, Guerriero, Musmanno, Pacciarelli, "Ricerca Operativa", Isedi, Italia, 2014.

Contents:
Learning unit: Elements of economic analysis
- Consumer and producer behaviour: the problem of optimal consumer choice subject to the budget constraint, elasticity of demand
- Production decisions (short- and long-run): technology and production function, returns to scale
- Production costs: average and marginal costs; fixed and variable production costs.

Learning unit: The nature of accounting systems - management accounting
- The nature of management accounting
- The classification of costs according to their behaviour
- Full costs and their use: Direct costs and indirect costs; Comparison of direct costs and variable costs; Special costs and common costs versus direct costs and indirect costs; Cost flow diagrams; Life Cycle Costing;
- Job-order and process-based costing systems; The recognition of direct costs (labour and materials); The problem of indirect cost allocation; Cost centres; Overhead cost allocation coefficients;
- Activity-based costing: Activity Based Costing (outline)



Learning unit: The decision-making and control processes of enterprises: Methodologies for analysing investment projects
- Present value and opportunity cost of capital; The net present value rule; Valuation of long-term assets; Perpetual and annuity annuities; Compound interest and present value; Nominal and real interest rates;
- Criteria for choosing alternative investments to Net Present Value: Payback Time; Internal Rate of Return
- Investment decisions using the NPV method: Estimating cash flows and interaction between projects; Annual equivalent costs

Reference Text:
"ECONOMICS APPLIED TO ENGINEERING", EDITION 2022 - "CREATE" BOOK SPECIFIC TO THE COURSE HELD AT THE ENGINEERING DEPARTMENT, FROM THE MC GRAW HILL PUBLISHING HOUSE - AVAILABLE IN SOME COPIES AT THE "EFESTO" BOOKSTORE AND AT ONLINE BOOKSTORE SITES

THE DIGITAL VERSION CAN BE PURCHASED ON THE MCGRAW-HILL WEBSITE https://www.mheducation.com/highered/custom, SELECTING ITALY AS THE COUNTRY AND ENTERING THE ISBN CODE 9781307851151



THE TEXT IS CREATED WITH CHAPTERS FROM THE FOLLOWING BOOKS
BERNHEIM, WHINSTON, "MICROECONOMICS", 3/ED, MC GRAW HILL, 2020 - CHAPTERS 1 TO 4 and 6 TO 8 (chapters are the same if you refer to the 4th edition of 2023)

ANTHONY, HAWKINS, MACRI, MERCHANT, "CONTROL SYSTEMS" 15/ED, MAC GRAW HILL, 2021 - CHAPTERS 1 TO 5 AND 14 TO 17

IL TESTO E’ CREATO CON I CAPITOLI DEI SEGUENTI LIBRI
BERNHEIM, WHINSTON, “Microeconomia”, 3/ED, MC GRAW HILL, 2020 – CAPITOLI DA 1 A 4 e da 6 a 8 (i capitoli sono gli stessi, se si fa riferimento alla 4a edizione del 2023)

ANTHONY, HAWKINS, MACRI’, MERCHANT, “SISTEMI DI CONTROLLO” 15/ED, MAC GRAW HILL, 2021 – CAPITOLI DA 1 A 5 E DA 14 A 17

Introduction to computer networks. The Iso-Osi reference model and layered network architectures. The IEEE 802 project: architecture, the MAC sublayer, the LLC sublayer; Ethernet and the IEEE 802.3 standard. The Wireshark traffic analyzer. Functions and technical characteristics of switches (bridges). Wi-Fi and the IEEE 802.11 standard. The data-link layer outside the LAN. The network layer and the IPv4, ARP and IPv6 protocols. Icmp, Icmpv6, ping and traceroute. The transport layer and the TCP and UDP protocols. The Domain Name System. The html language. URL and the HTTP protocol. The file transfer service.

SLIDES SUPPLIED BY THE PROFESSOR; THE STUDENTS MAY USE JAMES F. KUROSE, KEITH W. ROSS "INTERNET AND COMPUTER NETWORKS" PEARSON EDUCATION

- Introduction to Operating Systems
- Processor virtualization
- Memory virtualization
- Concurrent programming
- Storage virtualization

Remzi H. Arpaci-Dusseau and Andrea C. Arpaci-Dusseau, Operating Systems: Three Easy Pieces, https://pages.cs.wisc.edu/~remzi/OSTEP/

Database systems: general properties. Relational model. Relational algebra. SQL. Conceptual database design. Logical database design. Normalization-

P. Atzeni et al. Basi di dati 5/Ed. McGraw-Hill, 2018 (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/BDN/BDNindex.html

Software processes; Iterative and agile development.
Requirements; Use cases; User stories.
Object-oriented software analysis; Domain modeling; System operations; Operation contracts.
Object-oriented software design; Principles of software design; GRASP patterns; Use case realizations; Dynamic and static design; Design patterns; Layered architecture.
Software modeling; UML.

Craig Larman, APPLICARE UML E I PATTERN – ANALISI E PROGETTAZIONE ORIENTATA AGLI OGGETTI, PEARSON EDUCATION ITALIA, QUINTA EDIZIONE, 2020.
or
CRAIG LARMAN, APPLYING UML AND PATTERNS, PRENTICE HALL PTR, THIRD EDITION. 2004

Elements of set theory. Maps between sets: invective, surjective, bijective maps.
Elements of propositional logic, truth tables. Equivalence and order relations.
Combinatorics. Binomial coefficients and binomial theorem. Permutations. The Integers: divisibility, GCD and Euclidean algorithm, Bézout identity, linear congruences.
Baiscs of algebraic structures: permutation groups, abstract groups, polynomials and finite fields.
Elements of graph theory.Lattices and Boolean algebras

Giulia Maria Piacentini Cattaneo
Matematica discreta e applicazioni
Zanichelli 2008

Basics of set theory. Union, intersection, Cartesian product,
difference, complement. Set of parts of a finite whole, and its
cardinality.

Elements of logic: propositional calculus. Negation operations,
conjunction, disjunction, XOR, logical implication, double implication.
Truth tables. Logical equivalence. Tautologies and contradictions. hints
on predicates. Universal and existential quantifier.

Applications between sets. Domain, co-domain, image, counter-image.
Injective, surjective, bijective applications. Reverse application.
Operating product between applications. Identity. The set of applications
between two finite sets and its cardinality. Permutations.

Relations. Reflexive, symmetric, antisymmetric, transitive property:
order and equivalence relation. Examples of relationships. Partially together
ordered. Equivalence relations, equivalence classes, set
quotient.

Integers: divisibility and its properties. Division with the remainder. Maximum
common divider. Euclid's algorithm. Identity of Bézout, algorithm
extended Euclid's. Diophantine equations. Application of the algorithm
Euclid looking for integer solutions for the equation ax + by = c. Numbers
first. Fundamental theorem of arithmetic and Euclid's theorem.

Consistency form no. The set Z/nZ of the remainder classes modulo n. Sum and
multiplication in Z/nZ. Linear congruences. Condition for resolvability.
Description of the solutions of linear congruences. Congruence systems
and the Chinese remainder theorem. Invertible elements in Z/nZ. Euler's φ function.
Fermat's little theorem, Euler-Fermat theorem.

Combinatorics: Arrangements and combinations without repetitions, coefficients
binomials. Properties of binomial coefficients, Development of the binomial.
Arrangements and combinations with repetitions, Tartaglia triangle.

Partially ordered sets, Hasse diagrams. maximum and minimum,
maximal and minimal elements, higher and lower, upper and lower.
lattices. Properties of inf and sup in a lattice. Algebraic lattices. lattices
limited, complementary, distributive. Boolean algebras.

Piacentini Cattaneo, Matematica discreta. Zanichelli.
Delizia-Longobardi-Maj-Nicotera, Matematica Discreta, McGraw Hill.
Procesi-Rota, Elementi di algebra e matematica discreta. Accademica.

1. Linear equations and numbers
Systems of linear equations. Represent linear systems with matrix equations. Equivalent systems. Natural, integers, rational, real numbers and their properties. Pills of Graph Theory: subsets and set subtraction.

2. Matrixes and sets
Matrix with real coefficients. Square, triangular, diagonal matrixes. Transposed and symmetric matrix. Pills of Graph Theory: union and intersection.

3. Vector spaces and matrices
Matrix addition and scalar product and their properties.

4. Matrix product
Matrix product and its mathematical properties: associative and distributive. Example of how matrix product does not satisfy the commutative and simplification properties. Matrices and linear systems

5. Determinants
Formal definition of determinant and its properties. Transposed and triangular matrix determinants. Binet’s theorem.

6. Inverse of a matrix
Identity matrix. Inverse of a matrix and its properties. Cramer’s theorem.

7. Matrix rank
Definition and properties. Minor of a matrix.

8. System of linear equations.
Definition. Rouché-Capelli’s theorem. Rouché-Capelli’s method to solve a linear system.

9. Gaussian elimination and how to apply the Gaussian elimination
Elementary operation. Determinant and rank computations.

10. Geometric vectors
Vectors in 2 dimensions. Sum and scalar product of vectors. Vectors in 3 dimensions. Linear combination. Linear dependence and independence of vectors.

11. Vector spaces and Linear subspaces
Definition, examples and properties.

12. How to generate linear subspaces
Linear combination and generators.

13. Linear dependence and independence

14. Basis of a linear subspace
Basis. Dimensions. Solution set of an homogeneous system and its dimensions.

15. Vector subspaces sum and intersection
Grassmann formula.

16. Affine space
Lines in planes and space. Affine subspace.

17. Homomorphisms
Homomorphism between vector spaces. Represent an homomorphism as a matrix.

18. Image of a matrix
Properties of an homomorphism image and how to compute it. Surjective homomorphism.

19. Kernel of a matrix
Properties of an homomorphism kernel and how to compute it. Injectivity homomorphism.

20. Endomorphisms
Matrix representation of the endomorphisms. Change of basis.

21. Eigenvalues and Eigenvectors
Definition and properties. Eigenspaces. Characteristic polynomial. Diagonalizable matrix.

22. Diagonalizing a matrix
Rules and examples.

G. Accascina e V. Monti,
"Geometria"

Real numbers and functions, set theory, induction principle, infimum and supremum.
Sequences, definition of limit, operations with limits, comparison theorems, infinitives of increasing order.
Limits of function, continuity, link with the limits of sequences, theorems on continuous functions.
Derivatives, geometric meaning, theorems on differentiable functions, relative maximums and minimums, applications to the study of functions. Indefinite integrals, integration by parts and by substitution, definite integrals, fundamental theorem of integral calculus, improper integrals. Numerical series, simple and absolute convergence, convergence criteria.
Complex numbers.
Solution of linear differential equations and separable differential equations.

Bertsch, Dall'Aglio, Giacomelli - Epsilon 1, Primo corso di Analisi Matematica . McGraw Hill

Real numbers and functions, set theory, induction principle, infimum and supremum.
Sequences, definition of limit, operations with limits, comparison theorems, infinitives of increasing order.
Limits of function, continuity, link with the limits of sequences, theorems on continuous functions.
Derivatives, geometric meaning, theorems on differentiable functions, relative maximums and minimums, applications to the study of functions. Indefinite integrals, integration by parts and by substitution, definite integrals, fundamental theorem of integral calculus, improper integrals. Numerical series, simple and absolute convergence, convergence criteria. Complex numbers.

Bertsch, Dall'Aglio, Giacomelli - Epsilon 1, Primo corso di Analisi Matematica . McGraw Hill
Marcellini, Sbordone - Analisi matematica uno
Marcellini, Sbordone - Esercitazioni di matematica Volume 1 Parte 1, 2.

Real numbers and functions, set theory, induction principle, infimum and supremum. Sequences, definition of limit, operations with limits, comparison theorems, infinitives of increasing order. Limits of function, continuity, link with the limits of sequences, theorems on continuous functions. Derivatives, geometric meaning, theorems on differentiable functions, relative maximums and minimums, applications to the study of functions. Indefinite integrals, integration by parts and by substitution, definite integrals, fundamental theorem of integral calculus, improper integrals. Numerical series, simple and absolute convergence, convergence criteria. Complex numbers.

Theory:
Marcellini, Sbordone - Elementi di Analisi matematica 1. Bertsch, Dall'Aglio, Giacomelli - Epsilon 1, Primo corso di Analisi Matematica. McGraw Hill
S. Lang, A First Course in Calculus, Springer Ed.
L.Chierchia, Corso di Analisi - Prima parte, McGraw Hill (2019)

Exercises:
Bertsch, Dall'Aglio, Giacomelli - Epsilon 1, Primo corso di Analisi Matematica. McGraw Hill
Marcellini, Sbordone - Analisi matematica uno Marcellini, Sbordone - Esercitazioni di matematica Volume 1 Parte 1, 2.

COURSE PROGRAM

Computer operations and representation of information
-computer architecture
-operating systems
-binary arithmetic
-compilation and execution of programs

Algorithms
-program specification
-programming quality
-representation and algorithm design

Programming Fundamentals
-programming langauges
-variables
-Instructions
-types data
-Instructions structured
-style programming
-structure of the program
-functions

Software correctness
-testing methods
-debugging

Management of data sets
-arrays
-strings

Pointers and dynamic memory allocation
Data structures, struct, files
Recursion
Sorting and searching algorithms
Computational cost of programs
- Big O, Omega and Theta notations
- best, average, and worst case analysis
Data types: lists

Alessandro Bellini, Andrea Guidi
Linguaggio C - Quinta edizione
ISBN: 9788838668210- Autore: Kernighan, Ritchie
Titolo: Il linguaggio C. Principi di programmazione e manuale di riferimento
Editore: Pearson

COURSE PROGRAM (First part)

Computer operations and representation of information
-computer architecture
-operating systems
-binary arithmetic
-compilation and execution of programs

Algorithms
-program specification
-programming quality
-representation and algorithm design

Programming Fundamentals
-programming langauges
-variables
-Instructions
-types data
-Instructions structured
-style programming
-structure of the program
-functions

Software correctness
-testing methods
-debugging

Management of data sets
-arrays
-strings

COURSE PROGRAM (Second part)

Pointers and dynamic memory allocation
Data structures, struct, files
Recursion
Sorting and searching algorithms
Computational cost of programs
- Big O, Omega and Theta notations
- best, average, and worst case analysis
Abstract data types and related structures
- lists
- queues
- stacks

Author: Bellini, Guidi
Title: Linguaggio C - Una guida alla programmazione con elementi di Objective-C
Edition: 5-th edition
Editor: McGraw-hill
Year: 2013

Two-pole non-linear resistors: the diode. Nonlinear Circuit Linearization Example: Diode Linearization (Small-Signal Model)
Ideal diode and rectifier circuit. Zener diode. Stabilizer circuit with zener. The transistor: cut-off zone, saturation zone. The transient in the active zone: model for large signals. Small-signal model of an active-zone transistor. The transistor as current-driven short-circuit and open-circuit two-poles. Logic gates: NOT,AND, OR FLIP_FLOP SR. The operational amplifier AMP.OP.: Buffer, inverting, non-inverting, comparator, clock, Integrator, Derivator, Adder, Digital - Analog converter.

- Basic Electronics Circuits - K. Vasudevan - Springer Edition

Basics of Electricity and Magnetism. Maxwell's equations. From fields to circuits: limits and validity of circuit representation. Kirkhhoff's laws. Topological characteristics of the circuits. Series and parallel connections, nodes and links. Introduction to graph theory. Fundamental cuts and meshes. Incidence matrices. Conventions for generators and users. Electric power and passivity. Tellegen's theorem. Reciprocity. Bipole, multipole, port and multiport. Linearity, time-invariance, memory. Constitutive laws of passive two-poles R L C and of ideal voltage and current generators. Duality. Controlled generators, Magnetic Circuits, Hopkinson's Law, mutual inductances, gyrator, ideal and null transformer.
Analysis of networks without memory: general methods of nodes and meshes (loops), equivalent topological transformations and Thevenin's theorem. Maximum power transfer theorem. Ideal switches. Laplace transform for solving linear circuits with memory. Impedance, admittance and network functions in the Laplace domain. Methods of antitransformation of fractional rational functions. Extension to the Laplace domain of the methods for solving circuits. Transient and permanent response. Free and forced answer. Stability in circuits. Analysis of permanent regimes. Continuous circuits. Sinusoidal regime. Phasor method. Impedance, admittance and network functions in the frequency domain. Three-phase systems. Active, reactive and complex power. Comparison between Laplace domain and frequency domain. Resonant circuits. Notes on the harmonic regime and Fourier series. Filtering properties of ideal passive and active circuits. Main representations of balanced and unbalanced two-doors. Two-port interconnection.

- BASIC CIRCUIT THEORY BY CHARLES A. DESOER- ERNEST S. KUH

• Continuous and discrete signals and systems
Architecture of a communication system. Continuous and discrete signals: step and Dirac impulse signals, complex exponentials; elementary operations. Energy, power, periodicity of continuous and discrete signals; power of periodic signals. Linear, time-invariant, and causal systems. The impulse response. The Fourier series and its properties. Parseval theorem for periodic signals. The convolution and correlation of continue and discrete signals.

• Signals representation in the frequency domain
Fourier transform of continuous signals and its properties: linearity, time shift, frequency shift (modulation), product, duality, scale change, derivation, integration, convolution and correlation. Spectral energy density. Spectrum of periodic signals. Sampling theorem. Aliasing, energy and power of sampled signals. Reconstruction approaches of sampled signals. Fourier transform of discrete signals and its properties.

• Random signals
Basic concepts. Frequentist and axiomatic description. Continuous and discrete random variables. Cumulative distribution function, probability density (mass) function, characteristic function. Independent random variables. Joint, marginal and conditional probability density functions. Law of total probability. Bayes’ theorem. Gaussian, uniform, binomial, one-sides exponential statistics. Statistical moments of random variables: mean (expected value), variance, root mean square and their relations. Uncorrelated and statistically independent random variables. Functions of random variables and their probability density functions. Probability density function of the sum and the linear combination of independent random variables. Random processes and their statistics. Correlation and covariance. Stationary and ergodic processes. The harmonic process. The additive white Gaussian noise (AWGN). Random process through a system.

• Information theory and source coding
Basics of the information theory, self-information and entropy. Quantization. First Shannon theorem. Huffman coding.

• Baseband digital transmission
Binary and multi-level line encoding. Pulse amplitude modulation (PAM) and pulse coded modulation (PCM). Inter-symbol interference (ISI) and Nyquist theorem, Nyquist pulses. Noise and error probability in binary and multilevel PAM transmission. Matched filter and corresponding error probability.

• Passband digital transmission
Amplitude shift keying (ASK), quadrature amplitude modulation (QAM) and phase shift keying (PSK). Transmitter and receiver scheme. Constellations and distance between symbols. Symbol energy.

• Channel capacity and encoding
Second Shannon theorem. Channel capacity and encoding. Hard decoding and Hamming distance.

Claudio Prati, "Segnali e Sistemi per le Telecomunicazioni", seconda edizione, McGraw-Hill, 2010.

Discrete event simulation, a fundamental methodology for evaluating the performance of complex systems (computational, telecommunications, traffic, etc.)

The topics covered can be grouped into the following three phases:
- Construction of a model of a real system:
- "Execution" of a simulation model
- Analysis of simulation results:

Teacher's material uploaded to the teams

PART 1: Generalities and tools.
Definitions of computational problem, algorithm, data structure.
Random Access Machine and pseudocode.
Asymptotic study of functions (big-O, Omega, and Theta notations).
Asymptotic complexity of algorithms and problems.
Ammortized complexity.
Worst/average/best case analysis.
Recursion and recursion equalities.
Theorems for the analysis of recursion equalities.

PART 2: Abstract data types.
Abstract data types and their representations.
Already known examples: sets, stacks, queues, lists, etc.
Management of dynamic data structures.
Trees: binary trees; arbitrary degree trees; traversals of trees; binary search trees; red-black trees.
Hash tables.
Graphs: representations with adjacency matrix and adjacency lists. DFS and BFS. Graphs and connectivity. Connected components. Minimum-lengths paths.

PART 3: Algorithmic paradigms.
Greedy algorithms (example: selection sort).
Iterative algorithms (example: insertion sort).
Divide et impera algorithms (examples: merge-sort and quick-sort).

PART 4: The course requires (and sometimes recalls) the following notions of C Language.
Imperative programming.
Elementary data types.
Functions.
Arrays and pointers.
Strings.
Memory management: Heap and Stack.
Management of C projects: prototypes and implementations.
Recursion and memory.
Records and pointers.
Dynamic memory management.

Slides provided by the teacher and downloadable day by day from the course website: https://moodle1.ing.uniroma3.it/
In order to download the slides the usual userid-password pair of Roma Tre University is sufficient.

The course is a first level one in automatic control and provides methodological and practical knowledge about:
-Modelling, Simulating and analyze the behavior of physical systems, in particular those that are linear and time invariant;
-Basic concepts on the system dynamics, as stability, transient response and forced one;
-Frequency based design of feedback control systems;
-Digital implementations of linear controllers;
-Use of mainstream software tools to aid in the previous activities.

S. K. Bhattacharya, Control Systems Engineering, Pearson, 2008. [Kindle Edition]

Franklin, Powell, and Enami-Naeini, Feedback Control of Dynamical Systems, 5th Edition, Addison-Wesley, 2006. ISBN: 978-0136019695;

- Introduction to Computer Architecture
- Binary representation of numbers
- The general organization of a computer
- Digital circuits of a computer
- Bus and communication protocols
- The microarchitecture of a computer
- Programming in Assembler

A.S. Tanenbaum, T. Austin. Structured Computer Organization, 6th edition, Prentice Hall
Slides shown in class by the teacher and made available on the Moodle channel of the course

Object Oriented Programming Paradigm
Classes and Objects
Code Quality
Polymorphism
Collections
Generics
Inheritance
Code reuse
Stream
Java Thread

Ken Arnold, James Gosling, David Holmes "Il linguaggio Java: Manuale Ufficiale" - Addison Wesley
Cay Horstmann "Concetti di informatica e fondamenti di Java" - APOGEO
Cay Horstmann, Gary Cornell "Core Java2 Vol I: Fondamenti" - Prentice Hall
Cay Horstmann, Gary Cornell "Core Java2 Vol II: Tecniche avanzate" - Prentice Hall

Introduction to Operations Research:
Formulations, the 5-step method
Preliminaries on Linear Algebra

Formulation of typical optimization problems:
Mixing
Allocating resources
Inventory management
Optimal cut
Assignment
Task planning
Other formulations

Solving Linear Programming problems:
Linear programming geometry
Simplex algorithm
Fourier–Motzkin algorithm
Geometric interpretation of the simplex

Duality theory:
Construction of the dual problem
Fundamental PL theorem
Conditions of complementarity
Economic interpretation of the dual
Sensitivity analysis

Graph optimization:
Maximum flow
Shortest path
Minimum spanning tree

Caramia, Giordani, Guerriero, Musmanno, Pacciarelli, "Ricerca Operativa", Isedi, Italia, 2014.

Introduction to Operations Research:
Formulations, the 5-step method
Preliminaries on Linear Algebra

Formulation of typical optimization problems:
Mixing
Allocating resources
Inventory management
Optimal cut
Assignment
Task planning
Other formulations

Solving Linear Programming problems:
Linear programming geometry
Simplex algorithm
Fourier–Motzkin algorithm
Geometric interpretation of the simplex

Duality theory:
Construction of the dual problem
Fundamental PL theorem
Conditions of complementarity
Economic interpretation of the dual
Sensitivity analysis

Graph optimization:
Maximum flow
Shortest path
Minimum spanning tree

Caramia, Giordani, Guerriero, Musmanno, Pacciarelli, "Ricerca Operativa", Isedi, Italia, 2014.

Contents:
Learning unit: Elements of economic analysis
- Consumer and producer behaviour: the problem of optimal consumer choice subject to the budget constraint, elasticity of demand
- Production decisions (short- and long-run): technology and production function, returns to scale
- Production costs: average and marginal costs; fixed and variable production costs.

Learning unit: The nature of accounting systems - management accounting
- The nature of management accounting
- The classification of costs according to their behaviour
- Full costs and their use: Direct costs and indirect costs; Comparison of direct costs and variable costs; Special costs and common costs versus direct costs and indirect costs; Cost flow diagrams; Life Cycle Costing;
- Job-order and process-based costing systems; The recognition of direct costs (labour and materials); The problem of indirect cost allocation; Cost centres; Overhead cost allocation coefficients;
- Activity-based costing: Activity Based Costing (outline)



Learning unit: The decision-making and control processes of enterprises: Methodologies for analysing investment projects
- Present value and opportunity cost of capital; The net present value rule; Valuation of long-term assets; Perpetual and annuity annuities; Compound interest and present value; Nominal and real interest rates;
- Criteria for choosing alternative investments to Net Present Value: Payback Time; Internal Rate of Return
- Investment decisions using the NPV method: Estimating cash flows and interaction between projects; Annual equivalent costs

Reference Text:
"ECONOMICS APPLIED TO ENGINEERING", EDITION 2022 - "CREATE" BOOK SPECIFIC TO THE COURSE HELD AT THE ENGINEERING DEPARTMENT, FROM THE MC GRAW HILL PUBLISHING HOUSE - AVAILABLE IN SOME COPIES AT THE "EFESTO" BOOKSTORE AND AT ONLINE BOOKSTORE SITES

THE DIGITAL VERSION CAN BE PURCHASED ON THE MCGRAW-HILL WEBSITE https://www.mheducation.com/highered/custom, SELECTING ITALY AS THE COUNTRY AND ENTERING THE ISBN CODE 9781307851151



THE TEXT IS CREATED WITH CHAPTERS FROM THE FOLLOWING BOOKS
BERNHEIM, WHINSTON, "MICROECONOMICS", 3/ED, MC GRAW HILL, 2020 - CHAPTERS 1 TO 4 and 6 TO 8 (chapters are the same if you refer to the 4th edition of 2023)

ANTHONY, HAWKINS, MACRI, MERCHANT, "CONTROL SYSTEMS" 15/ED, MAC GRAW HILL, 2021 - CHAPTERS 1 TO 5 AND 14 TO 17

IL TESTO E’ CREATO CON I CAPITOLI DEI SEGUENTI LIBRI
BERNHEIM, WHINSTON, “Microeconomia”, 3/ED, MC GRAW HILL, 2020 – CAPITOLI DA 1 A 4 e da 6 a 8 (i capitoli sono gli stessi, se si fa riferimento alla 4a edizione del 2023)

ANTHONY, HAWKINS, MACRI’, MERCHANT, “SISTEMI DI CONTROLLO” 15/ED, MAC GRAW HILL, 2021 – CAPITOLI DA 1 A 5 E DA 14 A 17

Introduction to computer networks. The Iso-Osi reference model and layered network architectures. The IEEE 802 project: architecture, the MAC sublayer, the LLC sublayer; Ethernet and the IEEE 802.3 standard. The Wireshark traffic analyzer. Functions and technical characteristics of switches (bridges). Wi-Fi and the IEEE 802.11 standard. The data-link layer outside the LAN. The network layer and the IPv4, ARP and IPv6 protocols. Icmp, Icmpv6, ping and traceroute. The transport layer and the TCP and UDP protocols. The Domain Name System. The html language. URL and the HTTP protocol. The file transfer service.

SLIDES SUPPLIED BY THE PROFESSOR; THE STUDENTS MAY USE JAMES F. KUROSE, KEITH W. ROSS "INTERNET AND COMPUTER NETWORKS" PEARSON EDUCATION

1. INTRODUCTION
1.1. Historical background
1.2. Current Scenario and trends
1.3. Some basics of organizational theory
1.4. Project definition and properties
1.5. Project Management
1.6. Project Management Body of Knowledge

2. PROJECT LIFE CYCLE
2.1. Project Life Cycle concept
2.2. Project Life Cycle phases
2.3. Project planning
2.4. The Projects Planning & Control cycle and tools

3. LOGICAL PROJECT PLANNING
3.1. Work Breakdown Structure
3.2. Elementary tasks
3.3. Work Package Description
3.4. Responsibility Matrix

4. TECHNICAL SPECIFICATION AND CONTROL
4.1. Specifying
4.2. Technical control (Design Reviews, Tests and Audits)

5. TIME/RESOURCES PLANNING & CONTROL
5.1. Milestones
5.2. Bar Charts
5.3. Activity networks
5.4. Scheduling

6. COST PLANNING & CONTROL
6.1. Project budgeting process
6.2. Cost estimating
6.3. Project account opening process and spending authorization
6.4. Forecast of Project spending vs time (C-S CSC concept)
6.5. Earned Value
6.6. Indexes
6.7. Cost at Completion forecast
6.8. Allocated founds vs commitments

7. RISK MANAGEMENT BASICS
7.1. Risk Identification
7.2. Risk Evaluation
7.3. Risk contrast and planning
7.4. Risk Control
7.3. Decision trees
8. REPORTING
8.1. Project progress
8.2. Completion indexes
8.3. Progress meetings and reports

9. TECHNICAL DOCUMENTATION
9.1. Technical Documentation System Structure
9.2. Technical documents
9.3. Configuration Control

10.ORGANIZATIONAL AND BEHAVIORAL ISSUES
10.1. The Project Office
10.2. The Project Manager Role and skills
10.3. Team behavior, leadership types and characteristics

• INTERPERSONAL COMMUNICATION BASICS (optional)

Dispense a cura del docente
Stefano Protto “Concetti e strumenti di Project Management” II ed. 2006 Franco Angeli

Corso: Gestione dei Progetti
SSD: MAT/09
Professore: dott. Alessio Paccariè

THE ENVIRONMENT IN WHICH PROJECTS OPERATE The importance of project management in the business context Relationship between Project, Program, Portfolio and Operations Management Customization and Tailoring Environmental and business factors EEFs internal and external to the organization Types of organizational structures

THE ROLE OF THE PROJECT MANAGER Definitions and sphere of influence Skills and job profile


SCOPE MANAGEMENT
The Project Charter The WBS and RACI The flowcharts.


TIME MGT
Activities: duration, responsibilities and constraints
GANTT


COST MGT
Estimate costs Determine budget and reserves


QUALITY MGT
Requirements and criteria Testing and non-quality


COMMUNICATION MGT
The role of communication Formal, informal, written and oral communication.

RISK MGT
Identify and assess risks Plan responses to risks

STAKEHOLDER MGT
Identify stakeholders Complexity in management: interest/power matrix Management strategy

MANUAL FOR THE COURSE (OPZ)
Guida al Project Management Body of Knowledge ver. 6 (ENG)

(Opz) PMBoK ITA or ENG, ver 6.0 and later.
Course slides

Decision making process. Introduction to Integer Linear Programming (ILP): relation between ILP and LP, equivalent formulations, relaxations, totally unimodular matrices, standard techniques for ILP modelling. 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.

[1] M. FISCHETTI, "LEZIONI DI RICERCA OPERATIVA", EDIZIONI LIBRERIA PROGETTO PADOVA, ITALIA, 1995. (CAP. 2, 5, PARTE DEL 6 E DEL 7).
[2] R. AHUJA, T. MAGNANTI, J. ORLIN, "NETWORK FLOWS", PRENTICE HALL, 1993. (PG. 189-191, 473-475, 494-496)
[3] Lecture notes

Introduction to Digital Control System
-Discrete time system representation
-Mathematical modelling of sampling process
-Data reconstruction
Modeling discrete time systems
-Pulse transfer function
-Mapping of s-plane to z-plane
Stability analysis of discrete time system
-Routh Hourwitz stability test
-Jury stability test
Time response of discrete systems
-Transient and steady state responses
-Time response parameters of a prototype second order system
Design of sampled data control systems
-Bode plot
-Steady state compensator
-Discretization of Continuous Controllers
-Difference Approximations
-Impulse/Step Discretization
-Zero-Pole Matching
-Compensator design in w domain
PID controllers
-PID actions
-System identification
-PID parameters tuning
Quantization errors
Introduction to microcontroller: the Arduino board

Charles L. Phillips, Troy Nagle, Aranya Chakrabortty, "Digital Control System Analysis & Design", Pearson Education,2014

Recalls on integrated manufacturing (CIM). Control networks and field networks. Supervisory control and data acquisition systems for industrial processes (SCADA). PLC programming using Instruction List, Function Block Diagram, Ladder Diagram, Sequential Function Chart and Structured Text. Sensors for industrial applications. Motion control. Safety as in safety and security. Field networks, requirements and capabilities: HART, Foundation Fieldbus, Profibus, Profinet, Modbus, CANbus, industrial ethernet and industrial wireless. Networks for supervisory control, requirements and capabilities: IEC 60870 DNP3 IEC 61850. Possible developments and problems in the industrial world.

Pasquale Chiacchio, Francesco Basile “Tecnologie informatiche per l’automazione,” seconda edizione, McGraw-Hill Libri Italia, 2004.
C. Bonivento, L. Gentile, A. Paoli, “Sistemi di automazione industriale: architetture e controllo”. McGraw-Hill, 2011
Stefano Bimbo, Enrico Colaiacovo, Sistemi SCADA, Supervisory Control and Data Acquisition Apogeo, 2006
G. Marro, Controlli Automatici, Zanichelli