Atualmente, existe uma tendência entre os projetistas brasileiros de valorizar a etapa de tratamento preliminar em projetos de novas estações de tratamento de esgoto (ETE). Neste ensejo foi concebido, construído e estudado um protótipo, em escala plena, de uma unidade composta de separador hidrodinâmico por vórtice (SHV) – empregado como desarenador – e grade fina cilíndrica de fluxo tangencial. Estudos acerca da hidrodinâmica da unidade, fundamentados em ensaios de estímulo-resposta com traçador (sal de cozinha) e simulações computacionais do padrão de escoamento em software de dinâmica dos fluidos computacional, demonstrou que ao se operar a unidade com taxas de aplicação superficial (TAS) de 764 'M POT.3'/'M POT.2'd; 1.146 'M POT.3'/'M POT.2'd e 1.528 'M POT.3'/'M POT.2'd o regime de macro-mistura do padrão de escoamento que se desenvolve no SHV aproximou-se do plug-flow, porém com certo grau de mistura que diminuiu com o aumento da TAS. Nesta pesquisa, foram desenvolvidos dois métodos um para determinação da concentração de areia no esgoto sanitário e outro para determinação da distribuição granulométrica dos grãos dessa areia. Ambos foram empregados na avaliação de desempenho da unidade de tratamento preliminar desenvolvida, que foi realizada na estação elevatória de ETE Jardim das Flores do município de Rio Claro, SP. Durante esta fase da pesquisa, o SHV demonstrou enorme potencialidade na remoção de areia para as TAS de 764 'M POT.3'/'M POT.2'd; 1.146 'M POT.3'/'M POT.2'd e 1.528 'M POT.3'/'M POT.2'd, porquanto, além de não remover significativamente matéria orgânica particulada (medida em termos de concentração de sólidos suspensos voláteis) presentes no esgoto sanitário, a unidade atingiu eficiências de remoção de grãos de areia de tamanho maior ou igual a 200 'mü'm entre 85% e 95%. Entretanto, a grade fina cilíndrica de fluxo tangencial (auto-limpante) revelou-se inviável. / Currently, there is a trend among the brazilian designers of valorizing the preliminary treatment in recently designed wastewater treatment plants (WWTP). In this context, a full scale prototype of a unit made up of a hydrodynamic vortex separator (HVS) – applied as a degritter – and a tangential flux fine screening was designed, built and evaluated. Research about the hydrodynamic of the prototype, based on stimulus-response essays with a salt tracer (sodium chloride) and computational simulations of the flow pattern using the computational fluid dynamic (CFD) software, showed that the macro mixture regime of the flow was similar to a plug-flow when the unit was operated with superficial loading rates (SLR) of 746 'M POT.3'/'M POT.2'd; 1.146 'M POT.3'/'M POT.2'd and 1.528 'M POT.3'/'M POT.2'd, however, the flow presented a certain mixture degree that reduced with the SLR increase. In this research, two methods were developed: one for the determination of grit concentration in sewage and another one for the assessment of grit grading. Both methods were used on the evaluation of the HVS prototype efficiency, which was carried out at Jardim das Flores WWT, in the city of Rio Claro, SP. During this phase of the research, the HVS presented a great potential for grit removal when the SLR of 746 'M POT.3'/'M POT.2'd; 1.146 'M POT.3'/'M POT.2'd and 1.528 'M POT.3'/'M POT.2'd were applied; for the reason that, besides not significantly removing the particulate organic matter present in sewage (measured as volatile suspended solids), the unit achieved grit removal efficiencies in the range of 85% to 95% for grit equal to or large than 200 'mü'm. However, the tangential flux cylindrical fine screening (self cleaning) did not reveal feasibility.

The diploma thesis deals with the problems of sanitation installation in a multifunctional building in Třinec. The theoretical part focuses on the analysis of the topic, with emphasis on the draining and cleaning of waste water. The thesis also focuses on possible solutions given specialization. The project solves the sanitation installation of the multifunctional building in the selected variant. It is a multistorey building where are supermarket, shop, pharmacy, cafe, public toilets, fitness center and commercial space.

This diploma thesis solves creating of the layout study and creation of documentation for the realization of a new fire station. In the building, the location of the JPO I rescue units is considered. The territorial jurisdiction is usually considered to be within 20 minutes of dislocation. The category of the fire station will be considered as P1. The object consists of two structurally and functionally different parts. The first part is designed as a one-storey reinforced concrete skeleton roofed with pre-stressed ceiling panels. This section includes technical background and garages. The cladding of the skeletal part of the building is solved by a masonry block made of lime-sand blocks with external thermal insulation composite system. The second part is walled from lime-sand blocks with external thermal insulation composite system. There are spaces of administrative and operational character. This section has two above-ground floors. The ground plan is fractured, the maximum dimensions are 45.59 x 28.34 m. The building has no basement, roofed only with flat roofs. The object is situated in the peripheral locality of Příbor, the terrain is slightly sloping.

