|
Height measurement in the northern area of mining areas Doubrava and Karviná Mines In 2016
Kajzar, Vlastimil ; Waclawik, Petr ; Staš, Lubomír
In the northern area of mining areas Doubrava and Karvina mines on the border RA Detmarovice and Doubrava are implemented, the mining activities. For this reason, in order to detect possible effects of the mine to the surface and surface objects twice a year height focuses, points in this area stable. From 2014 he was a contractor for these works chosen by the Institute of Geonics, v.v.i., Ostrava. In August and November 2016 survey conducted campaigns planned this year, during which it conducted a total of 4 highrise focus of inter-related leveling routes, which are formed by these points. Highrise points are stabilized in the area of interest in several ways - usually in steel design height marks on buildings, then as an iron bolt concreted in the ground or using nails driven into the concrete foundation or other alternative means. Distribution points in the area of interest is indicative captured in the map appendix. Existing trace and focus points are highlighted in green, yellow trace inaccessible points, refocused points in red and violet points that have occurred to their long term disablement or destruction. Each zaměřovaných points in order to trace the terrain carefully documented (GPS coordinates, photos, text description) and registered. These documents are available from the contractor.
|
|
Activities and functioning of New web organization
Tyl, Jan ; PROKOP, Petr (advisor) ; SULŽENKO, Jiří (referee)
Abstract
Bachelor thesis Activities and functioning of New Web organisation aims to detailed analysis of this culture network. What paths choose, how fulfills its visions, etc. Describe the formation of the organization, motivations and partial steps, which New web takes for its funcioning. How partial sections of this organism thinks and how cooperate.
Also this thesis deals with organization structure of New web. Collectively write an overview of activities this network. Uncover sources of funding. All in relation with functioning of another culture networks in Europe. Concretely IETM, Trans Europe Halles and IN SITU organizations. In conclusion wants to outline future direction of New web organization.
|
|
Sorption and Stabilization of Metals/Mettalloids by Innovative Synthesized Sorbent Amochar.
Ouředníček, P. ; Trakal, L. ; Komárek, M. ; Pohořelý, Michael
Remediation of contaminated soil which is based on stabilization and immobilization of potential\nhazardous substance by sorption materials has been studied intensively nowadays. Biochar – activated organic carbon belongs to this group of stabilizing agents which can adsorb wide range of contaminants, including metals/metalloids. Surface area of the biochars is quite large in general and functional groups (e.g. COO–) can form chelates or alkaline elements on the surface, which is represented by cation exchange capacity. Altogether with the high pH values (7.00 – 10.00), biochars are quite effective sorbents and can adsorb metals/metalloids from the solution (ground water), especially in acidic soils (in the environments affected by intensive mining activities). Sorption\neffectiveness can be increased (especially for As (V) or Cr (VI) sorption) by modification of biochar by various types of secondary oxides. Innovative sorbent AMOchar (AMO + biochar) has been synthesized currently. The product was prepared by adding of biochar to the reaction solution during amorphous manganese oxide (AMO) synthesis. The AMOchar was formed mainly by Mn-oxalates which had coated surface of the pristine biochar. AMOchar composite was able to remove significantly higher amounts of various metal(loid)s from the solution despite the rather high pH of the material. Sorption effectiveness was high not only in case of Pb (II) sorption (almost 99%), and Cd(II) (51.2%), but also a very high amount of As(V), 91.4%. Additionally, both AMOchar composite was able to reduce Mn leaching. This can avoid potential post-contamination caused by the dissolution of less stable Mn-oxalates as observed in the pure AMO.
Fulltext: content.csg -  PDF
Plný tet: SKMBT_22316111113040 - PDF
|
|
Tenancy spouses and use of the flat spouses in a new arrangement after January 1, 2014
Prantlová, Soňa ; Kadlecová, Eva (advisor) ; Pavla, Pavla (referee)
The thesis is devoted to the topic of tenancy by the spouses, and its use as is specified in the new adaptation of the Civil Code no. 89/2012 Coll. It replaced until functioning Civil Code from the year 1964. The new legislation is specified series of new institutes, whose primary aim is to protect the weaker party, in the case of tenant. The diploma thesis was divided into theoretical and practical part. In the theoretical part, was attention paid to basic concepts which have been defined. There were characterized rights of tenant and landlord, analyzed housing legislation according to the new Civil Code. The practical part was devoted to the interpretation of survey results. There were approached tenants of several apartment buildings in Kralupy nad Vltavou. Based on the findings, were designed some recommendations to raise awareness about the rights and responsibilities of tenants, as well as about the whole issue of housing legally.
|
|
Relational Verification of Programs with Integer Data
Konečný, Filip ; Bouajjani, Ahmed (referee) ; Jančar, Petr (referee) ; Vojnar, Tomáš (advisor)
Tato práce představuje nové metody pro verifikaci programů pracujících s neomezenými celočíslenými proměnnými, konkrétně metody pro analýzu dosažitelnosti a~konečnosti. Většina těchto metod je založena na akceleračních technikách, které počítají tranzitivní uzávěry cyklů programu. V práci je nejprve představen algoritmus pro akceleraci několika tříd celočíselných relací. Tento algoritmus je až o čtyři řády rychlejší než existující techniky. Z teoretického hlediska práce dokazuje, že uvažované třídy relací jsou periodické a~poskytuje tudíž jednotné řešení prolému akcelerace. Práce dále představuje semi-algoritmus pro analýzu dosažitelnosti celočíselných programů, který sleduje relace mezi proměnnými programu a~aplikuje akcelerační techniky za účelem modulárního výpočtu souhrnů procedur. Dále je v práci navržen alternativní algoritmus pro analýzu dosažitelnosti, který integruje predikátovou abstrakci s accelerací s cílem zvýšit pravděpodobnost konvergence výpočtu. Provedené experimenty ukazují, že oba algoritmy lze úspěšně aplikovat k verifikaci programů, na kterých předchozí metody selhávaly. Práce se rovněž zabývá problémem konečnosti běhu programů a~dokazuje, že tento problém je rozhodnutelný pro několik tříd celočíselných relací. Pro některé z těchto tříd relací je v práci navržen algoritmus, který v polynomiálním čase vypočítá množinu všech konfigurací programu, z nichž existuje nekonečný běh. Tento algoritmus je integrován do metody, která analyzuje konečnost běhů celočíselných programů. Efektivnost této metody je demonstrována na několika netriviálních celočíselných programech.
|
|
Grammars with Restricted Derivation Trees
Koutný, Jiří ; Janoušek, Jan (referee) ; Vojnar, Tomáš (referee) ; Meduna, Alexandr (advisor)
V této disertační práci jsou studovány teoretické vlastnosti gramatik s omezenými derivačními stromy. Po uvedení současného stavu poznání v této oblasti je výzkum zaměřen na tři základní typy omezení derivačních stromů. Nejprve je představeno zcela nové téma, které je založeno na omezení řezů a je zkoumána vyjadřovací síla takto omezené gramatiky. Poté je zkoumáno několik nových vlastností omezení kladeného na cestu derivačních stromů. Zejména je studován vliv vymazávacích pravidel na vyjadřovací sílu gramatik s omezenou cestou a pro tyto gramatiky jsou zavedeny dvě normální formy. Následně je popsána nová souvislost mezi gramatikami s omezenou cestou a některými pseudouzly. Dále je prezentován protiargument k vyjadřovací síle tohoto modelu, která byla dosud považována za dobře známou vlastnost. Nakonec je zavedeno zobecnění modelu s omezenou cestou na ne jednu, ale několik cest. Tento model je následně studován zejména z hlediska vlastností vkládání, uzávěrových vlastností a vlastností syntaktické analýzy.
|
|
Test Application Methodology Based On the Identification of Testable blocks
Herrman, Tomáš ; Plíva, Zdeněk (referee) ; Racek, Stanislav (referee) ; Kotásek, Zdeněk (advisor)
The PhD thesis deals with the analysis of digital systems described on RT level. The methodology of data paths analysis is decribed, the data path controller analysis is not solved in the thesis. The methodology is built on the concept of Testable Block (TB) which allows to divide digital component to such segments which can be tested through their inputs/outputs, border registers and primary inputs/outputs are used for this purpose. As a result, lower number of registers is needed to be included into scan chain - border registers are the only ones which are scanned. The segmentation allows also to reduce the volume of test vectors, tests are generated for segments, not for the complete component. To identify TBs, two evolutionary algorithms are used, they operate on TB formal model which is also defined in the thesis.
|
|
Methodology of highly reliable systems design
Straka, Martin ; Gramatová, Elena (referee) ; Racek, Stanislav (referee) ; Kotásek, Zdeněk (advisor)
In the thesis, a methodology alternative to existing methods of digital systems design with increased dependability implemented into FPGA is presented, new features which can be used in the implementation and testing of these systems are demonstrated. The research is based on the use of FPGA partial dynamic reconfiguration for the design of fault tolerant systems. In these applications, the partial dynamic reconfiguration can be used as a mechanism to correct the fault and recover the system after the fault occurrence. First, the general principles of diagnostics, testing and digital systems dependability are presented including a brief description of FPGA components and their architectures. Next, a survey of currently used methods and techniques used for the design and implementation of fault tolerant systems into FPGA is described, especially the methods used for fault detection and localization, their correction, together with the principles of evaluating fault tolerant systems design quality. The most important part of the thesis is seen in the description of the design methodology, implementation and testing of fault tolerant systems implemented into FPGAs which uses SRAMs as the configuration memory. First, the methodology of developing and automated checker components design for digital systems and communication protocols is presented. Then, a reference architecture of a dependable system implemented into FPGA is demonstrated including several fault tolerant architectures based on the use of partial dynamic reconfiguration as the mechanism of fault correction and the recovery from it. The principles of controlling the reconfiguration process are described together with the description of the test platform which allows to test and verify the design of fault tolerant systems based on the methodology presented in the thesis. The experimental results and the contribution of the thesis are discussed in the conclusions.
|
|
Methodology of highly reliable systems design
Straka, Martin ; Kotásek, Zdeněk (advisor)
In the thesis, a methodology alternative to existing methods of digital systems design with increased dependability implemented into FPGA is presented, new features which can be used in the implementation and testing of these systems are demonstrated. The research is based on the use of FPGA partial dynamic reconfiguration for the design of fault tolerant systems. In these applications, the partial dynamic reconfiguration can be used as a mechanism to correct the fault and recover the system after the fault occurrence. First, the general principles of diagnostics, testing and digital systems dependability are presented including a brief description of FPGA components and their architectures. Next, a survey of currently used methods and techniques used for the design and implementation of fault tolerant systems into FPGA is described, especially the methods used for fault detection and localization, their correction, together with the principles of evaluating fault tolerant systems design quality. The most important part of the thesis is seen in the description of the design methodology, implementation and testing of fault tolerant systems implemented into FPGAs which uses SRAMs as the configuration memory. First, the methodology of developing and automated checker components design for digital systems and communication protocols is presented. Then, a reference architecture of a dependable system implemented into FPGA is demonstrated including several fault tolerant architectures based on the use of partial dynamic reconfiguration as the mechanism of fault correction and the recovery from it. The principles of controlling the reconfiguration process are described together with the description of the test platform which allows to test and verify the design of fault tolerant systems based on the methodology presented in the thesis. The experimental results and the contribution of the thesis are discussed in the conclusions.
|
|
Optimization of network flow monitoring
Žádník, Martin ; Lhotka,, Ladislav (referee) ; Matoušek, Radomil (referee) ; Sekanina, Lukáš (advisor)
The thesis deals with optimization of network flow monitoring. Flow-based network traffic processing, that is, processing packets based on some state information associated to the flows which the packets belong to, is a key enabler for a variety of network services and applications. The number of simultaneous flows increases with the growing number of new services and applications. It has become a challenge to keep a state per each flow in a network device processing high speed traffic. A flow table, a structure with flow states, must be stored in a memory hierarchy. The memory closest to the processing is known as a flow cache. Flow cache management plays an important role in terms of its effective utilization, which affects the performance of the whole system. This thesis focuses on an automated design of cache replacement policy optimized to a deployment on particular networks. A genetic algorithm is proposed to automate this process. The genetic algorithm generates and evaluates evolved replacement policies by a simulation on obtained traffic traces. The proposed algorithm is evaluated by designing replacement policies for two variations of the cache management problem. The first variation is an evolution of the replacement policy with an overall low number of state evictions from the flow cache. The second variation represents an evolution of the replacement policy with a low number of evictions belonging to large flows only. Optimized replacement policies for both variations are found while experimenting with various encoding of the replacement policy and genetic operators. The newly evolved replacement policies achieve better results than other tested policies. The evolved replacement policy lowers the overall amount of evictions by ten percent in comparison with the best compared policy. The evolved replacement policy focusing on large flows lowers the amount of their evictions two times. Moreover, no eviction occurs for most of the large flows (over 90%). The evolved replacement policy offers better resilience against flooding the flow cache with large amount of short flows which are typical side effects of scanning or distributed denial of service activities. An extension of the replacement policy is also proposed. The extension complements the replacement policy with an additional information extracted from packet headers. The results show further decrease in the number of evictions when the extension is used.
|
guest ::
