The main goal of this thesis called Energy Management in Public Sector is to analyze the current state of the facilities and premises of Prostějov municipality with the emphasis on power and gas supplies and the prospective changes in energy consumption. The first part of the thesis focuses on defining energy management, the role of energy manager, renewable and non-renewable energy sources, and relevant Czech and European legislation. Furthermore, it covers the strategic documents pertaining to energy management such as state energy policy, energy audits and energy performance certificates. The second part represents the practical part which is devoted to the implementation of energy management and introduction of energy management software for controlling, measuring and evaluating consumption levels, and attempts to find cheaper power and gas supplies. The data collected in the practical part of the thesis serve as a basis for a proposal ensuring power savings and convenient supplies for facilities operated or funded by Prostějov municipality.

The theme of this thesis is Works for wind quintet and associated instrument. The work professionally analyzes works by internationally known authors. Their works became the best-known and most-played compositions of the chamber repertoire, not only for wind instruments. The thesis also includes a comparison of works of the same instrumentation and a playlist for wind quintet and associated instrument.

Carotenoids are an extensive group of natural pigments employed by a majority of organisms on earth. They are present in most organisms, including humans, but can be synthesized only by plants and microorganisms. They perform two major roles in photosynthesis, often in partnership with the more prevalent chlorophylls (Chls) / bacteriochlorophylls (BChls): light-harvesting and photoprotection. Carotenoids absorb radiation in a spectral region inaccessible to Chls and BChls and transfer the absorbed energy to (B)Chls which, in turn, funnel it into the photosynthetic reaction center (RC). It is determined that the structures and dynamics of excited states of carotenoids found in photosynthetic proteins provide an explanation of their roles as light-harvesting and photoprotective agents. The conjugation length and the type of carotenoids play a big part in understanding the energy transfer from carotenoids to Chls and BChls, because excited-state properties of carotenoids are affected by number of conjugated C=C bonds and their structures. An accurate description of these states is, therefore, the crucial first step in explaining carotenoid photochemistry and understanding the interactions between carotenoids and other molecules in photobiological processes. The research in this thesis, femtosecond ultrafast transient absorption spectroscopy was used to study the light-harvesting function of carotenoids both in solvent and protein environment. The findings were supported with computational methods. Based on spectroscopic indications, the light-harvesting function of carotenoids has a bearing on their structures, and specific light-harvesting strategies are explicitly dependent with the structure of the light-harvesting complexes.

Diploma thesis deals with American music and 20th century American flute music. In firs chapter reveals development of American music, second chapter reveals chosen American composers and their pieces for flutee and third chapter reveals list of American pieces for flute.

This thesis handles with contemporary literature for solo double bass as well as chamber ensembles with double bass, influenced by eastern cultures. It deals with masterpieces of european and asian componists, especially with Giacinto Scelsi’s life, his double bass pieces and also the duet for the violin and the double bass Together composed by Isang Yun. It searches for relationships among traditional music of different cultures and contemporary classical music. In this thesis you can find informations about interpretation techniques used in contemporary music and about innovators of the double bass playing techniques. As the information sources are used available books and catalogues, web pages, music recordings, as well as interview with the double bassist Joëlle Léandre.

The thesis discusses the issue of roads designated for non-motorized traffic with respect to their structural and technical solutions and the effect on road safety. The first part focuses on the analysis of unpowered transport infrastructure and legislative innovations in cycling. The practical part analyzes the evolution of accidents among cyclists, compares the theoretical requirements for the creation of infrastructure and practice. More specifically focuses on infrastructure planning and creation of project documentation. Part of it's own tender evaluation and project documentation paths for pedestrians and cyclists, the design of measures aimed at increasing the safety of road users and the quality of the project.

The aim of this dissertation thesis is to describe contemporary Czech music written for a children's choir from several aspects. The first part deals with the definition of the phenomenon of children's choir, its specifics, sound characteristics and the like. The second, more extensive, analyzes selected aspects of the compositions of Czech composers in the last seven decades written for children's choir, with regard to their form, style, compositional procedures and techniques, conception of dissonance and consonance, and others. The goal of this work was not only analytically show the current state of Czech compositions for children's choir, but also to outline and perhaps encourage its further development.