This diploma thesis treats the possibilities of the black-white picture depiction in pseudo colors (Pseudocolor). The individual methods, software or hardware are described there and the detailed block scheme of the system Pseudocolor is suggested. The block scheme is created on the basis of gained theoretical knowledge. In the thesis, individual functional blocks of the scheme are described and their circuit designs are realized. Some of the functional blocks are simulated by the PSpice program and accompanied by corresponding signal process data. The suitable choice of the active and passive components is performed, from which the general integration of the system Pseudocolor is made. All the source materials for the realization of the device are given there – double-sided drawing of the printed circuit, layout and specification of the components.

Presented work investigates the problem of secondary lithium-ion cells and the different available cathode materials. We have prepared samples of LiFePO4 with the addition of different kinds of carbon materials such as Super P, Vulcan and expanded graphite. We have always created the sample with and without surfactant. Developed samples were compared by measuring electrochemical methods (cyclic voltammetry, charge and discharge cycles and impedance spectroscopy). We also modeled the three-point cell for measuring electrochemical electrode materials.

<p>Future long-duration space missions will take humans farther from the support resources of Earth than ever before. These missions will require microgravity surgical technologies in the case of an emergency that necessitates medical intervention. This experiment integrated three different surgical technologies for testing in weightlessness on parabolic flights: a surgical containment dome, a multi-function surgical wand, and a microgravity blood-air separator. Two fluid loops were utilized: one in which the surgical wand, containment dome, and a wound model were used to provide a realistic mixture of blood simulant and air to the blood-air separator. The other fluid loop used prescribed mixture ratios of air and blood to test the performance of the separator under varying conditions. The results of this experiment showed that the multi-functional surgical tool and dome functioned as designed. In addition, each separator successfully separated the blood and air from the mixture, allowing for future blood transfusion. With this demonstration, each system used in this experiment qualifies as technology readiness level 6. Advancing the technology readiness level of these technologies further will require long duration zero-g testing on-orbit before inclusion in authentic space mission emergency surgical strategy. </p>

This thesis focuses mainly on the Maximum Independent Set (MIS) problem. Some related graph theoretical combinatorial problems are also considered. As these problems are generally NP-hard, we study their complexity in hereditary graph classes, i.e. graph classes defined by a set F of forbidden induced subgraphs. We revise the literature about the issue, for example complexity results, applications, and techniques tackling the problem. Through considering some general approach, we exhibit several cases where the problem admits a polynomial-time solution. More specifically, we present polynomial-time algorithms for the MIS problem in: + some subclasses of $S_{2;j;k}$-free graphs (thus generalizing the classical result for $S_{1;2;k}$-free graphs); + some subclasses of $tree_{k}$-free graphs (thus generalizing the classical results for subclasses of P5-free graphs); + some subclasses of $P_{7}$-free graphs and $S_{2;2;2}$-free graphs; and various subclasses of graphs of bounded maximum degree, for example subcubic graphs. Our algorithms are based on various approaches. In particular, we characterize augmenting graphs in a subclass of $S_{2;k;k}$-free graphs and a subclass of $S_{2;2;5}$-free graphs. These characterizations are partly based on extensions of the concept of redundant set [125]. We also propose methods finding augmenting chains, an extension of the method in [99], and finding augmenting trees, an extension of the methods in [125]. We apply the augmenting vertex technique, originally used for $P_{5}$-free graphs or banner-free graphs, for some more general graph classes. We consider a general graph theoretical combinatorial problem, the so-called Maximum -Set problem. Two special cases of this problem, the so-called Maximum F-(Strongly) Independent Subgraph and Maximum F-Induced Subgraph, where F is a connected graph set, are considered. The complexity of the Maximum F-(Strongly) Independent Subgraph problem is revised and the NP-hardness of the Maximum F-Induced Subgraph problem is proved. We also extend the augmenting approach to apply it for the general Maximum Π -Set problem. We revise on classical graph transformations and give two unified views based on pseudo-boolean functions and αff-redundant vertex. We also make extensive uses of α-redundant vertices, originally mainly used for $P_{5}$-free graphs, to give polynomial solutions for some subclasses of $S_{2;2;2}$-free graphs and $tree_{k}$-free graphs. We consider some classical sequential greedy heuristic methods. We also combine classical algorithms with αff-redundant vertices to have new strategies of choosing the next vertex in greedy methods. Some aspects of the algorithms, for example forbidden induced subgraph sets and worst case results, are also considered. Finally, we restrict our attention on graphs of bounded maximum degree and subcubic graphs. Then by using some techniques, for example ff-redundant vertex, clique separator, and arguments based on distance, we general these results for some subclasses of $S_{i;j;k}$-free subcubic graphs.

