|
| |
|
|
Software for cameras configuration design of the panoramic system
Jílek, Michal ; Grenar, David (referee) ; Kříž, Petr (advisor)
This work deals with software design in C ++ language and with graphical output using OpenGL for scanning tribune lenses of cameras with different parameters so that the user lens configurations are known beforehand in order to create panoramic coverage of the stadium stadium. The principle of image capture, lens parameters, and formulas for calculating their appropriate layout on the stadium to collect a panoramic image together is discussed. These are: focal length, viewing angles, coverage calculations, image resolution. Furthermore, a draft program implementing the issue.
|
|
| |
|
|
The EU response to the development in Belarus in 2021: the human rights scope
Kotielnikova, Olha ; Kolenovská, Daniela (advisor) ; Góra, Magdalena (referee)
European Politics and Society: Václav Havel Joint Master Programme Charles University The EU response to the development in Belarus in 2021: the human rights scope Master's Thesis Abstract Author: Olha Kotielnikova Supervisor: Mgr. Daniela Kolenovská, Ph.D. Year of defence: 2022 Length of the thesis: 18892 words Abstract Human rights abuse in Belarus has again become a topical issue on the European Union's agenda alongside political rights violations since 2020. The Union sees its role in influencing the internal policy of the proclaimed Belarusian government for it to start respecting human rights. As a united body, it has instruments to exercise its foreign policy instruments, such as restrictive measures, negotiations, and communication. The dynamics of their usage have been changing, but there is still potential to review and adapt possible European responses. Keywords European Union, Belarus, foreign policy, human rights, human rights defence, resolution, sanctions, restrictive measures.
|
|
|
Bank recovery and resolution
Půlpánová, Karolína ; Vybíral, Roman (referee)
Bank Recovery and Resolution Abstract and keywords This diploma thesis systematically presents the European regulatory framework of recovery procedures and resolution of credit institutions and investment firms (BRRD), in the form of a directive, implemented into the Czech law in Act No. 374/2015 Coll., on recovery procedures and resolution on the financial markets. At the same time, the first major amendment to this directive, the so-called BRRD2, is incorporated into this thesis, which mainly implements the international standard of FSB for the specification of the total loss absorbing capacity into the EU law. The work is divided into 5 parts. The first part monitors the background of the BRRD, discusses the causes of the Global Financial Crisis, and what we deduce from them, and then discusses the global regulatory response to this crisis. The second chapter places the BRRD in a broader context within the Banking Union and presents its structure. The Banking Union is built on a single set of rules and is divided into two (in the future three) pillars. These are a single supervisory mechanism and a single resolution mechanism. The third part is where the introduction of the legislation itself begins; it starts with providing the information for the general requirements of the procedures under this...
|
|
|
SMV-2021-43: Electron Optical Systems Design and Simulations
Radlička, Tomáš
The contractual research covered several feasibility studies in the field of electron-optical design and simulations. We studied several electron-optical systems, including calculating the electron-optical properties, optimizing the design, and possible integration into the primary beam column. The contractual research also covered development of software packages for the electron optical design and their integration to the Julia language environment.
|
|
|
DPLL algorithm and propositional proofs
Hrnčiar, Maroš ; Krajíček, Jan (advisor) ; Koucký, Michal (referee)
Proof complexity is an interesting mathematical part connecting logic and complexity theory. It investigates which proof systems are needed for effective theorem proving. The aim of this paper is to present a relation between propositional proof systems and SAT algorithms. We will see that a run of an algorithm on the unrealizable formula can be seen as a propositional proof of its unsatisfiability, so the algorithm practically defines whole proof system. The thesis is mainly recommended for readers interested in proof complexity, but it can also independently illustrate a resolution principle and perhaps show some less common view of SAT assuming reader's basic knowledge of propositional logic, graph theory and complexity.
|
|
|
Implementation of the mandate of the UNPROFOR mission in Bosnia and Herzegovina between 1992-1995
Lalić, Jan ; Tejchman, Miroslav (advisor) ; Pikal, Kamil (referee)
The unwillingness of the international community to become involved militarily in Bosnian civil war between 1992-1995, made the United Nations Protection Force (UNPROFOR) a substitute for a decisive action. The absence of any foreseeable prospect of truce, which would have been supported by the presence of peacekeepers, led to the establishment of strictly humanitarian mandate for UN troops in the first phase of the war. They were supposed, in cooperation with the United Nations High Commisioner for Refugees (UNHCR), to secure functioning of the Sarajevo airport for humanitarian relief purposes and subsequently provide security for the UNHCR and its convoys providing humanitarian relief. Thesis "Implementation of the mandate of the UNPROFOR mission in Bosnia and Herzegovina between 1992-1995" deals with issues concerning humanitarian mandate in particular. This thesis aims to explain, through descriptive analysis, motives leading international community to deploy lightely armed peacekeeprs with uncharacteristic mandate to the region, which is absolutely inadequate for peacekeeping operations as I will show. It will subsequently analyze course of the implementation and problems, which were encountered by UN troops. The aim of this thesis is to prove, that UNPROFOR was not absolute failure as it is perceived,...
|
|
|
Finding Minimum Satisfying Assignments of Boolean Formulas
Švancara, Jiří ; Balyo, Tomáš (advisor) ; Trunda, Otakar (referee)
In this thesis we examine algorithms and techniques used for solving Boolean satisfiability (SAT). Then we inspect the possibility to use them in solving the weighted short SAT problem, which is a generalization of the satisfiability problem. Given that each variable has a weight, this generalization is the problem of finding a satisfying truth assignment while using the smallest sum of weights. To solve this problem, we introduce three truth assignments of variables - True, False and Unassign. We show that not all algorithms and techniques used in modern SAT solvers can be used in our program. Those that can be converted, will be implemented using our three truth assignments. This will yield several versions of our new solver, which will be compared. Powered by TCPDF (www.tcpdf.org)
|
|
|
Operadic resolutions of diagrams
Doubek, Martin ; Markl, Martin (advisor) ; Somberg, Petr (referee) ; Čadek, Martin (referee)
of the Doctoral Thesis Operadic Resolutions of Diagrams by Martin Doubek We study resolutions of the operad AC describing diagrams of a given shape C in the category of algebras of a given type A. We prove the conjecture by Markl on constructing the resolution out of resolutions of A and C, at least in a certain restricted setting. For associative algebras, we make explicit the cohomology theory for the diagrams and recover Gerstenhaber-Schack diagram cohomology. In general, we show that the operadic cohomology is Ext in the category of operadic modules. 1
|
guest ::
