|
|
Walks in time-dymanic graph model
Beliš, Marek ; Pangrác, Ondřej (advisor) ; Hric, Jan (referee)
Orienteering with moving control points can be represented as a graph model with ranked vertices and oriented edges. The rank of vertex depends on the actual time. Searching for the most optimised walk through this graph is NP-complete problem which can be in real-time solved only with limiting conditions and using of heuristics. SMIK solver software provides implemented heuristics for searching the best walk in several ways. In the thesis we can find description of the problem and algorithms, programming documentation with description of used methods and comparation of results to the real competition. Powered by TCPDF (www.tcpdf.org)
|
|
|
Selective complexation of transition metals ions
Beliš, Marek ; Kotek, Jan (advisor) ; Vojtíšek, Pavel (referee)
Copper radionuclides possess physical properties suitable for utilization in nuclear medicine. Important part of their preparation is separation from mother elements, usually zinc or nickel. Currently used methods of separation have their limits, what opens field for finding new ways. One part of the Thesis contains preparation of simple ion exchangers and their selectivity study. The other part of the Thesis is dedicated to optimization of synthetic steps leading to new bifunctional ligands in suitable form for binding to macromolecular carriers and preparation of new set of exchangers.
|
|
|
Walks in time-dymanic graph model
Beliš, Marek ; Pangrác, Ondřej (advisor) ; Hric, Jan (referee)
Orienteering with moving control points can be represented as a graph model with ranked vertices and oriented edges. The rank of vertex depends on the actual time. Searching for the most optimised walk through this graph is NP-complete problem which can be in real-time solved only with limiting conditions and using of heuristics. SMIK solver software provides implemented heuristics for searching the best walk in several ways. In the thesis we can find description of the problem and algorithms, programming documentation with description of used methods and comparation of results to the real competition. Powered by TCPDF (www.tcpdf.org)
|
|
|
Design and synthesis of ligands for selective copper(II) separation
Beliš, Marek ; Kotek, Jan (advisor) ; Smrček, Stanislav (referee)
Radioisotopes of copper are used in nuclear medicine for their physical properties. One step in process of preparing copper-containing radiopharmaceuticals is separation of copper radionuclides from other elements, especially zinc and nickel. The target of this Thesis is preparation of ligands based on linear tetraamine skeleton, which should be able of selective complexation and decomplexation of copper depending on pH of the solution. The Thesis contains synthesis of ligands, their NMR study and measurement of dissociation kinetics of their Cu-complexes. Powered by TCPDF (www.tcpdf.org)
|
|
|
Walks in time-dymanic graph model
Beliš, Marek ; Pangrác, Ondřej (advisor) ; Böhm, Martin (referee)
Orienteering with moving control points can be represented as a graph model with ranked vertices and oriented edges. The rank of vertex depends on the actual time. Searching for the most optimised walk through this graph is exponentially difficult problem which can be in real-time solved only with limiting conditions and using of heuristics. SMIK solver software provides implemented heuristics for searching the best walk in several ways. In the thesis we can find description of the problem and algorithms, programming documentation with description of used methods and comparation of results to the real competition. Powered by TCPDF (www.tcpdf.org)
|
|
|
Walks in time-dymanic graph model
Beliš, Marek ; Pangrác, Ondřej (advisor) ; Böhm, Martin (referee)
Orienteering with moving control points can be represented as a graph model with ranked vertices and oriented edges. The rank of vertex depends on the actual time. Searching for the most optimised walk through this graph is exponentially difficult problem which can be in real-time solved only with limiting conditions and using of heuristics. SMIK solver software provides implemented heuristics for searching the best walk in several ways. In the thesis we can find description of the problem and algorithms, programming documentation with description of used methods and comparation of results to the real competition. Powered by TCPDF (www.tcpdf.org)
|
guest ::
