Numerical sets (N, Z, Q and R), R assiomatic construction of R by upper extremity, Archimede properties, Q in R density, N construction and induction principle, Newton binomial and combinatorial calculus, Inequality of Bernoulli; Topology elements in R (isolated and accumulated points, open / closed sets and characterization, closure of a set) and Bolzano-Weierstrass theorem; Complex numbers, polar representation and n-th roots of the unit; Real functions of real variable, domain, co-domain, and inverse functions; Function and property limits, monotone function limits; Succession limits, significant limits, Nepero number, bridge theorem, limsup / liminf, sequences and topology, compact sets, and characterization; Continuous functions and their properties, continuity of elementary functions, types of discontinuities and monotone functions, fundamental theorems on continuous functions (zeros, intermediate values, Weierstrass); Function and function derivative, elementary function derivatives, fundamental theorems of differential calculus (Fermat, Rolle, Cauchy, Lagrange, de Hopital, Taylor's formula), monotony and derivative sign, local degradation maxima / minima, convex functions / concave; Function graph; Integration according to Riemann and property, integrability of continuous functions, primitive elementary functions, I and II fundamental theorem of integral calculation, integration for substitution and parts, rational functions, some special replacements; Numerical series and convergence, geometric series, convergence criteria for positive terms series (comparison, asymptotic comparison, root, ratio, condensation) and for series at any time (absolute convergence, Leibnitz); Taylor series developments, developments of some elementary functions; Improper integrals.

A. Laforgia, Calcolo differenziale e integrale, Ed. Accademica;
P. Marcellini e C. Sbordone, Esercizi di Matematica, Vol. 1, tomi 1--4, Ed. Liguori;

Numerical sets (N, Z, Q and R), R assiomatic construction of R by upper extremity, Archimede properties, Q in R density, N construction and induction principle, Newton binomial and combinatorial calculus, Inequality of Bernoulli; Topology elements in R (isolated and accumulated points, open / closed sets and characterization, closure of a set) and Bolzano-Weierstrass theorem; Complex numbers, polar representation and n-th roots of the unit; Real functions of real variable, domain, co-domain, and inverse functions; Function and property limits, monotone function limits; Succession limits, significant limits, Nepero number, bridge theorem, limsup / liminf, sequences and topology, compact sets, and characterization; Continuous functions and their properties, continuity of elementary functions, types of discontinuities and monotone functions, fundamental theorems on continuous functions (zeros, intermediate values, Weierstrass); Function and function derivative, elementary function derivatives, fundamental theorems of differential calculus (Fermat, Rolle, Cauchy, Lagrange, de Hopital, Taylor's formula), monotony and derivative sign, local degradation maxima / minima, convex functions / concave; Function graph; Integration according to Riemann and property, integrability of continuous functions, primitive elementary functions, I and II fundamental theorem of integral calculation, integration for substitution and parts, rational functions, some special replacements; Numerical series and convergence, geometric series, convergence criteria for positive terms series (comparison, asymptotic comparison, root, ratio, condensation) and for series at any time (absolute convergence, Leibnitz); Taylor series developments, developments of some elementary functions; Improper integrals.

A. Laforgia, Calcolo differenziale e integrale, Ed. Accademica;
P. Marcellini e C. Sbordone, Esercizi di Matematica, Vol. 1, tomi 1--4, Ed. Liguori;

Number sets (N, Z, Q and R), axiomatic construction of R via supremum, Archimedean property, density of Q in R, construction of N in R and the inductive method, binomial formula and combinatorial calculus, real powers, the Bernoulli inequality; topological concepts in R (accumulation and isolated points, open/closed sets and characterization, closure of a set) and Bolzano-Weierstrass theorem; complex numbers, polar representation and n-roots of unity; real functions with a real variable, domain, image and inverse functions; limits for functions and properties, limits of monotone functions; limits for sequences, special limits, the Napier number, the bridge theorem,
limsup/liminf, sequences and topology, compact sets and characterization; continuous functions and their properties, continuity of elementary functions, types of discontinuities and monotone functions, fundamental theorems on continuous functions (zeroes, intermediate values, Weierstrass); derivative of a function and properties, derivatives of elementary functions, the fundamental theorems of differential calculus (Fermat, Rolle, Cauchy, Lagrange, de l'Hopital, Taylor's formula), monotonicity and sign of the derivative, degenerate local maxima/minima, convex/concave functions; graph of a function; Riemann integration and properties, integrability of continuous functions, primitives for elementary functions, I and II fundamental theorems of integral calculus, change of variables and integration by parts, rational functions, some special change of variables; numerical series and convergence, geometric series, convergence criteria for positive series (comparison, asymptotic comparison, n-th root, ratio, condensation) and for general series (absolute convergence, Leibniz); Taylor series, series of some elementary functions; improper integrals.

"Analisi Matematica 1", M. Bramanti, C.D. Pagani, S. Salsa, editore Zanichelli
"Analisi Matematica 1", C.D. Pagani, S. Salsa, editore Zanichelli
"Analisi Matematica 1", E. Giusti, editore Bollati Boringhieri
"Funzioni Algebriche e Trascendenti", B. Palumbo, M.C. Signorino, editore Accademica
"Analisi Matematica", M. Bertsch, R. Dal Passo, L. Giacomelli, editore MCGraw-Hill
"Esercizi di Analisi Matematica", S. Salsa, A. Squellati, editore Zanichelli
"Esercitazioni di Matematica: vol. 1.1 e 1.2", P. Marcellini, C. Sbordone, editore Liguori
"Esercizi e complementi di Analisi Matematica: vol. 1", E. Giusti, editore Bollati Boringhieri

Numerical sets (N, Z, Q and R), R assiomatic construction of R by upper extremity, Archimede properties, Q in R density, N construction and induction principle, Newton binomial and combinatorial calculus, Inequality of Bernoulli; Topology elements in R (isolated and accumulated points, open / closed sets and characterization, closure of a set) and Bolzano-Weierstrass theorem; Complex numbers, polar representation and n-th roots of the unit; Real functions of real variable, domain, co-domain, and inverse functions; Function and property limits, monotone function limits; Succession limits, significant limits, Nepero number, bridge theorem, limsup / liminf, sequences and topology, compact sets, and characterization; Continuous functions and their properties, continuity of elementary functions, types of discontinuities and monotone functions, fundamental theorems on continuous functions (zeros, intermediate values, Weierstrass); Function and function derivative, elementary function derivatives, fundamental theorems of differential calculus (Fermat, Rolle, Cauchy, Lagrange, de Hopital, Taylor's formula), monotony and derivative sign, local degradation maxima / minima, convex functions / concave; Function graph; Integration according to Riemann and property, integrability of continuous functions, primitive elementary functions, I and II fundamental theorem of integral calculation, integration for substitution and parts, rational functions, some special replacements; Numerical series and convergence, geometric series, convergence criteria for positive terms series (comparison, asymptotic comparison, root, ratio, condensation) and for series at any time (absolute convergence, Leibnitz); Taylor series developments, developments of some elementary functions; Improper integrals.

A. Laforgia, Calcolo differenziale e integrale, Ed. Accademica;
P. Marcellini e C. Sbordone, Esercizi di Matematica, Vol. 1, tomi 1--4, Ed. Liguori;

Numerical sets (N, Z, Q and R), R assiomatic construction of R by upper extremity, Archimede properties, Q in R density, N construction and induction principle, Newton binomial and combinatorial calculus, Inequality of Bernoulli; Topology elements in R (isolated and accumulated points, open / closed sets and characterization, closure of a set) and Bolzano-Weierstrass theorem; Complex numbers, polar representation and n-th roots of the unit; Real functions of real variable, domain, co-domain, and inverse functions; Function and property limits, monotone function limits; Succession limits, significant limits, Nepero number, bridge theorem, limsup / liminf, sequences and topology, compact sets, and characterization; Continuous functions and their properties, continuity of elementary functions, types of discontinuities and monotone functions, fundamental theorems on continuous functions (zeros, intermediate values, Weierstrass); Function and function derivative, elementary function derivatives, fundamental theorems of differential calculus (Fermat, Rolle, Cauchy, Lagrange, de Hopital, Taylor's formula), monotony and derivative sign, local degradation maxima / minima, convex functions / concave; Function graph; Integration according to Riemann and property, integrability of continuous functions, primitive elementary functions, I and II fundamental theorem of integral calculation, integration for substitution and parts, rational functions, some special replacements; Numerical series and convergence, geometric series, convergence criteria for positive terms series (comparison, asymptotic comparison, root, ratio, condensation) and for series at any time (absolute convergence, Leibnitz); Taylor series developments, developments of some elementary functions; Improper integrals.

A. Laforgia, Calcolo differenziale e integrale, Ed. Accademica;
P. Marcellini e C. Sbordone, Esercizi di Matematica, Vol. 1, tomi 1--4, Ed. Liguori;

Numerical sets (N, Z, Q and R), R assiomatic construction of R by upper extremity, Archimede properties, Q in R density, N construction and induction principle, Newton binomial and combinatorial calculus, Inequality of Bernoulli; Topology elements in R (isolated and accumulated points, open / closed sets and characterization, closure of a set) and Bolzano-Weierstrass theorem; Complex numbers, polar representation and n-th roots of the unit; Real functions of real variable, domain, co-domain, and inverse functions; Function and property limits, monotone function limits; Succession limits, significant limits, Nepero number, bridge theorem, limsup / liminf, sequences and topology, compact sets, and characterization; Continuous functions and their properties, continuity of elementary functions, types of discontinuities and monotone functions, fundamental theorems on continuous functions (zeros, intermediate values, Weierstrass); Function and function derivative, elementary function derivatives, fundamental theorems of differential calculus (Fermat, Rolle, Cauchy, Lagrange, de Hopital, Taylor's formula), monotony and derivative sign, local degradation maxima / minima, convex functions / concave; Function graph; Integration according to Riemann and property, integrability of continuous functions, primitive elementary functions, I and II fundamental theorem of integral calculation, integration for substitution and parts, rational functions, some special replacements; Numerical series and convergence, geometric series, convergence criteria for positive terms series (comparison, asymptotic comparison, root, ratio, condensation) and for series at any time (absolute convergence, Leibnitz); Taylor series developments, developments of some elementary functions; Improper integrals.

A. Laforgia, Calcolo differenziale e integrale, Ed. Accademica;
P. Marcellini e C. Sbordone, Esercizi di Matematica, Vol. 1, tomi 1--4, Ed. Liguori;

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

Sets. Operations between sets. Applications between sets. Permutations. Relations. Equivalence relations. Order relations. Lattices. Algebraic structures. Group of permutations of n elements. Vector spaces. Linear dependence and independence of vectors. Basis. Dimension. Subspaces. Subspace sum. Subspace intersection. Grassmann’s relation. Matrices. Determinants. Inverse matrix. Reduction of a matrix into treads. The rank of a matrix. Linear systems. Theorem of Rouche-Capelli. Cramer's theorem. Method of Gaussian elimination.

F.J. Leon Trujillo, P. Mercuri. Elementi di Algebra Lineare, Ed. Efesto
F.J. Leon Trujillo, P. Mercuri. Elementi di Geometria Affine ed Euclidea, Ed. Efesto
F.J. Leon Trujillo. Esercizi di Algebra Lineare e Geometria, Ed. Efesto

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

Linear applications. Kernel. Image. Linear maps and linear dependence. Linear maps and matrices. Change of basis. Similar matrices. Diagonalization of an endomorphism. Eigenvalues. Eigenvectors. Eigenspaces. Characteristic polynomial. Scalar products. Euclidean vector spaces. Diagonalization of symmetric endomorphisms. Elements of affine and Euclidean geometry of the plane and space.

F.J. Leon Trujillo, P. Mercuri. Elementi di Algebra Lineare, Ed. Efesto
F.J. Leon Trujillo, P. Mercuri. Elementi di Geometria Affine ed Euclidea, Ed. Efesto
F.J. Leon Trujillo. Esercizi di Algebra Lineare e Geometria, Ed. Efesto

Atom Structure: orbitals, poly-electron atoms, periodic table; covalent bond, delocalized bond.
Mass relationship in chemical reactions; redox and oxidation number.
Solids: metallic crystal, ionic crystal, molecular crystal, covalent crystal.
Gases: the ideal gas law, partial pressures.
Thermodynamics: nature and type of energy, the zero law of T.D., heat capacity, the first law of TD and Enthalphy, the second law of TD, entropy and free energy, equilibrium conditions.
Liquids: phase change, phase diagrams.
Chemical equilibrium: the equilibrium constant and the equilibrium law
Properties of liquid solutions: concentration units, the Raoult law and distillation, colligatives properties and freezing diagram, electrolytes.
Solutions of strong and weak electrolytes. Acids and bases, pH; Salt hydrolysis; buffer solutions.
Elettrochemistry

Appunti delle lezioni
o Depaoli - Chimica Generale ed Inorganica - Ed. Ambrosiana
o Silvestroni, Rallo - Problemi di Chimica Generale - Ed. Masson
o Palmisano, Schiavello – Fondamenti di Chimica - EDISES

Atom Structure: orbitals, poly-electron atoms, periodic table; covalent bond, delocalized bond.
Mass relationship in chemical reactions; redox and oxidation number.
Solids: metallic crystal, ionic crystal, molecular crystal, covalent crystal.
Gases: the ideal gas law, partial pressures.
Thermodynamics: nature and type of energy, the zero law of T.D., heat capacity, the first law of TD and Enthalphy, the second law of TD, entropy and free energy, equilibrium conditions.
Liquids: phase change, phase diagrams.
Chemical equilibrium: the equilibrium constant and the equilibrium law
Properties of liquid solutions: concentration units, the Raoult law and distillation, colligatives properties and freezing diagram, electrolytes.
Solutions of strong and weak electrolytes. Acids and bases, pH; Salt hydrolysis; buffer solutions.
Elettrochemistry

Appunti delle lezioni
o Depaoli - Chimica Generale ed Inorganica - Ed. Ambrosiana
o Silvestroni, Rallo - Problemi di Chimica Generale - Ed. Masson
o Palmisano, Schiavello – Fondamenti di Chimica - EDISES

Atom Structure: orbitals, poly-electron atoms, periodic table; covalent bond, delocalized bond.
Mass relationship in chemical reactions; redox and oxidation number.
Solids: metallic crystal, ionic crystal, molecular crystal, covalent crystal.
Gases: the ideal gas law, partial pressures.
Thermodynamics: nature and type of energy, the zero law of T.D., heat capacity, the first law of TD and Enthalphy, the second law of TD, entropy and free energy, equilibrium conditions.
Liquids: phase change, phase diagrams.
Chemical equilibrium: the equilibrium constant and the equilibrium law
Properties of liquid solutions: concentration units, the Raoult law and distillation, colligatives properties and freezing diagram, electrolytes.
Solutions of strong and weak electrolytes. Acids and bases, pH; Salt hydrolysis; buffer solutions.
Elettrochemistry

Appunti delle lezioni
o Depaoli - Chimica Generale ed Inorganica - Ed. Ambrosiana
o Silvestroni, Rallo - Problemi di Chimica Generale - Ed. Masson
o Palmisano, Schiavello – Fondamenti di Chimica - EDISES

Atom Structure: orbitals, poly-electron atoms, periodic table; covalent bond, delocalized bond.
Mass relationship in chemical reactions; redox and oxidation number.
Solids: metallic crystal, ionic crystal, molecular crystal, covalent crystal.
Gases: the ideal gas law, partial pressures.
Thermodynamics: nature and type of energy, the zero law of T.D., heat capacity, the first law of TD and Enthalphy, the second law of TD, entropy and free energy, equilibrium conditions.
Liquids: phase change, phase diagrams.
Chemical equilibrium: the equilibrium constant and the equilibrium law
Properties of liquid solutions: concentration units, the Raoult law and distillation, colligatives properties and freezing diagram, electrolytes.
Solutions of strong and weak electrolytes. Acids and bases, pH; Salt hydrolysis; buffer solutions.
Elettrochemistry

Appunti delle lezioni
o Depaoli - Chimica Generale ed Inorganica - Ed. Ambrosiana
o Silvestroni, Rallo - Problemi di Chimica Generale - Ed. Masson
o Palmisano, Schiavello – Fondamenti di Chimica - EDISES

COURSE PROGRAM (First semester)

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 semester)

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

Alessandro Bellini, Andrea Guidi
Linguaggio C - 5-th edition
ISBN: 9788838668210

COURSE PROGRAM (First semester)

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 semester)

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

From fields to circuits
Kirchhoff's circuit laws
Voltage and Current
Two-pole circuit
Electric Power
Passive, linear and time-independent circuit elements
Circuit elements with memory
Series and parallel circuit elements
Active circuit elements: voltage and current ideal sources (independent or controlled)
Passive circuit elements: resistor, capacitor and inductor
Series and parallel resistor
Equivalent models
Norton e Thevenin models
Brief notes of graph theory
Tableau method for the general analisys of electric circuits
Nodal analysis
Mesh analysis
Superposition principle
Thevenin's theorem
Steady and transient states
Steady state with sinusoidal signals
Frequency-domain analysis
Active, reactive, and apparent power
Three-phase electric systems
Balanced three-phase sources and loads
Three Phase Power
Measurement of Three Phase Power
Aron's insertion
Power factor correction

Charles K. Alexander e Matthew N.O. Sadiku "Circuiti elettrici", McGraw-Hill Education

Antonino Laudano, Francesco Riganti Fulginei, "Quaderno di appunti di elettrotecnica. Esercizi sui circuiti elettrici", Pigreco Edizioni

Non linear resistors: diode
small-signal model of a diode
Full-wave rectifier
Zener diode
Voltage stabilizer with zener diode
Transistor
small-signal model of a transistor
Transistor as a short-circuit or open-circuit
Logic gates: NOT,AND, OR
FLIP FLOP SR
Operational amplifier (OP.AMP.)
OP.AMP. Buffer
OP.AMP. Inverting
OP.AMP. Non Inverting
OP.AMP. Comparator
OP.AMP. Clock
OP.AMP. Integrator
OP.AMP. Differentiator
OP.AMP. Summing
Digital to Analog converter

Charles K. Alexander e Matthew N.O. Sadiku "Circuiti elettrici", McGraw-Hill Education

Antonino Laudano, Francesco Riganti Fulginei, "Quaderno di appunti di elettrotecnica. Esercizi sui circuiti elettrici", Pigreco Edizioni

From fields to circuits
Kirchhoff's circuit laws
Voltage and Current
Two-pole circuit
Electric Power
Passive, linear and time-independent circuit elements
Circuit elements with memory
Series and parallel circuit elements
Active circuit elements: voltage and current ideal sources (independent or controlled)
Passive circuit elements: resistor, capacitor and inductor
Series and parallel resistor
Equivalent models
Norton e Thevenin models
Brief notes of graph theory
Tableau method for the general analisys of electric circuits
Nodal analysis
Mesh analysis
Superposition principle
Thevenin's theorem
Steady and transient states
Steady state with sinusoidal signals
Frequency-domain analysis
Active, reactive, and apparent power
Three-phase electric systems
Balanced three-phase sources and loads
Three Phase Power
Measurement of Three Phase Power
Aron's insertion
Power factor correction

Charles K. Alexander e Matthew N.O. Sadiku "Circuiti elettrici", McGraw-Hill Education

Antonino Laudano, Francesco Riganti Fulginei, "Quaderno di appunti di elettrotecnica. Esercizi sui circuiti elettrici", Pigreco Edizioni

From fields to circuits
Kirchhoff's circuit laws
Voltage and Current
Two-pole circuit
Electric Power
Passive, linear and time-independent circuit elements
Circuit elements with memory
Series and parallel circuit elements
Active circuit elements: voltage and current ideal sources (independent or controlled)
Passive circuit elements: resistor, capacitor and inductor
Series and parallel resistor
Equivalent models
Norton e Thevenin models
Brief notes of graph theory
Tableau method for the general analisys of electric circuits
Nodal analysis
Mesh analysis
Superposition principle
Thevenin's theorem
Steady and transient states
Steady state with sinusoidal signals
Frequency-domain analysis
Active, reactive, and apparent power
Three-phase electric systems
Balanced three-phase sources and loads
Three Phase Power
Measurement of Three Phase Power
Aron's insertion
Power factor correction

Charles K. Alexander e Matthew N.O. Sadiku "Circuiti elettrici", McGraw-Hill Education

Antonino Laudano, Francesco Riganti Fulginei, "Quaderno di appunti di elettrotecnica. Esercizi sui circuiti elettrici", Pigreco Edizioni

An introduction to Communication, Messages and Signals, Signals and Spectra. Elements and Limitations of Communications Systems. Information, Messages, and Signals. Elements of a Communication System. Fundamental Limitations. Modulation and Coding. Signals and Spectra. Line Spectra and Fourier Series. Phasors and Line Spectra. Periodic Signals and Average Power. Fourier Series. Parseval’s Power Theorem. Fourier Transforms and Continuous Spectra. Time and Frequency Relations. Convolution. Convolution Theorems. Impulses and Transforms in the Limit. Properties of the Unit Impulse. Impulses in Frequency. Step and Signum Functions. Impulses in Time. Correlation and Spectral Density. Correlation of Power Signals. Correlation of Energy Signals. Spectral Density Functions.

Sampling Theorem and Signal Transformation. Sampling Theory and Practice. Sampling and Reconstruction. Practical Sampling and Aliasing. Response of LTI Systems. Impulse Response and the Superposition Integral. Transfer Functions and Frequency Response. Signal Distortion in Transmission. Distortionless Transmission. Linear Distortion. Equalization. Transmission Loss and Decibels. Power Gain. Transmission Loss and Repeaters. Fiber Optics. Radio Transmission. Filters and Filtering. Ideal Filters. Bandlimiting and Timelimiting. Real Filters. Pulse-Amplitude Modulation. Noise and Errors. Binary Error Probabilities. Regenerative Repeaters. Matched Filtering. Correlation Detector.

Probability and Random Variables. Probability and Sample Space. Probabilities and Events. Sample Space and Probability Theory. Conditional Probability and Statistical Independence. Random Variables and Probability Functions. Discrete Random Variables and CDFs. Continuous Random Variables and PDFs. Transformations of Random Variables. Joint and Conditional PDFs. Statistical Averages. Means, Moments, and Expectation. Standard Deviation. Characteristic Functions. Probability Models. Binomial Distribution. Gaussian Distribution. Central Limit Theorem.

Information and Detection Theory. Information Measure and Source Coding. Information Measure. Entropy and Information Rate. Coding for a Discrete Memoryless Channel. Continuous Channels and System Comparisons. Continuous Information. Continuous Channel Capacity. Ideal Communication Systems. System Comparisons. Optimum Digital Detection. Optimum Detection and MAP Receivers. Error Probabilities

Baseband and Bandpass Digital Transmission. Digital Signals and Systems. Digital PAM Signals. Transmission Limitations. Power Spectra of Digital PAM. Spectral Shaping by Precoding. Digital CW Modulation. Spectral Analysis of Bandpass Digital Signals. Amplitude Modulation Methods. Phase Modulation Methods. Frequency Modulation Methods. Minimum-Shift Keying (MSK). Coherent Binary Systems. Optimum Binary Detection. Coherent OOK, BPSK, and FSK. Timing and Synchronization. Interference. Quadrature-Carrier and M-ary Systems. Quadrature-Carrier Systems. M-ary PSK Systems. M-ary QAM Systems. M-ary FSK Systems. Comparison of Digital Modulation Systems

Wired and Wireless Systems and Applications. Text coding. Fax coding. Code excited linear prediction coding. MPEG 1 layer 3 coding (MP3). Electronic music (MIDI). Image processing (GIF, JPEG). Video Processing (MPEG-2 and MPEG-4). Asymmetric Digital Subscriber Line (ADSL).

A.B. Carlson, P.B. Crilly, J.C. Rutledge, "Communication Systems: an introduction to signals and noise in electrical communication", McGraw-Hill international Edition publ.

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

An introduction to Communication, Messages and Signals, Signals and Spectra. Elements and Limitations of Communications Systems. Information, Messages, and Signals. Elements of a Communication System. Fundamental Limitations. Modulation and Coding. Signals and Spectra. Line Spectra and Fourier Series. Phasors and Line Spectra. Periodic Signals and Average Power. Fourier Series. Parseval’s Power Theorem. Fourier Transforms and Continuous Spectra. Time and Frequency Relations. Convolution. Convolution Theorems. Impulses and Transforms in the Limit. Properties of the Unit Impulse. Impulses in Frequency. Step and Signum Functions. Impulses in Time. Correlation and Spectral Density. Correlation of Power Signals. Correlation of Energy Signals. Spectral Density Functions.

Sampling Theorem and Signal Transformation. Sampling Theory and Practice. Sampling and Reconstruction. Practical Sampling and Aliasing. Response of LTI Systems. Impulse Response and the Superposition Integral. Transfer Functions and Frequency Response. Signal Distortion in Transmission. Distortionless Transmission. Linear Distortion. Equalization. Transmission Loss and Decibels. Power Gain. Transmission Loss and Repeaters. Fiber Optics. Radio Transmission. Filters and Filtering. Ideal Filters. Bandlimiting and Timelimiting. Real Filters. Pulse-Amplitude Modulation. Noise and Errors. Binary Error Probabilities. Regenerative Repeaters. Matched Filtering. Correlation Detector.

Probability and Random Variables. Probability and Sample Space. Probabilities and Events. Sample Space and Probability Theory. Conditional Probability and Statistical Independence. Random Variables and Probability Functions. Discrete Random Variables and CDFs. Continuous Random Variables and PDFs. Transformations of Random Variables. Joint and Conditional PDFs. Statistical Averages. Means, Moments, and Expectation. Standard Deviation. Characteristic Functions. Probability Models. Binomial Distribution. Gaussian Distribution. Central Limit Theorem.

Information and Detection Theory. Information Measure and Source Coding. Information Measure. Entropy and Information Rate. Coding for a Discrete Memoryless Channel. Continuous Channels and System Comparisons. Continuous Information. Continuous Channel Capacity. Ideal Communication Systems. System Comparisons. Optimum Digital Detection. Optimum Detection and MAP Receivers. Error Probabilities

Baseband and Bandpass Digital Transmission. Digital Signals and Systems. Digital PAM Signals. Transmission Limitations. Power Spectra of Digital PAM. Spectral Shaping by Precoding. Digital CW Modulation. Spectral Analysis of Bandpass Digital Signals. Amplitude Modulation Methods. Phase Modulation Methods. Frequency Modulation Methods. Minimum-Shift Keying (MSK). Coherent Binary Systems. Optimum Binary Detection. Coherent OOK, BPSK, and FSK. Timing and Synchronization. Interference. Quadrature-Carrier and M-ary Systems. Quadrature-Carrier Systems. M-ary PSK Systems. M-ary QAM Systems. M-ary FSK Systems. Comparison of Digital Modulation Systems

Wired and Wireless Systems and Applications. Text coding. Fax coding. Code excited linear prediction coding. MPEG 1 layer 3 coding (MP3). Electronic music (MIDI). Image processing (GIF, JPEG). Video Processing (MPEG-2 and MPEG-4). Asymmetric Digital Subscriber Line (ADSL).

Testi di Riferimento
A.B. Carlson, P.B. Crilly, J.C. Rutledge, "Communication Systems: an introduction to signals and noise in electrical communication", McGraw-Hill international Edition publ.

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

1. INTRODUZIONE
SISTEMI AD EVENTI DISCRETI (SED)
MODELLI AD EVENTI DISCRETI (MED)
• MED LOGICI
• MED TEMPORIZZATI
2. ANALISI E REGOLAZIONE DEI FLUSSI PRODUTTIVI
TEORIA DELLE FILE D'ATTESA: RELAZIONI FONDAMENTALI
PROCESSI DI NASCITA E MORTE
TEORIA DELLE CODE E ANALISI DELLE PRESTAZIONI NEI SISTEMI A FLUSSO
RETI DI CODE APERTE
RETI DI CODE CHIUSE
3. MED LOGICI
AUTOMI
4. MED TEMPORIZZATI
RAPPRESENTAZIONE CON RETI DI PETRI DI SISTEMI DI CONTROLLO AD EVENTI DISCRETI:
ELEMENTI DELLE RETI DI PETRI: EVENTI , TRANSIZIONI; CONDIZIONI, POSTI, MARCHE; MARCATURA INIZIALE
MATRICI PRE , POST, DI INCIDENZA; RETI MARCATE: GRAFO DI STATO; EQUAZIONE DI STATO, DI TRANSIZIONE
CONFLITTI, MODELLO DI MAGAZZINO, ARCHI INIBITORI; CONCORRENZA, MODELLO DEI GUASTI; TEMPORIZZAZIONE; CONTROLLO SUPERVISORE
PROPRIETÀ DELLE RETI DI PETRI: CONSERVATIVITÀ, LIMITATEZZA, VIVEZZA, CICLICITÀ
INVARIANTI DI POSTO, DI TRANSIZIONE; GRAFI DI SINCRONIZZAZIONE.
RAPPRESENTAZIONE DEL CONTROLLO SUPERVISORE NELLE RETI DI PETRI

DI FEBBRARO A., GIUA A., SISTEMI AD EVENTI DISCRETI , MCGRAW-HILL, 2002
DISPENSE DISPONIBILI SUL SITO HTTP://ADACHER.DIA.UNIROMA3.IT

1. INTRODUZIONE
SISTEMI AD EVENTI DISCRETI (SED)
MODELLI AD EVENTI DISCRETI (MED)
• MED LOGICI
• MED TEMPORIZZATI
2. ANALISI E REGOLAZIONE DEI FLUSSI PRODUTTIVI
TEORIA DELLE FILE D'ATTESA: RELAZIONI FONDAMENTALI
PROCESSI DI NASCITA E MORTE
TEORIA DELLE CODE E ANALISI DELLE PRESTAZIONI NEI SISTEMI A FLUSSO
RETI DI CODE APERTE
RETI DI CODE CHIUSE
3. MED LOGICI
AUTOMI
4. MED TEMPORIZZATI
RAPPRESENTAZIONE CON RETI DI PETRI DI SISTEMI DI CONTROLLO AD EVENTI DISCRETI:
ELEMENTI DELLE RETI DI PETRI: EVENTI , TRANSIZIONI; CONDIZIONI, POSTI, MARCHE; MARCATURA INIZIALE
MATRICI PRE , POST, DI INCIDENZA; RETI MARCATE: GRAFO DI STATO; EQUAZIONE DI STATO, DI TRANSIZIONE
CONFLITTI, MODELLO DI MAGAZZINO, ARCHI INIBITORI; CONCORRENZA, MODELLO DEI GUASTI; TEMPORIZZAZIONE; CONTROLLO SUPERVISORE
PROPRIETÀ DELLE RETI DI PETRI: CONSERVATIVITÀ, LIMITATEZZA, VIVEZZA, CICLICITÀ
INVARIANTI DI POSTO, DI TRANSIZIONE; GRAFI DI SINCRONIZZAZIONE.
RAPPRESENTAZIONE DEL CONTROLLO SUPERVISORE NELLE RETI DI PETRI

DI FEBBRARO A., GIUA A., SISTEMI AD EVENTI DISCRETI , MCGRAW-HILL, 2002
DISPENSE DISPONIBILI SUL SITO HTTP://ADACHER.DIA.UNIROMA3.IT

PART 1: Generalities and tools.
Definitions of computational problem, algorithm, data structure.
Random Access Machine and pseudocode.
Asympthotic study of functions (O-grande, Omega, and Theta notations).
Asympthotic 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 pointes.
Strings.
Memory management: Heap and Stack.
Management of C projects: prototypes and implementations.
Recursion and memory.
Records and pointes.
Dynamic memory management.
File management.

T.H.CORMEN, C.E.LEISERSON, R.L.RIVEST, C.STEIN
INTRODUCTION TO ALGORITHMS (THIRD EDITION) MIT PRESS, 2009

B.W.KERNIGHAM, D.M.RITCHIE
THE C PROGRAMMING LANGUAGE (SECOND EDITION)
PRENTICE HALL, 1988

PART 1: Generalities and tools.
Definitions of computational problem, algorithm, data structure.
Random Access Machine and pseudocode.
Asympthotic study of functions (big-O, Omega, and Theta notations).
Asympthotic 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 pointes.
Strings.
Memory management: Heap and Stack.
Management of C projects: prototypes and implementations.
Recursion and memory.
Records and pointes.
Dynamic memory management.
File management.

T.H.CORMEN, C.E.LEISERSON, R.L.RIVEST, C.STEIN
INTRODUCTION TO ALGORITHMS (THIRD EDITION) MIT PRESS, 2009

B.W.KERNIGHAM, D.M.RITCHIE
THE C PROGRAMMING LANGUAGE (SECOND EDITION)
PRENTICE HALL, 1988

1. Introduction to Operations Research
Formulations, the five phases method
Elements of Linear Algebra
2. Formulation of typical optimization problems
Blending
Resource allocation
Lot sizing
Cutting stock
Assignment
Planning
3. Solution of Linear Programming problems
Geometry of LP
The simplex algorithm
The Fourier-Motzkin method
geometrical interpretation of the simplex algorithm
4. Duality theory
The dual problem
Duality theorems
Complementarity theorem
Economic interpretation of the dual problem
Sensitivity analysis
5. The simplex network algorithm
Minimum cost flow problem
Basis and spanning trees
Change of basis
Phase 1 and Phase 2
6. Network optimization
Maximum flow problem
Shortest path problem
Minimum spanning tree problem

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

1. Introduction to Operations Research
Formulations, the five phases method
Elements of Linear Algebra
2. Formulation of typical optimization problems
Blending
Resource allocation
Lot sizing
Cutting stock
Assignment
Planning
3. Solution of Linear Programming problems
Geometry of LP
The simplex algorithm
The Fourier-Motzkin method
geometrical interpretation of the simplex algorithm
4. Duality theory
The dual problem
Duality theorems
Complementarity theorem
Economic interpretation of the dual problem
Sensitivity analysis
5. The simplex network algorithm
Minimum cost flow problem
Basis and spanning trees
Change of basis
Phase 1 and Phase 2
6. Network optimization
Maximum flow problem
Shortest path problem
Minimum spanning tree problem

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

UTILITÀ DEI CONTROLLI AUTOMATICI. SCHEMI A BLOCCHI STRUTTURALI. MODELLI MATEMATICI DI SISTEMI DINAMICI. CLASSIFICAZIONE DEI MODELLI (LINEARITÀ, STAZIONARIETÀ, ECC.). IL CONCETTO DI STATO. LINEARIZZAZIONE INTORNO AD UN PUNTO DI EQUILIBRIO.

ANALISI DEI SISTEMI LINEARI E STAZIONARI UTILIZZANDO LE TRASFORMATE DI LAPLACE; DESCRIZIONE INGRESSO-USCITA DI UN SISTEMA DINAMICO, FUNZIONE DI TRASFERIMENTO. INTEGRALE DI CONVOLUZIONE. LE VARIABILI DI STATO, DESCRIZIONE INGRESSO-STATO-USCITA. PASSAGGIO DALLA FUNZIONE DI TRASFERIMENTO ALLO SPAZIO DI STATO E VICEVERSA. RISPOSTE A SEGNALI CANONICI. SUDDIVISIONE DELLA RISPOSTA IN RISPOSTA LIBERA E FORZATA, RISPOSTA TRANSITORIA E PERMANENTE. STABILITÀ BIBO DEI SISTEMI. CRITERIO DI STABILITÀ DI ROUTH. SCHEMI A BLOCCHI FUNZIONALI E LORO MANIPOLAZIONE.

RISPOSTA ARMONICA. DEFINIZIONE. RAPPRESENTAZIONI GRAFICHE (DIAGRAMMI DI NYQUIST, BODE, NICHOLS).
ANALISI DEI SISTEMI A CONTROREAZIONE. DERIVAZIONE DELLA RISPOSTA A CICLO CHIUSO DA QUELLA A CICLO APERTO. PROPRIETÀ DEI SISTEMI A CICLO CHIUSO. CRITERI DI STABILITÀ DI NYQUIST. MARGINI DI GUADAGNO E FASE. COMPORTAMENTO A REGIME: CLASSIFICAZIONE IN TIPI. SENSIBILITÀ ALLE VARIAZIONI PARAMETRICHE.
PROGETTAZIONE PER UN DATO COMPORTAMENTO A REGIME. PROGETTAZIONE PER UN DATO COMPORTAMENTO DINAMICO CON RETI CORRETTRICI.
PROGETTO DI CONTROLLORI A TEMPO DISCRETO PER APPROSSIMAZINE DI CONTROLLORI TEMPO CONTINUO.

UTILIZZO DI MATLAB NELLE ATTIVITA' SUDDETTE.

GIOVANNI MARRO, CONTROLLI AUTOMATICI, ZANICHELLI

LIBRI DI CONSULTAZIONE

G. MAGNANI, TECNOLOGIA DEI SISTEMI CONTROLLO, MCGRAW-HILL
CAPITOLO 5 (§§ ...) REGOLATORI INDUSTRIALI (PID)

A. ISIDORI, CONTROLLI AUTOMATICI, SIDEREA.

REGOLAZIONE AUTOMATICA, COLLANA SCHAUM, ETAS LIBRI.

Introduction: Automatic control, feed forward and feedback.

Models of Dynamical Systems: For linear electrical and mechanical systems, block schemes.

Analysis of Linear and Stationary Systems: derivation of system equations, standard models; time domain specifications, transfer function, Laplace transform, poles and zeros.

Basic Properties of Feedback: gains, static properties (e.g., reducing system steady state error to disturbances), dynamic properties (e.g., enhance system dynamics, stabilize an unstable system, make unstable a stable system), reducing system transfer function sensitivity to parameter variations, speeding up transient response.

Frequency Response Design Method: Fourier Transform, Nyquist Stability Criterion, Stability margins, Bode’s Gain-Phase relationship, lead-lag compensation, specifications in terms of the sensitivity function, obtaining a Pole-Zero Model from Frequency-Response data.

Digital Control: Dynamic analysis of discrete systems, design using discrete equivalents, sample rate selection.

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;

JAVA
CODE QUALITY
POLYMORPHISM
COLLECTIONS
CODE REUSE
STREAM, EXCEPTIONS
EVENT PROGRAMMING
GUI

Slides, source code, tests, and homeworks available on the course site.

JAVA
CODE QUALITY
POLYMORPHISM
COLLECTIONS
CODE REUSE
STREAM, EXCEPTIONS
EVENT PROGRAMMING
GUI

Slides, source code, tests, and homeworks available on the course site.

- 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
- Optimization of a computer architecture
- Programming in Assembler

A.S. Tanenbaum, T. Austin. Structured Computer Organization, 6th edition, Prentice Hall .

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

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/BDN/BDNindex.html

Elements of economic analysis
Demand and supply behavior: Budget constraint, demand elasticity; production decisions, profit maximization, technology and production function, cost functions (short and long term).

Management accounting: Full costs and their applications; Direct and indirect costs. Variable and fixed costs.
Accounting methods: traditional indirect allocation methods; job and process costing; activity based costing

Capital budgeting:
Discounted Cash flows: discount rate and its role as an opportunity cost; NPV, IRR and Payback rule; Compund and linear rate of return; Nominal and real discount rate; Project interaction.

“ECONOMIA APPLICATA ALL’INGEGNERIA”, MC GRAW HILL EDITOR “CREATE” BOOK – AVAILABLE IN “EFESTO” BOOKSTORE

THE BOOK HAS BEEN MADE BY MERGING THE FOLLOWING BOOK CHAPTERS
BERNHEIM, WHINSTON, “MICROECONOMICS”, 2/ED, MC GRAW HILL, 2013 – CHAPTER FROM 1 TO 9
ANTHONY, HAWKINS, MERCHANT, “ACCOUNTING: TEXTS AND CASES” 13/ED, MAC GRAW HILL, 2011

Introduction to computer networks; The Iso-Osi reference model; The IEEE 802 Project: Architecture, MAC Layer, LLC Layer; CSMA/CD; ETHERNET and IEEE 802.3; Functions and technical features of Switches (Bridges); Evolution of Ethernet; Wireless networks and CSMA/CA; Line protocols; The Network layer and IP; ICMP, PING and TRACEROUTE; The Transport Layer, TCP, and UDP; The Domain Name System; HTML; HTTP; The Electronic mail service; 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

- Computer Architecture, CPU, Registry, execution, interrupt, memory hierarchy, I/O, procedure
- Modern Operating Systems: definition, goals, layer architecture, kernel/user mode
- process: dispatching, state, description and control, common models and memory management for process execution
- memory management: allocation, partitioning, best/first/next fit, buddy algorithm, paging, segmentation
- Virtual memory
- process address space, page fault, trashing, policies: fetch cleaning eviction placement, page buffering, load control, disk caching, memory mapped files.
- Hw support: paging, page tables, inverted page tables, MAS and SAS, TLB, page size, segmentation
- Resident set management: OPT, LRU, FIFO, CLOCK, Aging.
- Working set: definition, LRU, PFF.
- Scheduling: FCFS, RR, VRR, SPN, SRT, FB, comparisons, linux 2.6
- Disk Scheduling, RAID
- UNIX File Management, inode, Linux VFS, ext2

- process management via C Programming Language

- linux introduction
- documentation (man, info, less), filesystem organization, basic commands (ls, pwd, cd, cat).
- shell: bash, prompt, help, environment variable, env, $PATH, export;
- file and directory management: touch, mv, rm, cp, mkdir, rmdir
- editors and graphical framework: vi, emacs, X, window manager, gnome, kde, kwrite, gedit
- process linux: sleeping ready/running and stopped, terminal, standard input, output, error, I/O, redirection, ps, top, pstree, ^C, ^Z, background, bg, fg, &, kill, kill -9, signals
- regular expressions and grep, sed, stdin, stdout, stderr, redirection (,,, 2), background (&), and (&&), or (||), time, alias, du, df, g(un)zip, b(un)zip, (un)lzma, tar
- Scripting and awk (patterns, statements, flow control, variables, array, $0..$n, FS, RS, NR, NF).
- linux filesystem: mount, stat, ln
- Debugger: gdb stepping, breakpoints, watching, backtrace. Comandi gdb: r, quit, b, info br, help, l, n, s, dis, del, bt, frame, c, ignore, cond, p, display.

- service virtualization: Docker
- Docker Run
- Terminology -2.0 Webapps with Docker
- Docker Images
- Dockerfile
- Docker on AWS -3.0 Multi-container Environments
- Docker Network
- Docker Compose

The lessons are partially based on the book:

W. Stallings, "Operating Systems: Internals and Design Principles", 6th edition. Prentice Hall.

Some contents are available on the slides linked in the HomePage of the course.
For practical exercises there is no book and there supposes the student attending the course. However the following information could be useful:

On-line Documentations about Unix/Linux commands.
M. Cooper - Advanced Bash-Scripting Guide
Any Tutorial about AWK
Any Tutorial about C Programming Language

Software processes; Iterative and agile development.
Requirements; Use cases.
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, QUARTA EDIZIONE, 2015
or
CRAIG LARMAN, APPLYING UML AND PATTERNS, PRENTICE HALL PTR, THIRD EDITION. 2004

Numerical sets (N, Z, Q and R), R assiomatic construction of R by upper extremity, Archimede properties, Q in R density, N construction and induction principle, Newton binomial and combinatorial calculus, Inequality of Bernoulli; Topology elements in R (isolated and accumulated points, open / closed sets and characterization, closure of a set) and Bolzano-Weierstrass theorem; Complex numbers, polar representation and n-th roots of the unit; Real functions of real variable, domain, co-domain, and inverse functions; Function and property limits, monotone function limits; Succession limits, significant limits, Nepero number, bridge theorem, limsup / liminf, sequences and topology, compact sets, and characterization; Continuous functions and their properties, continuity of elementary functions, types of discontinuities and monotone functions, fundamental theorems on continuous functions (zeros, intermediate values, Weierstrass); Function and function derivative, elementary function derivatives, fundamental theorems of differential calculus (Fermat, Rolle, Cauchy, Lagrange, de Hopital, Taylor's formula), monotony and derivative sign, local degradation maxima / minima, convex functions / concave; Function graph; Integration according to Riemann and property, integrability of continuous functions, primitive elementary functions, I and II fundamental theorem of integral calculation, integration for substitution and parts, rational functions, some special replacements; Numerical series and convergence, geometric series, convergence criteria for positive terms series (comparison, asymptotic comparison, root, ratio, condensation) and for series at any time (absolute convergence, Leibnitz); Taylor series developments, developments of some elementary functions; Improper integrals.

A. Laforgia, Calcolo differenziale e integrale, Ed. Accademica;
P. Marcellini e C. Sbordone, Esercizi di Matematica, Vol. 1, tomi 1--4, Ed. Liguori;

Numerical sets (N, Z, Q and R), R assiomatic construction of R by upper extremity, Archimede properties, Q in R density, N construction and induction principle, Newton binomial and combinatorial calculus, Inequality of Bernoulli; Topology elements in R (isolated and accumulated points, open / closed sets and characterization, closure of a set) and Bolzano-Weierstrass theorem; Complex numbers, polar representation and n-th roots of the unit; Real functions of real variable, domain, co-domain, and inverse functions; Function and property limits, monotone function limits; Succession limits, significant limits, Nepero number, bridge theorem, limsup / liminf, sequences and topology, compact sets, and characterization; Continuous functions and their properties, continuity of elementary functions, types of discontinuities and monotone functions, fundamental theorems on continuous functions (zeros, intermediate values, Weierstrass); Function and function derivative, elementary function derivatives, fundamental theorems of differential calculus (Fermat, Rolle, Cauchy, Lagrange, de Hopital, Taylor's formula), monotony and derivative sign, local degradation maxima / minima, convex functions / concave; Function graph; Integration according to Riemann and property, integrability of continuous functions, primitive elementary functions, I and II fundamental theorem of integral calculation, integration for substitution and parts, rational functions, some special replacements; Numerical series and convergence, geometric series, convergence criteria for positive terms series (comparison, asymptotic comparison, root, ratio, condensation) and for series at any time (absolute convergence, Leibnitz); Taylor series developments, developments of some elementary functions; Improper integrals.

A. Laforgia, Calcolo differenziale e integrale, Ed. Accademica;
P. Marcellini e C. Sbordone, Esercizi di Matematica, Vol. 1, tomi 1--4, Ed. Liguori;

Number sets (N, Z, Q and R), axiomatic construction of R via supremum, Archimedean property, density of Q in R, construction of N in R and the inductive method, binomial formula and combinatorial calculus, real powers, the Bernoulli inequality; topological concepts in R (accumulation and isolated points, open/closed sets and characterization, closure of a set) and Bolzano-Weierstrass theorem; complex numbers, polar representation and n-roots of unity; real functions with a real variable, domain, image and inverse functions; limits for functions and properties, limits of monotone functions; limits for sequences, special limits, the Napier number, the bridge theorem,
limsup/liminf, sequences and topology, compact sets and characterization; continuous functions and their properties, continuity of elementary functions, types of discontinuities and monotone functions, fundamental theorems on continuous functions (zeroes, intermediate values, Weierstrass); derivative of a function and properties, derivatives of elementary functions, the fundamental theorems of differential calculus (Fermat, Rolle, Cauchy, Lagrange, de l'Hopital, Taylor's formula), monotonicity and sign of the derivative, degenerate local maxima/minima, convex/concave functions; graph of a function; Riemann integration and properties, integrability of continuous functions, primitives for elementary functions, I and II fundamental theorems of integral calculus, change of variables and integration by parts, rational functions, some special change of variables; numerical series and convergence, geometric series, convergence criteria for positive series (comparison, asymptotic comparison, n-th root, ratio, condensation) and for general series (absolute convergence, Leibniz); Taylor series, series of some elementary functions; improper integrals.

"Analisi Matematica 1", M. Bramanti, C.D. Pagani, S. Salsa, editore Zanichelli
"Analisi Matematica 1", C.D. Pagani, S. Salsa, editore Zanichelli
"Analisi Matematica 1", E. Giusti, editore Bollati Boringhieri
"Funzioni Algebriche e Trascendenti", B. Palumbo, M.C. Signorino, editore Accademica
"Analisi Matematica", M. Bertsch, R. Dal Passo, L. Giacomelli, editore MCGraw-Hill
"Esercizi di Analisi Matematica", S. Salsa, A. Squellati, editore Zanichelli
"Esercitazioni di Matematica: vol. 1.1 e 1.2", P. Marcellini, C. Sbordone, editore Liguori
"Esercizi e complementi di Analisi Matematica: vol. 1", E. Giusti, editore Bollati Boringhieri

Numerical sets (N, Z, Q and R), R assiomatic construction of R by upper extremity, Archimede properties, Q in R density, N construction and induction principle, Newton binomial and combinatorial calculus, Inequality of Bernoulli; Topology elements in R (isolated and accumulated points, open / closed sets and characterization, closure of a set) and Bolzano-Weierstrass theorem; Complex numbers, polar representation and n-th roots of the unit; Real functions of real variable, domain, co-domain, and inverse functions; Function and property limits, monotone function limits; Succession limits, significant limits, Nepero number, bridge theorem, limsup / liminf, sequences and topology, compact sets, and characterization; Continuous functions and their properties, continuity of elementary functions, types of discontinuities and monotone functions, fundamental theorems on continuous functions (zeros, intermediate values, Weierstrass); Function and function derivative, elementary function derivatives, fundamental theorems of differential calculus (Fermat, Rolle, Cauchy, Lagrange, de Hopital, Taylor's formula), monotony and derivative sign, local degradation maxima / minima, convex functions / concave; Function graph; Integration according to Riemann and property, integrability of continuous functions, primitive elementary functions, I and II fundamental theorem of integral calculation, integration for substitution and parts, rational functions, some special replacements; Numerical series and convergence, geometric series, convergence criteria for positive terms series (comparison, asymptotic comparison, root, ratio, condensation) and for series at any time (absolute convergence, Leibnitz); Taylor series developments, developments of some elementary functions; Improper integrals.

A. Laforgia, Calcolo differenziale e integrale, Ed. Accademica;
P. Marcellini e C. Sbordone, Esercizi di Matematica, Vol. 1, tomi 1--4, Ed. Liguori;

Numerical sets (N, Z, Q and R), R assiomatic construction of R by upper extremity, Archimede properties, Q in R density, N construction and induction principle, Newton binomial and combinatorial calculus, Inequality of Bernoulli; Topology elements in R (isolated and accumulated points, open / closed sets and characterization, closure of a set) and Bolzano-Weierstrass theorem; Complex numbers, polar representation and n-th roots of the unit; Real functions of real variable, domain, co-domain, and inverse functions; Function and property limits, monotone function limits; Succession limits, significant limits, Nepero number, bridge theorem, limsup / liminf, sequences and topology, compact sets, and characterization; Continuous functions and their properties, continuity of elementary functions, types of discontinuities and monotone functions, fundamental theorems on continuous functions (zeros, intermediate values, Weierstrass); Function and function derivative, elementary function derivatives, fundamental theorems of differential calculus (Fermat, Rolle, Cauchy, Lagrange, de Hopital, Taylor's formula), monotony and derivative sign, local degradation maxima / minima, convex functions / concave; Function graph; Integration according to Riemann and property, integrability of continuous functions, primitive elementary functions, I and II fundamental theorem of integral calculation, integration for substitution and parts, rational functions, some special replacements; Numerical series and convergence, geometric series, convergence criteria for positive terms series (comparison, asymptotic comparison, root, ratio, condensation) and for series at any time (absolute convergence, Leibnitz); Taylor series developments, developments of some elementary functions; Improper integrals.

A. Laforgia, Calcolo differenziale e integrale, Ed. Accademica;
P. Marcellini e C. Sbordone, Esercizi di Matematica, Vol. 1, tomi 1--4, Ed. Liguori;

Numerical sets (N, Z, Q and R), R assiomatic construction of R by upper extremity, Archimede properties, Q in R density, N construction and induction principle, Newton binomial and combinatorial calculus, Inequality of Bernoulli; Topology elements in R (isolated and accumulated points, open / closed sets and characterization, closure of a set) and Bolzano-Weierstrass theorem; Complex numbers, polar representation and n-th roots of the unit; Real functions of real variable, domain, co-domain, and inverse functions; Function and property limits, monotone function limits; Succession limits, significant limits, Nepero number, bridge theorem, limsup / liminf, sequences and topology, compact sets, and characterization; Continuous functions and their properties, continuity of elementary functions, types of discontinuities and monotone functions, fundamental theorems on continuous functions (zeros, intermediate values, Weierstrass); Function and function derivative, elementary function derivatives, fundamental theorems of differential calculus (Fermat, Rolle, Cauchy, Lagrange, de Hopital, Taylor's formula), monotony and derivative sign, local degradation maxima / minima, convex functions / concave; Function graph; Integration according to Riemann and property, integrability of continuous functions, primitive elementary functions, I and II fundamental theorem of integral calculation, integration for substitution and parts, rational functions, some special replacements; Numerical series and convergence, geometric series, convergence criteria for positive terms series (comparison, asymptotic comparison, root, ratio, condensation) and for series at any time (absolute convergence, Leibnitz); Taylor series developments, developments of some elementary functions; Improper integrals.

A. Laforgia, Calcolo differenziale e integrale, Ed. Accademica;
P. Marcellini e C. Sbordone, Esercizi di Matematica, Vol. 1, tomi 1--4, Ed. Liguori;

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

Sets. Operations between sets. Applications between sets. Permutations. Relations. Equivalence relations. Order relations. Lattices. Algebraic structures. Group of permutations of n elements. Vector spaces. Linear dependence and independence of vectors. Basis. Dimension. Subspaces. Subspace sum. Subspace intersection. Grassmann’s relation. Matrices. Determinants. Inverse matrix. Reduction of a matrix into treads. The rank of a matrix. Linear systems. Theorem of Rouche-Capelli. Cramer's theorem. Method of Gaussian elimination.

F.J. Leon Trujillo, P. Mercuri. Elementi di Algebra Lineare, Ed. Efesto
F.J. Leon Trujillo, P. Mercuri. Elementi di Geometria Affine ed Euclidea, Ed. Efesto
F.J. Leon Trujillo. Esercizi di Algebra Lineare e Geometria, Ed. Efesto

Atom Structure: orbitals, poly-electron atoms, periodic table; covalent bond, delocalized bond.
Mass relationship in chemical reactions; redox and oxidation number.
Solids: metallic crystal, ionic crystal, molecular crystal, covalent crystal.
Gases: the ideal gas law, partial pressures.
Thermodynamics: nature and type of energy, the zero law of T.D., heat capacity, the first law of TD and Enthalphy, the second law of TD, entropy and free energy, equilibrium conditions.
Liquids: phase change, phase diagrams.
Chemical equilibrium: the equilibrium constant and the equilibrium law
Properties of liquid solutions: concentration units, the Raoult law and distillation, colligatives properties and freezing diagram, electrolytes.
Solutions of strong and weak electrolytes. Acids and bases, pH; Salt hydrolysis; buffer solutions.
Elettrochemistry

Appunti delle lezioni
o Depaoli - Chimica Generale ed Inorganica - Ed. Ambrosiana
o Silvestroni, Rallo - Problemi di Chimica Generale - Ed. Masson
o Palmisano, Schiavello – Fondamenti di Chimica - EDISES

Atom Structure: orbitals, poly-electron atoms, periodic table; covalent bond, delocalized bond.
Mass relationship in chemical reactions; redox and oxidation number.
Solids: metallic crystal, ionic crystal, molecular crystal, covalent crystal.
Gases: the ideal gas law, partial pressures.
Thermodynamics: nature and type of energy, the zero law of T.D., heat capacity, the first law of TD and Enthalphy, the second law of TD, entropy and free energy, equilibrium conditions.
Liquids: phase change, phase diagrams.
Chemical equilibrium: the equilibrium constant and the equilibrium law
Properties of liquid solutions: concentration units, the Raoult law and distillation, colligatives properties and freezing diagram, electrolytes.
Solutions of strong and weak electrolytes. Acids and bases, pH; Salt hydrolysis; buffer solutions.
Elettrochemistry

Appunti delle lezioni
o Depaoli - Chimica Generale ed Inorganica - Ed. Ambrosiana
o Silvestroni, Rallo - Problemi di Chimica Generale - Ed. Masson
o Palmisano, Schiavello – Fondamenti di Chimica - EDISES

Atom Structure: orbitals, poly-electron atoms, periodic table; covalent bond, delocalized bond.
Mass relationship in chemical reactions; redox and oxidation number.
Solids: metallic crystal, ionic crystal, molecular crystal, covalent crystal.
Gases: the ideal gas law, partial pressures.
Thermodynamics: nature and type of energy, the zero law of T.D., heat capacity, the first law of TD and Enthalphy, the second law of TD, entropy and free energy, equilibrium conditions.
Liquids: phase change, phase diagrams.
Chemical equilibrium: the equilibrium constant and the equilibrium law
Properties of liquid solutions: concentration units, the Raoult law and distillation, colligatives properties and freezing diagram, electrolytes.
Solutions of strong and weak electrolytes. Acids and bases, pH; Salt hydrolysis; buffer solutions.
Elettrochemistry

Appunti delle lezioni
o Depaoli - Chimica Generale ed Inorganica - Ed. Ambrosiana
o Silvestroni, Rallo - Problemi di Chimica Generale - Ed. Masson
o Palmisano, Schiavello – Fondamenti di Chimica - EDISES

Atom Structure: orbitals, poly-electron atoms, periodic table; covalent bond, delocalized bond.
Mass relationship in chemical reactions; redox and oxidation number.
Solids: metallic crystal, ionic crystal, molecular crystal, covalent crystal.
Gases: the ideal gas law, partial pressures.
Thermodynamics: nature and type of energy, the zero law of T.D., heat capacity, the first law of TD and Enthalphy, the second law of TD, entropy and free energy, equilibrium conditions.
Liquids: phase change, phase diagrams.
Chemical equilibrium: the equilibrium constant and the equilibrium law
Properties of liquid solutions: concentration units, the Raoult law and distillation, colligatives properties and freezing diagram, electrolytes.
Solutions of strong and weak electrolytes. Acids and bases, pH; Salt hydrolysis; buffer solutions.
Elettrochemistry

Appunti delle lezioni
o Depaoli - Chimica Generale ed Inorganica - Ed. Ambrosiana
o Silvestroni, Rallo - Problemi di Chimica Generale - Ed. Masson
o Palmisano, Schiavello – Fondamenti di Chimica - EDISES

COURSE PROGRAM (First semester)

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 semester)

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

Alessandro Bellini, Andrea Guidi
Linguaggio C - 5-th edition
ISBN: 9788838668210

COURSE PROGRAM (First semester)

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 semester)

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

Non linear resistors: diode
small-signal model of a diode
Full-wave rectifier
Zener diode
Voltage stabilizer with zener diode
Transistor
small-signal model of a transistor
Transistor as a short-circuit or open-circuit
Logic gates: NOT,AND, OR
FLIP FLOP SR
Operational amplifier (OP.AMP.)
OP.AMP. Buffer
OP.AMP. Inverting
OP.AMP. Non Inverting
OP.AMP. Comparator
OP.AMP. Clock
OP.AMP. Integrator
OP.AMP. Differentiator
OP.AMP. Summing
Digital to Analog converter

Charles K. Alexander e Matthew N.O. Sadiku "Circuiti elettrici", McGraw-Hill Education

Antonino Laudano, Francesco Riganti Fulginei, "Quaderno di appunti di elettrotecnica. Esercizi sui circuiti elettrici", Pigreco Edizioni

From fields to circuits
Kirchhoff's circuit laws
Voltage and Current
Two-pole circuit
Electric Power
Passive, linear and time-independent circuit elements
Circuit elements with memory
Series and parallel circuit elements
Active circuit elements: voltage and current ideal sources (independent or controlled)
Passive circuit elements: resistor, capacitor and inductor
Series and parallel resistor
Equivalent models
Norton e Thevenin models
Brief notes of graph theory
Tableau method for the general analisys of electric circuits
Nodal analysis
Mesh analysis
Superposition principle
Thevenin's theorem
Steady and transient states
Steady state with sinusoidal signals
Frequency-domain analysis
Active, reactive, and apparent power
Three-phase electric systems
Balanced three-phase sources and loads
Three Phase Power
Measurement of Three Phase Power
Aron's insertion
Power factor correction

Charles K. Alexander e Matthew N.O. Sadiku "Circuiti elettrici", McGraw-Hill Education

Antonino Laudano, Francesco Riganti Fulginei, "Quaderno di appunti di elettrotecnica. Esercizi sui circuiti elettrici", Pigreco Edizioni

An introduction to Communication, Messages and Signals, Signals and Spectra. Elements and Limitations of Communications Systems. Information, Messages, and Signals. Elements of a Communication System. Fundamental Limitations. Modulation and Coding. Signals and Spectra. Line Spectra and Fourier Series. Phasors and Line Spectra. Periodic Signals and Average Power. Fourier Series. Parseval’s Power Theorem. Fourier Transforms and Continuous Spectra. Time and Frequency Relations. Convolution. Convolution Theorems. Impulses and Transforms in the Limit. Properties of the Unit Impulse. Impulses in Frequency. Step and Signum Functions. Impulses in Time. Correlation and Spectral Density. Correlation of Power Signals. Correlation of Energy Signals. Spectral Density Functions.

Sampling Theorem and Signal Transformation. Sampling Theory and Practice. Sampling and Reconstruction. Practical Sampling and Aliasing. Response of LTI Systems. Impulse Response and the Superposition Integral. Transfer Functions and Frequency Response. Signal Distortion in Transmission. Distortionless Transmission. Linear Distortion. Equalization. Transmission Loss and Decibels. Power Gain. Transmission Loss and Repeaters. Fiber Optics. Radio Transmission. Filters and Filtering. Ideal Filters. Bandlimiting and Timelimiting. Real Filters. Pulse-Amplitude Modulation. Noise and Errors. Binary Error Probabilities. Regenerative Repeaters. Matched Filtering. Correlation Detector.

Probability and Random Variables. Probability and Sample Space. Probabilities and Events. Sample Space and Probability Theory. Conditional Probability and Statistical Independence. Random Variables and Probability Functions. Discrete Random Variables and CDFs. Continuous Random Variables and PDFs. Transformations of Random Variables. Joint and Conditional PDFs. Statistical Averages. Means, Moments, and Expectation. Standard Deviation. Characteristic Functions. Probability Models. Binomial Distribution. Gaussian Distribution. Central Limit Theorem.

Information and Detection Theory. Information Measure and Source Coding. Information Measure. Entropy and Information Rate. Coding for a Discrete Memoryless Channel. Continuous Channels and System Comparisons. Continuous Information. Continuous Channel Capacity. Ideal Communication Systems. System Comparisons. Optimum Digital Detection. Optimum Detection and MAP Receivers. Error Probabilities

Baseband and Bandpass Digital Transmission. Digital Signals and Systems. Digital PAM Signals. Transmission Limitations. Power Spectra of Digital PAM. Spectral Shaping by Precoding. Digital CW Modulation. Spectral Analysis of Bandpass Digital Signals. Amplitude Modulation Methods. Phase Modulation Methods. Frequency Modulation Methods. Minimum-Shift Keying (MSK). Coherent Binary Systems. Optimum Binary Detection. Coherent OOK, BPSK, and FSK. Timing and Synchronization. Interference. Quadrature-Carrier and M-ary Systems. Quadrature-Carrier Systems. M-ary PSK Systems. M-ary QAM Systems. M-ary FSK Systems. Comparison of Digital Modulation Systems

Wired and Wireless Systems and Applications. Text coding. Fax coding. Code excited linear prediction coding. MPEG 1 layer 3 coding (MP3). Electronic music (MIDI). Image processing (GIF, JPEG). Video Processing (MPEG-2 and MPEG-4). Asymmetric Digital Subscriber Line (ADSL).

A.B. Carlson, P.B. Crilly, J.C. Rutledge, "Communication Systems: an introduction to signals and noise in electrical communication", McGraw-Hill international Edition publ.

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

An introduction to Communication, Messages and Signals, Signals and Spectra. Elements and Limitations of Communications Systems. Information, Messages, and Signals. Elements of a Communication System. Fundamental Limitations. Modulation and Coding. Signals and Spectra. Line Spectra and Fourier Series. Phasors and Line Spectra. Periodic Signals and Average Power. Fourier Series. Parseval’s Power Theorem. Fourier Transforms and Continuous Spectra. Time and Frequency Relations. Convolution. Convolution Theorems. Impulses and Transforms in the Limit. Properties of the Unit Impulse. Impulses in Frequency. Step and Signum Functions. Impulses in Time. Correlation and Spectral Density. Correlation of Power Signals. Correlation of Energy Signals. Spectral Density Functions.

Sampling Theorem and Signal Transformation. Sampling Theory and Practice. Sampling and Reconstruction. Practical Sampling and Aliasing. Response of LTI Systems. Impulse Response and the Superposition Integral. Transfer Functions and Frequency Response. Signal Distortion in Transmission. Distortionless Transmission. Linear Distortion. Equalization. Transmission Loss and Decibels. Power Gain. Transmission Loss and Repeaters. Fiber Optics. Radio Transmission. Filters and Filtering. Ideal Filters. Bandlimiting and Timelimiting. Real Filters. Pulse-Amplitude Modulation. Noise and Errors. Binary Error Probabilities. Regenerative Repeaters. Matched Filtering. Correlation Detector.

Probability and Random Variables. Probability and Sample Space. Probabilities and Events. Sample Space and Probability Theory. Conditional Probability and Statistical Independence. Random Variables and Probability Functions. Discrete Random Variables and CDFs. Continuous Random Variables and PDFs. Transformations of Random Variables. Joint and Conditional PDFs. Statistical Averages. Means, Moments, and Expectation. Standard Deviation. Characteristic Functions. Probability Models. Binomial Distribution. Gaussian Distribution. Central Limit Theorem.

Information and Detection Theory. Information Measure and Source Coding. Information Measure. Entropy and Information Rate. Coding for a Discrete Memoryless Channel. Continuous Channels and System Comparisons. Continuous Information. Continuous Channel Capacity. Ideal Communication Systems. System Comparisons. Optimum Digital Detection. Optimum Detection and MAP Receivers. Error Probabilities

Baseband and Bandpass Digital Transmission. Digital Signals and Systems. Digital PAM Signals. Transmission Limitations. Power Spectra of Digital PAM. Spectral Shaping by Precoding. Digital CW Modulation. Spectral Analysis of Bandpass Digital Signals. Amplitude Modulation Methods. Phase Modulation Methods. Frequency Modulation Methods. Minimum-Shift Keying (MSK). Coherent Binary Systems. Optimum Binary Detection. Coherent OOK, BPSK, and FSK. Timing and Synchronization. Interference. Quadrature-Carrier and M-ary Systems. Quadrature-Carrier Systems. M-ary PSK Systems. M-ary QAM Systems. M-ary FSK Systems. Comparison of Digital Modulation Systems

Wired and Wireless Systems and Applications. Text coding. Fax coding. Code excited linear prediction coding. MPEG 1 layer 3 coding (MP3). Electronic music (MIDI). Image processing (GIF, JPEG). Video Processing (MPEG-2 and MPEG-4). Asymmetric Digital Subscriber Line (ADSL).

Testi di Riferimento
A.B. Carlson, P.B. Crilly, J.C. Rutledge, "Communication Systems: an introduction to signals and noise in electrical communication", McGraw-Hill international Edition publ.

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

1. INTRODUZIONE
SISTEMI AD EVENTI DISCRETI (SED)
MODELLI AD EVENTI DISCRETI (MED)
• MED LOGICI
• MED TEMPORIZZATI
2. ANALISI E REGOLAZIONE DEI FLUSSI PRODUTTIVI
TEORIA DELLE FILE D'ATTESA: RELAZIONI FONDAMENTALI
PROCESSI DI NASCITA E MORTE
TEORIA DELLE CODE E ANALISI DELLE PRESTAZIONI NEI SISTEMI A FLUSSO
RETI DI CODE APERTE
RETI DI CODE CHIUSE
3. MED LOGICI
AUTOMI
4. MED TEMPORIZZATI
RAPPRESENTAZIONE CON RETI DI PETRI DI SISTEMI DI CONTROLLO AD EVENTI DISCRETI:
ELEMENTI DELLE RETI DI PETRI: EVENTI , TRANSIZIONI; CONDIZIONI, POSTI, MARCHE; MARCATURA INIZIALE
MATRICI PRE , POST, DI INCIDENZA; RETI MARCATE: GRAFO DI STATO; EQUAZIONE DI STATO, DI TRANSIZIONE
CONFLITTI, MODELLO DI MAGAZZINO, ARCHI INIBITORI; CONCORRENZA, MODELLO DEI GUASTI; TEMPORIZZAZIONE; CONTROLLO SUPERVISORE
PROPRIETÀ DELLE RETI DI PETRI: CONSERVATIVITÀ, LIMITATEZZA, VIVEZZA, CICLICITÀ
INVARIANTI DI POSTO, DI TRANSIZIONE; GRAFI DI SINCRONIZZAZIONE.
RAPPRESENTAZIONE DEL CONTROLLO SUPERVISORE NELLE RETI DI PETRI

DI FEBBRARO A., GIUA A., SISTEMI AD EVENTI DISCRETI , MCGRAW-HILL, 2002
DISPENSE DISPONIBILI SUL SITO HTTP://ADACHER.DIA.UNIROMA3.IT

1. INTRODUZIONE
SISTEMI AD EVENTI DISCRETI (SED)
MODELLI AD EVENTI DISCRETI (MED)
• MED LOGICI
• MED TEMPORIZZATI
2. ANALISI E REGOLAZIONE DEI FLUSSI PRODUTTIVI
TEORIA DELLE FILE D'ATTESA: RELAZIONI FONDAMENTALI
PROCESSI DI NASCITA E MORTE
TEORIA DELLE CODE E ANALISI DELLE PRESTAZIONI NEI SISTEMI A FLUSSO
RETI DI CODE APERTE
RETI DI CODE CHIUSE
3. MED LOGICI
AUTOMI
4. MED TEMPORIZZATI
RAPPRESENTAZIONE CON RETI DI PETRI DI SISTEMI DI CONTROLLO AD EVENTI DISCRETI:
ELEMENTI DELLE RETI DI PETRI: EVENTI , TRANSIZIONI; CONDIZIONI, POSTI, MARCHE; MARCATURA INIZIALE
MATRICI PRE , POST, DI INCIDENZA; RETI MARCATE: GRAFO DI STATO; EQUAZIONE DI STATO, DI TRANSIZIONE
CONFLITTI, MODELLO DI MAGAZZINO, ARCHI INIBITORI; CONCORRENZA, MODELLO DEI GUASTI; TEMPORIZZAZIONE; CONTROLLO SUPERVISORE
PROPRIETÀ DELLE RETI DI PETRI: CONSERVATIVITÀ, LIMITATEZZA, VIVEZZA, CICLICITÀ
INVARIANTI DI POSTO, DI TRANSIZIONE; GRAFI DI SINCRONIZZAZIONE.
RAPPRESENTAZIONE DEL CONTROLLO SUPERVISORE NELLE RETI DI PETRI

DI FEBBRARO A., GIUA A., SISTEMI AD EVENTI DISCRETI , MCGRAW-HILL, 2002
DISPENSE DISPONIBILI SUL SITO HTTP://ADACHER.DIA.UNIROMA3.IT

PART 1: Generalities and tools.
Definitions of computational problem, algorithm, data structure.
Random Access Machine and pseudocode.
Asympthotic study of functions (O-grande, Omega, and Theta notations).
Asympthotic 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 pointes.
Strings.
Memory management: Heap and Stack.
Management of C projects: prototypes and implementations.
Recursion and memory.
Records and pointes.
Dynamic memory management.
File management.

T.H.CORMEN, C.E.LEISERSON, R.L.RIVEST, C.STEIN
INTRODUCTION TO ALGORITHMS (THIRD EDITION) MIT PRESS, 2009

B.W.KERNIGHAM, D.M.RITCHIE
THE C PROGRAMMING LANGUAGE (SECOND EDITION)
PRENTICE HALL, 1988

PART 1: Generalities and tools.
Definitions of computational problem, algorithm, data structure.
Random Access Machine and pseudocode.
Asympthotic study of functions (big-O, Omega, and Theta notations).
Asympthotic 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 pointes.
Strings.
Memory management: Heap and Stack.
Management of C projects: prototypes and implementations.
Recursion and memory.
Records and pointes.
Dynamic memory management.
File management.

T.H.CORMEN, C.E.LEISERSON, R.L.RIVEST, C.STEIN
INTRODUCTION TO ALGORITHMS (THIRD EDITION) MIT PRESS, 2009

B.W.KERNIGHAM, D.M.RITCHIE
THE C PROGRAMMING LANGUAGE (SECOND EDITION)
PRENTICE HALL, 1988

1. Introduction to Operations Research
Formulations, the five phases method
Elements of Linear Algebra
2. Formulation of typical optimization problems
Blending
Resource allocation
Lot sizing
Cutting stock
Assignment
Planning
3. Solution of Linear Programming problems
Geometry of LP
The simplex algorithm
The Fourier-Motzkin method
geometrical interpretation of the simplex algorithm
4. Duality theory
The dual problem
Duality theorems
Complementarity theorem
Economic interpretation of the dual problem
Sensitivity analysis
5. The simplex network algorithm
Minimum cost flow problem
Basis and spanning trees
Change of basis
Phase 1 and Phase 2
6. Network optimization
Maximum flow problem
Shortest path problem
Minimum spanning tree problem

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

1. Introduction to Operations Research
Formulations, the five phases method
Elements of Linear Algebra
2. Formulation of typical optimization problems
Blending
Resource allocation
Lot sizing
Cutting stock
Assignment
Planning
3. Solution of Linear Programming problems
Geometry of LP
The simplex algorithm
The Fourier-Motzkin method
geometrical interpretation of the simplex algorithm
4. Duality theory
The dual problem
Duality theorems
Complementarity theorem
Economic interpretation of the dual problem
Sensitivity analysis
5. The simplex network algorithm
Minimum cost flow problem
Basis and spanning trees
Change of basis
Phase 1 and Phase 2
6. Network optimization
Maximum flow problem
Shortest path problem
Minimum spanning tree problem

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

UTILITÀ DEI CONTROLLI AUTOMATICI. SCHEMI A BLOCCHI STRUTTURALI. MODELLI MATEMATICI DI SISTEMI DINAMICI. CLASSIFICAZIONE DEI MODELLI (LINEARITÀ, STAZIONARIETÀ, ECC.). IL CONCETTO DI STATO. LINEARIZZAZIONE INTORNO AD UN PUNTO DI EQUILIBRIO.

ANALISI DEI SISTEMI LINEARI E STAZIONARI UTILIZZANDO LE TRASFORMATE DI LAPLACE; DESCRIZIONE INGRESSO-USCITA DI UN SISTEMA DINAMICO, FUNZIONE DI TRASFERIMENTO. INTEGRALE DI CONVOLUZIONE. LE VARIABILI DI STATO, DESCRIZIONE INGRESSO-STATO-USCITA. PASSAGGIO DALLA FUNZIONE DI TRASFERIMENTO ALLO SPAZIO DI STATO E VICEVERSA. RISPOSTE A SEGNALI CANONICI. SUDDIVISIONE DELLA RISPOSTA IN RISPOSTA LIBERA E FORZATA, RISPOSTA TRANSITORIA E PERMANENTE. STABILITÀ BIBO DEI SISTEMI. CRITERIO DI STABILITÀ DI ROUTH. SCHEMI A BLOCCHI FUNZIONALI E LORO MANIPOLAZIONE.

RISPOSTA ARMONICA. DEFINIZIONE. RAPPRESENTAZIONI GRAFICHE (DIAGRAMMI DI NYQUIST, BODE, NICHOLS).
ANALISI DEI SISTEMI A CONTROREAZIONE. DERIVAZIONE DELLA RISPOSTA A CICLO CHIUSO DA QUELLA A CICLO APERTO. PROPRIETÀ DEI SISTEMI A CICLO CHIUSO. CRITERI DI STABILITÀ DI NYQUIST. MARGINI DI GUADAGNO E FASE. COMPORTAMENTO A REGIME: CLASSIFICAZIONE IN TIPI. SENSIBILITÀ ALLE VARIAZIONI PARAMETRICHE.
PROGETTAZIONE PER UN DATO COMPORTAMENTO A REGIME. PROGETTAZIONE PER UN DATO COMPORTAMENTO DINAMICO CON RETI CORRETTRICI.
PROGETTO DI CONTROLLORI A TEMPO DISCRETO PER APPROSSIMAZINE DI CONTROLLORI TEMPO CONTINUO.

UTILIZZO DI MATLAB NELLE ATTIVITA' SUDDETTE.

GIOVANNI MARRO, CONTROLLI AUTOMATICI, ZANICHELLI

LIBRI DI CONSULTAZIONE

G. MAGNANI, TECNOLOGIA DEI SISTEMI CONTROLLO, MCGRAW-HILL
CAPITOLO 5 (§§ ...) REGOLATORI INDUSTRIALI (PID)

A. ISIDORI, CONTROLLI AUTOMATICI, SIDEREA.

REGOLAZIONE AUTOMATICA, COLLANA SCHAUM, ETAS LIBRI.

Introduction: Automatic control, feed forward and feedback.

Models of Dynamical Systems: For linear electrical and mechanical systems, block schemes.

Analysis of Linear and Stationary Systems: derivation of system equations, standard models; time domain specifications, transfer function, Laplace transform, poles and zeros.

Basic Properties of Feedback: gains, static properties (e.g., reducing system steady state error to disturbances), dynamic properties (e.g., enhance system dynamics, stabilize an unstable system, make unstable a stable system), reducing system transfer function sensitivity to parameter variations, speeding up transient response.

Frequency Response Design Method: Fourier Transform, Nyquist Stability Criterion, Stability margins, Bode’s Gain-Phase relationship, lead-lag compensation, specifications in terms of the sensitivity function, obtaining a Pole-Zero Model from Frequency-Response data.

Digital Control: Dynamic analysis of discrete systems, design using discrete equivalents, sample rate selection.

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;

JAVA
CODE QUALITY
POLYMORPHISM
COLLECTIONS
CODE REUSE
STREAM, EXCEPTIONS
EVENT PROGRAMMING
GUI

Slides, source code, tests, and homeworks available on the course site.

JAVA
CODE QUALITY
POLYMORPHISM
COLLECTIONS
CODE REUSE
STREAM, EXCEPTIONS
EVENT PROGRAMMING
GUI

Slides, source code, tests, and homeworks available on the course site.

- 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
- Optimization of a computer architecture
- Programming in Assembler

A.S. Tanenbaum, T. Austin. Structured Computer Organization, 6th edition, Prentice Hall .

Elements of economic analysis
Demand and supply behavior: Budget constraint, demand elasticity; production decisions, profit maximization, technology and production function, cost functions (short and long term).

Management accounting: Full costs and their applications; Direct and indirect costs. Variable and fixed costs.
Accounting methods: traditional indirect allocation methods; job and process costing; activity based costing

Capital budgeting:
Discounted Cash flows: discount rate and its role as an opportunity cost; NPV, IRR and Payback rule; Compund and linear rate of return; Nominal and real discount rate; Project interaction.

“ECONOMIA APPLICATA ALL’INGEGNERIA”, MC GRAW HILL EDITOR “CREATE” BOOK – AVAILABLE IN “EFESTO” BOOKSTORE

THE BOOK HAS BEEN MADE BY MERGING THE FOLLOWING BOOK CHAPTERS
BERNHEIM, WHINSTON, “MICROECONOMICS”, 2/ED, MC GRAW HILL, 2013 – CHAPTER FROM 1 TO 9
ANTHONY, HAWKINS, MERCHANT, “ACCOUNTING: TEXTS AND CASES” 13/ED, MAC GRAW HILL, 2011

Introduction to computer networks; The Iso-Osi reference model; The IEEE 802 Project: Architecture, MAC Layer, LLC Layer; CSMA/CD; ETHERNET and IEEE 802.3; Functions and technical features of Switches (Bridges); Evolution of Ethernet; Wireless networks and CSMA/CA; Line protocols; The Network layer and IP; ICMP, PING and TRACEROUTE; The Transport Layer, TCP, and UDP; The Domain Name System; HTML; HTTP; The Electronic mail service; 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 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.

[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.

• MODULO 1 INTRODUZIONE
1. CENNI STORICI
2. SCENARIO ATTUALE
3. RICHIAMI DI TEORIA DELL’ORGANIZZAZIONE
4. DEFINIZIONE E CARATTERISTICHE DI PROGETTO
5. PROJECT MANAGEMENT
6. BODY OF KNOWLEDGE DEL PROJECT MANAGEMENT

• MODULO 2 CICLO DI VITA DEL PROGETTO
1. CONCETTO DI CICLO DI VITA DEL PROGETTO
2. LE FASI DEL CICLO DI VITA DEL PROGETTO
3. LA PIANIFICAZIONE DEI PROGETTI
4. IL CICLO DELLA PIANIFICAZIONE E CONTROLLO DEI PROGETTI

• MODULO 3 PIANIFICAZIONE LOGICA DEL PROGETTO
1. WORK BREAKDOWN STRUCTURE
2. ATTIVITÀ ELEMENTARI
3. WORK PACKAGE DESCRIPTION
4. MATRICE DI RESPONSABILITÀ

• MODULO 4 SPECIFICAZIONE E CONTROLLO TECNICO
1. SPECIFICAZIONE
2. CONTROLLO TECNICO (DESIGN REVIEW, COLLAUDI)

• MODULO 5 PIANIFICAZIONE E CONTROLLO TEMPI/RISORSE
1. MILESTONES
2. DIAGRAMMI A BARRE
3. RETICOLI E ALGORITMI DI ALLOCAZIONE
4. SCHEDULING

• MODULO 6 PIANIFICAZIONE E CONTROLLO COSTI
1. STRUTTURA E MODALITÀ DEL BUDGET E CONTROLLO NEI PROGETTI
2. PREVENTIVAZIONE
3. APERTURA DI COMMESSA E AUTORIZZAZIONI A SPENDERE
4. PREVISIONE DI SPESA NEL TEMPO
5. EARNED VALUE
6. INDICATORI
7. PREVENTIVI A FINIRE

• MODULO 7 ELEMENTI DI RISK MANAGEMENT
1. ANALISI E VALUTAZIONE DEL RISCHIO
2. AZIONI DI CONTRASTO E CONTROLLO DEL RISCHIO
3. TEORIA DELLE DECISIONI

• MODULO 8 REPORTING
1. AVANZAMENTO DEL PROGETTO
2. INDICATORI DI COMPLETAMENTO
3. REPORT

• MODULO 9 PRINCIPI DI DOCUMENTAZIONE TECNICA
1. STRUTTURA DEL SISTEMA DI DOCUMENTAZIONE DI UN PROGETTO
2. DOCUMENTI TECNICI
3. CONTROLLO DI CONFIGURAZIONE

• MODULO 10 ASPETTI ORGANIZZATIVI E COMPORTAMENTALI
1. IL PROJECT OFFICE
2. RUOLO E COMPETENZE DEL PROJECT MANAGER

• ELEMENTI DI COMUNICAZIONE INTERPERSONALE

•TESTO DI RIFERIMENTO:
STEFANO PROTTO “CONCETTI E STRUMENTI DI PROJECT MANAGEMENT” II ED. 2006 FRANCO ANGELI.
•DISPENSA AGGIUNTIVA RELATIVA AL MODULO 1 (TRATTATO IN AULA, NON NEL TESTO DI RIFERIMENTO)
"PRINCIPI DI ORGANIZZAZIONE STRUTTURALE IN AZIENDE AD ALTA TECNOLOGIA" (PDF)
•SLIDES RELATIVE AL MODULO 10 (TRATTATO IN AULA, NON NEL TESTO DI RIFERIMENTO)
"PROJECT OFFICE E PROJECT MANAGER" (PDF)

INTRODUZIONE AL CONTROLLO DIGITALE. GENERALITÀ SUL CONTROLLO DIRETTO IN LINEA. LA DISCRETIZZAZIONE NEL TEMPO E LA QUANTIZZAZIONE IN AMPIEZZA. STRUMENTI MATEMATICI PER L'ANALISI DEI SISTEMI A TEMPO DISCRETO. LA DISCRETIZZAZIONE DEL TEMPO, EQUAZIONI LINEARI ALLE DIFFERENZE, LA Z-TRASFORMATA. CAMPIONAMENTO E RICOSTRUZIONE DEI SEGNALI. IL CAMPIONAMENTO IMPULSIVO, SPETTRO DEL SEGNALE CAMPIONATO, RICOSTRUTTORI DEL SEGNALE, CORRISPONDENZA TRA IL PIANO COMPLESSO S E IL PIANO COMPLESSO Z. LA FUNZIONE DI TRASFERIMENTO DISCRETA. STABILITÀ DEI SISTEMI A TEMPO DISCRETO. LA PRECISIONE. LE SPECIFICHE DI PROGETTO PER UN SISTEMA DI CONTROLLO NUMERICO DIRETTO. IL PROGETTO DELL'ALGORITMO DI CONTROLLO. METODI DI PROGETTO NEL DOMINIO DELLA FREQUENZA APPROSSIMATI ED ESATTI. METODI DI PROGETTO NEL DOMINIO DI Z CON IL LUOGO DELLE RADICI E CON METODI ANALITICI. LA REALIZZAZIONE DI REGOLATORI STANDARD (PID) DIGITALI. REALIZZAZIONE DEL CONTROLLO DIGITALE. STRUTTURAZIONE DELL'ALGORITMO, RAPPRESENTAZIONE DELLE GRANDEZZE, FILTRAGGIO ANTI ALIASING, SCELTA DEL PERIODO DI CAMPIONAMENTO. IMPIEGO DI SISTEMI DI CONTROLLO A MICROPROCESSORE. IL PIC.

LIBRO DI TESTO
C. BONIVENTO, C. MELCHIORRI, R. ZANASI, "SISTEMI DI CONTROLLO DIGITALE", SOCIETÀ EDITRICE ESCULAPIO S.R.L., 1995
LIBRI DI CONSULTAZIONE
G.C. BUTTAZZO, "SISTEMI IN TEMPO REALE", PITAGORA EDITRICE, BOLOGNA, TERZA EDIZIONE, 2006



A. CAVALLO, R. SETOLA, F. VASCA, "LA NUOVA GUIDA A MATLAB SIMULINK E CONTROL TOOLBOX", LIGUORI EDITORE, 2002

Computer Integrated Manufacturing. Market standards for automation networks: information networks, control networks and field buses. Supervisory control and data acquisition systems (SCADA). Structure of a Programmable Logic Controller (PLC). Programming packages for Ladder Logic and SCADA systems. Sequential Functional Chart (SFC) and its translation into Ladder Logic. Control examples of simple plants. Graphic language programming for motion control. Remote monitoring using fieldbus and general purpose LAN. Sensors for industrial applications. Motion Control. Interprocess communications and distributed services: DDE, COM, and Jini framework. IT security and SCADA systems.

Disaster Recovery Handbook, The: A Step-by-Step Plan to Ensure Business Continuity and Protect Vital Operations.