|
| |
|
|
Use of biological feedback during training of postural regulation
Papáček, Roman ; Mužík, Jan (advisor) ; Jiřina, Marcel (referee)
The thesis focuses on the study of the impact of visual stimuli from virtual reality scenes and on influencing and training postural stability in patients after brain damage. It endeavours to inform comprehensively about the substantial facts related to this topic and widen the possibilities of an objective evaluation of postural stability and this eliminate the risk of a subjective mistake made by a physiotherapist. In the course of the work I have used a number of virtual reality scenes through which I measured and evaluated both static and dynamic labour of the tested people with their own centre of mass. The process of positioning was scanned by Wii Balance Board and the data were recorded with the help of a specially designed computer application "Rehabilitation in virtual reality". It was necessary to create two groups of people tested. A group of healthy probands of 50 in number and a group of patients comprising 3 members. In one part, the recorded data represented the figures of centre deflection (in millimetres), and in the other part, the number of points gained during the measuring. The results of both parts were then processed into well-arranged tables which also involve the basic statistic quantities, and they are presented in the form of graphs. In the conclusion, the thesis verifies...
|
|
|
Nearly All Reals Can Be Sorted with Linear Time Complexity
Jiřina, Marcel
We propose a variant of the counting sort modified for sorting reals in a linear time. It is assumed that the sorting key and pointers to the items being sorted are moved and individual items remain at the same place in the memory (in place sorting). In this case, the space complexity of the new variant of the algorithm is the same as the complexity of the quicksort. We also quantify the practical limits for possible sorting reals in a linear time. This possibility is assured under additional assumptions on the distribution of the sorting key, mainly the independence and identity of the distribution. Here we give a more general criteria easily applicable in practice. We also show that the algorithm is applicable for data that do not fulfill criteria for linear time complexity but even that the computation is faster than the system quicksort. A new, faster version of the algorithm is attached.
|
|
|
Sort Program for Real Keys with Linear Time Complexity
Jiřina, Marcel
In this report we present a program for sorting data structures with sorting keys as real numbers, i.e. of type "real" or "float". The basis of the program is a modification of the countingsort algorithm for reals (instead of integers). It uses a comparision-type sorting for small part of data set given. The time complexity of this part of program can be bounded by linear function of n and thus, the total time complexity is also O(n) for n data items.
Plný tet:  PDF
|
|
|
Popis TDD modelu verze 3.9
Novák, Jakub ; Jiřina, M. ; Benešová, Michaela
Zpráva je závěrečnou roční zprávou pro rok 2018 v rámci Projektu TDD-ČR. Cílem je předat metodiky pro užití modelu jak provozovatelem distribuční soustavy, tak operátorem trhu a dále informovat o aktuálním stavu modelu. Jsou popsány předávané soubory včetně vzorového výpočtu na reálných datech a jejich obsah.
|
|
| |
|
| |
|
| |
|
| |
|
| |
guest ::
RSS feed.