We investigate power graphs of quasigroups. The power graph of a quasigroup takes the elements of the quasigroup as its vertices, and there is an edge from one element to a second distinct element when the second is a left power of the first. We first compute the power graphs of small quasigroups (up to four elements). Next we describe quasigroups whose power graphs are directed paths, directed cycles, in-stars, out-stars, and empty. We do so by specifying partial Cayley tables, which cannot always be completed in small examples. We then consider sinks in the power graph of a quasigroup, as subquasigroups give rise to sinks. We show that certain structures cannot occur as sinks in the power graph of a quasigroup. More generally, we show that certain highly connected substructures must have edges leading out of the substructure. We briefly comment on power graphs of Bol loops.

Nela Dvořáková 19.7.2019 1 Abstract We study a representative of a diverse group of stars exhibiting the B[e] phe- nomenon, designated MWC 939. This object might be an important link be- tween the stage of the asymptotic giant branch and planetary nebula stage as it is one of a few such objects observed. Our focus is aimed at spectral analysis of the circumstellar matter around the central star. We assemble a line list for MWC 939 and observe variations of its spectrum. Electron density and temper- ature are estimated using nebular diagnostics of ratios of [S II] λλ 6716, 6731 ˚A and [O I] λλ 6300, 6364 ˚A and 5577 ˚A. These estimates are then used for detailed calculations of the structure of circumstellar envelope. 1

This paper presents calculations for forbidden emission-line profile shapes arising from colliding wind binaries. The main application is for systems involving a Wolf–Rayet (WR) star and an OB star companion. The WR wind is assumed to dominate the forbidden line emission. The colliding wind interaction is treated as an Archimedean spiral with an inner boundary. Under the assumptions of the model, the major findings are as follows. (i) The redistribution of the WR wind as a result of the wind collision is not flux conservative but typically produces an excess of line emission; however, this excess is modest at around the 10 per cent level. (ii) Deviations from a flat-toped profile shape for a spherical wind are greatest for viewing inclinations that are more nearly face-on to the orbital plane. At intermediate viewing inclinations, profiles display only mild deviations from a flat-toped shape. (iii) The profile shape can be used to constrain the colliding wind bow shock opening angle. (iv) Structure in the line profile tends to be suppressed in binaries of shorter periods. (v) Obtaining data for multiple forbidden lines is important since different lines probe different characteristic radial scales. Our models are discussed in relation to Infrared Space Observatory data for WR 147 and γ Vel (WR 11). The lines for WR 147 are probably not accurate enough to draw firm conclusions. For γ Vel, individual line morphologies are broadly reproducible but not simultaneously so for the claimed wind and orbital parameters. Overall, the effort demonstrates how lines that are sensitive to the large-scale wind can help to deduce binary system properties and provide new tests of numerical simulations.

A number of strong infrared forbidden lines have been observed in several evolved Wolf–Rayet (WR) star winds, and these are important for deriving metal abundances and testing stellar evolution models. In addition, because these optically thin lines form at large radius in the wind, their resolved profiles carry an imprint of the asymptotic structure of the wind flow. This work presents model forbidden line profile shapes formed in axisymmetric winds. It is well known that an optically thin emission line formed in a spherical wind expanding at constant velocity yields a flat-topped emission profile shape. Simulated forbidden lines are produced for a model stellar wind with an axisymmetric density distribution that treats the latitudinal ionization self-consistently and examines the influence of the ion stage on the profile shape. The resulting line profiles are symmetric about line centre. Within a given atomic species, profile shapes can vary between centrally peaked, doubly peaked, and approximately flat-topped in appearance depending on the ion stage (relative to the dominant ion) and viewing inclination. Although application to WR star winds is emphasized, the concepts are also relevant to other classes of hot stars such as luminous blue variables and Be/B[e] stars.

Combinatorial Group Testing (CGT) is a process of identifying faulty interactions (“errors”) within a particular set of items. Error Locating Arrays (ELAs) are combinatorial designs that can be built from Covering Arrays (CAs) to not only cover all errors in a system (each involving up to a certain number of items), but to locate and identify the errors as well. In this thesis, we survey known results for CGT, as well as CAs, ELAs, and some other types of related arrays. More importantly, we give several new results. First, we give a new algorithm that can be used to test a system in which each component (factor) has two options (values), and at most two errors are present. We show that, for systems with at most two errors, our algorithm improves upon a related algorithm by Mart´ınez et al. in terms of both robustness and efficiency. Second, we give the first adaptive CGT algorithm that can identify, among a given set of k items, all faulty interactions involving up to three items. We then compare it, performance-wise, to current-best nonadaptive method that can identify faulty interactions involving up to three items. We also give the first adaptive ELA-building algorithm that can identify all faulty interactions involving up to three items when safe values are known. Both of our new algorithms are generalizations of ones previously given by Mart´ınez et al. for identifying all faulty interactions involving up to two items.

