As this is not a document usually issued by universities, applicants have to fill this in by themselves as self-certification

Name:

___Catalin__________________ __MATASARU___________________

Family Name:

Grade system (1): __Grades are given from 10,00(ten) to 1,00(one), the minimum passing grade of a discipline being 5, 00(five).___________________ DESCRIPTION OF ATTENDED COURSES (2)
Course Name (3)
Physics

Subject Content (4)

Books used (5) E. Luca, G. Zet,

Hours
(6)

Grade (3)
8

Physics. Vol. 1,2, publisher Editura Stiintifica, 1995. G. Zet, I. Jemna Physics course Vol. 1,2, publisher ROTAPRINT, 1983. G. Zet, D. Ursu Solid state physics. Engineering

70 hours correspondin g to 5 hours/week in a 14 week semester

Course Name (3)

Subject Content (4)

Books used (5)

applications, publisher Editura Tehnica,1989. V. Manta, G. Zet Laser physics and applications,publishe r Editura CERMI, 1999.

Hours
(6)

Grade (3)

Differential equations and operational calculus

Special mathematics

Algorithms and data structures

Course overview: Mathematical Foundations (Summation Formulas, Logarithms, Induction, Lower and Upper bounds, Asymptotic Notation, Recurrence Relations, Master Theorem, Loop Invariants). Analysis of the Correctness and of the Computational Complexity of Computer Algorithms. Advanced Data Structures (Binary Search Trees, Balanced Trees, Heaps, Indirect Heaps, Priority Queues, Dictionaries, Hash Tables, UnionFind). Graph Algorithms and Searching and Sorting Algorithms. Design Techniques (Divide and Conquer, Greedy and Dynamic

T. Niculiu, Programming techniques ;C++ (in Romanian: Tehnici de Programare obiect-orientate. C+ +, publisher Editura Printech, 1999. B. Stroustrup, The C++ Programming Language, AddisonWesley, 1991.

84 hours correspondin g to 6 hours/week in a 14 week semester 56 hours correspondin g to 4 hours/week in a 14 week semester 56 hours correspondin g to 4 hours/week in a 14 week semester

10

Course Name (3)

Subject Content (4)

Programming).

Books used (5)

A.V. Aho, J.E. Hopcroft, J.D. Ullman, Data Structures and Algorithms, AddisonWesley Publishing Company, Reading, Massachusetts, 1983. A.L. Pletea Statiscs and data processing paper course Anderson, , D.R.; Sweeney, D.J.; Williams, T.A.. Statistics: Concepts and Applications, McGraw-Hill Education, 1995

Hours
(6)

Grade (3)

Statistics and data processing

Course overview: Statistics and data. Descriptive Statistics. Mean, Median, Quartiles, Percentiles, Variance, Moments, Histograms, Order Statistics, tables etc. Raw and processed data, regression, correlation Probability as a tool to quantify uncertainty. Trial, outcomes, events, probabilities and probability distributions. Repeated trials, independence. Induced distributions. Conditional probability and Bayes rule Calculation of probabilities and some standard distributions. Binomial, Poisson, Geometric, Uniform, Negative Binomial. Moments, generating functions. Poisson as a limit of Binomial Random variables, their distributions, expectations, sums of independent random variables. Laws of large numbers. Basis for reliability of inference based on large samples. Continuous distributions, Distribution functions, densities. Approximations to discrete distributions. Some standard continuous distributions. Moments, bivariate distributions, correlations, conditional distributions. Normal distributions. Statistical inference. Testing simple null hypothesis against a simple alternative. Critical Region. Size or level of a test. Type I and Type II errors. Power. Trade-offs. Selection of the critical region. NeymanPearson lemma. Baysian approach. Priors and posteriors.

56 hours correspondin g to 4 hours/week in a 14 week semester

Course Name (3)

Subject Content (4)

Some examples of simple tests. Composite alternatives. UMP tests. One sided and two sided tests. Testing for means, variances in a normal population. Standard tests: z-score. t and F tests. Small sample and large sample tests. Estimation. Method of moments. Unbiased Estimators. Variances. Cramer-Rao inequality. Consistency. Examples. Maximum likelihood estimators. Asymptotic properties. Examples. The course provides the mathematical foundation of modern control theory, with application in aeronautics, electrical networks, signal processing, and many other areas. Course overview: Linear control systems, state-space representation, transfer matrix representation, reachability, observability, linear systems stability, multivariable linear system stability, Nyquist criterion, Rosenbrock criterion, realization theory, minimality, feedback, pole-assignment, observers. Linear-quadratic optimal control, matrix Riccati equation and theory for the algebraic Riccati equation. Kalman filtering. Course overview: Introduction; overview of control; describing dynamical systems using time-invariant ordinary differential equations, transfer function, frequency responses, Bode and Nyquist diagrams; relations between different representations; controllability and observability; analysis of feedback systems, signal following and disturbance rejection; stability; overview of stability analysis methods: root locus and Nyquist criterion; practical stability; phase and amplitude marginals; synthesis and implementation of controllers; specifications; control principles and controller structures: PID control, cascade control, feedforward; synthesis of systems with a given transfer function: pole-placement through state feedback and output feedback; reconstruction suing Kalman filter; Bode and Nyquist compensation; delay compensation; application examples

Books used (5)

Hours
(6)

Grade (3)

Systems theory

Voicu M., Systems Theory (in Romanian: Teoria sistemelor). Publisher Editura Academiei Romne, 2008

56 hours correspondin g to 4 hours/week in a 14 week semester

Automatic control

Voicu M., Introduction in Automatic Control (in Romanian: Introducere in automatica). Editura POLIROM,2002 Voicu M., Systems Theory (in Romanian: Teoria sistemelor). Publisher Editura Academiei Romne, 2008

70 hours correspondin g to 5 hours/week in a 14 week semester

Course Name (3)

System identification

Subject Content (4)

This course takes a look at the structures and methods for system identification.It includes topics such as model identifiability, parametrization, and structures; mathematical models of systems from observations of their behavior; time series, state-space, and input-output models; model structures, parametrization, and identifiability; nonparametric methods; recursive estimation; relation to Kalman filters; structure determination; order estimation; robustness .

Books used (5)

Ganciu T. System identification , paper course Voicu M. - Tehnici de analiza a stabilitatii sistemelor automate - ,publisher Ed.tehnica ,1986. Murthy D. N. P., Rodin E. Y. Mathematical Modelling, Pergamon Press,1990 Kapur I. N. Mathematical Modelling, John Wiley & Sons 1988 O. Pstrvanu, Discrete event systems(in Romanian: Sisteme cu evenimente discrete Tehnici calitative bazate pe formalismul reelelor Petri), publisher Ed. Matrix-Rom, 1997 O. Pstrvanu, M.H. Matcovschi, C. Mahulea, Discrete

Hours
(6)

Grade (3)
8

56 hours correspondin g to 4 hours/week in a 14 week semester

Discrete event systems

The course has a theoretical and practical framework, based on Petri net models, for exploring event driven dynamics. This framework encompasses both untimed and timed Petri nets, the usage of the key concepts and results being illustrated by problems with analytical or computer-aided solutions.For computational approaches, the software environment Petri Net Toolbox was used. Overview of the subjects treated: Untimed Petri net models Analysis techniques for behavioral properties Procedural control of discrete event systems Analysis techniques for structural properties Deterministic timed Petri net models

56 hours correspondin g to 4 hours/week in a 14 week semester

10

Course Name (3)

Subject Content (4)

Stochastic timed Petri net models Stochastic Petri net models Max-plus models

Books used (5)

Event Systems Applications (In Romanian :Aplicaii ale reelelor Petri n studierea sistemelor cu evenimente discrete), publisher Ed. Gh. Asachi, 2002 C.G. Cassandras, S. M.H. Matcovschi, O. Pstrvanu, Petri Net Toolbox for MATLAB Petri-netbased approaches to discrete event and hybrid systems in MATLAB-Simulink, publisher Ed. Politehnium, 2008. Lafortune, Introduction to Discrete Event Systems, Second Edition, Springer, New York, 2008.

Hours
(6)

Grade (3)

Course Name (3)

Subject Content (4)

Books used (5)

Hours
(6)

Grade (3)

I declare under my full responsibility that I have given correct and true information on all of the above. Date and place ____________________________________ Signature _______________________________

1. Please define the grade system adopted in the University where you attended that course. 2. Please list only the courses you consider relevant for your future MathMods study programme, especially the courses related to Mathematics and Physics.
3. 4. 5. Compulsory datum, as reported in your transcript. Compulsory datum; minimum 100, maximum 500 characters (spaces included). Optional datum (author, title, publisher). Estimated datum referred to the total number of hours (e.g. 45 hours corresponding to 3 hours/week in a 15 week semester).

6.