|
Lecturer(s)
|
-
Koucký Miroslav, doc. RNDr. CSc.
|
|
Course content
|
unspecified
|
|
Learning activities and teaching methods
|
Monological explanation (lecture, presentation,briefing)
- Class attendance
- 56 hours per semester
- Preparation for exam
- 90 hours per semester
|
|
Learning outcomes
|
Introduce to the following parts: k-out-of-n systems, consecutive-k-out-of-n systems, systems with network structure and their reliability.
Theoretical knowledge and ability to apply them.
|
|
Prerequisites
|
Knowledge of the secondary level mathematics
|
|
Assessment methods and criteria
|
Combined examination
Active participation in seminars, credit, knowledge accordant with syllabus.
|
|
Recommended literature
|
-
HARMS, Daryl. Network reliability: experiments with a symbolic algebra environment.
-
CHANG, G. CUI, L. HWANG, F. Reliabilities of Consecutive-k Systems. Dordrecht: Kluwer Academic Publishers, 2005. ISBN 978-0-7923-6661-4.
-
PHAM, Hoang. Handbook of reliability engineering. London: Springer, 2003. ISBN 1852334533.
-
SHIER, Douglas. Network reliability and algebraic structures. New York: Oxford University Press, 1991. ISBN 0-19-853386-1.
|