This action might not be possible to undo. Are you sure you want to continue?
Faculty of Automatic Control, Electronics and Computer Science
Curriculum and Subject Syllabi
Full-time studies in English:
Automatic Control and Robotics Electronics and Telecommunication Computer Science
A Word from the Dean
The Faculty of Automatic Control, Electronics and Computer Science was founded in 1964, with 250 students and 30 academic staff members. Since then, it has expanded to 4500 students and 230 academic staff members. From its inception, the Faculty offers courses in Automatic Control, Electronics and Computer Engineering. Initially, the courses had been practically contained in one macro-course and later split into three separate courses. In the late 90’s, an idea of macro-course was restored. Apart from teaching three separate courses: Automatic Control and Robotics, Electronics and Telecommunication, Computer Science, they have been merged together into one macro-course, all taught in English. It turned out to be an innovative and long awaited for step. The macro-course, three-in-one, teaches skills in the most desirable engineering disciplines, in the areas of Robotics, Electronics and Information and Communication Technologies. Rapid progress in these areas is a challenge of our times. Moreover, the modernized English-taught version of macro-course provides all the necessary professional vocabulary, inevitable in today’s engineers’ world. Our forty years experience and internationally recognized standing will ensure that your M.Sc. degree will be of the highest rank, you will acquire all the skills that international employers are looking for. So, if your interests lay in engineering disciplines and you decide to face a challenge of modern world, do not hesitate and join us. You will be proud to be our graduate. Professor Jerzy Rutkowski
The Silesian University of Technology; Faculty of Automatic Control, Electronics and Computer Science offers studies in English:
Macrofaculty of Automatic Control and Robotics, Electronics and Telecommunication, and Computer Science
Program of these 5-year Master degree studies corresponds to common standards of technical universities in European countries. This fact makes possible, for students, to participate in student exchange programs and take part in semestral or yearly courses in foreign universities as part of their study programs. Alumni of Macrofaculty Programme are engineers whose education has interdisciplinary elements based on three areas listed in the study name, combined with practical experience and specialized knowledge in one of the three branches, chosen as leading in the final two years of studies.
During the first three years of studies, students obtain thorough education in mathematics, physics, basics of computer sciences and basic technical sciences: electrical engineering, control theory, electronics, metrology, computer programming, microprocessor systems, databases, computer networks, artificial intelligence and computer vision systems. Attention is paid on solving practical engineering problems, integration of knowledge with team-work and leading skills. Alumnus acquires skills in using up to date tools of engineering workshop, in particular CAD and automated design computer measurements systems, as well as skills in accessing information in scientific databases. Studies are included in European credit system. Students can easily participate in student exchange programs and alumni can continue their education towards PhD both in the same faculty and abroad. Specializations offered at the end of the studies guarantee a lot of flexibility and follow dynamic changes resulting from scientific developments in Automation and Robotics, Electronics and Telecommunication and Computer Sciences. The following specializations are now offered:
Databases. Proficiency in English and knowledge of English scientific and professional terminology allows him to be employed in international companies and in foreign countries. maintenance and usage of system software and applications development. Alumnus of Macrofaculty is very well prepared to join the work market in fast changing environment. measurements. thanks to creativity.Information Processing for Control. openness to new ideas. skills in team-work. Alumnus of the specialization Computers and Information Processing is prepared to carry out research and scientific tasks and to solve engineering problems in areas of electronic elements and systems design. control and medical equipment. measurement systems. 4 . Computer Networks and Systems. Alumnus specialized in Databases. building systems and computer networks and designing and administrating of databases operating in various environments and operation systems. robotic technologies. mechatronic technologies and computer systems of automation. user hardware and software design for systems in electronic and telecommunication. Electronics and Telecommunication. Alumnus of this specialization is prepared to work as designer and maintenance engineer of automatic control systems and plants. Computer Networks and Systems acquires skills in construction.
22.214.171.124 M1.5.2 M126.96.36.199.1 M1.2 Course load (hours per semester) ECTS L P Lab Algebra and analytic geometry II 30 15 5 Calculus and differential equations II 30 30 6 Circuit theory I 30 15 3 Computer programming II 30 30 4 Physics II 30 15 30 6 Theory of logic circuits II 30 2 Course Semester 3 ID M1.8 M1.3.10 M1.1 M1.1 M1.1 Course load (hours per semester) ECTS L P Lab Algebra and analytic geometry I 30 15 4 Calculus and differential equations I 45 30 7 Computer programming I 30 15 5 Physics I 30 15 4 Theory of logic circuits I 30 30 6 Course Semester 2 ID M1.3.2 M1.1 M1.2 M1.Undergraduate courses Semester 1 ID M1.3 M188.8.131.52.1 M1.4.1 M1.5.11 Course load (hours per semester) ECTS L P Lab Circuit theory II 30 15 15 6 Computer programming III 30 30 5 Introduction to electronics I 30 3 Introduction to system dynamics 30 15 4 Numerical methods I 30 3 Optimization and decision making 30 30 4 Probability and mathematical statistics 20 30 5 Course 5 .3.2 M1.2 M1.
21.12.19 communication M1.1 Measurement systems I 30 3 M1.2 M1.Undergraduate courses Semester 4 Course load (hours per semester) ECTS L P Lab M184.108.40.206.14.23 M1.2 Numerical methods II 30 3 M1.1 Course Computer graphics and vision I Data bases I Electromechanical devices Management Microprocessor systems II Operating systems I Course load (hours per semester) ECTS L P Lab 30 30 30 30 15 30 30 30 15 30 project 30 30 5 6 4 4 5 6 6 .20 M1.2 M1.2 Theory of computer science II Semester 6 ID M1.16 M1.22 M1.24.1 M220.127.116.11 Control fundamentals I 45 30 6 M18.104.22.168.7.1 M1.2 M1.13 Digital circuits 30 15 15 5 M1.1 Theory of computer science I 30 30 5 ID Course Semester 5 ID M1.1 Course Course load (hours per semester) ECTS L P Lab 30 30 5 30 30 6 30 3 30 4 30 15 4 30 30 30 5 3 Artificial intelligence Computer networks I Control fundamentals II Measurement systems II Microprocessor systems I Signal processing and M1.2 Introduction to electronics II 30 30 30 8 M1.
2 Programmable controllers II 30 project 3 M2.49 Advanced Image Processing 15 7 1.Semester 8 ID M2.Semester 9 Course load (hours per semester) ECTS L P Lab M2.8 M2.10 M2.18 Graphical programming 15 8 1.Semester 7 ID M2.9.13 Applied digital signal processing 30 15 3 M2.5 M2.1 M2.1 Final project seminar I 30 3 M2.Postgraduate courses Information Processing for Control .6 Course load (hours per semester) ECTS L P Lab Adaptive systems in control 30 15 4 CAD of control systems 30 30 project 5 Computer controlled systems 30 15 4 Hierarchical control 30 30 5 Robot vision 30 30 6 Robotics 30 30 6 Course Information Processing for Control .11 M2.2 M2.7 M2.1 M2.15 Estimation and identification 45 30 6 M2.12 Course load (hours per semester) ECTS L P Lab Advanced control 45 30 15 7 Computer integrated manufacturing 30 15 5 Programmable controllers I 30 30 6 Quality control 30 15 3 Reliability and intrinisic safety 15 15 3 Sensors and actuators 45 30 6 Industrial training 4 weeks 0 Course Information Processing for Control .17.5 M2.4 M2.3 M2.16 Expert systems 30 30 4 M2.19 Modelling and simulation 30 30 5 M2.5 ID Course 7 .9.14 Biotechnical systems 30 15 3 M2.
3 Microprocessor systems III 15 project 2 M2.50 Computer networks II 30 2 M2.21 Computer aided electronic circuits design 30 15 3 M2.20.24 Theory of information and coding 30 2 M2.Semester 8 Course load (hours per semester) ECTS L P Lab M2.36 Optoelectronics 30 15 5 M2.1 Analog circuits design I 30 30 15 6 M2.51 Cellular phone systems 30 2 ID Course Electronics and Telecommunication .31 Wireless computer networks 30 2 M2.25 Information knowledge processing 30 2 M1.1 Exchange devices I 30 2 M2.27 Bionics 30 15 4 M22.214.171.124 Programmable logic devices 30 15 4 ID Course 8 .30 Medical information systems 30 2 M2.1 Digital circuits design I 30 15 30 6 M2.23 Electromagnetic field theory 30 30 5 M2.32 Digital and analog telecommunication 30 15 15 6 M2.34 FPGA and digital processing 30 30 4 M2.1 Final project seminar I 30 2 M2.2 Digital circuits design II 30 30 7 M2.18.Semester 9 Course load (hours per semester) ECTS L P Lab M2.29 Java and programming in the Internet 30 30 4 M2.33.26 Radiocommunication 30 15 4 ID Course Electronics and Telecommunication .35 Microelectronics 30 30 5 M2.Postgraduate courses Electronics and Telecommunication .20.2 Analog circuits design II 30 30 7 M2.2 Exchange devices II 45 4 M2.Semester 7 Course load (hours per semester) ECTS L P Lab M2.28.28.
35 M2. Computer Networks and Systems .48 Windows Networks Administration 30 30 4 M2.37.47 Programming for Windows 30 30 6 M2.31 Course load (hours per semester) ECTS L P Lab Computer architecture II 30 3 Computer networks II 30 30 6 Concurent programming I 30 30 4 Digital modelling and simulation II 30 3 Introduction to compilers 30 2 Java and internet programming 30 30 4 Programming in assembler II 30 3 Software engineering II 30 3 Wireless computer networks 30 2 Industrial training 4 weeks 0 Course Databases.17.1 M126.96.36.199 Course load (hours per semester) ECTS L P Lab Algorithm and Data Structures 30 30 6 Computer architecture I 30 2 Data bases II 30 30 6 Digital modelling and simlation I 30 30 4 Microprocessor systems III 30 project 3 Operating systems II 30 30 5 Programming in assembler I 30 2 Software engineering I 30 2 Course Databases.21.1 M1.2 Concurent programming II 30 3 M2.Semester 7 ID M2.46 Industrial networks 15 15 2 M2.36.2 M2. Computer Networks and Systems .37.Postgraduate courses Databases.39.18.2 M2.43 Computer graphics and vision II 30 30 6 M2.38.2 M2.Semester 8 ID M2.2 M2.45 Distributed computer systems 30 30 5 M2.3 M1.Semester 9 Course load (hours per semester) ECTS L P Lab M2. Computer Networks and Systems .29 M2.1 M2.1 M2.38.2 M2.41 M2.36.44 DBMS Oracle 30 30 4 M2.50 Stochastic Simulation 15 15 2 ID Course 9 .2 M2.2 M1.24.40.
Semester 10 ID M2.33 Course Final project seminar Master dissertation Course load (hours per semester) ECTS L P Lab 30 2 28 10 .Postgraduate courses All specializations .
evaluating determinants by row reduction. algebraic form. nth roots.Undergraduate courses ID Course Course load (hours per semester) ECTS Semester L P Lab M1. cross product. division. equations for line in 3D space. operations. cofactor expansion. positions of two lines and distance between two lines Conic Sections and Quadric Surfaces Vector Spaces: subspecies. Matrices cont.1 Algebra and analytic geometry I M1.1. complex conjugate and its properties. . Complex Vector Spaces: Linear Transformations: kernel and range. operations on matrices (addition.2 Algebra and analytic geometry II Lecturer: Iwona Nowak Objectives of the course 1 2 30 15 30 15 4 5 The objective of the course is to present the fundamentals of linear algebra and analytic geometry and to indicate the approaches for finding solutions to algebraic and geometric problems arising in other branches of mathematics and technical applications.1. Cramer’s Rule. complex exponents. Course description Complex Numbers: complex number def. Planes and Lines in 3D Space: plane equation. rank of matrix. transition matrices and similarity Eigenvalues and Eigenvectors: Diagonalization.. distance from the point to the plane. orthogonal matrices. modulus.: inverse of a matrix. scalar multiplication. factorization. finding the inverse of matrix by Gauss-Jordan Elimination and by its Adjoint. transpose of a matrix. eq. inner product spaces. Polynomials: roots of polynomials. Systems of Linear Equations: def. properties of inverses. orthogonal projection. transformation matrix for nonstandard basis. dot product. basis and dimension. inverse linear transformation. properties of the determinants. Vectors in 3D Space: vectors in coordinate system. operations on complex numbers. DeMoivre’s Theorem. linear independence. elementary row/column operations.. Determinants: def. computer tomography and such. Fundamental Theorem of Algebra Matrices: definition. cryptography. Gram-Schmidt process. orthogonal Diagonalization. matrices of linear transformations.. identity matrix. the complex plane. Kronecker-Capelli’s Theorem. orthogonal basis. application to conic sections and quadric surfaces Applications of linear algebra: to computer graphics. diagonalizing quadratic forms. scalar triple product of vectors. positions of two planes. homogenous systems of lin.. Gauss-Jordan Elimination. Jordan canonical form Quadratic Forms: problems involving quadratic forms. matrix multiplications). Gaussian Elimination with Back Substitution. polar form.
Term-by-term differentiation and integration. computations. Metric on a set – metric spaces. Initial-value and boundary-value problems. Differentiation formulae and rules. Review of elementary functions. Fermat’s theorem. arc length). examples. Double and triple integrals – definitions. Sequences. The Laplace transformation – properties.Undergraduate courses ID Course Course load (hours per semester) ECTS Semester L P Lab M1. The method of undetermined coefficients. Critical points and extreme values – the first derivative test. Properties of n n! limits. The chain rules. Ordinary differential equations. Separable equations. properties. Asymptotes.2 Calculus and differential equations II Lecturer: Ewa Łobos Course description 1 2 45 30 30 30 7 6 The real number system – the real line – the absolute value. ratio and root tests. Power series. integration of rational functions by partial fractions. n a . Applications (area between two curves. Taylor’s and Maclaurin’s series. Series of nonnegative terms – the comparison. The total differential – definition. singular). A solution (general.1 Calculus and differential equations I M1. properties. The definite integral – definition. hyperbolic and inverse trigonometric functions. Infinite series. inverse functions. The sum of an infinite series. L’Hospital’s rules. applications. basic theorems and applications. derivation of parametric equations. Green’s theorem. The limit of a function defined on a metric space. Cauchy’s theorem. Alternating series.2. Antiderivatives and indefinite integrals. Absolute and conditional convergence. Approximation by the Taylor polynomials. cylindrical and spherical coordinates). Differentials – definition. The derivative of a function – definition. Limits of some numerical 1 an sequences: (1 + ) n . application in differential equations. differentiability. 12 . Continuity – discontinuity – properties of continuous functions. particular. the method of substitution. Sketching the graph of a function. Implicit functions. composite functions. Tangent plane. The Fourier series. n n . Extrema. Tangent line. rationalizing substitutions. Properties of convergent sequences. Change of variables (polar. interpretations. Second order linear differential equations with constant coefficients. . One-to-one onto functions. Higher derivarives. Taylor’s formula. The characteristic equation. Functions of several variables. the method of variation of parameters. Line inegrals. applications. Directional derivative and gradient vector. Linear independence of functions and Wronskian. Techniques of integrations – integration by parts. The Lagrange theorem.2. Rolle’s theorem. Linear equations of order n with constant coefficients. Partial derivatives. Parametric equations. Convergence in a metric space. Concavity and inflections – the second derivative test. The concept of a function. Fundamental theorems of calculus. First order linear differential equations.
3. Superposition of waves.4.Undergraduate courses ID Course Course load (hours per semester) Semester L P ECTS Lab M1.2 Physics I Physics II 1 2 30 30 15 15 30 4 6 Lecturer: Jacek Szuber Objectives of the course To acquaint the students with main physical concepts and their applications in modern science and technology. exceeding traditional programs of elementary programming courses by giving some knowledge involving the latest achievements in software technology. during which students have an occasion to create programs on their own.3. Energy and power in mechanics. Fundamental laws of kinematics and dynamics of rigid body.3 Computer programming I Computer programming II Computer programming III 1 2 3 30 30 30 15 30 30 5 4 5 Lecturers: Roman Starosolski . Sound waves. and some advanced problems and techniques essential for programmers.1 M1. Pendulum. basic algorithms and data structures. The program contains: introduction to imperative programming in C/C++ language (basic knowledge required to create and understand programs as well as skills essential for good software engineering and programming practice). Piotr Fabian Objectives of the course The aim of the course is to lay a solid foundation of good software engineering and programming language practice. Lectures are illustrated with slides with many sample programs. Inertial and non-inertial motions. Course load (hours per semester) Semester L P ID Course ECTS Lab M1. Simple. damped and damped and forced vibrations. Differential equation of vibration. Huygen's principle: laws of reflection and refraction.3. substantial knowledge on object-oriented programming using C++. Wave motion.2 M1. They are supported by laboratories. Course description The course provides the knowledge required to understand. Wave traveling in one dimension. Course description Fundamentals laws of kinematics and dynamics of material points. design and write computer programs in C and C++. 13 . Conservative principles in motion. Doppler effect.4.1 M1. Conservative principles Mechanical vibrations.
reduced. Planck's hipothesis .Ampere's law and Biot-Savart law.basic concepts. Inductance and self-inductance.Balmer's experiment and Rydberg formula. algebraic operations and operators.2 Theory of logic circuits I Theory of logic circuits II 1 2 30 30 30 6 2 Lecturer: Krzysztof Cyran Course description Introduction to switching circuits theory. Coulomb's law. implementation of logic functions using different gates. Classical atomic models .electron diffraction. Hydrogen spectrum . Forms of Boolean functions (canonical. Maxwell's equations. Wave function of matter. 14 . examples of combinational switching circuits. Compton effect Wave-particle duality . Quantum model of hydrogen atom. truth tables.quantization of electromagnetic radiation. basic asynchronous flip-flops – timing charts.Bohr postulates. Boolean algebra and its theorems. Schroedinger equation and its application. Gravitational field: source. Equation of state of an ideal and real gases. Periodic table of elements. essential hazard. ID Course Course load (hours per semester) Semester L P ECTS Lab M1.Boltzmann equation.gas transitions. gates. First law of thermodynamics for proper transitions. minimization. Thermal radiation .Undergraduate courses Thermal properties of gases . transformations. types of switching circuits. strength . Magnetic field: sources. Hazards – static and dynamic. etc. potential and energy. Synchronous sequential circuits – structures. Karnaugh maps. functionally complete systems. Quantum numbers. program specification. excitation tables Huffman’s method – the flow table. Chemical bonds in crystals. triggering ways Registers and counters – disigning. Heisenberg uncertainty principle. Zeeman effect. Electromagnetic induction.Stern-Gerlach experiment. translators. encoders and decoders Multiplexers and demultiplexers (simple and advanced circuits) Iterative switching circuits (adder. Energy in magnetic field. Gas pressure in the atmosphere. potential and energy. Second law of thermodynamics. Fermat's principle. Atomic structure of solid state. synchronous flipflops. Electron energetic states. flux. Botzmann distribution.5. strength. optimization).) Asynchronous static sequential circuits – structures. strength.de Broglie hipothesis . Fundamentals of quantum mechanics. Photoelectric effect. forces. Electron spin . X-Ray spectrum. flux. Pauli principle. Electromagnetic radiation. codes. interaction of light with gravity. irredundant). frequency dividers Microprogrammable circuits (different structures. Wave nature of radiation. Binary numbers.blackbody model. Maxwell-Boltzmann distribution. determining the flip-flop excitation functions.1 M1. comparator. Theory of Wien. Fundamentals of semiconductor physics. types of program specification. reduction. Rayleigh-Jeans. coding (critical and non-critical race. Faraday's law and Lenz's rule. Carnot Cycle. designing.5. Electronic band structure of solid state. Electrostatic field: sources. Physical basis of microelectronics and nanoelectronics. Newton’s force. substractor. Microscopic theory of gases . hazards).
branch. large nonlinear circuit analysis . calculation/measurement of power transmitted from one multi-terminal sub circuit to another. Kirchhoff's laws and Ohm's law in time domain. PAL. current and power calculations for complex circuits by means of Kirchhoff's laws and Ohm's law .6. voltage.2 Circuit theory I Circuit theory II 2 3 30 30 15 15 15 3 6 Lecturer: Jerzy Rutkowski Objectives of the course The aim of this introductory course is to lay down some important foundations of circuit theory and analysis for subsequent use in later courses.Undergraduate courses Circuits with delay units Design with progammable logic devices PLDs (PROM. current. presentation of circuit topology by means of its graph and definition of graph elements such as node.6. PLA) ID Course Course load (hours per semester) Semester L P ECTS Lab M1. Laplace transform: definition and basic properties. circuit diagram. ideal energy dissipating and energy storage elements. separation principle. calculation of circuit function deviation caused by design tolerances Nonlinear Circuits graphical method: analysis of circuit containing only one nonlinear element and construction of total characteristic of elements connected in series/parallel. superposition theorem. cutset and loop. two-port element as a special case of multi-terminal element. sensitivity analysis: introduction of basic definitions and terms such as absolute and relative sensitivity. node voltage.iterative method (Newton-Raphson method) Transient analysis real circuit and simplifying assumptions . such as voltage. Thevenin theorem and Norton theorem. electric energy and power: energy conservation law and power balance. dependent sources. multi-terminal elements (passive and active). D. description of a three-terminal/two-port element by means of such sources. voltage/current divider. tolerance region and acceptability region. real source. Linear Circuits Series/parallel connection of resistors. Ohm's law. current and power calculations for simple circuits practical examples.1 M1. introduction of 15 .generalized Kirchhoff's method. Course description Introduction The revision of some general definitions. definitions and time-domain u-i relationships for resistor. piecewise linearization method (analysis of medium size circuit with possibly multiple solutions). electric power and energy. node voltage method (Coltri's method) . coil (self inductance) and mutual inductance. Analysis General terms and definitions: general classification of circuit elements and their description. Kirchhoff's Current Law and Kirchhoff's Voltage Law. maximum power transfer. principles of current and voltage arrow placement. capacitor. their description and voltage/current/power calculations for circuits containing such element(s). such as Signal Theory and Electronics Fundamentals. passive and active two-terminal sub circuit.C. analysis of RL circuit in time domain (classical approach). voltage. Thevenin's and Norton's equivalent diagrams.
Undergraduate courses Heaviside's function (step function) and Dirac's function (impulse function). In this Part circuits with constants uniformly distributed are discussed. power factor and its correction. frequency characteristic. transient responses of RC and RL circuits with step input. resonance in arbitrary two-terminal sub circuit. introduction of transfer function in frequency domain. passive two-terminal sub circuit: introduction of impedance (resistance and reactance) and admittance (conductance and susceptance). transfer function in time and operator domain.C. For such circuits all functions are functions of two variables: time t and place x. boundary values based analysis of the 1st order circuits with zero initial conditions. amplitude and phase characteristics. propagation constant. analysis based on phasor-complex calculations. complex function in time-domain and complex rms function in frequency domain.C. standing waves.) are functions of time. power and energy: instantaneous. frequency filters: definition of bandwidth. such as rectangular pulse (ideal and real) and others A. series and parallel resonance (LC/RLC and LC/GLC): definition of resonant frequency. medium and high frequencies. 3-phase network: connections. Kirchhoff's laws and element equations (for ideal elements) in frequency domain. analysis of the 2nd order circuits with zero initial conditions: Heaviside's formula. introduction of phasor diagrams. analysis and power measurement. introduction of line parameters: characteristic impedance. transformers: ideal and air-core: two-port equations and schemes. calculation of responses for complex inputs (other then step inputs). The following subjects related with a transmission line are contained in this part: two-pole equations in time domain and in operator domain. transmission line Circuits with lumped constants have been discussed so far. current. step and arbitrary a periodical (pulse) input: general and special cases (distortion less and loss less line. reflection coefficients. etc. voltage and current phasor diagrams. input imedance 16 . maximum power transfer. apparent and active power. phasor diagram that matches a circuit topology. element equations and circuit laws in Laplace operator domain. For such circuits functions (voltage. coil with ferromagnetic core and transformer with ferromagnetic core: diagrams for low. real inductor and capacitor: equivalent diagrams and frequency analysis. infinite length/matched load line). ideal and practical integrator and differentiator. bandwidth and Q-factor. transient response of line with zero initial conditions. amplitude characteristic in logarithmic scale . The most typical case of such circuit is a transmission line. introduction to the phasor (complex) description of a function.Bode plot. Circuits with constants uniformly distributed. calculation of transient sinusoidal response for the 1st order circuit. reactive. AC analysis. rms value. exclusively. detailed analysis of the series RLC circuit. classification and the simplest practical realizations. algorithm of A. superposition of responses (natural and forced response). Analysis description of a periodic function: average value. mutual inductance M in AC circuit: two-port equations in phasor (frequency) domain. analysis of circuits with non-zero initial conditions.
Simplified theory of feedback: types of feedback systems. V-I characteristics. Second students learn basic tools of analysis of dynamical systems and some facts about classification of their possible behavior. noise reduction. basic amplifiers: CE. capacitance of the junction.1 M1. Basic RC circuits. Intrinsic and extrinsic semiconductors. current sources. Differential amplifier: large and small-signal analysis. Integrators and differentiators.7. Resistors. electric field and voltage distribution. Schottky diodes. basic characteristics and parameters. P-N junction: charge density. Sample & hold circuits. current mirror. Power amplifiers: class A. basic applications. Analogue comparators. influence of negative feedback on gain. displays. CG. light emitting diode. gain and phase margins. Bipolar transistors: principle of operation. B.Undergraduate courses ID Course Course load (hours per semester) Semester L P ECTS Lab M1. C amplifiers. current sources.7. NMOS and CMOS gates. Regulated power supplies: IC voltage regulators. basic amplifiers (CS. Rectifier systems. Various types of diodes: Zener and avalanche effects. Sine wave oscillators.8 Introduction to system dynamics 3 30 15 4 Lecturer: Andrzej Polański Objectives of the course Objectives of the course are twofold. photodiode. stability. biasing circuits.2 Introduction to electronics I Introduction to electronics II 3 4 30 30 30 30 3 8 Lecturer: Zdzisław Filus Objectives of the course To provide a basic understanding of the operating principles of semiconductor devices and an introduction to the theory and operation of electronic circuits Course description Introduction: definitions and basic features of analog and digital signals and circuits. Logarithmic scale and Bode plots. efficiency. Square wave and ramp oscillators. input and output impedances. principle of operation. CD). varicaps. Operational amplifiers: ideal and non-ideal amplifier. bandwidth. contact potential. optocouplers. Analogue-to-digital and digitalto-analogue converters: basic methods of conversion and their comparison. CB and CC. ID Course Course load (hours per semester) Semester L P ECTS Lab M1. analog switches. 17 . Field-effect transistors: operation of JFETs and MOSFETs. switching characteristics. Optoelectronic devices: photoresistor. voltage-to-current characteristics. small-signal equivalent circuits. biasing circuits. Ebers-Moll model. switching regulators. First it is intended that students get some experience in the field of constructing mathematical models for various applictations. linear piecewise models. capacitors. inductors and transformers. switching characteristics.
Finally some examples of dynamical systems with distributed parameters are presented. Method of state space and isoclines is derived. electronics. Method of averaging for approximate description of nonlinear oscillations is derived. genetics. Methods of simplifying model equations by using symmetries and approximations are shown. Errors of series expansions. ecology. Two types of electromechanical analogies are presented. The method of eliminating part of system variables by using first integrals is presented. The first type. Relative errors. mechatronics etc. Absolute errors. Some approaches to solving and analyzing dynamic equations are presented. mechanotronics. based on correspondences between types of energies leading to current – velocity and voltage – force analogies and second type. Rules of computing potential and kinetic energies and dissipation power of typical elements of dynamical systems are presented. electronics. The concept of state variables. Definition of analytical function of real variable.9. Errors of algebraic computations. First integrals of systems are defined and examples are given of their use. Several types of balances are overviewed and examples in many areas are provided. Construction of state – space models for electrical systems with voltage across capacitors and currents through inductances.Undergraduate courses Course description As an introduction. Many examples are studied in mechanics. is presented. Solvable models and models solvable by quadratures are discussed and the role of analytical methods in dynamical systems analysis is highlighted. Taylor and Maclaurin series expansions. Perturbations and singular perturbation methods of approximate analysis of nonlinear systems dynamical behavior are shown. the course starts with the overview of some methods of building mathematical models in several areas: mechanics. 18 . is shown. chemical process dynamics. Computation of values of the functions. Electromechanical analogies are then discussed.9. Course description Theory of errors. inputs outputs and constant or time variable parameters is introduced. ID Course Course load (hours per semester) Semester L P ECTS Lab M1. It is demonstrated that mathematical modeling of dynamic behavior of systems leads to ordinary differential or difference equations or partial differential equations.2 Numerical methods I Numerical methods II 3 4 30 30 3 3 Lecturer: Jerzy Klamka Objectives of the course To provide an overview of different numerical methods with several examples. In the subsequent parts of the course the interest is focused on systems described by ordinary differential and difference equations. Several properties and types of dynamic systems are studied. In the first part method of deriving motion equation by balances is presented. by linearization. The method of Lagrange Equations is presented and its interpretation on the ground on variational theory and Hamilton principle is given. Types of errors. Linear dynamical systems and their solutions are presented.1 M1. based on diagrams correspondences leading to voltage – velocity and current – force analogies. Approximate analysis around equilibria. The application of variational principles to dynamic systems modeling is then introduced.
Discrete method for parabolic type partial differential equation. Errors of interpolation. Approximate solution of partial differential equations. It concentrates on methodology of obtaining minimizing or maximizing solutions and developing numerical algorithms supporting this process. Differential operators and their connections with difference operators. Relationships between different integration methods. The method of finding the greatest real eigenvalue and corresponding eigenvector. Examples. Examples. They allow solve some crucial and complex infinite dimensional problems including those arising in consideration of time dependent functions as it is the case in optimal control design. Approximate solution of the integral equations. Systems of linear equations and ots solution.Undergraduate courses Interpolation. Neumann’s method. Relationships between different interpolation polynomials. Definitions of eigenvalues and eigenvectors. Examples. Examples. Different types of approximation. Approximate solution of ordinary differential equations. Lagrange’a interpolation polynomial. Approximate intervals methods. Newton’s interpolation polynomial. Geometric interpretation. Examples. Formulation of numerical integration. Simple and intuitional interpretation of both static and dynamic systems is possible due to functional analysis . The first part of the course is just the minimal introduction to the functional analysis and 19 . Line method for parabolic type partial differential equation. Examples. Examples. Least square approximation method. their properties and computations methods. Iterative methods. Point approximation. Eigenvalues and eigenfunctions. Linear difference operators. Taylor’s method.10 Optimization and decision making 3 30 30 4 Lecturer: Andrzej Świerniak Objectives of the course This course is concerned with optimization theory and computational methods with special emphasis on their application in optimizing design and decision making. Formulas for numerical differentiation. Approximation. Formulation of the interpolation problem. Tchebyshev polynomials and their application in uniform approximation. Space of square integrable functions.a science about linear vector spaces. Uniform approximation in the space of continuous functions. Examples. Algorithm of Gauss elimination method. Examples. Runge-Kutty method. Piccard’s method. Newton-Cotes formula for numerical integration. Course description The main idea of this course is that a major part of optimization theory could be unified by a number of concepts and theorems from theory of vector spaces. Numerical differentiation. Formulation of the approximation problem. Approximate solution of nonlinear equations. Numerical integration. Newton’s interpolation polynomial with difference operators. Approximate solution of the integral FredholmVolterra equation. Bernoulli method. ID Course Course load (hours per semester) Semester L P ECTS Lab M1. Examples. Newton's method. Other numerical integration methods. Examples of orthogonal and orthonormal bases. Solution of systems of linear equations.
resource allocation. The probability part starts with set theoretic concepts such as sigma-algebras. Then. Using this very introduction it is possible to formulate some necessary conditions for optimality of solution to some unconstrained and constrained problems. Course description The course consists of two parts: probability theory and mathematical statistic. The special attention is paid to the Bellman's principle of optimality and resulting techniques of dynamic programming. Once more the unified approach in derivation of the whole family of gradient type and Newton type algorithms is very helpful. and time series. The lecture is supplied by the computer laboratory. 20 . This is for example the case of standard linear or nonlinear programming methodology including Simplex algorithm and its "successors". For example the standard necessary condition of the unconstrained extrema of a differentiable functionals enables to solve classical variational problems and leads to Euler-Lagrange equations. and denumerable operations on sets. Of course some results and algorithms typical for very specific problems should be treated separately. free and moving terminal point. Joanna Polańska Objectives of the course The objective of this course is to give a theoretical basis of probability theory and statistics in very general context and to demonstrate the possible applications of this theory to applied models in system engineering. time-optimal problems.11 Probability and mathematical statistics 3 30 30 5 Lecturers: Marek Kimmel. It allows however to demonstrate efficiency of this methodology on a number of standard and real-world problems including linearquadratic problems. This part of the course is devoted to the most popular numerical optimization algoritms. in operation research. izoperimetric problems for a number of different constrained optimization problems. fixed or free terminal time for systems described by ordinary differential or difference state equation with piecewise continuous control functions and additional constraints imposed only on the values of control variables. On the other hand the use of two Lusternik theorems opens a possibility of derivation of the general Kuhn-Tucker conditions and offers a very good interpretation for Lagrange multipliers. For the tractability only the simple extensions are presented including problems with fixed. This enables in turn to specify some efficient methods in algorithms in the paticular optimization problems by simply choosing the space in which the general result should be applied. optimal harvesting problems etc. The model of the controlled plant is treated as a number of constraints imposed on the optimization problem and resulting Hamiltonian optimization conditions are interpreted in view of general Lagrange or Kuhn-Tucker conditions. Then by extending the space and class of possible functions the students are led to the Pontryagin maximum principle. grid techniques and a variety of flow problems in networks. Of course it is appended by an analysis of computational properties of the algorithms specified for the specific problems.Undergraduate courses more precisely to its branch related to optimization techniques. ID Course Course load (hours per semester) Semester L P ECTS Lab M1. costate variables. The course contains derivation of Bellman's equations basing on the principle of optimality for both discrete-time and continuous-time systems and focus attention on a number of their possible applications including once more linear-quadratic problems.
examples and basic notions. Finally we present the basis of the analysis of frequencies. the least squares method and the method of moments. Dynamic system properties. The second part starts with the survey of the methods of simple statistical testing where special emphasis is put on the hypothesis tests for the mean and variance of a normal population. Feedback systems prop21 . All the theoretical material is broadly illustrated by the examples whose purpose is to help understanding the theoretical concepts and to show the possibility of applications of the probability methods in engineering practice. We introduce the measures of correlation (for both Gaussian and non – Gaussian random variables) and basic statistical tests. Controllability and observability and their relation with transfer function and minimal realization description. Law of Large Numbers and Central Limit Theorem are discussed (with proofs sketched). Independence of events is shown to lead to strong results such as Borel-Cantelli theorems and Kolmogorov 0-1 law. in probability and with probability 1) is illustrated by examples. transfer functions. Then we give a general introduction to linear regression and consider the estimation problem for unknown parameters of probability distribution. Random variables are introduced as measurable maps from the probability space in to the set of real numbers with Borel sigma-algebra. normal. ID Course Course load (hours per semester) Semester L P ECTS Lab M1.12. multivariate normal. Distribution functions are discussed. including conditional probability follow. geometric. dynamic and static elements. Mathematical models of dynamic systems: differential equations. uniform. state equations and their linearization. time and frequency responses.Undergraduate courses probability is introduced as a denumerably additive nonnegative normed set function. Control systems structure. illustrating more general notions such as limit and stationary distributions.1 M1. Finally. Here we discuss the following three main methods: maximum likelihood method. Closed loop system description. gamma and chisquare). waiting times and so forth. Next we focus on the way of describing the relations among random variables. Steady state characteristics.12. Solution of the stationary state equations. Stability of linear systems. fundamental matrix. Hurwitz stability criterion. Course description Feedback control systems. including important examples of continuous and discrete distributions binomial/Poisson. Monotone and Dominated Convergence theorems follow. Basic dynamic elements. exponential. Expected values are defined as Lebesgue integrals of random variables. relations between different models. Convergence of random variables (in distribution.2 Control fundamentals I Control fundamentals II 4 5 45 30 30 6 3 Lecturer: Ryszard Gessing Objectives of the course To give a basic knowledge which are needed in majority of the courses in Automation and Robotics as well as useful in Electronics and Telecommunication and in Computer Science Programs of Study. Then the nonparametric methods are introduced followed by the ANOVA algorithms. Properties of probabilities. block diagrams. time-discrete and time-continuous Markov processes and Poisson processes are introduced.
multipliers. Memories: static and dynamic RAMs. CMOS and BiCMOS devices. Stability. digital circuits families. symbolic data representation. microprogrammed control units. Basic combinational circuits: complex gates. Closed-loop systems stability. settling time. characteristic equation of the closed-loop system. dynamic properties shaping. EEPROMs. The practical digital devices will be designed and built in the Designing of Digital Devices Laboratory which is equipped with digital modules and racks with power suppliers. PID. buses. Root-locus method.Undergraduate courses erties: disturbance influence compensation. FPGA. Stability of the systems with delay. Course description Basic information about digital signals: quantization and coding. basic operation and characteristics of TTL and CMOS gates. Long transmission line effects and line terminators. binary codes. characteristics linearization. General rules of data transmission: structure of digital system. Pairing of inputs and outputs. Introduction to FPGA and ASIC design methodologies and hardware description languages.13 Digital circuits 4 30 15 15 5 Lecturer: Wojciech Sakowski Objectives of the course The aim of the course is to instruct the students in structures of digital integrated circuits and their applications in digital systems design. Data input: keys. decoders. Nyquist criterion. overshot. Flash memories. multiplexors. Characteristic equation. use of the Hurwitz Criterion. Arithmetic circuits: adders and subtractors for binary and BCD Excess 3 numbers. Quality of the Control. floating point arithmetic. regulator parameters tuning. binary coded decimal numbers (BCD). Stability and its analysis. Sequential circuits: flip-flops. structure of data displaying circuits. Discrete-time transfer functions. stability analysis and conditions. immunity to interference static and pulse noise margins. shift registers with feedback. Linear quadratic method. ROMs. 22 . Multivariable systems design. Compensators. keyboards. Control unit design: hardwired control units. counters. Block diagrams transformations. PAL. Method basing on roots placement. fixed point positive and negative numbers. Steady state analysis. regulators P. Bode and Nichols plots. feedfarward. stability conditions. asynchronous serial and parallel data transmission. its derivation and application using Nyquist. ID Course Course load (hours per semester) Semester L P ECTS Lab M1. Multivariable systems and their description using state equations and matrix transfer functions. TTL family: structures and parameters of basic gates. registers. UVEPROMs. methods basing on frequency responses-applying to control systems design. Feedback. combined and cascade systems. Data output: LED and LCD displays. number comparators. Z – transform and its applying to systems description. comparison of TTL integrated circuits with ECL. PI. Linear discrete-time systems. Programmable logic devices: FPLA. The problems presented during lecture will be illustrated by means of selected examples solved by the person leading the classes. handshaking. General description of digital integrated circuits: scale of integration. Time response specifications: steady state error. PD. stability degree. Continuous-time versus discrete-time systems.
ID M1.14.1 M1.14.2
Course Measurement systems I Measurement systems II
Course load (hours per semester) Semester L P Lab 4 30 5 30
ECTS 3 4
Lecturer: Jerzy Frączek Objectives of the course To acquaint the students with measurement systems. Course description Introduction: scope of lectures, literature; integration of intrinsically safe field instrumentation into industrial communication networks; intelligent sensors; institutions: IMEKO, IFAC, EUROSENSORS, PSST – Polish Society of Sensors Technology, COE – Optoelectronic and Electronic Sensors. Smart sensors: Measurement of fluid flow by means of pressure differential devices - orifice plates and Venturi tubes. Smart interface. The essential sub-systems; list some of the main sensor defects. Zener Barriers (Ex). The general measurement system: purpose, general structure,. elements of system. Definition of sensor; sensor classifications. Example: “Weight measurement system” – elements of system; strain gauges (conventional and silicon). Vocabulary of Basic and General Terms in Metrology: static characteristics - range, span, zero, zero drift, sensitivity, resolution, response, linearity, hysteresis, calibration, accuracy; dynamic characteristics. Specialized measurement system: gas chromatography – column, carrier gas, solid particles, thin layer of liquid composition, HETP – Height Equivalent to a Theoretical Plate, chromatogram, retention time. Detectors: TCD – Thermal Conductivity Detector (katharometer), FID – Flame Ionisation Detector, ECD – Electron Capture Detactor. Non–Dispersive Infra-Red (NDIR) gas analyser: IR transmission characteristics, one path system, two path system, IR emitters, rotating chopper disc, reference cell, sample cell, radiation detectors (selective or non-selective), transfer equation. ITS-90 – The International Temperature Scale of 1990: triple points, freezing points, melting points, interpolation instruments – platinum resistance thermometer, gas and vapour thermometers, radiation pyrometer; interpolation equations; thermodynamic (Kelvin) and empirical (Celsius) scales. Thermal radiation measurement system: high temperatures, moving body, temperature distribution over a surface; “black body”, Planck’s law, emissivity of real body, characteristics of transmission medium; general form of thermal radiation measurement system, optical focusing system without and with lens, transmission characteristics, detectors – thermopiles, bolometers; total detected power, output signal. Pressure (pneumatic) measurement system: elements of system; metal resistance Strain Gauge tensile stress, compressive stress, longitudinal strain, transverse strain, elastic modulus, Young’s modulus, Poisson’s ratio, GF – Gage Factor; characteristics of system.
Undergraduate courses Review of sensors: conventional, thick, thin and semiconductor technologies; Strain Gages, Zirconia Cell (ZrO2), magnetic (mechanical) sensors, electromagnetic sensors, chemical sensors, gas sensors, resistance and thermocouple sensors. Reliability of measurement systems: reliability, unreliability, MTBF - Mean Time Between Failures, failure rate, variation of failure rate during lifetime of equipment – “bathtub” curve, reliability of a system of n elements in series or cascade, availability, methods of improving the reliability of measurement systems.
Course load (hours per semester) Semester L P
Theory of computer science I Theory of computer science II
Lecturer: Krzysztof Trocki Course description Algorithms. Definition of an algorithm; Ways of describing algorithms; Criteria for comparing algorithms (time and space complexity) Turing machine. Concept of a reasonable computing machine; Turing machine; Universal Turing machine; Formal grammars. Definition of formal grammars; Classification of formal grammars; Grammar of the Reverse Polish Notation; Basic components of a computer. Major levels of computer design; - Components of the machine W; Von Neumann's architecture, introduction to the machine W. Von Neumann's architecture; Introduction to the organization of the machine W Designing program control unit and instruction set for the machine W. Designing instruction set for the machine W; Microprogrammed and hardwired implementation of the program control unit; Designing the program control unit for the machine W Programming in assembly language of machine W. Addressing arrays with the use of selfmodifying programs Input / Output functionality. General architecture of input / output devices; Input / output module; Interrupts; Direct Memory Access; - Evolution of input / output functions System software. Assembler; Compiler Management of resources and synchronization. Safety analysis (Data corruption); Liveness analysis (Deadlock); Classical problems of synchronization
Course load (hours per semester) Semester L P
Lecturer: Ewa Straszecka Course description What is Artificial Intelligence. Methods of AI problems representation. Human and artificial intelligence - similarities and differences. Definitions and branches of AI. A scheme of AI history. AI nowadays - fields and tasks. Knowledge representation. What is knowledge? Elements of knowledge: objects, features, relations, classes, facts and rules. Procedural vs. declarative representation of knowledge. Methods: decision tables, semantic networks, frames, scripts, predicates, rules. Examples. Conditions of complete and sound knowledge description - examples. Reasoning Methods. Mathematical logic as a ground for reasoning. Concepts of truth, a fact, an evidence, and a problem. Different approaches to reasoning in AI: Induction: learning as an example of induction. Tools of induction e.g. generalization, replacement of values by variables. Traps of analogies. The role of generalization in knowledge gathering. Examples of EURISKO inductive reasoning. Deduction vs. abduction: choice between efficiency and human-like reasoning. Modus ponens. Reasoning with certainty measures. Probabilistic reasoning: Conditional probability and Bayes’ formula. Propagation of conditional probability in Pearl’s networks. Difference between belief measure and probability. Dempster-Shafer theory of evidence based on basic probability assignment. Differences between basic probability assignment and probability distribution. Fuzzy reasoning: Fuzzy set. Generalized modus ponens. Fuzzy rules Expert systems. Definition and tasks. Various structures with applications: semantic networks (TOXOPERT, CASNET), frames (CENTAUR), rules (MYCIN). Inference in expert systems: forward chaining and backward chaining. What is bi-directional reasoning ? Certainty measures in expert system reasoning: probability (ILIAD), certainty factor (MYCIN), fuzzy sets (CADIAG). Various solutions of the same diagnostic problems: Hepar and Hepaexpert. AI computer languages. Basics of PROLOG and LISP standards. Understanding of lists, backward chaining and recursive rules. Algebraic operations. Natural language processing. Syntactic and semantic analysis. A syntactic analysis of a sentence top-down and bottom-up parsing. Chatbots – ELIZA and ALICE systems of dialogs. Context-free grammars and analysis of signals. Augmented Transition Networks - examples, the use of ATN to a computer dialog and a translation of languages. Some procedures used in ATN. An analysis of natural language in medicine. SNOMED and ICD-9 - codes and thesauri. System WAREL for data search. Fuzzy sets in identification and Control. Norms and conorms. Operations on fuzzy sets. SugenoTakagi rules and identification. Mamdani-like control. Clustering. ISODATA and FUZZY ISODATA algorithms with examples. Neural networks. Development of neural networks (NN), their theory and applications during the last decade. Nonlinear nature of a neuron (basic building block of NN) as a ground for many scientific problems solving. Examples of NN application in: system identification, adaptive filtering and blind adaptation. The model of perceptron and its development to artificial retina implant.
Serial port. PIC family microcontrollers . advantages and disadvantages. Arithmeticallogical unit. Pins. basic machine cycles. Modern microcontrollers. AVR family microcontrollers . programming.Undergraduate courses status of networked computer system. operation modes. 8086 microprocessor. planning the structure. Adam Milik Course description Microcomputer and microprocessor. Single-chip microcomputer 8051. I/O circuits. Single-chip microcomputer 8051. Multiprocessor communication. Serial transmission circuit 8251. Internal registers. DMA. Interrupts. Special registers. applications. structure. programming. Serial transmission circuits and timer-counters. addressing modes. ALU. Internal RAM. addressing modes. Internet services for engineering education. Pins. additional interrupts. registers. registers.project 5 6 7 30 15 15 30 15 4 5 2 Lecturer: Bartłomiej Zieliński. Reset. structure. Co-operation with 8086. Novell NetWare system – concept. low-power modes. I/O ports. Floating point coprocessor 8087. Command list. 27 . Buffering. 8259 and 8259A. Files and data security. interrrupt controller. programming. flags.18. Structure.data and program memory organisation. registers.18. Advanced functions of parallel I/O devices (selected properties of Z-80 PIO). Logical and physical addresses. operation modes. Timer-counter unit 8253. registers. programming. operating modes. Accumulator. Expanding the central unit: external program and data memories. Memory organisation. 8237. Programming in the UNIX system shell language. Examples of daisy-chain and cascade connections. Interrupts. commands groups. Data types. DMA controllers 8257. Machine and command cycle. network directory services (NDS).2 M1. Harvard architecture . Principles of von Neumann architecture. structure. separate I/O and memory-mapped I/O. Universal register 8212. EU and BIU blocks. Data exchange between the microprocessor and its environment: polling. ID Course Course load (hours per semester) Semester L P ECTS Lab M1. Interrupt controllers 8214. interrrupt controller. Registers. Addressing modes. How to simply organise a parallel transmission with acknowledgement. operation modes. operation modes. Devices addressing.3 Microprocessor systems I Microprocessor systems II Microprocessor systems III . Advanced functions of DMA controllers (selected properties of Z-80 DMA). Serial (synchronous and asynchronous) and parallel transmission. structure. filesystem structure.data and program memory organisation. Programmable circuit 8255. Structure. 8051 microprocessor programming.properties. Parallel I/O. programming techniques examples.18. interrupts. Timer-counter unit. flags. Information and data transfer between users in multi-user computer system. Changing access rights to files in multi-user operating system.1 M1. segmented memory organisation. registers. Cooperation with 8-bit and 16-bit microprocessors. Minimal and maximal operation modes.
Interrupt table in real and virtual mode. Code optimisation. signals. EISA. directory elements. Cache. Cache memory. connection to the microprocessor. architecture. Discrete spectrum. Pentium Pro. Structure. RAMBUS Modern microprocessors. Pipelining. Microprocessor 80386. Task state segment. Improving microprocessor efficiency. Command list enhancements and new data types.Undergraduate courses Microcomputers IBM PC/XT and PC/AT. Pipelining. Device classification. MCA. basic properties. analog circuit design and others. PCI signals and cycles. Branch prediction. Pentium and Pentium MMX microprocessors. Microprocessor 80286. Registers and flags. ISA 8. new properties. Logical and physical addresses. Pentium II. configuration memory. Signals. 80486 Microprocessor.and 16-bit buses. Cache.a short comparison. ID M1. Periodic signals in linear. DDRAM. segment descriptors. Command dependencies solving. architecture development. Periodic signals: orthogonality. Intel Itanium and AMD Hammer . Serial transfers. Interrupts in PCI system PCI bus. Superscalar microprocessor. co-operation with 80287 coprocessor. Microprocessor evolution from 8086 to 80486. TLB buffers. Course description The course on Signal Processing and Communication covers the following topics: Introduction to signal processing: definition of signal. AMD Athlon. new properties. Pipelined FPU. The course can be regarded as foundation to more specialized courses like digital signal processing. AGP bus. MMX commands and data types. computer structure. BTB table. operation modes.19 Course Signal processing and communication Course load (hours per semester) Semester L P Lab 5 30 30 ECTS 5 Lecturer: Katarzyna Mościńska Objectives of the course The main goal of the course is to give students the basic knowledge concerning signal processing. IBM PC Microcomputer. Task protection. PCI bus. virtual mode addressing. Write buffers. instruction pairing. Interrupts and exceptions. Access to the configuration memory in IBM PC. SSE. page directory structure. Some special signals of interest. Intel Pentium 4. Instruction decoding. 28 . Equivalent forms of Fourier series. Signal properties. organisation. Modern memories. Microprocessor identification. Structure. co-operation with 80287 or 80387 coprocessors. EPIC. Paging. L1 and L2 cache. 64-bit architectures: VLIW. virtual mode addressing. descriptor registers. Parseval’s theorem. shift invariant systems. 80486 Microprocessor. RISC kernel operation. Trigonometric Fourier series. Reservation Station. VLB buses. Execution units. System segments and gates descriptors. Structure. MESI protocol. 3Dnow. Pentium III microprocessors. Memory Reorder Buffer. static and dynamic methods. DRAM (SDRAM). Structure of PCI bus equipped computer. Reorder Buffer. Segmentation.
Sampling and its implication: ideal sampling in the time and frequency domain. Shannon’s theorem. Realization of modulation/demodulation. NURBS and beta-splines. Frequency transformations. Making ray tracing efficient. Representation of a digital circuit: difference equation. Lighting model. FFT decimation-in-time algorithm. Mofphological image proc29 . Linear vs circular convolution. Changing coordinate systems. Ideal and realizable filters. Stochastic sampling. Reflection and Illumination Models. Aliasing. 2D Unitary Transforms. Fourier transform: definition. Shadows and Textures. Fourier transform. properties. Hybrid radiosity and ray tracing. convolution. 2-D and M-D discrete system. Illumination source models. Short time Fourier transform. Bicubic parametric patch nets. Scalar and vector quantization. Rasterization.20 Computer graphics and vision I Lecturer: Konrad Wojciechowski Course description 6 30 30 5 3-D and M-D Geometry in Computer Graphics and Computer Vision. Signal modulation: amplitude and frequency modulation – basic terms. Reflection-illumination model. properties. Introduction to analog filter design. Keyframing systems. Sampling Theory. Power and energy signals. system function. Constructive solid geometry. Realizable filters. Affine transformations. 2D and 3D texture. Explicit motion specifications-trajectory approach. linear – time invariant systems. Fourier transform of discrete – time signals: definition. Discrete –time description of signals and systems: basic sequences. use in signal processing. Representation of Objects. Discrete argument. Recursive implementation of ray tracing. Relation of frequency characteristic to impulse response. Continuous argument. Cosine and sine transform. properties. Hidden surface removal. Rendering Algorithms. LUT with reflection model. Course load (hours per semester) Semester L P ID Course ECTS Lab M1. PDE. Approximation to a surface patch using polygon mesh. Z-transform. Color and Color Spaces. Ray Tracing. Radiosity theory. Continuous image stochastic representation. Development of the radiosity method. System function of a digital filter. Empirical transparency. description in time and frequency domain. Wavelet transform. Distributed ray tracing. Karhunen-Loeve transform. Radiosity. The Cook and Torrance model. M-D unitary transforms. 3D Computer Animation. Volume rendering algorithms. Discrete 2-D Linear Processing. Viewing Systems. Space subdivision techniques. Ordering statistics. Polygonal representation. Parametric representation of 3D solids and curves. Image sampling and reconstruction. Nonlinear transforms. Discrete image stochastic representation. Bandwidth and efficiency. Superposition and convolution. The Phong reflection model. Image Representations. Modeling objects with bicubic parametric nets. Fourier transform. region of convergence. Basic algorithm. Texture and their models.Undergraduate courses Frequency representation of aperiodic signals. Shadow algorithms. (Option) Advanced topics: Time – frequency representation. Definition and properties of DFT. Linear convolution with DFT. DFT and FFT. Shadows. Uncertainity principle. Aliasing. B-spline. Parallel versus perspective projection. Prefiltering. Fourier approach. Incremental shading techniques. Hadamard and Haar transform. Laplace transform. Culling and clipping. Discrete 2-D and 3-D Nonlinear Processing. block diagram. Wavelet transform. Butterworth lowpass filter. pole – zero pattern. Shadows and their function. causality criterion. Versors and tensors. Z transform: definition.
outer joins. Color and multispectral image enhancement.users. rotation. Lamination of magnetic cores. Advanced searching . Data Query Language (DQL). Security in databases . soft and hard magnetic materials. zooming. 30 . ID Course Course load (hours per semester) Semester L P ECTS Lab M1. permanent magnets. Edge crispening. hysteresis . Image segmentation. Equivalent circuits. triggers. projections. Models of databases – network. hierarchical and relational models.Data Definition Language (DDL). Architectures of modern database systems – client-server and 3-trier architectures. Noise cleaning. Data Manipulation Language (DML). theory and performance. Developing databases – functional dependencies.primary and foreign keys.21. Course description Usage of databases – functions and architecture of Database Management System (DBMS). Perspective transformation. Pattern recognition. normal forms. opening closing. Steady-state and transient operation. Scene Reconstruction. Image Improvement. views. joins. nested queries. Magnetically coupled circuits. Gray scale image morphological operations. Hit or miss transformations. Point to point. Concurrent access to databases – locks. rights. roles. Geometrical Image Modification. hysteresis and eddy current losses. Image feature extraction. Single and three-phase transformer: construction.2 Data bases I Data bases II 6 7 30 30 30 30 6 6 Lecturer: Paweł Kasprowski Objectives of the course The purpose of the subject is to teach students how to develop and use modern database systems. Classification.Undergraduate courses essing. functions. Shape analysis. lines and regions correspondence. ID Course Course load (hours per semester) Semester L P ECTS Lab M1.grouping data. ERD diagrams.1 M1. Stereovision and active vision. Programming in databases – stored procedures. Concentrated winding: inductor. Spatial warping. Enhancement. aggregations. Preserving database referential integrity . Relational algebra – selections. correlations. isolation levels. Translation. Structured Query Language (SQL) . erosion. Image Analysis.21. Dilatation. Searching in relational database using SELECT phrase.22 Electromechanical devices 6 30 15 4 Lecturer: Krzysztof Kluszczyński Course description Properties of materials: B-H curves. transactions.
ID Course Course load (hours per semester) Semester L P ECTS Lab M1. Stability margin. Converters for AC drive systems. Steadystate and transient operation. Switched Reluctance Motors (SRM). Single-phase induction motors. The laboratories are focused on basic elements of a workstation operating system maintenance (Windows XP and Linux used as the examples). Application and control schemes of small electric motors. DHCP) and the remote access methods. Performance of converter-fed synchronous machine. Steady-state and transient operation. who choose the Computer Science specialisation . Stepping motors. input-output operation handling. Solid-state converters for DC drive systems and speed control. some network services (like DNS. shunt and separately excited machines. theory and performance. Load angle-torque characteristics. mutual process communication and synchronisation. Basic functions and supported services are described. following with monitoring. system tuning and ending with general troubleshooting issues.24.1 M1. The first part of the course . Alternating Current (AC) machines. Basic types of DC machines: generator and motor operation. The second part of the course . Synchronous machines: construction. Distributed windings and magnetic fields of AC machines.Undergraduate courses Basics of electromechanical energy conversion: force and torque development. theory and performance. Generator and motor operation of salient-pole and cylindrical-rotor machines. Methods of starting and synchronisation. process queue. Equivalent circuits of slip-ring and squirrel cage motors. pitch and breadth factors. Permanent Magnet motors. Steady-state and transient operation. although the students' attention is focused on the configuration of the server side of the above mentioned services (Windows 2003 and Linux are used as the examples). Equivalent circuits.which is obligatory only for those. This part describes the distributed file systems. Basic types of induction motors. public key infrastructure related topics. virtual memory mechanisms. like: the idea of a process. Speed control: U/f and vector control schemes. The laboratories reflect the lectures. Starting methods. 31 . Hysteresis motors.comprises the theoretical aspects of an operating system related problems. starting with its installation and everyday routines. Starting methods.which is obligatory for all students . the directory services. Control schemes for rotor positioning. a thread. file systems and data mass storage systems management. General aspects of motor selection for electrical drives. Performance of converter-fed induction motors. data management. Speed-torque characteristics. Equivalent circuits of series.2 Operating systems I Operating systems II 6 7 30 30 30 30 6 5 Lecturer: Grzegorz Hryń Course description The main goal of the Operating Systems course is to make the students familiar with the general concepts of an operating system acting as a basic piece of software in every computer system. DC servomotors. memory management issues. Basic types of synchronous machines.24. Direct Current (DC) machines: windings and commutation. Asynchronous machines: construction.aims at presenting the network related topics. Winding.
Adaptive control systems with model identification. Autotuning. attenuating deterministic disturbances. Improving numerical properties of recursive estimation methods. Deterministic disturbances: description. Choice of poles and zeros for desired control system characteristics. Open loop unstable and non-minimumphase plants in adaptive control. Model reference adaptive control systems. Predictive controllers based on parametric and nonparametric plant models. Demands concerning adaptive control systems stability. Simulation experiments’ role in analysis and synthesis of adaptive control systems.1 Adaptive systems in control 7 30 15 4 Lecturer: Jerzy Mościński Objectives of the course The main objective of the course is to provide the students with basic and advanced knowledge concerning theory. Fuzzy logic methods for design and synthesis of control systems. Model reference adaptive control systems. Classification of adaptive control systems. Stochastic disturbances as disturbance model in control systems. convergence and robustness. Choice of control weighting scheme and parameters for minimum variance controllers. Adaptive control with pole/zero placement. Evolutionary optimisation techniques in identification and model structure choice for adaptive control systems. Performance assessment in adaptive control systems. Recursive estimation algorithms as used in adaptive control systems. Adaptive filtering. control and telecommunications application. Stability of adaptive control systems. Adaptive long range predictive controllers. estimation techniques for multidimensional models. Identification in adaptive control systems. convergence of parameters estimates in recursive estimation algorithms. Adaptive minimum variance control.Postgraduate courses: Information Processing for Control ID Course Course load (hours per semester) Semester L P ECTS Lab M2. fuzzy controllers design. Basic plant and controller models. multi input / multi output plants models. features and application examples. GPC control algorithm. analysis and synthesis of adaptive control systems. Forgetting factor and its role with respect to identification methods properties. transfer function and prediction model identification. deterministic disturbances types. Multidimensional control systems with adaptation. . adaptive PID controllers. During the course the students should develop the skills concerning the methods of theoretical analysis and synthesis of adaptive control systems as well as the skills of building and using computer simulation packages for analysing the behaviour of such complicated control systems. filters with adaptation properties. Direct and indirect adaptive control systems. Transfer function plant model and prediction plant model . Continuous time plant model adaptive control systems. Course description Controllers tuning task. Gain scheduling simple and advanced adaptive control schemes.
The students should obtain knowledge of theoretical fundamentals and of practical methods used in modern SCADA systems and industrial automation software. in particular with numerical methods used in computational algorithms for control systems. Design methods for SISO control systems. Smith-McMillan form of transfer function matrix. Hausholder transformation and QR factorization. Selected issues of linear algebra: norms of vectors and matrices. as well as with typical procedures and software packages Course description Historical outline. Schur form. generalized eigenvalues and QZ algorithm. Controllability. balanced realizations. canonical representations.2 Course CAD of control systems Course load (hours per semester) Semester L P Lab 30 pro7 30 ject ECTS 5 Lecturer: Marian Błachuta Objectives of the course The subject aims at making students familiar with elements of CADCS. Overview of software packages. Mathematical models for MIMO systems: state-space.3 Course Computer controlled systems ECTS 4 Lecturer: Ryszard Jakuszewski Objectives of the course This course is designed primarily for students wanting to create advanced control and process monitoring systems. 33 . observability and controllability grammians. Numerical algorithms of linear algebra used in numerical algorithms for control systems: problem conditioning and numerical stability. orthogonal and unitary matrices. determining controllable and observable part. Relationships between state-space and transfer function descriptions.Postgraduate courses: Information Processing for Control ID M2. Design of decentralized controllers. poles and zeros. MATLAB system and toolboxes related with control. matrix fraction description. Sampled data systems: conversion between continuous-time and discrete-time descriptions. delta operator approach. observability. systems of linear equations. Course load (hours per semester) Semester L P Lab 7 30 15 ID M2. Singular Value Decomposition and its applications. signal processing and system identification. Approximate commutative controllers. Survey of selected procedures from CONTROL SYSTEMS TOOLBOX. Principal gains and characteristic loci. transformation to Hessenberg and Schur forms. relationships between description forms. matrix transfer function. Matrix exponential and matrix logarithm. poles and zeros. The characteristic locus method. system order reduction.
providing process visualization. Introduction to ODBC. Large scale systems. solving structured optimization problems and designing hierarchical and decentralized feedback systems. Using SQL Database Tags. The student will also become familiar with some of the tools and concepts available for optimizing and troubleshooting such software. Understanding Database Dynamos. Sending Alarms to ODBC. graphic design. The course teaches basic SCADA and HMI topics like Process Database blocks. Different types of hierarchical structures: multilayer structure and multilevel structure. complex systems. driver configuration. View Auto-Failover. Course description Introduction and the terminology. The specialists who have acquired skills in SCADA systems are looked for in job market all over the world. Optimization. Scripting. I/O Driver Configuration. reporting. Reporting More advanced topics: System Architecture.Postgraduate courses: Information Processing for Control Course description The world’s leading industrial automation software solutions. This knowledge consists of methods of analysis of composite systems. resulting in faster response to production issues. Static models. VBA scripting is covered primarily as a tool for automating tasks for the operator. Process Database Development.4 Course Hierarchical control Course load (hours per semester) Semester L P Lab 7 30 30 ECTS 5 Lecturer: Krzysztof Fujarewicz Objectives of the course This course is addressed to students interested in systems analysis. Mathematical model of the planning problem for 34 . control engineering. VisiconX. System Configuration. Reporting. Trending. Mathematical models of systems. Torubleshooting. data archiving. This solutions give students the power to precisely monitor and control every aspect of manufacturing industry processes. LAN Redundancy. as well as equipment and resources. management and decision making. The course is intended to provide the student a base level of proficiency using some of the American software solutions and also discusses more advanced features. Introduction to SQL. Alarming. decomposition coordination. Using ActiveX. data acquisition and supervisory control of plant floor operations are discussed and trained during laboratory classes. It covers basic methods used in solving control and optimization problems associated with large-scale and complex systems. alarm strategies and security. improved quality. faster time-to-market with new products and increased profitability. Security. After completing the course student has basic knowledge in optimization and control of large scale systems. Basic topics: Basics of Graphics. Optimizing the Process Database. less waste. System Optimization ID M2. Using OPC.
Dantzig-Wolf method. Image segmentation techniques. Comparison of human and robot vision. Decomposition and coordination in nonlinear static optimization problems. Colour image processing. Gradient calculation with the adjoint system.Postgraduate courses: Information Processing for Control the oil refinery. Gradient-based identification and optimization of complex nonlinear systems. Decomposition. Concentrated-parameter models and distributed-parameter models. Multilayer systems. manipulated and input variables. Digital image processing operators. the structure matrix. Decomposition of linear programming problems. Region properties: shape factors and Euler number. Knowledge representation methods. Direct method of coordination. Colour representations and colour sensors. Dynamical models. Binary images. Hybrid models. Lighting systems. Multilevel optimization systems. Region properties: geometrical moments. subsystems. Gradient derivation.5 Robot vision Course Course load (hours per semester) Semester L P Lab 7 30 30 ECTS 6 Lecturer: Henryk Palus Course description Sensory systems for advanced robots. Static characteristics. Frame grabbers. Applications of robot vision systems. Simplex method. image processors and computers. Optical systems (lenses for cameras. Multilayer structure of control and optimization for continuous-flow reactor. Dynamic programming. Sensitivity analysis. Knowledgebased vision systems. A/D conversion and fundamentals of video. Human vision system. Adjoint systems. Description of complex systems. Identification and optimization of nonlinear dynamical systems. Stabilization layer and its structure: output and control variables. Neural models. 35 . Constraints. Vision sensors (CCD line sensors and area sensors). Elements of mathematical morphology. Parameters of colour cameras. filters). Stirred-tank continuous-flow reactor. assignment of variables. The price method. Direct method with penalty function. Types of variables in hierarchical structures: state variables. Induced constraints. ID M2. Mixed methods.
Requirements imposed on robot control systems are presented and set point and tracking control problems defined. dynamics. Therefore in the course a big effort is made to give a good foundation of nonlinear control knowledge. Basic theory and methodology of robot control is presented on the examples of most frequently applied control structures. ID M2.Postgraduate courses: Information Processing for Control Course load (hours per semester) Semester L P Lab 7 30 30 ID M2. This is the main objective of the course. relative and inverse transformations. The dynamics of robot manipulators is then presented using Lagrangian equations. though the nonlinear systems are significantly richer in phenomena. As the example. need for their analysis and design advanced computer tools. Section dedicated to homogenous transformations contains description of basic definitions like vectors.6 Robotics Course ECTS 6 Lecturer: Aleksander Staszulonek Objectives of the course The goal of this course is presentation of the main elements of robot theory: mathematics. coordinate frames. This is related with the fact that. planes. specification of T matrices in terms of A matrices. basic transformations. being a subject of the course.7 Course Advanced control Course load (hours per semester) Semester L P Lab 8 45 30 15 ECTS 7 Lecturer: Ryszard Gessing Objectives of the course Nonlinear control systems. derivation of kinematic equations. kinematic equations solution. Course description Program of the course includes: homogenous transformations. equivalent angle and axis of rotation. Section dedicated to derivation of kinematic equations deals with different coordinate systems. Effective usage of computer tools is possible only then when one has an appropriate knowledge of advanced nonlinear control. 36 . kinematic equations of Stanford and Elbow Manipulators are derived. control. PID and sliding mode controllers are discussed. the methods of their analysis and design are significantly weaker than those of linear systems. specification of A matrices for manipulator’s prismatic and rotational links. trajectory execution and programming. programming and control. Methods leading to the solution of kinematic equations are described and solutions for Stanford and Elbow manipulators are presented.
Influence of parameters on control waveforms.in continuous-time part of the system. The case of plant with multiple inputs. Extremal control. Voltage stabilization system and its phase plane analysis. Example and results of simulations. Equations of phase trajectories. digital Control systems with dead zone relay. System with derivative sign examination. antiwindup solutions: analog. Indirect and direct Lyapunov methods. basic terms. direct Lyapunov method.8 Course Computer integrated manufacturing Course load (hours per semester) Semester L P Lab 8 30 15 ECTS 5 Lecturer: Waldemar Grzechca Course description The subject Computer Integrated Manufacturing is an introduction into scheduling problems in manufacturing systems.Postgraduate courses: Information Processing for Control Course description Nonlinear systems. In the first part ideas of single machine scheduling.solution of phase trajectory equation. determination of stability condition. Application to stability analysis of control systems. System with outside modulating signal.method of isoclines. complexity of scheduling problems Single machine – minimizing schedule length. chattering effect. Singular points and trajectories. Systems with current identification. Derivation of phase trajectories: . Optimal control. phase portrait.relation between switching frequency and oscillation magnitude. Determination of stability region (domain of attraction). approximate system description. mean flow time. The case when nonlinearity appears . Time-optimal control. Determination of equilibrium points. sliding surface. Decrease of oscillation magnitude. System stabilization. . Influence of delay. Examples of nonlinear elements. Systems with gain scheduling. Nonlinearities. Design of sliding mode control law. Properties of phase trajectories. their description and characteristics. .in discrete-time part of the system.mode control. Part two contains philosophy of modern manufacturing systems. due date criteria 37 . Analysis of discrete-time systems. Example of design. Condition of free oscillations. Adaptive control. Lyapunov definition of stability and asymptotic stability. Method of describing function. On-off relay control. flow shop and job shop problems are solved. Systems with plants having extremum. parallel machines scheduling. synchronic detection. Autotuning regulators. indirect Lyapunov method. Determination of oscillation parameters. Model reference adaptive systems. System description . Maximum principle. Examples of describing functions.nonlinear differential equations. Difference equations . Global stability.comparison with frequency response. It contains of two parts. Phase plane analysis. Local stability. Characteristics of nonlinear elements. Description of sliding mode control. Influence of nonlinearities on control quality. Sliding . Models of nonlinear systems . ID M2.determination of waveforms. Introduction – philosophy of scheduling in computer and manufacturing systems. Definition of describing function .
HMI). Redundancy in PLC systems. resources. access paths. basic ideas. PID control in PLC.9. tasks.2 Course Programmable controllers I Programmable controllers II .1 M2. communication model.functions.Postgraduate courses: Information Processing for Control Parallel machines – heuristic methods. International Standard IEC 61131 – parts of the standard. Standard functions and function blocks. digital input/output modules. minimizing schedule length. EDD. Course description PLC – introduction. Graphical programming languages . analog I/O modules. Textual programming languages – Instruction List (IL). central processing unit (CPU). MRP II and ERP Just in Time methods – benefits and difficulties TOC – Goldratt’s philosophy of production systems Lean Manufacturing – ideas and solutions ID M2. LWR. Communication in PLC systems and with SCADA systems. variable declaration. description of parameters Genetic algorithms in practice – finding solutions of scheduling problems. PLC hardware – modules. Structuring the program using Sequential Function Chart (SFC). FIFO.9. different lines SALBP – finding solutions. Application of PLCs in automation and control. Literals. heuristic methods Genetic algorithms – basic ideas. ways of working and programming. programs. Structure Text (ST). mean flow time. assembly line balancing problem CIM – model Y of Computer Integrated Manufacturing Philosophy of MRP. data types (elementary and derived). LIFO.Ladder Diagram (LD).project Course load (hours per semester) Semester L P Lab 8 30 30 9 30 ECTS 6 3 Lecturer: Jerzy Kasprzyk Objectives of the course The main goal is to present ways of using and programming Programmable Logic Controllers (PLC) in automation and control. due date criteria Branch and Bound Algorithm – optimization of minimum sum of lateness Job shop – basic ideas. Program organization units . Configuration elements – configurations. some examples of AC motor control. 38 . Man-Machine Interface (MMI. software model. exact methods SALBP – finding solutions. function blocks. SPT. tasks execution. LPT methods Flow shop – Johnson’s algorithm for two machines and Johnson’s rule for N machines SALBP – simple assembly line balancing problem. Function Block Diagram (FBD). elements of programming languages. description of problem.
In some assignments. It leads logically to application of various types of run charts. students will test new procedures developed for the QMC package. is developed. Application of stochastic control theory to design fault-prone systems. List of major topics Statistical process control: A brief overview. Application of computer package QMC to analysis of simulated and real-life data. Deming’s paradigm. the stepwise method of quality improvement.10 Quality control Course Course load (hours per semester) Semester L P Lab 8 30 15 ECTS 3 Lecturers: Marek Kimmel. using simulated and real-life data. either of spreadsheet type (like MS Excel) or the specialized QMC package (will be provided). Course description Departing from the Deming paradigm. Subsequently. Pareto principle Acceptance-rejection and mean and standard deviation control charts Sequential approaches (CUSUM charts) Exploratory methods and simplex algorithm of optimization Experimental designs Multivariate approaches Linear systems with Markov jumps JLQ problem 39 . Weekly assignments will generally require the use of a computer package. for monitoring processes with different statistical properties. Emphasis will be divided between sound theoretical principles (using simple probabilistic techniques) and computational techniques. The state of such systems is hybrid : to standard continuous process state variables one should append discrete variables called mode which are described by Markov chains. One way to design control systems robust in the sense of possible failure is to use piecewise deterministic processes with Markov jumps in parameters. using a statistical approach. attention will be shifted towards decomposition of the process and design of experiments. The run charts vary from simplest acceptance-rejection charts to sophisticated sequential approaches.Postgraduate courses: Information Processing for Control ID M2. Adam Czornik Objectives of the course Use of statistical methods for improvement of quality in industrial setting (Statistical Process Control). For linear systems it is possible to built complete design methodology.
in a safe area and a connecting cables.Postgraduate courses: Information Processing for Control ID M2. dusts. the theory of operation and the applications of modern integrated solid–state sensors and actuators. vapour. An inspection interval and its influence on the reliability. as an intrinsically safe systems. Marking. locations. There are also presented new trends in sensor technology and integration into the network-enabled smart transducers. Requirements in relation to elements of circuits and systems containing of: an equipment located in a dangerous area.12 Course Sensors and actuators Course load (hours per semester) Semester L P Lab 8 45 30 ECTS 6 Lecturer: Dariusz Buchczik Objectives of the course To show the technology. 2). Classifications of: gases. Basic functions and reliability characteristics. Certificates and their mutual recognition in different countries. Constructions of explosion-proof apparatus and designing of measurement and automatic control systems with intelligent transducers. An estimation of reliability characteristics of objects and systems. An intrinsically safe protection as the most safe protection of measurement and automatic control systems. Course description Definition of a reliability of a technical object in the context of measurable and nonmeasurable characteristics in the defined environmental conditions. Statistical methods in the reliability assessment (including ” fuzzy reliability”).11 Course Reliability and intrinisic safety Course load (hours per semester) Semester L P Lab 8 15 15 ECTS 3 Lecturer: Jerzy Frączek Objectives of the course To acquaint the students with: 1). ID M2. 40 . National and international standards. Reliability models of objects and systems. Certification procedures. apparatus. A necessity of reliability assessment of technical objects and systems in which reliability structures. Definition of an explosion-proof of apparatus and systems. the construction. maintenance and a human role are taken into account. in which the reliability plays the most important role. A model of a “critical human error”. An influence of the maintenance on the reliability. A role of the reliability in different types of explosion-proof protections. Reliability block diagrams of systems (static and dynamic).
bellows. polarometric sensors. It constitutes a pedagogical compilation of fundamentals. Force sensors: basic types of sensors: piezoresistive. decision making. silicon resistive sensors. electromagnetic. application areas. Actuators. behavioural insights. piezoelectric tactile sensors. impedance sensors (resistive and capacitive). DSP plays an increasingly central role in the development of telecommunications and information processing systems. tubes. Temperature sensors and its electronic circuits. VSM). literature. multiaxial accelerometers. Sensing elements: diaphragms. Fibre optics sensors: basic concepts. Pressure sensors: basic definitions. Sampling. μTAS. adaptive network management.13 Course Applied digital signal processing ECTS 3 Lecturer: Marek Pawełczyk Objectives of the course The aim of this lecture is to present issues in modern signal processing techniques with focus on applications. Humidity sensors: basic concepts and definitions. Examples of actuators. surface micromachiming. force feedback. Integrated sensors technology. cross-axis sensitivity. financial data forecasting. piezoresistive and capacitive. medical signal processing. algorithm forms. piezoelectric. piezoelectric. wafer bonding. thermal. electromagnetic. Acceleration sensors: dynamic model of accelerometer. etc. optical fibres. micromachines). Detection methods: capacitive. Tactile sensors: force sensitive resistors. quantization. and application guidelines. The intertwining of theory and practice is demonstrated by numerous examples and verified during laboratories. semiconductor pn-junction sensors. MEMS technologies: bulk micromachining. resonant. and has a wide range of applications in multimedia technology. Fourier transforms. Principles of operation – piezoelectric. chilled mirror sensors – methods of condensation detection. Microelectromechanical systems (MEMS. laser micromachining. thermistors). MEOMS. Principles of actuation: electrostatic. pattern analysis. Silicon and its properties. piezoelectric. The course touches following subjects: The breadth and depth of DSP. resonant. piezoresistive. capacitive. In the era of rapid development of microprocessors it gains significant interest and finds applications in many fields of everyday life. Examples of integrated sensors and actuators (micropumps. thermoelectric contact sensors (thermocouples). 3-D stereo lithography. Thermoresistive sensors (resistance temperature detectors. units of pressure and conversion. Multimode sensors with internal and external amplitude modulation.Postgraduate courses: Information Processing for Control Course description Introduction: scope of lectures. analogue-to-digital and digital-to-analogue conversion. audio-visual systems. sensors utilizing selective wavelength modulation. damping and frequency response. radar and ultrasonic systems. Monomode sensors: interferometers and their fibre optics realisation. LIGA. Correlation analysis. Course load (hours per semester) Semester L P Lab 9 30 15 ID M2. microvalves. 41 . Course description Digital Signal Processing (DSP) is distinguished from other areas of computer science by the unique type of data it uses: signals. cellular mobile communications. self testing.
Active control of acoustic noise. denitrification process. hydrolysis. Speech processing and recognition. Spectral analysis. 42 . stochastic models using markov processes. reactor hydraulics. Interpolation and decimation. Signal analysis and forecasting. Wiener filter. ID M2. p53 signaling and DNA repair. Adaptive control: minimumvariance control. and adaptive Wiener filters. Spatial effects. binding motifs. Conversion of sampling frequency and multi-rate signal processing. Modeling and Estimation of Signaling Pathways in Biological Cells Examples illustrating importance of signaling pathways: Antiviral defense using interferon signaling. Reactor kinetics of microbial systems: reaction kinetics. catabolic and anabolic processes. Gene networks. Mechanisms of gene transcription. the following topics are covered: Basic structure of a wastewater treatment plant. Examples of medical and biological applications: cancer diagnostics. predictive control. kinase cascades. Organic carbon removal: fate of soluble components. analysis of variance. Distance detection. estimation of parameters and analysis of stability. Digital Signal Processors. reactor kinetic. organisms in wastewater treatment. Biology in wastewater treatment: enzymes. Wnt regulation and genesis of colon cancer. nylon membranes. Witold Nocoń Objectives of the course The objective of the course is to provide an overview of selected technologies and analytic tools involved in modern biotechnology and bioinformatics.14 Course Biotechnical systems Course load (hours per semester) Semester L P Lab 9 30 15 ECTS 3 Lecturers: Marek Kimmel. support vector machines. self-organizing maps. In particular. Modeling of signaling pathways: Deterministic models using ordinary differential equations. Analysis of gene expression data: Clustering. Digital filters design. DNA-microarray and related technologies: oligonuleotide chips. Spectral subtraction. transcription factors. SAGE (sequential analysis of gene expression). conversions in biological treatment plants. matrix representation of the reaction kinetics. zeros/poles placement. biological phosphorus removal. Wavelet transform. biological part including bioreactors and secondary settlers. sequencing batch reactors. Signal transduction: cell surface receptors. Signaling pathway as a control system.Postgraduate courses: Information Processing for Control Signal windowing. model reference adaptive systems. polymerase. Nitrification process. Kalman filter. nutritional classification of microorganisms. Affymetrix chips. chemical and biological processes involved in wastewater treatment. The main objective of the second part of the lecture is to provide students with a basic knowledge and understanding of mechanical. Gene expression as a descriptor of cell's state. Echo generation and cancellation. Course description The course consists of several modules: Measurement of Gene Expression Using DNA Microarrays Background: The dogma of molecular biology concerning information flow in cells. selection of microorganisms in wastewater treatment. including mechanical and chemical pretreatment. time patterns of gene expression.
recursive prediction error method. Random Discrete-Time Signals and Systems with Random Inputs. Estimation based on DiscreteMeasurements. State estimation. Estimator Design. The Orthogonality Principle. Identification of time-varying systems: weighted least squares (WLS). Identification Introduction: aims of identification. persistently exciting signals. least mean squares estimator. Static model identification: ordinary least squares (OLS) estimator and its statistic features. Dynamic model identification: batch OLS. Jarosław Figwer Objectives of the course The main goal is to present basics in estimation theory and identification of static and dynamic linear models. Minimum Mean-Square Error (MMSE) Estimation. empirical transfer function estimator. linearity. Instrumental variable estimation method. Experiment design. 43 . Models in frequency domain: power spectral density estimators (periodogram.and continuous-time models. Blackman-Tuckey method. Weighted Least Squares. Orthogonality Principle for LMMSE Estimation. Properties of Estimates. static and dynamic models. recursive WLS. Comparison of Estimation Methods. Linear MMSE Estimation. time-invariance. Non-linear model identification. artificial neural networks. Recursive Estimation and the Kalman Filter. frequency response identification. Algorithms to avoid bias: instrumental variable. Model structure selection and model validation. Identification in a closed-loop – conditions for proper experimentation. parametric approach).and frequency-domain windows.15 Course Estimation and identification Course load (hours per semester) Semester L P Lab 9 45 30 ECTS 6 Lecturers: Zdzisław Duda. Recursive form of LS. Course description Estimation theory: Signal Estimation: Linear Estimators. RLS and RWLS and their properties. Least Squares (LS) Estimation: Least Squares Estimation of Signal Parameters. discrete. time. parametric and non-parametric models. Maximum Likelihood and Maximum a posteriori Estimation. Optimal Estimation: Formulating the Problem. leakage.Postgraduate courses: Information Processing for Control ID M2. Recursive least squares (RLS) estimator and its features.
Historical background. Basic properties and applications. The rmes family of rule-and model-based expert system shells. Augmented Exact Expert System Shells (rmes_AE)– Augmented Exact Rule Base.Postgraduate courses: Information Processing for Control ID M2. Augmented Exact Model Base. Main properties. Testing and diagnosing augmented exact knowledge bases.16 Expert systems Course Course load (hours per semester) Semester L P Lab 9 30 30 ECTS 4 Lecturer: Antoni Niederliński Objectives of the course To learn designing and testing knowledge bases for the family of rule. Basic properties and applications. Elementary Uncertain Constraint Base. Augmented Uncertain Constraint Base. Elementary Exact Model Base. Testing and diagnosing augmented uncertain knowledge bases. Modeling uncertainty with the help of Stanford Certainty Factor Algebra and its extension (cumulative and disjunctive rules). user preferences and fulfillment of relations. Certainty factors for modeling ignorance.and model-based expert system shells rmes. Elementary Exact Constraint Base. Advantages of separating domain knowledge from reasoning. The open world assumption and its consequences. Elementary exact backward and forward chaining. Nesting – its advantages and disadvantages. Elementary Exact Expert System Shells (rmes_EE)– Elementary Exact Rule Base. Basic structure. Sound Base. Course description General information on expert systems. Graphics Base. Elementary Uncertain Model Base. Augmented Uncertain Model Base. Graphics Base. 44 . Augmented uncertain backward and forward chaining. Uncertain Advice Base. Properties and usage. Augmented Exact Advice Base. The closed world assumption and its consequences. Testing and diagnosing elementary uncertain knowledge bases. Augmented exact backward and forward chaining. Augmented Exact Constraint Base. Augmented Exact Constraint Base. Uncertain Advice Base. Elementary uncertain backward and forward chaining. Elementary Exact Advice Base. Sound Base. Augmented Uncertain Expert System Shells (rmes_AU)– Augmented Uncertain Rule Base. Testing and diagnosing elementary exact knowledge bases. How to obtain and verify certainty factors. Elementary Exact Constraint Base. Elementary Uncertain Expert System Shells (rmes_EU)– Elementary Uncertain Rule Base. Properties and usage.
the numerical integration methods for computer simulation of such systems are presented. Design virtual instruments for analysis. These systems are generally described by a set of hyperbolic and/or parabolic partial differential 45 . In detail.Postgraduate courses: Information Processing for Control ID M2. Design Internet-ready applications using TCP/IP protocol for communication between different LabVIEW applications. In addition. The second part of the course is dedicated to physical modeling of distributed parameter systems. conditional structures and subroutines.18 Course Graphical programming Course load (hours per semester) Semester L P Lab 9 30 15 ECTS 3 Lecturer: Witold Nocoń Course description The main objective of this lecture is to provide the student with a good knowledge and understanding of the graphical programming language LabVIEW (Sometimes referred to as the "G-language"). This methodology is based on common mass and/or energy conservation laws and it leads to the nonlinear mathematical description of a system in the form of a set of ordinary differential equations. on completion of the course. students should be able to: Understand and use all the basic LabVIEW programming structures like: loops. Then. data storage and presentation of measured variables. introduction will be given to some of the add-ons toolboxes for LabVIEW. The first part concentrates on the methodology of deriving nonlinear physical models of lumped systems. Course load (hours per semester) Semester L P Lab 9 30 30 ID M2. for example: Real-Time programming (using FieldPoint 2010 distributed I/O system) PID Module. The subject of this course can be divided into two main parts. Design simple control systems for real-world processes. Implement the advanced analysis functions using functions available in LabVIEW (FFT for example). clusters.19 Course Modelling and simulation ECTS 5 Lecturer: Jacek Czeczot Course description The course is dedicated to the modeling and simulation of dynamic and control systems. Use the data types available in LabVIEW like arrays. Both the one-step and multi-step methods are considered and their most important features (especially their advantages and disadvantages in terms of calculation and implementation complexity) are discussed in details. Datalogging and Supervisory Control Module. local and global variables. signals and other process data (I/O functions). Use dynamical loading of functions in LabVIEW.
old photo colorization. Course description The course consists of 7 units which cover some of the most important topics in the challenging field of color imaging. as after the course. cartoons restoration.Postgraduate courses: Information Processing for Control equations and the methodology for deriving such models is presented and discussed. ID M2. Color imaging applications: red-eye removal. the MATLAB programming language and the LabView programming environment from National Instruments are used. The lectures are intended only as a theoretical introduction with a very strong practical aspect. For the numerical solving of distributed parameter systems two groups of methods are considered during the course. The course should be of interest for students wishing to extend their knowledge of digital image processing techniques and also for those who are seeking a deeper insight into the digital photography and multimedia. Lecture topics: Human color perception. Color spaces for computer vision and graphics. However. the students are supposed to be able to utilize the color information in various tasks of computer vision. Both groups are presented in details and their calculation and implementation complexity are discussed in details. the theory is discussed and demonstrated rather through examples than through advanced theoretical considerations. Noise reduction and edge detection in color images. During the laboratory classes. 46 . face detection. Emphasis is placed on applications. the laboratory classes follow the lectures and their most important goal is to give the students the opportunity to practice the methods presented during the lectures and to investigate their practical aspects in terms of the application in both real-time simulation and batch simulation.5 Lecturer: Bogdan Smołka Objectives of the course The objective of the course is to make the interested students familiar with the main concepts of digital color image processing. Color image acquisition methods. Overview of advanced image compression methods. Image enhancement techniques.49 Course Advanced Image Processing Course load (hours per semester) Semester L P Lab 9 15 7 ECTS 1. Additionally. One group is the DTDS (Discrete Time Discrete Space) group of methods and the second one is the CTDS (Continuous Time Discrete Space) group (so called method of lines).
Temperature vs. Course description An analysis of electronic circuits – the Sigorski method: basics. frequency analysis of non-linear circuits – the harmonic balance method. an analysis of circuits having noise sources. derivation and estimation of parameters of circuits that are necessary in the designing of analog electronic circuits. Coupling noise. op-amp (an ideal op-amp in the Sigorski method. noise sources – components’ models. environmental influence. weak harmonic and intermodulation distortion in BJT & MOS transistors. the reliability function. accuracy of network functions (the worst case approach. sensitivity vs.20.21 Course Computer aided electronic circuits design ECTS 3 Lecturer: Jacek Izydorczyk Objectives of the course The aim of the course is to give a general outlook on algorithms and techniques used for computer aided electronic circuits analysis and design. Reliability in electronic circuits: constant failure rate. The sensitivity analysis and its application: basics. Q-operation point: 2 basic approaches – the potential node method and the superposition method. statistical approach for large series). Models of components: passive components. phase noise. The course is concerned on circuit simulation techniques based on solving of differential equations.Postgraduate courses: Computer Aided Information Processing Course load (hours per semester) Semester L P Lab 7 30 30 15 8 30 30 ID M2. the influence of negative feed-back for harmonic and intermodulation distortion. Distortion in electronic circuits: estimation with the 3. active components. sensitivity vs. long-term inconstancy vs. . Root Mean Square. noise optimization. computer symbolic analysis. temperature models of semiconductor components. To provide more sophisticated methods of a calculation. the stability problem in circuits with op-amps). temperature & power supply influence for network functions. Course load (hours per semester) Semester L P Lab 7 30 15 ID M2. short-term inconstancy vs.2 Course Analog circuits design I Analog circuits design II ECTS 6 7 Lecturer: Sławomir Lasota Objectives of the course The course is a natural continuation of Introduction to Electronics. linear & non-linear frequency correction. coping with controlled sources. cofactors & determinants.1 M2. sensitivity in frequency domain. mean time to failure. sensitivity in time domain.& 5-point method. Noise: Power Spectral Density vs.20. An oscillator as resistance (capacitance) to frequency converter: quasi-linear model of oscillations.
22. small-signal frequency analysis of nonlinear circuits. ID M2. The main goal of the second part of the course is to introduce students to fundamental aspects of designing digital circuits with the use of VHDL. theory of the local truncation error. finite methods of solving linear algebraic equations. accuracy of differentiation formulae. Some introductory information about ASIC and FPGA technologies and VLSI design low is also provided. NR method for a system of algebraic equations. Lecture curriculum: 48 . gaussian elimination. modified nodal equations. realization of the basic D. LU factorization methods. practical quasi-newton-raphson algorithms. among other things. numerical difficulties in the LU method. D.c.22. circuit analysis. methods for automatic formulation of iterative equations. numerical problems due to selection of state variables. a. analysis of linear circuits.2 Course Digital circuits design I Digital circuits design II Course load (hours per semester) Semester L P Lab 7 30 15 30 8 30 30 ECTS 6 7 Lecturer: Tomasz Garbolino Objectives of the course The goal of the lecture is to extend a knowledge concerning design of digital circuits acquired by students during previous courses: Theory of Logic Circuits and Digital Circuits. realization of an algorithm for integrating OAED. a LTE controlled variable step time-domain analysis. general characterization of linear circuits.C. numerical problems with the basic NR algorithm. problems connected with designing advanced arithmetic modules and circuits implementing time dependencies between signals. stability of differentiation formulae. It also provides students with introductory information about synchronizing two digital systems operating with different frequencies or throughputs. technique of NR step limiting on nonlinear elements.1 M2. analysis of nonlinear circuits: a basic newton-raphson method. Numerical solution of linear algebraic equations: introduction to simultaneous linear algebraic equations. formulation of circuit equations for time-domain transient analysis.Postgraduate courses: Electronics and Telecommunication Course description The purpose of the course is to familiarize students with primary algorithms and techniques used for computer aided electronic circuits analysis and design. the companion circuit method. BDF based on newton's interpolation. Time-domain analysis of nonlinear circuits: basic polynomial methods. two-graph modified nodal equations. Course description The lecture encompasses.C. global properties of differentiation formulae. The course covers following topic: Numerical analysis of linear circuits: formulation of algebraical circuit equations. convergence of differentiation formulae. tableau equations. frequency domain a. nodal equations. The guide is famous SPICE program widely used by computer aids for circuit design for circuit simulation. the case of a single nonlinear equation. The subject matter of the lecture encompasses – among other things – the VHDL language data structures and constructs that are useful in digital logic modelling for synthesis purposes and in design verification. analysis algorithm.c.
iterative combinational multiplier. Maxwell’s equations in both differential and integral forms. sequential. electromagnetic boundary conditions at media interface. circuits differentiating signal edges. include time-varying fields and Maxwell’s equations – in particular Faraday’s law of electromagnetic induction.Postgraduate courses: Electronics and Telecommunication Advanced arithmetic modules: a) adders: carry save. e) RTLstyle. naming convention. scattering and guiding structures. c) data types and operators. c) programmable pulse generators Basic synchronisation issues: a) metastability. d) delay models Introduction to design verification – writing testbenches Design synthesis Course load (hours per semester) Semester L P Lab 7 30 30 ID M2. and use of phasors for time-harmonic fields. pulse distributors. b) simulation flow. Emphasis is then placed on plane electromagnetic wave and its properties – specifically on description of plane waves in lossless and conducting media.and shift register-based circuits implementing time dependencies between signals: a) univibrators. b) multipliers: matrix combinational multiplier. c) process execution. and – to a certain degree – to the analysis and design of radiating. polarization of plane waves flow of electromagnetic power and Poynting vector. general transmission-line equations. wave equations and their solutions. the fundamental concepts and the elements of the governing theory of electromagnetism.. The course also includes theory and application of transmission lines. d) concurrent and sequential statements. reflection (and transmission) of electromagnetic waves at a plane boundary between two media. b) structural elements. c) synchronising data source and sink operating with different throughput. f) subprograms Simulation: a) sequence of compilation. potential functions. carry select and carry look-ahead adders. i. steady electric current. in a unified manner.e. shift & add multiplier. lines with arbi49 .23 Course Electromagnetic field theory ECTS 5 Lecturer: Andrzej Karwowski Objectives of the course The main objective of the course is to introduce . wave characteristics on an infinite transmission line. c) dividers: combinational and sequential compare. d) trouble-free switching between clocks VLSI design flow Introduction to CMOS technology Fundamentals of FPGA devices VHDL – overview and application field VHDL language and syntax: a) general language properties. Applications are made to some of the most basic and practical cases and configurations Course description The subjects covered. b) passing data and control signals between different clock domains. circuits delaying signal edges. transmission line parameters. b) pulse selectors. besides a brief review of static electric field. identifiers. and to apply them to the analysis of wave propagation phenomena. and static magnetic field. sequential Booth's multiplier. subtract & shift dividers BIN / BCD and BCD / BIN converters Counter.
This course is designated primarily for the second or third year student. Then. the Smith chart and Smith-chart calculations for lossless lines. For the latter codes. In Part III. non-redundant codes are described. specific codes are described.26 Course Radiocommunication ECTS 4 Lecturer: Mirosław Magnuski Objectives of the course The aim of the course is to present the basic knowledge about RF devices and systems and to give fundamentals of designing of radio links. transmission lines as circuit elements. transmision-line impedance matching (a quarter-wave transformer. Course load (hours per semester) Semester L P Lab 7 30 15 ID M2. In Part I. On the other hand all the theorems and definitions are illustrated by many practical examples. It is assumed that students have some understanding of freshman calculus and elementary probability. theoretical description of entropy and information is presented. this knowledge can be useful not only in communication systems but also in other various fields. First. The course consists of three parts. Part II is devoted to coding and decoding of information. as they can be found in many. then error detecting and correcting codes. or on a very long distance. one by one. and to make them easy to comprehend numerous examples have been provided. such as for instance data compression. The major results of the theory are quite subtle and abstract. general rules of coding and decoding are presented. The course is completed by basic concepts related to antennas. The course does not contain proofs of theorems.24 Course Theory of information and coding Course load (hours per semester) Semester L P Lab 7 30 ECTS 2 Lecturer: Jerzy Rutkowski Course description Transmission of information or data from one point to another is one of the most important tasks in the modern world. first. as inside a computer. essential theory of the transmission channel is provided. For somebody dealing with communication systems on a professional level essential knowledge of information and coding theory seems to be indispensable. for memory less and Markov sources. and single-stub matching). first for discrete sources then for continuous sources. ID M2. digital systems or design of experiments.Postgraduate courses: Electronics and Telecommunication trary terminations. commonly available books dealing with the same subject. This data can be transmitted on a very short distance. as in a space communication. However. 50 . starting from the most commonly used. and Friis transmission equation.
Noise in receiving systems: noise sources. signal to noise ratio.27 Bionics Course Course load (hours per semester) Semester L P Lab 8 30 15 ECTS 4 Lecturer: Ewaryst Tkacz Course description The main aim of the subject is to acquire an ability of considering properties of biological systems. signal-flow graphs. Mason’s rule. ID M2. four noise parameters. knife edge obstacle.370-7. basic rules included in low-level protocols – block transmission. general model of propagation. properties. The further aim concerns future application of such knowledge to improve a quality of widely understand diagnostic process. noise factor. generalised scattering matrix. parameters. Propagation: budget of a radio link. Van der Pool’s equation. K factor.Postgraduate courses: Electronics and Telecommunication Course description Transmitters. The wave approach to RF devices and systems: scattering parameters. error correction. 51 . curvature of a ray beam. free space loss. receivers and antennas: construction. Short description of contents Basic knowledge concerning general system theory Homeostatic systems Electrical activity of cells and tissues Hodgkin-Huxley biological excitability theory Biological systems functions and their modeling Biological signals Technical assistance of biological inner organs (both long and short term heart support) Limbs prostheses Course load (hours per semester) Semester L P Lab 8 30 ID M2. ITU recommendation P. Fresnel’s zones. definitions of power gain. protocol stack architectures and networking services: principles of point-to-point communication. Wwiedenski’s equations.50 Course Computer networks II ECTS 2 Lecturer: Mirosław Skrzewski Course description This course on Computer Networks presents advanced topics related to networking. circles of constant noise figure. properties of troposphere. protocol transparency. their characteristic as well as most important features from both mathematical and physical modeling point of view. block / acknowledgement identification. Ocumura’s budget of a radio link.
anti-side tone circuit. piggy-back / group acknowledgement. SMB protocol. Supervisory. error checking. Modem access – SLIP. name to address conversion. broadband access – xDSL protocols. layer addressing. assigned numbers. XNS (NetWare) stack of protocols. ISDN. fixed route. information (message. Specialized inte52 . routing information gathering. End-to-end flow control. User access security – packet filtration (firewall) systems. Examples of network architectures. NetBIOS related services in Windows XX systems. Calling party side – seizure. methods of network congestion prevention. BORSCHT functions (Battery. connection. decadic dialling. sliding window principle. distribution of routing information. receiving of ringing. sending off-hook signal. communication subnets. network addressing. Transport.Postgraduate courses: Electronics and Telecommunication frame transmission. Client-server versus peer-to-peer architecture. UDP. layer-to-layer communication. Ringing. adaptation protocols.1 M2. session. protocol modification (IPX. ftp. bandwidth distribution. channel switching. DoD architecture – protocols IP. Token Ring) channels. Line unit. SPX. PPTP. mail. media access protocols for radio (ALOHA. Channel length limitation. IPsec. sending dialling signals. on-hook signal. telnet. RIP). Routing. PPP protocols. VPN. tone and spoken (recorded announcements) information signals. connection-less transmission. Information transport problems and solutions. acoustic to electric conversion. NetBIOS over TCP. presentation. answer. TCP. Course load (hours per semester) Semester L P Lab 8 30 9 45 ID M2. Coding. application layers and their functions in ISO architecture. transmission primitives. DTMF dialling. ICMP. network addressing.28. Called party side – ringing signal. flow control. principles of systems communication. ARP. metering pulses. reservation. Hybrid. CSMA/CA). naming convention. clear signal. Battery and supervisory based on discrete components. services access. network address translation.2 Course Exchange devices I Exchange devices II ECTS 2 4 Lecturer: Jerzy Wojtuszek Course description Subscriber line signalling. NetBIOS over IPX. rpc as examples of client-server architecture. Testing). data encapsulation. Access address distribution. Structure and performance of telephone set. group retransmission. Internet services organization – http. NetBIOS protocol. name to address translation (DNS). supervisory during ringing. dial tone. Organization of date exchange in NetWare systems. dynamic or static IP addressing. Block diagram of simple telephone set. ringing tone. cable modem access.28. token passing) and ring topology (Cambridge Ring. wire (CSMA/CD. name space. Multi-access channels. Problems of security in network services – protocols with information encryption – ssh. Architecture of network access (last mile architecture). routing algorithms – flooding. answer signal. Overvoltage. ISO OSI Reference Model architecture. services access. packet) switching. receiving of acoustic signals. SAP.
Java Native Interface . Time division switching networks. mechanisms for multithreading organization. mechanisms for error handling. Line codes and time frames for U and S/T reference points. Java servlets technology in enterprise applications. terminals TE1 and TE2. building programming environments using components from the Java Foundation Class (JFC) package. multithreading and network protection will be exposed. Course description During the course following lecture subjects are realized: general language description. network terminations NT1 and NT2. Among others. ID M2. space equivalents of S-T-S and T-S-T networks. serialization. Structure of customer equipment (U. Swing and SWT components. Special cases of inheriting member elements: end components. method defining – non-elementary cases. arrangement of non-blocking networks composed of integrated switches. Java as a re-usable component language. S-T-S (Space-Time-Space) and T-S-T (Time-Space-Time) switching networks – time switch. User-network interfaces (2B+D and 30B+D). D-channel contention resolution. built-in data types. abstract classes. creating and deleting objects. Echo cancellators and scramblers. methods of sending ringing signal (relay or opto-triac). deadlock and other multithread problems. data processing in streams. EDSS1 protocol – messages and procedures for connection establishment and clearing. methods of application intercommunication based on streams and sockets. conditions for non-blocking. Clos switching network and Clos theorem. graphical user interface designing with AWT. power supply). I/O operation organization.using native libraries in Java applications. exception handling. also fundamentals of enterprise applications and application for mobile devices will be presented. realization of the object programming idea in Java. layout managers. structures of S-T-S and T-S-T networks. 53 . mechanisms for event handling. Physical realization. state of blocking. time multiplexed switch. starvation. Intel 2911 (codec). terminal adapter TA. defining classes – general rules. inheritance mechanism. limits for number of inputs and outputs. ways of parameter passing. basic rules for building and executing applets. similarities and differences as opposed to the C++. object member data organization. connecting subscibers to two-sided switching network and connection set-up.Postgraduate courses: Electronics and Telecommunication grated circuits: Motorola MC3419 (SLIC). final components.29 Course Java and programming in the Internet Course load (hours per semester) Semester L P Lab 8 30 30 ECTS 4 Lecturer: Krzysztof Dobosz Objectives of the course In the framework of the subject. Switching networks based on integrated switches – structure and performance of integrated switch. ISDN networks. the Java programming language will be presented with its means. principles of access to member elements. threads synchronization. Space-division switching network. LAPD protocol – frames and procedures. T and S reference points. interfaces. tools and methods that enable building programs destined for exploitation both as the Internet and standalone applications. Intel 2912 (filter).
Radio waves utilisation for data transmission. BTMA. Aloha. capture effect. Introduction to wireless media characteristics. Opportunities of wireless media application. The need for new protocol definition: hidden and exposed nodes. electromagnetic waves division. HiPeRLAN/2. technique. Protocol properties: Aloha. Comparisons of selected products. Radiomodems and optical modems. Radio waves characteristics. Propagation description for waves: long. Survey of wireless transmission hardware. Other solutions. Network adapters. examples. 54 . Bands division. IEEE 802. Mobitex. Wide area mobile networks. short. Spread spectrum systems. collection framework and design patterns in Java. Law restrictions and general technical parameters of wireless links. IrDA and BlueTooth systems. Personal area networks . 802. interference. Packet Radio. Radiocommunication system parameters design. Cordless and cellular telephony. Problem genesis. Modern data transmission in telephony systems (HSCSD. (4) Building applications intercommunicated by means of streams and sockets. American standards: IEEE 802. Executing a simple stand-alone application and an applet. Modulation methods. CSMA. medium. Optical waves characteristics. TETRA . Packet controllers. cellular telephony standard. midlet lifecycle. Survey of wireless digital transmission systems. Comparisons of selected products. general rules for mobile devices programming. Stationary wide area networks . MACA. Optical links classification. Modulation in optical systems. (2) Building multithreading applications (3) Building graphical user interfaces in window technology using Swing components. Connection methods on physical or logical link layers level. MACAW. cordless telephony standard. Propagation classification. Bridges. GPRS). Infrared and laser waves properties. Efficiency comparison for the most important protocols.11. trunking network standard.15 WPAN standard. ultrashort and microwaves. CDPD.11b. using higher and lower level operations to handle network connections with TCP and UDP protocols. Wide area stationary networks.11a. Medium access protocols in wireless local networks. 802. Local area networks. Survey of wireless transmission hardware. FAMA and BAPU.31 Course Wireless computer networks ECTS 2 Lecturer: Bartłomiej Zieliński Course description Reasons for the usage of wireless transmission media. Wired and wireless network integration. TNC controllers. SRMA. Hardware and software structure. Trunked networks. Local area networks . Classifications. DECT.Postgraduate courses: Electronics and Telecommunication fundamentals of Java 2 Micro Edition platform. Modifying sample applications. GSM. European standards: HiPeRLAN. MSAP. Practical part of the course contains: 6 subject units: (1) Getting acquainted with the JDK (Java Development Kit) package and the Eclipse program development environment. general description for multimedia home platform. Course load (hours per semester) Semester L P Lab 8 30 ID M2. (5) Developing applications server using the Java Servlets. (6) Programming mobile phones using Java 2 Micro Edition standard library. Mobile wide area networks . Classifications.
knife-edge diffraction model. QPSK. basic concepts and terms used in trunking theory (traffic intensity. Course description The course covers the fundamental concepts of handoff. FH-SS). operation rules. adjacent channel interference. research. diffraction. signal-tointerference ratio. frequency reuse factor. grade of service. efficiency. methods for reducing interference.and pico-cell zone concept). offered traffic. Computing power and transmission efficiency. etc. and spread spectrum modulation techniques (DS-SS. Hata. cells. micro. Network efficiency in presence of converters .). etc. DPSK. namely. as well as those specific to particular systems and standards. Protocol converter for industrial networks. diffraction and Fresnel zone geometry. hexagonal geometry. ground reflection (2-ray) model. and frequency planning. blocked calls delayed systems (Erlang C systems)). and the effects of small-scale fading and multipath are addressed. free space propagation model. and scattering) and relevant models for predicting signal strength are discussed. Practical link budget design using path loss models (Okumura.) are also demonstrated. frequency reuse. co-channel cells. Then basic propagation mechanisms (reflection.Postgraduate courses: Electronics and Telecommunication Protocol converter for RS-232C link. specifically into cellular phone systems.51 Course Cellular phone systems ECTS 2 Lecturer: Andrzej Karwowski Objectives of the course The main objective of the course is to introduce the student into cellular radio and wireless personal communications.. implementation. and multiple access techniques for wireless communications starting from FDD through FDMA. and invention of cellular telephony. The course covers basic technical concepts being the core of design. RS-232 link. GMSK). blocked calls cleared systems (Erlang B systems). constant envelope modulation (MSK. TDMA up to CDMA and WCDMA. 55 . Hardware and software construction. frequency reuse concept). clusters. Another part of the course covers a brief review of modulation techniques for mobile cellular telephony (analog and digital modulation. scattering and the Rayleigh criterion. co-channel interference and system capacity. one of the fastest growing fields in the engineering world. Modbus network with one and many segments. improving capacity in cellular systems (cell splitting. Course load (hours per semester) Semester L P Lab 8 30 ID M2. The course is completed by a compilation of the major existing and proposed cellular and personal communications systems and standards. etc. The course starts with explaining the cellular concept (cellular system topography. Converter for multisegment Modbus network. Further research over protocol converters. trunking efficiency. pulse shaping techniques. linear modulation techniques (BPSK. sectoring.
carrier acquisition. 56 . random selection of codes. Channel capacity and coding: channel models and channel capacity.trellis-coded modulation. performance analysis for wireline and radio communication systems. convolutional codes. line-ofsight radiolink. emission of EM waves by wires with current. channel equalization. capacity of multiple access methods. FM receiver. demodulation of FM. Multiuser communications: introduction to multiple access techniques. data link layer. representation of digitally modulated signals. coded modulation for bandwidth-constrained channels . pulse-modulated systems. Characterization of Communication Signals and Systems: representation of band-pass signals and systems – Hilbert transformer and its impulse response. random access methods. optimum receiver for CPM signals. optimum receiver for signals with random phase in AWGN channel. interference in angle-modulated systems. waveguide and modes of EM waves. Carrier and symbol synchronization: signal parameter estimation. Communication Channels and Their Characteristics: copper media – coaxial cable. network layer. generation of FM waves. signal space representations. Behavior of analog systems in the presence of noise: baseband systems. amplitude-modulated systems. angle-modulated systems. Block and convolutional channel codes: linear block codes. amplitude modulation: double standard (DSB). Fresnel zones. transport layer. session layer. modern modulation techniques. presentation layer and application layer – illustrated by non-technical examples. The course covers following topic: ISO/OSI model of communication system: services of physical layer. amplitude modulation: vestigial sideband (VSB). superheterodyne AM receiver. television. communication system design based on the cutoff rate. Angle modulation: concept of instantaneous frequency.Postgraduate courses: Electronics and Telecommunication Course load (hours per semester) Semester L P Lab 30 15 15 9 ID M2. carrier and symbol synchronization and channel coding. joint estimation of carrier phase and symbol timing. Course description The purpose of the course is to familiarize students with primary concepts and principles of contemporary communications in the physical and link layer of ISO/OSI model. symbol timing estimation. amplitude modulation (AM). Optimum receivers for the additive white gaussian noise channel: optimum receiver for signals corrupted by additive white gaussian noise. a simple model of radio waves propagation. fading. fibre-optic cable. code-division multiple access.32 Course Digital and analog telecommunication ECTS 6 Lecturer: Jacek Izydorczyk Objectives of the course The aim of the course is to give a general outlook on communication media. Different types of communication techniques from modulation to media sharing are presented. bandwidth of angle-modulated wave. wet floor effect. carrier phase estimation. performance of the optimum receiver for memoryless modulation. Amplitude modulation: baseband and carrier communication. quadrature amplitude modulation (QAM). optimum preemphasis-deemphasis systems. spectral characteristics of digitally modulated signals. amplitude modulation: single sideband (SSB).
An overview of PLA architectures: PLA100 – the basic 57 . Fundamentals of semiconductor. Surface experimental techniques in semiconductor nanotechnology. The ASIC techniques: Full Custom ASIC. Full Custom Integrated Circuits. AIM (Avalanche Inducted Migration). Programming technologies used with SPLD-s: metal fuses. Simple PLD-s Simple PLD architectures: PAL. Application Specific Integrated Circuits (ASIC-s). PROM (PLE). Technology of semiconductor thin solid films of special application. Standard Cell.35 Course Microelectronics ECTS 5 Lecturer: Jacek Szuber Objectives of the course To acquaint the students with fundamentals of microelectronics and its applications in modern technology. registered PAL-s – PAL16R4 – an example of a synchronous circuit implementation. explained using a simple FPLA device F100. Course load (hours per semester) Semester L P Lab 9 30 15 ID M2. EP900. a brief overview of complex PAL-s: the EP600. Fundamentals of semiconductor nanotechnology. FPGA-s. PLD families: Simple PLD-s. Course description Introduction to semiconductor microelectronics.Postgraduate courses: Electronics and Telecommunication Course load (hours per semester) Semester L P Lab 9 30 30 ID M2. Gate Arrays. PAL16L8 – the basic structure. An overview of PAL architectures: naming convention. EP1800 devices from Altera. FPLA (PLA). ultraviolet erasable cells (EPLD-s). programmable output polarity and its applications – PAL16P8. generic PAL-s – PAL22V10. Programmable Logic Devices (PLD-s). surfaces and interfaces. Complex PLD-s (CPLD-s). Technology of semiconductor single crystals for microelectronics. Semiconductor microsystems and devices.37 Course Programmable logic devices ECTS 4 Lecturer: Józef Kulisz Course description Introduction Some general remarks on contemporary digital circuit design and manufacturing techniques: Catalogue Logic. 1500 and 2500 devices. electrically erasable cells (EEPLD-s). the Atmel 750. The concept of a Programmable Logic Device. Technology and control of an ultrahigh vacuum for semiconductor nanotechnology.
The concept of Fast Carry Logic – design examples. programming technologies. the structure of a macrocell. output control. electrical parameters (propagation delays. antifuses. Digital Clock Managers (DCM-s). Power/Speed Selection Fuses. power supplies. the structures of Logic Modules. Design flow for CPLD and FPGA devices. Features of CPLD devices presented using the Altera Max 7000 family: the general architecture. SPLD design flow. a slice. Switch Blocks. the routing architecture. Programming technologies and programming procedures used with CPLD devices. electrical features of Max 7000 devices: logic standards accepted. The Xilinx Virtex family – an example of a coarse granularity device. the XOR gate in a macrocell and its applications (an example). an example of using the fast input. Programming technologies used in FPGA devices: SRAM cells. PLS architecture – PLS159. timing model and propagation delays. illegal state recovery issues. a LUT. An example combinatorial function implementation with decomposition to 5-input LUT-s. the concept of parallel and shareable expanders (an example). Some remarks on Folded NOR (Erasic XL78C800). FPGA-s The general structure of an FPGA device (CLB. the general structure. the structure of an I/O Block. A summary of SPLD features: process technologies. the Output Switch Matrix and output routing. a simple design example. The architecture of XPLD (eXpanded Programmable Logic Devices) devices and product term sharing concept. some remarks on the Complementary Line and it’s applications. Fine granularity vs. the concept of expanders implemented in Mach devices. Avoiding pitfalls in CPLD and FPGA design. some remarks on datapath optimisation. different modes of operation of a slice. A brief presentation of the Mach 4000 family from Lattice – another example of CPLD devices. programmable Interconnect Array (PIA). CPLD-s The general structure of a CPLD. A brief presentation of another CPLD families from Altera. the structures of PAL Blocks and Macrocells. Using VHDL for synthesis dedicated for PLD devices. I/O Cells). SPLD programming (parallel. some special features: Security Fuses. implementation of synchronous FSM-s in PLS structures: state coding. the JEDEC format. the structure of a Configurable Logic Block (CLB). the structure of I/O Modules. and folded NAND architectures. ISP Serial). FPGAs from Actel – an example of the antifuse devices: the general structure.Postgraduate courses: Electronics and Telecommunication structure. the structure of Logic Array Block (LAB). the Lattice 6001 device – an example of a complex PLA architecture. power supply). programmable interconnect resources. presented using the ispXPLD family from Lattice. A short presentation of the Virtex II and Spartan 3 families form Xilinx. routing channels. the structure of I/O Control Blocks. 58 . Coarse Granularity architectures and their relation to programming techniques. The other architecture features: block RAMs.
KMP. Pattern matching: brute force. Memory bandwidth and memory latency. heap sort. alpha-beta cut. Graph algorithms: BFS. data and control hazard). Cache memory. Theoretical boundaries of parallel processing. The lecture covers basic concepts. perfect hashing. Overview of techniques typically employed in vector computers design . minimal spanning tree. DFS.2 Course Computer architecture I Computer architecture II Course load (hours per semester) Semester L P Lab 7 30 8 30 ECTS 2 3 Lecturer: Krzysztof Trocki Objectives of the course Course description History of computer architecture and organization. Concept of tightly coupled and loosely coupled computer design. Distinction between architectural and organizational attributes of computer systems. Hashing: open and closed. Elements of computer memory organization: Principle of locality of reference (spatial and temporal locality). The course covers the following topics: The notion of computational complexity. Concept of grain of parallelism.36. binary. First mechanisms of parallel processing. algorithms and data structures. BM. Searching: linear. Vector computers: Memory-memory vector computers. Simple sorting algorithms. Min max search. Exhaustive search. Greedy algorithms. Binary search trees. ID M2. Heaps. Concept of virtual memory. Computer Networks and Systems Course load (hours per semester) Semester L P Lab 7 30 30 ID M2.35 Course Algorithm and Data Structures ECTS 6 Lecturer: Wojciech Mikanik Objectives of the course The course offers students comprehensive overview of algorithms. Pipelining: Instruction pipelining. Quicksort and k-selection. Divide and conquer. Heap: priority queues. Problems associated with pipelining (structural. Introduction to parallel processing: Various classifications of computer systems. The course offers students knowledge needed to analyse algorithms on their own. shortest path. while the classes give opportunity to practise the new skills and knowledge in practice Course description The course provides the knowledge required to understand and correctly use various algorithms and data structures. Other sorting algorithms: bucket sort. Arithmetic pipelining. radix sort.Postgraduate courses: Databases. Vector-register vector computers.36. branch and bound.1 M2. Vector instruction set advantages.
E/E/1. C/C/1. The same applies to computer networks. Very Large Instruction Word (VLIW) / Explicitly Parallel Instruction Computing (EPIC) approach. The lecture examines the main modelling methods based on queueing theory and illustrates them with typical examples and case studies to demonstrate their utility in investigation of real-life problems encountered in sizing computers and computer networks.2 Course Digital modelling and simlation I Digital modelling and simulation II ECTS 4 3 Lecturer: Tadeusz Czachórski Objectives of the course The lecture is an introduction to the problems of modelling and performance evaluation of computers and computer networks. Applications in modelling virtual paths and window mechanism in computer networks.Postgraduate courses: Databases.basic laws: utilization law. M/M/1/K. and it is more important than ever to ensure that the alternative selected provides the best costperformance trade-off. especially based on Internet protocols TCP/IP and ATM protocol. general response time law. Non-Cache Coherent NUMA. Computer Networks and Systems (stripmining. use. interactive response time law. Chapman-Kolmogorov equations. Mean Value Analysis (MVA) and related techniques: MVA for one class of customers (open and closed networks). Multimedia / Single Instruction Multiple Data streams extensions.1 M2. queues with Erlang (E) and Cox (C) distributions M/E/1. Modern general-purpose processors: Complex Instruction Set Computers vs Reduced Instruction Set Computers approach. finite population of executed processes. Software-Coherent NUMA). finite buffer effects. M/M/1//H. Interconnection networks. Course load (hours per semester) Semester L P Lab 7 30 30 8 30 ID M2. Massively Parallel Processors). M/M/c. especially to wide area communication networks. queues of the type M/M/1. Interconnection networks.37. vector chaining. Symmetric Multiprocessors). Operational models . Uniform Memory Access (UMA) computers (Parallel Vector Processors. Examples of programs executed on array computers. manufacturing. NonUniform Memory Access (NUMA) computers (Cache Only Memory Access. The material covers the following topics. Limitations of current design of modern general-purpose processors. balanced job bounds.37. MVA for multiple classes of customers (open. M/M/c/K/H. Post-Reduced Instruction Set Computers / Fast Instruction Set Computers approach. and upgrade. sales/purchase. compress and expand. scatter and gather). conditional vector execution. No-Remote Memory Access (NORMA) computers (Clusters. Processors for MIMD architectures. including its design. Performance evaluation is required at every stage in the life cycle of a computer system or network. approximate MVA. Array computers: General design of array computers (Distributed Memory and Shared Memory approach). asymptotic bounds. Multiprocessors & Multicomputers: Classification of Multiple Instruction Multiple Data Streams (MIMD) computers. Analysis of a single Markov queueing system: Markov chains with continuous and discrete time. closed and mixed networks). Cache Coherent NUMA. the computer industry is becoming more competitive. Course description As the field of computer design matures. Markov models 60 . their analytical solution and applications to model parallel execution. Little's law. forced flow law.
applications to model a disc station. hierarchical decomposition of large queueing networks.steady state and transient solution to a network of G/G/1 and G/G/1/N stations with one or multiple classes of customers. Full segment definitions. Memory models. Usage of programming and debugging tools. Simplified segment directives. Markov models of chosen quality of service and flow control mechanisms. flags. I/O addressing.1 M2. Procedures. Diffusion approximation method . G/G/1.38. Writting dynamic libraries. Addressing modes. Writting procedures with extended PROC statement and INVOKE directive. Registers. memory organization. The course lecture is accompanied by a set of laboratory exercises concerning basic and advanced assembler language programming topics: Installation and configuration of MASM 6. Basic notions of discrete-event simulation. sliding window and leaky bucket mechanisms). General components. Application to model mechanisms of congestion control at communication networks: at the entrance to a network (jumping window. Parameters. e. Writting Windows 32 applications. Interrupt handling. leaky bucket with tokens mechanism. Installation and configuration of MASM32v8.38. Type operators.g confidence interval and confidence level of simulation results. physical. G/M/1. Text macros. Data types. String directives.2 Course Programming in assembler I Programming in assembler II ECTS 2 3 Lecturer: Krzysztof Tokarz Course description The course on Programming in Assembler concerns the following groups of topics from the 8086 family microprocessors' programming: Introduction. Assembler in information technology and programming languages. Markov queueing networks: open and closed queueing networks. convolution algorithm. Macro functions. As a part of the laboratory students are to write their own application using chosen assembly environment (MASM 6. Macro procedures. Mixed language programming. Directives.Postgraduate courses: Databases. product form solutions.14 with Programmer's Workbench environment. and between nodes (reactive closed-loop mechanisms based on congestion notification). 61 . Format of the instruction. Writting and debugging simple MS-DOS programs. Loops. BCMP model. at a node (push-out and threshold space priority algorithms). effective address. From 8086 to Pentium4. Modules. global and local stability. 8086 family architecture. MASM. Single station analytical non-Markov models: M/G/1. Defining and using simple and complex data types. Directives. Course load (hours per semester) Semester L P Lab 7 30 8 30 ID M2. Operators. Computer Networks and Systems of self-similar network flows. RED queue. e. Instructions.g. Decision directives. Introduction to numerical methods and related software to solve numerically very large Markov models. an introduction to OMNET++ simulation package. Identifiers. Understanding program segments. C and Basic to MASM Interface. MMX instructions. Floating point coprocessor instructions. a tokenring local network. General purpose instructions.14 PWB or MASM32). Writting macros. Memory models. Statements. Logical. Interrupts and exclusions.
estimation of quality. organization. part 1 The UML language and methodics. optimization. software production process management.1 M2. Testing ideas.Requirements definition. Testing rules. Programming style. realization. Lectures: Introduction. Reviews in the software production process. structural methodics part1 Structural methodics part 2 Object methodics (before UML) The UML language and methodics.Software life-cycle. part 2 Implementation. software life-cycle models Managing a software project Strategy phase Requirements definition phase CASE tools in the strategy and requirements definition phases Analysis phases. protocol stack architectures and networking services: 62 . system project. the scope of interest of Software Engineering Software crisis. Debugging – approach. Measuring software efficiency.Postgraduate courses: Databases. reliability. Design – essence. building analytical models.39. testing stages.2 Course Software engineering I Software engineering II ECTS 2 3 Lecturer: Przemysław Szmal Objectives of the course The aim of the course is to present a review of selected problems in software engineering. Software quality estimation. Introduction to UML. Notation. Improving fault tolerance.17. testing ID M1. defensive programming. Structural and object-oriented approach to software system elaboration. preparing data for testing.2 Course Computer networks II Course load (hours per semester) Semester L P Lab 8 30 30 ECTS 6 Lecturer: Mirosław Skrzewski Course description This course on Computer Networks presents advanced topics related to networking. Computer Networks and Systems Course load (hours per semester) Semester L P Lab 7 30 8 30 ID M2. . Course description The course gives introduction to the following topics: .39.
VPN. User access security – packet filtration (firewall) systems.40. Client-server versus peer-to-peer architecture. DoD architecture – protocols IP. TCP. Problems of security in network services – protocols with information encryption – ssh. UDP. communication subnets. NetBIOS over TCP. PPP protocols. naming convention. mail. data encapsulation. Transport. presenting advanced topics of protocol services interface (API) and client-server programming. SAP. CSMA/CA). SMB protocol. The course lecture is accompanied by a set of laboratory exercises. layer-to-layer communication. methods of network congestion prevention. while the classes give opportunity to practise the new skills and knowledge in practice. ISO OSI Reference Model architecture. services configuration and network traffic monitoring. Organization of date exchange in NetWare systems.2 Course Concurrent programming I Concurrent programming II ECTS 4 3 Lecturer: Wojciech Mikanik Objectives of the course The course offers students comprehensive overview of concurrent programming. transmission primitives. name to address conversion. Channel length limitation. ISDN. ARP. network addressing. End-to-end flow control. dynamic or static IP addressing. basic rules included in low-level protocols – block transmission. Examples of network architectures. presentation. Information transport problems and solutions. NetBIOS related services in Windows XX systems. cable modem access.40. fixed route. telnet.Postgraduate courses: Databases. Course load (hours per semester) Semester L P Lab 8 30 30 9 30 ID M2. Token Ring) channels. connection. connection-less transmission. sliding window principle. session. group retransmission. services access. error correction. Modem access – SLIP. network address translation. principles of systems communication. SPX. routing algorithms – flooding. The lecture covers basic concepts and mechanisms. media access protocols for radio (ALOHA. reservation. wire (CSMA/CD. NetBIOS over IPX. IPsec. services access. distribution of routing information. assigned numbers. network addressing. ICMP. PPTP. ftp. NetBIOS protocol. piggy-back / group acknowledgement. adaptation protocols. block / acknowledgement identification. error checking.1 M2. packet) switching. Access address distribution. channel switching. name to address translation (DNS). routing information gathering. application layers and their functions in ISO architecture. Multi-access channels. token passing) and ring topology (Cambridge Ring. layer addressing. XNS (NetWare) stack of protocols. name space. protocol transparency. Computer Networks and Systems principles of point-to-point communication. frame transmission. information (message. broadband access – xDSL protocols. flow control. 63 . protocol modification (IPX. bandwidth distribution. RIP). rpc as examples of client-server architecture. Architecture of network access (last mile architecture). Internet services organization – http. Routing.
design and develop concurrent programs. Lectures are illustrated with many sample programs. (Stack-less) finite-state automata – nondeterministic. 64 . nonrecursive predictive analysis. the lexical analyser generator. disambiguation. The second semester of the course offers students an occasion to create programs on their own during laboratories. Error handling: detection and diagnosing.Postgraduate courses: Databases. Top-down syntax analysis: deterministic analysers based on the recursive descent principle. Computer Networks and Systems Course description The course provides the knowledge required to understand. RPC.41. Translation schema variants.2 Course Introduction to compilers I Introduction to compilers II ECTS 2 2 Lecturer: Przemysław Szmal Objectives of the course Aim of the subject: The aim is to present selected problems connected to programming language description and compiler construction. Formal grammars. The course covers the following topics: Introduction to concurrency.41. Grammar transformations: left recursion elimination. Course description In the framework of the lecture the following topics will be discussed: Essence of programming language machine translation: generating equivalent programs expressed in another language. Analysis algorithm. Chomsky’s classification. macrogenerators. deterministic. LR-grammars. error recovery and correction. constructing simple (SLR) canonical (LR). Operator-precedence grammars – analysis algorithm. as well as ways of extending them for translation purposes. consolidation.1 M2. Building translators with use of the yacc generator: introducing semantic actions through translation schemata. LL-grammars. The syntactic layer – context-free grammars. optimization. look-ahead (LALR) LR-analysers. How to specify concurrent execution. application in the course of lexical analysis. Course load (hours per semester) Semester L P Lab 8 30 9 30 ID M2. syntactic and semantic layers of programs. linkers and so on – are covered. Bottom-up syntax analysis. Shared memory model: communication and synchronization using semaphores and monitors. Guarded commands. The student masters algorithms and methods for lexical and syntactic analysis. Characteristic stages in translating programs to target form: compilation and its phases. transforming. Topics suitable for construction of simple translators met in programmer’s practice – command interpreters. Distributed memory model: communication and synchronization via message passing. Evaluating precedence functions. Lexical layer of programming languages – regular grammars. Properties of concurrent programs and their correctness. Connections with the construction of the language virtual machine. constructing parse-driving table. Lex. building. Lexical. Construction of parse-driving table. Language description methods and using them in the text analysis stage. (left) factorisation.
general description for multimedia home platform. mechanisms for multithreading organization. Course description During the course following lecture subjects are realized: general language description. (4) Building applications intercommunicated by means of streams and sockets. Executing a simple stand-alone application and an applet. object member data organization. Java servlets technology in enterprise applications. fundamentals of Java 2 Micro Edition platform. collection framework and design patterns in Java. ways of parameter passing. starvation. tools and methods that enable building programs destined for exploitation both as the Internet and standalone applications. built-in data types. building programming environments using components from the Java Foundation Class (JFC) package. the Java programming language will be presented with its means. threads synchronization. graphical user interface designing with AWT. mechanisms for error handling. deadlock and other multithread problems. realization of the object programming idea in Java. midlet lifecycle. creating and deleting objects. Computer Networks and Systems Course load (hours per semester) Semester L P Lab 8 30 30 ID M2. Among others. methods of application intercommunication based on streams and sockets. Java Native Interface . Special cases of inheriting member elements: end components. (6) Programming mobile phones using Java 2 Micro Edition standard library. (5) Developing applications server using the Java Servlets. exception handling. Swing and SWT components. Practical part of the course contains: 6 subject units: (1) Getting acquainted with the JDK (Java Development Kit) package and the Eclipse program development environment. final components. (2) Building multithreading applications (3) Building graphical user interfaces in window technology using Swing components. using higher and lower level operations to handle network connections with TCP and UDP protocols. 65 . interfaces. I/O operation organization. also fundamentals of enterprise applications and application for mobile devices will be presented. basic rules for building and executing applets. multithreading and network protection will be exposed. principles of access to member elements. serialization. Java as a re-usable component language. technique. similarities and differences as opposed to the C++. abstract classes. mechanisms for event handling. data processing in streams. inheritance mechanism. defining classes – general rules.using native libraries in Java applications.29 Course Java and internet programming ECTS 4 Lecturer: Krzysztof Dobosz Objectives of the course In the framework of the subject. method defining – non-elementary cases. Modifying sample applications.Postgraduate courses: Databases. general rules for mobile devices programming. layout managers.
11b. electromagnetic waves division. medium. Comparisons of selected products. Packet Radio. interference. Survey of wireless transmission hardware. Infrared and laser waves properties. Local area networks.trunking network standard. operation rules. Further research over protocol converters. MACA. Wide area mobile networks.RS-232 link. HiPeRLAN/2. Survey of wireless transmission hardware.Postgraduate courses: Databases.11. Hardware and software structure. Computer Networks and Systems Course load (hours per semester) Semester L P Lab 8 30 ID M2. efficiency. SRMA.11a. MACAW. Protocol converter for RS-232C link. Connection methods on physical or logical link layers level. Efficiency comparison for the most important protocols. Introduction to wireless media characteristics. Law restrictions and general technical parameters of wireless links. TNC controllers. Modern data transmission in telephony systems (HSCSD. Modulation methods. Local area networks . Other solutions.IrDA and BlueTooth systems. TETRA . Bridges.31 Course Wireless computer networks ECTS 2 Lecturer: Bartłomiej Zieliński Course description Reasons for the usage of wireless transmission media. Bands division. Medium access protocols in wireless local networks. GSM .cellular telephony standard. Protocol converter for industrial networks. 802. Opportunities of wireless media application. Wired and wireless network integration. MSAP. Network efficiency in presence of converters . Network adapters. examples. short. CDPD. Radio waves characteristics. Classifications.Mobitex. Modulation in optical systems. Optical links classification.cordless telephony standard. Radio waves utilisation for data transmission. European standards: HiPeRLAN. BTMA. Hardware and software construction. GPRS).Aloha. Spread spectrum systems. Computing power and transmission efficiency. ultrashort and microwaves. Packet controllers. Radiocommunication system parameters design. Protocol properties: Aloha. 802. FAMA and BAPU. Converter for multisegment Modbus network. Classifications. Propagation description for waves: long. The need for new protocol definition: hidden and exposed nodes. Comparisons of selected products.American standards: IEEE 802. Stationary wide area networks . Propagation classification. Personal area networks . IEEE 802. Wide area stationary networks. 66 . Cordless and cellular telephony. capture effect. Mobile wide area networks . Radiomodems and optical modems. Trunked networks. CSMA. DECT .15 WPAN standard. Problem genesis. Modbus network with one and many segments. Optical waves characteristics. Survey of wireless digital transmission systems.
Procrustes Analysis. The students will be familiarised with technical know-how obtained during the implementation of already working automatic face recognition system. the best students will be given an opportunity of cooperation with a company dealing with computer vision and face recognition. examples.and second. Active Shape Model and Actie Appearance Model. The lecture will address the issues concerning biometric systems. Active Appearance Models: Active models: snake (active contour).Postgraduate courses: Databases. particularly concentrating on face recognition problems. Projective geometry: Relations between the 3D scene and its projected images. Hierarchic approach. Computer Networks and Systems Course load (hours per semester) Semester L P Lab 8 30 30 ID M2. Mandelbrot set (method. algorithm). Koch snowflake. Multilevel deformation analysis. The epipolar constraint. edge detection. Stereo matching: Cepstral matching. The laboratory classes will provide a possibility of implementing the main phases of face recognition described during the lecture. The aim of this subject is to present the principal technologies used in the biometry and prepare the students for designing and building advanced biometric systems. Deformations of geometric shapes: Shape and Form. Image segmentation: thresholding. Course load (hours per semester) Semester L P Lab 9 30 30 ID M2. texture mapping. dilatation tensor. mip maps. Creating disparity maps. Hausdorff dimension Ray tracing: ray tracing and radiosity methods. Size measures.order statistics) Fractals: definition. Fundamental matrix. 67 .43 Course Computer graphics and vision II ECTS 6 Lecturer: Leszek Luchowski Course description Textures: definition. The students will create or modify components of an existing system. Optimal superposition vs baseline superposition. Moreover. which will make it easier to test and assess the effectiveness of applied methods and solutions. statistical texture analysis (first. texels. Cantor set. Iterated Function System with Probability. Sierpinski carpet. Dilatation. types of texture.52 Course Face Recognition and Biometric Systems ECTS 4 Lecturer: Michał Kawulok Course description In recent years a sudden development of the market dealing with biometry can be observed and probably a demand for computer systems of identification will be still increasing. contour tracking. history of fractals.
matching graph structures. PL/SQL language. methods of scanning. Practical uses in industrial inspection. software for 3D modeling. security of database. mesh and surface representation. Profiles Data integrity: Control structures. Database Auditing Database security: Users. Creating tablespaces.5). robotics.5 68 . Course description Lecture of ORACLE database management system presents basic problems of administration of ORACLE database and tools used to create applications in DBMS ORACLE. Idea of reconstruction in CT: algebraic methods. Computer Networks and Systems Calibration and Reconstruction: Identifying the parameters relating the image to the scene. navigation algorithms. updating scene models Active Vision: Architecture. Besides main tool for creating application such as Oracle Forms there is presented PL/SQL language.5. Using them to locate points in 3D. extents and data blocks.44 DBMS Oracle Course ECTS 4 Lecturer: Bożena Małysiak Objectives of the course The subject is aimed to present chosen problems connected to the ORACLE relational database management system and tools in Developer packet used to create applications. Introduction to Computed Tomography. Data dictionary. matching strategy and constraints (such as Procrustes distance). representations of geometric objects. Memory structure and processes. registration and merging methods. and other areas. Applications of computer vision: Intermediate-level vision tasks useful in technology. Hints Creating database backup: database backup. graph representation of scene structures. view-point selection. Designing and creating database: Specifying size of data files and tablespaces. 3D scanner: types of 3D scanners. Topics Architecture of system: Physical and logical structure of database. automation. Database triggers Query optimization: Explaining query plans (Rule-Based i Cost-Based). Radon transform. Computed Tomography: The idea of X ray Imaging. Sinogram. control files and logfiles). Reports V2. Reconstruction of 3D surfaces from slices (Marching Cubes algorithm). query optimization and database backup creating and recovering database from backup. Different types of files (data files. Algorithm for integration of 3D scene model. recovering of database DEVELOPER/2000: tools (Forms V4. Course load (hours per semester) Semester L P Lab 9 30 30 ID M2. Delaunay triangulation. management of data resources. medicine. designing and creating database. 3D scene integration: Architecture of active vision system. Among presented problems of ORACLE database administrating there are described: system architecture. Attenuation coefficients and CT numbers. privileges and roles. Central Slice Theorem. Oracle Forms V4. Generation of tomograms. Fourier methods.Postgraduate courses: Databases. Managing of database resources: Defining ORACLE segments. process of modeling surfaces.
Type checking. linkers etc. Computer Networks and Systems Oracle Reports V2. To the student who is familiar with principles of lexical and syntactic analysis. intermediate code generation.Postgraduate courses: Databases.synthesized. select task scheduling. type equivalence verification. transforming source programs written in high-level programming languages into target programs equivalent to them. inherited. we expose problems due to semantic analysis. Attributes . The lecture is connected with projecting of distributed computer systems. It is also related to the construction of other programs such as macro-generators. which perform exchanges between subscribers in order to make system well 69 . Code optimization: peep-hole optimization. Back-patching technique.5 Designer/2000: Process Modeler. activation records. responsible for generating executable programs.target machine models. Course description Semantic analysis tasks. procedure calls. It also concern on useful efficiency and the useful capacity of used computer systems. Code generation . representations. Parse-time attribute evaluation. System Modeller. Course load (hours per semester) Semester L P Lab 9 30 30 ID M2. flow-analysis based global optimisation. The lecture should help configure distributed real-time systems in particular a well selection of subscribers’ types and kinds. Many solution used in compilers can be also applied to interpreting programs. use monitoring and formal system description methods. Intermediate code. concurrent processing organization. target code generation and code optimization. Reverse Engineering ID M2. register and memory management. methods of description.45 Course Distributed computer systems ECTS 5 Lecturer: Rafał Cupek Objectives of the course The goal of classes is showing the problems of using and constructing the distributed computer systems in soft real-time and hard real-time applications. Translating expressions and instructions. Attribute dependence graphs.53 Course Compiler construction Course load (hours per semester) Semester L P Lab 9 30 ECTS 2 Lecturer: Przemysław Szmal Objectives of the course The subject is aimed to present chosen problems connected to construction of compilers. Memory organization. Attribute representation in the parse stack. Run-time environments. Syntax-directed translation. S-attributed and L-attributed syntax-directed definitions.
column provider. Graphic Device Interface. and also shows many practical examples. space transformations. TrueType fonts and text output basics. windows hooks. copy handler). Task and timing: timing constraints. common dialog boxes. file associations. event driven operating system. Network Time Protocol. vector clocks. custom controls. time synchronisation Cristian’s algorithm. Students will find out what is the architecture of Windows API. debugging approaches with monitoring support. threads synchronization. „Best Effort” Scheduling. bitblit operations. basic techniques: shortcuts.and subclassing). consistent system state. Win32 object security. Course description The course covers following areas: Win32 basics: Win32 concepts and architecture. hybrid monitoring. Marzullo: Neiger algorithm. logical clock. Rate Monotonic Analysis. clock access. Dynamic Data Exchange. shell handlers (context menu. Course description The Distributed System and Real Time System: definition and real-time system’s classification: hard and soft real-time systems. periodic tasks: sporadic tasks. Logical time. Individual Marked Nets. windows controls. user input (mouse and keyboard messages handling). Real-Time Scheduling Paradigms: task model. Chandy-Lamport algorithm. physical and memory device contexts. extending window classes (super. TCPN . hardware monitoring. Places and Transitions. common controls. Component Object Model basics Shell programming. multithreaded applications. Universal Coordinated Time. message queue. message handling. 70 . Win32 services.47 Course Programming for Windows ECTS 6 Lecturer: Sławomir Cichoński Objectives of the course The course teaches how to write applications using native Microsoft Windows 32 Application Programming Interface. Time aspects in UML. window procedure. The lecture describes system on model level. advanced techniques: item identifier lists. window creation. Win32 interprocess communication. Real-Time Specification for Java. namespace extensions. Advanced Win32: dynamic libraries.Postgraduate courses: Databases. process and system level monitoring. Global state in distributed systems: Snapshot. printing. Computer Networks and Systems efficient and kip required timing constraints. Multi Document Interface. software monitoring. Course load (hours per semester) Semester L P Lab 9 30 30 ID M2. dialog boxes. Formal methods: Petri nets: Events and Conditions Nets. IEEE 1588 protocol. what services are available in this system for the programmer and how to use them in own applications. drawing basics.Timing Constraint Petri Nets.
71 . Simulation of some special processes: Markov chain. gaussian processes. for instance. Poisson process. The course subject matter is discussion of administration and usable aspects of the Microsoft SQL Server. This may be reliability engineering where reliability of the system depends on the reliabilities of elements and the structure of the system etc. Computer Networks and Systems Course load (hours per semester) Semester L P Lab 9 15 15 ID M2. database security mechanism usage against unauthorized access. Methods dedicated to particular distributions. administration and using the modern database servers. They include issues like: database server installation. Simulation of queueing systems. creating new databases with the physical allocation data analysis. The laboratory is devoted to practical simulation of random variates and processes using C++ programming language and algorithms presented during lectures. The course is divided into two parts: lectures and laboratory. Stochastic simulation is helpful in engineering of all these systems which have stochastic nature and deal with random events. The lectures includes the following topics: Short revision of probability theory and stochastic processes. Course load (hours per semester) Semester L P Lab 9 15 15 ID M2.54 Course DBMS SQL Server ECTS 2 Lecturers: Paweł Kasprowski. inhomogeneous Poisson process. batch Markovian arrival process. Katarzyna Harężlak Objectives of the course The aim of the course is to present the mechanisms of database management systems taking as an example the MS SQL Server Course description The aim of this subject is making students familiar with the ways of configuration. Markov-modulated Poisson process.Postgraduate courses: Databases. Random number generators. fractional Brownian motion. General methods for generating of continuous and discrete distributions. Brownian motion. Generating of normal distributions. Using the Microsoft SQL Server. Levy jump process. This may be.50 Course Stochastic Simulation ECTS 2 Lecturer: Andrzej Chydziński Course description The main target of Stochastic Simulation classes is to show techniques of random variables and stochastic processes simulation by means of computer. students get the knowledge about nowadays possibilities given by the database servers and ways of their usage by the system administrators and by the application programmers. computer networks engineering where usually the streams of packets have complicated random structure.
Additionally. During the laboratories students have a possibility of practical exercising knowledge and abilities developed during the course. Computer Networks and Systems monitoring and tuning the server performance and Transact-SQL language basis. distributed databases and OLAP technologies are also presented.Postgraduate courses: Databases. Subject is organized in co-operation with the Microsoft Company and based on original Microsoft SQL Server materials. 72 .
This action might not be possible to undo. Are you sure you want to continue?
We've moved you to where you read on your other device.
Get the full title to continue listening from where you left off, or restart the preview.