The dissertation is occupy with microbial settlement of black pepper, which is one of the world's most widely used spices. Characterizes each kind of pepper, discribe microorganisms occurring in spices and spice treatments. It also state legislative limits of microorganism occurrence. The practical part of this work deals with experimental determination of selected groups of microorganisms in black pepper. Analyzed samples of black pepper were purchased in business chains, sold under a known brand and private label and also in shops dealing only with spices and herbs. The results of the work shows that microbial contamination of spices is constantly decreasing and in most cases doesn’t exceed the allowed limits. The most contaminated sample belonged to private label samples, and the least contaminated sample belonged to wholesale spice distributors.

Continuous phase modulation (CPM) is often plagued by high receiver complexity. One successful method of dealing with this is the well-known pulse amplitude modulation (PAM) representation of CPM, which was first proposed by Laurent. It is shown that the PAM representation also applies to multi-h CPM and ternary CPM, two previously unconsidered cases. In both cases it is shown that many PAM components may be required to exactly represent the signal. This is especially true of partial-response systems where the memory of the signal is long. Therefore, approximations are proposed which require only a limited number of terms. These extensions of the PAM representation are used to construct reducedcomplexity detectors for CPM. These are generalizations of the detector first proposed by Kaleh. These detectors can be used in an optimal configuration, or in a suboptimal reduced-complexity configuration. The PAM complexity-reduction principle is shown explicitly. An exact expression is given for the pairwise error probability for the entire class of PAM-based CPM detectors, not just the extended cases proposed herein. The analysis is performed for the additive white Gaussian noise (AWGN) channel. The performance bound that results from this pairwise error probability is shown to be tighter than a previously published bound for PAM-based CPM detectors. The analysis shows that PAM-based detectors are a special case of the broad class of mismatched CPM detectors. However, it is shown that the metrics for PAM-based detectors accumulate distance in a different manner than metrics for other mismatched and suboptimal detectors. These distance properties are especially useful in applications with greatly reduced trellis sizes. The proposed detectors are included in two case studies. The first is for a multi-h CPM standard used in aeronautical telemetry. Many reduced-complexity detectors are studied in addition to PAM-based detectors. The second case study is for a ternary CPM known as shaped offset QPSK (SOQPSK). Here, the performance of serially concatenated coded SOQPSK is studied along with uncoded systems. It is shown that the coded systems achieve large gains over uncoded systems. However, the design proposed herein achieves these gains with less complexity than previously published designs.

Aeronautical telemetry systems that transmit the same signal through multiple antennas from the flight vehicle suffer from severe link dropouts when the signals destructively interfere one with another at receiver. The underlying issue is a transmit array with element spacing far greater than the wavelength producing a transmit antenna pattern with significant and deep nulls. Recently, space-time coding techniques have been proven to resolve the issue for systems using linear modulations and shaped-offset quadrature shift keying (SOQPSK) modulation, a non-linear continuous phase modulation (CPM). This thesis examines application of space-time coding techniques to resolve the self-interference issue for another CPM modulation, the advanced range telemetry (ARTM) CPM. It is shown in this thesis among the two branches of space-time coding, space-time block coding (STBC) and space-time trellis coding (STTC), only the latter offers a solution for a full rate, low complexity, no hardware modification implementation. Various candidate STTCs are identified via simulation using the pair-wise error probability as a performance metric. One STTC is identified with trivial implementation costs and an error performance that is a function of code length.

This thesis is devoted to market with Corporate performance management (CPM) tools. Due to the fact that the area of CPM tools is extensive, the thesis is focused mainly on financial consolidation. One of the goals of this thesis is to describe process of financial consolidation. There are used various consolidation tools today. Therefore, another goal of this thesis is to describe categories of tools and their basic characteristics.. The goals mentioned above are achieved by examining the available recourses and their subsequent connection to the desired whole which describes the consolidation process and categories of tools. The first part addresses the financial consolidation process, followed by commented research of sources, after which there is the part devoted to possible requirements for consolidation tools. The source of requirements is quoted literature and the own experience from the real project. The second part of this thesis is devoted to practical example in which the criteria for evaluation of consolidation tools are defined. There are evaluated two tools -- tool based on MS Excel and CPM tool Oracle Hyperion. The defined criteria are used to describe the difference between tools and to make overall evaluation. The output of this thesis is set of criteria under which are possible to evaluate tools. Another output of the thesis is performed analysis on selected tools. The main contribution of this thesis is created criteria and the process of creation of weights, followed by demonstration of the use of practical example. The criteria are based on the consolidation process and requirements described in theoretical part of the thesis.

