Work Environment Parameters and their Measurement

Tato bakalářská práce se zabývá parametry pracovního prostředí a jejich měřením. Pracovnímu prostředí se v dnešní době věnuje velká pozornost, protože výrazně ovlivňuje pohodu a výkony člověka. Jeho vhodnou optimalizací lze současně docílit výrazných ekonomických úspor a zvýšení komfortu pracujících osob.This bachelor thesis deals with the work environments parameters and their measurements. The work environment is being paid a lot of attention nowadays, because it significantly affects the comfort and work performance. With the suitable optimalisation we can achieve significant economic savings and increase the comfort of the employees.

Local spin operators for fermion simulations

Digital quantum simulation of fermionic systems is important in the context of chemistry and physics. Simulating fermionic models on general purpose quantum computers requires imposing a fermionic algebra on spins. The previously studied Jordan-Wigner and Bravyi-Kitaev transformations are two techniques for accomplishing this task. Here we re-examine an auxiliary fermion construction which maps fermionic operators to local operators on spins. The local simulation is performed by relaxing the requirement that the number of spins should match the number of fermionic modes. Instead, auxiliary modes are introduced to enable non-consecutive fermionic couplings to be simulated with constant low-rank tensor products on spins. We connect the auxiliary fermion construction to other topological models and give examples of the construction

Simple Communication Complexity Separation from Quantum State Antidistinguishability

