|
|
Selected Conceptual Deviations, Synonyms, and Homonyms in the Czech Legal System
Minařík, Vojtěch ; Wintr, Jan (advisor) ; Tryzna, Jan (referee)
Selected Conceptual Deviations, Synonyms, and Homonyms in the Czech Legal System Abstract This work addresses selected conceptual deviations, specifically legal terms whose meaning cannot be derived through simple linguistic interpretation. These include terms sharing the same meaning (synonyms), terms having multiple meanings (homonyms), and phrases forming provisions in legal regulations, which, in their entirety, acquire a meaning different from their common understanding in general language. The study focuses on a group of selected concepts, examining and building a theory around their origin and characteristics. The acquired insights are presented coherently, and relevant conceptual deviations, forming the basis for the author's conclusions, are provided as examples for better understanding and clarity of the subject matter. The initial step involves dealing with different theoretical approaches concerning the evaluation of law. A comparison is made between the iusnaturalist perspective, which is highly open to legal evaluation, and the positivist approach, where evaluation is fundamentally irrelevant and is to be understood only in a practical sense as a proposal for changing the interpretation of legal norms. Furthermore, the study establishes criteria for such evaluation, i.e., criteria for...
|
|
|
Polygonal Mesh Segmentation
Minařík, Vojtěch ; Havel, Jiří (referee) ; Španěl, Michal (advisor)
Bachelor's thesis deals with 3D model segmentation into particular meaningful segments. Method is based on algorithm described in article Protrusion-oriented 3D mesh segmentation The realized solution is based on assumption, that 3D models consist of a core and core attached protrusions. The segmentation algorithm consists of three main steps: core approximation, selection of salient points which indicate end of protrusion and assignment of points to appropriate segments. Implementation uses library CGAL which is useful for loading and manipulating 3D meshes.
|
|
|
Application of SAT Solvers in Circuit Optimization Problem
Minařík, Vojtěch ; Mrázek, Vojtěch (referee) ; Vašíček, Zdeněk (advisor)
This thesis is focused on the task of application of SAT problem and it's modifications in area of evolution logic circuit development. This task is supposed to increase speed of evaluating candidate circuits by fitness function in cases where simulation usage fails. Usage of SAT and #SAT problems make evolution of complex circuits with high input number significantly faster. Implemented solution is based on #SAT problem. Two applications were implemented. They differ by the approach to checking outputs of circuit for wrong values. Time complexity of implemented algorithm depends on logical complexity of circuit, because it uses logical formulas and it's satisfiability to evaluate logic circuits.
|
|
|
Application of SAT Solvers in Circuit Optimization Problem
Minařík, Vojtěch ; Mrázek, Vojtěch (referee) ; Vašíček, Zdeněk (advisor)
This thesis is focused on the task of application of SAT problem and it's modifications in area of evolution logic circuit development. This task is supposed to increase speed of evaluating candidate circuits by fitness function in cases where simulation usage fails. Usage of SAT and #SAT problems make evolution of complex circuits with high input number significantly faster. Implemented solution is based on #SAT problem. Two applications were implemented. They differ by the approach to checking outputs of circuit for wrong values. Time complexity of implemented algorithm depends on logical complexity of circuit, because it uses logical formulas and it's satisfiability to evaluate logic circuits.
|
|
|
Polygonal Mesh Segmentation
Minařík, Vojtěch ; Havel, Jiří (referee) ; Španěl, Michal (advisor)
Bachelor's thesis deals with 3D model segmentation into particular meaningful segments. Method is based on algorithm described in article Protrusion-oriented 3D mesh segmentation The realized solution is based on assumption, that 3D models consist of a core and core attached protrusions. The segmentation algorithm consists of three main steps: core approximation, selection of salient points which indicate end of protrusion and assignment of points to appropriate segments. Implementation uses library CGAL which is useful for loading and manipulating 3D meshes.
|
guest ::
RSS feed.