<p>U tezi je predstavljena implementacija metode teorija funkcionala gustine (DFT) bazirana na metodi za sklapanje naelektrisanja (CPM) koja koristi bazise gausijanskih funkcija. Metod je baziran na pretpostavci da se elektronska gustina naelektrisanja velikih sistema, može predstaviti kao suma doprinosa pojedinačnih atoma, takozvanih motiva gustine naelektrisanja, koji se dobijaju računanjem malog prototip sistema. Talasna funkcija,<br />kao i gustina naelektrisanja, se u na&scaron;oj implementaciji reprezentuju uz pomoć bazise gausijanskih funkcija, dok se motivi opisuju kori&scaron;ćenjem prostornih koordinata. Uz pomoć procedure za minimizaciju se iz motiva opisanih koordinatama, dobija gustina naelektrisanja predstavljena u bazisu Gausijana. Implementacija serijskog programa pokazuje značajno pobolj&scaron;anje u performansama u odnosu na prethodne implementacije bazirane na ravnim talasima. Ova implementacija re&scaron;ava sistem od približno 1000 atoma na jednom procesorskom jezgru za svega nekoliko sati. Paralelna implementacija uz pomoć naprednih metoda paralelizacije i distribucije podataka omogućava re&scaron;avanje sistema od vi&scaron;e desetina hiljada atoma. Najveći testirani sistem ima približno<br />20000 atoma i testiran je na 256 paralelnih procesa.</p> / <p>We present the implementation of the density functional theory (DFT) based charge patching method (CPM) using the basis of Gaussian functions. The method is based on the assumption that the electronic charge density of a large system is the sum of contributions of individual atoms, so called charge density motifs, that are obtained from calculations of small prototype systems.In our implementation wave functions and electronic charge density are represented using the basis of Gaussian functions, while charge density motifs are represented using a real space grid. A constrained minimization procedure is used to obtain Gaussian basis representation of charge density from real space representation of motifs. The code based on this&nbsp; implementation exhibits superior performance in comparison to previous implementation of the charge patching method using the basis of plane waves. It enables calculations of electronic structure of systems with around 1000 atoms on a single CPU core with computational time of just several hours. The parallel implementation enables calculations for the system with more than ten thousand atoms. The largest system tested has around 20000 atoms and was computed on 256 parallel processes.</p>

This paper attempts to evaluate Training for Trainers (T4T) as an aid for developing healthy and sustained church planting movements (CPMs). The thesis is that Training for Trainers (T4T) can enable and sustain (by the Spirit’s power) healthy church planting movements because a discipleship process is built into the methodology that develops believers in their personal and communal growth and equips them to repeat the process with other individuals they reach. The very format of the T4T process provides a context for developing disciples inwardly and training disciples to minister outwardly. The T4T process continues over the course of months and years to systematically move believers through the essential stages of sustained church planting movements: Bridges in conversations with the lost from non-spiritual topics to the gospel in order to find those God is preparing (knowing whom to talk to and how to start) • Reproducible evangelism methods that are effective in the local context and can be learned by any new believer • Reproducible discipleship that addresses both short-term and long-term spiritual growth in a manner appropriate to the local worldview and able to be passed on by a new believer • Reproducible church models appropriate to the local context and able to be led and passed on by new believers • Leadership development and multiplication patterns that develop leaders rapidly in the context of ministry and enable the number of leaders to keep pace with the number of new churches. T4T moves each new generation of disciples (trainers) and churches through this process because it casts vision for and gives loving accountability for disciples to truly become trainers of others. It does this primarily through a three-thirds training process. T4T is training for trainers who will train trainers who will train trainers. T4T attempts to initiate movements of God in which at least four generations of new disciples and churches emerge. This paper evaluates T4T is based on case studies, survey instruments and biblical principles and then offers recommendations for CPM practitioners. / Christian Spirituality, Church History & Missiology / D. Th.(Missiology)

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / O gerenciamento do tempo nos projetos de construção civil usualmente utiliza algoritmos determinísticos para o cálculo dos prazos de finalização e algoritmos PERT para avaliação da probabilidade de o mesmo terminar até uma determinada data. Os resultados calculados pelos algoritmos tradicionais possuem defasagens nos prazos se comparados aos encontrados na realidade o que vem fazendo com que a simulação venha se tornando uma ferramenta cada vez mais utilizada no gerenciamento de projetos. O objetivo da dissertação é estudar o problema dos prazos de finalização dos projetos desenvolvendo novas técnicas de cálculo que reflitam melhor os prazos encontrados na vida real. A partir disso é criada uma ferramenta prática de gerenciamento do tempo de atividades de projetos de construção enxuta baseada em planilha eletrônica onde serão utilizadas técnicas de simulação a eventos discretos, com base em distribuições de probabilidade como, por exemplo, a distribuição beta. / Time management in construction projects usually use deterministic algorithms to calculate the time of fulfillment, and PERT algorithms to evaluate the probability of such project ending by a certain date. The results achieved by traditional algorithms are not accurate when compared to those found in the field, which is increasing the use of simulation as a tool in project management. The aim of this dissertation is to study the deadline fulfillment problems of projects, developing new calculation techniques that better represent the deadlines found in real life. For such study is developed a practical tool for time management of lean construction projects based on spreadsheet which will be used discrete event simulation techniques based in probability distributions, such as, the beta distribution.

