|
|
The Shortest Graph's Pahts Finding
Jágr, Petr ; Ohlídal, Miloš (referee) ; Jaroš, Jiří (advisor)
The aim of this thesis is finding, comparing and implementation of algorithms for finding the shortest paths between each of pairs of nodes in a graph. For this task I use modifications of existing algorithms to achive the lowest time consumption of the computation. Modifications are established on Dijkstra's and Floyd-Warshall's algorithm. We also familiarize with Bellman-Ford algorithm.
|
|
|
The effectiveness of binaural beats to induce a relaxation states
VEJBOR, Roman
This bachelor thesis deals with studies of binaural beats, specially their effect on the signal, measured by EEG. The aim of this study was to investigate if binaural beats are an effective tool to induce relaxation states, namely increased brain actvity in the alfa and theta frequencies. The theoretical part describes electrical activity of the brain, the issue of binaural beats and researches related to this issue. Following several chapters are about neuroplasticity as a possible aspect of the effectiveness of binaural beats. Penultimate chapter mentions the question of consciousness and is also linked to altered states of consciousness. Conclusion of the teoretical part is focused on the method of electroencephalography. The practical part is devoted to a research project in which brain activity has been examined in experiment while listening to the two types of audio records. Record of relaxing music and record of relaxing music with binaural beats implemented. Research was attended by a total of thirteen college students of the University of South Bohemia. The sample was selected using the snowball method. Data were processed and analyzed in the program EEGlab and subsequently evaluated using a statistical method ANOVA and paired T -test. To depict results spectral analysis was used.
|
|
|
The Shortest Graph's Pahts Finding
Jágr, Petr ; Ohlídal, Miloš (referee) ; Jaroš, Jiří (advisor)
The aim of this thesis is finding, comparing and implementation of algorithms for finding the shortest paths between each of pairs of nodes in a graph. For this task I use modifications of existing algorithms to achive the lowest time consumption of the computation. Modifications are established on Dijkstra's and Floyd-Warshall's algorithm. We also familiarize with Bellman-Ford algorithm.
|
|
|
Possibilities of Deepening the Theory and Practice of Investment Decisions with an Emphasis on Real Options
Oceláková, Petra ; Valach, Josef (advisor) ; Hrdý, Milan (referee) ; Choulík, Petr (referee)
This dissertation deals with selected areas within capital budgeting theory and practice. The first part is focused on possibilities how to improve traditional financial metrics as net present value and internal rate of return by using graphical tools for their interpretation. The main practical problem can be considered not the methodology itself, but the inability to predict future cash flows correctly. The special attention is paid to depreciation in connection with Czech accounting and tax legislation and its influence on capital decisions. The second part of the dissertation concentrates on real option analysis. The crucial difference between net present value and real options analysis is in how these methods deal with the risk. Mathematical approach is used to derive how the volatility and other parameters affect the theoretical value of an investment determined by real option. The more volatile the future cash flows are the higher theoretical value of the real option should be. Nevertheless, there are some exceptions that are analysed in this paper. In final chapter, total cost of ownership and real option analysis are used to evaluate option to switch from on-premise IT solution to cloud computing.
|
guest ::
