No description available.

This paper describes and quantifies the differences soil physical properties in rail lines in winter wheat and winter rape. Both crops were grown on adjacent land, which have the same BPEJ. Sampling was conducted once during the growing season and the second time just after the harvest of rape, and just before harvest wheat. In each term sampling, samples were taken at 3 repetitions for each plot. Samples were taken in the track in the space between the rails and the control was between sessions. Both crops are used to process the soil before sowing minimization. The differences are expected to land in one of the same crop, as well as differences between crops. Due to different agrotechnics rape and wheat, where the entrances to rape more mechanization, we expect more consolidation in the tramlines rape.

No description available.

No description available.

No description available.

Škodíková, V. Legal and illegal methods of tax liability minimalization. Diploma thesis. Brno, 2017. The diploma thesis is focused on the topic of legal and illegal ways of minimizing the tax liability of the taxpayer of income tax in the Czech Republic. In the first part of the thesis, an analysis of available literary sources is made. It defines the tax theory, the specifics of taxes in the Czech Republic, the issue of the shadow economy and its measurement and the tax evasion. In the next part of the thesis, the most frequently used ways of minimizing the tax liability are outlined with emphasis on their legality. The thin line between legal and illegal ways is complet-ed by the case law. Another part of the thesis deals with the actual measurement of the size of the shadow economy using Gutmann's monetary method. At the end of the thesis, the most important findings and results are discussed.

When we interpret the input vector of a Boolean function as a binary number, we define interval Boolean function fn [a,b] so that fn [a,b](x) = 1 if and only if a ≤ x ≤ b. Disjunctive normal form is a common way of representing Boolean functions. Minimization of DNF representation of an interval Boolean function can be per- formed in linear time. The natural generalization to k-interval functions seems to be significantly harder to tackle. In this thesis, we discuss the difficulties with finding an optimal solution and introduce a 2k-approximation algorithm.

Suffix tree is a data structure which enables the performing of fast search-like operations on the text. In order to be used efficiently, it must be created quickly. In this thesis, we focus on the new kind of suffix link simulation called "minimized branching", which aims to increase the speed of suffix tree construction by reducing the number of branching operations. Our main goal is to present a comparison of the currently used methods for the suffix tree construction and to point out some advantages and disadvantages of the individual approaches. We introduce, implement and practically evaluate multiple variations of the standard McCreight's and Ukkonen's algorithms, as well as Partition and Write Only Top Down (PWOTD) algorithm, originally developed for disk-based construction. Our main result is the integrated description and implementation of these algorithms, which are both well-suited to be further built upon. We also present a simple recommendations on when it is advisable to use a particular algorithm's variation and why.

This work is dealing with speeding up the algorithmization of the MCD es- timator for detection of the mean and the covariance matrix of a normally dis- tributed multivariate data contaminated with outliers. First, the main idea of the estimator and its well-known aproximation by the FastMCD algorithm is discussed. The main focus was to be placed on possibilities of a speedup of the iteration step known as C-step while maintaining the quality of the estimations. This proved to be problematic, if not impossible. The work is, therefore, aiming at creating a new implementation based on the C-step and Jacobi method for eigenvalues. The proposed JacobiMCD algorithm is compared to the FastMCD in terms of floating operation count and results. In conclusion, JacobiMCD is not found to be fully equivalent to FastMCD but hints at a possibility of its usage on larger problems. The numerical experiments suggest that the computation can indeed be quicker by an order of magnitude, while the quality of results is close to those from FastMCD in some settings. 1

The aim of this Bachelor´s work was to extend the findings from the classical aspect as well as the minimalizing method of soil tillage and suggest the possibilities of successful regulation of weeds on arable land for growing winter wheat. On the experimental field where the soil was processed by classical tillage appear less dangerous weeds, which were destroyed by application of herbicide and their number was minimal. There were mainly dangerous weeds on the experimental field cultivated by minimalizing, like Silky bent grass and Cleavers. Even if the herbicide applications significantly reduced them, there were a few individuals in the experimental plots. In the economic comparison was found that there is not big difference in cost in both variants of tillage, but the conventional method of processing in this case is cheaper. At the soil endangered by erosion would be better to choose the minimalizing method as an appropriate variant of tillage. But it is needed on all soils cultivated by this method choose different depth of tillage, including the use of deep processing undermining or classical plowing.