L'utilisation de la modulation à phase continue (CPM) est particulièrement intéressante lorsque le canal de communication comporte une forte non-linéarité et un support spectral limité, en particulier pour la voie aller, lorsque l'on dispose d'un amplificateur par porteuse à bord du satellite, et pour la voie retour où le terminal d'émission travaille à saturation. De nombreuses études ont été effectuées sur le sujet mais les solutions proposées reposent sur la démodulation/décodage itératif des CPM couplées à un code correcteur d'erreur de type convolutif ou bloc. L'utilisation de codes LDPC n'a pas été à ce jour abordée de façon précise. En particulier, il n'existe pas à notre connaissance de travaux sur l'optimisation des codes basés sur des graphes creux adaptés à ce type de schémas. Dans cette étude, nous proposons d'effectuer l'analyse asymptotique et le design d'un schéma Turbo-CPM basé sur des graphes creux. Une étude du récepteur associé comportant les fonctions de démodulation sera également effectuée. / The use of the continuous phase modulation (CPM) is interesting when the channel represents a strong non-linearity and in the case of limited spectral support; particularly for the uplink, where the satellite holds an amplifier per carrier, and for downlinks where the terminal equipment works very close to the saturation region. Numerous studies have been conducted on this issue but the proposed solutions use iterative CPM demodulation/decoding concatenated with convolutional or block error correcting codes. The use of LDPC codes has not yet been introduced. Particularly, no works, to our knowledge, have been done on the optimization of sparse graph-based codes adapted for the context described here. In this study, we propose to perform the asymptotic analysis and the design of turbo-CPM systems based on the optimization of sparse graph-based codes. Moreover, an analysis on the corresponding receiver will be done.

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / O gerenciamento do tempo nos projetos de construção civil usualmente utiliza algoritmos determinísticos para o cálculo dos prazos de finalização e algoritmos PERT para avaliação da probabilidade de o mesmo terminar até uma determinada data. Os resultados calculados pelos algoritmos tradicionais possuem defasagens nos prazos se comparados aos encontrados na realidade o que vem fazendo com que a simulação venha se tornando uma ferramenta cada vez mais utilizada no gerenciamento de projetos. O objetivo da dissertação é estudar o problema dos prazos de finalização dos projetos desenvolvendo novas técnicas de cálculo que reflitam melhor os prazos encontrados na vida real. A partir disso é criada uma ferramenta prática de gerenciamento do tempo de atividades de projetos de construção enxuta baseada em planilha eletrônica onde serão utilizadas técnicas de simulação a eventos discretos, com base em distribuições de probabilidade como, por exemplo, a distribuição beta. / Time management in construction projects usually use deterministic algorithms to calculate the time of fulfillment, and PERT algorithms to evaluate the probability of such project ending by a certain date. The results achieved by traditional algorithms are not accurate when compared to those found in the field, which is increasing the use of simulation as a tool in project management. The aim of this dissertation is to study the deadline fulfillment problems of projects, developing new calculation techniques that better represent the deadlines found in real life. For such study is developed a practical tool for time management of lean construction projects based on spreadsheet which will be used discrete event simulation techniques based in probability distributions, such as, the beta distribution.

Les modulations à phase continue (CPMs) sont des méthodes de modulations robuste à la noncohérence du canal de propagation. Dans un contexte spatial, les CPM sont utilisées dans la chaîne de transmission de télémesure de la fusée. Depuis les années 70, la modulation la plus usitée dans les systèmes de télémesures est la modulation CPFSK continuous phase frequency shift keying filtrée. Historiquement, ce type de modulation est concaténée avec un code ReedSolomon (RS) afin d'améliorer le processus de décodage. Côté récepteur, les séquences CPM non-cohérentes sont démodulées par un détecteur Viterbi à sortie dure et un décodeur RS. Néanmoins, le gain du code RS n'est pas aussi satisfaisant que des techniques de codage moderne capables d'atteindre la limite de Shannon. Actualiser la chaîne de communication avec des codes atteignant la limite de Shannon tels que les codes en graphe creux, implique deremanier l’architecture du récepteur usuel pour un détecteur à sortie souple. Ainsi, on propose dans cette étude d' élaborer un détecteur treillis à sortie souple pour démoduler les séquences CPM non-cohérentes. Dans un deuxième temps, on concevra des schémas de pré-codages améliorant le comportement asymptotique du récepteur non-cohérent et dans une dernière étape on élabora des codes de parité à faible densité (LDPC) approchant la limite de Shannon. / Continuous phase modulations (CPM) are modulation methods robust to the non-coherency of propagation channels. In a space context, CPMs are used in the communication link between the rocket and the base stations. Since the 70's, the most popular telemetry modulation is the filtered continuous phase frequency shift keying (CPFSK). Traditionally, the CPFSK scheme isconcatenated with a Reed-Solomon (RS) code to enhance the decoding process. At the receiver side, the non-coherent CPM sequences are demodulated through a hard Viterbi detector and a RS decoder. However, the RS's coding gain is no more satisfactory when directly compared to modern coding schemes enable to reach the Shannon limit. Updating the communication link to capacity achieving codes, as sparse graph codes, implies to redesign the receiver architecture to soft detector. In that respect, we propose in this study to design a trellis-based soft detector to demodulate non-coherent CPM sequences. In a second part, we will elaborate precoding schemes to improve the asymptotic behaviour of the non-coherent receiver and in a last step we will build low density parity check codes approaching the Shannon limit.