|
|
Deformation, stress and safety analysis of the recumbend frame.
Verner, Jan ; Majer, Zdeněk (referee) ; Vrbka, Jan (advisor)
This work contains deformation, stress and safety analysis of recumbent bike frame from company AZUB. After introduction about history, definition of beam and beam assumptions, computational model of the frame was made fallowed the main solution. Three load states was checked - stillnes / uniform ride, deceleration and pedalling. The third one was subjected to deeper analysis. Bending problem in defined location was solved for all states. Inner stress resultans was solved as Von Misses stress, and the safet y was calculated. The fist state was compared with FEM. A program in MATLAB was made, enabeling calculation of user- selected frame geometry and loading.
|
|
|
Simple Gesture Recognition
Verner, Jan ; Beran, Vítězslav (referee) ; Potúček, Igor (advisor)
This bachelor thesis describes usability of DTW algorithm and it's variants for simple hand gesture detection. It recapitulates actual situation and findings in branch of computer vision and aims on methods for hand gesture recognition and common description of DTW algorithm.
|
|
|
Software Development Processes Metrics
Verner, Jan ; Bartík, Vladimír (referee) ; Kreslíková, Jitka (advisor)
The importance of processes is growing. Processes are integrated into many areas of human work, where they help to organize all activities. This thesis aims on statistical approach to process behavior analysis. There are mentioned the basic process management issues in the beginning of this thesis. The main focus is on the techniques used during process analysis. There are mentioned approaches that are used to easily and effectively assess process behavior using process behavior charts and how to deduce proper steps from the analysis results to improve the process. The last part of this thesis is dedicated to practical analysis of real process behavior data using implemented solution. The results show common usability of statistical methods and approaches to process analysis.
|
|
| |
|
| |
|
|
The continuum function on singular cardinals
Stejskalová, Šárka ; Honzík, Radek (advisor) ; Verner, Jonathan (referee)
Bachelor thesis studies the behaviour of the continuum function on singular cardinals in theory ZFC. The work is divided into two parts. The focus of the first part is on the Silver's Theorem and it analyzes two different proofs of this Theorem, Silver's original proof and the second, purely combinatorial, proof by Baumgartner and Prikry. The second part is devoted to the Singular Cardinal Hypothesis, which influences the behaviour of the continuum function. In the thesis it is shown that, in the presence of large cardinals, Singular Cardinal Hypothesis is not provable in ZFC. Using Easton and Prikry forcing a model is found where the Singular Cardinal Hypothesis does not hold.
|
|
|
The continuum function on regular cardinals in the presence of large cardinals
Blicha, Martin ; Honzík, Radek (advisor) ; Verner, Jonathan (referee)
This thesis examines the interactions between the continuum function and large cardinals. It is know, by a result of Easton, that the continuum function on regular cardinals has great freedom in ZFC. However, large cardinals lay additional constraints to possible behaviour of the continuum function. We focus on weakly compact and measurable cardinal to point out the differences in interactions with the continuum function between various types of large cardinals. We also study the case of indescribable cardinals for the comparison, and the results lead us to conclude that it is not easy to pinpoint the reason for these differences. 1
|
|
|
Machine-Free Characterization of Polynomially Computable Functions
Profeld, Michal ; Švejdar, Vítězslav (advisor) ; Verner, Jonathan (referee)
This work is focused into constructing mathematical structure. This structure is closed under it's operations. Structure was developed to contain all functions of certain growth rate. To be More specific functi- ons with polynomial growth rate. We can say that our structure con- tains all functions that have growth rate slower or equal to polynomial growth rate and no other function. Development of our structure was influenced mostly by work of Samuel R. Buss [1] 1
|
|
|
Koza and Prolog
Frauknecht, Jan ; Švarný, Petr (advisor) ; Verner, Jonathan (referee)
This paper introduces the artificial intelligence background of ge- netic programming and some properties of logical programming para- digm. However, the main task of this work is to create the genetic programming algorithm that operates with the logical programming paradigm. SWI-Prolog is used for the actual implementation of such a program. This implementation is in detail described. The testing of this implementation shows some possible path for the future work. 1
|
|
| |
guest ::
RSS feed.