Combinatorial Group Testing (CGT) is a process of identifying faulty interactions (“errors”) within a particular set of items. Error Locating Arrays (ELAs) are combinatorial designs that can be built from Covering Arrays (CAs) to not only cover all errors in a system (each involving up to a certain number of items), but to locate and identify the errors as well. In this thesis, we survey known results for CGT, as well as CAs, ELAs, and some other types of related arrays. More importantly, we give several new results. First, we give a new algorithm that can be used to test a system in which each component (factor) has two options (values), and at most two errors are present. We show that, for systems with at most two errors, our algorithm improves upon a related algorithm by Mart´ınez et al. in terms of both robustness and efficiency. Second, we give the first adaptive CGT algorithm that can identify, among a given set of k items, all faulty interactions involving up to three items. We then compare it, performance-wise, to current-best nonadaptive method that can identify faulty interactions involving up to three items. We also give the first adaptive ELA-building algorithm that can identify all faulty interactions involving up to three items when safe values are known. Both of our new algorithms are generalizations of ones previously given by Mart´ınez et al. for identifying all faulty interactions involving up to two items.

Combinatorial Group Testing (CGT) is a process of identifying faulty interactions (“errors”) within a particular set of items. Error Locating Arrays (ELAs) are combinatorial designs that can be built from Covering Arrays (CAs) to not only cover all errors in a system (each involving up to a certain number of items), but to locate and identify the errors as well. In this thesis, we survey known results for CGT, as well as CAs, ELAs, and some other types of related arrays. More importantly, we give several new results. First, we give a new algorithm that can be used to test a system in which each component (factor) has two options (values), and at most two errors are present. We show that, for systems with at most two errors, our algorithm improves upon a related algorithm by Mart´ınez et al. in terms of both robustness and efficiency. Second, we give the first adaptive CGT algorithm that can identify, among a given set of k items, all faulty interactions involving up to three items. We then compare it, performance-wise, to current-best nonadaptive method that can identify faulty interactions involving up to three items. We also give the first adaptive ELA-building algorithm that can identify all faulty interactions involving up to three items when safe values are known. Both of our new algorithms are generalizations of ones previously given by Mart´ınez et al. for identifying all faulty interactions involving up to two items.

The title of the thesis is forbidden means and ways of conducting armed conflicts. Obviously, this topic is too broad, so thesis is focused on the issue of chemical and biological weapons. These devices are among the weapons of mass destruction and undoubtedly pose one of the major dangers of the contemporary world. The overall goal of this work is to provide perspective on the issue of chemical and biological weapons from a historical perspective and particularly from a perspective of the international law. International legal documents are viewed in historical and political context. Through this analysis of international treaties, we can "effectively" consider their impacts and responses in a "real world". The first part of the thesis serves as a historical introduction with some interesting chapters from early history of chemical and biological weapons. The second part deals with the birth of these weapons in a new and modern form in the 19th century. Great attention is paid to the period of the World War I. It was in this global conflict in which chemical weapons were used in their modern form and in the most massive form at the same time. In next chapters, this thesis examines how chemical and biological weapons and their international legal regulation evolved during the 20th century,...

The principle of equal treatment and non-discrimination in labor relations Abstract This dissertation focuses on the analysis of the legal regulation of the Czech Republic containing the principle of equal treatment of employees and the prohibition of their discrimination in labor relations. The other objective is to compare the legal regulations of other European Union Member States and to apply the principle of equal treatment and non- discrimination in practice, including the abundant case law of The Court of Justice of the European Union, the European Court of Human Rights and the less case law of the Czech courts. The content of this dissertation above all is an introduction of the principle of equal treatment and non- discrimination, differentiation of material and formal equality including specification of individual discriminatory reasons and an introduction of the most important legal sources in the international legislation, standards of the European anti-discriminatory law and domestic legal adjustment. Another part describes the rules of equal treatment and the ban of discrimination applied in real life in the area of remuneration in terms of rewarding somebody the same amount for the work of same value, and a possibility of achieving a functional or other types of promotion without...

Orientador: José Plínio de Oliveira Santos / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matemática Estatística e Computação Científica / Made available in DSpace on 2018-08-25T10:24:33Z (GMT). No. of bitstreams: 1 FeresJunior_Jorge_M.pdf: 656533 bytes, checksum: f89557654d48cebb7328f9f5ebbc8d0f (MD5) Previous issue date: 2014 / Resumo: Nesta dissertação estudamos permutações que evitam determinados padrões. Mais especificamente, nosso foco é a contagem de tais permutações. Dentre as várias formas de descrever uma permutação, adotamos a ''representação posicional em linha'', apresentando um tratamento sistemático nesta área de padrão proibido, estudando operações, simetrias, estruturas, transformações, e principalmente, técnicas de contagem para este fim / Abstract: In this dissertation, we study permutations avoiding certain patterns. More specifically, our focus is on counting such permutations. Among the many ways to describe a permutation, we adopted the "positional representation in line" presenting a systematic treatment of this area of forbidden pattern, studying operations, symmetries, structures, transformations, and especially counting techniques for this purpose / Mestrado / Matematica Aplicada / Mestre em Matemática Aplicada