A set of $n$ pure quantum states is called antidististinguishable if there exists an $n$-outcome measurement that never outputs the outcome `$k$' on the $k$-th quantum state. We describe sets of quantum states for which any subset of three states is antidistinguishable and use this to produce a two-player communication task that can be solved with $\log d$ qubits, but requires one-way communication of at least $\log (4/3) (d-1) - 1 \approx 0.415 (d-1) - 1$ classical bits. The advantages of the approach are that the proof is simple and self-contained -- not needing, for example, to rely on hard-to-establish prior results in combinatorics -- and that with slight modifications, non-trivial bounds can be established in any dimension $\geq 3$. The task can be framed in terms of the separated parties solving a relation, and the separation is also robust to multiplicative error in the output probabilities. We show, however, that for this particular task, the separation disappears if two-way classical communication is allowed. Finally, we state a conjecture regarding antidistinguishability of sets of states, and provide some supporting numerical evidence. If the conjecture holds, then there is a two-player communication task that can be solved with $\log d$ qubits, but requires one-way communication of $\Omega (d \log d)$ classical bits

A "problem of time" in the multiplicative scheme for the nn-site hopper

Quantum Measure Theory (QMT) is an approach to quantum mechanics, based on the path integral, in which quantum theory is conceived of as a generalised stochastic process. One of the postulates of QMT is that events with zero quantum measure do not occur, however this is not sufficient to give a full picture of the quantum world. Determining the other postulates is a work in progress and this paper investigates a proposal called the Multiplicative Scheme for QMT in which the physical world corresponds, essentially, to a set of histories from the path integral. This scheme is applied to Sorkin's $n$-site hopper, a discrete, unitary model of a single particle on a ring of $n$ sites, motivated by free Schr\"odinger propagation. It is shown that the multiplicative scheme's global features lead to the conclusion that no non-trivial, time-finite event can occur.Comment: 24 pages, 2 figures. Now published in J. Phys. A: Math. Theor. under CC-BY. New version expands section 3.1 and corrects typo

Synthesis of the C15-C20 tiacumicin fragment

V rámci předložené diplomové práce byla vypracována metoda přípravy nenasyceného C15-C20 fragmentu tiakumicinu, přírodní látky, která se řadí do skupiny makrolidových antibiotik. Ačkoliv byla syntéza této sloučeniny publikována v předešlých letech, tato práce přináší novou metodu její přípravy. Bylo využíváno katalytických reakcí místo stechiometrických. V druhé části této práce byla studována enantioselektivní allylace (E)-3-jod-2-methylpropenalu s využitím katalýzy série N,N'-dioxidových katalyzátorů. Asymetrická indukce této reakce přesahuje 99 % ee. Tento postup umožňuje relativně jednoduchou, přímočarou a efektivní přípravu celé řady přírodních látek. Klíčová slova tiakumicin, asymetrická syntéza, allylace, katalýza, chirální Lewisovy báze, organokatalýzaIn the diploma thesis, a method for preparation of the unsaturated C15-C20 tiacumicin fragment was developed. Tiacumicin is classified as a macrolidone antibiotic. Although three syntheses of tiacumicin have been recently published, this study has aimed to develop a novel pathway for its preparation utilizing catalytic reactions instead of stoichiometric ones. In the second part, an enantioselective allylation of (E)-3-jod-2-methylpropenal has been developed applying catalysis by a series of N,N'-dioxide catalysts. The asymmetric induction achieved in the allylation was up to 99% ee. This procedure allows relatively simple, straightforward and efficient preparation of wide range of natural products. Keywords tiacumicin, asymmetric synthesis, allylation, catalysis, chiral Lewis bases, organocatalysisKatedra organické chemieDepartment of Organic ChemistryFaculty of SciencePřírodovědecká fakult

Four wheeled mobile robot PLC control

Cílem této diplomové práce je navrhnout řízení čtyřkolového mobilního robotu z laboratoře A/731a pomocí PLC. Pro toto řešení musí být navržena a vyrobena elektronika, která bude provádět sběr a zpracování dat ze senzorů. Tato data budou zasílána do PLC, které bude podle těchto dat řídit robot. Konečné řešení bude prakticky demonstrováno.The aim of this diploma thesis is to implement the PLC control on existing four wheeled mobile robot from the laboratory A1/731a. For this solution has to be designed and made electronic equipment which will be gathering and processing the data from sensors. This data will be sent to the PLC which will be controlling the robot according to this data. The final solution will be practically demonstrated.

Probabilistic mixture-based image modelling

summary:During the last decade we have introduced probabilistic mixture models into image modelling area, which present highly atypical and extremely demanding applications for these models. This difficulty arises from the necessity to model tens thousands correlated data simultaneously and to reliably learn such unusually complex mixture models. Presented paper surveys these novel generative colour image models based on multivariate discrete, Gaussian or Bernoulli mixtures, respectively and demonstrates their major advantages and drawbacks on texture modelling applications. Our mixture models are restricted to represent two-dimensional visual information. Thus a measured 3D multi-spectral texture is spectrally factorized and corresponding multivariate mixture models are further learned from single orthogonal mono-spectral components and used to synthesise and enlarge these mono-spectral factor components. Texture synthesis is based on easy computation of arbitrary conditional distributions from the model. Finally single synthesised mono-spectral texture planes are transformed into the required synthetic multi-spectral texture. Such models can easily serve not only for texture enlargement but also for segmentation, restoration, and retrieval or to model single factors in unusually complex seven dimensional Bidirectional Texture Function (BTF) space models. The strengths and weaknesses of the presented discrete, Gaussian or Bernoulli mixture based approaches are demonstrated on several colour texture examples

Genetic Programming Based Approach Towards Understanding the Dynamics of Urban Rainfall-runoff Process

AbstractGenetic Programming (GP) is an evolutionary-algorithm based methodology that is the best suited to model non-linear dynamic systems. The potential of GP has not been exploited to the fullest extent in the field of hydrology to understand the complex dynamics involved. The state of the art applications of GP in hydrological modelling involve the use of GP as a short-term prediction and forecast tool rather than as a framework for the development of a better model that can handle current challenges. In today's scenario, with increasing monitoring programmes and computational power, the techniques like GP can be employed for the development and evaluation of hydrological models, balancing, prior information, model complexity, and parameter and output uncertainty. In this study, GP based data driven model in a single and multi-objective framework is trained to capture the dynamics of the urban rainfall-runoff process using a series of tanks, where each tank is a storage unit in a watershed that corresponds to varying depths below the surface. The hydro-meteorological data employed in this study belongs to the Kent Ridge catchment of National University Singapore, a small urban catchment (8.5 hectares) that receives a mean annual rainfall of 2500 mm and consists of all the major land uses of Singapore

Operator Locality in the Quantum Simulation of Fermionic Models

Simulating fermionic lattice models with qubits requires mapping fermionic degrees of freedom to qubits. The simplest method for this task, the Jordan-Wigner transformation, yields strings of Pauli operators acting on an extensive number of qubits. This overhead can be a hindrance to implementation of qubit-based quantum simulators, especially in the analog context. Here we thus review and analyze alternative fermion-to-qubit mappings, including the two approaches by Bravyi and Kitaev and the Auxiliary Fermion transformation. The Bravyi-Kitaev transform is reformulated in terms of a classical data structure and generalized to achieve a further locality improvement for local fermionic models on a rectangular lattice. We conclude that the most compact encoding of the fermionic operators can be done using ancilla qubits with the Auxiliary Fermion scheme. Without introducing ancillas, a variant of the Bravyi-Kitaev transform provides the most compact fermion-to-qubit mapping for Hubbard-like models