Gurantor department | Department of Computer Science | Credits | 5 |

Subject guarantor | Ing. Martin Kot, Ph.D. | Subject version guarantor | Ing. Martin Kot, Ph.D. |

Study level | undergraduate or graduate | Requirement | Optional |

Year | 1 | Semester | summer |

Study language | Czech | ||

Year of introduction | 2010/2011 | Year of cancellation | 2011/2012 |

Intended for the faculties | FEI | Intended for study types | Follow-up Master |

Instruction secured by | |||
---|---|---|---|

Login | Name | Tuitor | Teacher giving lectures |

KOT06 | Ing. Martin Kot, Ph.D. |

Extent of instruction for forms of study | ||
---|---|---|

Form of study | Way of compl. | Extent |

Full-time | Credit and Examination | 2+2 |

Combined | Credit and Examination | 10+0 |

To understand the basic concepts and methods of mathematical information and communication theory
To gain basic experience with solving simple queueing systems and/or reliability systems by means of markovian models and methods

Lectures

Tutorials

The course deals with stochastic models and methods often used in computer science, namely with information and communication theory, queue theory and reliability theory. The accent is put on simple markovian models that can be completly solved by standard mathematical methods.

http://en.wikipedia.org/wiki/Information_theory
Trivedi K.S.:Probability and Statistics with Reliability, Queueing and Computer Science Applications. New York, John Wiley, 2002.

Stochastické metody v informatice

Requirements during a semester:
- A written test during a semester (for 35 points)
Requirements for a credit:
- To get a credit, a student must obtain from the written test at least 15 points.
The exam:
- The exam is of a written form.
It is possible to get 65 points for the exam.
To pass out the exam it is necessary to get at least 20 points.

Subject has no prerequisities.

Subject has no co-requisities.

Lectures:
Probability theory recapitulation: random event, basic rules for probability, random variables and their distributions.
Information theory 1.: entropy, conditional entropy, information measures, mutual information.
Information theory 2.: language and its information characteristics, measures of redundancy, basic notions of coding theory.
Information theory 3.: communication and memory channels and their information characteristics, noisy channels, error correcting codes, Hamming codes.
Random process theory 1.: types of stochastic processes, markovian and semi-markovian processes, Poisson flow of events.
Random process theory 2.: homogenous and stable markovian processes, transient and steady state, computation of steady-state probabilities.
Queueing theory 1.: basic notions (arrival, service, server, queue, service discipline,...), Kendall clasification of queueing systems.
Queueing theory 2.: selected models of opened systems, with or without losses, with or without finite buffers, with or without limitations on waiting time.
Queueing theory 3.: selected models of closed systems, general queueing systems, stochastic nets nets.
Dependability (reliability) theory 1.: fundamentals, markovian dependability models.
Dependability theory 2.: selected models of non- recovered systems.
Dependability theory 3.: selected models of recovered systems.
Stochastic Petri nets (SPN) and generalized stochastic Petri nets (GSPN).
Using SPN and GSPN for systems performace analysis.
Exercises:
The content of exercises is determined by the content of lectures. The main goals are:
Recapitulation of some necessary prerequisities from probability theory and theory of stochastic processes
Confirm understanding of theoretical knowledge by means of solving simple examples
Master the technique of markovian approximation of more complex stochastic processes
Gain some experience with standard queueing and reliability models solving

Task name | Type of task | Max. number of points
(act. for subtasks) | Min. number of points |
---|---|---|---|

Exercises evaluation and Examination | Credit and Examination | 100 (100) | 51 |

Exercises evaluation | Credit | 35 (35) | 15 |

Test | Written test | 35 | 15 |

Examination | Examination | 65 (65) | 20 |

Written exam | Written examination | 65 | 20 |

Show history

Academic year | Programme | Field of study | Spec. | Zaměření | Form | Study language | Tut. centre | Year | W | S | Type of duty | |
---|---|---|---|---|---|---|---|---|---|---|---|---|

2011/2012 | (N2647) Information and Communication Technology | (2612T025) Computer Science and Technology | P | Czech | Ostrava | 1 | Optional | study plan | ||||

2011/2012 | (N2647) Information and Communication Technology | (2612T025) Computer Science and Technology | K | Czech | Ostrava | 1 | Optional | study plan | ||||

2010/2011 | (N2647) Information and Communication Technology | (2612T025) Computer Science and Technology | P | Czech | Ostrava | 1 | Optional | study plan | ||||

2010/2011 | (N2647) Information and Communication Technology | (2612T025) Computer Science and Technology | K | Czech | Ostrava | 1 | Optional | study plan |

Block name | Academic year | Form of study | Study language | Year | W | S | Type of block | Block owner |
---|