The diplomma thesis is dealing with possibilities of Signal to noise ratio measurement by method, which is based on direct measurement. It is chosen the most suitable method – signal and noise separation to two different parallel signal branches, where is measured signal strength in one branch and root mean square value in the other. The thesis is consisted of a concept of detail block scheme of Signal to noise ratio meter, which was designed in terms of theoretical knowledge. Particular functional blocks were circuit-designed, the active and passive parts were chosen and their function were described. There were made simulation and displayed input and output time flows. There is designed the whole connection of engineered Signal to noise ratio meter in the last part of my thesis. The double-sided board of printed circuit is contained too. It was created simple programme for supervisor micro-processor. Thereby were constructed complete bases for realization.

This thesis focuses mainly on the Maximum Independent Set (MIS) problem. Some related graph theoretical combinatorial problems are also considered. As these problems are generally NP-hard, we study their complexity in hereditary graph classes, i.e. graph classes defined by a set F of forbidden induced subgraphs. We revise the literature about the issue, for example complexity results, applications, and techniques tackling the problem. Through considering some general approach, we exhibit several cases where the problem admits a polynomial-time solution. More specifically, we present polynomial-time algorithms for the MIS problem in: + some subclasses of $S_{2;j;k}$-free graphs (thus generalizing the classical result for $S_{1;2;k}$-free graphs); + some subclasses of $tree_{k}$-free graphs (thus generalizing the classical results for subclasses of P5-free graphs); + some subclasses of $P_{7}$-free graphs and $S_{2;2;2}$-free graphs; and various subclasses of graphs of bounded maximum degree, for example subcubic graphs. Our algorithms are based on various approaches. In particular, we characterize augmenting graphs in a subclass of $S_{2;k;k}$-free graphs and a subclass of $S_{2;2;5}$-free graphs. These characterizations are partly based on extensions of the concept of redundant set [125]. We also propose methods finding augmenting chains, an extension of the method in [99], and finding augmenting trees, an extension of the methods in [125]. We apply the augmenting vertex technique, originally used for $P_{5}$-free graphs or banner-free graphs, for some more general graph classes. We consider a general graph theoretical combinatorial problem, the so-called Maximum -Set problem. Two special cases of this problem, the so-called Maximum F-(Strongly) Independent Subgraph and Maximum F-Induced Subgraph, where F is a connected graph set, are considered. The complexity of the Maximum F-(Strongly) Independent Subgraph problem is revised and the NP-hardness of the Maximum F-Induced Subgraph problem is proved. We also extend the augmenting approach to apply it for the general Maximum Π -Set problem. We revise on classical graph transformations and give two unified views based on pseudo-boolean functions and αff-redundant vertex. We also make extensive uses of α-redundant vertices, originally mainly used for $P_{5}$-free graphs, to give polynomial solutions for some subclasses of $S_{2;2;2}$-free graphs and $tree_{k}$-free graphs. We consider some classical sequential greedy heuristic methods. We also combine classical algorithms with αff-redundant vertices to have new strategies of choosing the next vertex in greedy methods. Some aspects of the algorithms, for example forbidden induced subgraph sets and worst case results, are also considered. Finally, we restrict our attention on graphs of bounded maximum degree and subcubic graphs. Then by using some techniques, for example ff-redundant vertex, clique separator, and arguments based on distance, we general these results for some subclasses of $S_{i;j;k}$-free subcubic graphs.

Three mathematical models, two of primary alkaline battery cathode discharge, and one of primary alkaline battery discharge, are developed, presented, solved and investigated in this thesis. The primary aim of this work is to improve our understanding of the complex, interrelated and nonlinear processes that occur within primary alkaline batteries during discharge. We use perturbation techniques and Laplace transforms to analyse and simplify an existing model of primary alkaline battery cathode under galvanostatic discharge. The process highlights key phenomena, and removes those phenomena that have very little effect on discharge from the model. We find that electrolyte variation within Electrolytic Manganese Dioxide (EMD) particles is negligible, but proton diffusion within EMD crystals is important. The simplification process results in a significant reduction in the number of model equations, and greatly decreases the computational overhead of the numerical simulation software. In addition, the model results based on this simplified framework compare well with available experimental data. The second model of the primary alkaline battery cathode discharge simulates step potential electrochemical spectroscopy discharges, and is used to improve our understanding of the multi-reaction nature of the reduction of EMD. We find that a single-reaction framework is able to simulate multi-reaction behaviour through the use of a nonlinear ion-ion interaction term. The third model simulates the full primary alkaline battery system, and accounts for the precipitation of zinc oxide within the separator (and other regions), and subsequent internal short circuit through this phase. It was found that an internal short circuit is created at the beginning of discharge, and this self-discharge may be exacerbated by discharging the cell intermittently. We find that using a thicker separator paper is a very effective way of minimising self-discharge behaviour. The equations describing the three models are solved numerically in MATLABR, using three pieces of numerical simulation software. They provide a flexible and powerful set of primary alkaline battery discharge prediction tools, that leverage the simplified model framework, allowing them to be easily run on a desktop PC.