9600-0009/02 – Unconvential Algorithms and Computations (NAV)

Gurantor departmentIT4InnovationsCredits10
Subject guarantorprof. Ing. Ivan Zelinka, Ph.D.Subject version guarantorprof. Ing. Ivan Zelinka, Ph.D.
Study levelpostgraduateRequirementChoice-compulsory type B
YearSemesterwinter + summer
Study languageEnglish
Year of introduction2015/2016Year of cancellation
Intended for the facultiesUSP, FEIIntended for study typesDoctoral
Instruction secured by
LoginNameTuitorTeacher giving lectures
ZEL01 prof. Ing. Ivan Zelinka, Ph.D.
Extent of instruction for forms of study
Form of studyWay of compl.Extent
Full-time Examination 2+0
Part-time Examination 10+0

Subject aims expressed by acquired skills and competences

The aim of the course is to acquaint its students with unconventional algorithms from physical, biological processes and complex systems. The graduate will gain an overview of modern computational procedures based on principles observed from complex processes and dynamics. Upon successful completion of the course, the graduate will be able to apply the methods discussed in the course to real problems. This course is not a free continuation of the BIA course.

Teaching methods

Lectures
Individual consultations

Summary

The aim of the lectures is to introduce to the students the problems of non-conventional algorithms, their biological - physical origin. The lectures will be discussed the various areas of their origin, usually from natural complex systems with an emphasis of their physical-mathematical and algorithmic description and implementation of the PC. The lectures will give the students an interdisciplinary perspective on the issue of non-conventional algorithms, complex systems and their dynamic behaviour. Students get an overview of modern computational algorithms allowing them to model and simulate the otherwise very complicated and complex systems (deterministic chaos, Thom's catastrophe theory, fractal geometry, swarm intelligence, algorithms, quantum mechanics, cellular automata, "physarium machines", "Self-Organized criticality", ...) and vice-versa will get insight on how are unconventional algorithms derived from above-mentioned complex systems. After successfully completing the course will have an interdisciplinary graduate survey knowledge of unconventional algorithms and will be able to apply the methods discussed in the course to real problems. Students should be able to continue further in deeper self-study in this topic.

Compulsory literature:

1. Back T., Fogel D. B. & Michalewicz Z., Handbook of Evolutionary Computation, (Institute of Physics, London), 1997 2. Hilborn R.C.1994, Chaos and Nonlinear Dynamics, Oxford University Press, ISBN 0-19-508816-8, 1994 3. Ilachinsky A., Cellular Automata: A Discrete Universe, World Scientific Publishing, ISBN 978-9812381835, 2001

Recommended literature:

4. Bekenstein J. D., Information in the Holographic Universe, Scientific American, August, 2003 5. R. Gilmore 1993, Catastrophe Theory for Scientists and Engineers, John Wiley and Sons, ISBN 0-486-67-539-4, 1993 6. Gheorghe Paun (Author), Grzegorz Rozenberg (Author), Arto Salomaa, DNA Computing: New Computing Paradigms, Springer, ISBN 978-3540641964 7. Zelinka I, Celikovsky S, Richter H and Chen G., (2010) Evolutionary Algorithms and Chaotic Systems, (Eds), Springer, Germany, 550s, 2010.

Way of continuous check of knowledge in the course of semester

The examination is based on the elaboration of the protocols of the subject, by which the student demonstrates not only the understanding of the lecture information but also the ability to implement them in the given programming environment. To obtain a credit, you must hand over all the required protocols and have at least 80% of physical attendance at the laboratories. Credit is a vital condition for admission to the exam. The exam is oral.

E-learning

Other requirements

It is required the ability to create programs in arbitrary programming language and apply lecture knowledge into algorithms. Additional requirements are not defined.

Prerequisities

Subject has no prerequisities.

Co-requisities

Subject has no co-requisities.

Subject syllabus:

Lectures: 1. Complexity. The current state of understanding of complex systems and their classification. Synergetics. Demonstration-motivational examples and videos demonstrating the occurrence of the behaviour of complex systems in everyday real life. 2. Artificial neural networks (ANN), basic concepts, principles and classifications. Training set, structure and topology ANN. Type of learning. Separability. 3. Artificial neural networks (ANN), Perceptron, multilayer perceptron and backpropagation learning. 4. Artificial neural networks (ANN), design of network topology, unconventional learning methods, training set and its construction from data. 5. Artificial neural networks (ANN), Examples of use. 6. Algorithms of deterministic chaos. Historical outline and classification of dynamical systems generating chaos. Simple models and examples. Determinism and the edge of chaos (according to Kaufmann). Typical chaotic systems: Lorenzo's model of weather and a strange attractor, electronic system and the problem of three bodies (binary and planet model). Divergence of close trajectories. Determinism and unpredictability. Invariants of chaotic behaviour. Feigenbaum constants, self-similarity, U-sequences, computers and chaos. Discrete dynamical systems. Basic simple models, Poincaré sections, bifurcations, bifurcation diagram as a holistic view of system behaviour, algorithms and examples. From order to chaos: paths leading to chaotic behaviour. Period doubling, quasi-periodicity, alternation and crisis. Bifurcations and Thom's disasters. Algorithmization of chaotic behaviour and methods of reconstruction. Use in cryptographic techniques, chaos control and its occurrence in economic systems 7. Thom's theory of disasters and connection with chaotic behaviour. Introduction to the issue, basic models and hierarchy of disasters. Their occurrence in system dynamics and identification algorithms according to symptoms in the measured data. Examples of occurrence: economic systems, physical systems, mechanical systems. 8. Algorithms of fractal geometry and visualization of complex structures. IFS algorithm. History, the definition of fractal, basic types of algorithms generating fractals. Fractal dimensions, interpolation and compression. 9. Fractal geometry algorithms - TEA algorithm and Mandelbrot set, Julius sets and their graphical preview. development systems and artificial life. L-systems, turtle graphics, parametric L-systems, algorithmization of L-systems from the point of view of fractal geometry. 10. Algorithms of fractal geometry - occurrence in nature, data, behaviour of systems and technology. Applications in graphic design, art, computer games and film - video demonstrations. 11. Algorithms and complex systems. Complex systems generating the effect of "self-organized criticality" (self-organized criticality - SOC), their modelling (models such as sand piles, ...) and occurrence in real complex systems (evolution, earthquakes, avalanches). 12. Cellular automata (BA) and complex systems. BA formalism, dynamics and classification of cellular automata according to Wolfram, Conway's game of life, modelling using BA. Cellular automata and space-time chaos. BA and music generation. BA and solving complex problems. Complex algorithmic behaviour of BA based on simple rules. 13. Algorithms and complex networks. Introduction to complex networks, methods of visualization and algorithmization of their dynamics. Examples of the occurrence of complex networks (social networks, dynamics of evolutionary processes, ...). Visualization of complex network dynamics using models of chaotic systems. Visualization of the dynamics of evolutionary techniques using complex networks. 14. Course summary. Mutual connections between individual types of algorithms, their dynamics and behaviour of complex systems.

Conditions for subject completion

Full-time form (validity from: 2015/2016 Winter semester)
Task nameType of taskMax. number of points
(act. for subtasks)
Min. number of points
Examination Examination  
Mandatory attendence parzicipation:

Show history

Occurrence in study plans

Academic yearProgrammeField of studySpec.ZaměřeníFormStudy language Tut. centreYearWSType of duty
2021/2022 (P0613D140021) Computational Science P English Ostrava Choice-compulsory type B study plan
2021/2022 (P0613D140021) Computational Science K English Ostrava Choice-compulsory type B study plan
2021/2022 (P2658) Computational Sciences (2612V078) Computational Sciences P English Ostrava Choice-compulsory study plan
2021/2022 (P2658) Computational Sciences (2612V078) Computational Sciences K English Ostrava Choice-compulsory study plan
2020/2021 (P0613D140021) Computational Science K English Ostrava Choice-compulsory type B study plan
2020/2021 (P0613D140021) Computational Science P English Ostrava Choice-compulsory type B study plan
2020/2021 (P2658) Computational Sciences (2612V078) Computational Sciences P English Ostrava Choice-compulsory study plan
2020/2021 (P2658) Computational Sciences (2612V078) Computational Sciences K English Ostrava Choice-compulsory study plan
2019/2020 (P2658) Computational Sciences (2612V078) Computational Sciences P English Ostrava Choice-compulsory study plan
2019/2020 (P2658) Computational Sciences (2612V078) Computational Sciences K English Ostrava Choice-compulsory study plan
2019/2020 (P0613D140021) Computational Science P English Ostrava Choice-compulsory type B study plan
2019/2020 (P0613D140021) Computational Science K English Ostrava Choice-compulsory type B study plan
2018/2019 (P2658) Computational Sciences (2612V078) Computational Sciences P English Ostrava Choice-compulsory study plan
2018/2019 (P2658) Computational Sciences (2612V078) Computational Sciences K English Ostrava Choice-compulsory study plan
2017/2018 (P2658) Computational Sciences (2612V078) Computational Sciences P English Ostrava Choice-compulsory study plan
2017/2018 (P2658) Computational Sciences (2612V078) Computational Sciences K English Ostrava Choice-compulsory study plan
2016/2017 (P2658) Computational Sciences (2612V078) Computational Sciences P English Ostrava Choice-compulsory study plan
2016/2017 (P2658) Computational Sciences (2612V078) Computational Sciences K English Ostrava Choice-compulsory study plan
2015/2016 (P2658) Computational Sciences (2612V078) Computational Sciences P English Ostrava Choice-compulsory study plan
2015/2016 (P2658) Computational Sciences (2612V078) Computational Sciences K English Ostrava Choice-compulsory study plan

Occurrence in special blocks

Block nameAcademic yearForm of studyStudy language YearWSType of blockBlock owner