A socialização e a educação contribuem na formação dos indivíduos e favorecem o desenvolvimento do julgamento moral pró-social. Tal enunciado tem sido apresentado por estudos realizados com indivíduos de nível sócio-econômico médio em países desenvolvidos. O desenvolvimento do julgamento moral pró-social de indivíduosde nível sócio-econômico baixo e de países subdesenvolvidos ainda precisa ser investigada. Portanto, este estudo tem como objetivos: (a) investigar o julgamento moral pró-social de indivíduos que vivem nas ruas e não frequentam escolas comparando-os com indivíduos de nível sócio-econômico baixo, que frequentam escolas; (b) investigar os índices de ajuda diferencial dos indivíduos entre os potenciais receptores de ajuda. Quarenta meninos(as) de rua e 40 meninos(as) de escolas da Rede Municipal, de 9-12 e 13-16 anos de idade, metade de cada gênero, foram submetidos, individualmente, à Entrevista de Julgamento Moral Pró-social de Eisenberg. Algumas questões adicionais foram incluídas para avaliar os índices de ajuda diferencial entre os receptores de ajuda. Foram obtidos dados de identificação dos sujeitos por meio de uma Entrevista Inicial. Os dados coletados foram submetidos a análises quantitativas (frequências e ANOVAs). Os resultados revelaram que há diferença significativa no nível de julgamento moral pró-social de meninos(as) de rua e de escola (F[1,72] = 5.80; p< .05). Há, ainda, diferença significativa no índice de ajuda diferencial entre os receptores de ajuda (F[5,360]= 116.91; p<.OOI) e uma interação significativa de condição de vida e faixa etária (F[I,72]= 10.56; p<.Ol). Algumas análises extra-hipóteses foram realizadas, investigando a ocorrência e a clareza de expressão do julgamento moral pró-social. Os resultados são discutidos e comparados à literatura da área e a conclusão apresenta uma proposta para educação pró-social dos indivíduos aplicada à escola e às instituições de atendimento aos(às) meninos(as) de ruas.

ROCHA, T. A. Complexidade descritiva de classes de complexidade probabilísticas de tempo polinomial e das classes ⊕P e NP∩coNP através de lógicas com quantificadores de segunda ordem. 2014. 81 f. Dissertação (Mestrado em Ciência da Computação) - Centro de Ciências, Universidade Federal do Ceará, Fortaleza, 2014. / Submitted by Daniel Eduardo Alencar da Silva (dealencar.silva@gmail.com) on 2015-01-23T20:35:59Z No. of bitstreams: 1 2014_dis_tarocha.pdf: 600184 bytes, checksum: 8e317715dd15118a1061361a5251f08e (MD5) / Approved for entry into archive by Rocilda Sales(rocilda@ufc.br) on 2015-02-09T15:45:32Z (GMT) No. of bitstreams: 1 2014_dis_tarocha.pdf: 600184 bytes, checksum: 8e317715dd15118a1061361a5251f08e (MD5) / Made available in DSpace on 2015-02-09T15:45:32Z (GMT). No. of bitstreams: 1 2014_dis_tarocha.pdf: 600184 bytes, checksum: 8e317715dd15118a1061361a5251f08e (MD5) Previous issue date: 2014 / Many computable problems can be solved more efficiently or in a more natural way through probabilistic algorithms, which shows that the use of such algorithms is quite relevant in Computer Science. However, probabilistic algorithms may return a wrong answer with a certain probability. Also, the use of probabilistic algorithms does not solve problems that are not computable. In Computational Complexity, the complexity of a problem is characterized based on the amount of computational resources, such as space and time, needed to solve it. Problems that have the same complexity compose the same class. The computational complexity classes are related by a hierarchy. In Descriptive Complexity, a logic is used to express problems and capture computational complexity classes in order to express all and only the problems of this class. Thus, the complexity of a problem does not depend on physical factors, such as time and space, but only on the expressiveness of the logic that defines it. Important results of the area states that several classes of computational complexity can be characterized by a logic. For example, the class NP has been shown equivalent to the class of problems expressed by the existential fragment of Second-Order Logic. This close relationship between these areas allows some results about Logics to be transferred to Computational Complexity and vice versa. Despite of the importance of probabilistic algorithms and of Descriptive Complexity, there are few results on the characterization, by a logic, of probabilistic computational complexity classes. In this work, we show characterizations for each of the polinomial time probabilistic complexity classes. In our results, we use second-order generalized quantifiers to simulate the acceptance of the nondeterministic machines of these classes. We found Logical characterizations in the literature only for classes PP and BPP. In the first case, the logic employed was the first-order added by a quantifier most of second-order. With the approach established in this work, we obtain an alternative proof for the characterization of PP. With the same methodology, we also characterize the class ⊕P through a logic with a second-order parity quantifier. In the case of BPP , there was a result that used a logic with probabilistic semantics. Using our approach of generalized quantifiers, we obtain an alternative characterization for this class. With the same method, we were able to characterize the probabilistic semantic classes RP, coRP, ZPP and the semantic class NP ∩ coNP. Finally, we show an application of Descriptive Complexity results in the creation of algorithms from a logic specification. / Vários problemas computáveis podem ser resolvidos de maneira mais eficiente ou mais natural através de algoritmos probabilísticos, o que mostra que o uso de tais algoritmos é bastante relevante em computação. Entretanto, os algoritmos probabilísticos podem retornar uma resposta errada com uma certa probabilidade. Observe, ainda que o uso de algoritmos probabilísticos não resolve problemas não computáveis. A Complexidade Computacional caracteriza a complexidade de um problema a partir da quantidade de recursos computacionais, como espaço e tempo, para resolvê-lo. Problemas que tem a mesma complexidade compõem uma classe. As classes de complexidade computacional são relacionadas através de uma hierarquia. A Complexidade Descritiva usa lógicas para expressar os problemas e capturar classes de complexidade computacional no sentido de expressar todos, e apenas, os problemas desta classe. Dessa forma, a complexidade de um problema não depende de fatores físicos, como tempo e espaço, mas apenas da expressividade da lógica que o define. Resultados importantes da área mostraram que várias classes de complexidade computacional podem ser caracterizadas por lógicas. Por exemplo, a classe NP foi mostrada equivalente à classe dos problemas expressos pelo fragmento existencial da Lógica de Segunda Ordem. Este estreito relacionamento entre tais áreas permite que alguns resultados da área de Lógica sejam transferidos para a de Complexidade Computacional e vice-versa. Apesar da importância de algoritmos probabilísticos e da Complexidade Descritiva, existem poucos resultados de caracterização, por lógicas, das classes de complexidade computacional probabilísticas. Neste trabalho, buscamos mostrar caracterizações para cada uma das classes de complexidade probabilísticas de tempo polinomial. Nos nossos resultados, utilizamos quantificadores generalizados de segunda ordem para simular a aceitação das máquinas não-determinísticas dessas classes. Achamos caracterizações lógicas na literatura apenas para as classes PP e BPP. No primeiro caso, a lógica utilizada era a de primeira ordem adicionada de um quantificador maioria de segunda ordem. Com a abordagem criada neste trabalho, conseguimos obter uma prova alternativa para a caracterização de PP. Com essa mesma metodologia, também conseguimos caracterizar a classe ⊕P através de uma lógica com um quantificador de paridade. No caso de BPP, existia um resultado que utilizava uma lógica com semântica probabilística. Usando nossa abordagem de quantificadores generalizados, conseguimos obter uma caracterização alternativa para essa classe. Com o mesmo método, conseguimos caracterizar as classes probabilísticas semânticas RP, coRP, ZPP e a classe semântica NP∩coNP. Por fim, mostramos uma aplicação dos resultados de Complexidade Descritiva na criação de algoritmos através de uma especificação lógica.

No description available.